{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -3 for x in xs if 11 <= x <= 17)", "tests": ["assert between_times([8, 11, 10, 2, 6]) == [-33]", "assert between_times([2, 28, 36, 53, 12, 20]) == [-36]", "assert between_times([34, 25, -29, 55, 9, -13, 23, 58, 37, -14]) == []", "assert between_times([-14, -23, -24, 22, 36, 60, 22, 49, -15]) == []", "assert between_times([]) == []", "assert between_times([38, 16, 12, 26, -23, 47, -1, 41, 25]) == [-48, -36]", "assert between_times([-23, 17]) == [-51]", "assert between_times([]) == []"], "test_code": "assert between_times([8, 11, 10, 2, 6]) == [-33]\nassert between_times([2, 28, 36, 53, 12, 20]) == [-36]\nassert between_times([34, 25, -29, 55, 9, -13, 23, 58, 37, -14]) == []\nassert between_times([-14, -23, -24, 22, 36, 60, 22, 49, -15]) == []\nassert between_times([]) == []\nassert between_times([38, 16, 12, 26, -23, 47, -1, 41, 25]) == [-48, -36]\nassert between_times([-23, 17]) == [-51]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -3 for x in xs if 11 <= x <= 17)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -3 for x in xs if 11 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 11 و17 (شاملًا الطرفين) في -3.\nمثال: `between_times([8, 11, 10, 2, 6])` يجب أن تُرجع `[-33]`.\nالجواب:", "qhash": "a27a629418a958c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_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 running_sum([32, 35, 15, 42, 3, 6, 23, 16, 16]) == [32, 67, 0, 42, 45, 51, 74, 0, 16]", "assert running_sum([]) == []", "assert running_sum([20, 21, 27, 67, 33, 67]) == [20, 41, 68, 0, 33, 0]", "assert running_sum([34, 21, 64]) == [34, 55, 0]", "assert running_sum([]) == []", "assert running_sum([38, 63, -7, 69, 76]) == [38, 0, -7, 62, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([32, 35, 15, 42, 3, 6, 23, 16, 16]) == [32, 67, 0, 42, 45, 51, 74, 0, 16]\nassert running_sum([]) == []\nassert running_sum([20, 21, 27, 67, 33, 67]) == [20, 41, 68, 0, 33, 0]\nassert running_sum([34, 21, 64]) == [34, 55, 0]\nassert running_sum([]) == []\nassert running_sum([38, 63, -7, 69, 76]) == [38, 0, -7, 62, 0]\nassert running_sum([]) == []", "answer": "def running_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 running_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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 80 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([32, 35, 15, 42, 3, 6, 23, 16, 16])` يجب أن تُرجع `[32, 67, 0, 42, 45, 51, 74, 0, 16]`.\nالجواب:", "qhash": "49ff19bcb8f96792"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ج')", "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('مكتبة نور تفاحة سوق وردة سيارة') == 0", "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('مكتبة نور تفاحة سوق وردة سيارة') == 0\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)` بحيث تُعيد عدد مرات ظهور الحرف «ج» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('قلم عربية قمر عمل طائرة مدينة سفينة علم')` يُرجع `0`.\nالجواب:", "qhash": "912e559f5e4d386d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('قهوة حاسوب') == 1", "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('قهوة حاسوب') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ح»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('باب كتاب طالب قهوة نهر برتقال')` يُرجع `0`.\nالجواب:", "qhash": "4ab52172273f5de8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -6 * x ** 2 + (3) * x + (-4)", "tests": ["assert p(9) == -463", "assert p(-19) == -2227", "assert p(14) == -1138", "assert p(0) == -4", "assert p(-5) == -169", "assert p(3) == -49", "assert p(7) == -277", "assert p(0) == -4"], "test_code": "assert p(9) == -463\nassert p(-19) == -2227\nassert p(14) == -1138\nassert p(0) == -4\nassert p(-5) == -169\nassert p(3) == -49\nassert p(7) == -277\nassert p(0) == -4", "answer": "def p(x):\n return -6 * x ** 2 + (3) * x + (-4)", "completion": " ```python\ndef p(x):\n return -6 * x ** 2 + (3) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -6x² + 3x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(9)` يُرجع `-463`.\nالجواب:", "qhash": "7261a3c33f13e155"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -8 * x ** 2 + (1) * x + (1)", "tests": ["assert poly(8) == -503", "assert poly(-10) == -809", "assert poly(15) == -1784", "assert poly(-10) == -809", "assert poly(-11) == -978", "assert poly(-5) == -204", "assert poly(10) == -789", "assert poly(0) == 1"], "test_code": "assert poly(8) == -503\nassert poly(-10) == -809\nassert poly(15) == -1784\nassert poly(-10) == -809\nassert poly(-11) == -978\nassert poly(-5) == -204\nassert poly(10) == -789\nassert poly(0) == 1", "answer": "def poly(x):\n return -8 * x ** 2 + (1) * x + (1)", "completion": " ```python\ndef poly(x):\n return -8 * x ** 2 + (1) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -8x² + 1x + 1 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `-503`.\nالجواب:", "qhash": "0ea7501336e5bdd7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "ab896bcd9e09f596"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 2:\n return 2\n return 1 * f(n - 1) + -1\n\nprint(f(3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 2:\n return 2\n return 1 * f(n - 1) + -1\n\nprint(f(3))\n```\nالجواب:", "qhash": "617ef90cdbcdb826", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 18 <= x <= 41)", "tests": ["assert in_range_scaled([19, 49, 18, 23, 31, 22]) == [-62, -46, -44, -38, -36]", "assert in_range_scaled([43, 29, 2, 53, 39, 46, 50, 27]) == [-78, -58, -54]", "assert in_range_scaled([-26, 7, -6, 46, 52, 17, 49]) == []", "assert in_range_scaled([3, -12, 57, -4, 33, 6, -27]) == [-66]", "assert in_range_scaled([35, 58, 46]) == [-70]", "assert in_range_scaled([]) == []", "assert in_range_scaled([12, -21]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([19, 49, 18, 23, 31, 22]) == [-62, -46, -44, -38, -36]\nassert in_range_scaled([43, 29, 2, 53, 39, 46, 50, 27]) == [-78, -58, -54]\nassert in_range_scaled([-26, 7, -6, 46, 52, 17, 49]) == []\nassert in_range_scaled([3, -12, 57, -4, 33, 6, -27]) == [-66]\nassert in_range_scaled([35, 58, 46]) == [-70]\nassert in_range_scaled([]) == []\nassert in_range_scaled([12, -21]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 18 <= x <= 41)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 18 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 18 و41 (شاملًا الطرفين) في -2.\nمثال: `in_range_scaled([19, 49, 18, 23, 31, 22])` يجب أن تُرجع `[-62, -46, -44, -38, -36]`.\nالجواب:", "qhash": "9d7190bb0cd065c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 20\nfor x in range(-3, 12, 4):\n acc += x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 20\nfor x in range(-3, 12, 4):\n acc += x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "42b31c67a6e1920c", "answer": "116\n9", "completion": " الناتج:\n```text\n116\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_matching([38, 43, 54, 69, 38, 86, 14, 39, 61, 43]) == 0", "assert count_matching([86, -29, -29, 6, 53]) == 0", "assert count_matching([81, -14]) == 0", "assert count_matching([-18, -33, 56, 86]) == 0", "assert count_matching([79, 0, 11]) == 0", "assert count_matching([-29, 39, 36, 70, 11, -25, 18, -15, -22]) == 3", "assert count_matching([]) == 0"], "test_code": "assert count_matching([38, 43, 54, 69, 38, 86, 14, 39, 61, 43]) == 0\nassert count_matching([86, -29, -29, 6, 53]) == 0\nassert count_matching([81, -14]) == 0\nassert count_matching([-18, -33, 56, 86]) == 0\nassert count_matching([79, 0, 11]) == 0\nassert count_matching([-29, 39, 36, 70, 11, -25, 18, -15, -22]) == 3\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([38, 43, 54, 69, 38, 86, 14, 39, 61, 43])` يُرجع `0`.\nالجواب:", "qhash": "65d977f655cf4b18"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'خالد': 25, 'حسن': 26, 'سلمى': 28, 'علي': 31}\npoints['سلمى'] += 10\npoints['يوسف'] = 48\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 = {'خالد': 25, 'حسن': 26, 'سلمى': 28, 'علي': 31}\npoints['سلمى'] += 10\npoints['يوسف'] = 48\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": "c52eff4ec40380ec", "answer": "5\nيوسف\n168\n[('خالد', 25), ('حسن', 26)]", "completion": " الناتج:\n```text\n5\nيوسف\n168\n[('خالد', 25), ('حسن', 26)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [37, 3, 1, 38, 31, 26]\nprint(lst[1:5])\nprint(lst[::-2])\nprint(len(lst[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [37, 3, 1, 38, 31, 26]\nprint(lst[1:5])\nprint(lst[::-2])\nprint(len(lst[1:5]))\n```\nالجواب:", "qhash": "2b909645a1bfc19a", "answer": "[3, 1, 38, 31]\n[26, 38, 3]\n4", "completion": " الناتج:\n```text\n[3, 1, 38, 31]\n[26, 38, 3]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 0) // 4 for x in range(-2, 7) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 0) // 4 for x in range(-2, 7) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "974a28133a3d0331", "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": "while_loop", "template": "p_while#1", "code": "n = 4171\ncount = 0\nwhile n > 16:\n n = n // 7\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 4171\ncount = 0\nwhile n > 16:\n n = n // 7\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "2972b993fd46a6c7", "answer": "12 3", "completion": " الناتج:\n```text\n12 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 4 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(8) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue']", "assert label_numbers(18) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'RedBlue', '17', 'Red']", "assert label_numbers(1) == ['1']", "assert label_numbers(5) == ['1', 'Red', '3', 'RedBlue', '5']", "assert label_numbers(4) == ['1', 'Red', '3', 'RedBlue']"], "test_code": "assert label_numbers(8) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue']\nassert label_numbers(18) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'RedBlue', '17', 'Red']\nassert label_numbers(1) == ['1']\nassert label_numbers(5) == ['1', 'Red', '3', 'RedBlue', '5']\nassert label_numbers(4) == ['1', 'Red', '3', 'RedBlue']", "answer": "def label_numbers(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 label_numbers(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سؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Red'، وإن قَبِلها على 4 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(8)` يُرجع `['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue']`.\nالجواب:", "qhash": "1a7924ec3abb8088"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -2 * x ** 2 + (4) * x + (-5)", "tests": ["assert evaluate(10) == -165", "assert evaluate(18) == -581", "assert evaluate(-18) == -725", "assert evaluate(-17) == -651", "assert evaluate(-8) == -165", "assert evaluate(-6) == -101", "assert evaluate(-8) == -165", "assert evaluate(0) == -5"], "test_code": "assert evaluate(10) == -165\nassert evaluate(18) == -581\nassert evaluate(-18) == -725\nassert evaluate(-17) == -651\nassert evaluate(-8) == -165\nassert evaluate(-6) == -101\nassert evaluate(-8) == -165\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n return -2 * x ** 2 + (4) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n return -2 * x ** 2 + (4) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -2x² + 4x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(10)` يُرجع `-165`.\nالجواب:", "qhash": "81642708ecb57e9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(29) == ['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', '26', '27', '28', '29']", "assert fizz(6) == ['1', '2', '3', '4', '5', 'Tic']", "assert fizz(6) == ['1', '2', '3', '4', '5', 'Tic']", "assert fizz(12) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic']", "assert fizz(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 fizz(29) == ['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', '26', '27', '28', '29']\nassert fizz(6) == ['1', '2', '3', '4', '5', 'Tic']\nassert fizz(6) == ['1', '2', '3', '4', '5', 'Tic']\nassert fizz(12) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic']\nassert fizz(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 fizz(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 fizz(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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(29)` يُرجع `['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', '26', '27', '28', '29']`.\nالجواب:", "qhash": "9d5a9147bb5ef44c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "tests": ["assert power_sum(5) == 165", "assert power_sum(6) == 273", "assert power_sum(9) == 855", "assert power_sum(12) == 1950", "assert power_sum(10) == 1155", "assert power_sum(1) == 3", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 165\nassert power_sum(6) == 273\nassert power_sum(9) == 855\nassert power_sum(12) == 1950\nassert power_sum(10) == 1155\nassert power_sum(1) == 3\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `power_sum(5)` يُرجع `165`.\nالجواب:", "qhash": "22b6a31e10934529"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(760959063))\nprint(f(f(760959063)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(760959063))\nprint(f(f(760959063)))\n```\nالجواب:", "qhash": "c6a86bf4500f77af", "answer": "45\n9", "completion": " الناتج:\n```text\n45\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'brain_winter'\nprint(text.upper())\nprint(text.replace('b', '*'))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'brain_winter'\nprint(text.upper())\nprint(text.replace('b', '*'))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "c67919ef9fb772b4", "answer": "BRAIN_WINTER\n*rain_winter\nBrain_winter", "completion": " الناتج:\n```text\nBRAIN_WINTER\n*rain_winter\nBrain_winter\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-27, -4, 18, 36, -17, 28]) == 36", "assert best_multiple([-6, -15, -6]) == -6", "assert best_multiple([1]) == None", "assert best_multiple([10, -2, -26, -22, 8, -33]) == -33", "assert best_multiple([-36, 13, 45, -21]) == 45", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-27, -4, 18, 36, -17, 28]) == 36\nassert best_multiple([-6, -15, -6]) == -6\nassert best_multiple([1]) == None\nassert best_multiple([10, -2, -26, -22, 8, -33]) == -33\nassert best_multiple([-36, 13, 45, -21]) == 45\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(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مثال: `best_multiple([-27, -4, 18, 36, -17, 28])` يجب أن تُرجع `36`.\nالجواب:", "qhash": "8fa726e7615fad6c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([25, 49, 5, 23, -20]) == None", "assert biggest_mult([-55, -44, -44]) == -44", "assert biggest_mult([1, 12, 23]) == None", "assert biggest_mult([23]) == None", "assert biggest_mult([3, 32, 2, -7, -14, 23, 36, 28]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([25, 49, 5, 23, -20]) == None\nassert biggest_mult([-55, -44, -44]) == -44\nassert biggest_mult([1, 12, 23]) == None\nassert biggest_mult([23]) == None\nassert biggest_mult([3, 32, 2, -7, -14, 23, 36, 28]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `biggest_mult([25, 49, 5, 23, -20])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "e8fb0d18b35550b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert words_reversed('of coffee cloud on orange it') == 'orange,coffee'", "assert words_reversed('pixel winter data python by it') == 'python,winter'", "assert words_reversed('vector in') == 'vector'", "assert words_reversed('is') == ''", "assert words_reversed('') == ''", "assert words_reversed('') == ''", "assert words_reversed('orange engine it rocket music') == 'rocket,engine,orange'"], "test_code": "assert words_reversed('of coffee cloud on orange it') == 'orange,coffee'\nassert words_reversed('pixel winter data python by it') == 'python,winter'\nassert words_reversed('vector in') == 'vector'\nassert words_reversed('is') == ''\nassert words_reversed('') == ''\nassert words_reversed('') == ''\nassert words_reversed('orange engine it rocket music') == 'rocket,engine,orange'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `words_reversed('of coffee cloud on orange it')` يجب أن تُرجع `'orange,coffee'`.\nالجواب:", "qhash": "8c35d0ac506924aa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + 3 for x in range(3, 8) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + 3 for x in range(3, 8) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "59b68000f968fba5", "answer": "[3]\n1 3", "completion": " الناتج:\n```text\n[3]\n1 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'ش' in w)", "tests": ["assert letter_count('ليل سفينة بحر') == 0", "assert letter_count('معلم مدينة جمل قهوة حصان') == 0", "assert letter_count('رمل لغة بيت تفاحة مطر') == 0", "assert letter_count('حصان حاسوب باب نهر نهر طائرة نور ماء') == 0", "assert letter_count('بيت شجرة باب جمل كتاب') == 1", "assert letter_count('') == 0", "assert letter_count('بحر برتقال') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('ليل سفينة بحر') == 0\nassert letter_count('معلم مدينة جمل قهوة حصان') == 0\nassert letter_count('رمل لغة بيت تفاحة مطر') == 0\nassert letter_count('حصان حاسوب باب نهر نهر طائرة نور ماء') == 0\nassert letter_count('بيت شجرة باب جمل كتاب') == 1\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('ليل سفينة بحر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "2612440a7008fa0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -7 <= x <= 7)", "tests": ["assert in_range_scaled([-11, -2, 12, -15, 9, -16, 9]) == [-6]", "assert in_range_scaled([21, -25, 5, -18, 10]) == [15]", "assert in_range_scaled([9, 57, 53, 18]) == []", "assert in_range_scaled([9, -5, 9, 8, 1, 47, -10, -20, -4, 21]) == [-15, -12, 3]", "assert in_range_scaled([13, -27, 53, -21, 41, 47, -5, 17, 44]) == [-15]", "assert in_range_scaled([32]) == []", "assert in_range_scaled([32]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-11, -2, 12, -15, 9, -16, 9]) == [-6]\nassert in_range_scaled([21, -25, 5, -18, 10]) == [15]\nassert in_range_scaled([9, 57, 53, 18]) == []\nassert in_range_scaled([9, -5, 9, 8, 1, 47, -10, -20, -4, 21]) == [-15, -12, 3]\nassert in_range_scaled([13, -27, 53, -21, 41, 47, -5, 17, 44]) == [-15]\nassert in_range_scaled([32]) == []\nassert in_range_scaled([32]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -7 <= x <= 7)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -7 <= x <= 7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -7 ≤ x ≤ 7، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([-11, -2, 12, -15, 9, -16, 9])` يُرجع `[-6]`.\nالجواب:", "qhash": "ca7842e24b7e5b15"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('كتاب مكتبة برمجة بحر حاسوب قلم') == 1", "assert prefix_hits('كتاب برمجة لغة سوق تفاحة') == 1", "assert prefix_hits('جبل سيارة جمل') == 0", "assert prefix_hits('جبل مطر دفتر صديق') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('رمل ميناء شمس سوق كتاب كتاب مكتبة') == 2\nassert prefix_hits('وردة ليل حاسوب') == 0\nassert prefix_hits('كتاب مكتبة برمجة بحر حاسوب قلم') == 1\nassert prefix_hits('كتاب برمجة لغة سوق تفاحة') == 1\nassert prefix_hits('جبل سيارة جمل') == 0\nassert prefix_hits('جبل مطر دفتر صديق') == 0\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 w.endswith('ك'):\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 w.endswith('ك'):\n count += 1\n return count\n```\nمثال: `prefix_hits('رمل ميناء شمس سوق كتاب كتاب مكتبة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "fb13f18bfbb241b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "words_starting", "reference": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert words_starting('نهار رمل نور باب فجر عمل') == 1", "assert words_starting('عربية تفاحة برمجة معلم') == 1", "assert words_starting('مطر بيت مدرسة صحراء خبز نهر') == 1", "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('عربية تفاحة برمجة معلم') == 1\nassert words_starting('مطر بيت مدرسة صحراء خبز نهر') == 1\nassert words_starting('مطر برتقال جمل مدرسة باب تفاحة سفينة') == 2\nassert words_starting('سلام كتاب') == 0\nassert words_starting('قلم لغة مكتبة') == 0\nassert words_starting('') == 0", "answer": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ب'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(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 words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ب'):\n count += 1\n return count\n```\nمثال: `words_starting('نهار رمل نور باب فجر عمل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "6ad4f2542f5c834f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [28, 28, 30, 17, 18, 25]\nprint(xs[3:5])\nprint(xs[::3])\nprint(min(xs[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [28, 28, 30, 17, 18, 25]\nprint(xs[3:5])\nprint(xs[::3])\nprint(min(xs[3:5]))\n```\nالجواب:", "qhash": "39f234defa4c74db", "answer": "[17, 18]\n[28, 17]\n17", "completion": " الناتج:\n```text\n[17, 18]\n[28, 17]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 0:\n return 3\n return 2 * rec(n - 1) + 4\n\nprint(rec(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 0:\n return 3\n return 2 * rec(n - 1) + 4\n\nprint(rec(6))\n```\nالجواب:", "qhash": "ebcc7f573d38e8a9", "answer": "444", "completion": " الناتج:\n```text\n444\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 7 for x in range(-4, 8) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 7 for x in range(-4, 8) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "827a2b654046244c", "answer": "[-3, -3, 29]\n3 23", "completion": " الناتج:\n```text\n[-3, -3, 29]\n3 23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['table', 'river', 'code', 'planet', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['table', 'river', 'code', 'planet', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "fc355cc3da01670c", "answer": "['code', 'table', 'river', 'planet', 'window']\n['window', 'planet', 'table']", "completion": " الناتج:\n```text\n['code', 'table', 'river', 'planet', 'window']\n['window', 'planet', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'desert'\nprint(text.find('e'))\nprint(text[::-1])\nprint(text.index('e') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'desert'\nprint(text.find('e'))\nprint(text[::-1])\nprint(text.index('e') + len(text))\n```\nالجواب:", "qhash": "be6feeb52cb42a1a", "answer": "1\ntresed\n7", "completion": " الناتج:\n```text\n1\ntresed\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'ليل'\nprint(s.replace(' ', '-'))\nprint('ب' in s)\nprint(s.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'ليل'\nprint(s.replace(' ', '-'))\nprint('ب' in s)\nprint(s.count('ب'))\n```\nالجواب:", "qhash": "05e89456dfa0a085", "answer": "ليل\nFalse\n0", "completion": " الناتج:\n```text\nليل\nFalse\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 54) == 1)", "tests": ["assert count_coprime(25) == 9", "assert count_coprime(130) == 43", "assert count_coprime(156) == 52", "assert count_coprime(159) == 53", "assert count_coprime(80) == 27", "assert count_coprime(89) == 30", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(25) == 9\nassert count_coprime(130) == 43\nassert count_coprime(156) == 52\nassert count_coprime(159) == 53\nassert count_coprime(80) == 27\nassert count_coprime(89) == 30\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 54، أي أن القاسم المشترك الأكبر لها مع 54 يساوي 1.\nمثال: `count_coprime(25)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "a1b51c9f4548bdde"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -8 * x ** 2 + (6) * x + (4)", "tests": ["assert evaluate(5) == -166", "assert evaluate(-7) == -430", "assert evaluate(-4) == -148", "assert evaluate(-20) == -3316", "assert evaluate(4) == -100", "assert evaluate(1) == 2", "assert evaluate(2) == -16", "assert evaluate(0) == 4"], "test_code": "assert evaluate(5) == -166\nassert evaluate(-7) == -430\nassert evaluate(-4) == -148\nassert evaluate(-20) == -3316\nassert evaluate(4) == -100\nassert evaluate(1) == 2\nassert evaluate(2) == -16\nassert evaluate(0) == 4", "answer": "def evaluate(x):\n return -8 * x ** 2 + (6) * x + (4)", "completion": " ```python\ndef evaluate(x):\n return -8 * x ** 2 + (6) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -8x² + 6x + 4 عند العدد الصحيح x.\nمثال: `evaluate(5)` يجب أن تُرجع `-166`.\nالجواب:", "qhash": "1c59f1e92619b6ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 6", "tests": ["assert sum_digit_pow(2607) == 3", "assert sum_digit_pow(910927) == 4", "assert sum_digit_pow(416772) == 3", "assert sum_digit_pow(224842) == 4", "assert sum_digit_pow(209179) == 4", "assert sum_digit_pow(98986) == 4", "assert sum_digit_pow(124464) == 3", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(2607) == 3\nassert sum_digit_pow(910927) == 4\nassert sum_digit_pow(416772) == 3\nassert sum_digit_pow(224842) == 4\nassert sum_digit_pow(209179) == 4\nassert sum_digit_pow(98986) == 4\nassert sum_digit_pow(124464) == 3\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 6", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 6.\nللتوضيح: الاستدعاء `sum_digit_pow(2607)` يُرجع `3`.\nالجواب:", "qhash": "0b41269a48d88cd1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 8) // 4 for x in range(-1, 9) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 8) // 4 for x in range(-1, 9) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "06a6944ffadf5fc3", "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": "math", "template": "w_coprime#1", "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, 77) == 1)", "tests": ["assert phi_upto(136) == 106", "assert phi_upto(41) == 33", "assert phi_upto(101) == 79", "assert phi_upto(189) == 147", "assert phi_upto(117) == 92", "assert phi_upto(11) == 9", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(136) == 106\nassert phi_upto(41) == 33\nassert phi_upto(101) == 79\nassert phi_upto(189) == 147\nassert phi_upto(117) == 92\nassert phi_upto(11) == 9\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, 77) == 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, 77) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 77) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(136)` يُرجع `106`.\nالجواب:", "qhash": "842fce5f432a0bed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'مدينة'\nprint(kalima[0])\nprint(kalima.find('م'))\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'مدينة'\nprint(kalima[0])\nprint(kalima.find('م'))\nprint(len(kalima))\n```\nالجواب:", "qhash": "405974df91f53b52", "answer": "م\n0\n5", "completion": " الناتج:\n```text\nم\n0\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "how_many", "reference": "def how_many(text):\n return sum(1 for w in text.split() if w.startswith('س'))", "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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «س»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('حديقة رمل سوق جبل')` يُرجع `1`.\nالجواب:", "qhash": "4d13eb74acec2320"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(12))\n```\nالجواب:", "qhash": "f860416744499630", "answer": "843", "completion": " الناتج:\n```text\n843\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 3 for x in range(3, 9) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 3 for x in range(3, 9) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "db12ec4b324ed8cc", "answer": "[13, 61]\n2 74", "completion": " الناتج:\n```text\n[13, 61]\n2 74\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 9\nfor i in range(-2, 21, 4):\n total -= i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 9\nfor i in range(-2, 21, 4):\n total -= i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "3582c9ac0810bbae", "answer": "-279\n18", "completion": " الناتج:\n```text\n-279\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'dm'}", "tests": ["assert char_counts('falcon we signal planet light window') == {'d': 1, 'm': 0}", "assert char_counts('matrix matrix') == {'d': 0, 'm': 2}", "assert char_counts('table apple') == {'d': 0, 'm': 0}", "assert char_counts('stone table table rocket coffee river') == {'d': 0, 'm': 0}", "assert char_counts('up rocket') == {'d': 0, 'm': 0}", "assert char_counts('orange') == {'d': 0, 'm': 0}", "assert char_counts('') == {'d': 0, 'm': 0}"], "test_code": "assert char_counts('falcon we signal planet light window') == {'d': 1, 'm': 0}\nassert char_counts('matrix matrix') == {'d': 0, 'm': 2}\nassert char_counts('table apple') == {'d': 0, 'm': 0}\nassert char_counts('stone table table rocket coffee river') == {'d': 0, 'm': 0}\nassert char_counts('up rocket') == {'d': 0, 'm': 0}\nassert char_counts('orange') == {'d': 0, 'm': 0}\nassert char_counts('') == {'d': 0, 'm': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'dm'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'dm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'm' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('falcon we signal planet light window')` يُرجع `{'d': 1, 'm': 0}`.\nالجواب:", "qhash": "ce2397c42f593ac6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ف'))", "tests": ["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('صحراء برمجة قهوة كتاب فجر مكتبة') == 1", "assert letter_count('') == 0"], "test_code": "assert 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('صحراء برمجة قهوة كتاب فجر مكتبة') == 1\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ف'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ف'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_count(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ف»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('طالب بيت سوق حصان')` يُرجع `0`.\nالجواب:", "qhash": "eaa410b1a413fa0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سوق مكتبة سلام') == 0", "assert count_prefix('نهار لغة ليل طائرة نهر') == 2", "assert count_prefix('سيارة ليل نهار نهر لغة برمجة علم') == 2", "assert count_prefix('ماء بيت لغة فجر خبز وردة لغة برمجة') == 2", "assert count_prefix('قهوة قهوة مطر شجرة نهار فجر ليل ليل') == 2", "assert count_prefix('ليل تفاحة نور نهار معلم') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('سوق مكتبة سلام') == 0\nassert count_prefix('نهار لغة ليل طائرة نهر') == 2\nassert count_prefix('سيارة ليل نهار نهر لغة برمجة علم') == 2\nassert count_prefix('ماء بيت لغة فجر خبز وردة لغة برمجة') == 2\nassert count_prefix('قهوة قهوة مطر شجرة نهار فجر ليل ليل') == 2\nassert count_prefix('ليل تفاحة نور نهار معلم') == 1\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('سوق مكتبة سلام')` يُرجع `0`.\nالجواب:", "qhash": "29248261c733d9c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert rotate_by([4, 25, 8, 3]) == [3, 4, 25, 8]", "assert rotate_by([30, 38, -8, -8, 31]) == [-8, -8, 31, 30, 38]", "assert rotate_by([-8, 9, 47, 46, -6, 43, 7, 23, -2, 25, 18]) == [23, -2, 25, 18, -8, 9, 47, 46, -6, 43, 7]", "assert rotate_by([50]) == [50]", "assert rotate_by([41, -2, 15, 49, -9, 43, -2, 46, 50, 31, 22, 22]) == [46, 50, 31, 22, 22, 41, -2, 15, 49, -9, 43, -2]", "assert rotate_by([-6, 23, 23, 11]) == [11, -6, 23, 23]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([4, 25, 8, 3]) == [3, 4, 25, 8]\nassert rotate_by([30, 38, -8, -8, 31]) == [-8, -8, 31, 30, 38]\nassert rotate_by([-8, 9, 47, 46, -6, 43, 7, 23, -2, 25, 18]) == [23, -2, 25, 18, -8, 9, 47, 46, -6, 43, 7]\nassert rotate_by([50]) == [50]\nassert rotate_by([41, -2, 15, 49, -9, 43, -2, 46, 50, 31, 22, 22]) == [46, 50, 31, 22, 22, 41, -2, 15, 49, -9, 43, -2]\nassert rotate_by([-6, 23, 23, 11]) == [11, -6, 23, 23]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return ____\n```\nمثال: `rotate_by([4, 25, 8, 3])` يجب أن تُرجع `[3, 4, 25, 8]`.\nالجواب:", "qhash": "7999b86dcb4c70fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [11, 7, 40, 24, 33, -6, 10, 16]\nprint(a[1:5])\nprint(a[::-1])\nprint(sum(a[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [11, 7, 40, 24, 33, -6, 10, 16]\nprint(a[1:5])\nprint(a[::-1])\nprint(sum(a[1:5]))\n```\nالجواب:", "qhash": "e46d4c71a3310833", "answer": "[7, 40, 24, 33]\n[16, 10, -6, 33, 24, 40, 7, 11]\n104", "completion": " الناتج:\n```text\n[7, 40, 24, 33]\n[16, 10, -6, 33, 24, 40, 7, 11]\n104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [15, 38, 35, 28, 20, 19, 20]\nprint(items[0:5])\nprint(items[::-1])\nprint(max(items[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [15, 38, 35, 28, 20, 19, 20]\nprint(items[0:5])\nprint(items[::-1])\nprint(max(items[0:5]))\n```\nالجواب:", "qhash": "12f653b24a4d0722", "answer": "[15, 38, 35, 28, 20]\n[20, 19, 20, 28, 35, 38, 15]\n38", "completion": " الناتج:\n```text\n[15, 38, 35, 28, 20]\n[20, 19, 20, 28, 35, 38, 15]\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 14:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([4, 7, 1, 9, 9, 5, 1]) == [4, 11, 12, 0, 9, 14, 0]", "assert acc_reset([]) == []", "assert acc_reset([14, -10, 12, -9, -10, 6, 8]) == [14, 4, 0, -9, -19, -13, -5]", "assert acc_reset([-6, 12, -2, 2, 0, -4, -2, 0]) == [-6, 6, 4, 6, 6, 2, 0, 0]", "assert acc_reset([1, 8, -10, 1, 9, 2, 3]) == [1, 9, -1, 0, 9, 11, 14]", "assert acc_reset([-10, 8, -4, 7, 5, 2, -2, 0, 1]) == [-10, -2, -6, 1, 6, 8, 6, 6, 7]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([4, 7, 1, 9, 9, 5, 1]) == [4, 11, 12, 0, 9, 14, 0]\nassert acc_reset([]) == []\nassert acc_reset([14, -10, 12, -9, -10, 6, 8]) == [14, 4, 0, -9, -19, -13, -5]\nassert acc_reset([-6, 12, -2, 2, 0, -4, -2, 0]) == [-6, 6, 4, 6, 6, 2, 0, 0]\nassert acc_reset([1, 8, -10, 1, 9, 2, 3]) == [1, 9, -1, 0, 9, 11, 14]\nassert acc_reset([-10, 8, -4, 7, 5, 2, -2, 0, 1]) == [-10, -2, -6, 1, 6, 8, 6, 6, 7]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 14:\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 > 14:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 14 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([4, 7, 1, 9, 9, 5, 1])` يجب أن تُرجع `[4, 11, 12, 0, 9, 14, 0]`.\nالجواب:", "qhash": "bc59060d485f8fc0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 4 for x in range(6, 12) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 4 for x in range(6, 12) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "4e3679c98db4bb7e", "answer": "[60, 117]\n2 177", "completion": " الناتج:\n```text\n[60, 117]\n2 177\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.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('لغة طالب') == 0", "assert count_initial('تفاحة كتاب مكتبة ماء قلم نهر') == 2", "assert count_initial('معلم جبل قمر قهوة سوق صديق معلم') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('صحراء حديقة عربية حصان') == 0\nassert count_initial('تفاحة فجر بحر عمل تفاحة برمجة') == 0\nassert count_initial('سلام باب دفتر تفاحة لغة مدرسة بحر') == 1\nassert count_initial('لغة طالب') == 0\nassert count_initial('تفاحة كتاب مكتبة ماء قلم نهر') == 2\nassert count_initial('معلم جبل قمر قهوة سوق صديق معلم') == 2\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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 count_initial(line):\n count = 0\n for w in line:\n if w.startswith('م'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('صحراء حديقة عربية حصان')` يُرجع `0`.\nالجواب:", "qhash": "8e53a9d6eea4fedd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('جبل دفتر صديق سيارة برمجة وردة مكتبة') == 1", "assert begin_count('شجرة جبل سوق جبل دفتر') == 1", "assert begin_count('شجرة سوق دفتر') == 1", "assert begin_count('معلم طالب دفتر تفاحة طائرة') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('دفتر سفينة بيت وردة وردة نور') == 1\nassert begin_count('سيارة فجر مدينة') == 0\nassert begin_count('جبل دفتر صديق سيارة برمجة وردة مكتبة') == 1\nassert begin_count('شجرة جبل سوق جبل دفتر') == 1\nassert begin_count('شجرة سوق دفتر') == 1\nassert begin_count('معلم طالب دفتر تفاحة طائرة') == 1\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 w.endswith('د'):\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 w.endswith('د'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('دفتر سفينة بيت وردة وردة نور')` يُرجع `1`.\nالجواب:", "qhash": "8bf57a4c3edbe531"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 71", "tests": ["assert digits_mod(95025) == 17", "assert digits_mod(272976) == 53", "assert digits_mod(300984) == 60", "assert digits_mod(416449) == 35", "assert digits_mod(123234) == 25", "assert digits_mod(749076) == 64", "assert digits_mod(977672) == 24", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(95025) == 17\nassert digits_mod(272976) == 53\nassert digits_mod(300984) == 60\nassert digits_mod(416449) == 35\nassert digits_mod(123234) == 25\nassert digits_mod(749076) == 64\nassert digits_mod(977672) == 24\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 71", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 71.\nمثال: `digits_mod(95025)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "b3f9b46c8b7c91c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [20, 39, 28, 15, -9, 22, -6, 2, -5]\nprint(a[2:5])\nprint(a[::-2])\nprint(len(a[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [20, 39, 28, 15, -9, 22, -6, 2, -5]\nprint(a[2:5])\nprint(a[::-2])\nprint(len(a[2:5]))\n```\nالجواب:", "qhash": "547b1250a12bfc68", "answer": "[28, 15, -9]\n[-5, -6, -9, 28, 20]\n3", "completion": " الناتج:\n```text\n[28, 15, -9]\n[-5, -6, -9, 28, 20]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'جبل مكتبة'\nprint(text.find('م'))\nprint(text.split())\nprint('م' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'جبل مكتبة'\nprint(text.find('م'))\nprint(text.split())\nprint('م' in text)\n```\nالجواب:", "qhash": "9c1bd5b2100831b3", "answer": "4\n['جبل', 'مكتبة']\nTrue", "completion": " الناتج:\n```text\n4\n['جبل', 'مكتبة']\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 13810\nsteps = 0\nwhile n > 12:\n n = n // 8\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 13810\nsteps = 0\nwhile n > 12:\n n = n // 8\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "d2c7ab494aad9988", "answer": "3 4", "completion": " الناتج:\n```text\n3 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "tests": ["assert sum_powers(3) == 294", "assert sum_powers(5) == 2937", "assert sum_powers(10) == 75999", "assert sum_powers(13) == 267813", "assert sum_powers(7) == 14028", "assert sum_powers(1) == 3", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 294\nassert sum_powers(5) == 2937\nassert sum_powers(10) == 75999\nassert sum_powers(13) == 267813\nassert sum_powers(7) == 14028\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 ** 4\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 4\n return total\n```\nمثال: `sum_powers(3)` يجب أن تُرجع `294`.\nالجواب:", "qhash": "0abb84c15e3279b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(19))\nprint(compute(19, -10))\nprint(compute(compute(-10), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(19))\nprint(compute(19, -10))\nprint(compute(compute(-10), 19))\n```\nالجواب:", "qhash": "02d8a0238e5c133e", "answer": "-103\n-85\n-145", "completion": " الناتج:\n```text\n-103\n-85\n-145\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [6, 17, 20, -4, 5, 14, 10, 12, 30]\nprint(a[1:2])\nprint(a[::2])\nprint(min(a[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [6, 17, 20, -4, 5, 14, 10, 12, 30]\nprint(a[1:2])\nprint(a[::2])\nprint(min(a[1:2]))\n```\nالجواب:", "qhash": "70743f9ae7e08ede", "answer": "[17]\n[6, 20, 5, 10, 30]\n17", "completion": " الناتج:\n```text\n[17]\n[6, 20, 5, 10, 30]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'رنا': 24, 'زينب': 35, 'منى': 25, 'وليد': 16}\npoints['منى'] += 16\npoints['ليلى'] = 22\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('هدى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'رنا': 24, 'زينب': 35, 'منى': 25, 'وليد': 16}\npoints['منى'] += 16\npoints['ليلى'] = 22\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('هدى', -1))\n```\nالجواب:", "qhash": "716a824187f3df74", "answer": "5\nمنى\n138\n-1", "completion": " الناتج:\n```text\n5\nمنى\n138\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 110\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 = 110\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": "b58f7fd706d88408", "answer": "113", "completion": " الناتج:\n```text\n113\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(28) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun', '19', 'Moon', 'Sun', '22', '23', 'Sun', '25', '26', 'Sun', '28']", "assert game(0) == []", "assert game(11) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11']", "assert game(18) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun']", "assert game(18) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun']"], "test_code": "assert game(28) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun', '19', 'Moon', 'Sun', '22', '23', 'Sun', '25', '26', 'Sun', '28']\nassert game(0) == []\nassert game(11) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11']\nassert game(18) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun']\nassert game(18) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', '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 % 10 == 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 % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Sun'، وعلى 10 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(28)` يجب أن تُرجع `['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'Sun', '19', 'Moon', 'Sun', '22', '23', 'Sun', '25', '26', 'Sun', '28']`.\nالجواب:", "qhash": "f1deac918e1725ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-27, 59, -4, 40, 58, -5]) == 58", "assert biggest_mult([-6, -6, -4]) == -4", "assert biggest_mult([1, 3, 5, 7]) == None", "assert biggest_mult([39, 15, -25, 7, 18, -22, -22, 20]) == 20", "assert biggest_mult([-27, 10, 1, 41, 7, 10, 46]) == 46", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-27, 59, -4, 40, 58, -5]) == 58\nassert biggest_mult([-6, -6, -4]) == -4\nassert biggest_mult([1, 3, 5, 7]) == None\nassert biggest_mult([39, 15, -25, 7, 18, -22, -22, 20]) == 20\nassert biggest_mult([-27, 10, 1, 41, 7, 10, 46]) == 46\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 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 % 2 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([-27, 59, -4, 40, 58, -5])` يُرجع `58`.\nالجواب:", "qhash": "d8f20dd9d5233660"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "tests": ["assert sum_multiples(271) == 5805", "assert sum_multiples(137) == 1485", "assert sum_multiples(149) == 1629", "assert sum_multiples(234) == 4050", "assert sum_multiples(124) == 1224", "assert sum_multiples(68) == 357", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(271) == 5805\nassert sum_multiples(137) == 1485\nassert sum_multiples(149) == 1629\nassert sum_multiples(234) == 4050\nassert sum_multiples(124) == 1224\nassert sum_multiples(68) == 357\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 % 15 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(271)` يُرجع `5805`.\nالجواب:", "qhash": "922f72b444f5a15e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'سلمى': 17, 'هدى': 28, 'حسن': 36, 'عمر': 9, 'أحمد': 3}\npoints['هدى'] += 1\npoints['منى'] = 3\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 = {'سلمى': 17, 'هدى': 28, 'حسن': 36, 'عمر': 9, 'أحمد': 3}\npoints['هدى'] += 1\npoints['منى'] = 3\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": "8e50abfc9ddd98f4", "answer": "6\nحسن\n97\n[('أحمد', 3), ('منى', 3)]", "completion": " الناتج:\n```text\n6\nحسن\n97\n[('أحمد', 3), ('منى', 3)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 40) == 1)", "tests": ["assert rel_prime_count(37) == 15", "assert rel_prime_count(100) == 40", "assert rel_prime_count(141) == 57", "assert rel_prime_count(83) == 34", "assert rel_prime_count(122) == 49", "assert rel_prime_count(7) == 3", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(37) == 15\nassert rel_prime_count(100) == 40\nassert rel_prime_count(141) == 57\nassert rel_prime_count(83) == 34\nassert rel_prime_count(122) == 49\nassert rel_prime_count(7) == 3\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, 40) == 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, 40) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 40، أي أن القاسم المشترك الأكبر لها مع 40 يساوي 1.\nمثال: `rel_prime_count(37)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "87a0eaa4ae51396a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ع' in w)", "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('طائرة مدرسة عربية تفاحة قلم') == 1", "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('طائرة مدرسة عربية تفاحة قلم') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ع» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('ليل لغة كتاب فجر فجر')` يُرجع `0`.\nالجواب:", "qhash": "f84794e888bd9bd2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if 'و' in w)", "tests": ["assert tally_letter('بيت صحراء جبل كتاب نور حديقة') == 1", "assert tally_letter('مطر سيارة قمر خبز قهوة طائرة') == 1", "assert tally_letter('شجرة ليل نهار وردة حصان قهوة صديق عربية') == 2", "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('بيت صحراء جبل كتاب نور حديقة') == 1\nassert tally_letter('مطر سيارة قمر خبز قهوة طائرة') == 1\nassert tally_letter('شجرة ليل نهار وردة حصان قهوة صديق عربية') == 2\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 'و' 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('بيت صحراء جبل كتاب نور حديقة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "df4036b643532aac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(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 largest_div([35, -6, -20, -24, 57, -19, 51]) == -24", "assert largest_div([-40, -32, -8]) == -8", "assert largest_div([1, 9, 17, 25]) == None", "assert largest_div([23, -21, 14, 26, -28, -11, 8]) == 8", "assert largest_div([-42, -22, 14, -1, -31, -6, 46]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([35, -6, -20, -24, 57, -19, 51]) == -24\nassert largest_div([-40, -32, -8]) == -8\nassert largest_div([1, 9, 17, 25]) == None\nassert largest_div([23, -21, 14, 26, -28, -11, 8]) == 8\nassert largest_div([-42, -22, 14, -1, -31, -6, 46]) == None\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(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للتوضيح: الاستدعاء `largest_div([35, -6, -20, -24, 57, -19, 51])` يُرجع `-24`.\nالجواب:", "qhash": "f91b71db02a77d44"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'gn'}", "tests": ["assert count_chars('go summer code in vector') == {'g': 1, 'n': 1}", "assert count_chars('falcon garden brain a a we') == {'g': 1, 'n': 3}", "assert count_chars('we it camel music desert') == {'g': 0, 'n': 0}", "assert count_chars('garden on') == {'g': 1, 'n': 2}", "assert count_chars('falcon stone an it vector matrix') == {'g': 0, 'n': 3}", "assert count_chars('music python winter planet window') == {'g': 0, 'n': 4}", "assert count_chars('') == {'g': 0, 'n': 0}"], "test_code": "assert count_chars('go summer code in vector') == {'g': 1, 'n': 1}\nassert count_chars('falcon garden brain a a we') == {'g': 1, 'n': 3}\nassert count_chars('we it camel music desert') == {'g': 0, 'n': 0}\nassert count_chars('garden on') == {'g': 1, 'n': 2}\nassert count_chars('falcon stone an it vector matrix') == {'g': 0, 'n': 3}\nassert count_chars('music python winter planet window') == {'g': 0, 'n': 4}\nassert count_chars('') == {'g': 0, 'n': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'gn'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'gn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('go summer code in vector')` يجب أن تُرجع `{'g': 1, 'n': 1}`.\nالجواب:", "qhash": "3b1ad2b0190da270"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'مكتبة سفينة'\nprint(w.find('ف'))\nprint(len(w))\nprint(w.count('ف'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'مكتبة سفينة'\nprint(w.find('ف'))\nprint(len(w))\nprint(w.count('ف'))\n```\nالجواب:", "qhash": "013a655d2045d948", "answer": "7\n11\n1", "completion": " الناتج:\n```text\n7\n11\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'سلمى': 36, 'راشد': 11, 'وليد': 42, 'يوسف': 49, 'باسل': 46}\nmarks['يوسف'] += 18\nmarks['مريم'] = 13\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 = {'سلمى': 36, 'راشد': 11, 'وليد': 42, 'يوسف': 49, 'باسل': 46}\nmarks['يوسف'] += 18\nmarks['مريم'] = 13\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": "273490abd185b506", "answer": "6\nيوسف\n215\n[('راشد', 11), ('مريم', 13)]", "completion": " الناتج:\n```text\n6\nيوسف\n215\n[('راشد', 11), ('مريم', 13)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 295\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 = 295\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": "2cef1d508081b8e7", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if 13 <= x <= 21)", "tests": ["assert between_times([5, 13, 8, 30, 10, 17, 10, 23, 26, 16]) == [13, 16, 17]", "assert between_times([-4, 25, -4, 25, 43, -12]) == []", "assert between_times([-16, 6, 60, 7, 2, 2, 38, 6, 21, 55]) == [21]", "assert between_times([16, -5, 16, -6]) == [16, 16]", "assert between_times([-29, 32, 24, 8, -12]) == []", "assert between_times([-19, -29, 34, -2, -15, 11, -28, -5, 31]) == []", "assert between_times([53, -4, 29, -10, 52, -19, 14, 57, -14]) == [14]", "assert between_times([]) == []"], "test_code": "assert between_times([5, 13, 8, 30, 10, 17, 10, 23, 26, 16]) == [13, 16, 17]\nassert between_times([-4, 25, -4, 25, 43, -12]) == []\nassert between_times([-16, 6, 60, 7, 2, 2, 38, 6, 21, 55]) == [21]\nassert between_times([16, -5, 16, -6]) == [16, 16]\nassert between_times([-29, 32, 24, 8, -12]) == []\nassert between_times([-19, -29, 34, -2, -15, 11, -28, -5, 31]) == []\nassert between_times([53, -4, 29, -10, 52, -19, 14, 57, -14]) == [14]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if 13 <= x <= 21)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if 13 <= x <= 21)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 13 و21 (شاملًا الطرفين) في 1.\nمثال: `between_times([5, 13, 8, 30, 10, 17, 10, 23, 26, 16])` يجب أن تُرجع `[13, 16, 17]`.\nالجواب:", "qhash": "c58dbdeee02467c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ا')", "tests": ["assert count_hits('طالب سلام صحراء رمل مدرسة كتاب حديقة قمر') == 4", "assert count_hits('سفينة عربية حديقة سلام سماء سماء نهر طائرة') == 4", "assert count_hits('مدرسة طالب سلام جبل سوق') == 2", "assert count_hits('رمل') == 0", "assert count_hits('دفتر نهر') == 0", "assert count_hits('ليل قلم سلام سيارة طائرة مكتبة سماء') == 4", "assert count_hits('قلم نور صحراء برمجة') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('طالب سلام صحراء رمل مدرسة كتاب حديقة قمر') == 4\nassert count_hits('سفينة عربية حديقة سلام سماء سماء نهر طائرة') == 4\nassert count_hits('مدرسة طالب سلام جبل سوق') == 2\nassert count_hits('رمل') == 0\nassert count_hits('دفتر نهر') == 0\nassert count_hits('ليل قلم سلام سيارة طائرة مكتبة سماء') == 4\nassert count_hits('قلم نور صحراء برمجة') == 1\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('طالب سلام صحراء رمل مدرسة كتاب حديقة قمر')` يجب أن تُرجع `4`.\nالجواب:", "qhash": "60eb85dc159fde66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert sum_div(161) == 2106", "assert sum_div(38) == 126", "assert sum_div(29) == 60", "assert sum_div(251) == 5166", "assert sum_div(254) == 5418", "assert sum_div(228) == 4218", "assert sum_div(1) == 0"], "test_code": "assert sum_div(161) == 2106\nassert sum_div(38) == 126\nassert sum_div(29) == 60\nassert sum_div(251) == 5166\nassert sum_div(254) == 5418\nassert sum_div(228) == 4218\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(161)` يُرجع `2106`.\nالجواب:", "qhash": "a68765d4831d5d8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('stone table to we at') == ''", "assert rev_join('') == ''", "assert rev_join('camel apple orange') == 'orange'", "assert rev_join('by we light light brain python to') == 'python'", "assert rev_join('river orange winter') == 'winter/orange'", "assert rev_join('') == ''", "assert rev_join('stone') == ''"], "test_code": "assert rev_join('stone table to we at') == ''\nassert rev_join('') == ''\nassert rev_join('camel apple orange') == 'orange'\nassert rev_join('by we light light brain python to') == 'python'\nassert rev_join('river orange winter') == 'winter/orange'\nassert rev_join('') == ''\nassert rev_join('stone') == ''", "answer": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `rev_join('stone table to we at')` يجب أن تُرجع `''`.\nالجواب:", "qhash": "04b3b63ad432018a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([78, 2, 33, 53, 16, 3, 68, 56, 3, 7]) == 0", "assert count_special([-33, 1, 48]) == 0", "assert count_special([36, 54, 45]) == 3", "assert count_special([65, 17, 36, 71, 9, 79, -17, 82]) == 2", "assert count_special([52, -23]) == 0", "assert count_special([90, -21, -8, 29, 13, 28, -5, -22]) == 1", "assert count_special([]) == 0"], "test_code": "assert count_special([78, 2, 33, 53, 16, 3, 68, 56, 3, 7]) == 0\nassert count_special([-33, 1, 48]) == 0\nassert count_special([36, 54, 45]) == 3\nassert count_special([65, 17, 36, 71, 9, 79, -17, 82]) == 2\nassert count_special([52, -23]) == 0\nassert count_special([90, -21, -8, 29, 13, 28, -5, -22]) == 1\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([78, 2, 33, 53, 16, 3, 68, 56, 3, 7])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e2f3f30af3a39681"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 88) == 1)", "tests": ["assert coprimes(73) == 34", "assert coprimes(183) == 84", "assert coprimes(93) == 43", "assert coprimes(48) == 22", "assert coprimes(189) == 86", "assert coprimes(158) == 72", "assert coprimes(1) == 1"], "test_code": "assert coprimes(73) == 34\nassert coprimes(183) == 84\nassert coprimes(93) == 43\nassert coprimes(48) == 22\nassert coprimes(189) == 86\nassert coprimes(158) == 72\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, 88) == 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, 88) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 88، أي أن القاسم المشترك الأكبر لها مع 88 يساوي 1.\nمثال: `coprimes(73)` يجب أن تُرجع `34`.\nالجواب:", "qhash": "1de70330b8e46e6e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 14", "tests": ["assert digit_power(16737) == 4", "assert digit_power(928069) == 0", "assert digit_power(795932) == 11", "assert digit_power(511599) == 4", "assert digit_power(340124) == 4", "assert digit_power(669027) == 10", "assert digit_power(765563) == 12", "assert digit_power(0) == 0"], "test_code": "assert digit_power(16737) == 4\nassert digit_power(928069) == 0\nassert digit_power(795932) == 11\nassert digit_power(511599) == 4\nassert digit_power(340124) == 4\nassert digit_power(669027) == 10\nassert digit_power(765563) == 12\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 14", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 14\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 14.\nمثال: `digit_power(16737)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "118cd66f0fbd50d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_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 only_div([74, 80, 47, 56, 39, 13, 60, 45, 79]) == 0", "assert only_div([]) == 0", "assert only_div([-25, 23, 32, 5, 78, 13, 84, 77, -28]) == 1", "assert only_div([61, 16, -15, -6]) == 1", "assert only_div([36, 88, 65, -31, 52, 17]) == 0", "assert only_div([-37, 79, -39, -40, 19, 63, -34]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([74, 80, 47, 56, 39, 13, 60, 45, 79]) == 0\nassert only_div([]) == 0\nassert only_div([-25, 23, 32, 5, 78, 13, 84, 77, -28]) == 1\nassert only_div([61, 16, -15, -6]) == 1\nassert only_div([36, 88, 65, -31, 52, 17]) == 0\nassert only_div([-37, 79, -39, -40, 19, 63, -34]) == 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 % 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 % 6 == 0 and x % 4 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([74, 80, 47, 56, 39, 13, 60, 45, 79])` يُرجع `0`.\nالجواب:", "qhash": "59fc921ae389cdb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "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, 16))\nprint(calc(calc(16), -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, 16))\nprint(calc(calc(16), -9))\n```\nالجواب:", "qhash": "55ab5ca7ad6d6b13", "answer": "-9\n-9\n9", "completion": " الناتج:\n```text\n-9\n-9\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(546870122))\nprint(calc(calc(546870122)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(546870122))\nprint(calc(calc(546870122)))\n```\nالجواب:", "qhash": "a509facb60f9939f", "answer": "35\n8", "completion": " الناتج:\n```text\n35\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('يوسف', 85), ('فيصل', 87), ('مريم', 53), ('سعيد', 72)]\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 = [('يوسف', 85), ('فيصل', 87), ('مريم', 53), ('سعيد', 72)]\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": "70d5599e00f65cac", "answer": "[('مريم', 53), ('سعيد', 72), ('يوسف', 85), ('فيصل', 87)]\n['فيصل', 'يوسف']", "completion": " الناتج:\n```text\n[('مريم', 53), ('سعيد', 72), ('يوسف', 85), ('فيصل', 87)]\n['فيصل', 'يوسف']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -1 * x ** 2 + (4) * x + (0)", "tests": ["assert quad(7) == -21", "assert quad(19) == -285", "assert quad(-4) == -32", "assert quad(-5) == -45", "assert quad(-5) == -45", "assert quad(-16) == -320", "assert quad(6) == -12", "assert quad(0) == 0"], "test_code": "assert quad(7) == -21\nassert quad(19) == -285\nassert quad(-4) == -32\nassert quad(-5) == -45\nassert quad(-5) == -45\nassert quad(-16) == -320\nassert quad(6) == -12\nassert quad(0) == 0", "answer": "def quad(x):\n return -1 * x ** 2 + (4) * x + (0)", "completion": " ```python\ndef quad(x):\n return -1 * x ** 2 + (4) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -1x² + 4x + 0 عند العدد الصحيح x.\nمثال: `quad(7)` يجب أن تُرجع `-21`.\nالجواب:", "qhash": "3fc956d272b086a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('summer desert data') == 'wyqqiv hiwivx hexe'", "assert cipher('engine vector is') == 'irkmri zigxsv mw'", "assert cipher('up rocket') == 'yt vsgoix'", "assert cipher('brain signal by in Hello') == 'fvemr wmkrep fc mr Hipps'", "assert cipher('brain') == 'fvemr'", "assert cipher('planet') == 'tperix'", "assert cipher('') == ''"], "test_code": "assert cipher('summer desert data') == 'wyqqiv hiwivx hexe'\nassert cipher('engine vector is') == 'irkmri zigxsv mw'\nassert cipher('up rocket') == 'yt vsgoix'\nassert cipher('brain signal by in Hello') == 'fvemr wmkrep fc mr Hipps'\nassert cipher('brain') == 'fvemr'\nassert cipher('planet') == 'tperix'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('summer desert data')` يُرجع `'wyqqiv hiwivx hexe'`.\nالجواب:", "qhash": "f6a478c546088b33"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('ه')", "tests": ["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", "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('نهر نور سلام دفتر سلام') == 1\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 text.count('ه')", "completion": " ```python\ndef count_in_text(text):\n return text.count('ه')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_in_text(text)` بحيث تُعيد عدد مرات ظهور الحرف «ه» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('سفينة ليل شجرة جمل شجرة')` يُرجع `0`.\nالجواب:", "qhash": "ad64df2c86c116cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 82205\ncount = 0\nwhile n > 12:\n n = n // 6\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 82205\ncount = 0\nwhile n > 12:\n n = n // 6\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "d98c17bb2f25f6a8", "answer": "10 5", "completion": " الناتج:\n```text\n10 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert count_initial('مكتبة مطر') == 0", "assert count_initial('دفتر طالب امل فجر قلم امل كتاب') == 2", "assert count_initial('نور حاسوب') == 0", "assert count_initial('قهوة امل امل مطر فجر') == 2", "assert count_initial('امل بحر امل حاسوب نهر ميناء تفاحة عمل') == 2", "assert count_initial('امل قهوة امل وردة معلم طالب قهوة') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('مكتبة مطر') == 0\nassert count_initial('دفتر طالب امل فجر قلم امل كتاب') == 2\nassert count_initial('نور حاسوب') == 0\nassert count_initial('قهوة امل امل مطر فجر') == 2\nassert count_initial('امل بحر امل حاسوب نهر ميناء تفاحة عمل') == 2\nassert count_initial('امل قهوة امل وردة معلم طالب قهوة') == 2\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text:\n if w.startswith('ا'):\n count += 1\n return count\n```\nمثال: `count_initial('مكتبة مطر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "d0b0353ca0e2f475"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('حديقة تفاحة ماء سفينة سفينة') == 2", "assert how_many('ميناء فجر باب فجر نور نهر') == 0", "assert how_many('ميناء') == 0", "assert how_many('سيارة عمل') == 1", "assert how_many('عمل معلم حديقة') == 0", "assert how_many('') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('مكتبة جمل حصان نهار') == 0\nassert how_many('حديقة تفاحة ماء سفينة سفينة') == 2\nassert how_many('ميناء فجر باب فجر نور نهر') == 0\nassert how_many('ميناء') == 0\nassert how_many('سيارة عمل') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «س» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('مكتبة جمل حصان نهار')` يُرجع `0`.\nالجواب:", "qhash": "5596b73d3cc988f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 2:\n return 5\n return 1 * f(n - 1) + 3\n\nprint(f(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 2:\n return 5\n return 1 * f(n - 1) + 3\n\nprint(f(7))\n```\nالجواب:", "qhash": "2f3722a7ff7bfa21", "answer": "20", "completion": " الناتج:\n```text\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 52) == 1)", "tests": ["assert coprime_count(82) == 38", "assert coprime_count(21) == 10", "assert coprime_count(134) == 62", "assert coprime_count(173) == 80", "assert coprime_count(110) == 51", "assert coprime_count(163) == 76", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(82) == 38\nassert coprime_count(21) == 10\nassert coprime_count(134) == 62\nassert coprime_count(173) == 80\nassert coprime_count(110) == 51\nassert coprime_count(163) == 76\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, 52) == 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, 52) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 52) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(82)` يُرجع `38`.\nالجواب:", "qhash": "ada1cd995c4843a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert turn_list([5, 48, 7, 47]) == [7, 47, 5, 48]", "assert turn_list([33, 26, 18, 8]) == [18, 8, 33, 26]", "assert turn_list([45, 6, 5]) == [6, 5, 45]", "assert turn_list([39, 22, 36, 22, -7, -3, -3, 44, 44, 25, 47, -8]) == [47, -8, 39, 22, 36, 22, -7, -3, -3, 44, 44, 25]", "assert turn_list([11, 7, 30, 12, 48, 26, 46, 8, 9]) == [48, 26, 46, 8, 9, 11, 7, 30, 12]", "assert turn_list([-4, 0, 34, 39, 42, 6, 6, 36]) == [34, 39, 42, 6, 6, 36, -4, 0]", "assert turn_list([]) == []"], "test_code": "assert turn_list([5, 48, 7, 47]) == [7, 47, 5, 48]\nassert turn_list([33, 26, 18, 8]) == [18, 8, 33, 26]\nassert turn_list([45, 6, 5]) == [6, 5, 45]\nassert turn_list([39, 22, 36, 22, -7, -3, -3, 44, 44, 25, 47, -8]) == [47, -8, 39, 22, 36, 22, -7, -3, -3, 44, 44, 25]\nassert turn_list([11, 7, 30, 12, 48, 26, 46, 8, 9]) == [48, 26, 46, 8, 9, 11, 7, 30, 12]\nassert turn_list([-4, 0, 34, 39, 42, 6, 6, 36]) == [34, 39, 42, 6, 6, 36, -4, 0]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([5, 48, 7, 47])` يُرجع `[7, 47, 5, 48]`.\nالجواب:", "qhash": "7ae4035846c7b709"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-1, 2, 23, 33, -2, -2, 24]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-1, 2, 23, 33, -2, -2, 24]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "3c5ff776f427a50a", "answer": "[-2, -2, -1, 2, 23, 24, 33]\n[33, 24, 23]", "completion": " الناتج:\n```text\n[-2, -2, -1, 2, 23, 24, 33]\n[33, 24, 23]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=4):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(-4))\nprint(g(-4, 16))\nprint(g(g(16), -4))", "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(-4))\nprint(g(-4, 16))\nprint(g(g(16), -4))\n```\nالجواب:", "qhash": "83eaa8ad3a968c6d", "answer": "-12\n-36\n-28", "completion": " الناتج:\n```text\n-12\n-36\n-28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [-6, -4, 4, 7, 28, 8, 18]\nprint(lst[2:6])\nprint(lst[::-1])\nprint(max(lst[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [-6, -4, 4, 7, 28, 8, 18]\nprint(lst[2:6])\nprint(lst[::-1])\nprint(max(lst[2:6]))\n```\nالجواب:", "qhash": "d40a7e34030533aa", "answer": "[4, 7, 28, 8]\n[18, 8, 28, 7, 4, -4, -6]\n28", "completion": " الناتج:\n```text\n[4, 7, 28, 8]\n[18, 8, 28, 7, 4, -4, -6]\n28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['winter', 'camel', 'window', 'brain', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['winter', 'camel', 'window', 'brain', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3e4b4655be3ad9bd", "answer": "['camel', 'brain', 'winter', 'window', 'rocket']\n['winter', 'window', 'rocket']", "completion": " الناتج:\n```text\n['camel', 'brain', 'winter', 'window', 'rocket']\n['winter', 'window', 'rocket']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 140\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 = 140\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": "9b9a185890b14ca6", "answer": "15", "completion": " الناتج:\n```text\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'cloud'\nprint(name.index('o') + len(name))\nprint(name[3:4])\nprint(name.count('o'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'cloud'\nprint(name.index('o') + len(name))\nprint(name[3:4])\nprint(name.count('o'))\n```\nالجواب:", "qhash": "c3ad7b706bd65cdb", "answer": "7\nu\n1", "completion": " الناتج:\n```text\n7\nu\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['apple', 'camel', 'coffee', 'python', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['apple', 'camel', 'coffee', 'python', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "dc2446aaff295665", "answer": "['code', 'apple', 'camel', 'coffee', 'python']\n['python', 'coffee', 'camel']", "completion": " الناتج:\n```text\n['code', 'apple', 'camel', 'coffee', 'python']\n['python', 'coffee', 'camel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -4 * x ** 2 + (-8) * x + (-1)", "tests": ["assert evaluate(9) == -397", "assert evaluate(-10) == -321", "assert evaluate(7) == -253", "assert evaluate(8) == -321", "assert evaluate(-10) == -321", "assert evaluate(-12) == -481", "assert evaluate(4) == -97", "assert evaluate(0) == -1"], "test_code": "assert evaluate(9) == -397\nassert evaluate(-10) == -321\nassert evaluate(7) == -253\nassert evaluate(8) == -321\nassert evaluate(-10) == -321\nassert evaluate(-12) == -481\nassert evaluate(4) == -97\nassert evaluate(0) == -1", "answer": "def evaluate(x):\n return -4 * x ** 2 + (-8) * x + (-1)", "completion": " ```python\ndef evaluate(x):\n return -4 * x ** 2 + (-8) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -4x² - 8x - 1 عند العدد الصحيح x.\nمثال: `evaluate(9)` يجب أن تُرجع `-397`.\nالجواب:", "qhash": "9e1f1ee4609c89fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 8 * x ** 2 + (-5) * x + (-4)", "tests": ["assert poly(4) == 104", "assert poly(12) == 1088", "assert poly(-2) == 38", "assert poly(-4) == 144", "assert poly(-1) == 9", "assert poly(-3) == 83", "assert poly(-2) == 38", "assert poly(0) == -4"], "test_code": "assert poly(4) == 104\nassert poly(12) == 1088\nassert poly(-2) == 38\nassert poly(-4) == 144\nassert poly(-1) == 9\nassert poly(-3) == 83\nassert poly(-2) == 38\nassert poly(0) == -4", "answer": "def poly(x):\n return 8 * x ** 2 + (-5) * x + (-4)", "completion": " ```python\ndef poly(x):\n return 8 * x ** 2 + (-5) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 8x² - 5x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(4)` يُرجع `104`.\nالجواب:", "qhash": "9878052fbbb7cad8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('ماء صحراء طائرة دفتر رمل') == 1", "assert count_hits('طالب ليل شجرة جبل مدينة علم جبل') == 0", "assert count_hits('شجرة سفينة حديقة كتاب صديق قهوة ميناء') == 1", "assert count_hits('نور قلم برتقال حديقة مكتبة طالب كتاب') == 3", "assert count_hits('باب نور شجرة مدينة') == 0", "assert count_hits('شجرة علم قلم') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('نور معلم كتاب حديقة مدرسة') == 1\nassert count_hits('ماء صحراء طائرة دفتر رمل') == 1\nassert count_hits('طالب ليل شجرة جبل مدينة علم جبل') == 0\nassert count_hits('شجرة سفينة حديقة كتاب صديق قهوة ميناء') == 1\nassert count_hits('نور قلم برتقال حديقة مكتبة طالب كتاب') == 3\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": "92d6e7ad2cd73f58"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'rt'}", "tests": ["assert char_counts('of coffee on engine cloud') == {'r': 0, 't': 0}", "assert char_counts('winter music orange') == {'r': 2, 't': 1}", "assert char_counts('cloud python in falcon') == {'r': 0, 't': 1}", "assert char_counts('up it brain river') == {'r': 3, 't': 1}", "assert char_counts('by window') == {'r': 0, 't': 0}", "assert char_counts('it an it up on') == {'r': 0, 't': 2}", "assert char_counts('') == {'r': 0, 't': 0}"], "test_code": "assert char_counts('of coffee on engine cloud') == {'r': 0, 't': 0}\nassert char_counts('winter music orange') == {'r': 2, 't': 1}\nassert char_counts('cloud python in falcon') == {'r': 0, 't': 1}\nassert char_counts('up it brain river') == {'r': 3, 't': 1}\nassert char_counts('by window') == {'r': 0, 't': 0}\nassert char_counts('it an it up on') == {'r': 0, 't': 2}\nassert char_counts('') == {'r': 0, 't': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'rt'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'rt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'r'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('of coffee on engine cloud')` يجب أن تُرجع `{'r': 0, 't': 0}`.\nالجواب:", "qhash": "6b38a0c067b13cbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'falcon_light'\nprint(word[-1:])\nprint(word.replace('l', '*'))\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'falcon_light'\nprint(word[-1:])\nprint(word.replace('l', '*'))\nprint(word.split('_'))\n```\nالجواب:", "qhash": "3d846bd004bdfea8", "answer": "t\nfa*con_*ight\n['falcon', 'light']", "completion": " الناتج:\n```text\nt\nfa*con_*ight\n['falcon', 'light']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([34, 2, 2, -30, -5, -27]) == -27", "assert find_max_div([-12, -3, -6]) == -3", "assert find_max_div([1, 4]) == None", "assert find_max_div([31, 14, 17]) == None", "assert find_max_div([-27, 11, 3]) == 3", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([34, 2, 2, -30, -5, -27]) == -27\nassert find_max_div([-12, -3, -6]) == -3\nassert find_max_div([1, 4]) == None\nassert find_max_div([31, 14, 17]) == None\nassert find_max_div([-27, 11, 3]) == 3\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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مثال: `find_max_div([34, 2, 2, -30, -5, -27])` يجب أن تُرجع `-27`.\nالجواب:", "qhash": "300a7ff6c09b6189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(19) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19']", "assert game(21) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21']", "assert game(17) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17']", "assert game(25) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22', '23', 'PingPong', '25']", "assert game(22) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22']"], "test_code": "assert game(19) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19']\nassert game(21) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21']\nassert game(17) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17']\nassert game(25) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22', '23', 'PingPong', '25']\nassert game(22) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\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 % 4 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 6 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(19)` يجب أن تُرجع `['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17', 'Pong', '19']`.\nالجواب:", "qhash": "5753bba3ed7e7783"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -7 * x ** 2 + (9) * x + (-2)", "tests": ["assert eval_poly(2) == -12", "assert eval_poly(-20) == -2982", "assert eval_poly(6) == -200", "assert eval_poly(16) == -1650", "assert eval_poly(13) == -1068", "assert eval_poly(1) == 0", "assert eval_poly(-17) == -2178", "assert eval_poly(0) == -2"], "test_code": "assert eval_poly(2) == -12\nassert eval_poly(-20) == -2982\nassert eval_poly(6) == -200\nassert eval_poly(16) == -1650\nassert eval_poly(13) == -1068\nassert eval_poly(1) == 0\nassert eval_poly(-17) == -2178\nassert eval_poly(0) == -2", "answer": "def eval_poly(x):\n return -7 * x ** 2 + (9) * x + (-2)", "completion": " ```python\ndef eval_poly(x):\n return -7 * x ** 2 + (9) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -7x² + 9x - 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(2)` يُرجع `-12`.\nالجواب:", "qhash": "2bb01c6377860162"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert words_reversed('to summer cloud banana desert') == 'desert/banana/cloud/summer'", "assert words_reversed('at planet go is cloud signal pixel camel') == 'camel/pixel/signal/cloud/planet'", "assert words_reversed('winter we garden engine signal apple') == 'apple/signal/engine/garden/winter'", "assert words_reversed('it python summer go it') == 'summer/python'", "assert words_reversed('orange apple matrix up of table') == 'table/matrix/apple/orange'", "assert words_reversed('vector music at orange stone river falcon we') == 'falcon/river/stone/orange/music/vector'", "assert words_reversed('in apple go river to signal in coffee') == 'coffee/signal/river/apple'"], "test_code": "assert words_reversed('to summer cloud banana desert') == 'desert/banana/cloud/summer'\nassert words_reversed('at planet go is cloud signal pixel camel') == 'camel/pixel/signal/cloud/planet'\nassert words_reversed('winter we garden engine signal apple') == 'apple/signal/engine/garden/winter'\nassert words_reversed('it python summer go it') == 'summer/python'\nassert words_reversed('orange apple matrix up of table') == 'table/matrix/apple/orange'\nassert words_reversed('vector music at orange stone river falcon we') == 'falcon/river/stone/orange/music/vector'\nassert words_reversed('in apple go river to signal in coffee') == 'coffee/signal/river/apple'", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `words_reversed('to summer cloud banana desert')` يجب أن تُرجع `'desert/banana/cloud/summer'`.\nالجواب:", "qhash": "75d2d675e717a78a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert reverse_words('rocket light cloud river') == 'rocket'", "assert reverse_words('window code vector table brain') == 'vector window'", "assert reverse_words('an') == ''", "assert reverse_words('banana') == 'banana'", "assert reverse_words('on table we in garden by matrix coffee') == 'coffee matrix garden'", "assert reverse_words('go at') == ''", "assert reverse_words('vector it coffee we window') == 'window coffee vector'"], "test_code": "assert reverse_words('rocket light cloud river') == 'rocket'\nassert reverse_words('window code vector table brain') == 'vector window'\nassert reverse_words('an') == ''\nassert reverse_words('banana') == 'banana'\nassert reverse_words('on table we in garden by matrix coffee') == 'coffee matrix garden'\nassert reverse_words('go at') == ''\nassert reverse_words('vector it coffee we window') == 'window coffee vector'", "answer": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `reverse_words('rocket light cloud river')` يُرجع `'rocket'`.\nالجواب:", "qhash": "524699067090385d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 36", "tests": ["assert digit_score(32248) == 1", "assert digit_score(210171) == 8", "assert digit_score(178593) == 13", "assert digit_score(150574) == 20", "assert digit_score(636142) == 30", "assert digit_score(480122) == 29", "assert digit_score(286535) == 7", "assert digit_score(0) == 0"], "test_code": "assert digit_score(32248) == 1\nassert digit_score(210171) == 8\nassert digit_score(178593) == 13\nassert digit_score(150574) == 20\nassert digit_score(636142) == 30\nassert digit_score(480122) == 29\nassert digit_score(286535) == 7\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 36", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 36\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 36.\nللتوضيح: الاستدعاء `digit_score(32248)` يُرجع `1`.\nالجواب:", "qhash": "4019d69d61d38896"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([27, 19, 28, 34, 31, 36, 26]) == [27, 46, 74, 0, 31, 67, 0]", "assert cumulative([19, 46, 9, 25, 34, 1]) == [19, 65, 74, 0, 34, 35]", "assert cumulative([48, 23, 33, 59]) == [48, 71, 0, 59]", "assert cumulative([12]) == [12]", "assert cumulative([53, 12, 27, -8]) == [53, 65, 0, -8]", "assert cumulative([16, 65, -6, 9, 66, -8, 17, 75, 38]) == [16, 81, 75, 84, 0, -8, 9, 84, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([27, 19, 28, 34, 31, 36, 26]) == [27, 46, 74, 0, 31, 67, 0]\nassert cumulative([19, 46, 9, 25, 34, 1]) == [19, 65, 74, 0, 34, 35]\nassert cumulative([48, 23, 33, 59]) == [48, 71, 0, 59]\nassert cumulative([12]) == [12]\nassert cumulative([53, 12, 27, -8]) == [53, 65, 0, -8]\nassert cumulative([16, 65, -6, 9, 66, -8, 17, 75, 38]) == [16, 81, 75, 84, 0, -8, 9, 84, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\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 > 85:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 85 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([27, 19, 28, 34, 31, 36, 26])` يجب أن تُرجع `[27, 46, 74, 0, 31, 67, 0]`.\nالجواب:", "qhash": "381ced836e8791c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)", "tests": ["assert add_multiples(107) == 1250", "assert add_multiples(136) == 2096", "assert add_multiples(111) == 1358", "assert add_multiples(156) == 2681", "assert add_multiples(137) == 2232", "assert add_multiples(128) == 1833", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(107) == 1250\nassert add_multiples(136) == 2096\nassert add_multiples(111) == 1358\nassert add_multiples(156) == 2681\nassert add_multiples(137) == 2232\nassert add_multiples(128) == 1833\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(107)` يُرجع `1250`.\nالجواب:", "qhash": "2df01c4a87e79800"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-11, -9, 24, -19, 18, 2, 17, -18]\nprint(sorted(nums, key=lambda x: (abs(x - 21), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-11, -9, 24, -19, 18, 2, 17, -18]\nprint(sorted(nums, key=lambda x: (abs(x - 21), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "4a6a592c2f6aa1f9", "answer": "[18, 24, 17, 2, -9, -11, -18, -19]\n[24, 18, 17]", "completion": " الناتج:\n```text\n[18, 24, 17, 2, -9, -11, -18, -19]\n[24, 18, 17]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('وليد', 67), ('رنا', 53), ('هشام', 57), ('سعيد', 57)]\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 = [('وليد', 67), ('رنا', 53), ('هشام', 57), ('سعيد', 57)]\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": "a76e4a2524e8c84f", "answer": "[('رنا', 53), ('سعيد', 57), ('هشام', 57), ('وليد', 67)]\n['وليد', 'سعيد']", "completion": " الناتج:\n```text\n[('رنا', 53), ('سعيد', 57), ('هشام', 57), ('وليد', 67)]\n['وليد', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 83:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([17, 41, 20, 10, 37, 37, 36]) == [17, 58, 78, 0, 37, 74, 0]", "assert cumulative([-6, 29, 60, 7, 42, 13, 32, 82, 79, 83]) == [-6, 23, 83, 0, 42, 55, 0, 82, 0, 83]", "assert cumulative([28, 67, 73, 18, 41, 8]) == [28, 0, 73, 0, 41, 49]", "assert cumulative([67, -3, 47]) == [67, 64, 0]", "assert cumulative([52, -4, 13]) == [52, 48, 61]", "assert cumulative([60]) == [60]", "assert cumulative([]) == []"], "test_code": "assert cumulative([17, 41, 20, 10, 37, 37, 36]) == [17, 58, 78, 0, 37, 74, 0]\nassert cumulative([-6, 29, 60, 7, 42, 13, 32, 82, 79, 83]) == [-6, 23, 83, 0, 42, 55, 0, 82, 0, 83]\nassert cumulative([28, 67, 73, 18, 41, 8]) == [28, 0, 73, 0, 41, 49]\nassert cumulative([67, -3, 47]) == [67, 64, 0]\nassert cumulative([52, -4, 13]) == [52, 48, 61]\nassert cumulative([60]) == [60]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 83:\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 > 83:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 83 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([17, 41, 20, 10, 37, 37, 36])` يُرجع `[17, 58, 78, 0, 37, 74, 0]`.\nالجواب:", "qhash": "8791f3f6f8a4db18"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ر'))", "tests": ["assert letter_hits('خبز باب ماء قلم صحراء') == 0", "assert letter_hits('ماء سوق سيارة بحر ليل صديق مدرسة') == 0", "assert letter_hits('مطر صحراء سوق مكتبة بيت نهار') == 0", "assert letter_hits('عمل') == 0", "assert letter_hits('ميناء قلم بحر مطر علم') == 0", "assert letter_hits('مدينة صحراء بحر سيارة ميناء سلام سوق فجر') == 0", "assert letter_hits('تفاحة كتاب رمل بحر صحراء') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('خبز باب ماء قلم صحراء') == 0\nassert letter_hits('ماء سوق سيارة بحر ليل صديق مدرسة') == 0\nassert letter_hits('مطر صحراء سوق مكتبة بيت نهار') == 0\nassert letter_hits('عمل') == 0\nassert letter_hits('ميناء قلم بحر مطر علم') == 0\nassert letter_hits('مدينة صحراء بحر سيارة ميناء سلام سوق فجر') == 0\nassert letter_hits('تفاحة كتاب رمل بحر صحراء') == 1\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ر'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ر'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ر».\nمثال: `letter_hits('خبز باب ماء قلم صحراء')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "abd56ecc76b4481a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [25, 31, 14, 19, 28, 34]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [25, 31, 14, 19, 28, 34]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "7458d6406984cabd", "answer": "[14, 19, 25, 28, 31, 34]\n[34, 31, 28]", "completion": " الناتج:\n```text\n[14, 19, 25, 28, 31, 34]\n[34, 31, 28]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('stone 2024') == 'efazq 2024'", "assert rot('python') == 'bkftaz'", "assert rot('coffee') == 'oarrqq'", "assert rot('python code') == 'bkftaz oapq'", "assert rot('a we an at orange') == 'm iq mz mf admzsq'", "assert rot('of camel code 2024') == 'ar omyqx oapq 2024'", "assert rot('') == ''"], "test_code": "assert rot('stone 2024') == 'efazq 2024'\nassert rot('python') == 'bkftaz'\nassert rot('coffee') == 'oarrqq'\nassert rot('python code') == 'bkftaz oapq'\nassert rot('a we an at orange') == 'm iq mz mf admzsq'\nassert rot('of camel code 2024') == 'ar omyqx oapq 2024'\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 + (-14)) % 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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('stone 2024')` يجب أن تُرجع `'efazq 2024'`.\nالجواب:", "qhash": "5903ff04859d0783"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'حسن': 38, 'عمر': 8, 'راشد': 16, 'سلمى': 35}\npoints['راشد'] += 5\npoints['هشام'] = 39\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 = {'حسن': 38, 'عمر': 8, 'راشد': 16, 'سلمى': 35}\npoints['راشد'] += 5\npoints['هشام'] = 39\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": "bbdc96c5b33054a3", "answer": "5\nهشام\n141\n[('عمر', 8), ('راشد', 21)]", "completion": " الناتج:\n```text\n5\nهشام\n141\n[('عمر', 8), ('راشد', 21)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if 'و' in w)", "tests": ["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", "assert count_hits('') == 0"], "test_code": "assert 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\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('رمل عربية طالب برمجة سفينة شمس سلام سيارة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "889de8f7bfcdc110"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -7 * x ** 2 + (3) * x + (-9)", "tests": ["assert evaluate(7) == -331", "assert evaluate(-11) == -889", "assert evaluate(-20) == -2869", "assert evaluate(4) == -109", "assert evaluate(5) == -169", "assert evaluate(11) == -823", "assert evaluate(15) == -1539", "assert evaluate(0) == -9"], "test_code": "assert evaluate(7) == -331\nassert evaluate(-11) == -889\nassert evaluate(-20) == -2869\nassert evaluate(4) == -109\nassert evaluate(5) == -169\nassert evaluate(11) == -823\nassert evaluate(15) == -1539\nassert evaluate(0) == -9", "answer": "def evaluate(x):\n return -7 * x ** 2 + (3) * x + (-9)", "completion": " ```python\ndef evaluate(x):\n return -7 * x ** 2 + (3) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -7x² + 3x - 9 عند العدد الصحيح x.\nمثال: `evaluate(7)` يجب أن تُرجع `-331`.\nالجواب:", "qhash": "9e462adc1be2a545"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ي')", "tests": ["assert count_hits('كتاب باب صحراء تفاحة سلام رمل') == 0", "assert count_hits('سوق معلم ميناء شمس معلم نهر سوق') == 1", "assert count_hits('نهر صحراء مطر نهر رمل سلام') == 0", "assert count_hits('حاسوب لغة لغة') == 0", "assert count_hits('جبل سيارة برمجة مدرسة صديق برمجة باب') == 2", "assert count_hits('سلام قهوة خبز سلام قهوة قمر') == 0", "assert count_hits('جبل نهار نهار حاسوب وردة ميناء جبل نهر') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('كتاب باب صحراء تفاحة سلام رمل') == 0\nassert count_hits('سوق معلم ميناء شمس معلم نهر سوق') == 1\nassert count_hits('نهر صحراء مطر نهر رمل سلام') == 0\nassert count_hits('حاسوب لغة لغة') == 0\nassert count_hits('جبل سيارة برمجة مدرسة صديق برمجة باب') == 2\nassert count_hits('سلام قهوة خبز سلام قهوة قمر') == 0\nassert count_hits('جبل نهار نهار حاسوب وردة ميناء جبل نهر') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ي» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('كتاب باب صحراء تفاحة سلام رمل')` يُرجع `0`.\nالجواب:", "qhash": "e7d528560404363d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert sum_div(105) == 735", "assert sum_div(189) == 2457", "assert sum_div(212) == 3255", "assert sum_div(260) == 4921", "assert sum_div(33) == 70", "assert sum_div(201) == 2842", "assert sum_div(1) == 0"], "test_code": "assert sum_div(105) == 735\nassert sum_div(189) == 2457\nassert sum_div(212) == 3255\nassert sum_div(260) == 4921\nassert sum_div(33) == 70\nassert sum_div(201) == 2842\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 14.\nمثال: `sum_div(105)` يجب أن تُرجع `735`.\nالجواب:", "qhash": "ae011f97040a6c78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 280\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 = 280\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": "5ad87909592b4740", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'engine'\nprint(len(text))\nprint(text.upper())\nprint(text[1:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'engine'\nprint(len(text))\nprint(text.upper())\nprint(text[1:3])\n```\nالجواب:", "qhash": "27a1afcc063a9ae4", "answer": "6\nENGINE\nng", "completion": " الناتج:\n```text\n6\nENGINE\nng\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "tests": ["assert weighted_sum(6) == 63", "assert weighted_sum(12) == 234", "assert weighted_sum(12) == 234", "assert weighted_sum(9) == 135", "assert weighted_sum(12) == 234", "assert weighted_sum(1) == 3", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(6) == 63\nassert weighted_sum(12) == 234\nassert weighted_sum(12) == 234\nassert weighted_sum(9) == 135\nassert weighted_sum(12) == 234\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 ** 1\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total\n```\n", "buggy": "def weighted_sum(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 weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(6)` يُرجع `63`.\nالجواب:", "qhash": "085c06a812db1c94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 0\nfor j in range(8, 14, 4):\n total -= j * 9\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 0\nfor j in range(8, 14, 4):\n total -= j * 9\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "f270be59a75d602f", "answer": "-180\n12", "completion": " الناتج:\n```text\n-180\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [16, -6, 4, -1, 15, 24]\nprint(data[2:3])\nprint(data[::2])\nprint(len(data[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [16, -6, 4, -1, 15, 24]\nprint(data[2:3])\nprint(data[::2])\nprint(len(data[2:3]))\n```\nالجواب:", "qhash": "718c9a04879b5467", "answer": "[4]\n[16, 4, 15]\n1", "completion": " الناتج:\n```text\n[4]\n[16, 4, 15]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 69) == 1)", "tests": ["assert rel_prime_count(35) == 23", "assert rel_prime_count(25) == 16", "assert rel_prime_count(63) == 40", "assert rel_prime_count(68) == 44", "assert rel_prime_count(105) == 67", "assert rel_prime_count(3) == 2", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(35) == 23\nassert rel_prime_count(25) == 16\nassert rel_prime_count(63) == 40\nassert rel_prime_count(68) == 44\nassert rel_prime_count(105) == 67\nassert rel_prime_count(3) == 2\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, 69) == 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, 69) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 69) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(35)` يُرجع `23`.\nالجواب:", "qhash": "b0d6e8c8957f3918"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('engine by it matrix pixel music') == 'matrix/engine'", "assert backwards('at matrix music window music matrix') == 'matrix/window/matrix'", "assert backwards('table') == ''", "assert backwards('at camel light apple on winter it') == 'winter'", "assert backwards('it') == ''", "assert backwards('planet by music engine to') == 'engine/planet'", "assert backwards('rocket planet rocket cloud engine stone go river') == 'engine/rocket/planet/rocket'"], "test_code": "assert backwards('engine by it matrix pixel music') == 'matrix/engine'\nassert backwards('at matrix music window music matrix') == 'matrix/window/matrix'\nassert backwards('table') == ''\nassert backwards('at camel light apple on winter it') == 'winter'\nassert backwards('it') == ''\nassert backwards('planet by music engine to') == 'engine/planet'\nassert backwards('rocket planet rocket cloud engine stone go river') == 'engine/rocket/planet/rocket'", "answer": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('engine by it matrix pixel music')` يُرجع `'matrix/engine'`.\nالجواب:", "qhash": "504a07953f36539e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [-2, 22, -4, 35, 1, -5, 25, 20, 17]\nprint(lst[3:6])\nprint(lst[::2])\nprint(min(lst[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [-2, 22, -4, 35, 1, -5, 25, 20, 17]\nprint(lst[3:6])\nprint(lst[::2])\nprint(min(lst[3:6]))\n```\nالجواب:", "qhash": "c440101be3c5cfe1", "answer": "[35, 1, -5]\n[-2, -4, 1, 25, 17]\n-5", "completion": " الناتج:\n```text\n[35, 1, -5]\n[-2, -4, 1, 25, 17]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'et'}", "tests": ["assert count_chars('up in an by it winter') == {'e': 1, 't': 2}", "assert count_chars('engine window winter data matrix') == {'e': 3, 't': 3}", "assert count_chars('we we') == {'e': 2, 't': 0}", "assert count_chars('coffee it stone of code') == {'e': 4, 't': 2}", "assert count_chars('window in') == {'e': 0, 't': 0}", "assert count_chars('falcon on') == {'e': 0, 't': 0}", "assert count_chars('') == {'e': 0, 't': 0}"], "test_code": "assert count_chars('up in an by it winter') == {'e': 1, 't': 2}\nassert count_chars('engine window winter data matrix') == {'e': 3, 't': 3}\nassert count_chars('we we') == {'e': 2, 't': 0}\nassert count_chars('coffee it stone of code') == {'e': 4, 't': 2}\nassert count_chars('window in') == {'e': 0, 't': 0}\nassert count_chars('falcon on') == {'e': 0, 't': 0}\nassert count_chars('') == {'e': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'et'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'et'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'e'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('up in an by it winter')` يُرجع `{'e': 1, 't': 2}`.\nالجواب:", "qhash": "699f0ac32ffeb8fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 272\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 = 272\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": "d5819269dbf836e4", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'زينب': 36, 'باسل': 33, 'حسن': 11, 'منى': 36}\nd['حسن'] += 13\nd['نور'] = 38\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 = {'زينب': 36, 'باسل': 33, 'حسن': 11, 'منى': 36}\nd['حسن'] += 13\nd['نور'] = 38\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": "dbeac40343cadf74", "answer": "5\nنور\n167\n[('حسن', 24), ('باسل', 33)]", "completion": " الناتج:\n```text\n5\nنور\n167\n[('حسن', 24), ('باسل', 33)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([8, -4, 59, 24, -29, 1, -7, -30, 32]) == 24", "assert max_multiple([-12, -48, -36]) == -12", "assert max_multiple([1, 13]) == None", "assert max_multiple([7, -26, -18]) == None", "assert max_multiple([24, 37, 43, -23, 39]) == 24", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([8, -4, 59, 24, -29, 1, -7, -30, 32]) == 24\nassert max_multiple([-12, -48, -36]) == -12\nassert max_multiple([1, 13]) == None\nassert max_multiple([7, -26, -18]) == None\nassert max_multiple([24, 37, 43, -23, 39]) == 24\nassert max_multiple([]) == None", "answer": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 12 == 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 % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_multiple([8, -4, 59, 24, -29, 1, -7, -30, 32])` يجب أن تُرجع `24`.\nالجواب:", "qhash": "d287bcbe965f9211"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -5 for x in xs if 0 <= x <= 15)", "tests": ["assert select_range([1, 3, 8, -2]) == [-40, -15, -5]", "assert select_range([-22, 49, 30]) == []", "assert select_range([12, 26, 54, 2, -28, 28]) == [-60, -10]", "assert select_range([30]) == []", "assert select_range([55, 22, 3, -17, 51, -10]) == [-15]", "assert select_range([32, 49, -27, 33, -14, 17, 56, 12]) == [-60]", "assert select_range([24, 15, 57, -2, -14, 9, 40]) == [-75, -45]", "assert select_range([]) == []"], "test_code": "assert select_range([1, 3, 8, -2]) == [-40, -15, -5]\nassert select_range([-22, 49, 30]) == []\nassert select_range([12, 26, 54, 2, -28, 28]) == [-60, -10]\nassert select_range([30]) == []\nassert select_range([55, 22, 3, -17, 51, -10]) == [-15]\nassert select_range([32, 49, -27, 33, -14, 17, 56, 12]) == [-60]\nassert select_range([24, 15, 57, -2, -14, 9, 40]) == [-75, -45]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -5 for x in xs if 0 <= x <= 15)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -5 for x in xs if 0 <= x <= 15)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 0 ≤ x ≤ 15، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([1, 3, 8, -2])` يُرجع `[-40, -15, -5]`.\nالجواب:", "qhash": "3cff2f508b841b3c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(7) == ['1', '2', '3', '4', 'Tic', '6', 'Tac']", "assert play(15) == ['1', '2', '3', '4', 'Tic', '6', 'Tac', '8', '9', 'Tic', '11', '12', '13', 'Tac', 'Tic']", "assert play(1) == ['1']", "assert play(0) == []", "assert play(0) == []"], "test_code": "assert play(7) == ['1', '2', '3', '4', 'Tic', '6', 'Tac']\nassert play(15) == ['1', '2', '3', '4', 'Tic', '6', 'Tac', '8', '9', 'Tic', '11', '12', '13', 'Tac', 'Tic']\nassert play(1) == ['1']\nassert play(0) == []\nassert play(0) == []", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Tic'\n if i % 7 == 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 % 5 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Tic'، وعلى 7 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(7)` يجب أن تُرجع `['1', '2', '3', '4', 'Tic', '6', 'Tac']`.\nالجواب:", "qhash": "e18e7f3dbaeaad9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 99215\nc = 0\nwhile x > 8:\n x = x // 7\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 99215\nc = 0\nwhile x > 8:\n x = x // 7\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "071f9b9e74048e15", "answer": "5 5", "completion": " الناتج:\n```text\n5 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 47", "tests": ["assert mfact(10) == 33", "assert mfact(7) == 11", "assert mfact(2) == 2", "assert mfact(26) == 27", "assert mfact(59) == 0", "assert mfact(31) == 24", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 33\nassert mfact(7) == 11\nassert mfact(2) == 2\nassert mfact(26) == 27\nassert mfact(59) == 0\nassert mfact(31) == 24\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 47", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(10)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "d5f409a6fee8f073"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(25) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo']", "assert play(6) == ['1', '2', '3', '4', 'Foo', 'Bar']", "assert play(13) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13']", "assert play(18) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar']", "assert play(18) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar']"], "test_code": "assert play(25) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo']\nassert play(6) == ['1', '2', '3', '4', 'Foo', 'Bar']\nassert play(13) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13']\nassert play(18) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar']\nassert play(18) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Foo'، وإن قَبِلها على 6 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(25)` يُرجع `['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo']`.\nالجواب:", "qhash": "fe7f5e1b3cb65d1b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('مدينة مكتبة') == 1", "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('قمر كتاب مدينة صديق حاسوب ليل') == 1\nassert count_letter('مدينة مكتبة') == 1\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 'ك' 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": "a1835355f71f99de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([32, 9, -6, 14]) == 9", "assert top_divisible([-45, -18, -9]) == -9", "assert top_divisible([1, 10]) == None", "assert top_divisible([-35, -12, -21, 0, 28, -16, -38, -23]) == 0", "assert top_divisible([14, -11, 10, -11, 8, -37]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([32, 9, -6, 14]) == 9\nassert top_divisible([-45, -18, -9]) == -9\nassert top_divisible([1, 10]) == None\nassert top_divisible([-35, -12, -21, 0, 28, -16, -38, -23]) == 0\nassert top_divisible([14, -11, 10, -11, 8, -37]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([32, 9, -6, 14])` يُرجع `9`.\nالجواب:", "qhash": "276b0903c01a3e2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [5, 7, 12, -7, 11, 0, 0, 9]\nprint(a[2:3])\nprint(a[::-2])\nprint(len(a[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [5, 7, 12, -7, 11, 0, 0, 9]\nprint(a[2:3])\nprint(a[::-2])\nprint(len(a[2:3]))\n```\nالجواب:", "qhash": "89da2a42c8ae4e2a", "answer": "[12]\n[9, 0, -7, 7]\n1", "completion": " الناتج:\n```text\n[12]\n[9, 0, -7, 7]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('apple signal vector data stone') == 'vector_signal'", "assert flip_words('at engine desert music camel of stone') == 'desert_engine'", "assert flip_words('table stone is code') == ''", "assert flip_words('stone window to to window') == 'window_window'", "assert flip_words('') == ''", "assert flip_words('river signal signal go stone') == 'signal_signal'", "assert flip_words('camel data falcon coffee vector') == 'vector_coffee_falcon'"], "test_code": "assert flip_words('apple signal vector data stone') == 'vector_signal'\nassert flip_words('at engine desert music camel of stone') == 'desert_engine'\nassert flip_words('table stone is code') == ''\nassert flip_words('stone window to to window') == 'window_window'\nassert flip_words('') == ''\nassert flip_words('river signal signal go stone') == 'signal_signal'\nassert flip_words('camel data falcon coffee vector') == 'vector_coffee_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('apple signal vector data stone')` يجب أن تُرجع `'vector_signal'`.\nالجواب:", "qhash": "70fc4961c2832ae3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'رنا': 46, 'نور': 10, 'فيصل': 29}\nscores['رنا'] += 2\nscores['هشام'] = 55\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 19])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'رنا': 46, 'نور': 10, 'فيصل': 29}\nscores['رنا'] += 2\nscores['هشام'] = 55\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 19])\n```\nالجواب:", "qhash": "600056d796ccec14", "answer": "4\nهشام\n142\n['رنا', 'فيصل', 'هشام']", "completion": " الناتج:\n```text\n4\nهشام\n142\n['رنا', 'فيصل', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([44, 13, 36, 37, 17, 20]) == [37, 17, 20, 44, 13, 36]", "assert roll([3, -6, 34, 22, 9, 47, 11, -1, 9]) == [11, -1, 9, 3, -6, 34, 22, 9, 47]", "assert roll([-3, 0, 17, -5, 14, 5, 17, 28, 19, 7, 18, 40]) == [7, 18, 40, -3, 0, 17, -5, 14, 5, 17, 28, 19]", "assert roll([10, 20, 16, 38, 18, 24, 31, 38]) == [24, 31, 38, 10, 20, 16, 38, 18]", "assert roll([8, 11, -7, 6, -9, 40, 35, 24, 31, -4, 3, 35]) == [-4, 3, 35, 8, 11, -7, 6, -9, 40, 35, 24, 31]", "assert roll([49, 22, 21, 40, 39, 34, 1]) == [39, 34, 1, 49, 22, 21, 40]", "assert roll([]) == []"], "test_code": "assert roll([44, 13, 36, 37, 17, 20]) == [37, 17, 20, 44, 13, 36]\nassert roll([3, -6, 34, 22, 9, 47, 11, -1, 9]) == [11, -1, 9, 3, -6, 34, 22, 9, 47]\nassert roll([-3, 0, 17, -5, 14, 5, 17, 28, 19, 7, 18, 40]) == [7, 18, 40, -3, 0, 17, -5, 14, 5, 17, 28, 19]\nassert roll([10, 20, 16, 38, 18, 24, 31, 38]) == [24, 31, 38, 10, 20, 16, 38, 18]\nassert roll([8, 11, -7, 6, -9, 40, 35, 24, 31, -4, 3, 35]) == [-4, 3, 35, 8, 11, -7, 6, -9, 40, 35, 24, 31]\nassert roll([49, 22, 21, 40, 39, 34, 1]) == [39, 34, 1, 49, 22, 21, 40]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 3 % 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 = 3 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return ____\n```\nمثال: `roll([44, 13, 36, 37, 17, 20])` يجب أن تُرجع `[37, 17, 20, 44, 13, 36]`.\nالجواب:", "qhash": "9ff16a6c5e195a11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'سلام صديق'\nprint(kalima.find('ق'))\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'سلام صديق'\nprint(kalima.find('ق'))\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))\n```\nالجواب:", "qhash": "10d08a95622cba90", "answer": "8\n8\n9", "completion": " الناتج:\n```text\n8\n8\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "tests": ["assert scaled_powers(4) == 400", "assert scaled_powers(4) == 400", "assert scaled_powers(9) == 8100", "assert scaled_powers(3) == 144", "assert scaled_powers(12) == 24336", "assert scaled_powers(1) == 4", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(4) == 400\nassert scaled_powers(4) == 400\nassert scaled_powers(9) == 8100\nassert scaled_powers(3) == 144\nassert scaled_powers(12) == 24336\nassert scaled_powers(1) == 4\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(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 scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(4)` يُرجع `400`.\nالجواب:", "qhash": "d56510fbd55c2a48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -5 * x ** 2 + (8) * x + (0)", "tests": ["assert quad(10) == -420", "assert quad(-9) == -477", "assert quad(-2) == -36", "assert quad(-19) == -1957", "assert quad(-18) == -1764", "assert quad(15) == -1005", "assert quad(1) == 3", "assert quad(0) == 0"], "test_code": "assert quad(10) == -420\nassert quad(-9) == -477\nassert quad(-2) == -36\nassert quad(-19) == -1957\nassert quad(-18) == -1764\nassert quad(15) == -1005\nassert quad(1) == 3\nassert quad(0) == 0", "answer": "def quad(x):\n return -5 * x ** 2 + (8) * x + (0)", "completion": " ```python\ndef quad(x):\n return -5 * x ** 2 + (8) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -5x² + 8x + 0 عند العدد الصحيح x.\nمثال: `quad(10)` يجب أن تُرجع `-420`.\nالجواب:", "qhash": "24f6dd13ba4f1af7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'راشد': 21, 'مريم': 32, 'سعيد': 12, 'سلمى': 17, 'ليلى': 36}\nmarks['سعيد'] += 9\nmarks['يوسف'] = 10\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 = {'راشد': 21, 'مريم': 32, 'سعيد': 12, 'سلمى': 17, 'ليلى': 36}\nmarks['سعيد'] += 9\nmarks['يوسف'] = 10\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": "dfd573d0732fa20a", "answer": "6\nليلى\n137\n[('يوسف', 10), ('سلمى', 17)]", "completion": " الناتج:\n```text\n6\nليلى\n137\n[('يوسف', 10), ('سلمى', 17)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 40) == 1)", "tests": ["assert count_gcd1(118) == 47", "assert count_gcd1(198) == 79", "assert count_gcd1(110) == 44", "assert count_gcd1(131) == 53", "assert count_gcd1(179) == 72", "assert count_gcd1(62) == 25", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(118) == 47\nassert count_gcd1(198) == 79\nassert count_gcd1(110) == 44\nassert count_gcd1(131) == 53\nassert count_gcd1(179) == 72\nassert count_gcd1(62) == 25\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, 40) == 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, 40) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 40، أي أن القاسم المشترك الأكبر لها مع 40 يساوي 1.\nمثال: `count_gcd1(118)` يجب أن تُرجع `47`.\nالجواب:", "qhash": "48942493dd6a2bbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([39, 5, 52, 54, 37, 13]) == 1", "assert count_matching([11, 59, 78, 67, 55, -20, 90, 24, 63]) == 3", "assert count_matching([]) == 0", "assert count_matching([-2, 11, 29, 20, -14, 28, 23, 67, 73, -34, 49, -12]) == 1", "assert count_matching([-26, 76, 37, -31, -4, 81, 52, 12, -13]) == 0", "assert count_matching([82, 19, 77, -19, 87, 24, -38, -35, 54]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([39, 5, 52, 54, 37, 13]) == 1\nassert count_matching([11, 59, 78, 67, 55, -20, 90, 24, 63]) == 3\nassert count_matching([]) == 0\nassert count_matching([-2, 11, 29, 20, -14, 28, 23, 67, 73, -34, 49, -12]) == 1\nassert count_matching([-26, 76, 37, -31, -4, 81, 52, 12, -13]) == 0\nassert count_matching([82, 19, 77, -19, 87, 24, -38, -35, 54]) == 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 % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([39, 5, 52, 54, 37, 13])` يُرجع `1`.\nالجواب:", "qhash": "2ece9dbe0e5548ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'ليلى': 49, 'يوسف': 45, 'خالد': 7, 'وليد': 18, 'سلمى': 4}\nd['يوسف'] += 5\nd['باسل'] = 48\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 = {'ليلى': 49, 'يوسف': 45, 'خالد': 7, 'وليد': 18, 'سلمى': 4}\nd['يوسف'] += 5\nd['باسل'] = 48\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": "16bb03d51d6050dc", "answer": "6\nيوسف\n176\n[('سلمى', 4), ('خالد', 7)]", "completion": " الناتج:\n```text\n6\nيوسف\n176\n[('سلمى', 4), ('خالد', 7)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=2):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(f(13))\nprint(f(13, -2))\nprint(f(f(-2), 13))", "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(13))\nprint(f(13, -2))\nprint(f(f(-2), 13))\n```\nالجواب:", "qhash": "731afbfe304f8af7", "answer": "-2\n2\n-2", "completion": " الناتج:\n```text\n-2\n2\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 5 * x ** 2 + (-2) * x + (-5)", "tests": ["assert poly(7) == 226", "assert poly(-6) == 187", "assert poly(-14) == 1003", "assert poly(-16) == 1307", "assert poly(9) == 382", "assert poly(-4) == 83", "assert poly(-14) == 1003", "assert poly(0) == -5"], "test_code": "assert poly(7) == 226\nassert poly(-6) == 187\nassert poly(-14) == 1003\nassert poly(-16) == 1307\nassert poly(9) == 382\nassert poly(-4) == 83\nassert poly(-14) == 1003\nassert poly(0) == -5", "answer": "def poly(x):\n return 5 * x ** 2 + (-2) * x + (-5)", "completion": " ```python\ndef poly(x):\n return 5 * x ** 2 + (-2) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 5x² - 2x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(7)` يُرجع `226`.\nالجواب:", "qhash": "60aa163237a03586"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert cycle([28, 18, 44, 15]) == [18, 44, 15, 28]", "assert cycle([20, 9]) == [9, 20]", "assert cycle([41, 0, 11]) == [11, 41, 0]", "assert cycle([31, 44, 31, 33, 16, -9, 36, 27]) == [-9, 36, 27, 31, 44, 31, 33, 16]", "assert cycle([10, 49]) == [49, 10]", "assert cycle([21, 1]) == [1, 21]", "assert cycle([]) == []"], "test_code": "assert cycle([28, 18, 44, 15]) == [18, 44, 15, 28]\nassert cycle([20, 9]) == [9, 20]\nassert cycle([41, 0, 11]) == [11, 41, 0]\nassert cycle([31, 44, 31, 33, 16, -9, 36, 27]) == [-9, 36, 27, 31, 44, 31, 33, 16]\nassert cycle([10, 49]) == [49, 10]\nassert cycle([21, 1]) == [1, 21]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([28, 18, 44, 15])` يُرجع `[18, 44, 15, 28]`.\nالجواب:", "qhash": "e53b376709efdb5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 41", "tests": ["assert fact_mod(11) == 20", "assert fact_mod(31) == 26", "assert fact_mod(47) == 0", "assert fact_mod(22) == 17", "assert fact_mod(21) == 25", "assert fact_mod(7) == 38", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 20\nassert fact_mod(31) == 26\nassert fact_mod(47) == 0\nassert fact_mod(22) == 17\nassert fact_mod(21) == 25\nassert fact_mod(7) == 38\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 41", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(11)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "107a3e652abbe4fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 37", "tests": ["assert digit_score(48481) == 6", "assert digit_score(913055) == 8", "assert digit_score(16685) == 34", "assert digit_score(848611) == 11", "assert digit_score(144995) == 10", "assert digit_score(343204) == 5", "assert digit_score(489042) == 8", "assert digit_score(0) == 0"], "test_code": "assert digit_score(48481) == 6\nassert digit_score(913055) == 8\nassert digit_score(16685) == 34\nassert digit_score(848611) == 11\nassert digit_score(144995) == 10\nassert digit_score(343204) == 5\nassert digit_score(489042) == 8\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 37", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 37.\nمثال: `digit_score(48481)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "5b7425aea037ee61"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'dgo'}", "tests": ["assert char_counts('to summer camel of') == {'d': 0, 'g': 0, 'o': 2}", "assert char_counts('it planet go a') == {'d': 0, 'g': 1, 'o': 1}", "assert char_counts('vector cloud') == {'d': 1, 'g': 0, 'o': 2}", "assert char_counts('it a we it table light') == {'d': 0, 'g': 1, 'o': 0}", "assert char_counts('of desert up brain a') == {'d': 1, 'g': 0, 'o': 1}", "assert char_counts('falcon of go') == {'d': 0, 'g': 1, 'o': 3}", "assert char_counts('') == {'d': 0, 'g': 0, 'o': 0}"], "test_code": "assert char_counts('to summer camel of') == {'d': 0, 'g': 0, 'o': 2}\nassert char_counts('it planet go a') == {'d': 0, 'g': 1, 'o': 1}\nassert char_counts('vector cloud') == {'d': 1, 'g': 0, 'o': 2}\nassert char_counts('it a we it table light') == {'d': 0, 'g': 1, 'o': 0}\nassert char_counts('of desert up brain a') == {'d': 1, 'g': 0, 'o': 1}\nassert char_counts('falcon of go') == {'d': 0, 'g': 1, 'o': 3}\nassert char_counts('') == {'d': 0, 'g': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'dgo'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'dgo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'g'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('to summer camel of')` يجب أن تُرجع `{'d': 0, 'g': 0, 'o': 2}`.\nالجواب:", "qhash": "49f8472f38110eda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -2 * x ** 2 + (4) * x + (3)", "tests": ["assert p(3) == -3", "assert p(-16) == -573", "assert p(-14) == -445", "assert p(-2) == -13", "assert p(1) == 5", "assert p(20) == -717", "assert p(-16) == -573", "assert p(0) == 3"], "test_code": "assert p(3) == -3\nassert p(-16) == -573\nassert p(-14) == -445\nassert p(-2) == -13\nassert p(1) == 5\nassert p(20) == -717\nassert p(-16) == -573\nassert p(0) == 3", "answer": "def p(x):\n return -2 * x ** 2 + (4) * x + (3)", "completion": " ```python\ndef p(x):\n return -2 * x ** 2 + (4) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -2x² + 4x + 3 عند العدد الصحيح x.\nمثال: `p(3)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "7b9d1fd36a9aff5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.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('وردة برمجة مدينة رمل وردة') == 2", "assert starts_count('ليل وردة رمل وردة قمر') == 2", "assert starts_count('وردة وردة معلم سلام بحر خبز ميناء دفتر') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('نهار طائرة طائرة حاسوب ليل رمل') == 0\nassert starts_count('ليل علم حديقة طالب وردة حديقة') == 1\nassert starts_count('كتاب نور تفاحة وردة كتاب وردة') == 2\nassert starts_count('وردة برمجة مدينة رمل وردة') == 2\nassert starts_count('ليل وردة رمل وردة قمر') == 2\nassert starts_count('وردة وردة معلم سلام بحر خبز ميناء دفتر') == 2\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(line):\n count = 0\n for w in line.split():\n if w.endswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('نهار طائرة طائرة حاسوب ليل رمل')` يُرجع `0`.\nالجواب:", "qhash": "245ec74c742b9866"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'رنا': 8, 'فيصل': 20, 'سعيد': 29}\nd['سعيد'] += 4\nd['علي'] = 23\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 26])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'رنا': 8, 'فيصل': 20, 'سعيد': 29}\nd['سعيد'] += 4\nd['علي'] = 23\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 26])\n```\nالجواب:", "qhash": "3a39aedab9fa605b", "answer": "4\nسعيد\n84\n['سعيد']", "completion": " الناتج:\n```text\n4\nسعيد\n84\n['سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'منى': 29, 'زينب': 32, 'حسن': 4, 'ليلى': 43}\nd['ليلى'] += 17\nd['فيصل'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 30])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'منى': 29, 'زينب': 32, 'حسن': 4, 'ليلى': 43}\nd['ليلى'] += 17\nd['فيصل'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 30])\n```\nالجواب:", "qhash": "b93f0ac47b162c9d", "answer": "5\nليلى\n130\n['زينب', 'ليلى']", "completion": " الناتج:\n```text\n5\nليلى\n130\n['زينب', 'ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'فيصل': 38, 'رنا': 24, 'أحمد': 35, 'هشام': 11}\nd['رنا'] += 20\nd['وليد'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('رنا', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'فيصل': 38, 'رنا': 24, 'أحمد': 35, 'هشام': 11}\nd['رنا'] += 20\nd['وليد'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('رنا', -1))\n```\nالجواب:", "qhash": "ef690efd6b16960f", "answer": "5\nرنا\n161\n44", "completion": " الناتج:\n```text\n5\nرنا\n161\n44\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'حاسوب رمل'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint('ح' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'حاسوب رمل'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint('ح' in s)\n```\nالجواب:", "qhash": "6b272c681a8d4990", "answer": "9\nحاسوب-رمل\nTrue", "completion": " الناتج:\n```text\n9\nحاسوب-رمل\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [2, 1, 27, 33, 33, 2, 11]\nprint(sorted(nums, key=lambda x: (abs(x - -4), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [2, 1, 27, 33, 33, 2, 11]\nprint(sorted(nums, key=lambda x: (abs(x - -4), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "fdde737fc6c9e5ca", "answer": "[1, 2, 2, 11, 27, 33, 33]\n[33, 33, 27]", "completion": " الناتج:\n```text\n[1, 2, 2, 11, 27, 33, 33]\n[33, 33, 27]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "tests": ["assert sum_powers(5) == 900", "assert sum_powers(3) == 144", "assert sum_powers(9) == 8100", "assert sum_powers(8) == 5184", "assert sum_powers(5) == 900", "assert sum_powers(1) == 4", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 900\nassert sum_powers(3) == 144\nassert sum_powers(9) == 8100\nassert sum_powers(8) == 5184\nassert sum_powers(5) == 900\nassert sum_powers(1) == 4\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 3\n return total\n```\nمثال: `sum_powers(5)` يجب أن تُرجع `900`.\nالجواب:", "qhash": "937a95a56d62f0a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate([44, 48, 11, 9, 33, 24]) == [48, 11, 9, 33, 24, 44]", "assert rotate([14, 13, 30, 43, 19]) == [30, 43, 19, 14, 13]", "assert rotate([6, -6, 4, 45, 2, 29, 6, 8, 22, 42, 20]) == [8, 22, 42, 20, 6, -6, 4, 45, 2, 29, 6]", "assert rotate([24, 6, -2, 44, 9, 1, -7, 8, 12, 4]) == [8, 12, 4, 24, 6, -2, 44, 9, 1, -7]", "assert rotate([36]) == [36]", "assert rotate([0, -5, 48, 50, -4, -3, 41, 50]) == [50, 0, -5, 48, 50, -4, -3, 41]", "assert rotate([]) == []"], "test_code": "assert rotate([44, 48, 11, 9, 33, 24]) == [48, 11, 9, 33, 24, 44]\nassert rotate([14, 13, 30, 43, 19]) == [30, 43, 19, 14, 13]\nassert rotate([6, -6, 4, 45, 2, 29, 6, 8, 22, 42, 20]) == [8, 22, 42, 20, 6, -6, 4, 45, 2, 29, 6]\nassert rotate([24, 6, -2, 44, 9, 1, -7, 8, 12, 4]) == [8, 12, 4, 24, 6, -2, 44, 9, 1, -7]\nassert rotate([36]) == [36]\nassert rotate([0, -5, 48, 50, -4, -3, 41, 50]) == [50, 0, -5, 48, 50, -4, -3, 41]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([44, 48, 11, 9, 33, 24])` يُرجع `[48, 11, 9, 33, 24, 44]`.\nالجواب:", "qhash": "2abde185b4027189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('winter light river by matrix falcon') == 'falcon/matrix/winter'", "assert invert_words('stone orange river light cloud at summer orange') == 'orange/summer/orange'", "assert invert_words('is a engine matrix planet window pixel') == 'window/planet/matrix/engine'", "assert invert_words('') == ''", "assert invert_words('garden desert by at python') == 'python/desert/garden'", "assert invert_words('data go stone') == ''", "assert invert_words('up river up garden winter rocket stone at') == 'rocket/winter/garden'"], "test_code": "assert invert_words('winter light river by matrix falcon') == 'falcon/matrix/winter'\nassert invert_words('stone orange river light cloud at summer orange') == 'orange/summer/orange'\nassert invert_words('is a engine matrix planet window pixel') == 'window/planet/matrix/engine'\nassert invert_words('') == ''\nassert invert_words('garden desert by at python') == 'python/desert/garden'\nassert invert_words('data go stone') == ''\nassert invert_words('up river up garden winter rocket stone at') == 'rocket/winter/garden'", "answer": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `invert_words('winter light river by matrix falcon')` يُرجع `'falcon/matrix/winter'`.\nالجواب:", "qhash": "cfafef19f95687fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'ماء'\nprint(text.find('م'))\nprint(text.split())\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'ماء'\nprint(text.find('م'))\nprint(text.split())\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "8920080c179b2786", "answer": "0\n['ماء']\n3", "completion": " الناتج:\n```text\n0\n['ماء']\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 53", "tests": ["assert step_product(3) == 3", "assert step_product(43) == 49", "assert step_product(35) == 5", "assert step_product(25) == 43", "assert step_product(41) == 52", "assert step_product(44) == 9", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(43) == 49\nassert step_product(35) == 5\nassert step_product(25) == 43\nassert step_product(41) == 52\nassert step_product(44) == 9\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 53", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 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": "b50a76eb540f3d89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'عمر': 3, 'حسن': 40, 'باسل': 19, 'رنا': 32}\nmarks['رنا'] += 13\nmarks['سعيد'] = 56\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 28])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'عمر': 3, 'حسن': 40, 'باسل': 19, 'رنا': 32}\nmarks['رنا'] += 13\nmarks['سعيد'] = 56\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 28])\n```\nالجواب:", "qhash": "b17c8b7355803bce", "answer": "5\nسعيد\n163\n['حسن', 'رنا', 'سعيد']", "completion": " الناتج:\n```text\n5\nسعيد\n163\n['حسن', 'رنا', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'summer_coffee'\nprint(name.index('u') + len(name))\nprint(name[::-1])\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'summer_coffee'\nprint(name.index('u') + len(name))\nprint(name[::-1])\nprint(name.split('_'))\n```\nالجواب:", "qhash": "f5592cc6898c567a", "answer": "14\neeffoc_remmus\n['summer', 'coffee']", "completion": " الناتج:\n```text\n14\neeffoc_remmus\n['summer', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 9) // 2 for x in range(-3, 7) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 9) // 2 for x in range(-3, 7) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "cc22fa4507d431da", "answer": "[3, 4, 5, 6, 7]\n5 25", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7]\n5 25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert spin([8, 43, 38, 3, 50, 18, 28, 39]) == [50, 18, 28, 39, 8, 43, 38, 3]", "assert spin([36, 42, 7, 49, 12]) == [12, 36, 42, 7, 49]", "assert spin([43, 45, 23, 20, 1]) == [1, 43, 45, 23, 20]", "assert spin([33, 49, 1, -3, 13, 31, 43, 43, 37, 9, 14, 35]) == [13, 31, 43, 43, 37, 9, 14, 35, 33, 49, 1, -3]", "assert spin([33, 18, 30]) == [18, 30, 33]", "assert spin([0, 33]) == [0, 33]", "assert spin([]) == []"], "test_code": "assert spin([8, 43, 38, 3, 50, 18, 28, 39]) == [50, 18, 28, 39, 8, 43, 38, 3]\nassert spin([36, 42, 7, 49, 12]) == [12, 36, 42, 7, 49]\nassert spin([43, 45, 23, 20, 1]) == [1, 43, 45, 23, 20]\nassert spin([33, 49, 1, -3, 13, 31, 43, 43, 37, 9, 14, 35]) == [13, 31, 43, 43, 37, 9, 14, 35, 33, 49, 1, -3]\nassert spin([33, 18, 30]) == [18, 30, 33]\nassert spin([0, 33]) == [0, 33]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return ____\n```\nمثال: `spin([8, 43, 38, 3, 50, 18, 28, 39])` يجب أن تُرجع `[50, 18, 28, 39, 8, 43, 38, 3]`.\nالجواب:", "qhash": "7c88510799976fd8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 19\nfor j in range(10, 23, 3):\n result -= j * 1\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 19\nfor j in range(10, 23, 3):\n result -= j * 1\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "d3b847f8466d4ffc", "answer": "-61\n22", "completion": " الناتج:\n```text\n-61\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [8, 27, 27, 0, 8]\nprint(xs[3:5])\nprint(xs[::3])\nprint(sum(xs[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [8, 27, 27, 0, 8]\nprint(xs[3:5])\nprint(xs[::3])\nprint(sum(xs[3:5]))\n```\nالجواب:", "qhash": "e9611e9f740eba6d", "answer": "[0, 8]\n[8, 0]\n8", "completion": " الناتج:\n```text\n[0, 8]\n[8, 0]\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "tests": ["assert add_multiples(81) == 714", "assert add_multiples(170) == 3108", "assert add_multiples(0) == 0", "assert add_multiples(103) == 1083", "assert add_multiples(60) == 372", "assert add_multiples(122) == 1647", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(81) == 714\nassert add_multiples(170) == 3108\nassert add_multiples(0) == 0\nassert add_multiples(103) == 1083\nassert add_multiples(60) == 372\nassert add_multiples(122) == 1647\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 % 12 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(81)` يُرجع `714`.\nالجواب:", "qhash": "03fdf0c8a21c0fd8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'camel'\nprint(word[::-1])\nprint(word[3:4])\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'camel'\nprint(word[::-1])\nprint(word[3:4])\nprint(word.split('_'))\n```\nالجواب:", "qhash": "247c8607a5aa4a92", "answer": "lemac\ne\n['camel']", "completion": " الناتج:\n```text\nlemac\ne\n['camel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(6))\n```\nالجواب:", "qhash": "f5c17956ce904d07", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'علي': 40, 'فيصل': 32, 'عمر': 49}\nscores['عمر'] += 4\nscores['أحمد'] = 53\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 = {'علي': 40, 'فيصل': 32, 'عمر': 49}\nscores['عمر'] += 4\nscores['أحمد'] = 53\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": "6bace40a8917e1a6", "answer": "4\nعمر\n178\n[('فيصل', 32), ('علي', 40)]", "completion": " الناتج:\n```text\n4\nعمر\n178\n[('فيصل', 32), ('علي', 40)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'bdl'}", "tests": ["assert char_counts('in vector vector window at vector') == {'b': 0, 'd': 1, 'l': 0}", "assert char_counts('garden apple go pixel vector') == {'b': 0, 'd': 1, 'l': 2}", "assert char_counts('to at by brain') == {'b': 2, 'd': 0, 'l': 0}", "assert char_counts('coffee winter it') == {'b': 0, 'd': 0, 'l': 0}", "assert char_counts('garden river by table on a') == {'b': 2, 'd': 1, 'l': 1}", "assert char_counts('falcon stone it code') == {'b': 0, 'd': 1, 'l': 1}", "assert char_counts('') == {'b': 0, 'd': 0, 'l': 0}"], "test_code": "assert char_counts('in vector vector window at vector') == {'b': 0, 'd': 1, 'l': 0}\nassert char_counts('garden apple go pixel vector') == {'b': 0, 'd': 1, 'l': 2}\nassert char_counts('to at by brain') == {'b': 2, 'd': 0, 'l': 0}\nassert char_counts('coffee winter it') == {'b': 0, 'd': 0, 'l': 0}\nassert char_counts('garden river by table on a') == {'b': 2, 'd': 1, 'l': 1}\nassert char_counts('falcon stone it code') == {'b': 0, 'd': 1, 'l': 1}\nassert char_counts('') == {'b': 0, 'd': 0, 'l': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'bdl'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'bdl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'd'، 'l' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('in vector vector window at vector')` يجب أن تُرجع `{'b': 0, 'd': 1, 'l': 0}`.\nالجواب:", "qhash": "095d33d6dba3c3b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('نور', 68), ('زينب', 64), ('حسن', 80), ('منى', 31)]\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 = [('نور', 68), ('زينب', 64), ('حسن', 80), ('منى', 31)]\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": "ab854b5b3590d09b", "answer": "[('منى', 31), ('زينب', 64), ('نور', 68), ('حسن', 80)]\n['حسن', 'نور']", "completion": " الناتج:\n```text\n[('منى', 31), ('زينب', 64), ('نور', 68), ('حسن', 80)]\n['حسن', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 218\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 = 218\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": "a6ead0bd7dcd6cec", "answer": "114", "completion": " الناتج:\n```text\n114\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'سلام عمل'\nprint(kalima[0])\nprint(kalima.find('ا'))\nprint(kalima[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'سلام عمل'\nprint(kalima[0])\nprint(kalima.find('ا'))\nprint(kalima[::-1])\n```\nالجواب:", "qhash": "7c1d93374f5ac956", "answer": "س\n2\nلمع مالس", "completion": " الناتج:\n```text\nس\n2\nلمع مالس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(0, 6))", "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, 6))\n```\nالجواب:", "qhash": "dc18f5a18d268580", "answer": "0", "completion": " الناتج:\n```text\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 111:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([16, 36, 44, 37, 15, 31, 30, 16]) == [16, 52, 96, 0, 15, 46, 76, 92]", "assert running_sum([75, 33, 89, 19, 31, 69]) == [75, 108, 0, 19, 50, 0]", "assert running_sum([33, 66, 77, 36, 21, 72]) == [33, 99, 0, 36, 57, 0]", "assert running_sum([49, 89, 47, 20, 63, 83]) == [49, 0, 47, 67, 0, 83]", "assert running_sum([23, 104, 93, 20]) == [23, 0, 93, 0]", "assert running_sum([]) == []", "assert running_sum([]) == []"], "test_code": "assert running_sum([16, 36, 44, 37, 15, 31, 30, 16]) == [16, 52, 96, 0, 15, 46, 76, 92]\nassert running_sum([75, 33, 89, 19, 31, 69]) == [75, 108, 0, 19, 50, 0]\nassert running_sum([33, 66, 77, 36, 21, 72]) == [33, 99, 0, 36, 57, 0]\nassert running_sum([49, 89, 47, 20, 63, 83]) == [49, 0, 47, 67, 0, 83]\nassert running_sum([23, 104, 93, 20]) == [23, 0, 93, 0]\nassert running_sum([]) == []\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 111:\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 > 111:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 111 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([16, 36, 44, 37, 15, 31, 30, 16])` يُرجع `[16, 52, 96, 0, 15, 46, 76, 92]`.\nالجواب:", "qhash": "509bfb435643eed0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([12, 4, 39, 22, 37]) == [12, 4, 39, 22, 37]", "assert rotate_by([4, 14, 25, 42, 7, 37, 38, 27, 4, 0, 44, -2]) == [37, 38, 27, 4, 0, 44, -2, 4, 14, 25, 42, 7]", "assert rotate_by([36, 5, 46, 31]) == [5, 46, 31, 36]", "assert rotate_by([33, 24, -7, 49, -2, 11, 10, 49, 28, 37]) == [11, 10, 49, 28, 37, 33, 24, -7, 49, -2]", "assert rotate_by([17, 12, 6]) == [6, 17, 12]", "assert rotate_by([30, 28, 28]) == [28, 30, 28]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([12, 4, 39, 22, 37]) == [12, 4, 39, 22, 37]\nassert rotate_by([4, 14, 25, 42, 7, 37, 38, 27, 4, 0, 44, -2]) == [37, 38, 27, 4, 0, 44, -2, 4, 14, 25, 42, 7]\nassert rotate_by([36, 5, 46, 31]) == [5, 46, 31, 36]\nassert rotate_by([33, 24, -7, 49, -2, 11, 10, 49, 28, 37]) == [11, 10, 49, 28, 37, 33, 24, -7, 49, -2]\nassert rotate_by([17, 12, 6]) == [6, 17, 12]\nassert rotate_by([30, 28, 28]) == [28, 30, 28]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([12, 4, 39, 22, 37])` يُرجع `[12, 4, 39, 22, 37]`.\nالجواب:", "qhash": "b9a38e2580de4a89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "tests": ["assert total_pow(5) == 3916", "assert total_pow(15) == 713248", "assert total_pow(12) == 242840", "assert total_pow(2) == 68", "assert total_pow(7) == 18704", "assert total_pow(1) == 4", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 3916\nassert total_pow(15) == 713248\nassert total_pow(12) == 242840\nassert total_pow(2) == 68\nassert total_pow(7) == 18704\nassert total_pow(1) == 4\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `total_pow(5)` يُرجع `3916`.\nالجواب:", "qhash": "baa582c9a6fa684a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [30, 9, -11, 26, 27, 34, 34, 36]\nprint(sorted(nums, key=lambda x: (abs(x - -9), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [30, 9, -11, 26, 27, 34, 34, 36]\nprint(sorted(nums, key=lambda x: (abs(x - -9), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "91d8667a01fb0514", "answer": "[-11, 9, 26, 27, 30, 34, 34, 36]\n[36, 34, 34]", "completion": " الناتج:\n```text\n[-11, 9, 26, 27, 30, 34, 34, 36]\n[36, 34, 34]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "how_many", "reference": "def how_many(text):\n return text.count('د')", "tests": ["assert how_many('علم قمر خبز لغة نهار فجر باب بيت') == 0", "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"], "test_code": "assert how_many('علم قمر خبز لغة نهار فجر باب بيت') == 0\nassert 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", "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": "d645697697ea4cbb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(180) == 2610", "assert multiples_total(255) == 5418", "assert multiples_total(232) == 4449", "assert multiples_total(243) == 4923", "assert multiples_total(76) == 468", "assert multiples_total(111) == 1026", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(180) == 2610\nassert multiples_total(255) == 5418\nassert multiples_total(232) == 4449\nassert multiples_total(243) == 4923\nassert multiples_total(76) == 468\nassert multiples_total(111) == 1026\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 12.\nمثال: `multiples_total(180)` يجب أن تُرجع `2610`.\nالجواب:", "qhash": "e9106e5e8dfdbcd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(345562936))\nprint(rec(rec(345562936)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(345562936))\nprint(rec(rec(345562936)))\n```\nالجواب:", "qhash": "6b758ac9987d724d", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 7 for x in range(-1, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 7 for x in range(-1, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "0716d7f02722862b", "answer": "[-6, -6, 2, 18, 42, 74]\n6 124", "completion": " الناتج:\n```text\n[-6, -6, 2, 18, 42, 74]\n6 124\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([26, 92, 47, 41, 79, 11, 65, 16, 72, 37]) == [26, 118, 165, 0, 79, 90, 155, 171, 0, 37]", "assert rolling_total([21, 163, 27]) == [21, 0, 27]", "assert rolling_total([34, 23, 121, 169, 110]) == [34, 57, 0, 169, 0]", "assert rolling_total([14, -9, 27, 16, 81, 153, 129, 151]) == [14, 5, 32, 48, 129, 0, 129, 0]", "assert rolling_total([11]) == [11]", "assert rolling_total([167, 19, -4, 106]) == [167, 0, -4, 102]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([26, 92, 47, 41, 79, 11, 65, 16, 72, 37]) == [26, 118, 165, 0, 79, 90, 155, 171, 0, 37]\nassert rolling_total([21, 163, 27]) == [21, 0, 27]\nassert rolling_total([34, 23, 121, 169, 110]) == [34, 57, 0, 169, 0]\nassert rolling_total([14, -9, 27, 16, 81, 153, 129, 151]) == [14, 5, 32, 48, 129, 0, 129, 0]\nassert rolling_total([11]) == [11]\nassert rolling_total([167, 19, -4, 106]) == [167, 0, -4, 102]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\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 > 175:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 175 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([26, 92, 47, 41, 79, 11, 65, 16, 72, 37])` يجب أن تُرجع `[26, 118, 165, 0, 79, 90, 155, 171, 0, 37]`.\nالجواب:", "qhash": "cb398dda68f103cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'agim'}", "tests": ["assert char_freq('banana falcon is rocket it a') == {'a': 5, 'g': 0, 'i': 2, 'm': 0}", "assert char_freq('river python vector cloud it') == {'a': 0, 'g': 0, 'i': 2, 'm': 0}", "assert char_freq('stone up a banana') == {'a': 4, 'g': 0, 'i': 0, 'm': 0}", "assert char_freq('to it') == {'a': 0, 'g': 0, 'i': 1, 'm': 0}", "assert char_freq('window banana music desert window') == {'a': 3, 'g': 0, 'i': 3, 'm': 1}", "assert char_freq('planet code orange signal up banana') == {'a': 6, 'g': 2, 'i': 1, 'm': 0}", "assert char_freq('') == {'a': 0, 'g': 0, 'i': 0, 'm': 0}"], "test_code": "assert char_freq('banana falcon is rocket it a') == {'a': 5, 'g': 0, 'i': 2, 'm': 0}\nassert char_freq('river python vector cloud it') == {'a': 0, 'g': 0, 'i': 2, 'm': 0}\nassert char_freq('stone up a banana') == {'a': 4, 'g': 0, 'i': 0, 'm': 0}\nassert char_freq('to it') == {'a': 0, 'g': 0, 'i': 1, 'm': 0}\nassert char_freq('window banana music desert window') == {'a': 3, 'g': 0, 'i': 3, 'm': 1}\nassert char_freq('planet code orange signal up banana') == {'a': 6, 'g': 2, 'i': 1, 'm': 0}\nassert char_freq('') == {'a': 0, 'g': 0, 'i': 0, 'm': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'agim'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'agim'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'g'، 'i'، 'm' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('banana falcon is rocket it a')` يجب أن تُرجع `{'a': 5, 'g': 0, 'i': 2, 'm': 0}`.\nالجواب:", "qhash": "f439bdea4d73a60f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('in') == 'ns'", "assert rotate_letters('summer planet') == 'xzrrjw uqfsjy'", "assert rotate_letters('desert 2024') == 'ijxjwy 2024'", "assert rotate_letters('desert an data signal to') == 'ijxjwy fs ifyf xnlsfq yt'", "assert rotate_letters('orange by code') == 'twfslj gd htij'", "assert rotate_letters('pixel a summer is') == 'uncjq f xzrrjw nx'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('in') == 'ns'\nassert rotate_letters('summer planet') == 'xzrrjw uqfsjy'\nassert rotate_letters('desert 2024') == 'ijxjwy 2024'\nassert rotate_letters('desert an data signal to') == 'ijxjwy fs ifyf xnlsfq yt'\nassert rotate_letters('orange by code') == 'twfslj gd htij'\nassert rotate_letters('pixel a summer is') == 'uncjq f xzrrjw nx'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('in')` يجب أن تُرجع `'ns'`.\nالجواب:", "qhash": "0240786bd437810f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(8, 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(8, 5))\n```\nالجواب:", "qhash": "f834db5646d18d96", "answer": "32768", "completion": " الناتج:\n```text\n32768\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 4 for x in range(0, 5) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 4 for x in range(0, 5) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "c8fa82216eddc494", "answer": "[0]\n1 0", "completion": " الناتج:\n```text\n[0]\n1 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert weighted_sum(4) == 80", "assert weighted_sum(9) == 360", "assert weighted_sum(10) == 440", "assert weighted_sum(8) == 288", "assert weighted_sum(6) == 168", "assert weighted_sum(1) == 8", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 80\nassert weighted_sum(9) == 360\nassert weighted_sum(10) == 440\nassert weighted_sum(8) == 288\nassert weighted_sum(6) == 168\nassert weighted_sum(1) == 8\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(4)` يُرجع `80`.\nالجواب:", "qhash": "921786a452ba93b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "tests": ["assert power_sum(5) == 1575", "assert power_sum(3) == 252", "assert power_sum(14) == 77175", "assert power_sum(15) == 100800", "assert power_sum(14) == 77175", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 1575\nassert power_sum(3) == 252\nassert power_sum(14) == 77175\nassert power_sum(15) == 100800\nassert power_sum(14) == 77175\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 ** 3\n return total", "completion": " ```python\ndef power_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 power_sum(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 power_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `power_sum(5)` يُرجع `1575`.\nالجواب:", "qhash": "79ac27564b1d7238"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 145:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([6, 18, 9, 13, 26, 65, 23, 65]) == [6, 24, 33, 46, 72, 137, 0, 65]", "assert capped_cumsum([18, 35, 93, 121, 39]) == [18, 53, 0, 121, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([103, 38, 128, 20, 132, 140, 3, 13, 108]) == [103, 141, 0, 20, 0, 140, 143, 0, 108]", "assert capped_cumsum([87]) == [87]", "assert capped_cumsum([134, 68, 86, 131, 50, 31]) == [134, 0, 86, 0, 50, 81]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([6, 18, 9, 13, 26, 65, 23, 65]) == [6, 24, 33, 46, 72, 137, 0, 65]\nassert capped_cumsum([18, 35, 93, 121, 39]) == [18, 53, 0, 121, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([103, 38, 128, 20, 132, 140, 3, 13, 108]) == [103, 141, 0, 20, 0, 140, 143, 0, 108]\nassert capped_cumsum([87]) == [87]\nassert capped_cumsum([134, 68, 86, 131, 50, 31]) == [134, 0, 86, 0, 50, 81]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 145:\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 > 145:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 145 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([6, 18, 9, 13, 26, 65, 23, 65])` يجب أن تُرجع `[6, 24, 33, 46, 72, 137, 0, 65]`.\nالجواب:", "qhash": "b75a3050eb25a8fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -8 * x ** 2 + (8) * x + (3)", "tests": ["assert evaluate(5) == -157", "assert evaluate(-17) == -2445", "assert evaluate(-6) == -333", "assert evaluate(-11) == -1053", "assert evaluate(10) == -717", "assert evaluate(18) == -2445", "assert evaluate(3) == -45", "assert evaluate(0) == 3"], "test_code": "assert evaluate(5) == -157\nassert evaluate(-17) == -2445\nassert evaluate(-6) == -333\nassert evaluate(-11) == -1053\nassert evaluate(10) == -717\nassert evaluate(18) == -2445\nassert evaluate(3) == -45\nassert evaluate(0) == 3", "answer": "def evaluate(x):\n return -8 * x ** 2 + (8) * x + (3)", "completion": " ```python\ndef evaluate(x):\n return -8 * x ** 2 + (8) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -8x² + 8x + 3 عند العدد الصحيح x.\nمثال: `evaluate(5)` يجب أن تُرجع `-157`.\nالجواب:", "qhash": "3631c65f35ed2af2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 66:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([33, 1, 14, 10, 28]) == [33, 34, 48, 58, 0]", "assert acc_reset([11, 24, -9, 2]) == [11, 35, 26, 28]", "assert acc_reset([54, -5, 63, 62, 29, 25, 31, 24]) == [54, 49, 0, 62, 0, 25, 56, 0]", "assert acc_reset([35, 66, 21, 24, 60, 62]) == [35, 0, 21, 45, 0, 62]", "assert acc_reset([65]) == [65]", "assert acc_reset([48, 46, -1, 38, 2, 46, 10, 36]) == [48, 0, -1, 37, 39, 0, 10, 46]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([33, 1, 14, 10, 28]) == [33, 34, 48, 58, 0]\nassert acc_reset([11, 24, -9, 2]) == [11, 35, 26, 28]\nassert acc_reset([54, -5, 63, 62, 29, 25, 31, 24]) == [54, 49, 0, 62, 0, 25, 56, 0]\nassert acc_reset([35, 66, 21, 24, 60, 62]) == [35, 0, 21, 45, 0, 62]\nassert acc_reset([65]) == [65]\nassert acc_reset([48, 46, -1, 38, 2, 46, 10, 36]) == [48, 0, -1, 37, 39, 0, 10, 46]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 66:\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 > 66:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 66 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([33, 1, 14, 10, 28])` يجب أن تُرجع `[33, 34, 48, 58, 0]`.\nالجواب:", "qhash": "be87fcaa375ff376"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'window'\nprint(name.replace('w', '*'))\nprint(name.upper())\nprint(name[3:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'window'\nprint(name.replace('w', '*'))\nprint(name.upper())\nprint(name[3:4])\n```\nالجواب:", "qhash": "5b404a0d57234b74", "answer": "*indo*\nWINDOW\nd", "completion": " الناتج:\n```text\n*indo*\nWINDOW\nd\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قلم نور عمل شجرة حصان') == 0", "assert lead_count('حاسوب قمر جبل مدرسة') == 0", "assert lead_count('نهر علم ليل نهر مكتبة شمس') == 0", "assert lead_count('برتقال برتقال ليل معلم تفاحة عمل نهار') == 2", "assert lead_count('كتاب مكتبة مطر') == 0", "assert lead_count('سلام عربية ماء حاسوب حديقة نهر بحر') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('قلم نور عمل شجرة حصان') == 0\nassert lead_count('حاسوب قمر جبل مدرسة') == 0\nassert lead_count('نهر علم ليل نهر مكتبة شمس') == 0\nassert lead_count('برتقال برتقال ليل معلم تفاحة عمل نهار') == 2\nassert lead_count('كتاب مكتبة مطر') == 0\nassert lead_count('سلام عربية ماء حاسوب حديقة نهر بحر') == 1\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('قلم نور عمل شجرة حصان')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f4a19314648501e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 15)", "tests": ["assert select_range([21, 12, 7, 0]) == [-48, -28]", "assert select_range([36, 5, 25, 32, 21, -17, -1, 45]) == []", "assert select_range([56, 60, 42, 56, -27, -10, -6, -13, 45]) == []", "assert select_range([26, -25, 7, 52, 14, 8]) == [-56, -32, -28]", "assert select_range([-16, 12, 23]) == [-48]", "assert select_range([]) == []", "assert select_range([32, 50, 36, 35, 0, -2, -11, 19, -19, -26]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([21, 12, 7, 0]) == [-48, -28]\nassert select_range([36, 5, 25, 32, 21, -17, -1, 45]) == []\nassert select_range([56, 60, 42, 56, -27, -10, -6, -13, 45]) == []\nassert select_range([26, -25, 7, 52, 14, 8]) == [-56, -32, -28]\nassert select_range([-16, 12, 23]) == [-48]\nassert select_range([]) == []\nassert select_range([32, 50, 36, 35, 0, -2, -11, 19, -19, -26]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 15)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 15)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 6 ≤ x ≤ 15، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([21, 12, 7, 0])` يُرجع `[-48, -28]`.\nالجواب:", "qhash": "e5534ccbb4625a10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 42) == 1)", "tests": ["assert coprime_count(109) == 32", "assert coprime_count(103) == 30", "assert coprime_count(4) == 1", "assert coprime_count(85) == 25", "assert coprime_count(171) == 49", "assert coprime_count(94) == 26", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(109) == 32\nassert coprime_count(103) == 30\nassert coprime_count(4) == 1\nassert coprime_count(85) == 25\nassert coprime_count(171) == 49\nassert coprime_count(94) == 26\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, 42) == 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, 42) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 42، أي أن القاسم المشترك الأكبر لها مع 42 يساوي 1.\nمثال: `coprime_count(109)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "f46904b5d8f4df3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 5 * x ** 2 + (2) * x + (-4)", "tests": ["assert evaluate(7) == 255", "assert evaluate(-19) == 1763", "assert evaluate(14) == 1004", "assert evaluate(-7) == 227", "assert evaluate(9) == 419", "assert evaluate(-16) == 1244", "assert evaluate(3) == 47", "assert evaluate(0) == -4"], "test_code": "assert evaluate(7) == 255\nassert evaluate(-19) == 1763\nassert evaluate(14) == 1004\nassert evaluate(-7) == 227\nassert evaluate(9) == 419\nassert evaluate(-16) == 1244\nassert evaluate(3) == 47\nassert evaluate(0) == -4", "answer": "def evaluate(x):\n return 5 * x ** 2 + (2) * x + (-4)", "completion": " ```python\ndef evaluate(x):\n return 5 * x ** 2 + (2) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 5x² + 2x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(7)` يُرجع `255`.\nالجواب:", "qhash": "3e38f05aa4b4178d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 12\nfor x in range(-3, 19, 4):\n acc -= x * 2\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 12\nfor x in range(-3, 19, 4):\n acc -= x * 2\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "2ad5770f5c9d9c29", "answer": "-72\n17", "completion": " الناتج:\n```text\n-72\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ه')", "tests": ["assert count_letter('مطر طالب صحراء برمجة نور شمس فجر') == 0", "assert count_letter('شجرة') == 0", "assert count_letter('عربية قهوة صحراء سلام نهار نور') == 2", "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('عربية قهوة صحراء سلام نهار نور') == 2\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 text.count('ه')", "completion": " ```python\ndef count_letter(text):\n return text.count('ه')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «ه» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('مطر طالب صحراء برمجة نور شمس فجر')` يُرجع `0`.\nالجواب:", "qhash": "6d83858e22de72f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 16\nfor x in range(0, 24, 1):\n acc += x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 16\nfor x in range(0, 24, 1):\n acc += x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "3ef68ca1983880bd", "answer": "2224\n23", "completion": " الناتج:\n```text\n2224\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'lmos'}", "tests": ["assert char_counts('music a is winter') == {'l': 0, 'm': 1, 'o': 0, 's': 2}", "assert char_counts('planet coffee summer winter apple apple') == {'l': 3, 'm': 2, 'o': 1, 's': 1}", "assert char_counts('table we music table signal it') == {'l': 3, 'm': 1, 'o': 0, 's': 2}", "assert char_counts('summer of we at') == {'l': 0, 'm': 2, 'o': 1, 's': 1}", "assert char_counts('of apple a winter') == {'l': 1, 'm': 0, 'o': 1, 's': 0}", "assert char_counts('in we on an desert signal') == {'l': 1, 'm': 0, 'o': 1, 's': 2}", "assert char_counts('') == {'l': 0, 'm': 0, 'o': 0, 's': 0}"], "test_code": "assert char_counts('music a is winter') == {'l': 0, 'm': 1, 'o': 0, 's': 2}\nassert char_counts('planet coffee summer winter apple apple') == {'l': 3, 'm': 2, 'o': 1, 's': 1}\nassert char_counts('table we music table signal it') == {'l': 3, 'm': 1, 'o': 0, 's': 2}\nassert char_counts('summer of we at') == {'l': 0, 'm': 2, 'o': 1, 's': 1}\nassert char_counts('of apple a winter') == {'l': 1, 'm': 0, 'o': 1, 's': 0}\nassert char_counts('in we on an desert signal') == {'l': 1, 'm': 0, 'o': 1, 's': 2}\nassert char_counts('') == {'l': 0, 'm': 0, 'o': 0, 's': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'lmos'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'lmos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'l'، 'm'، 'o'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('music a is winter')` يُرجع `{'l': 0, 'm': 1, 'o': 0, 's': 2}`.\nالجواب:", "qhash": "033191b67a9d074f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [16, 23, 32, 31, 39, 1, 9]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [16, 23, 32, 31, 39, 1, 9]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "28bca1c557d3ea2d", "answer": "[23, 31, 32, 16, 39, 9, 1]\n[39, 32, 31]", "completion": " الناتج:\n```text\n[23, 31, 32, 16, 39, 9, 1]\n[39, 32, 31]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [-4, -1, 10, 7, 12, 5, 35, 8, 0]\nprint(lst[1:8])\nprint(lst[::-1])\nprint(min(lst[1:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [-4, -1, 10, 7, 12, 5, 35, 8, 0]\nprint(lst[1:8])\nprint(lst[::-1])\nprint(min(lst[1:8]))\n```\nالجواب:", "qhash": "ad615be32cf16f14", "answer": "[-1, 10, 7, 12, 5, 35, 8]\n[0, 8, 35, 5, 12, 7, 10, -1, -4]\n-1", "completion": " الناتج:\n```text\n[-1, 10, 7, 12, 5, 35, 8]\n[0, 8, 35, 5, 12, 7, 10, -1, -4]\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'di'}", "tests": ["assert letter_stats('in vector window') == {'d': 1, 'i': 2}", "assert letter_stats('code in planet by') == {'d': 1, 'i': 1}", "assert letter_stats('go python on a is coffee') == {'d': 0, 'i': 1}", "assert letter_stats('to coffee rocket light summer') == {'d': 0, 'i': 1}", "assert letter_stats('rocket') == {'d': 0, 'i': 0}", "assert letter_stats('light stone pixel summer we python') == {'d': 0, 'i': 2}", "assert letter_stats('') == {'d': 0, 'i': 0}"], "test_code": "assert letter_stats('in vector window') == {'d': 1, 'i': 2}\nassert letter_stats('code in planet by') == {'d': 1, 'i': 1}\nassert letter_stats('go python on a is coffee') == {'d': 0, 'i': 1}\nassert letter_stats('to coffee rocket light summer') == {'d': 0, 'i': 1}\nassert letter_stats('rocket') == {'d': 0, 'i': 0}\nassert letter_stats('light stone pixel summer we python') == {'d': 0, 'i': 2}\nassert letter_stats('') == {'d': 0, 'i': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'di'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'di'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'i' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('in vector window')` يُرجع `{'d': 1, 'i': 2}`.\nالجواب:", "qhash": "40376202f468190e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 44", "tests": ["assert digit_score(23000) == 13", "assert digit_score(376623) == 11", "assert digit_score(829742) == 42", "assert digit_score(857795) == 29", "assert digit_score(704329) == 27", "assert digit_score(663946) == 38", "assert digit_score(19022) == 2", "assert digit_score(0) == 0"], "test_code": "assert digit_score(23000) == 13\nassert digit_score(376623) == 11\nassert digit_score(829742) == 42\nassert digit_score(857795) == 29\nassert digit_score(704329) == 27\nassert digit_score(663946) == 38\nassert digit_score(19022) == 2\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 44", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 44\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 44.\nللتوضيح: الاستدعاء `digit_score(23000)` يُرجع `13`.\nالجواب:", "qhash": "28ed75493608e862"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-2, -6, 1, 34, 9, 22]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-2, -6, 1, 34, 9, 22]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "85e13010fe25bf5e", "answer": "[1, 9, -2, -6, 22, 34]\n[34, 22, 9]", "completion": " الناتج:\n```text\n[1, 9, -2, -6, 22, 34]\n[34, 22, 9]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'قهوة صحراء'\nprint(len(kalima.replace(' ', '')))\nprint(kalima[0])\nprint('ة' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'قهوة صحراء'\nprint(len(kalima.replace(' ', '')))\nprint(kalima[0])\nprint('ة' in kalima)\n```\nالجواب:", "qhash": "53dded59283e5893", "answer": "9\nق\nTrue", "completion": " الناتج:\n```text\n9\nق\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(26) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo', '26']", "assert fizzbuzz(15) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo']", "assert fizzbuzz(20) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo']", "assert fizzbuzz(19) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19']", "assert fizzbuzz(0) == []"], "test_code": "assert fizzbuzz(26) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo', '26']\nassert fizzbuzz(15) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo']\nassert fizzbuzz(20) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo']\nassert fizzbuzz(19) == ['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19']\nassert fizzbuzz(0) == []", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Foo'، وعلى 6 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(26)` يجب أن تُرجع `['1', '2', '3', '4', 'Foo', 'Bar', '7', '8', '9', 'Foo', '11', 'Bar', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Bar', 'Foo', '26']`.\nالجواب:", "qhash": "56715a4ffa97766b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(6, 1))", "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(6, 1))\n```\nالجواب:", "qhash": "8047e254a42fba10", "answer": "6", "completion": " الناتج:\n```text\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'راشد': 34, 'نور': 36, 'يوسف': 29, 'منى': 49}\nmarks['منى'] += 7\nmarks['عمر'] = 28\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'راشد': 34, 'نور': 36, 'يوسف': 29, 'منى': 49}\nmarks['منى'] += 7\nmarks['عمر'] = 28\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('يوسف', -1))\n```\nالجواب:", "qhash": "04d403082d1e32f3", "answer": "5\nمنى\n183\n29", "completion": " الناتج:\n```text\n5\nمنى\n183\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([56, 24, -1, -2, 2, 23]) == None", "assert max_multiple([-44, -33, -11]) == -11", "assert max_multiple([1, 12, 23, 34]) == None", "assert max_multiple([20, 39]) == None", "assert max_multiple([35, -41, -20, -5, -13]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([56, 24, -1, -2, 2, 23]) == None\nassert max_multiple([-44, -33, -11]) == -11\nassert max_multiple([1, 12, 23, 34]) == None\nassert max_multiple([20, 39]) == None\nassert max_multiple([35, -41, -20, -5, -13]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_multiple([56, 24, -1, -2, 2, 23])` يُرجع `None`.\nالجواب:", "qhash": "ab174654bae62dc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 42) == 1)", "tests": ["assert phi_upto(42) == 12", "assert phi_upto(183) == 52", "assert phi_upto(137) == 39", "assert phi_upto(49) == 14", "assert phi_upto(137) == 39", "assert phi_upto(115) == 34", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(42) == 12\nassert phi_upto(183) == 52\nassert phi_upto(137) == 39\nassert phi_upto(49) == 14\nassert phi_upto(137) == 39\nassert phi_upto(115) == 34\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, 42) == 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, 42) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 42، أي أن القاسم المشترك الأكبر لها مع 42 يساوي 1.\nمثال: `phi_upto(42)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "4ee502dedb2ec8f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ق')", "tests": ["assert count_ar('سماء جبل قلم سماء رمل صديق مدرسة رمل') == 2", "assert count_ar('صحراء سلام رمل حاسوب بحر صحراء') == 0", "assert count_ar('علم') == 0", "assert count_ar('حاسوب نور نهار لغة حاسوب وردة') == 0", "assert count_ar('مطر حاسوب ليل فجر شمس') == 0", "assert count_ar('قهوة باب طالب جبل عمل صحراء نهار') == 1", "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('مطر حاسوب ليل فجر شمس') == 0\nassert count_ar('قهوة باب طالب جبل عمل صحراء نهار') == 1\nassert count_ar('خبز') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('ق')", "completion": " ```python\ndef count_ar(text):\n return text.count('ق')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_ar(text)` بحيث تُعيد عدد مرات ظهور الحرف «ق» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('سماء جبل قلم سماء رمل صديق مدرسة رمل')` يُرجع `2`.\nالجواب:", "qhash": "e82bfdc64f701d8f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(11))\nprint(compute(11, 2))\nprint(compute(compute(2), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(11))\nprint(compute(11, 2))\nprint(compute(compute(2), 11))\n```\nالجواب:", "qhash": "42c4b47f8e64473f", "answer": "-34\n-35\n-40", "completion": " الناتج:\n```text\n-34\n-35\n-40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(25) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun', '25']", "assert fizzbuzz(0) == []", "assert fizzbuzz(16) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun']", "assert fizzbuzz(23) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23']", "assert fizzbuzz(7) == ['1', '2', '3', 'Sun', '5', '6', '7']"], "test_code": "assert fizzbuzz(25) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun', '25']\nassert fizzbuzz(0) == []\nassert fizzbuzz(16) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun']\nassert fizzbuzz(23) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23']\nassert fizzbuzz(7) == ['1', '2', '3', 'Sun', '5', '6', '7']", "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 % 11 == 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 % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(25)` يجب أن تُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun', '25']`.\nالجواب:", "qhash": "62105cbde018630d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('winter desert signal winter on river is') == 'is|river|on|winter|signal|desert|winter'", "assert mirror_words('') == ''", "assert mirror_words('') == ''", "assert mirror_words('code') == 'code'", "assert mirror_words('on pixel by garden rocket garden') == 'garden|rocket|garden|by|pixel|on'", "assert mirror_words('rocket code window camel we camel in') == 'in|camel|we|camel|window|code|rocket'", "assert mirror_words('winter garden by banana river') == 'river|banana|by|garden|winter'"], "test_code": "assert mirror_words('winter desert signal winter on river is') == 'is|river|on|winter|signal|desert|winter'\nassert mirror_words('') == ''\nassert mirror_words('') == ''\nassert mirror_words('code') == 'code'\nassert mirror_words('on pixel by garden rocket garden') == 'garden|rocket|garden|by|pixel|on'\nassert mirror_words('rocket code window camel we camel in') == 'in|camel|we|camel|window|code|rocket'\nassert mirror_words('winter garden by banana river') == 'river|banana|by|garden|winter'", "answer": "def mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `mirror_words('winter desert signal winter on river is')` يُرجع `'is|river|on|winter|signal|desert|winter'`.\nالجواب:", "qhash": "67090e2d9b2f7463"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'gmu'}", "tests": ["assert freq_of('banana light summer code') == {'g': 1, 'm': 2, 'u': 1}", "assert freq_of('vector window to') == {'g': 0, 'm': 0, 'u': 0}", "assert freq_of('code python pixel brain') == {'g': 0, 'm': 0, 'u': 0}", "assert freq_of('brain it table it an planet') == {'g': 0, 'm': 0, 'u': 0}", "assert freq_of('summer river') == {'g': 0, 'm': 2, 'u': 1}", "assert freq_of('an light brain orange of signal') == {'g': 3, 'm': 0, 'u': 0}", "assert freq_of('') == {'g': 0, 'm': 0, 'u': 0}"], "test_code": "assert freq_of('banana light summer code') == {'g': 1, 'm': 2, 'u': 1}\nassert freq_of('vector window to') == {'g': 0, 'm': 0, 'u': 0}\nassert freq_of('code python pixel brain') == {'g': 0, 'm': 0, 'u': 0}\nassert freq_of('brain it table it an planet') == {'g': 0, 'm': 0, 'u': 0}\nassert freq_of('summer river') == {'g': 0, 'm': 2, 'u': 1}\nassert freq_of('an light brain orange of signal') == {'g': 3, 'm': 0, 'u': 0}\nassert freq_of('') == {'g': 0, 'm': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'gmu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'gmu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'm'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('banana light summer code')` يجب أن تُرجع `{'g': 1, 'm': 2, 'u': 1}`.\nالجواب:", "qhash": "ce854bd30693143f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 2 + -5 for x in range(-2, 9) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 2 + -5 for x in range(-2, 9) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "90bee3fec9f0d65e", "answer": "[-5, 3, 11]\n3 9", "completion": " الناتج:\n```text\n[-5, 3, 11]\n3 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 374\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 = 374\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": "509da73382ace86a", "answer": "45", "completion": " الناتج:\n```text\n45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=6):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(calc(3))\nprint(calc(3, 15))\nprint(calc(calc(15), 3))", "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(3))\nprint(calc(3, 15))\nprint(calc(calc(15), 3))\n```\nالجواب:", "qhash": "5de855c5453f4d8e", "answer": "-3\n-12\n-24", "completion": " الناتج:\n```text\n-3\n-12\n-24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('هدى', 83), ('ليلى', 18), ('حسن', 50), ('خالد', 71)]\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 = [('هدى', 83), ('ليلى', 18), ('حسن', 50), ('خالد', 71)]\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": "4af1facad1323580", "answer": "[('ليلى', 18), ('حسن', 50), ('خالد', 71), ('هدى', 83)]\n['هدى', 'خالد']", "completion": " الناتج:\n```text\n[('ليلى', 18), ('حسن', 50), ('خالد', 71), ('هدى', 83)]\n['هدى', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['data', 'light', 'pixel', 'music', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['data', 'light', 'pixel', 'music', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "51d786547247daa0", "answer": "['data', 'light', 'pixel', 'music', 'river']\n['river', 'pixel', 'music']", "completion": " الناتج:\n```text\n['data', 'light', 'pixel', 'music', 'river']\n['river', 'pixel', 'music']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'جبل بحر'\nprint('ح' in text)\nprint(len(text))\nprint(text.count('ح'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'جبل بحر'\nprint('ح' in text)\nprint(len(text))\nprint(text.count('ح'))\n```\nالجواب:", "qhash": "91f3be52ea61f653", "answer": "True\n7\n1", "completion": " الناتج:\n```text\nTrue\n7\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [14, 38, 33, 25, 22, 6, 32]\nprint(data[1:4])\nprint(data[::3])\nprint(sum(data[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [14, 38, 33, 25, 22, 6, 32]\nprint(data[1:4])\nprint(data[::3])\nprint(sum(data[1:4]))\n```\nالجواب:", "qhash": "1ef5db9fd8d51819", "answer": "[38, 33, 25]\n[14, 25, 32]\n96", "completion": " الناتج:\n```text\n[38, 33, 25]\n[14, 25, 32]\n96\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'حصان جبل'\nprint(s.count('ب'))\nprint(s.split())\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'حصان جبل'\nprint(s.count('ب'))\nprint(s.split())\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "78c445e2f019b53b", "answer": "1\n['حصان', 'جبل']\nحصان-جبل", "completion": " الناتج:\n```text\n1\n['حصان', 'جبل']\nحصان-جبل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(4))\nprint(calc(4, -2))\nprint(calc(calc(-2), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(4))\nprint(calc(4, -2))\nprint(calc(calc(-2), 4))\n```\nالجواب:", "qhash": "7b4f56661db61c65", "answer": "35\n38\n59", "completion": " الناتج:\n```text\n35\n38\n59\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 123\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 = 123\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": "9e024cd786ff350b", "answer": "46", "completion": " الناتج:\n```text\n46\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [28, 2, -13, -2, 16, 29, -15, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 0), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [28, 2, -13, -2, 16, 29, -15, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 0), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "3a60c2fdb5b32ca4", "answer": "[-2, 2, -9, -13, -15, 16, 28, 29]\n[29, 28, 16]", "completion": " الناتج:\n```text\n[-2, 2, -9, -13, -15, 16, 28, 29]\n[29, 28, 16]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ي')", "tests": ["assert count_ar('حاسوب مكتبة جبل نهر') == 0", "assert count_ar('عربية مدرسة طالب رمل جبل ليل رمل') == 2", "assert count_ar('لغة شمس') == 0", "assert count_ar('') == 0", "assert count_ar('دفتر تفاحة وردة ميناء') == 1", "assert count_ar('رمل سلام قهوة سفينة نهار') == 1", "assert count_ar('') == 0", "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('دفتر تفاحة وردة ميناء') == 1\nassert count_ar('رمل سلام قهوة سفينة نهار') == 1\nassert count_ar('') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('ي')", "completion": " ```python\ndef count_ar(text):\n return text.count('ي')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_ar(text)` بحيث تُعيد عدد مرات ظهور الحرف «ي» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('حاسوب مكتبة جبل نهر')` يُرجع `0`.\nالجواب:", "qhash": "e80a5236754e9ee6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 2 for x in xs if -12 <= x <= 2)", "tests": ["assert between_times([-20, 1, 6, -21, 6, 2, -12, -14, 12]) == [-24, 2, 4]", "assert between_times([5, 17, -16, 35, -13, -22, -19, 18]) == []", "assert between_times([57, 54, 20, 17, 27, -27, -30, -5]) == [-10]", "assert between_times([-30, 47, 9, 6, -20, 29, 38, -28, 18]) == []", "assert between_times([53, 1, 35, -8, 46, 26, 38]) == [-16, 2]", "assert between_times([-28, 20, -28, 1, 1]) == [2, 2]", "assert between_times([18, -20, 19, 60, 20, -9, 44, 3, 0, 30]) == [-18, 0]", "assert between_times([]) == []"], "test_code": "assert between_times([-20, 1, 6, -21, 6, 2, -12, -14, 12]) == [-24, 2, 4]\nassert between_times([5, 17, -16, 35, -13, -22, -19, 18]) == []\nassert between_times([57, 54, 20, 17, 27, -27, -30, -5]) == [-10]\nassert between_times([-30, 47, 9, 6, -20, 29, 38, -28, 18]) == []\nassert between_times([53, 1, 35, -8, 46, 26, 38]) == [-16, 2]\nassert between_times([-28, 20, -28, 1, 1]) == [2, 2]\nassert between_times([18, -20, 19, 60, 20, -9, 44, 3, 0, 30]) == [-18, 0]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 2 for x in xs if -12 <= x <= 2)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 2 for x in xs if -12 <= x <= 2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق -12 ≤ x ≤ 2، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([-20, 1, 6, -21, 6, 2, -12, -14, 12])` يُرجع `[-24, 2, 4]`.\nالجواب:", "qhash": "5eb8a16c98da51de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('معلم كتاب جمل') == 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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ج» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('نور قمر حصان برمجة')` يُرجع `1`.\nالجواب:", "qhash": "ca02b17e49eb7d15"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('طائرة مدينة سوق تفاحة شمس نور') == 1", "assert count_start('تفاحة وردة بحر') == 1", "assert count_start('عربية خبز سلام جمل تفاحة') == 1", "assert count_start('ماء وردة تفاحة تفاحة') == 2", "assert count_start('صديق سوق مدرسة') == 0", "assert count_start('باب سماء سماء') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('طائرة مدينة سوق تفاحة شمس نور') == 1\nassert count_start('تفاحة وردة بحر') == 1\nassert count_start('عربية خبز سلام جمل تفاحة') == 1\nassert count_start('ماء وردة تفاحة تفاحة') == 2\nassert count_start('صديق سوق مدرسة') == 0\nassert count_start('باب سماء سماء') == 0\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.split():\n if w.endswith('ت'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ت». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_start(text):\n count = 0\n for w in text.split():\n if w.endswith('ت'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('طائرة مدينة سوق تفاحة شمس نور')` يُرجع `1`.\nالجواب:", "qhash": "8794d447b26a81ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('is to at apple is code data') == 'data_code_is_apple_at_to_is'", "assert invert_words('by music coffee garden') == 'garden_coffee_music_by'", "assert invert_words('stone is') == 'is_stone'", "assert invert_words('') == ''", "assert invert_words('apple garden orange in brain rocket apple matrix') == 'matrix_apple_rocket_brain_in_orange_garden_apple'", "assert invert_words('it it garden code it music light') == 'light_music_it_code_garden_it_it'", "assert invert_words('') == ''"], "test_code": "assert invert_words('is to at apple is code data') == 'data_code_is_apple_at_to_is'\nassert invert_words('by music coffee garden') == 'garden_coffee_music_by'\nassert invert_words('stone is') == 'is_stone'\nassert invert_words('') == ''\nassert invert_words('apple garden orange in brain rocket apple matrix') == 'matrix_apple_rocket_brain_in_orange_garden_apple'\nassert invert_words('it it garden code it music light') == 'light_music_it_code_garden_it_it'\nassert invert_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `invert_words('is to at apple is code data')` يُرجع `'data_code_is_apple_at_to_is'`.\nالجواب:", "qhash": "f3b769dbf95f30fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('مدرسة فجر') == 0", "assert prefix_hits('شجرة رمل مدرسة دفتر دفتر مدينة مطر') == 1", "assert prefix_hits('تفاحة عربية') == 0", "assert prefix_hits('رمل وردة مكتبة رمل ليل') == 2", "assert prefix_hits('رمل شجرة رمل رمل عربية') == 3", "assert prefix_hits('رمل وردة باب حديقة') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('مدرسة فجر') == 0\nassert prefix_hits('شجرة رمل مدرسة دفتر دفتر مدينة مطر') == 1\nassert prefix_hits('تفاحة عربية') == 0\nassert prefix_hits('رمل وردة مكتبة رمل ليل') == 2\nassert prefix_hits('رمل شجرة رمل رمل عربية') == 3\nassert prefix_hits('رمل وردة باب حديقة') == 1\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('مدرسة فجر')` يُرجع `0`.\nالجواب:", "qhash": "b79568a91f7d42f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(34) == 141", "assert multiples_total(170) == 3885", "assert multiples_total(200) == 5172", "assert multiples_total(69) == 575", "assert multiples_total(248) == 8045", "assert multiples_total(4) == 0", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(34) == 141\nassert multiples_total(170) == 3885\nassert multiples_total(200) == 5172\nassert multiples_total(69) == 575\nassert multiples_total(248) == 8045\nassert multiples_total(4) == 0\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 % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(34)` يُرجع `141`.\nالجواب:", "qhash": "c404bfe9552f1bad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 4 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(5) == ['1', 'Sun', '3', 'SunMoon', '5']", "assert label_numbers(24) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'SunMoon', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'SunMoon']", "assert label_numbers(25) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'SunMoon', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'SunMoon', '25']", "assert label_numbers(7) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7']", "assert label_numbers(3) == ['1', 'Sun', '3']"], "test_code": "assert label_numbers(5) == ['1', 'Sun', '3', 'SunMoon', '5']\nassert label_numbers(24) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'SunMoon', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'SunMoon']\nassert label_numbers(25) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'SunMoon', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'SunMoon', '25']\nassert label_numbers(7) == ['1', 'Sun', '3', 'SunMoon', '5', 'Sun', '7']\nassert label_numbers(3) == ['1', 'Sun', '3']", "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 % 4 == 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 % 4 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Sun'، وعلى 4 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(5)` يجب أن تُرجع `['1', 'Sun', '3', 'SunMoon', '5']`.\nالجواب:", "qhash": "88282509c7464c2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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_sel([24, 60, 17, 48, 17, 11, 88, 88, 67]) == 5", "assert count_sel([88, 21, 64, 8, 60, -4, 5, -31, -7]) == 5", "assert count_sel([26, -10, -1, 13, 51, 12, -36, 47]) == 2", "assert count_sel([55, -5, -6, 50, 66, -32, 61, 89, 11, 63, 84]) == 1", "assert count_sel([55, 42, 36, -33, 2]) == 1", "assert count_sel([6]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([24, 60, 17, 48, 17, 11, 88, 88, 67]) == 5\nassert count_sel([88, 21, 64, 8, 60, -4, 5, -31, -7]) == 5\nassert count_sel([26, -10, -1, 13, 51, 12, -36, 47]) == 2\nassert count_sel([55, -5, -6, 50, 66, -32, 61, 89, 11, 63, 84]) == 1\nassert count_sel([55, 42, 36, -33, 2]) == 1\nassert count_sel([6]) == 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 % 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 % 4 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 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([24, 60, 17, 48, 17, 11, 88, 88, 67])` يُرجع `5`.\nالجواب:", "qhash": "701c32b847c94e0c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert words_reversed('stone music a') == 'a music stone'", "assert words_reversed('light summer winter we summer') == 'summer we winter summer light'", "assert words_reversed('desert to go winter planet falcon garden') == 'garden falcon planet winter go to desert'", "assert words_reversed('data in') == 'in data'", "assert words_reversed('desert engine at engine planet window window') == 'window window planet engine at engine desert'", "assert words_reversed('a vector vector matrix river') == 'river matrix vector vector a'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('stone music a') == 'a music stone'\nassert words_reversed('light summer winter we summer') == 'summer we winter summer light'\nassert words_reversed('desert to go winter planet falcon garden') == 'garden falcon planet winter go to desert'\nassert words_reversed('data in') == 'in data'\nassert words_reversed('desert engine at engine planet window window') == 'window window planet engine at engine desert'\nassert words_reversed('a vector vector matrix river') == 'river matrix vector vector a'\nassert words_reversed('') == ''", "answer": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `words_reversed('stone music a')` يُرجع `'a music stone'`.\nالجواب:", "qhash": "c197a6c46f4f73db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('music OK') == 'ltrhb OK'", "assert encode('apple at it cloud') == 'zookd zs hs bkntc'", "assert encode('python code engine !') == 'oxsgnm bncd dmfhmd !'", "assert encode('table winter') == 'szakd vhmsdq'", "assert encode('garden signal stone pixel Hello') == 'fzqcdm rhfmzk rsnmd ohwdk Hdkkn'", "assert encode('cloud table summer a rocket') == 'bkntc szakd rtlldq z qnbjds'", "assert encode('') == ''"], "test_code": "assert encode('music OK') == 'ltrhb OK'\nassert encode('apple at it cloud') == 'zookd zs hs bkntc'\nassert encode('python code engine !') == 'oxsgnm bncd dmfhmd !'\nassert encode('table winter') == 'szakd vhmsdq'\nassert encode('garden signal stone pixel Hello') == 'fzqcdm rhfmzk rsnmd ohwdk Hdkkn'\nassert encode('cloud table summer a rocket') == 'bkntc szakd rtlldq z qnbjds'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('music OK')` يجب أن تُرجع `'ltrhb OK'`.\nالجواب:", "qhash": "7c050b2984284298"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-4, 1, 32, -15, 14, 21, 18, 9]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-4, 1, 32, -15, 14, 21, 18, 9]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "697691d77c8c189b", "answer": "[-4, -15, 1, 9, 14, 18, 21, 32]\n[32, 21, 18]", "completion": " الناتج:\n```text\n[-4, -15, 1, 9, 14, 18, 21, 32]\n[32, 21, 18]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "tests": ["assert sum_div(113) == 1266", "assert sum_div(295) == 8850", "assert sum_div(294) == 8556", "assert sum_div(136) == 1893", "assert sum_div(27) == 75", "assert sum_div(202) == 4101", "assert sum_div(1) == 0"], "test_code": "assert sum_div(113) == 1266\nassert sum_div(295) == 8850\nassert sum_div(294) == 8556\nassert sum_div(136) == 1893\nassert sum_div(27) == 75\nassert sum_div(202) == 4101\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(113)` يُرجع `1266`.\nالجواب:", "qhash": "c9d5f53fbaf71804"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'apple'\nprint(s.find('l'))\nprint(s.replace('l', '*'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'apple'\nprint(s.find('l'))\nprint(s.replace('l', '*'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "e280fd87e88c0cb1", "answer": "3\napp*e\nelppa", "completion": " الناتج:\n```text\n3\napp*e\nelppa\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(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([41, 46, 3, 25, 35, 44]) == [41, 46, 3, 25, 35, 44]", "assert rotate([0, 35, 26, 23, -5, -8, 34, -7, 5, -9, 4, 44]) == [34, -7, 5, -9, 4, 44, 0, 35, 26, 23, -5, -8]", "assert rotate([46, 42, 8]) == [46, 42, 8]", "assert rotate([9, 18, 45, 17, 1, 33, 22, 7, 13]) == [17, 1, 33, 22, 7, 13, 9, 18, 45]", "assert rotate([13, 19, 41]) == [13, 19, 41]", "assert rotate([-4, 12, 18]) == [-4, 12, 18]", "assert rotate([]) == []"], "test_code": "assert rotate([41, 46, 3, 25, 35, 44]) == [41, 46, 3, 25, 35, 44]\nassert rotate([0, 35, 26, 23, -5, -8, 34, -7, 5, -9, 4, 44]) == [34, -7, 5, -9, 4, 44, 0, 35, 26, 23, -5, -8]\nassert rotate([46, 42, 8]) == [46, 42, 8]\nassert rotate([9, 18, 45, 17, 1, 33, 22, 7, 13]) == [17, 1, 33, 22, 7, 13, 9, 18, 45]\nassert rotate([13, 19, 41]) == [13, 19, 41]\nassert rotate([-4, 12, 18]) == [-4, 12, 18]\nassert rotate([]) == []", "answer": "def rotate(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(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(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([41, 46, 3, 25, 35, 44])` يُرجع `[41, 46, 3, 25, 35, 44]`.\nالجواب:", "qhash": "542e8e1a04108532"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total", "tests": ["assert sum_terms(5) == 8811", "assert sum_terms(14) == 1149183", "assert sum_terms(6) == 20475", "assert sum_terms(14) == 1149183", "assert sum_terms(9) == 137997", "assert sum_terms(1) == 9", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(5) == 8811\nassert sum_terms(14) == 1149183\nassert sum_terms(6) == 20475\nassert sum_terms(14) == 1149183\nassert sum_terms(9) == 137997\nassert sum_terms(1) == 9\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(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_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(5)` يُرجع `8811`.\nالجواب:", "qhash": "1d36e030b8bf069c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return sum(1 for w in text.split() if 'م' in w)", "tests": ["assert count_letter('ليل مدينة قلم صحراء سفينة سماء حديقة قلم') == 4", "assert count_letter('لغة مدينة') == 1", "assert count_letter('') == 0", "assert count_letter('') == 0", "assert count_letter('ميناء وردة ميناء صديق') == 2", "assert count_letter('نهار طالب سفينة برمجة سفينة برمجة مدرسة') == 3", "assert count_letter('وردة عربية حديقة شمس حاسوب بحر علم') == 2", "assert count_letter('') == 0"], "test_code": "assert count_letter('ليل مدينة قلم صحراء سفينة سماء حديقة قلم') == 4\nassert count_letter('لغة مدينة') == 1\nassert count_letter('') == 0\nassert count_letter('') == 0\nassert count_letter('ميناء وردة ميناء صديق') == 2\nassert count_letter('نهار طالب سفينة برمجة سفينة برمجة مدرسة') == 3\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('ليل مدينة قلم صحراء سفينة سماء حديقة قلم')` يجب أن تُرجع `4`.\nالجواب:", "qhash": "3f540e5df37dfeb5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 18\nfor x in range(2, 14, 1):\n acc += x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 18\nfor x in range(2, 14, 1):\n acc += x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "86380a1cc640a04e", "answer": "738\n13", "completion": " الناتج:\n```text\n738\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'عمل دفتر'\nprint('ت' in w)\nprint(w.split())\nprint(w.count('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'عمل دفتر'\nprint('ت' in w)\nprint(w.split())\nprint(w.count('ت'))\n```\nالجواب:", "qhash": "7ae8e366241a4646", "answer": "True\n['عمل', 'دفتر']\n1", "completion": " الناتج:\n```text\nTrue\n['عمل', 'دفتر']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([52, 27, 40, 23, -7, 5]) == 52", "assert max_multiple([-10, -6, -4]) == -4", "assert max_multiple([1, 3]) == None", "assert max_multiple([-15, 33]) == None", "assert max_multiple([8, 7, -47, 14, 32, 44, -32]) == 44", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([52, 27, 40, 23, -7, 5]) == 52\nassert max_multiple([-10, -6, -4]) == -4\nassert max_multiple([1, 3]) == None\nassert max_multiple([-15, 33]) == None\nassert max_multiple([8, 7, -47, 14, 32, 44, -32]) == 44\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 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 % 2 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(nums):\n best = 0\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_multiple([52, 27, 40, 23, -7, 5])` يجب أن تُرجع `52`.\nالجواب:", "qhash": "54f44d6bea83bf6b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'يوسف': 18, 'باسل': 30, 'علي': 21, 'أحمد': 6}\npoints['علي'] += 3\npoints['خالد'] = 38\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'يوسف': 18, 'باسل': 30, 'علي': 21, 'أحمد': 6}\npoints['علي'] += 3\npoints['خالد'] = 38\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 16])\n```\nالجواب:", "qhash": "7f09a266936c56e6", "answer": "5\nخالد\n116\n['يوسف', 'باسل', 'علي', 'خالد']", "completion": " الناتج:\n```text\n5\nخالد\n116\n['يوسف', 'باسل', 'علي', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([44, 40, 21, 43, 45, 15]) == [44, 40, 21, 43, 45, 15]", "assert rotate_by([47, 12, 7, 10, 17]) == [7, 10, 17, 47, 12]", "assert rotate_by([10, 35, 30, 26, 28, -6, 12, 16, 20]) == [26, 28, -6, 12, 16, 20, 10, 35, 30]", "assert rotate_by([4, -7, 37, 30, -6]) == [37, 30, -6, 4, -7]", "assert rotate_by([9, -9, 50, 6, 5, 2, 34, 38, 32]) == [6, 5, 2, 34, 38, 32, 9, -9, 50]", "assert rotate_by([28, 2, 22, 45, 45, 37, -2, 41]) == [45, 37, -2, 41, 28, 2, 22, 45]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([44, 40, 21, 43, 45, 15]) == [44, 40, 21, 43, 45, 15]\nassert rotate_by([47, 12, 7, 10, 17]) == [7, 10, 17, 47, 12]\nassert rotate_by([10, 35, 30, 26, 28, -6, 12, 16, 20]) == [26, 28, -6, 12, 16, 20, 10, 35, 30]\nassert rotate_by([4, -7, 37, 30, -6]) == [37, 30, -6, 4, -7]\nassert rotate_by([9, -9, 50, 6, 5, 2, 34, 38, 32]) == [6, 5, 2, 34, 38, 32, 9, -9, 50]\nassert rotate_by([28, 2, 22, 45, 45, 37, -2, 41]) == [45, 37, -2, 41, 28, 2, 22, 45]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(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 rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return ____\n```\nمثال: `rotate_by([44, 40, 21, 43, 45, 15])` يجب أن تُرجع `[44, 40, 21, 43, 45, 15]`.\nالجواب:", "qhash": "5f668657a7459dd2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "tests": ["assert spin([45, 2, 37, 45, 12, 42, 44]) == [42, 44, 45, 2, 37, 45, 12]", "assert spin([47, 23, 13, 8, 17]) == [47, 23, 13, 8, 17]", "assert spin([-4, 7, 50, 25, -3, 16, 16]) == [16, 16, -4, 7, 50, 25, -3]", "assert spin([22, -6, 21, 4, 9, 26, 10, 29]) == [26, 10, 29, 22, -6, 21, 4, 9]", "assert spin([23, 5, 39, 35, 14, 3, 20]) == [3, 20, 23, 5, 39, 35, 14]", "assert spin([14, -2, 6, 1, 32, 46, 2, -4, -1, 8, 18, 46]) == [46, 2, -4, -1, 8, 18, 46, 14, -2, 6, 1, 32]", "assert spin([]) == []"], "test_code": "assert spin([45, 2, 37, 45, 12, 42, 44]) == [42, 44, 45, 2, 37, 45, 12]\nassert spin([47, 23, 13, 8, 17]) == [47, 23, 13, 8, 17]\nassert spin([-4, 7, 50, 25, -3, 16, 16]) == [16, 16, -4, 7, 50, 25, -3]\nassert spin([22, -6, 21, 4, 9, 26, 10, 29]) == [26, 10, 29, 22, -6, 21, 4, 9]\nassert spin([23, 5, 39, 35, 14, 3, 20]) == [3, 20, 23, 5, 39, 35, 14]\nassert spin([14, -2, 6, 1, 32, 46, 2, -4, -1, 8, 18, 46]) == [46, 2, -4, -1, 8, 18, 46, 14, -2, 6, 1, 32]\nassert spin([]) == []", "answer": "def spin(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef spin(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 spin(items):\n if not items:\n return []\n k = 5 % len(items)\n return ____\n```\nمثال: `spin([45, 2, 37, 45, 12, 42, 44])` يجب أن تُرجع `[42, 44, 45, 2, 37, 45, 12]`.\nالجواب:", "qhash": "eed8a1c6d13ae2c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 6 * x ** 2 + (7) * x + (-5)", "tests": ["assert quad(4) == 119", "assert quad(-5) == 110", "assert quad(-11) == 644", "assert quad(-1) == -6", "assert quad(4) == 119", "assert quad(1) == 8", "assert quad(5) == 180", "assert quad(0) == -5"], "test_code": "assert quad(4) == 119\nassert quad(-5) == 110\nassert quad(-11) == 644\nassert quad(-1) == -6\nassert quad(4) == 119\nassert quad(1) == 8\nassert quad(5) == 180\nassert quad(0) == -5", "answer": "def quad(x):\n return 6 * x ** 2 + (7) * x + (-5)", "completion": " ```python\ndef quad(x):\n return 6 * x ** 2 + (7) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 6x² + 7x - 5 عند العدد الصحيح x.\nمثال: `quad(4)` يجب أن تُرجع `119`.\nالجواب:", "qhash": "4c2e7ecdd9539cb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'علي': 24, 'يوسف': 12, 'فيصل': 38, 'أحمد': 1}\nd['علي'] += 6\nd['وليد'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'علي': 24, 'يوسف': 12, 'فيصل': 38, 'أحمد': 1}\nd['علي'] += 6\nd['وليد'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))\n```\nالجواب:", "qhash": "35d84c74fd1cb376", "answer": "5\nفيصل\n114\n-1", "completion": " الناتج:\n```text\n5\nفيصل\n114\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -2 * x ** 2 + (8) * x + (9)", "tests": ["assert poly(6) == -15", "assert poly(13) == -225", "assert poly(8) == -55", "assert poly(-2) == -15", "assert poly(-8) == -183", "assert poly(-2) == -15", "assert poly(-10) == -271", "assert poly(0) == 9"], "test_code": "assert poly(6) == -15\nassert poly(13) == -225\nassert poly(8) == -55\nassert poly(-2) == -15\nassert poly(-8) == -183\nassert poly(-2) == -15\nassert poly(-10) == -271\nassert poly(0) == 9", "answer": "def poly(x):\n return -2 * x ** 2 + (8) * x + (9)", "completion": " ```python\ndef poly(x):\n return -2 * x ** 2 + (8) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -2x² + 8x + 9 عند العدد الصحيح x.\nمثال: `poly(6)` يجب أن تُرجع `-15`.\nالجواب:", "qhash": "72790be6d9fdaeca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 997", "tests": ["assert fact_mod(3) == 3", "assert fact_mod(23) == 759", "assert fact_mod(46) == 205", "assert fact_mod(38) == 656", "assert fact_mod(20) == 249", "assert fact_mod(19) == 33", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(3) == 3\nassert fact_mod(23) == 759\nassert fact_mod(46) == 205\nassert fact_mod(38) == 656\nassert fact_mod(20) == 249\nassert fact_mod(19) == 33\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 997", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(3)` يُرجع `3`.\nالجواب:", "qhash": "ee54cdcdf9881640"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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_multiple([58, 30, -16, 19, -11, -9, 58]) == 30", "assert max_multiple([-25, -5, -20]) == -5", "assert max_multiple([1, 6, 11, 16]) == None", "assert max_multiple([21, 25, 9, -3]) == 25", "assert max_multiple([26, 49, 4, 3]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([58, 30, -16, 19, -11, -9, 58]) == 30\nassert max_multiple([-25, -5, -20]) == -5\nassert max_multiple([1, 6, 11, 16]) == None\nassert max_multiple([21, 25, 9, -3]) == 25\nassert max_multiple([26, 49, 4, 3]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(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_multiple(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_multiple(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_multiple(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_multiple([58, 30, -16, 19, -11, -9, 58])` يُرجع `30`.\nالجواب:", "qhash": "27ae503cd523bd8c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('in planet 2024') == 'va cynarg 2024'", "assert rot('summer banana on we summer') == 'fhzzre onanan ba jr fhzzre'", "assert rot('music A1') == 'zhfvp A1'", "assert rot('go of brain music') == 'tb bs oenva zhfvp'", "assert rot('to desert banana') == 'gb qrfreg onanan'", "assert rot('a river code summer matrix OK') == 'n evire pbqr fhzzre zngevk OK'", "assert rot('') == ''"], "test_code": "assert rot('in planet 2024') == 'va cynarg 2024'\nassert rot('summer banana on we summer') == 'fhzzre onanan ba jr fhzzre'\nassert rot('music A1') == 'zhfvp A1'\nassert rot('go of brain music') == 'tb bs oenva zhfvp'\nassert rot('to desert banana') == 'gb qrfreg onanan'\nassert rot('a river code summer matrix OK') == 'n evire pbqr fhzzre zngevk OK'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('in planet 2024')` يجب أن تُرجع `'va cynarg 2024'`.\nالجواب:", "qhash": "fc3f98a40fbd09be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert only_div([55, 0, 15, 41, 75, 14, 12]) == 3", "assert only_div([-38, 85, 43, -10, 30, 26, 8, 25, 83]) == 3", "assert only_div([-11, 21, 37, -32]) == 0", "assert only_div([3, 18, 23, 67, 72, 63, -4, 65, 18, -8, 11]) == 1", "assert only_div([-28, 47, 50, 69, 64, 34, -2, -20, -31, -9]) == 2", "assert only_div([-8, 5, 38, 47, 9]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([55, 0, 15, 41, 75, 14, 12]) == 3\nassert only_div([-38, 85, 43, -10, 30, 26, 8, 25, 83]) == 3\nassert only_div([-11, 21, 37, -32]) == 0\nassert only_div([3, 18, 23, 67, 72, 63, -4, 65, 18, -8, 11]) == 1\nassert only_div([-28, 47, 50, 69, 64, 34, -2, -20, -31, -9]) == 2\nassert only_div([-8, 5, 38, 47, 9]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([55, 0, 15, 41, 75, 14, 12])` يُرجع `3`.\nالجواب:", "qhash": "2cf63e896140f86a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n <= 3:\n return 4\n return 1 * go(n - 1) + -3\n\nprint(go(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n <= 3:\n return 4\n return 1 * go(n - 1) + -3\n\nprint(go(12))\n```\nالجواب:", "qhash": "cd1bcb61f4d04be2", "answer": "-23", "completion": " الناتج:\n```text\n-23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'cm'}", "tests": ["assert char_freq('cloud river') == {'c': 1, 'm': 0}", "assert char_freq('window brain pixel') == {'c': 0, 'm': 0}", "assert char_freq('it orange a brain on') == {'c': 0, 'm': 0}", "assert char_freq('in') == {'c': 0, 'm': 0}", "assert char_freq('light garden pixel falcon go') == {'c': 1, 'm': 0}", "assert char_freq('garden') == {'c': 0, 'm': 0}", "assert char_freq('') == {'c': 0, 'm': 0}"], "test_code": "assert char_freq('cloud river') == {'c': 1, 'm': 0}\nassert char_freq('window brain pixel') == {'c': 0, 'm': 0}\nassert char_freq('it orange a brain on') == {'c': 0, 'm': 0}\nassert char_freq('in') == {'c': 0, 'm': 0}\nassert char_freq('light garden pixel falcon go') == {'c': 1, 'm': 0}\nassert char_freq('garden') == {'c': 0, 'm': 0}\nassert char_freq('') == {'c': 0, 'm': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'cm'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'cm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'm' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('cloud river')` يُرجع `{'c': 1, 'm': 0}`.\nالجواب:", "qhash": "5ff82a79dfddde4b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 3\nfor x in range(8, 13, 1):\n acc += x * 9\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 3\nfor x in range(8, 13, 1):\n acc += x * 9\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "226a61809f41fddb", "answer": "453\n12", "completion": " الناتج:\n```text\n453\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([50, 30, 2, 42, 43, 33, 34, 50]) == [30, 2, 42, 43, 33, 34, 50, 50]", "assert roll([13, 9, -9, 24, 39, -8, 50, -6, 33, 30, -9]) == [39, -8, 50, -6, 33, 30, -9, 13, 9, -9, 24]", "assert roll([48, 25, -4]) == [-4, 48, 25]", "assert roll([44, 29, -1, 2]) == [29, -1, 2, 44]", "assert roll([11, 21, 5, 34]) == [21, 5, 34, 11]", "assert roll([-3, 34, -4, 40, 17]) == [40, 17, -3, 34, -4]", "assert roll([]) == []"], "test_code": "assert roll([50, 30, 2, 42, 43, 33, 34, 50]) == [30, 2, 42, 43, 33, 34, 50, 50]\nassert roll([13, 9, -9, 24, 39, -8, 50, -6, 33, 30, -9]) == [39, -8, 50, -6, 33, 30, -9, 13, 9, -9, 24]\nassert roll([48, 25, -4]) == [-4, 48, 25]\nassert roll([44, 29, -1, 2]) == [29, -1, 2, 44]\nassert roll([11, 21, 5, 34]) == [21, 5, 34, 11]\nassert roll([-3, 34, -4, 40, 17]) == [40, 17, -3, 34, -4]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 7 % 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 = 7 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return ____\n```\nمثال: `roll([50, 30, 2, 42, 43, 33, 34, 50])` يجب أن تُرجع `[30, 2, 42, 43, 33, 34, 50, 50]`.\nالجواب:", "qhash": "fb1d0273c467a8b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('in winter cloud') == 'cloud winter'", "assert rev_long_words('brain engine falcon') == 'falcon engine brain'", "assert rev_long_words('brain falcon winter') == 'winter falcon brain'", "assert rev_long_words('up brain banana orange') == 'orange banana brain'", "assert rev_long_words('river window desert falcon data desert') == 'desert falcon desert window river'", "assert rev_long_words('by light in winter') == 'winter light'", "assert rev_long_words('table banana at planet apple stone') == 'stone apple planet banana table'"], "test_code": "assert rev_long_words('in winter cloud') == 'cloud winter'\nassert rev_long_words('brain engine falcon') == 'falcon engine brain'\nassert rev_long_words('brain falcon winter') == 'winter falcon brain'\nassert rev_long_words('up brain banana orange') == 'orange banana brain'\nassert rev_long_words('river window desert falcon data desert') == 'desert falcon desert window river'\nassert rev_long_words('by light in winter') == 'winter light'\nassert rev_long_words('table banana at planet apple stone') == 'stone apple planet banana table'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_long_words('in winter cloud')` يُرجع `'cloud winter'`.\nالجواب:", "qhash": "065a1f32eb70c849"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 30) == 1)", "tests": ["assert rel_prime_count(25) == 7", "assert rel_prime_count(131) == 35", "assert rel_prime_count(174) == 47", "assert rel_prime_count(22) == 6", "assert rel_prime_count(190) == 50", "assert rel_prime_count(55) == 15", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(25) == 7\nassert rel_prime_count(131) == 35\nassert rel_prime_count(174) == 47\nassert rel_prime_count(22) == 6\nassert rel_prime_count(190) == 50\nassert rel_prime_count(55) == 15\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, 30) == 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, 30) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 30) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(25)` يُرجع `7`.\nالجواب:", "qhash": "e1ba47f4d86a5d38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert words_reversed('summer python stone light summer') == 'summer/light/stone/python/summer'", "assert words_reversed('falcon coffee data pixel rocket stone') == 'stone/rocket/pixel/data/coffee/falcon'", "assert words_reversed('river to table') == 'table/to/river'", "assert words_reversed('banana orange falcon brain stone summer is light') == 'light/is/summer/stone/brain/falcon/orange/banana'", "assert words_reversed('brain coffee code') == 'code/coffee/brain'", "assert words_reversed('apple river summer a matrix go') == 'go/matrix/a/summer/river/apple'", "assert words_reversed('light coffee brain camel light table is') == 'is/table/light/camel/brain/coffee/light'"], "test_code": "assert words_reversed('summer python stone light summer') == 'summer/light/stone/python/summer'\nassert words_reversed('falcon coffee data pixel rocket stone') == 'stone/rocket/pixel/data/coffee/falcon'\nassert words_reversed('river to table') == 'table/to/river'\nassert words_reversed('banana orange falcon brain stone summer is light') == 'light/is/summer/stone/brain/falcon/orange/banana'\nassert words_reversed('brain coffee code') == 'code/coffee/brain'\nassert words_reversed('apple river summer a matrix go') == 'go/matrix/a/summer/river/apple'\nassert words_reversed('light coffee brain camel light table is') == 'is/table/light/camel/brain/coffee/light'", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('summer python stone light summer')` يُرجع `'summer/light/stone/python/summer'`.\nالجواب:", "qhash": "b9b453d8842e639b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 30) == 1)", "tests": ["assert count_coprime(145) == 39", "assert count_coprime(121) == 33", "assert count_coprime(41) == 11", "assert count_coprime(29) == 8", "assert count_coprime(27) == 7", "assert count_coprime(37) == 10", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(145) == 39\nassert count_coprime(121) == 33\nassert count_coprime(41) == 11\nassert count_coprime(29) == 8\nassert count_coprime(27) == 7\nassert count_coprime(37) == 10\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, 30) == 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, 30) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 30، أي أن القاسم المشترك الأكبر لها مع 30 يساوي 1.\nمثال: `count_coprime(145)` يجب أن تُرجع `39`.\nالجواب:", "qhash": "b58e79b4aca297f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert only_div([3, 65, 19, 51, 80, 75, 53, 17]) == 0", "assert only_div([]) == 0", "assert only_div([66, -27]) == 0", "assert only_div([40, 82, 21, 65, 40]) == 1", "assert only_div([-13, 46, -36, -6, -19]) == 0", "assert only_div([81, 86]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([3, 65, 19, 51, 80, 75, 53, 17]) == 0\nassert only_div([]) == 0\nassert only_div([66, -27]) == 0\nassert only_div([40, 82, 21, 65, 40]) == 1\nassert only_div([-13, 46, -36, -6, -19]) == 0\nassert only_div([81, 86]) == 0\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([3, 65, 19, 51, 80, 75, 53, 17])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "2667b91c0acd43b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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_div([33, -21, 57, -5, -14, -13, -22]) == -14", "assert max_div([-4, -6, -10]) == -4", "assert max_div([1, 3, 5, 7]) == None", "assert max_div([-3, -20, -21, -17, 28]) == 28", "assert max_div([6, 11, 50, -33, 5, -4]) == 50", "assert max_div([]) == None"], "test_code": "assert max_div([33, -21, 57, -5, -14, -13, -22]) == -14\nassert max_div([-4, -6, -10]) == -4\nassert max_div([1, 3, 5, 7]) == None\nassert max_div([-3, -20, -21, -17, 28]) == 28\nassert max_div([6, 11, 50, -33, 5, -4]) == 50\nassert max_div([]) == None", "answer": "def max_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_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_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_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للتوضيح: الاستدعاء `max_div([33, -21, 57, -5, -14, -13, -22])` يُرجع `-14`.\nالجواب:", "qhash": "5023d689fb4cdf76"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 1) // 3 for x in range(-4, 9) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 1) // 3 for x in range(-4, 9) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "6219e52f550e9a66", "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": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 81", "tests": ["assert sum_digit_pow(77125) == 17", "assert sum_digit_pow(7718) == 70", "assert sum_digit_pow(736559) == 6", "assert sum_digit_pow(577467) == 65", "assert sum_digit_pow(33939) == 0", "assert sum_digit_pow(646673) == 65", "assert sum_digit_pow(103295) == 75", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(77125) == 17\nassert sum_digit_pow(7718) == 70\nassert sum_digit_pow(736559) == 6\nassert sum_digit_pow(577467) == 65\nassert sum_digit_pow(33939) == 0\nassert sum_digit_pow(646673) == 65\nassert sum_digit_pow(103295) == 75\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 81", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 81\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 81.\nللتوضيح: الاستدعاء `sum_digit_pow(77125)` يُرجع `17`.\nالجواب:", "qhash": "3da1e6fc7b4237ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(16))\n```\nالجواب:", "qhash": "cf6f4a88d82babf7", "answer": "987", "completion": " الناتج:\n```text\n987\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= 13)", "tests": ["assert between_times([-23, 19, 9, 21, -6, -4, -26]) == [-30, -20, 45]", "assert between_times([-5, -27, 29, 31, 18, -24]) == [-25]", "assert between_times([]) == []", "assert between_times([-27, -24, 35]) == []", "assert between_times([17, 0, -17, 54, 58, 1, -11]) == [-55, 0, 5]", "assert between_times([56, 33, 40, -7]) == [-35]", "assert between_times([32, 22, -30, 18, 13, 52, 35, -23, 51]) == [65]", "assert between_times([]) == []"], "test_code": "assert between_times([-23, 19, 9, 21, -6, -4, -26]) == [-30, -20, 45]\nassert between_times([-5, -27, 29, 31, 18, -24]) == [-25]\nassert between_times([]) == []\nassert between_times([-27, -24, 35]) == []\nassert between_times([17, 0, -17, 54, 58, 1, -11]) == [-55, 0, 5]\nassert between_times([56, 33, 40, -7]) == [-35]\nassert between_times([32, 22, -30, 18, 13, 52, 35, -23, 51]) == [65]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= 13)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق -16 ≤ x ≤ 13، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([-23, 19, 9, 21, -6, -4, -26])` يُرجع `[-30, -20, 45]`.\nالجواب:", "qhash": "f6bb25cedae16ee4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'فيصل': 49, 'عمر': 26, 'علي': 19, 'منى': 15, 'مريم': 31}\nd['علي'] += 11\nd['نور'] = 17\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 = {'فيصل': 49, 'عمر': 26, 'علي': 19, 'منى': 15, 'مريم': 31}\nd['علي'] += 11\nd['نور'] = 17\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": "6f35b84dbd6362bb", "answer": "6\nفيصل\n168\n[('منى', 15), ('نور', 17)]", "completion": " الناتج:\n```text\n6\nفيصل\n168\n[('منى', 15), ('نور', 17)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 2:\n return n + 0\n return go(n - 1) + go(n - 2)\n\nprint(go(2))", "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(2))\n```\nالجواب:", "qhash": "a901c1f3ad80dba9", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('at go on it it') == ''", "assert backwards('rocket at garden data stone planet') == 'planet garden rocket'", "assert backwards('to on') == ''", "assert backwards('orange coffee falcon coffee') == 'coffee falcon coffee orange'", "assert backwards('river winter banana we desert orange') == 'orange desert banana winter'", "assert backwards('in winter table data on on code') == 'winter'", "assert backwards('orange orange pixel winter an music camel') == 'winter orange orange'"], "test_code": "assert backwards('at go on it it') == ''\nassert backwards('rocket at garden data stone planet') == 'planet garden rocket'\nassert backwards('to on') == ''\nassert backwards('orange coffee falcon coffee') == 'coffee falcon coffee orange'\nassert backwards('river winter banana we desert orange') == 'orange desert banana winter'\nassert backwards('in winter table data on on code') == 'winter'\nassert backwards('orange orange pixel winter an music camel') == 'winter orange orange'", "answer": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `backwards('at go on it it')` يُرجع `''`.\nالجواب:", "qhash": "6eb1f1b7917e9d89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(4))\nprint(f(4, 20))\nprint(f(f(20), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(4))\nprint(f(4, 20))\nprint(f(f(20), 4))\n```\nالجواب:", "qhash": "610a70eb6ec9e559", "answer": "22\n124\n704", "completion": " الناتج:\n```text\n22\n124\n704\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([62, 35, 60, 74, 26, 34, 90, 5]) == 1", "assert count_special([3]) == 0", "assert count_special([74, 79, 52, 24, 61, 0, 79]) == 0", "assert count_special([58, 76, 31, 62, 28, -36, -22, 84, 5]) == 0", "assert count_special([-34, -4, 1, -13, -1]) == 0", "assert count_special([32, 22, 35]) == 1", "assert count_special([]) == 0"], "test_code": "assert count_special([62, 35, 60, 74, 26, 34, 90, 5]) == 1\nassert count_special([3]) == 0\nassert count_special([74, 79, 52, 24, 61, 0, 79]) == 0\nassert count_special([58, 76, 31, 62, 28, -36, -22, 84, 5]) == 0\nassert count_special([-34, -4, 1, -13, -1]) == 0\nassert count_special([32, 22, 35]) == 1\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([62, 35, 60, 74, 26, 34, 90, 5])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "bd915485e31d3760"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(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 count_sel([85, 87, 90, 50, 23, 52, 77, 83, 8, 55, 67]) == 4", "assert count_sel([81, 31, -25, 71, 7, 55, -6, 57, 52, -31, -6, 64]) == 4", "assert count_sel([79, -2, -18, 63, 79, -32, 62, -26]) == 5", "assert count_sel([78, 50, -18, -24, 35]) == 4", "assert count_sel([-40, 18, 21, 81]) == 2", "assert count_sel([-30, 6, 53, 84]) == 2", "assert count_sel([]) == 0"], "test_code": "assert count_sel([85, 87, 90, 50, 23, 52, 77, 83, 8, 55, 67]) == 4\nassert count_sel([81, 31, -25, 71, 7, 55, -6, 57, 52, -31, -6, 64]) == 4\nassert count_sel([79, -2, -18, 63, 79, -32, 62, -26]) == 5\nassert count_sel([78, 50, -18, -24, 35]) == 4\nassert count_sel([-40, 18, 21, 81]) == 2\nassert count_sel([-30, 6, 53, 84]) == 2\nassert count_sel([]) == 0", "answer": "def count_sel(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 count_sel(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 count_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_sel([85, 87, 90, 50, 23, 52, 77, 83, 8, 55, 67])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "c0f4595ba41c94f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 13)", "tests": ["assert select_range([3, 11, -7, 9, 5]) == [15, 25, 45, 55]", "assert select_range([27, 7, 32, 36, 33, -4, -2]) == [-20, -10, 35]", "assert select_range([60, 27, -11, 10, 26, -19]) == [50]", "assert select_range([46, 4, 16, 10, 15, 25, 37, -27, -27, 16]) == [20, 50]", "assert select_range([39, 34, -5, 44, 16, 46, -16, 36, -16, 52]) == [-25]", "assert select_range([3, -30, 58, 28, -16, -17, 56, -13, 26, -13]) == [15]", "assert select_range([]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([3, 11, -7, 9, 5]) == [15, 25, 45, 55]\nassert select_range([27, 7, 32, 36, 33, -4, -2]) == [-20, -10, 35]\nassert select_range([60, 27, -11, 10, 26, -19]) == [50]\nassert select_range([46, 4, 16, 10, 15, 25, 37, -27, -27, 16]) == [20, 50]\nassert select_range([39, 34, -5, 44, 16, 46, -16, 36, -16, 52]) == [-25]\nassert select_range([3, -30, 58, 28, -16, -17, 56, -13, 26, -13]) == [15]\nassert select_range([]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 13)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و13 (شاملًا الطرفين) في 5.\nمثال: `select_range([3, 11, -7, 9, 5])` يجب أن تُرجع `[15, 25, 45, 55]`.\nالجواب:", "qhash": "6b0d6da338537a87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 12) == 1)", "tests": ["assert count_gcd1(86) == 29", "assert count_gcd1(101) == 34", "assert count_gcd1(21) == 7", "assert count_gcd1(93) == 31", "assert count_gcd1(37) == 13", "assert count_gcd1(73) == 25", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(86) == 29\nassert count_gcd1(101) == 34\nassert count_gcd1(21) == 7\nassert count_gcd1(93) == 31\nassert count_gcd1(37) == 13\nassert count_gcd1(73) == 25\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, 12) == 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, 12) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 12) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(86)` يُرجع `29`.\nالجواب:", "qhash": "884601105e3a9a88"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 8\nfor i in range(7, 31, 4):\n s -= i * 7\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 8\nfor i in range(7, 31, 4):\n s -= i * 7\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "03f15adeac50f24c", "answer": "-706\n27", "completion": " الناتج:\n```text\n-706\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert sum_multiples(272) == 5940", "assert sum_multiples(60) == 272", "assert sum_multiples(47) == 168", "assert sum_multiples(70) == 396", "assert sum_multiples(126) == 1260", "assert sum_multiples(142) == 1656", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(272) == 5940\nassert sum_multiples(60) == 272\nassert sum_multiples(47) == 168\nassert sum_multiples(70) == 396\nassert sum_multiples(126) == 1260\nassert sum_multiples(142) == 1656\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(272)` يُرجع `5940`.\nالجواب:", "qhash": "1191c73086b50653"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'code_window'\nprint(name.upper())\nprint(name.count('o'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'code_window'\nprint(name.upper())\nprint(name.count('o'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "9d181054a6ccc24d", "answer": "CODE_WINDOW\n2\nwodniw_edoc", "completion": " الناتج:\n```text\nCODE_WINDOW\n2\nwodniw_edoc\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 17", "tests": ["assert fact_mod(11) == 10", "assert fact_mod(44) == 13", "assert fact_mod(6) == 12", "assert fact_mod(20) == 4", "assert fact_mod(31) == 9", "assert fact_mod(2) == 2", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 10\nassert fact_mod(44) == 13\nassert fact_mod(6) == 12\nassert fact_mod(20) == 4\nassert fact_mod(31) == 9\nassert fact_mod(2) == 2\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 17", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(11)` يُرجع `10`.\nالجواب:", "qhash": "1d50d5934939fb8c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 101", "tests": ["assert step_product(7) == 91", "assert step_product(26) == 85", "assert step_product(44) == 80", "assert step_product(29) == 90", "assert step_product(44) == 80", "assert step_product(46) == 61", "assert step_product(0) == 1"], "test_code": "assert step_product(7) == 91\nassert step_product(26) == 85\nassert step_product(44) == 80\nassert step_product(29) == 90\nassert step_product(44) == 80\nassert step_product(46) == 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)) % 101", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(7)` يُرجع `91`.\nالجواب:", "qhash": "4b2618b5be8af1fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(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_sel([88, 37, 34, 69, 2, 5, 79, 26, 12, 39, 73, 37]) == 2", "assert count_sel([-31, 37, -4, -29, 42]) == 0", "assert count_sel([17, 13, 6]) == 0", "assert count_sel([31, -3, 81, 6, -27]) == 3", "assert count_sel([51, -12, -29, 70, -35, 60]) == 1", "assert count_sel([34, -13, -10]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([88, 37, 34, 69, 2, 5, 79, 26, 12, 39, 73, 37]) == 2\nassert count_sel([-31, 37, -4, -29, 42]) == 0\nassert count_sel([17, 13, 6]) == 0\nassert count_sel([31, -3, 81, 6, -27]) == 3\nassert count_sel([51, -12, -29, 70, -35, 60]) == 1\nassert count_sel([34, -13, -10]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(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_sel(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_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_sel([88, 37, 34, 69, 2, 5, 79, 26, 12, 39, 73, 37])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "5096853b7693e7e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert total_pow(3) == 1380", "assert total_pow(7) == 145040", "assert total_pow(8) == 308880", "assert total_pow(14) == 7699125", "assert total_pow(1) == 5", "assert total_pow(1) == 5", "assert total_pow(0) == 0"], "test_code": "assert total_pow(3) == 1380\nassert total_pow(7) == 145040\nassert total_pow(8) == 308880\nassert total_pow(14) == 7699125\nassert total_pow(1) == 5\nassert total_pow(1) == 5\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 5\n return total\n```\nمثال: `total_pow(3)` يجب أن تُرجع `1380`.\nالجواب:", "qhash": "15cb15fc3ac87a05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 9 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(12) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun']", "assert fizz(6) == ['1', '2', '3', 'Sun', '5', '6']", "assert fizz(7) == ['1', '2', '3', 'Sun', '5', '6', '7']", "assert fizz(24) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun', '13', '14', '15', 'Sun', '17', 'Moon', '19', 'Sun', '21', '22', '23', 'Sun']", "assert fizz(14) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun', '13', '14']"], "test_code": "assert fizz(12) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun']\nassert fizz(6) == ['1', '2', '3', 'Sun', '5', '6']\nassert fizz(7) == ['1', '2', '3', 'Sun', '5', '6', '7']\nassert fizz(24) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun', '13', '14', '15', 'Sun', '17', 'Moon', '19', 'Sun', '21', '22', '23', 'Sun']\nassert fizz(14) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun', '13', '14']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Sun'، وإن قَبِلها على 9 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(12)` يُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', 'Moon', '10', '11', 'Sun']`.\nالجواب:", "qhash": "a957175ff32a4cde"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 8) == 1)", "tests": ["assert coprime_count(126) == 63", "assert coprime_count(30) == 15", "assert coprime_count(17) == 9", "assert coprime_count(112) == 56", "assert coprime_count(78) == 39", "assert coprime_count(111) == 56", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(126) == 63\nassert coprime_count(30) == 15\nassert coprime_count(17) == 9\nassert coprime_count(112) == 56\nassert coprime_count(78) == 39\nassert coprime_count(111) == 56\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, 8) == 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, 8) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 8) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(126)` يُرجع `63`.\nالجواب:", "qhash": "c28c7ef98f274552"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total", "tests": ["assert scaled_powers(8) == 15552", "assert scaled_powers(11) == 52272", "assert scaled_powers(11) == 52272", "assert scaled_powers(9) == 24300", "assert scaled_powers(13) == 99372", "assert scaled_powers(1) == 12", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 15552\nassert scaled_powers(11) == 52272\nassert scaled_powers(11) == 52272\nassert scaled_powers(9) == 24300\nassert scaled_powers(13) == 99372\nassert scaled_powers(1) == 12\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(8)` يُرجع `15552`.\nالجواب:", "qhash": "4ef0b4db0a02be0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [17, 11, 18, -8, 2, 28, -2]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [17, 11, 18, -8, 2, 28, -2]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "78798b7da10c7a0c", "answer": "[-8, -2, 2, 11, 17, 18, 28]\n[28, 18, 17]", "completion": " الناتج:\n```text\n[-8, -2, 2, 11, 17, 18, 28]\n[28, 18, 17]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']", "assert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24']", "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']", "assert fizz(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23']", "assert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8']"], "test_code": "assert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']\nassert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24']\nassert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']\nassert fizz(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23']\nassert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8']", "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 % 10 == 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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 10 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(15)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']`.\nالجواب:", "qhash": "b6eea18cfb61367e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18']", "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18', '19', '20', 'Hi', 'Yo', '23', '24', '25']", "assert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18', '19', '20', 'Hi', 'Yo', '23', '24', '25']"], "test_code": "assert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18']\nassert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18', '19', '20', 'Hi', 'Yo', '23', '24', '25']\nassert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18', '19', '20', 'Hi', 'Yo', '23', '24', '25']", "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 % 11 == 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 % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Hi'، وعلى 11 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(18)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', '10', 'Yo', '12', '13', 'Hi', '15', '16', '17', '18']`.\nالجواب:", "qhash": "5f27055d16edd870"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 40)", "tests": ["assert filter_range([-1, -1, 4, 15, 4, 2, 7, 10, 12, -3]) == [-15, -12, -10, -7, -4, -4, -2]", "assert filter_range([-2, 27, 33, 9]) == [-33, -27, -9]", "assert filter_range([53]) == []", "assert filter_range([-13, 49, 10, 12, -1]) == [-12, -10]", "assert filter_range([19, 22, 54, 60, 0, -10, 54, 38, 2, -3]) == [-38, -22, -19, -2]", "assert filter_range([-26, 47, 17]) == [-17]", "assert filter_range([26]) == [-26]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-1, -1, 4, 15, 4, 2, 7, 10, 12, -3]) == [-15, -12, -10, -7, -4, -4, -2]\nassert filter_range([-2, 27, 33, 9]) == [-33, -27, -9]\nassert filter_range([53]) == []\nassert filter_range([-13, 49, 10, 12, -1]) == [-12, -10]\nassert filter_range([19, 22, 54, 60, 0, -10, 54, 38, 2, -3]) == [-38, -22, -19, -2]\nassert filter_range([-26, 47, 17]) == [-17]\nassert filter_range([26]) == [-26]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 40)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 1 ≤ x ≤ 40، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([-1, -1, 4, 15, 4, 2, 7, 10, 12, -3])` يُرجع `[-15, -12, -10, -7, -4, -4, -2]`.\nالجواب:", "qhash": "87079114127edbc1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(11) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11']", "assert fizz(18) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo', '15', 'Hi', '17', '18']", "assert fizz(20) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo', '15', 'Hi', '17', '18', '19', 'Hi']", "assert fizz(11) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11']", "assert fizz(14) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo']"], "test_code": "assert fizz(11) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11']\nassert fizz(18) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo', '15', 'Hi', '17', '18']\nassert fizz(20) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo', '15', 'Hi', '17', '18', '19', 'Hi']\nassert fizz(11) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11']\nassert fizz(14) == ['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11', 'Hi', '13', 'Yo']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\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 % 4 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Hi'، وعلى 7 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(11)` يجب أن تُرجع `['1', '2', '3', 'Hi', '5', '6', 'Yo', 'Hi', '9', '10', '11']`.\nالجواب:", "qhash": "eb9ce418fc9e8cf4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_sel([46, 39, 15, 5, 38, 36, 28]) == 1", "assert count_sel([10, -20, 60, 65, -16, -17, 52, 89, 67, 1]) == 1", "assert count_sel([51, -14, -11, 90, 14, 64, -6, -11, 25]) == 2", "assert count_sel([-36, -26, -21, 3, 59, -32, -32, 66, -33, 80, 36]) == 3", "assert count_sel([-7, -15]) == 0", "assert count_sel([8, 87, -26, 28, 59, 47, 4, 53, 90, 55, -28, -21]) == 1", "assert count_sel([]) == 0"], "test_code": "assert count_sel([46, 39, 15, 5, 38, 36, 28]) == 1\nassert count_sel([10, -20, 60, 65, -16, -17, 52, 89, 67, 1]) == 1\nassert count_sel([51, -14, -11, 90, 14, 64, -6, -11, 25]) == 2\nassert count_sel([-36, -26, -21, 3, 59, -32, -32, 66, -33, 80, 36]) == 3\nassert count_sel([-7, -15]) == 0\nassert count_sel([8, 87, -26, 28, 59, 47, 4, 53, 90, 55, -28, -21]) == 1\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([46, 39, 15, 5, 38, 36, 28])` يُرجع `1`.\nالجواب:", "qhash": "78d8f3dd25ecd72e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_div([89, 44, 82, 56, 70, 78]) == 1", "assert count_div([34, 14, -8]) == 0", "assert count_div([-35, -26, 25]) == 2", "assert count_div([-24, 47, 7, 49]) == 0", "assert count_div([-30, 58, 4, 44, 33, 66]) == 1", "assert count_div([-26, 3, 59, 71, 0, 25]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([89, 44, 82, 56, 70, 78]) == 1\nassert count_div([34, 14, -8]) == 0\nassert count_div([-35, -26, 25]) == 2\nassert count_div([-24, 47, 7, 49]) == 0\nassert count_div([-30, 58, 4, 44, 33, 66]) == 1\nassert count_div([-26, 3, 59, 71, 0, 25]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([89, 44, 82, 56, 70, 78])` يُرجع `1`.\nالجواب:", "qhash": "fa523644f4e3d098"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 5 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(15) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar']", "assert fizz(0) == []", "assert fizz(10) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar']", "assert fizz(3) == ['1', '2', 'Foo']", "assert fizz(14) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14']"], "test_code": "assert fizz(15) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar']\nassert fizz(0) == []\nassert fizz(10) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar']\nassert fizz(3) == ['1', '2', 'Foo']\nassert fizz(14) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14']", "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 % 5 == 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 % 5 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Foo'، وإن قَبِلها على 5 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(15)` يُرجع `['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar']`.\nالجواب:", "qhash": "9f335725708d7bbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 89", "tests": ["assert fact_mod(9) == 45", "assert fact_mod(57) == 52", "assert fact_mod(33) == 74", "assert fact_mod(52) == 43", "assert fact_mod(13) == 51", "assert fact_mod(33) == 74", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(9) == 45\nassert fact_mod(57) == 52\nassert fact_mod(33) == 74\nassert fact_mod(52) == 43\nassert fact_mod(13) == 51\nassert fact_mod(33) == 74\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 89", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 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": "5d6eba6ea13f19bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "tests": ["assert fact_mod(4) == 8", "assert fact_mod(47) == 50", "assert fact_mod(28) == 69", "assert fact_mod(13) == 12", "assert fact_mod(19) == 32", "assert fact_mod(31) == 42", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 8\nassert fact_mod(47) == 50\nassert fact_mod(28) == 69\nassert fact_mod(13) == 12\nassert fact_mod(19) == 32\nassert fact_mod(31) == 42\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(4)` يُرجع `8`.\nالجواب:", "qhash": "c2343db4b4321b56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 4405\ncount = 0\nwhile x > 20:\n x = x // 4\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 4405\ncount = 0\nwhile x > 20:\n x = x // 4\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "bed048c140a58f3e", "answer": "17 4", "completion": " الناتج:\n```text\n17 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_div([2, 19, 41, 28, 75, 70, 68, 88, 35, 57, 69]) == 2", "assert count_div([12, 54, 3, 66, 69, 39, 40, 72, -25]) == 1", "assert count_div([85, 19, -35, 7, -2, 38, 3, 51, -39]) == 0", "assert count_div([28, 44]) == 2", "assert count_div([-14, 4, 10, 67, 88, -34, 70]) == 1", "assert count_div([-17, -20, -21, -39]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([2, 19, 41, 28, 75, 70, 68, 88, 35, 57, 69]) == 2\nassert count_div([12, 54, 3, 66, 69, 39, 40, 72, -25]) == 1\nassert count_div([85, 19, -35, 7, -2, 38, 3, 51, -39]) == 0\nassert count_div([28, 44]) == 2\nassert count_div([-14, 4, 10, 67, 88, -34, 70]) == 1\nassert count_div([-17, -20, -21, -39]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([2, 19, 41, 28, 75, 70, 68, 88, 35, 57, 69])` يُرجع `2`.\nالجواب:", "qhash": "8e15dcadd57d2654"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(3, 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(3, 5))\n```\nالجواب:", "qhash": "afe01c3cc0b3bc3c", "answer": "243", "completion": " الناتج:\n```text\n243\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert total_pow(4) == 500", "assert total_pow(12) == 30420", "assert total_pow(2) == 45", "assert total_pow(5) == 1125", "assert total_pow(11) == 21780", "assert total_pow(1) == 5", "assert total_pow(0) == 0"], "test_code": "assert total_pow(4) == 500\nassert total_pow(12) == 30420\nassert total_pow(2) == 45\nassert total_pow(5) == 1125\nassert total_pow(11) == 21780\nassert total_pow(1) == 5\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 3\n return total\n```\nمثال: `total_pow(4)` يجب أن تُرجع `500`.\nالجواب:", "qhash": "a20361d66776d76c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_special([45, 3, 28, 83, 22, 19, 53, 71, 57, 70, 63]) == 4", "assert count_special([-19, -10]) == 0", "assert count_special([-34]) == 0", "assert count_special([16, 49, 22, -32, -17, 53, -20, 84, 89]) == 1", "assert count_special([90, -10, 41, 68, 28, 30, -14, 0]) == 2", "assert count_special([55, -40, -36, 69, 50, 23, 6]) == 3", "assert count_special([]) == 0"], "test_code": "assert count_special([45, 3, 28, 83, 22, 19, 53, 71, 57, 70, 63]) == 4\nassert count_special([-19, -10]) == 0\nassert count_special([-34]) == 0\nassert count_special([16, 49, 22, -32, -17, 53, -20, 84, 89]) == 1\nassert count_special([90, -10, 41, 68, 28, 30, -14, 0]) == 2\nassert count_special([55, -40, -36, 69, 50, 23, 6]) == 3\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([45, 3, 28, 83, 22, 19, 53, 71, 57, 70, 63])` يُرجع `4`.\nالجواب:", "qhash": "7687226aaa7d225e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']", "assert fizzbuzz(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']", "assert fizzbuzz(24) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic', '17', '18', '19', 'Tic', 'Tac', '22', '23', 'Tic']", "assert fizzbuzz(25) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic', '17', '18', '19', 'Tic', 'Tac', '22', '23', 'Tic', '25']", "assert fizzbuzz(5) == ['1', '2', '3', 'Tic', '5']"], "test_code": "assert fizzbuzz(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']\nassert fizzbuzz(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']\nassert fizzbuzz(24) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic', '17', '18', '19', 'Tic', 'Tac', '22', '23', 'Tic']\nassert fizzbuzz(25) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic', '17', '18', '19', 'Tic', 'Tac', '22', '23', 'Tic', '25']\nassert fizzbuzz(5) == ['1', '2', '3', 'Tic', '5']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\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 += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Tic'، وإن قَبِلها على 7 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(16)` يُرجع `['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']`.\nالجواب:", "qhash": "3537dafe2ce61adf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 14 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert rotate_by([23, 15, 7, 39, 32, 0]) == [7, 39, 32, 0, 23, 15]", "assert rotate_by([45, 26]) == [45, 26]", "assert rotate_by([-6, 5, -6, 38, 5, 10, 41, -6, 5, -7, 2]) == [38, 5, 10, 41, -6, 5, -7, 2, -6, 5, -6]", "assert rotate_by([18, -2, 45, 31, -9, 9, 17, -2, -7, 40]) == [-9, 9, 17, -2, -7, 40, 18, -2, 45, 31]", "assert rotate_by([20, 16, 43, -6, 17, -4, 8, 35, 38, 18, 4, 17]) == [43, -6, 17, -4, 8, 35, 38, 18, 4, 17, 20, 16]", "assert rotate_by([29, 43, 3, 16, 44, 3, 26, -4]) == [26, -4, 29, 43, 3, 16, 44, 3]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([23, 15, 7, 39, 32, 0]) == [7, 39, 32, 0, 23, 15]\nassert rotate_by([45, 26]) == [45, 26]\nassert rotate_by([-6, 5, -6, 38, 5, 10, 41, -6, 5, -7, 2]) == [38, 5, 10, 41, -6, 5, -7, 2, -6, 5, -6]\nassert rotate_by([18, -2, 45, 31, -9, 9, 17, -2, -7, 40]) == [-9, 9, 17, -2, -7, 40, 18, -2, 45, 31]\nassert rotate_by([20, 16, 43, -6, 17, -4, 8, 35, 38, 18, 4, 17]) == [43, -6, 17, -4, 8, 35, 38, 18, 4, 17, 20, 16]\nassert rotate_by([29, 43, 3, 16, 44, 3, 26, -4]) == [26, -4, 29, 43, 3, 16, 44, 3]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 14 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 14 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 14 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([23, 15, 7, 39, 32, 0])` يُرجع `[7, 39, 32, 0, 23, 15]`.\nالجواب:", "qhash": "5b2b9998a67737cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "tests": ["assert turn_list([49, 43, 17, 8]) == [49, 43, 17, 8]", "assert turn_list([-2, 46, -2, 39, -4, 47]) == [-4, 47, -2, 46, -2, 39]", "assert turn_list([-6, 46, 28]) == [46, 28, -6]", "assert turn_list([12, 50, -4, -7, 30, 29, 34, 35, 26, 37, 29, 33]) == [30, 29, 34, 35, 26, 37, 29, 33, 12, 50, -4, -7]", "assert turn_list([10, 47, 12, -6, 38]) == [47, 12, -6, 38, 10]", "assert turn_list([40, 24, 49, 50]) == [40, 24, 49, 50]", "assert turn_list([]) == []"], "test_code": "assert turn_list([49, 43, 17, 8]) == [49, 43, 17, 8]\nassert turn_list([-2, 46, -2, 39, -4, 47]) == [-4, 47, -2, 46, -2, 39]\nassert turn_list([-6, 46, 28]) == [46, 28, -6]\nassert turn_list([12, 50, -4, -7, 30, 29, 34, 35, 26, 37, 29, 33]) == [30, 29, 34, 35, 26, 37, 29, 33, 12, 50, -4, -7]\nassert turn_list([10, 47, 12, -6, 38]) == [47, 12, -6, 38, 10]\nassert turn_list([40, 24, 49, 50]) == [40, 24, 49, 50]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([49, 43, 17, 8])` يُرجع `[49, 43, 17, 8]`.\nالجواب:", "qhash": "4865eb731c721b63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-8, 32, 37, 11, -13, 35, -11, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 9), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-8, 32, 37, 11, -13, 35, -11, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 9), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "d5f15f539c662f02", "answer": "[11, -8, -11, -13, 32, 35, 35, 37]\n[37, 35, 35]", "completion": " الناتج:\n```text\n[11, -8, -11, -13, 32, 35, 35, 37]\n[37, 35, 35]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([52, 7, 36, 43, 66, 1]) == [52, 59, 95, 0, 66, 67]", "assert running_sum([-9, 77, 114, 29, 55, 66, 59, 14, 133, 114]) == [-9, 68, 0, 29, 84, 0, 59, 73, 0, 114]", "assert running_sum([25, 65, 68, -10, 33, 58, 129, 121, 121]) == [25, 90, 0, -10, 23, 81, 0, 121, 0]", "assert running_sum([133, 74, 125, 35, 132, 94, 34, 48, 118, 83]) == [133, 0, 125, 0, 132, 0, 34, 82, 0, 83]", "assert running_sum([111, 100]) == [111, 0]", "assert running_sum([]) == []", "assert running_sum([]) == []"], "test_code": "assert running_sum([52, 7, 36, 43, 66, 1]) == [52, 59, 95, 0, 66, 67]\nassert running_sum([-9, 77, 114, 29, 55, 66, 59, 14, 133, 114]) == [-9, 68, 0, 29, 84, 0, 59, 73, 0, 114]\nassert running_sum([25, 65, 68, -10, 33, 58, 129, 121, 121]) == [25, 90, 0, -10, 23, 81, 0, 121, 0]\nassert running_sum([133, 74, 125, 35, 132, 94, 34, 48, 118, 83]) == [133, 0, 125, 0, 132, 0, 34, 82, 0, 83]\nassert running_sum([111, 100]) == [111, 0]\nassert running_sum([]) == []\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\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 > 133:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 133 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([52, 7, 36, 43, 66, 1])` يُرجع `[52, 59, 95, 0, 66, 67]`.\nالجواب:", "qhash": "d89c3107875123b0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('at coffee rocket orange engine window pixel') == 'pixel/window/engine/orange/rocket/coffee/at'", "assert mirror_words('light') == 'light'", "assert mirror_words('an of matrix signal coffee') == 'coffee/signal/matrix/of/an'", "assert mirror_words('data garden window') == 'window/garden/data'", "assert mirror_words('we cloud pixel camel') == 'camel/pixel/cloud/we'", "assert mirror_words('apple is in we') == 'we/in/is/apple'", "assert mirror_words('signal coffee python') == 'python/coffee/signal'"], "test_code": "assert mirror_words('at coffee rocket orange engine window pixel') == 'pixel/window/engine/orange/rocket/coffee/at'\nassert mirror_words('light') == 'light'\nassert mirror_words('an of matrix signal coffee') == 'coffee/signal/matrix/of/an'\nassert mirror_words('data garden window') == 'window/garden/data'\nassert mirror_words('we cloud pixel camel') == 'camel/pixel/cloud/we'\nassert mirror_words('apple is in we') == 'we/in/is/apple'\nassert mirror_words('signal coffee python') == 'python/coffee/signal'", "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('at coffee rocket orange engine window pixel')` يجب أن تُرجع `'pixel/window/engine/orange/rocket/coffee/at'`.\nالجواب:", "qhash": "09ea6ac1ef4c186f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=5):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(-9))\nprint(h(-9, -6))\nprint(h(h(-6), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=5):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(-9))\nprint(h(-9, -6))\nprint(h(h(-6), -9))\n```\nالجواب:", "qhash": "b1d5a6c7f384e7fc", "answer": "11\n-33\n65", "completion": " الناتج:\n```text\n11\n-33\n65\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [2, 17, 30, 30, 36, -2, 17, -9, 5]\nprint(lst[1:3])\nprint(lst[::-2])\nprint(sum(lst[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [2, 17, 30, 30, 36, -2, 17, -9, 5]\nprint(lst[1:3])\nprint(lst[::-2])\nprint(sum(lst[1:3]))\n```\nالجواب:", "qhash": "e663843f695d30e9", "answer": "[17, 30]\n[5, 17, 36, 30, 2]\n47", "completion": " الناتج:\n```text\n[17, 30]\n[5, 17, 36, 30, 2]\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([41, 2, 20, 12, 34, 25, 13, 24, 37, 32]) == [41, 43, 63, 75, 0, 25, 38, 62, 0, 32]", "assert acc_reset([24, 43, 84, 18, 16, 71, 39]) == [24, 67, 0, 18, 34, 0, 39]", "assert acc_reset([25, 45, 52, 60, 48, 72, 29, 55, 11, -9]) == [25, 70, 0, 60, 0, 72, 0, 55, 66, 57]", "assert acc_reset([63]) == [63]", "assert acc_reset([44, 68, 54, 22, 77, 80, 15, 30, 42, 75]) == [44, 0, 54, 76, 0, 80, 0, 30, 72, 0]", "assert acc_reset([65, 27, 5, 15, 17, -7]) == [65, 0, 5, 20, 37, 30]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([41, 2, 20, 12, 34, 25, 13, 24, 37, 32]) == [41, 43, 63, 75, 0, 25, 38, 62, 0, 32]\nassert acc_reset([24, 43, 84, 18, 16, 71, 39]) == [24, 67, 0, 18, 34, 0, 39]\nassert acc_reset([25, 45, 52, 60, 48, 72, 29, 55, 11, -9]) == [25, 70, 0, 60, 0, 72, 0, 55, 66, 57]\nassert acc_reset([63]) == [63]\nassert acc_reset([44, 68, 54, 22, 77, 80, 15, 30, 42, 75]) == [44, 0, 54, 76, 0, 80, 0, 30, 72, 0]\nassert acc_reset([65, 27, 5, 15, 17, -7]) == [65, 0, 5, 20, 37, 30]\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 86 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([41, 2, 20, 12, 34, 25, 13, 24, 37, 32])` يُرجع `[41, 43, 63, 75, 0, 25, 38, 62, 0, 32]`.\nالجواب:", "qhash": "13d52e4e47fcbe9a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('falcon of falcon') == 'falcon-of-falcon'", "assert backwards('river') == 'river'", "assert backwards('it desert garden go data') == 'data-go-garden-desert-it'", "assert backwards('') == ''", "assert backwards('desert at stone falcon on coffee garden') == 'garden-coffee-on-falcon-stone-at-desert'", "assert backwards('cloud') == 'cloud'", "assert backwards('python a a window') == 'window-python'"], "test_code": "assert backwards('falcon of falcon') == 'falcon-of-falcon'\nassert backwards('river') == 'river'\nassert backwards('it desert garden go data') == 'data-go-garden-desert-it'\nassert backwards('') == ''\nassert backwards('desert at stone falcon on coffee garden') == 'garden-coffee-on-falcon-stone-at-desert'\nassert backwards('cloud') == 'cloud'\nassert backwards('python a a window') == 'window-python'", "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('falcon of falcon')` يجب أن تُرجع `'falcon-of-falcon'`.\nالجواب:", "qhash": "eb6abd79f86e0454"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if -19 <= x <= -10)", "tests": ["assert in_range_scaled([-10, -10, -20, -20, -4, -7, -28, -24, -23]) == [40, 40]", "assert in_range_scaled([23, 32, 43, 5, 11, -13, 37]) == [52]", "assert in_range_scaled([-24, 11, 19, 55, 39, 11, 21]) == []", "assert in_range_scaled([-25, -13, 51, 14, -8, 30, -12]) == [48, 52]", "assert in_range_scaled([43, 45, -28, 21, 57, 6, 0]) == []", "assert in_range_scaled([18, -4, 9, 31, -16, 4, 15, 52, -4, -9]) == [64]", "assert in_range_scaled([58]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-10, -10, -20, -20, -4, -7, -28, -24, -23]) == [40, 40]\nassert in_range_scaled([23, 32, 43, 5, 11, -13, 37]) == [52]\nassert in_range_scaled([-24, 11, 19, 55, 39, 11, 21]) == []\nassert in_range_scaled([-25, -13, 51, 14, -8, 30, -12]) == [48, 52]\nassert in_range_scaled([43, 45, -28, 21, 57, 6, 0]) == []\nassert in_range_scaled([18, -4, 9, 31, -16, 4, 15, 52, -4, -9]) == [64]\nassert in_range_scaled([58]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if -19 <= x <= -10)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -4 for x in xs if -19 <= x <= -10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -19 ≤ x ≤ -10، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([-10, -10, -20, -20, -4, -7, -28, -24, -23])` يُرجع `[40, 40]`.\nالجواب:", "qhash": "6cada2f35c0d2ee2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 7) // 4 for x in range(3, 17) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 7) // 4 for x in range(3, 17) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "c7ba95fbbec2887d", "answer": "[2, 3, 4, 5]\n4 14", "completion": " الناتج:\n```text\n[2, 3, 4, 5]\n4 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(20) == ['1', '2', '3', '4', '5', 'Ping', '7', 'Pong', '9', '10', '11', 'Ping', '13', '14', '15', 'Pong', '17', 'Ping', '19', '20']", "assert fizz(25) == ['1', '2', '3', '4', '5', 'Ping', '7', 'Pong', '9', '10', '11', 'Ping', '13', '14', '15', 'Pong', '17', 'Ping', '19', '20', '21', '22', '23', 'PingPong', '25']", "assert fizz(2) == ['1', '2']", "assert fizz(4) == ['1', '2', '3', '4']", "assert fizz(0) == []"], "test_code": "assert fizz(20) == ['1', '2', '3', '4', '5', 'Ping', '7', 'Pong', '9', '10', '11', 'Ping', '13', '14', '15', 'Pong', '17', 'Ping', '19', '20']\nassert fizz(25) == ['1', '2', '3', '4', '5', 'Ping', '7', 'Pong', '9', '10', '11', 'Ping', '13', '14', '15', 'Pong', '17', 'Ping', '19', '20', '21', '22', '23', 'PingPong', '25']\nassert fizz(2) == ['1', '2']\nassert fizz(4) == ['1', '2', '3', '4']\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 % 8 == 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 % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Ping'، وإن قَبِلها على 8 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(20)` يُرجع `['1', '2', '3', '4', '5', 'Ping', '7', 'Pong', '9', '10', '11', 'Ping', '13', '14', '15', 'Pong', '17', 'Ping', '19', '20']`.\nالجواب:", "qhash": "05c110d779e85287"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('river 2024') == 'ulyhu 2024'", "assert caesar('data !') == 'gdwd !'", "assert caesar('summer at summer summer Hello') == 'vxpphu dw vxpphu vxpphu Hhoor'", "assert caesar('of') == 'ri'", "assert caesar('light in up OK') == 'oljkw lq xs OK'", "assert caesar('stone falcon') == 'vwrqh idofrq'", "assert caesar('') == ''"], "test_code": "assert caesar('river 2024') == 'ulyhu 2024'\nassert caesar('data !') == 'gdwd !'\nassert caesar('summer at summer summer Hello') == 'vxpphu dw vxpphu vxpphu Hhoor'\nassert caesar('of') == 'ri'\nassert caesar('light in up OK') == 'oljkw lq xs OK'\nassert caesar('stone falcon') == 'vwrqh idofrq'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('river 2024')` يُرجع `'ulyhu 2024'`.\nالجواب:", "qhash": "10b119fecba15f91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [15, 1, 25, -1, 30, -4]\nprint(lst[1:6])\nprint(lst[::3])\nprint(max(lst[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [15, 1, 25, -1, 30, -4]\nprint(lst[1:6])\nprint(lst[::3])\nprint(max(lst[1:6]))\n```\nالجواب:", "qhash": "fbf81fb21bd2f031", "answer": "[1, 25, -1, 30, -4]\n[15, -1]\n30", "completion": " الناتج:\n```text\n[1, 25, -1, 30, -4]\n[15, -1]\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'خالد': 13, 'سعيد': 7, 'وليد': 35, 'زينب': 7, 'هدى': 39}\npoints['وليد'] += 3\npoints['علي'] = 45\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 = {'خالد': 13, 'سعيد': 7, 'وليد': 35, 'زينب': 7, 'هدى': 39}\npoints['وليد'] += 3\npoints['علي'] = 45\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": "5a7e2982868815d6", "answer": "6\nعلي\n149\n[('زينب', 7), ('سعيد', 7)]", "completion": " الناتج:\n```text\n6\nعلي\n149\n[('زينب', 7), ('سعيد', 7)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 12) == 1)", "tests": ["assert count_coprime(54) == 18", "assert count_coprime(76) == 25", "assert count_coprime(147) == 49", "assert count_coprime(148) == 49", "assert count_coprime(119) == 40", "assert count_coprime(140) == 47", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(54) == 18\nassert count_coprime(76) == 25\nassert count_coprime(147) == 49\nassert count_coprime(148) == 49\nassert count_coprime(119) == 40\nassert count_coprime(140) == 47\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, 12) == 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, 12) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 12، أي أن القاسم المشترك الأكبر لها مع 12 يساوي 1.\nمثال: `count_coprime(54)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "03324220ae78e154"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'cmo'}", "tests": ["assert char_counts('go window') == {'c': 0, 'm': 0, 'o': 2}", "assert char_counts('an is in garden matrix') == {'c': 0, 'm': 1, 'o': 0}", "assert char_counts('planet in engine') == {'c': 0, 'm': 0, 'o': 0}", "assert char_counts('window winter planet in river') == {'c': 0, 'm': 0, 'o': 1}", "assert char_counts('an of is apple') == {'c': 0, 'm': 0, 'o': 1}", "assert char_counts('cloud python coffee signal light') == {'c': 2, 'm': 0, 'o': 3}", "assert char_counts('') == {'c': 0, 'm': 0, 'o': 0}"], "test_code": "assert char_counts('go window') == {'c': 0, 'm': 0, 'o': 2}\nassert char_counts('an is in garden matrix') == {'c': 0, 'm': 1, 'o': 0}\nassert char_counts('planet in engine') == {'c': 0, 'm': 0, 'o': 0}\nassert char_counts('window winter planet in river') == {'c': 0, 'm': 0, 'o': 1}\nassert char_counts('an of is apple') == {'c': 0, 'm': 0, 'o': 1}\nassert char_counts('cloud python coffee signal light') == {'c': 2, 'm': 0, 'o': 3}\nassert char_counts('') == {'c': 0, 'm': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'cmo'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'cmo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'm'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('go window')` يجب أن تُرجع `{'c': 0, 'm': 0, 'o': 2}`.\nالجواب:", "qhash": "419748af5aa22e47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "tests": ["assert sum_multiples(130) == 1893", "assert sum_multiples(160) == 2886", "assert sum_multiples(136) == 2155", "assert sum_multiples(199) == 4692", "assert sum_multiples(200) == 4692", "assert sum_multiples(4) == 0", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(130) == 1893\nassert sum_multiples(160) == 2886\nassert sum_multiples(136) == 2155\nassert sum_multiples(199) == 4692\nassert sum_multiples(200) == 4692\nassert sum_multiples(4) == 0\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 % 13 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(130)` يُرجع `1893`.\nالجواب:", "qhash": "821c0fc10fb4d04d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 61) == 1)", "tests": ["assert coprimes(101) == 100", "assert coprimes(158) == 156", "assert coprimes(25) == 25", "assert coprimes(170) == 168", "assert coprimes(177) == 175", "assert coprimes(117) == 116", "assert coprimes(1) == 1"], "test_code": "assert coprimes(101) == 100\nassert coprimes(158) == 156\nassert coprimes(25) == 25\nassert coprimes(170) == 168\nassert coprimes(177) == 175\nassert coprimes(117) == 116\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 61، أي أن القاسم المشترك الأكبر لها مع 61 يساوي 1.\nمثال: `coprimes(101)` يجب أن تُرجع `100`.\nالجواب:", "qhash": "a2e7a99ce1fc2167"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('an by stone desert go engine') == 'engine_go_desert_stone_by_an'", "assert words_reversed('river it') == 'it_river'", "assert words_reversed('an') == 'an'", "assert words_reversed('an to') == 'to_an'", "assert words_reversed('data rocket') == 'rocket_data'", "assert words_reversed('desert') == 'desert'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('an by stone desert go engine') == 'engine_go_desert_stone_by_an'\nassert words_reversed('river it') == 'it_river'\nassert words_reversed('an') == 'an'\nassert words_reversed('an to') == 'to_an'\nassert words_reversed('data rocket') == 'rocket_data'\nassert words_reversed('desert') == 'desert'\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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `words_reversed('an by stone desert go engine')` يُرجع `'engine_go_desert_stone_by_an'`.\nالجواب:", "qhash": "e3221ab7c8e747cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('to banana light stone') == 'stone,light,banana'", "assert words_reversed('') == ''", "assert words_reversed('to to planet window in') == 'window,planet'", "assert words_reversed('by in on is summer') == 'summer'", "assert words_reversed('is') == ''", "assert words_reversed('up up up by vector stone') == 'stone,vector'", "assert words_reversed('camel in engine') == 'engine,camel'"], "test_code": "assert words_reversed('to banana light stone') == 'stone,light,banana'\nassert words_reversed('') == ''\nassert words_reversed('to to planet window in') == 'window,planet'\nassert words_reversed('by in on is summer') == 'summer'\nassert words_reversed('is') == ''\nassert words_reversed('up up up by vector stone') == 'stone,vector'\nassert words_reversed('camel in engine') == 'engine,camel'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `words_reversed('to banana light stone')` يُرجع `'stone,light,banana'`.\nالجواب:", "qhash": "c7d4778653332c7f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 9) // 2 for x in range(5, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 9) // 2 for x in range(5, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d50d8a5f3710ece1", "answer": "[7, 8, 9]\n3 24", "completion": " الناتج:\n```text\n[7, 8, 9]\n3 24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(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 count_div([29, 64, 37, 58, 25, 41, 19, 35]) == 0", "assert count_div([-16, 44, 2, 9, -29, -27]) == 0", "assert count_div([-4, 27, 52, 68, 60, -8, -10, -36, 62, 86, 11]) == 1", "assert count_div([75, 4, 69, 82, 23]) == 2", "assert count_div([4, 19, 79]) == 0", "assert count_div([36, -25, 0, 57, 34]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([29, 64, 37, 58, 25, 41, 19, 35]) == 0\nassert count_div([-16, 44, 2, 9, -29, -27]) == 0\nassert count_div([-4, 27, 52, 68, 60, -8, -10, -36, 62, 86, 11]) == 1\nassert count_div([75, 4, 69, 82, 23]) == 2\nassert count_div([4, 19, 79]) == 0\nassert count_div([36, -25, 0, 57, 34]) == 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 % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([29, 64, 37, 58, 25, 41, 19, 35])` يُرجع `0`.\nالجواب:", "qhash": "556d9d5576a1d70a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 0 + 4 for x in range(-2, 3) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 0 + 4 for x in range(-2, 3) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "54d5ccf36182f11a", "answer": "[4]\n1 4", "completion": " الناتج:\n```text\n[4]\n1 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 0)", "tests": ["assert clip_scale([-14, -14, 5, -1, -7]) == [-2]", "assert clip_scale([36, 8, 49, -13, 0]) == [0]", "assert clip_scale([9, 8]) == []", "assert clip_scale([-6, 49]) == []", "assert clip_scale([47, 23, 52, 17]) == []", "assert clip_scale([49, -10, 57, -4, 59, 45, -19, 40, 1, 48]) == [-8]", "assert clip_scale([12, -12]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-14, -14, 5, -1, -7]) == [-2]\nassert clip_scale([36, 8, 49, -13, 0]) == [0]\nassert clip_scale([9, 8]) == []\nassert clip_scale([-6, 49]) == []\nassert clip_scale([47, 23, 52, 17]) == []\nassert clip_scale([49, -10, 57, -4, 59, 45, -19, 40, 1, 48]) == [-8]\nassert clip_scale([12, -12]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 0)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -5 و0 (شاملًا الطرفين) في 2.\nمثال: `clip_scale([-14, -14, 5, -1, -7])` يجب أن تُرجع `[-2]`.\nالجواب:", "qhash": "f2233646d9bf986a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert cycle([22, 39, 34, 6, 48, 23, 21]) == [48, 23, 21, 22, 39, 34, 6]", "assert cycle([46, 16, 12, 25, 18, 24, 12]) == [18, 24, 12, 46, 16, 12, 25]", "assert cycle([37, 24, 33, 14, 36, 9, -4, -2, 17, 43, -6, 35]) == [-4, -2, 17, 43, -6, 35, 37, 24, 33, 14, 36, 9]", "assert cycle([36, 1, 49, -5]) == [49, -5, 36, 1]", "assert cycle([11, 46]) == [11, 46]", "assert cycle([30, 10, 45]) == [30, 10, 45]", "assert cycle([]) == []"], "test_code": "assert cycle([22, 39, 34, 6, 48, 23, 21]) == [48, 23, 21, 22, 39, 34, 6]\nassert cycle([46, 16, 12, 25, 18, 24, 12]) == [18, 24, 12, 46, 16, 12, 25]\nassert cycle([37, 24, 33, 14, 36, 9, -4, -2, 17, 43, -6, 35]) == [-4, -2, 17, 43, -6, 35, 37, 24, 33, 14, 36, 9]\nassert cycle([36, 1, 49, -5]) == [49, -5, 36, 1]\nassert cycle([11, 46]) == [11, 46]\nassert cycle([30, 10, 45]) == [30, 10, 45]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([22, 39, 34, 6, 48, 23, 21])` يُرجع `[48, 23, 21, 22, 39, 34, 6]`.\nالجواب:", "qhash": "b13c48e2187c7675"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 71:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([36, 13, 29, 4, 8, 38, 26, 23]) == [36, 49, 0, 4, 12, 50, 0, 23]", "assert running_sum([59, 50, 59, -3, 48, 60, 41]) == [59, 0, 59, 56, 0, 60, 0]", "assert running_sum([]) == []", "assert running_sum([]) == []", "assert running_sum([67, 68, 51]) == [67, 0, 51]", "assert running_sum([26, 10, 19, 61, 2, -1, 23, -4, 3, 41]) == [26, 36, 55, 0, 2, 1, 24, 20, 23, 64]", "assert running_sum([]) == []"], "test_code": "assert running_sum([36, 13, 29, 4, 8, 38, 26, 23]) == [36, 49, 0, 4, 12, 50, 0, 23]\nassert running_sum([59, 50, 59, -3, 48, 60, 41]) == [59, 0, 59, 56, 0, 60, 0]\nassert running_sum([]) == []\nassert running_sum([]) == []\nassert running_sum([67, 68, 51]) == [67, 0, 51]\nassert running_sum([26, 10, 19, 61, 2, -1, 23, -4, 3, 41]) == [26, 36, 55, 0, 2, 1, 24, 20, 23, 64]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 71:\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 > 71:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 71 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([36, 13, 29, 4, 8, 38, 26, 23])` يجب أن تُرجع `[36, 49, 0, 4, 12, 50, 0, 23]`.\nالجواب:", "qhash": "6b6b495285769b53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_sel([31, 57, 48, 34, 47, 87, 4, 20, 63, 2, 38, 88]) == 1", "assert count_sel([17, 85, 37, 41]) == 0", "assert count_sel([56, -15, 15, 11, 66]) == 0", "assert count_sel([14, 27, 46, 36, -31, -21, -6, 1, 61, -1, 81]) == 1", "assert count_sel([33, 33, 45, 4]) == 0", "assert count_sel([53, 78, 79, -15]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([31, 57, 48, 34, 47, 87, 4, 20, 63, 2, 38, 88]) == 1\nassert count_sel([17, 85, 37, 41]) == 0\nassert count_sel([56, -15, 15, 11, 66]) == 0\nassert count_sel([14, 27, 46, 36, -31, -21, -6, 1, 61, -1, 81]) == 1\nassert count_sel([33, 33, 45, 4]) == 0\nassert count_sel([53, 78, 79, -15]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 2، واكتب الدالة بعد إكمالها.\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([31, 57, 48, 34, 47, 87, 4, 20, 63, 2, 38, 88])` يُرجع `1`.\nالجواب:", "qhash": "28b3f0c88037c827"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "65821d763302180c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'منى': 22, 'خالد': 33, 'رنا': 5, 'ليلى': 37, 'سعيد': 21}\nmarks['منى'] += 16\nmarks['زينب'] = 36\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'منى': 22, 'خالد': 33, 'رنا': 5, 'ليلى': 37, 'سعيد': 21}\nmarks['منى'] += 16\nmarks['زينب'] = 36\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))\n```\nالجواب:", "qhash": "ddfd2623189e215e", "answer": "6\nمنى\n170\n-1", "completion": " الناتج:\n```text\n6\nمنى\n170\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('د')", "tests": ["assert count_in_text('سيارة مدينة حاسوب خبز بيت بيت حاسوب طائرة') == 1", "assert count_in_text('مطر سماء') == 0", "assert count_in_text('بحر مدينة نهر') == 1", "assert count_in_text('سيارة برتقال') == 0", "assert count_in_text('خبز سوق طالب دفتر قلم بيت بيت خبز') == 1", "assert count_in_text('باب وردة تفاحة قمر طائرة قلم كتاب جبل') == 1", "assert count_in_text('طائرة علم مدينة صديق سيارة') == 2", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('سيارة مدينة حاسوب خبز بيت بيت حاسوب طائرة') == 1\nassert count_in_text('مطر سماء') == 0\nassert count_in_text('بحر مدينة نهر') == 1\nassert count_in_text('سيارة برتقال') == 0\nassert count_in_text('خبز سوق طالب دفتر قلم بيت بيت خبز') == 1\nassert count_in_text('باب وردة تفاحة قمر طائرة قلم كتاب جبل') == 1\nassert count_in_text('طائرة علم مدينة صديق سيارة') == 2\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('سيارة مدينة حاسوب خبز بيت بيت حاسوب طائرة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "5a932f1e97a2f1a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عمل وردة قلم وردة') == 2", "assert lead_count('مكتبة كتاب فجر ماء') == 0", "assert lead_count('وردة شجرة فجر وردة ليل شجرة صحراء') == 2", "assert lead_count('ماء مكتبة سوق عربية باب') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('وردة صديق برتقال ميناء مدرسة') == 1\nassert lead_count('حصان سيارة جمل ماء سماء') == 0\nassert lead_count('عمل وردة قلم وردة') == 2\nassert lead_count('مكتبة كتاب فجر ماء') == 0\nassert lead_count('وردة شجرة فجر وردة ليل شجرة صحراء') == 2\nassert lead_count('ماء مكتبة سوق عربية باب') == 0\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": "1797ca1e1b87fc08"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 85) == 1)", "tests": ["assert count_coprime(97) == 74", "assert count_coprime(52) == 39", "assert count_coprime(96) == 73", "assert count_coprime(73) == 55", "assert count_coprime(140) == 105", "assert count_coprime(117) == 89", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(97) == 74\nassert count_coprime(52) == 39\nassert count_coprime(96) == 73\nassert count_coprime(73) == 55\nassert count_coprime(140) == 105\nassert count_coprime(117) == 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, 85) == 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, 85) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 85، أي أن القاسم المشترك الأكبر لها مع 85 يساوي 1.\nمثال: `count_coprime(97)` يجب أن تُرجع `74`.\nالجواب:", "qhash": "1d8c20a5fc78d021"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [39, 32, 38, 30, 4]\nprint(sorted(nums, key=lambda x: (abs(x - 16), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [39, 32, 38, 30, 4]\nprint(sorted(nums, key=lambda x: (abs(x - 16), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "54ee9e7920574ad6", "answer": "[4, 30, 32, 38, 39]\n[39, 38, 32]", "completion": " الناتج:\n```text\n[4, 30, 32, 38, 39]\n[39, 38, 32]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('علي', 24), ('حسن', 42), ('زينب', 33), ('هشام', 20)]\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 = [('علي', 24), ('حسن', 42), ('زينب', 33), ('هشام', 20)]\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": "242928e2f730514b", "answer": "[('هشام', 20), ('علي', 24), ('زينب', 33), ('حسن', 42)]\n['حسن', 'زينب']", "completion": " الناتج:\n```text\n[('هشام', 20), ('علي', 24), ('زينب', 33), ('حسن', 42)]\n['حسن', 'زينب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -2 <= x <= 3)", "tests": ["assert pick_between([3, -5, -10, 6, 6, 10, 7, 5]) == [12]", "assert pick_between([]) == []", "assert pick_between([]) == []", "assert pick_between([24, -21]) == []", "assert pick_between([59, -22, 12, 33]) == []", "assert pick_between([37, -23, 25, -9, 10, 49, 15, 47, 33]) == []", "assert pick_between([50, 36]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([3, -5, -10, 6, 6, 10, 7, 5]) == [12]\nassert pick_between([]) == []\nassert pick_between([]) == []\nassert pick_between([24, -21]) == []\nassert pick_between([59, -22, 12, 33]) == []\nassert pick_between([37, -23, 25, -9, 10, 49, 15, 47, 33]) == []\nassert pick_between([50, 36]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -2 <= x <= 3)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if -2 <= x <= 3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -2 ≤ x ≤ 3، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([3, -5, -10, 6, 6, 10, 7, 5])` يُرجع `[12]`.\nالجواب:", "qhash": "50625674668a9230"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 35669\nc = 0\nwhile n > 19:\n n = n // 3\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 35669\nc = 0\nwhile n > 19:\n n = n // 3\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "815f89d750d4c152", "answer": "16 7", "completion": " الناتج:\n```text\n16 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "tests": ["assert sum_div(120) == 2343", "assert sum_div(71) == 828", "assert sum_div(287) == 13680", "assert sum_div(46) == 363", "assert sum_div(58) == 573", "assert sum_div(250) == 10458", "assert sum_div(1) == 0"], "test_code": "assert sum_div(120) == 2343\nassert sum_div(71) == 828\nassert sum_div(287) == 13680\nassert sum_div(46) == 363\nassert sum_div(58) == 573\nassert sum_div(250) == 10458\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 % 9 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(120)` يُرجع `2343`.\nالجواب:", "qhash": "14900ba5ce498b00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([2, 66, 42, 21, 6, 23, 67, 47]) == [2, 68, 110, 0, 6, 29, 96, 0]", "assert reset_sum([104, 75, 10]) == [104, 0, 10]", "assert reset_sum([]) == []", "assert reset_sum([121, 26, -3, 98, 50]) == [121, 0, -3, 95, 0]", "assert reset_sum([105, -10, 80, 101, 81, 94, 64, 128, 77]) == [105, 95, 0, 101, 0, 94, 0, 128, 0]", "assert reset_sum([36, 40, 37, 10, 22, 109, 106, 57, 22, 16]) == [36, 76, 113, 123, 0, 109, 0, 57, 79, 95]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([2, 66, 42, 21, 6, 23, 67, 47]) == [2, 68, 110, 0, 6, 29, 96, 0]\nassert reset_sum([104, 75, 10]) == [104, 0, 10]\nassert reset_sum([]) == []\nassert reset_sum([121, 26, -3, 98, 50]) == [121, 0, -3, 95, 0]\nassert reset_sum([105, -10, 80, 101, 81, 94, 64, 128, 77]) == [105, 95, 0, 101, 0, 94, 0, 128, 0]\nassert reset_sum([36, 40, 37, 10, 22, 109, 106, 57, 22, 16]) == [36, 76, 113, 123, 0, 109, 0, 57, 79, 95]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\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 > 128:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 128 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([2, 66, 42, 21, 6, 23, 67, 47])` يُرجع `[2, 68, 110, 0, 6, 29, 96, 0]`.\nالجواب:", "qhash": "a580f05faa17190a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ahno'}", "tests": ["assert char_freq('cloud') == {'a': 0, 'h': 0, 'n': 0, 'o': 1}", "assert char_freq('stone garden summer apple') == {'a': 2, 'h': 0, 'n': 2, 'o': 1}", "assert char_freq('window rocket orange') == {'a': 1, 'h': 0, 'n': 2, 'o': 3}", "assert char_freq('river cloud') == {'a': 0, 'h': 0, 'n': 0, 'o': 1}", "assert char_freq('garden') == {'a': 1, 'h': 0, 'n': 1, 'o': 0}", "assert char_freq('orange on to it signal') == {'a': 2, 'h': 0, 'n': 3, 'o': 3}", "assert char_freq('') == {'a': 0, 'h': 0, 'n': 0, 'o': 0}"], "test_code": "assert char_freq('cloud') == {'a': 0, 'h': 0, 'n': 0, 'o': 1}\nassert char_freq('stone garden summer apple') == {'a': 2, 'h': 0, 'n': 2, 'o': 1}\nassert char_freq('window rocket orange') == {'a': 1, 'h': 0, 'n': 2, 'o': 3}\nassert char_freq('river cloud') == {'a': 0, 'h': 0, 'n': 0, 'o': 1}\nassert char_freq('garden') == {'a': 1, 'h': 0, 'n': 1, 'o': 0}\nassert char_freq('orange on to it signal') == {'a': 2, 'h': 0, 'n': 3, 'o': 3}\nassert char_freq('') == {'a': 0, 'h': 0, 'n': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ahno'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ahno'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'h'، 'n'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('cloud')` يُرجع `{'a': 0, 'h': 0, 'n': 0, 'o': 1}`.\nالجواب:", "qhash": "ade76c3f822554c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([29, 23, 23, 3, 19, 15, 13, 39, 11]) == [29, 52, 0, 3, 22, 37, 50, 0, 11]", "assert running_sum([62, 8, 16, 15]) == [62, 70, 0, 15]", "assert running_sum([24, 15, 7, 34, 14, 4, 54]) == [24, 39, 46, 0, 14, 18, 72]", "assert running_sum([11, 17, -5, 49, 39]) == [11, 28, 23, 72, 0]", "assert running_sum([]) == []", "assert running_sum([-4, 46, 6, 41, 61, 7, 29, 30, 4]) == [-4, 42, 48, 0, 61, 68, 0, 30, 34]", "assert running_sum([]) == []"], "test_code": "assert running_sum([29, 23, 23, 3, 19, 15, 13, 39, 11]) == [29, 52, 0, 3, 22, 37, 50, 0, 11]\nassert running_sum([62, 8, 16, 15]) == [62, 70, 0, 15]\nassert running_sum([24, 15, 7, 34, 14, 4, 54]) == [24, 39, 46, 0, 14, 18, 72]\nassert running_sum([11, 17, -5, 49, 39]) == [11, 28, 23, 72, 0]\nassert running_sum([]) == []\nassert running_sum([-4, 46, 6, 41, 61, 7, 29, 30, 4]) == [-4, 42, 48, 0, 61, 68, 0, 30, 34]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\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 > 72:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 72 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([29, 23, 23, 3, 19, 15, 13, 39, 11])` يُرجع `[29, 52, 0, 3, 22, 37, 50, 0, 11]`.\nالجواب:", "qhash": "3be1b64edb16e766"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bct'}", "tests": ["assert letter_stats('table an music go engine summer') == {'b': 1, 'c': 1, 't': 1}", "assert letter_stats('stone stone table') == {'b': 1, 'c': 0, 't': 3}", "assert letter_stats('at banana go') == {'b': 1, 'c': 0, 't': 1}", "assert letter_stats('to') == {'b': 0, 'c': 0, 't': 1}", "assert letter_stats('apple brain') == {'b': 1, 'c': 0, 't': 0}", "assert letter_stats('summer in music falcon window') == {'b': 0, 'c': 2, 't': 0}", "assert letter_stats('') == {'b': 0, 'c': 0, 't': 0}"], "test_code": "assert letter_stats('table an music go engine summer') == {'b': 1, 'c': 1, 't': 1}\nassert letter_stats('stone stone table') == {'b': 1, 'c': 0, 't': 3}\nassert letter_stats('at banana go') == {'b': 1, 'c': 0, 't': 1}\nassert letter_stats('to') == {'b': 0, 'c': 0, 't': 1}\nassert letter_stats('apple brain') == {'b': 1, 'c': 0, 't': 0}\nassert letter_stats('summer in music falcon window') == {'b': 0, 'c': 2, 't': 0}\nassert letter_stats('') == {'b': 0, 'c': 0, 't': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bct'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bct'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'c'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('table an music go engine summer')` يجب أن تُرجع `{'b': 1, 'c': 1, 't': 1}`.\nالجواب:", "qhash": "b2090c749a6f0f24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('by stone winter camel by by window') == 'window_camel_winter_stone'", "assert rev_long_words('') == ''", "assert rev_long_words('') == ''", "assert rev_long_words('data is music engine by at') == 'engine_music'", "assert rev_long_words('') == ''", "assert rev_long_words('rocket winter orange winter') == 'winter_orange_winter_rocket'", "assert rev_long_words('banana garden by data') == 'garden_banana'"], "test_code": "assert rev_long_words('by stone winter camel by by window') == 'window_camel_winter_stone'\nassert rev_long_words('') == ''\nassert rev_long_words('') == ''\nassert rev_long_words('data is music engine by at') == 'engine_music'\nassert rev_long_words('') == ''\nassert rev_long_words('rocket winter orange winter') == 'winter_orange_winter_rocket'\nassert rev_long_words('banana garden by data') == 'garden_banana'", "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('by stone winter camel by by window')` يجب أن تُرجع `'window_camel_winter_stone'`.\nالجواب:", "qhash": "5ef0bf9f6b4893a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'قهوة سلام'\nprint(w.replace(' ', '-'))\nprint('س' in w)\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'قهوة سلام'\nprint(w.replace(' ', '-'))\nprint('س' in w)\nprint(w[0])\n```\nالجواب:", "qhash": "7e72e3529c3a4048", "answer": "قهوة-سلام\nTrue\nق", "completion": " الناتج:\n```text\nقهوة-سلام\nTrue\nق\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -3 for x in xs if -8 <= x <= 1)", "tests": ["assert pick_between([-2, 8, 9, -7, -1, -9, 6, 2, 7, 2]) == [3, 6, 21]", "assert pick_between([18, 31, 3, -1, -18, -3, 9, -9]) == [3, 9]", "assert pick_between([]) == []", "assert pick_between([]) == []", "assert pick_between([-6, 55, 52, -11, -28]) == [18]", "assert pick_between([13, -15, 12, -8, -15, 59, -2, 28]) == [6, 24]", "assert pick_between([44, 38, -6, 29, 57, 9, 31, 45, -12]) == [18]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-2, 8, 9, -7, -1, -9, 6, 2, 7, 2]) == [3, 6, 21]\nassert pick_between([18, 31, 3, -1, -18, -3, 9, -9]) == [3, 9]\nassert pick_between([]) == []\nassert pick_between([]) == []\nassert pick_between([-6, 55, 52, -11, -28]) == [18]\nassert pick_between([13, -15, 12, -8, -15, 59, -2, 28]) == [6, 24]\nassert pick_between([44, 38, -6, 29, 57, 9, 31, 45, -12]) == [18]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -3 for x in xs if -8 <= x <= 1)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -3 for x in xs if -8 <= x <= 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -8 ≤ x ≤ 1، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-2, 8, 9, -7, -1, -9, 6, 2, 7, 2])` يُرجع `[3, 6, 21]`.\nالجواب:", "qhash": "02b8d2e9d800346a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_sel([29, 25, 66, 89, 50, 57]) == 2", "assert count_sel([61, 50, 30, 39, 2, 43, -23, 33, -33, 49, 37, 76]) == 4", "assert count_sel([4, 68, 9, -37, -3, 57, -36, -5]) == 4", "assert count_sel([-5, -1, -24, -33, 4, 49, -36, 36, -21, 3, 60, 30]) == 7", "assert count_sel([65, -5, 69, 55]) == 1", "assert count_sel([16, 88, 68, -28, 20, 30]) == 1", "assert count_sel([]) == 0"], "test_code": "assert count_sel([29, 25, 66, 89, 50, 57]) == 2\nassert count_sel([61, 50, 30, 39, 2, 43, -23, 33, -33, 49, 37, 76]) == 4\nassert count_sel([4, 68, 9, -37, -3, 57, -36, -5]) == 4\nassert count_sel([-5, -1, -24, -33, 4, 49, -36, 36, -21, 3, 60, 30]) == 7\nassert count_sel([65, -5, 69, 55]) == 1\nassert count_sel([16, 88, 68, -28, 20, 30]) == 1\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([29, 25, 66, 89, 50, 57])` يُرجع `2`.\nالجواب:", "qhash": "43bc07db0231b6b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 1\nfor n in range(10, 22, 1):\n s += n * 7\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 1\nfor n in range(10, 22, 1):\n s += n * 7\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "d06f9fc01d5d3477", "answer": "1303\n21", "completion": " الناتج:\n```text\n1303\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'ah'}", "tests": ["assert tally('to') == {'a': 0, 'h': 0}", "assert tally('at by') == {'a': 1, 'h': 0}", "assert tally('table we summer is table vector') == {'a': 2, 'h': 0}", "assert tally('coffee signal engine at we matrix') == {'a': 3, 'h': 0}", "assert tally('up python banana desert') == {'a': 3, 'h': 1}", "assert tally('orange a falcon') == {'a': 3, 'h': 0}", "assert tally('') == {'a': 0, 'h': 0}"], "test_code": "assert tally('to') == {'a': 0, 'h': 0}\nassert tally('at by') == {'a': 1, 'h': 0}\nassert tally('table we summer is table vector') == {'a': 2, 'h': 0}\nassert tally('coffee signal engine at we matrix') == {'a': 3, 'h': 0}\nassert tally('up python banana desert') == {'a': 3, 'h': 1}\nassert tally('orange a falcon') == {'a': 3, 'h': 0}\nassert tally('') == {'a': 0, 'h': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'ah'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'ah'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'h' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('to')` يجب أن تُرجع `{'a': 0, 'h': 0}`.\nالجواب:", "qhash": "6e3114fd72975efa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 23493\ncount = 0\nwhile n > 9:\n n = n // 7\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 23493\ncount = 0\nwhile n > 9:\n n = n // 7\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "cd25bbd2f0acf6ba", "answer": "9 4", "completion": " الناتج:\n```text\n9 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)", "tests": ["assert sum_div(90) == 1845", "assert sum_div(88) == 1845", "assert sum_div(133) == 4185", "assert sum_div(162) == 6108", "assert sum_div(86) == 1758", "assert sum_div(283) == 18810", "assert sum_div(1) == 0"], "test_code": "assert sum_div(90) == 1845\nassert sum_div(88) == 1845\nassert sum_div(133) == 4185\nassert sum_div(162) == 6108\nassert sum_div(86) == 1758\nassert sum_div(283) == 18810\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 % 5 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 5.\nمثال: `sum_div(90)` يجب أن تُرجع `1845`.\nالجواب:", "qhash": "b1db3829fb471175"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -1 for x in xs if -12 <= x <= -5)", "tests": ["assert pick_between([3, 3, -15, 4, -7, -16, -4, 2]) == [7]", "assert pick_between([6, -25, -16, 21, 37, 28, -20]) == []", "assert pick_between([-11]) == [11]", "assert pick_between([46, -12, 4]) == [12]", "assert pick_between([21, -29, -11, 4, -26, 16, 12, 55, -20, -24]) == [11]", "assert pick_between([]) == []", "assert pick_between([54, -28, 55, -6, 26, 45, -24, 37]) == [6]", "assert pick_between([]) == []"], "test_code": "assert pick_between([3, 3, -15, 4, -7, -16, -4, 2]) == [7]\nassert pick_between([6, -25, -16, 21, 37, 28, -20]) == []\nassert pick_between([-11]) == [11]\nassert pick_between([46, -12, 4]) == [12]\nassert pick_between([21, -29, -11, 4, -26, 16, 12, 55, -20, -24]) == [11]\nassert pick_between([]) == []\nassert pick_between([54, -28, 55, -6, 26, 45, -24, 37]) == [6]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -1 for x in xs if -12 <= x <= -5)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -1 for x in xs if -12 <= x <= -5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -12 و-5 (شاملًا الطرفين) في -1.\nمثال: `pick_between([3, 3, -15, 4, -7, -16, -4, 2])` يجب أن تُرجع `[7]`.\nالجواب:", "qhash": "44405d4846fc7266"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([43, 1, 45]) == [45, 43, 1]", "assert rotate_by([19, 45, -5, 34, 27, 47, 11, 36, 14, 40, 12, 28]) == [47, 11, 36, 14, 40, 12, 28, 19, 45, -5, 34, 27]", "assert rotate_by([14, -8, -5, -8, 44, -3, -3, 33, 24]) == [24, 14, -8, -5, -8, 44, -3, -3, 33]", "assert rotate_by([25, 16, 0, -1, 34, 39, 16, -1, -6, 48]) == [-1, -6, 48, 25, 16, 0, -1, 34, 39, 16]", "assert rotate_by([38, 16, -5, 16, 11, 37, 26, -5, 31, 35, 5, -3]) == [37, 26, -5, 31, 35, 5, -3, 38, 16, -5, 16, 11]", "assert rotate_by([15, -5, 47, 19, 5]) == [47, 19, 5, 15, -5]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([43, 1, 45]) == [45, 43, 1]\nassert rotate_by([19, 45, -5, 34, 27, 47, 11, 36, 14, 40, 12, 28]) == [47, 11, 36, 14, 40, 12, 28, 19, 45, -5, 34, 27]\nassert rotate_by([14, -8, -5, -8, 44, -3, -3, 33, 24]) == [24, 14, -8, -5, -8, 44, -3, -3, 33]\nassert rotate_by([25, 16, 0, -1, 34, 39, 16, -1, -6, 48]) == [-1, -6, 48, 25, 16, 0, -1, 34, 39, 16]\nassert rotate_by([38, 16, -5, 16, 11, 37, 26, -5, 31, 35, 5, -3]) == [37, 26, -5, 31, 35, 5, -3, 38, 16, -5, 16, 11]\nassert rotate_by([15, -5, 47, 19, 5]) == [47, 19, 5, 15, -5]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([43, 1, 45])` يُرجع `[45, 43, 1]`.\nالجواب:", "qhash": "3f6302eb31aeb63d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if 5 <= x <= 44)", "tests": ["assert clip_scale([7, -3, 42, 29, 47, 22, 10]) == [35, 50, 110, 145, 210]", "assert clip_scale([44, 11]) == [55, 220]", "assert clip_scale([11, 32]) == [55, 160]", "assert clip_scale([54, -25, 21, 1, -30, 16, 46]) == [80, 105]", "assert clip_scale([19, 12]) == [60, 95]", "assert clip_scale([-23, 39, 58]) == [195]", "assert clip_scale([22, 52, -5, -6, 16, -16, 5]) == [25, 80, 110]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([7, -3, 42, 29, 47, 22, 10]) == [35, 50, 110, 145, 210]\nassert clip_scale([44, 11]) == [55, 220]\nassert clip_scale([11, 32]) == [55, 160]\nassert clip_scale([54, -25, 21, 1, -30, 16, 46]) == [80, 105]\nassert clip_scale([19, 12]) == [60, 95]\nassert clip_scale([-23, 39, 58]) == [195]\nassert clip_scale([22, 52, -5, -6, 16, -16, 5]) == [25, 80, 110]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if 5 <= x <= 44)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 5 for x in xs if 5 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 5 و44 (شاملًا الطرفين) في 5.\nمثال: `clip_scale([7, -3, 42, 29, 47, 22, 10])` يجب أن تُرجع `[35, 50, 110, 145, 210]`.\nالجواب:", "qhash": "18392220431bee30"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "tests": ["assert weighted_sum(5) == 330", "assert weighted_sum(3) == 84", "assert weighted_sum(14) == 6090", "assert weighted_sum(2) == 30", "assert weighted_sum(0) == 0", "assert weighted_sum(1) == 6", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 330\nassert weighted_sum(3) == 84\nassert weighted_sum(14) == 6090\nassert weighted_sum(2) == 30\nassert weighted_sum(0) == 0\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 ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(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 weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `330`.\nالجواب:", "qhash": "c9a8d8903cd8550f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([0, 5, 16, 39, 3]) == [39, 3, 0, 5, 16]", "assert rotate_by([12]) == [12]", "assert rotate_by([14, 26, 44]) == [44, 14, 26]", "assert rotate_by([20, 16, 14, -2, 36, -4, 39, 17]) == [16, 14, -2, 36, -4, 39, 17, 20]", "assert rotate_by([1, -5]) == [-5, 1]", "assert rotate_by([-1, 24, 9, 14, 11]) == [14, 11, -1, 24, 9]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([0, 5, 16, 39, 3]) == [39, 3, 0, 5, 16]\nassert rotate_by([12]) == [12]\nassert rotate_by([14, 26, 44]) == [44, 14, 26]\nassert rotate_by([20, 16, 14, -2, 36, -4, 39, 17]) == [16, 14, -2, 36, -4, 39, 17, 20]\nassert rotate_by([1, -5]) == [-5, 1]\nassert rotate_by([-1, 24, 9, 14, 11]) == [14, 11, -1, 24, 9]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n if not items:\n return []\n k = 7 % 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 = 7 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(items):\n if not items:\n return []\n k = 7 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([0, 5, 16, 39, 3])` يُرجع `[39, 3, 0, 5, 16]`.\nالجواب:", "qhash": "10a6fa0a87646a94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 10 <= x <= 42)", "tests": ["assert in_range_scaled([9, 9, 31, 34, 37]) == [-148, -136, -124]", "assert in_range_scaled([]) == []", "assert in_range_scaled([39, 37]) == [-156, -148]", "assert in_range_scaled([-11, 54, -4, 3, -21, -26, -3, 56]) == []", "assert in_range_scaled([-12, -25, 15, -5, 14]) == [-60, -56]", "assert in_range_scaled([37, 24, 38, -25, -12, 16, 18]) == [-152, -148, -96, -72, -64]", "assert in_range_scaled([32, 50, -5, 11, 15, 24, 40, -26]) == [-160, -128, -96, -60, -44]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([9, 9, 31, 34, 37]) == [-148, -136, -124]\nassert in_range_scaled([]) == []\nassert in_range_scaled([39, 37]) == [-156, -148]\nassert in_range_scaled([-11, 54, -4, 3, -21, -26, -3, 56]) == []\nassert in_range_scaled([-12, -25, 15, -5, 14]) == [-60, -56]\nassert in_range_scaled([37, 24, 38, -25, -12, 16, 18]) == [-152, -148, -96, -72, -64]\nassert in_range_scaled([32, 50, -5, 11, 15, 24, 40, -26]) == [-160, -128, -96, -60, -44]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 10 <= x <= 42)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 10 <= x <= 42)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و42 (شاملًا الطرفين) في -4.\nمثال: `in_range_scaled([9, 9, 31, 34, 37])` يجب أن تُرجع `[-148, -136, -124]`.\nالجواب:", "qhash": "ccb109543408738b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if w.startswith('ن'))", "tests": ["assert tally_letter('جمل مكتبة باب علم سيارة قمر نور') == 1", "assert tally_letter('سيارة سلام معلم دفتر مكتبة شجرة') == 0", "assert tally_letter('قلم ميناء حصان قهوة شمس ميناء لغة خبز') == 0", "assert tally_letter('شمس طالب كتاب كتاب سماء نهر دفتر ليل') == 1", "assert tally_letter('مكتبة خبز عمل شمس صديق عربية طائرة') == 0", "assert tally_letter('مدرسة صديق ماء شمس شمس سماء طائرة عمل') == 0", "assert tally_letter('نهر شمس نور باب ماء') == 2", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('جمل مكتبة باب علم سيارة قمر نور') == 1\nassert tally_letter('سيارة سلام معلم دفتر مكتبة شجرة') == 0\nassert tally_letter('قلم ميناء حصان قهوة شمس ميناء لغة خبز') == 0\nassert tally_letter('شمس طالب كتاب كتاب سماء نهر دفتر ليل') == 1\nassert tally_letter('مكتبة خبز عمل شمس صديق عربية طائرة') == 0\nassert tally_letter('مدرسة صديق ماء شمس شمس سماء طائرة عمل') == 0\nassert tally_letter('نهر شمس نور باب ماء') == 2\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('جمل مكتبة باب علم سيارة قمر نور')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "7432443d3ae82f47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('قهوة دفتر رمل حصان ماء سفينة') == 1", "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('قهوة دفتر رمل حصان ماء سفينة') == 1\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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «س»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('قمر صديق عمل باب باب')` يُرجع `0`.\nالجواب:", "qhash": "b92a5fcf373dbf11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert begin_count('وردة وردة بحر حاسوب') == 2", "assert begin_count('وردة سيارة قهوة') == 1", "assert begin_count('وردة ميناء وردة قلم نهار سوق مدرسة مدينة') == 2", "assert begin_count('دفتر برمجة سماء مطر') == 0", "assert begin_count('حصان سلام باب طالب') == 0", "assert begin_count('سيارة خبز فجر سيارة') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('وردة وردة بحر حاسوب') == 2\nassert begin_count('وردة سيارة قهوة') == 1\nassert begin_count('وردة ميناء وردة قلم نهار سوق مدرسة مدينة') == 2\nassert begin_count('دفتر برمجة سماء مطر') == 0\nassert begin_count('حصان سلام باب طالب') == 0\nassert begin_count('سيارة خبز فجر سيارة') == 0\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(line):\n count = 0\n for w in line:\n if w.startswith('و'):\n count += 1\n return count\n```\nمثال: `begin_count('وردة وردة بحر حاسوب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "033f53949aaea01d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(11))\nprint(f(11, -8))\nprint(f(f(-8), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(11))\nprint(f(11, -8))\nprint(f(f(-8), 11))\n```\nالجواب:", "qhash": "d634d08a1bfb6baf", "answer": "77\n85\n69", "completion": " الناتج:\n```text\n77\n85\n69\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate([8, 43, 43, 8, 28, 0, 37, 21]) == [21, 8, 43, 43, 8, 28, 0, 37]", "assert rotate([23, 16, 3, 9, 35, 7, 50, 0, 37]) == [23, 16, 3, 9, 35, 7, 50, 0, 37]", "assert rotate([6, 1, -3, 19]) == [19, 6, 1, -3]", "assert rotate([35, 47, 45, 1, 7, -9, 4, 15]) == [15, 35, 47, 45, 1, 7, -9, 4]", "assert rotate([35, 19, 29, 50, 11, 13, 18, 13]) == [13, 35, 19, 29, 50, 11, 13, 18]", "assert rotate([0, 11, 39, 33, 13, 22, -6]) == [22, -6, 0, 11, 39, 33, 13]", "assert rotate([]) == []"], "test_code": "assert rotate([8, 43, 43, 8, 28, 0, 37, 21]) == [21, 8, 43, 43, 8, 28, 0, 37]\nassert rotate([23, 16, 3, 9, 35, 7, 50, 0, 37]) == [23, 16, 3, 9, 35, 7, 50, 0, 37]\nassert rotate([6, 1, -3, 19]) == [19, 6, 1, -3]\nassert rotate([35, 47, 45, 1, 7, -9, 4, 15]) == [15, 35, 47, 45, 1, 7, -9, 4]\nassert rotate([35, 19, 29, 50, 11, 13, 18, 13]) == [13, 35, 19, 29, 50, 11, 13, 18]\nassert rotate([0, 11, 39, 33, 13, 22, -6]) == [22, -6, 0, 11, 39, 33, 13]\nassert rotate([]) == []", "answer": "def rotate(arr):\n if not arr:\n return []\n k = 9 % 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 = 9 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([8, 43, 43, 8, 28, 0, 37, 21])` يُرجع `[21, 8, 43, 43, 8, 28, 0, 37]`.\nالجواب:", "qhash": "48ef7d9e1a02b9e5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 79", "tests": ["assert digit_score(71964) == 8", "assert digit_score(764748) == 41", "assert digit_score(36945) == 50", "assert digit_score(583632) == 33", "assert digit_score(171678) == 5", "assert digit_score(486173) == 73", "assert digit_score(253543) == 25", "assert digit_score(0) == 0"], "test_code": "assert digit_score(71964) == 8\nassert digit_score(764748) == 41\nassert digit_score(36945) == 50\nassert digit_score(583632) == 33\nassert digit_score(171678) == 5\nassert digit_score(486173) == 73\nassert digit_score(253543) == 25\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 79", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 79.\nللتوضيح: الاستدعاء `digit_score(71964)` يُرجع `8`.\nالجواب:", "qhash": "c1d41cd26f2fbfa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 19274\nc = 0\nwhile m > 12:\n m = m // 7\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 19274\nc = 0\nwhile m > 12:\n m = m // 7\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "abb9462c18572ad3", "answer": "8 4", "completion": " الناتج:\n```text\n8 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 74) == 1)", "tests": ["assert count_coprime(26) == 13", "assert count_coprime(28) == 14", "assert count_coprime(151) == 74", "assert count_coprime(9) == 5", "assert count_coprime(3) == 2", "assert count_coprime(79) == 39", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(26) == 13\nassert count_coprime(28) == 14\nassert count_coprime(151) == 74\nassert count_coprime(9) == 5\nassert count_coprime(3) == 2\nassert count_coprime(79) == 39\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, 74) == 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, 74) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 74) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(26)` يُرجع `13`.\nالجواب:", "qhash": "fabaf76c9885a7f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'aeir'}", "tests": ["assert char_freq('garden signal') == {'a': 2, 'e': 1, 'i': 1, 'r': 1}", "assert char_freq('rocket stone it') == {'a': 0, 'e': 2, 'i': 1, 'r': 1}", "assert char_freq('apple an') == {'a': 2, 'e': 1, 'i': 0, 'r': 0}", "assert char_freq('is a') == {'a': 1, 'e': 0, 'i': 1, 'r': 0}", "assert char_freq('rocket winter table is a in') == {'a': 2, 'e': 3, 'i': 3, 'r': 2}", "assert char_freq('brain to signal cloud stone banana') == {'a': 5, 'e': 1, 'i': 2, 'r': 1}", "assert char_freq('') == {'a': 0, 'e': 0, 'i': 0, 'r': 0}"], "test_code": "assert char_freq('garden signal') == {'a': 2, 'e': 1, 'i': 1, 'r': 1}\nassert char_freq('rocket stone it') == {'a': 0, 'e': 2, 'i': 1, 'r': 1}\nassert char_freq('apple an') == {'a': 2, 'e': 1, 'i': 0, 'r': 0}\nassert char_freq('is a') == {'a': 1, 'e': 0, 'i': 1, 'r': 0}\nassert char_freq('rocket winter table is a in') == {'a': 2, 'e': 3, 'i': 3, 'r': 2}\nassert char_freq('brain to signal cloud stone banana') == {'a': 5, 'e': 1, 'i': 2, 'r': 1}\nassert char_freq('') == {'a': 0, 'e': 0, 'i': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'aeir'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'aeir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'e'، 'i'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('garden signal')` يُرجع `{'a': 2, 'e': 1, 'i': 1, 'r': 1}`.\nالجواب:", "qhash": "f2d1f23dd42e28f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 53", "tests": ["assert fact_mod(11) == 32", "assert fact_mod(1) == 1", "assert fact_mod(43) == 49", "assert fact_mod(4) == 4", "assert fact_mod(59) == 0", "assert fact_mod(37) == 44", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 32\nassert fact_mod(1) == 1\nassert fact_mod(43) == 49\nassert fact_mod(4) == 4\nassert fact_mod(59) == 0\nassert fact_mod(37) == 44\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 53", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(11)` يُرجع `32`.\nالجواب:", "qhash": "0cd27516b0cae727"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(596281741))\nprint(f(f(596281741)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(596281741))\nprint(f(f(596281741)))\n```\nالجواب:", "qhash": "0ccd5a3b0b420cd8", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'elmt'}", "tests": ["assert tally('camel') == {'e': 1, 'l': 1, 'm': 1, 't': 0}", "assert tally('brain falcon river winter to') == {'e': 2, 'l': 1, 'm': 0, 't': 2}", "assert tally('coffee music orange window') == {'e': 3, 'l': 0, 'm': 1, 't': 0}", "assert tally('code code on') == {'e': 2, 'l': 0, 'm': 0, 't': 0}", "assert tally('is by orange code') == {'e': 2, 'l': 0, 'm': 0, 't': 0}", "assert tally('desert engine table we light camel') == {'e': 7, 'l': 3, 'm': 1, 't': 3}", "assert tally('') == {'e': 0, 'l': 0, 'm': 0, 't': 0}"], "test_code": "assert tally('camel') == {'e': 1, 'l': 1, 'm': 1, 't': 0}\nassert tally('brain falcon river winter to') == {'e': 2, 'l': 1, 'm': 0, 't': 2}\nassert tally('coffee music orange window') == {'e': 3, 'l': 0, 'm': 1, 't': 0}\nassert tally('code code on') == {'e': 2, 'l': 0, 'm': 0, 't': 0}\nassert tally('is by orange code') == {'e': 2, 'l': 0, 'm': 0, 't': 0}\nassert tally('desert engine table we light camel') == {'e': 7, 'l': 3, 'm': 1, 't': 3}\nassert tally('') == {'e': 0, 'l': 0, 'm': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'elmt'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'elmt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'l'، 'm'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('camel')` يُرجع `{'e': 1, 'l': 1, 'm': 1, 't': 0}`.\nالجواب:", "qhash": "ff3e3b7c142cc125"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 25)", "tests": ["assert select_range([31, 30, 12, 32, 29, 14, 6, 16, 26, 32]) == [-80]", "assert select_range([43, 2, 53, 24, -10, -1, 38, 52, 24]) == [-120, -120]", "assert select_range([15, 55, 52, -28, 50, -15, 3, -1, 42, -15]) == []", "assert select_range([44, -14, 60]) == []", "assert select_range([-22, 46, 40, 53, -26, 47, 53]) == []", "assert select_range([52, -2, -29]) == []", "assert select_range([38, -2, 46, 50, -27, 29, -3]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([31, 30, 12, 32, 29, 14, 6, 16, 26, 32]) == [-80]\nassert select_range([43, 2, 53, 24, -10, -1, 38, 52, 24]) == [-120, -120]\nassert select_range([15, 55, 52, -28, 50, -15, 3, -1, 42, -15]) == []\nassert select_range([44, -14, 60]) == []\nassert select_range([-22, 46, 40, 53, -26, 47, 53]) == []\nassert select_range([52, -2, -29]) == []\nassert select_range([38, -2, 46, 50, -27, 29, -3]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 25)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 25)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 16 ≤ x ≤ 25، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([31, 30, 12, 32, 29, 14, 6, 16, 26, 32])` يُرجع `[-80]`.\nالجواب:", "qhash": "803373586f45b36c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 16\nfor i in range(9, 13, 1):\n result += i * 7\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 16\nfor i in range(9, 13, 1):\n result += i * 7\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "a8a30a29f0b6da06", "answer": "310\n12", "completion": " الناتج:\n```text\n310\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('on planet planet') == 'po qmbofu qmbofu'", "assert rotate_letters('python by matrix a river') == 'qzuipo cz nbusjy b sjwfs'", "assert rotate_letters('cloud cloud summer is !') == 'dmpve dmpve tvnnfs jt !'", "assert rotate_letters('a falcon by up python A1') == 'b gbmdpo cz vq qzuipo A1'", "assert rotate_letters('is pixel') == 'jt qjyfm'", "assert rotate_letters('at is') == 'bu jt'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('on planet planet') == 'po qmbofu qmbofu'\nassert rotate_letters('python by matrix a river') == 'qzuipo cz nbusjy b sjwfs'\nassert rotate_letters('cloud cloud summer is !') == 'dmpve dmpve tvnnfs jt !'\nassert rotate_letters('a falcon by up python A1') == 'b gbmdpo cz vq qzuipo A1'\nassert rotate_letters('is pixel') == 'jt qjyfm'\nassert rotate_letters('at is') == 'bu jt'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('on planet planet')` يُرجع `'po qmbofu qmbofu'`.\nالجواب:", "qhash": "b3fbee62073f0f99"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ن'):\n count += 1\n return count", "tests": ["assert count_start('قمر مطر علم نور') == 1", "assert count_start('نور نهر ماء مدرسة عمل فجر جبل') == 2", "assert count_start('قلم سلام نهار نهار نهار سلام') == 3", "assert count_start('نور مدينة عمل نهر صحراء سوق') == 2", "assert count_start('نور حصان تفاحة') == 1", "assert count_start('عربية سماء قهوة وردة حديقة مدرسة') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('قمر مطر علم نور') == 1\nassert count_start('نور نهر ماء مدرسة عمل فجر جبل') == 2\nassert count_start('قلم سلام نهار نهار نهار سلام') == 3\nassert count_start('نور مدينة عمل نهر صحراء سوق') == 2\nassert count_start('نور حصان تفاحة') == 1\nassert count_start('عربية سماء قهوة وردة حديقة مدرسة') == 0\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ن'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(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_start(s):\n count = 0\n for w in s.split():\n if w.endswith('ن'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('قمر مطر علم نور')` يُرجع `1`.\nالجواب:", "qhash": "635b57bdcc898132"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('music banana matrix to desert orange') == 'orange|desert|to|matrix|banana|music'", "assert words_reversed('') == ''", "assert words_reversed('python rocket up up data stone') == 'stone|data|up|up|rocket|python'", "assert words_reversed('a up at matrix in at') == 'at|in|matrix|at|up'", "assert words_reversed('') == ''", "assert words_reversed('data matrix coffee brain brain') == 'brain|brain|coffee|matrix|data'", "assert words_reversed('a a matrix an orange') == 'orange|an|matrix'"], "test_code": "assert words_reversed('music banana matrix to desert orange') == 'orange|desert|to|matrix|banana|music'\nassert words_reversed('') == ''\nassert words_reversed('python rocket up up data stone') == 'stone|data|up|up|rocket|python'\nassert words_reversed('a up at matrix in at') == 'at|in|matrix|at|up'\nassert words_reversed('') == ''\nassert words_reversed('data matrix coffee brain brain') == 'brain|brain|coffee|matrix|data'\nassert words_reversed('a a matrix an orange') == 'orange|an|matrix'", "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('music banana matrix to desert orange')` يجب أن تُرجع `'orange|desert|to|matrix|banana|music'`.\nالجواب:", "qhash": "5d855409afad2062"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 5", "tests": ["assert digits_mod(20787) == 1", "assert digits_mod(281979) == 0", "assert digits_mod(33782) == 0", "assert digits_mod(88003) == 2", "assert digits_mod(744736) == 0", "assert digits_mod(446710) == 3", "assert digits_mod(791869) == 2", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(20787) == 1\nassert digits_mod(281979) == 0\nassert digits_mod(33782) == 0\nassert digits_mod(88003) == 2\nassert digits_mod(744736) == 0\nassert digits_mod(446710) == 3\nassert digits_mod(791869) == 2\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 5", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 5.\nللتوضيح: الاستدعاء `digits_mod(20787)` يُرجع `1`.\nالجواب:", "qhash": "28586397d58275c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [16, 38, 4, -8, -8, 5]\nprint(a[3:5])\nprint(a[::-1])\nprint(min(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [16, 38, 4, -8, -8, 5]\nprint(a[3:5])\nprint(a[::-1])\nprint(min(a[3:5]))\n```\nالجواب:", "qhash": "ab295f92337a73ef", "answer": "[-8, -8]\n[5, -8, -8, 4, 38, 16]\n-8", "completion": " الناتج:\n```text\n[-8, -8]\n[5, -8, -8, 4, 38, 16]\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "tests": ["assert sum_multiples(174) == 3612", "assert sum_multiples(124) == 1860", "assert sum_multiples(51) == 312", "assert sum_multiples(43) == 264", "assert sum_multiples(246) == 7320", "assert sum_multiples(76) == 684", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(174) == 3612\nassert sum_multiples(124) == 1860\nassert sum_multiples(51) == 312\nassert sum_multiples(43) == 264\nassert sum_multiples(246) == 7320\nassert sum_multiples(76) == 684\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 % 8 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(174)` يُرجع `3612`.\nالجواب:", "qhash": "a1d4b34ec3afb269"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "tests": ["assert sum_terms(5) == 44250", "assert sum_terms(9) == 1208250", "assert sum_terms(11) == 3818760", "assert sum_terms(3) == 2760", "assert sum_terms(5) == 44250", "assert sum_terms(1) == 10", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(5) == 44250\nassert sum_terms(9) == 1208250\nassert sum_terms(11) == 3818760\nassert sum_terms(3) == 2760\nassert sum_terms(5) == 44250\nassert sum_terms(1) == 10\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 10 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 10 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 10 * i ** 5\n return total\n```\nمثال: `sum_terms(5)` يجب أن تُرجع `44250`.\nالجواب:", "qhash": "d65f87e3adcce77d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ي')", "tests": ["assert count_hits('مكتبة بيت قمر طالب شجرة سفينة') == 2", "assert count_hits('ماء حاسوب قهوة') == 0", "assert count_hits('') == 0", "assert count_hits('حديقة سماء لغة شمس سلام') == 1", "assert count_hits('قهوة باب قمر مطر شجرة قهوة قمر جمل') == 0", "assert count_hits('ميناء حاسوب لغة قهوة قهوة نهار برمجة') == 1", "assert count_hits('تفاحة نهار') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('مكتبة بيت قمر طالب شجرة سفينة') == 2\nassert count_hits('ماء حاسوب قهوة') == 0\nassert count_hits('') == 0\nassert count_hits('حديقة سماء لغة شمس سلام') == 1\nassert count_hits('قهوة باب قمر مطر شجرة قهوة قمر جمل') == 0\nassert count_hits('ميناء حاسوب لغة قهوة قهوة نهار برمجة') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ي» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('مكتبة بيت قمر طالب شجرة سفينة')` يُرجع `2`.\nالجواب:", "qhash": "0317ffbd474edd54"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-15, -2, 22, 17, -15, 17, -30]) == -15", "assert best_multiple([-3, -3, -9]) == -3", "assert best_multiple([1, 4]) == None", "assert best_multiple([]) == None", "assert best_multiple([-7, 29, 14, 37, -27, 38]) == -27", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-15, -2, 22, 17, -15, 17, -30]) == -15\nassert best_multiple([-3, -3, -9]) == -3\nassert best_multiple([1, 4]) == None\nassert best_multiple([]) == None\nassert best_multiple([-7, 29, 14, 37, -27, 38]) == -27\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(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للتوضيح: الاستدعاء `best_multiple([-15, -2, 22, 17, -15, 17, -30])` يُرجع `-15`.\nالجواب:", "qhash": "21b3634c172b642a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('go code it code at by') == 'code code'", "assert flip_words('banana table it banana pixel we') == 'pixel banana table banana'", "assert flip_words('winter river a music garden desert apple cloud') == 'cloud apple desert garden music river winter'", "assert flip_words('apple') == 'apple'", "assert flip_words('to stone') == 'stone'", "assert flip_words('') == ''", "assert flip_words('window of desert') == 'desert window'"], "test_code": "assert flip_words('go code it code at by') == 'code code'\nassert flip_words('banana table it banana pixel we') == 'pixel banana table banana'\nassert flip_words('winter river a music garden desert apple cloud') == 'cloud apple desert garden music river winter'\nassert flip_words('apple') == 'apple'\nassert flip_words('to stone') == 'stone'\nassert flip_words('') == ''\nassert flip_words('window of desert') == 'desert window'", "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('go code it code at by')` يجب أن تُرجع `'code code'`.\nالجواب:", "qhash": "f7aa8ed609c4654f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "how_many", "reference": "def how_many(text):\n return text.count('ق')", "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 text.count('ق')", "completion": " ```python\ndef how_many(text):\n return text.count('ق')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `how_many(text)` بحيث تُعيد عدد مرات ظهور الحرف «ق» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('تفاحة مطر نهر')` يُرجع `0`.\nالجواب:", "qhash": "2f02e08995d0ffdd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 2) == 1)", "tests": ["assert count_gcd1(102) == 51", "assert count_gcd1(125) == 63", "assert count_gcd1(18) == 9", "assert count_gcd1(115) == 58", "assert count_gcd1(28) == 14", "assert count_gcd1(191) == 96", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(102) == 51\nassert count_gcd1(125) == 63\nassert count_gcd1(18) == 9\nassert count_gcd1(115) == 58\nassert count_gcd1(28) == 14\nassert count_gcd1(191) == 96\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, 2) == 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, 2) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 2) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(102)` يُرجع `51`.\nالجواب:", "qhash": "716689e2d2397f22"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 1) // 4 for x in range(-6, 8) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 1) // 4 for x in range(-6, 8) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a451ba9bcfbaacc0", "answer": "[-2, -1, 0, 1]\n4 -2", "completion": " الناتج:\n```text\n[-2, -1, 0, 1]\n4 -2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10']", "assert fizzbuzz(25) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23', 'Fizz', '25']", "assert fizzbuzz(13) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13']", "assert fizzbuzz(18) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz']", "assert fizzbuzz(4) == ['1', '2', 'Fizz', '4']"], "test_code": "assert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10']\nassert fizzbuzz(25) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23', 'Fizz', '25']\nassert fizzbuzz(13) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13']\nassert fizzbuzz(18) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz']\nassert fizzbuzz(4) == ['1', '2', 'Fizz', '4']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Fizz'\n if i % 7 == 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 % 3 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Fizz'، وإن قَبِلها على 7 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(10)` يُرجع `['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10']`.\nالجواب:", "qhash": "3b6637340b42bc24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([47, 52, 5, 22, 30, 55]) == [47, 99, 104, 0, 30, 85]", "assert acc_reset([83, 91, 77, 92, 93, 106]) == [83, 0, 77, 0, 93, 0]", "assert acc_reset([]) == []", "assert acc_reset([99, -10, 43]) == [99, 89, 0]", "assert acc_reset([101, -4, 69, 58, 104, 35, 53, 36]) == [101, 97, 0, 58, 0, 35, 88, 0]", "assert acc_reset([68, 70, -4, 62, 36, 18, -2, -4, 34, 86]) == [68, 0, -4, 58, 94, 0, -2, -6, 28, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([47, 52, 5, 22, 30, 55]) == [47, 99, 104, 0, 30, 85]\nassert acc_reset([83, 91, 77, 92, 93, 106]) == [83, 0, 77, 0, 93, 0]\nassert acc_reset([]) == []\nassert acc_reset([99, -10, 43]) == [99, 89, 0]\nassert acc_reset([101, -4, 69, 58, 104, 35, 53, 36]) == [101, 97, 0, 58, 0, 35, 88, 0]\nassert acc_reset([68, 70, -4, 62, 36, 18, -2, -4, 34, 86]) == [68, 0, -4, 58, 94, 0, -2, -6, 28, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 109 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([47, 52, 5, 22, 30, 55])` يجب أن تُرجع `[47, 99, 104, 0, 30, 85]`.\nالجواب:", "qhash": "d8fa7773934e31a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'طالب شجرة'\nprint(s[0])\nprint(s.replace(' ', '-'))\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'طالب شجرة'\nprint(s[0])\nprint(s.replace(' ', '-'))\nprint(s.split())\n```\nالجواب:", "qhash": "0533b72fd040d37c", "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#1", "code": "n = 268\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 = 268\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": "3ee6ca4d659aa74e", "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#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(201) == 10100", "assert add_multiples(288) == 20592", "assert add_multiples(209) == 10920", "assert add_multiples(24) == 132", "assert add_multiples(275) == 18906", "assert add_multiples(175) == 7656", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(201) == 10100\nassert add_multiples(288) == 20592\nassert add_multiples(209) == 10920\nassert add_multiples(24) == 132\nassert add_multiples(275) == 18906\nassert add_multiples(175) == 7656\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(201)` يُرجع `10100`.\nالجواب:", "qhash": "579be734bda7acfa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'cmno'}", "tests": ["assert count_chars('orange coffee of winter') == {'c': 1, 'm': 0, 'n': 2, 'o': 3}", "assert count_chars('we data banana pixel') == {'c': 0, 'm': 0, 'n': 2, 'o': 0}", "assert count_chars('up on') == {'c': 0, 'm': 0, 'n': 1, 'o': 1}", "assert count_chars('orange code music is brain it') == {'c': 2, 'm': 1, 'n': 2, 'o': 2}", "assert count_chars('planet by of to is up') == {'c': 0, 'm': 0, 'n': 1, 'o': 2}", "assert count_chars('apple is of rocket pixel vector') == {'c': 2, 'm': 0, 'n': 0, 'o': 3}", "assert count_chars('') == {'c': 0, 'm': 0, 'n': 0, 'o': 0}"], "test_code": "assert count_chars('orange coffee of winter') == {'c': 1, 'm': 0, 'n': 2, 'o': 3}\nassert count_chars('we data banana pixel') == {'c': 0, 'm': 0, 'n': 2, 'o': 0}\nassert count_chars('up on') == {'c': 0, 'm': 0, 'n': 1, 'o': 1}\nassert count_chars('orange code music is brain it') == {'c': 2, 'm': 1, 'n': 2, 'o': 2}\nassert count_chars('planet by of to is up') == {'c': 0, 'm': 0, 'n': 1, 'o': 2}\nassert count_chars('apple is of rocket pixel vector') == {'c': 2, 'm': 0, 'n': 0, 'o': 3}\nassert count_chars('') == {'c': 0, 'm': 0, 'n': 0, 'o': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'cmno'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'cmno'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'm'، 'n'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('orange coffee of winter')` يُرجع `{'c': 1, 'm': 0, 'n': 2, 'o': 3}`.\nالجواب:", "qhash": "4f7495193d48ec9b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [8, 13, -8, 39, 26]\nprint(items[2:3])\nprint(items[::-2])\nprint(len(items[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [8, 13, -8, 39, 26]\nprint(items[2:3])\nprint(items[::-2])\nprint(len(items[2:3]))\n```\nالجواب:", "qhash": "5ad4d87c0490b72f", "answer": "[-8]\n[26, -8, 8]\n1", "completion": " الناتج:\n```text\n[-8]\n[26, -8, 8]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('falcon it desert cloud is OK') == 'jepgsr mx hiwivx gpsyh mw OK'", "assert encode('cloud brain cloud rocket table') == 'gpsyh fvemr gpsyh vsgoix xefpi'", "assert encode('of rocket garden') == 'sj vsgoix kevhir'", "assert encode('a planet brain vector rocket') == 'e tperix fvemr zigxsv vsgoix'", "assert encode('up pixel data pixel apple') == 'yt tmbip hexe tmbip ettpi'", "assert encode('rocket of at') == 'vsgoix sj ex'", "assert encode('') == ''"], "test_code": "assert encode('falcon it desert cloud is OK') == 'jepgsr mx hiwivx gpsyh mw OK'\nassert encode('cloud brain cloud rocket table') == 'gpsyh fvemr gpsyh vsgoix xefpi'\nassert encode('of rocket garden') == 'sj vsgoix kevhir'\nassert encode('a planet brain vector rocket') == 'e tperix fvemr zigxsv vsgoix'\nassert encode('up pixel data pixel apple') == 'yt tmbip hexe tmbip ettpi'\nassert encode('rocket of at') == 'vsgoix sj ex'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('falcon it desert cloud is OK')` يُرجع `'jepgsr mx hiwivx gpsyh mw OK'`.\nالجواب:", "qhash": "7ef29ff1604489dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('garden to orange camel stone data camel camel') == 'camel,camel,data,stone,camel,orange,garden'", "assert words_reversed('winter on garden of matrix desert') == 'desert,matrix,garden,winter'", "assert words_reversed('rocket of it python in is matrix falcon') == 'falcon,matrix,python,rocket'", "assert words_reversed('coffee river up light desert') == 'desert,light,river,coffee'", "assert words_reversed('garden') == 'garden'", "assert words_reversed('vector banana pixel to an is up') == 'pixel,banana,vector'", "assert words_reversed('coffee in camel') == 'camel,coffee'"], "test_code": "assert words_reversed('garden to orange camel stone data camel camel') == 'camel,camel,data,stone,camel,orange,garden'\nassert words_reversed('winter on garden of matrix desert') == 'desert,matrix,garden,winter'\nassert words_reversed('rocket of it python in is matrix falcon') == 'falcon,matrix,python,rocket'\nassert words_reversed('coffee river up light desert') == 'desert,light,river,coffee'\nassert words_reversed('garden') == 'garden'\nassert words_reversed('vector banana pixel to an is up') == 'pixel,banana,vector'\nassert words_reversed('coffee in camel') == 'camel,coffee'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `words_reversed('garden to orange camel stone data camel camel')` يُرجع `'camel,camel,data,stone,camel,orange,garden'`.\nالجواب:", "qhash": "21c8de25d2523596"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('winter table Hello') == 'zlqwhu wdeoh Hhoor'", "assert shift_letters('window rocket apple') == 'zlqgrz urfnhw dssoh'", "assert shift_letters('on cloud data at OK') == 'rq forxg gdwd dw OK'", "assert shift_letters('of code by garden') == 'ri frgh eb jdughq'", "assert shift_letters('coffee code Hello') == 'friihh frgh Hhoor'", "assert shift_letters('winter to rocket 2024') == 'zlqwhu wr urfnhw 2024'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('winter table Hello') == 'zlqwhu wdeoh Hhoor'\nassert shift_letters('window rocket apple') == 'zlqgrz urfnhw dssoh'\nassert shift_letters('on cloud data at OK') == 'rq forxg gdwd dw OK'\nassert shift_letters('of code by garden') == 'ri frgh eb jdughq'\nassert shift_letters('coffee code Hello') == 'friihh frgh Hhoor'\nassert shift_letters('winter to rocket 2024') == 'zlqwhu wr urfnhw 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 + (3)) % 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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('winter table Hello')` يجب أن تُرجع `'zlqwhu wdeoh Hhoor'`.\nالجواب:", "qhash": "99ae09240bfa27a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(669703561))\nprint(f(f(669703561)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(669703561))\nprint(f(f(669703561)))\n```\nالجواب:", "qhash": "1605f5f8cfa14bd5", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 61308\nc = 0\nwhile n > 6:\n n = n // 2\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 61308\nc = 0\nwhile n > 6:\n n = n // 2\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "9fbdc7e886ad5f1b", "answer": "3 14", "completion": " الناتج:\n```text\n3 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "tests": ["assert add_multiples(151) == 3453", "assert add_multiples(123) == 2220", "assert add_multiples(197) == 5900", "assert add_multiples(63) == 574", "assert add_multiples(121) == 2220", "assert add_multiples(139) == 2874", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(151) == 3453\nassert add_multiples(123) == 2220\nassert add_multiples(197) == 5900\nassert add_multiples(63) == 574\nassert add_multiples(121) == 2220\nassert add_multiples(139) == 2874\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(151)` يُرجع `3453`.\nالجواب:", "qhash": "3a38dea7ebf23415"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -1 + 8 for x in range(3, 16) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -1 + 8 for x in range(3, 16) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "4ae081e48ee9df8c", "answer": "[5, 1, -3, -7]\n4 -4", "completion": " الناتج:\n```text\n[5, 1, -3, -7]\n4 -4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['light', 'coffee', 'pixel', 'table', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['light', 'coffee', 'pixel', 'table', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "243e45dc4bbdaeb8", "answer": "['light', 'pixel', 'table', 'coffee', 'matrix']\n['matrix', 'coffee', 'table']", "completion": " الناتج:\n```text\n['light', 'pixel', 'table', 'coffee', 'matrix']\n['matrix', 'coffee', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert play(9) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9']", "assert play(22) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17', 'RedBlue', '19', 'Red', '21', 'Red']", "assert play(0) == []", "assert play(7) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7']", "assert play(17) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17']"], "test_code": "assert play(9) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9']\nassert play(22) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17', 'RedBlue', '19', 'Red', '21', 'Red']\nassert play(0) == []\nassert play(7) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7']\nassert play(17) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(9)` يُرجع `['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9']`.\nالجواب:", "qhash": "15b28c0932adb15f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-12, 19, -3, -10, -11, 0, 14, 26]\nprint(sorted(nums, key=lambda x: (abs(x - 20), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-12, 19, -3, -10, -11, 0, 14, 26]\nprint(sorted(nums, key=lambda x: (abs(x - 20), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "53d50f78f10284bf", "answer": "[19, 14, 26, 0, -3, -10, -11, -12]\n[26, 19, 14]", "completion": " الناتج:\n```text\n[19, 14, 26, 0, -3, -10, -11, -12]\n[26, 19, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 9 for x in range(0, 14) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 9 for x in range(0, 14) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "9b35b5451dc37fe8", "answer": "[-5, 40, 135]\n3 170", "completion": " الناتج:\n```text\n[-5, 40, 135]\n3 170\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 5 for x in xs if -4 <= x <= 7)", "tests": ["assert between_times([15, 17, -13, 3, -9, -6, 8, 17]) == [15]", "assert between_times([38, 14, 47, 2, 52, 9, 19, 40, 55, -1]) == [-5, 10]", "assert between_times([35, 39, 11, -2, -19, 37, 13]) == [-10]", "assert between_times([59, 35, 38]) == []", "assert between_times([49, -3, 14, 20, 40]) == [-15]", "assert between_times([36, -19, 58, -3, 8, -8, 34, -27]) == [-15]", "assert between_times([-26]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([15, 17, -13, 3, -9, -6, 8, 17]) == [15]\nassert between_times([38, 14, 47, 2, 52, 9, 19, 40, 55, -1]) == [-5, 10]\nassert between_times([35, 39, 11, -2, -19, 37, 13]) == [-10]\nassert between_times([59, 35, 38]) == []\nassert between_times([49, -3, 14, 20, 40]) == [-15]\nassert between_times([36, -19, 58, -3, 8, -8, 34, -27]) == [-15]\nassert between_times([-26]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 5 for x in xs if -4 <= x <= 7)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 5 for x in xs if -4 <= x <= 7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق -4 ≤ x ≤ 7، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([15, 17, -13, 3, -9, -6, 8, 17])` يُرجع `[15]`.\nالجواب:", "qhash": "f941636a13895f43"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([33, -30, 4, 20, -27, -15]) == None", "assert max_div([-60, -60, -12]) == -12", "assert max_div([1, 13, 25]) == None", "assert max_div([27, -22, -26, -1]) == None", "assert max_div([-30, 36, 34, 29, 18]) == 36", "assert max_div([]) == None"], "test_code": "assert max_div([33, -30, 4, 20, -27, -15]) == None\nassert max_div([-60, -60, -12]) == -12\nassert max_div([1, 13, 25]) == None\nassert max_div([27, -22, -26, -1]) == None\nassert max_div([-30, 36, 34, 29, 18]) == 36\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = 0\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(arr):\n best = 0\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([33, -30, 4, 20, -27, -15])` يُرجع `None`.\nالجواب:", "qhash": "c4e2b65d9a6ecd7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "tests": ["assert digits_mod(85897) == 37", "assert digits_mod(493277) == 32", "assert digits_mod(68780) == 29", "assert digits_mod(291170) == 20", "assert digits_mod(666680) == 32", "assert digits_mod(932888) == 38", "assert digits_mod(956389) == 40", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(85897) == 37\nassert digits_mod(493277) == 32\nassert digits_mod(68780) == 29\nassert digits_mod(291170) == 20\nassert digits_mod(666680) == 32\nassert digits_mod(932888) == 38\nassert digits_mod(956389) == 40\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 95.\nللتوضيح: الاستدعاء `digits_mod(85897)` يُرجع `37`.\nالجواب:", "qhash": "1b3ee0ca037a8792"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 5 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi']", "assert play(23) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', 'Yo', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']", "assert play(8) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi']", "assert play(23) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', 'Yo', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']", "assert play(5) == ['1', '2', '3', 'Hi', 'Yo']"], "test_code": "assert play(12) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi']\nassert play(23) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', 'Yo', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']\nassert play(8) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi']\nassert play(23) == ['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', 'Yo', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']\nassert play(5) == ['1', '2', '3', 'Hi', 'Yo']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 5 == 0:\n s += 'Yo'\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 % 4 == 0:\n s += 'Hi'\n if i % 5 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Hi'، وإن قَبِلها على 5 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(12)` يُرجع `['1', '2', '3', 'Hi', 'Yo', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi']`.\nالجواب:", "qhash": "69359c0116d2dc4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 2\nfor x in range(0, 10, 2):\n result += x * 3\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 2\nfor x in range(0, 10, 2):\n result += x * 3\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "9417fd497cc216ed", "answer": "62\n8", "completion": " الناتج:\n```text\n62\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)", "tests": ["assert sum_div(127) == 4428", "assert sum_div(255) == 17840", "assert sum_div(2) == 0", "assert sum_div(119) == 3815", "assert sum_div(144) == 5651", "assert sum_div(136) == 4952", "assert sum_div(1) == 0"], "test_code": "assert sum_div(127) == 4428\nassert sum_div(255) == 17840\nassert sum_div(2) == 0\nassert sum_div(119) == 3815\nassert sum_div(144) == 5651\nassert sum_div(136) == 4952\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(127)` يُرجع `4428`.\nالجواب:", "qhash": "bbfa9cf6750af35f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 99630\nsteps = 0\nwhile n > 20:\n n = n // 7\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 99630\nsteps = 0\nwhile n > 20:\n n = n // 7\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "54d29c7da321f0cb", "answer": "5 5", "completion": " الناتج:\n```text\n5 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 12\nfor x in range(4, 18, 1):\n s += x * 8\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 12\nfor x in range(4, 18, 1):\n s += x * 8\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "fb7514650af2806b", "answer": "1188\n17", "completion": " الناتج:\n```text\n1188\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([19, 64, 57, 59, 11, 17]) == 1", "assert tally_div([31, -2, 10, 46, -38]) == 0", "assert tally_div([-30, 87, -14, -39, -26, 20, 75, -32, 45, -8]) == 2", "assert tally_div([35]) == 0", "assert tally_div([-10, 29, 67]) == 0", "assert tally_div([]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([19, 64, 57, 59, 11, 17]) == 1\nassert tally_div([31, -2, 10, 46, -38]) == 0\nassert tally_div([-30, 87, -14, -39, -26, 20, 75, -32, 45, -8]) == 2\nassert tally_div([35]) == 0\nassert tally_div([-10, 29, 67]) == 0\nassert tally_div([]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 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 % 8 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([19, 64, 57, 59, 11, 17])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d758d4063d7f87a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 3:\n return 5\n return 3 * calc(n - 1) + 3\n\nprint(calc(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 3:\n return 5\n return 3 * calc(n - 1) + 3\n\nprint(calc(13))\n```\nالجواب:", "qhash": "a1837f7fc498f693", "answer": "383817", "completion": " الناتج:\n```text\n383817\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 140:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([11, 72, 22, 15, 73]) == [11, 83, 105, 120, 0]", "assert running_sum([105, 67, 29, 86, 35, 67, 80, 35]) == [105, 0, 29, 115, 0, 67, 0, 35]", "assert running_sum([-8, 106, -2, 9, 118, 23]) == [-8, 98, 96, 105, 0, 23]", "assert running_sum([80, 73, 58, 22, 18, 99, 87, 82, 17]) == [80, 0, 58, 80, 98, 0, 87, 0, 17]", "assert running_sum([93, 50, 97]) == [93, 0, 97]", "assert running_sum([78, 86, 76]) == [78, 0, 76]", "assert running_sum([]) == []"], "test_code": "assert running_sum([11, 72, 22, 15, 73]) == [11, 83, 105, 120, 0]\nassert running_sum([105, 67, 29, 86, 35, 67, 80, 35]) == [105, 0, 29, 115, 0, 67, 0, 35]\nassert running_sum([-8, 106, -2, 9, 118, 23]) == [-8, 98, 96, 105, 0, 23]\nassert running_sum([80, 73, 58, 22, 18, 99, 87, 82, 17]) == [80, 0, 58, 80, 98, 0, 87, 0, 17]\nassert running_sum([93, 50, 97]) == [93, 0, 97]\nassert running_sum([78, 86, 76]) == [78, 0, 76]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 140:\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 > 140:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 140 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([11, 72, 22, 15, 73])` يجب أن تُرجع `[11, 83, 105, 120, 0]`.\nالجواب:", "qhash": "38a3d099474eb6dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'نهر ميناء'\nprint(s[-1])\nprint(s.find('ن'))\nprint(s.count('ن'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'نهر ميناء'\nprint(s[-1])\nprint(s.find('ن'))\nprint(s.count('ن'))\n```\nالجواب:", "qhash": "440e319fe25bd08f", "answer": "ء\n0\n2", "completion": " الناتج:\n```text\nء\n0\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(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_sel([38, 53, 27, 61, 76, 42, 59]) == 1", "assert count_sel([-32, -16, 11, 26, 55, 66, 26, -12, 42, 39, 49]) == 0", "assert count_sel([4, 51, 76, -25, -33, 79, 85, 15]) == 0", "assert count_sel([24, -37, -40, 87, 69]) == 0", "assert count_sel([-18, 26, 57, 76, 4, -11, 64]) == 1", "assert count_sel([49, 5, 88, 59, -32, 75]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([38, 53, 27, 61, 76, 42, 59]) == 1\nassert count_sel([-32, -16, 11, 26, 55, 66, 26, -12, 42, 39, 49]) == 0\nassert count_sel([4, 51, 76, -25, -33, 79, 85, 15]) == 0\nassert count_sel([24, -37, -40, 87, 69]) == 0\nassert count_sel([-18, 26, 57, 76, 4, -11, 64]) == 1\nassert count_sel([49, 5, 88, 59, -32, 75]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(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_sel(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_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_sel([38, 53, 27, 61, 76, 42, 59])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "4b1c2677adef613f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('سلمى', 83), ('رنا', 68), ('زينب', 100), ('خالد', 94)]\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 = [('سلمى', 83), ('رنا', 68), ('زينب', 100), ('خالد', 94)]\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": "f6a37fc3a6a394f3", "answer": "[('رنا', 68), ('سلمى', 83), ('خالد', 94), ('زينب', 100)]\n['زينب', 'خالد']", "completion": " الناتج:\n```text\n[('رنا', 68), ('سلمى', 83), ('خالد', 94), ('زينب', 100)]\n['زينب', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 5 for x in range(3, 11) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 5 for x in range(3, 11) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "b467c21ce25ad85e", "answer": "[4, 20, 44, 76]\n4 144", "completion": " الناتج:\n```text\n[4, 20, 44, 76]\n4 144\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'مدرسة حاسوب'\nprint(kalima.split())\nprint(kalima.find('د'))\nprint('د' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'مدرسة حاسوب'\nprint(kalima.split())\nprint(kalima.find('د'))\nprint('د' in kalima)\n```\nالجواب:", "qhash": "85f85223b55f2101", "answer": "['مدرسة', 'حاسوب']\n1\nTrue", "completion": " الناتج:\n```text\n['مدرسة', 'حاسوب']\n1\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 33", "tests": ["assert digit_power(87450) == 22", "assert digit_power(659587) == 16", "assert digit_power(982182) == 20", "assert digit_power(734151) == 2", "assert digit_power(216958) == 13", "assert digit_power(11569) == 12", "assert digit_power(272715) == 0", "assert digit_power(0) == 0"], "test_code": "assert digit_power(87450) == 22\nassert digit_power(659587) == 16\nassert digit_power(982182) == 20\nassert digit_power(734151) == 2\nassert digit_power(216958) == 13\nassert digit_power(11569) == 12\nassert digit_power(272715) == 0\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 33", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 33.\nللتوضيح: الاستدعاء `digit_power(87450)` يُرجع `22`.\nالجواب:", "qhash": "91cba95ed20b398b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total", "tests": ["assert sum_terms(8) == 52632", "assert sum_terms(5) == 5874", "assert sum_terms(10) == 151998", "assert sum_terms(12) == 364260", "assert sum_terms(3) == 588", "assert sum_terms(1) == 6", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(8) == 52632\nassert sum_terms(5) == 5874\nassert sum_terms(10) == 151998\nassert sum_terms(12) == 364260\nassert sum_terms(3) == 588\nassert sum_terms(1) == 6\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 4\n return total\n```\nمثال: `sum_terms(8)` يجب أن تُرجع `52632`.\nالجواب:", "qhash": "44a292f642ee6dde"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11", "tests": ["assert multi_fact(6) == 7", "assert multi_fact(38) == 0", "assert multi_fact(19) == 4", "assert multi_fact(50) == 0", "assert multi_fact(53) == 0", "assert multi_fact(32) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(6) == 7\nassert multi_fact(38) == 0\nassert multi_fact(19) == 4\nassert multi_fact(50) == 0\nassert multi_fact(53) == 0\nassert multi_fact(32) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(6)` يُرجع `7`.\nالجواب:", "qhash": "66126a7226c14487"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "tests": ["assert series(3) == 252", "assert series(14) == 77175", "assert series(12) == 42588", "assert series(13) == 57967", "assert series(11) == 30492", "assert series(1) == 7", "assert series(0) == 0"], "test_code": "assert series(3) == 252\nassert series(14) == 77175\nassert series(12) == 42588\nassert series(13) == 57967\nassert series(11) == 30492\nassert series(1) == 7\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total\n```\n", "buggy": "def series(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 series(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `series(3)` يُرجع `252`.\nالجواب:", "qhash": "13f7f9d151f655a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('د')", "tests": ["assert tally_letter('شمس فجر قهوة مدينة دفتر قمر جبل جمل') == 2", "assert tally_letter('قهوة سفينة دفتر صديق مكتبة شمس') == 2", "assert tally_letter('وردة ماء تفاحة معلم لغة') == 1", "assert tally_letter('وردة شمس') == 1", "assert tally_letter('حاسوب عمل قمر بحر') == 0", "assert tally_letter('رمل طائرة جمل') == 0", "assert tally_letter('طائرة ليل جمل نهر برمجة') == 0", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('شمس فجر قهوة مدينة دفتر قمر جبل جمل') == 2\nassert tally_letter('قهوة سفينة دفتر صديق مكتبة شمس') == 2\nassert tally_letter('وردة ماء تفاحة معلم لغة') == 1\nassert tally_letter('وردة شمس') == 1\nassert tally_letter('حاسوب عمل قمر بحر') == 0\nassert tally_letter('رمل طائرة جمل') == 0\nassert tally_letter('طائرة ليل جمل نهر برمجة') == 0\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n return text.count('د')", "completion": " ```python\ndef tally_letter(text):\n return text.count('د')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `tally_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «د» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('شمس فجر قهوة مدينة دفتر قمر جبل جمل')` يُرجع `2`.\nالجواب:", "qhash": "5ce8dde9862716ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('وردة حصان مطر طالب نور فجر وردة باب') == 2", "assert count_prefix('برمجة مكتبة سماء حصان قمر') == 0", "assert count_prefix('وردة علم مكتبة طالب') == 1", "assert count_prefix('ليل وردة سلام صديق سوق') == 1", "assert count_prefix('عمل لغة نهار دفتر حاسوب معلم') == 0", "assert count_prefix('وردة نور عمل') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('وردة حصان مطر طالب نور فجر وردة باب') == 2\nassert count_prefix('برمجة مكتبة سماء حصان قمر') == 0\nassert count_prefix('وردة علم مكتبة طالب') == 1\nassert count_prefix('ليل وردة سلام صديق سوق') == 1\nassert count_prefix('عمل لغة نهار دفتر حاسوب معلم') == 0\nassert count_prefix('وردة نور عمل') == 1\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:\n if w.startswith('و'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «و». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_prefix(line):\n count = 0\n for w in line:\n if w.startswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('وردة حصان مطر طالب نور فجر وردة باب')` يُرجع `2`.\nالجواب:", "qhash": "8b60e4982e853a95"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(210636184))\nprint(go(go(210636184)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(210636184))\nprint(go(go(210636184)))\n```\nالجواب:", "qhash": "3b1005c58f380205", "answer": "31\n4", "completion": " الناتج:\n```text\n31\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [38, 25, 2, 29, 40, 40, 1, -2, 29]\nprint(lst[3:5])\nprint(lst[::-2])\nprint(max(lst[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [38, 25, 2, 29, 40, 40, 1, -2, 29]\nprint(lst[3:5])\nprint(lst[::-2])\nprint(max(lst[3:5]))\n```\nالجواب:", "qhash": "b697b250b94ec8e6", "answer": "[29, 40]\n[29, 1, 40, 2, 38]\n40", "completion": " الناتج:\n```text\n[29, 40]\n[29, 1, 40, 2, 38]\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 3:\n return 5\n return 2 * calc(n - 1) + 4\n\nprint(calc(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 3:\n return 5\n return 2 * calc(n - 1) + 4\n\nprint(calc(13))\n```\nالجواب:", "qhash": "37e9efc58dc1df04", "answer": "9212", "completion": " الناتج:\n```text\n9212\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('orange it an') == 'admzsq uf mz'", "assert shift_text('orange cloud music brain winter') == 'admzsq oxagp ygeuo ndmuz iuzfqd'", "assert shift_text('on engine vector rocket 2024') == 'az qzsuzq hqofad daowqf 2024'", "assert shift_text('we Hello') == 'iq Hqxxa'", "assert shift_text('light an camel code cloud') == 'xustf mz omyqx oapq oxagp'", "assert shift_text('orange code apple matrix of') == 'admzsq oapq mbbxq ymfduj ar'", "assert shift_text('') == ''"], "test_code": "assert shift_text('orange it an') == 'admzsq uf mz'\nassert shift_text('orange cloud music brain winter') == 'admzsq oxagp ygeuo ndmuz iuzfqd'\nassert shift_text('on engine vector rocket 2024') == 'az qzsuzq hqofad daowqf 2024'\nassert shift_text('we Hello') == 'iq Hqxxa'\nassert shift_text('light an camel code cloud') == 'xustf mz omyqx oapq oxagp'\nassert shift_text('orange code apple matrix of') == 'admzsq oapq mbbxq ymfduj ar'\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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('orange it an')` يجب أن تُرجع `'admzsq uf mz'`.\nالجواب:", "qhash": "18f6fcc3bc88b2b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-5, 7))", "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(-5, 7))\n```\nالجواب:", "qhash": "45d5f1592b5ae52e", "answer": "-78125", "completion": " الناتج:\n```text\n-78125\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 33) == 1)", "tests": ["assert rel_prime_count(102) == 62", "assert rel_prime_count(34) == 21", "assert rel_prime_count(36) == 22", "assert rel_prime_count(36) == 22", "assert rel_prime_count(22) == 13", "assert rel_prime_count(73) == 45", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(102) == 62\nassert rel_prime_count(34) == 21\nassert rel_prime_count(36) == 22\nassert rel_prime_count(36) == 22\nassert rel_prime_count(22) == 13\nassert rel_prime_count(73) == 45\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 33، أي أن القاسم المشترك الأكبر لها مع 33 يساوي 1.\nمثال: `rel_prime_count(102)` يجب أن تُرجع `62`.\nالجواب:", "qhash": "490e9ab8ae647781"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'falcon'\nprint(name.upper())\nprint(name.split('_'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'falcon'\nprint(name.upper())\nprint(name.split('_'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "008475b1cc8a591a", "answer": "FALCON\n['falcon']\nnoclaf", "completion": " الناتج:\n```text\nFALCON\n['falcon']\nnoclaf\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'il'}", "tests": ["assert count_chars('pixel') == {'i': 1, 'l': 1}", "assert count_chars('on music pixel') == {'i': 2, 'l': 1}", "assert count_chars('pixel is banana rocket') == {'i': 2, 'l': 1}", "assert count_chars('apple pixel an') == {'i': 1, 'l': 2}", "assert count_chars('we go river falcon') == {'i': 1, 'l': 1}", "assert count_chars('banana') == {'i': 0, 'l': 0}", "assert count_chars('') == {'i': 0, 'l': 0}"], "test_code": "assert count_chars('pixel') == {'i': 1, 'l': 1}\nassert count_chars('on music pixel') == {'i': 2, 'l': 1}\nassert count_chars('pixel is banana rocket') == {'i': 2, 'l': 1}\nassert count_chars('apple pixel an') == {'i': 1, 'l': 2}\nassert count_chars('we go river falcon') == {'i': 1, 'l': 1}\nassert count_chars('banana') == {'i': 0, 'l': 0}\nassert count_chars('') == {'i': 0, 'l': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'il'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'il'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'i'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('pixel')` يُرجع `{'i': 1, 'l': 1}`.\nالجواب:", "qhash": "530e4c4ea1ebb63c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 10\nfor n in range(7, 16, 3):\n s += n * 8\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 10\nfor n in range(7, 16, 3):\n s += n * 8\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "1ff927564e25a962", "answer": "250\n13", "completion": " الناتج:\n```text\n250\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 79", "tests": ["assert prod_mod(7) == 63", "assert prod_mod(17) == 24", "assert prod_mod(23) == 78", "assert prod_mod(11) == 75", "assert prod_mod(16) == 20", "assert prod_mod(59) == 69", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(7) == 63\nassert prod_mod(17) == 24\nassert prod_mod(23) == 78\nassert prod_mod(11) == 75\nassert prod_mod(16) == 20\nassert prod_mod(59) == 69\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 79", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(7)` يجب أن تُرجع `63`.\nالجواب:", "qhash": "7c338b698b9331fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('م'))", "tests": ["assert letter_count('حصان صحراء شمس') == 0", "assert letter_count('باب جبل خبز شمس دفتر') == 0", "assert letter_count('عمل طائرة سوق') == 0", "assert letter_count('نهر') == 0", "assert letter_count('برتقال جمل تفاحة ميناء شمس سفينة حصان سلام') == 1", "assert letter_count('ماء صديق مدرسة') == 2", "assert letter_count('كتاب رمل بيت برتقال باب سوق') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('حصان صحراء شمس') == 0\nassert letter_count('باب جبل خبز شمس دفتر') == 0\nassert letter_count('عمل طائرة سوق') == 0\nassert letter_count('نهر') == 0\nassert letter_count('برتقال جمل تفاحة ميناء شمس سفينة حصان سلام') == 1\nassert letter_count('ماء صديق مدرسة') == 2\nassert letter_count('كتاب رمل بيت برتقال باب سوق') == 0\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('م'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('م'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «م».\nمثال: `letter_count('حصان صحراء شمس')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "40685e21cf8b9e6b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('مدينة سوق سفينة نهر') == 2", "assert count_initial('جبل تفاحة جبل سماء تفاحة سوق') == 2", "assert count_initial('طائرة تفاحة نهر جمل مكتبة') == 0", "assert count_initial('ميناء جمل قهوة وردة كتاب') == 0", "assert count_initial('تفاحة سفينة سيارة مدينة جمل') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('وردة ليل') == 0\nassert count_initial('مدينة سوق سفينة نهر') == 2\nassert count_initial('جبل تفاحة جبل سماء تفاحة سوق') == 2\nassert count_initial('طائرة تفاحة نهر جمل مكتبة') == 0\nassert count_initial('ميناء جمل قهوة وردة كتاب') == 0\nassert count_initial('تفاحة سفينة سيارة مدينة جمل') == 2\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": "7405e8cf081afbc8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(3))\nprint(compute(3, 5))\nprint(compute(compute(5), 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(3))\nprint(compute(3, 5))\nprint(compute(compute(5), 3))\n```\nالجواب:", "qhash": "6e44c8ba6fabfe79", "answer": "-29\n-17\n-39", "completion": " الناتج:\n```text\n-29\n-17\n-39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(10))\n```\nالجواب:", "qhash": "aa55129634b714a4", "answer": "233", "completion": " الناتج:\n```text\n233\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([4, 29, 42, 21, -6, 6, 38]) == 42", "assert max_multiple([-10, -10, -6]) == -6", "assert max_multiple([1, 3, 5, 7]) == None", "assert max_multiple([-31]) == None", "assert max_multiple([-39, -8, 23, -26, 31]) == -8", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([4, 29, 42, 21, -6, 6, 38]) == 42\nassert max_multiple([-10, -10, -6]) == -6\nassert max_multiple([1, 3, 5, 7]) == None\nassert max_multiple([-31]) == None\nassert max_multiple([-39, -8, 23, -26, 31]) == -8\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 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 % 2 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_multiple(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_multiple([4, 29, 42, 21, -6, 6, 38])` يُرجع `42`.\nالجواب:", "qhash": "c2d08036bfc1f975"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if 6 <= x <= 30)", "tests": ["assert between_times([30, 23, 31, 3, -2]) == [-150, -115]", "assert between_times([37, 53, -18, -13, 46, -17, -18]) == []", "assert between_times([-8, 23]) == [-115]", "assert between_times([2, -7, -20, 53, 53]) == []", "assert between_times([58]) == []", "assert between_times([1, 35, 28, 30, 34, -2, 50, 10, 46, -11]) == [-150, -140, -50]", "assert between_times([24, 44, -29, 54, 59]) == [-120]", "assert between_times([]) == []"], "test_code": "assert between_times([30, 23, 31, 3, -2]) == [-150, -115]\nassert between_times([37, 53, -18, -13, 46, -17, -18]) == []\nassert between_times([-8, 23]) == [-115]\nassert between_times([2, -7, -20, 53, 53]) == []\nassert between_times([58]) == []\nassert between_times([1, 35, 28, 30, 34, -2, 50, 10, 46, -11]) == [-150, -140, -50]\nassert between_times([24, 44, -29, 54, 59]) == [-120]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if 6 <= x <= 30)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if 6 <= x <= 30)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 6 ≤ x ≤ 30، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([30, 23, 31, 3, -2])` يُرجع `[-150, -115]`.\nالجواب:", "qhash": "e251df52ce595dc8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 68", "tests": ["assert digit_power(55970) == 30", "assert digit_power(374473) == 52", "assert digit_power(238970) == 55", "assert digit_power(104152) == 63", "assert digit_power(962990) == 31", "assert digit_power(415873) == 52", "assert digit_power(776351) == 35", "assert digit_power(0) == 0"], "test_code": "assert digit_power(55970) == 30\nassert digit_power(374473) == 52\nassert digit_power(238970) == 55\nassert digit_power(104152) == 63\nassert digit_power(962990) == 31\nassert digit_power(415873) == 52\nassert digit_power(776351) == 35\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 68", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 68\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 68.\nمثال: `digit_power(55970)` يجب أن تُرجع `30`.\nالجواب:", "qhash": "24e2c6b84f2d1d09"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 8) == 1)", "tests": ["assert count_coprime(23) == 12", "assert count_coprime(192) == 96", "assert count_coprime(187) == 94", "assert count_coprime(50) == 25", "assert count_coprime(57) == 29", "assert count_coprime(153) == 77", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(23) == 12\nassert count_coprime(192) == 96\nassert count_coprime(187) == 94\nassert count_coprime(50) == 25\nassert count_coprime(57) == 29\nassert count_coprime(153) == 77\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, 8) == 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, 8) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 8) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(23)` يُرجع `12`.\nالجواب:", "qhash": "adadfee3571a13f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ت'):\n count += 1\n return count", "tests": ["assert count_initial('سوق طائرة حديقة نهر باب') == 0", "assert count_initial('مكتبة تفاحة ماء تفاحة مدرسة') == 2", "assert count_initial('نهار حصان برتقال دفتر') == 0", "assert count_initial('وردة قهوة') == 0", "assert count_initial('طالب مدرسة تفاحة شمس نهر') == 1", "assert count_initial('صديق تفاحة حاسوب عربية') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('سوق طائرة حديقة نهر باب') == 0\nassert count_initial('مكتبة تفاحة ماء تفاحة مدرسة') == 2\nassert count_initial('نهار حصان برتقال دفتر') == 0\nassert count_initial('وردة قهوة') == 0\nassert count_initial('طالب مدرسة تفاحة شمس نهر') == 1\nassert count_initial('صديق تفاحة حاسوب عربية') == 1\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ت'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text:\n if w.startswith('ت'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('سوق طائرة حديقة نهر باب')` يُرجع `0`.\nالجواب:", "qhash": "1e5cb7690fabc9dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "tests": ["assert mult_sum(218) == 7884", "assert mult_sum(183) == 5490", "assert mult_sum(39) == 234", "assert mult_sum(275) == 12558", "assert mult_sum(24) == 84", "assert mult_sum(238) == 9480", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(218) == 7884\nassert mult_sum(183) == 5490\nassert mult_sum(39) == 234\nassert mult_sum(275) == 12558\nassert mult_sum(24) == 84\nassert mult_sum(238) == 9480\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 6، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(218)` يُرجع `7884`.\nالجواب:", "qhash": "f466aef1aecfa8e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([22, 0, 48, 10]) == [0, 48, 10, 22]", "assert spin([43, 7, -2, 37, 29, 38, 11]) == [7, -2, 37, 29, 38, 11, 43]", "assert spin([49, 1, 25, 21, 33]) == [1, 25, 21, 33, 49]", "assert spin([35, 24, 44, 39, 35, 10, 21, 35]) == [24, 44, 39, 35, 10, 21, 35, 35]", "assert spin([12, -2, -3, -7, 20, 16, 21, 16, 23, 10]) == [-2, -3, -7, 20, 16, 21, 16, 23, 10, 12]", "assert spin([18, 23, -5]) == [23, -5, 18]", "assert spin([]) == []"], "test_code": "assert spin([22, 0, 48, 10]) == [0, 48, 10, 22]\nassert spin([43, 7, -2, 37, 29, 38, 11]) == [7, -2, 37, 29, 38, 11, 43]\nassert spin([49, 1, 25, 21, 33]) == [1, 25, 21, 33, 49]\nassert spin([35, 24, 44, 39, 35, 10, 21, 35]) == [24, 44, 39, 35, 10, 21, 35, 35]\nassert spin([12, -2, -3, -7, 20, 16, 21, 16, 23, 10]) == [-2, -3, -7, 20, 16, 21, 16, 23, 10, 12]\nassert spin([18, 23, -5]) == [23, -5, 18]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([22, 0, 48, 10])` يُرجع `[0, 48, 10, 22]`.\nالجواب:", "qhash": "6691f58832c9e7b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('دفتر ميناء برتقال شجرة علم') == 0", "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('دفتر ميناء برتقال شجرة علم') == 0\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:\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": "1d5e7f0405026d5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([91, 63, 28, 54, 91, 46, 35, 6, 45, 72]) == [91, 154, 0, 54, 145, 0, 35, 41, 86, 158]", "assert acc_reset([95, 143, -1, 134, 61]) == [95, 0, -1, 133, 0]", "assert acc_reset([129, 30, 20, 126, 62]) == [129, 159, 0, 126, 0]", "assert acc_reset([150, -3, 102, 84, 68, 57, 106, 67, 89]) == [150, 147, 0, 84, 152, 0, 106, 173, 0]", "assert acc_reset([34, 143, 155, 5, 153, 103, 70, 173, 83]) == [34, 0, 155, 160, 0, 103, 173, 0, 83]", "assert acc_reset([156, 146, 80, 8, 34]) == [156, 0, 80, 88, 122]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([91, 63, 28, 54, 91, 46, 35, 6, 45, 72]) == [91, 154, 0, 54, 145, 0, 35, 41, 86, 158]\nassert acc_reset([95, 143, -1, 134, 61]) == [95, 0, -1, 133, 0]\nassert acc_reset([129, 30, 20, 126, 62]) == [129, 159, 0, 126, 0]\nassert acc_reset([150, -3, 102, 84, 68, 57, 106, 67, 89]) == [150, 147, 0, 84, 152, 0, 106, 173, 0]\nassert acc_reset([34, 143, 155, 5, 153, 103, 70, 173, 83]) == [34, 0, 155, 160, 0, 103, 173, 0, 83]\nassert acc_reset([156, 146, 80, 8, 34]) == [156, 0, 80, 88, 122]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\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 > 174:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 174 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([91, 63, 28, 54, 91, 46, 35, 6, 45, 72])` يجب أن تُرجع `[91, 154, 0, 54, 145, 0, 35, 41, 86, 158]`.\nالجواب:", "qhash": "3266b63ba193d02f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'سعيد': 39, 'سلمى': 2, 'فيصل': 16, 'باسل': 1, 'رنا': 37}\npoints['باسل'] += 5\npoints['حسن'] = 20\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'سعيد': 39, 'سلمى': 2, 'فيصل': 16, 'باسل': 1, 'رنا': 37}\npoints['باسل'] += 5\npoints['حسن'] = 20\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))\n```\nالجواب:", "qhash": "a7526e7fc1df3678", "answer": "6\nسعيد\n120\n20", "completion": " الناتج:\n```text\n6\nسعيد\n120\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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_div([23, 16, -3, -4, 24, -30]) == 24", "assert max_div([-20, -12, -12]) == -12", "assert max_div([1, 5, 9, 13]) == None", "assert max_div([25, -9, -2, -3, 16, -30, 10, 1, 19]) == 16", "assert max_div([-29, 24, 20, -49, 3, 44]) == 44", "assert max_div([]) == None"], "test_code": "assert max_div([23, 16, -3, -4, 24, -30]) == 24\nassert max_div([-20, -12, -12]) == -12\nassert max_div([1, 5, 9, 13]) == None\nassert max_div([25, -9, -2, -3, 16, -30, 10, 1, 19]) == 16\nassert max_div([-29, 24, 20, -49, 3, 44]) == 44\nassert max_div([]) == None", "answer": "def max_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_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_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_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للتوضيح: الاستدعاء `max_div([23, 16, -3, -4, 24, -30])` يُرجع `24`.\nالجواب:", "qhash": "22ab95596720a242"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(258) == 6058", "assert sum_multiples(68) == 372", "assert sum_multiples(232) == 4592", "assert sum_multiples(241) == 5302", "assert sum_multiples(31) == 90", "assert sum_multiples(275) == 6860", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(258) == 6058\nassert sum_multiples(68) == 372\nassert sum_multiples(232) == 4592\nassert sum_multiples(241) == 5302\nassert sum_multiples(31) == 90\nassert sum_multiples(275) == 6860\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(258)` يُرجع `6058`.\nالجواب:", "qhash": "986de3529615c60e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert sum_multiples(123) == 1509", "assert sum_multiples(137) == 1900", "assert sum_multiples(15) == 19", "assert sum_multiples(228) == 5185", "assert sum_multiples(104) == 1054", "assert sum_multiples(99) == 855", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(123) == 1509\nassert sum_multiples(137) == 1900\nassert sum_multiples(15) == 19\nassert sum_multiples(228) == 5185\nassert sum_multiples(104) == 1054\nassert sum_multiples(99) == 855\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 % 10 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(123)` يُرجع `1509`.\nالجواب:", "qhash": "abb0140cde350bb0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 27", "tests": ["assert sum_digit_pow(97989) == 17", "assert sum_digit_pow(444149) == 26", "assert sum_digit_pow(298185) == 5", "assert sum_digit_pow(58966) == 23", "assert sum_digit_pow(141026) == 4", "assert sum_digit_pow(513214) == 8", "assert sum_digit_pow(871200) == 7", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(97989) == 17\nassert sum_digit_pow(444149) == 26\nassert sum_digit_pow(298185) == 5\nassert sum_digit_pow(58966) == 23\nassert sum_digit_pow(141026) == 4\nassert sum_digit_pow(513214) == 8\nassert sum_digit_pow(871200) == 7\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 27", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 27\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 27.\nللتوضيح: الاستدعاء `sum_digit_pow(97989)` يُرجع `17`.\nالجواب:", "qhash": "b3d8b064130a9a11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [0, 28, 27, 2, 2, -4, 39, 20, 9]\nprint(data[0:4])\nprint(data[::-1])\nprint(sum(data[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [0, 28, 27, 2, 2, -4, 39, 20, 9]\nprint(data[0:4])\nprint(data[::-1])\nprint(sum(data[0:4]))\n```\nالجواب:", "qhash": "f8478eabfa30dc99", "answer": "[0, 28, 27, 2]\n[9, 20, 39, -4, 2, 2, 27, 28, 0]\n57", "completion": " الناتج:\n```text\n[0, 28, 27, 2]\n[9, 20, 39, -4, 2, 2, 27, 28, 0]\n57\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73", "tests": ["assert rec_prod(12) == 19", "assert rec_prod(11) == 12", "assert rec_prod(28) == 23", "assert rec_prod(14) == 1", "assert rec_prod(55) == 38", "assert rec_prod(22) == 31", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 19\nassert rec_prod(11) == 12\nassert rec_prod(28) == 23\nassert rec_prod(14) == 1\nassert rec_prod(55) == 38\nassert rec_prod(22) == 31\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(12)` يُرجع `19`.\nالجواب:", "qhash": "c2ca3c150814321e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'pixel_data'\nprint(s.capitalize())\nprint(s.find('a'))\nprint(s[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'pixel_data'\nprint(s.capitalize())\nprint(s.find('a'))\nprint(s[-1:])\n```\nالجواب:", "qhash": "a951889cc5a05026", "answer": "Pixel_data\n7\na", "completion": " الناتج:\n```text\nPixel_data\n7\na\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حديقة سلام حصان علم برمجة') == 0", "assert prefix_hits('صديق صحراء ميناء بحر عربية') == 2", "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('حديقة سلام حصان علم برمجة') == 0\nassert prefix_hits('صديق صحراء ميناء بحر عربية') == 2\nassert prefix_hits('ماء مدرسة') == 0\nassert prefix_hits('سفينة صديق صديق مدرسة') == 2\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 'ص' in w:\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 'ص' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('حديقة سلام حصان علم برمجة')` يُرجع `0`.\nالجواب:", "qhash": "d8f5e39091700f02"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 10\nfor x in range(10, 28, 2):\n acc += x * 2\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 10\nfor x in range(10, 28, 2):\n acc += x * 2\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "809a1725d072490c", "answer": "334\n26", "completion": " الناتج:\n```text\n334\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert div_not([60, 68, 11, 75, 14, 83, 57, 7, 51, 4]) == 0", "assert div_not([38, -8, 58, 62, 72, -35, -11, -15, 74, 41, 70, -20]) == 0", "assert div_not([52, -12, -29, 90, -38, 74]) == 0", "assert div_not([55, 48, 50, 44, 45, 21]) == 1", "assert div_not([46, -19, -2]) == 0", "assert div_not([26, 7, -22, -21, -7, -10, -11, 28, 40, 45, -18, -35]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([60, 68, 11, 75, 14, 83, 57, 7, 51, 4]) == 0\nassert div_not([38, -8, 58, 62, 72, -35, -11, -15, 74, 41, 70, -20]) == 0\nassert div_not([52, -12, -29, 90, -38, 74]) == 0\nassert div_not([55, 48, 50, 44, 45, 21]) == 1\nassert div_not([46, -19, -2]) == 0\nassert div_not([26, 7, -22, -21, -7, -10, -11, 28, 40, 45, -18, -35]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count", "completion": " ```python\ndef div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([60, 68, 11, 75, 14, 83, 57, 7, 51, 4])` يُرجع `0`.\nالجواب:", "qhash": "3e0e2ff1d749f222"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'mo'}", "tests": ["assert letter_stats('rocket') == {'m': 0, 'o': 1}", "assert letter_stats('pixel signal window up') == {'m': 0, 'o': 1}", "assert letter_stats('cloud by winter rocket go it') == {'m': 0, 'o': 3}", "assert letter_stats('apple is stone river') == {'m': 0, 'o': 1}", "assert letter_stats('of pixel falcon a orange') == {'m': 0, 'o': 3}", "assert letter_stats('stone') == {'m': 0, 'o': 1}", "assert letter_stats('') == {'m': 0, 'o': 0}"], "test_code": "assert letter_stats('rocket') == {'m': 0, 'o': 1}\nassert letter_stats('pixel signal window up') == {'m': 0, 'o': 1}\nassert letter_stats('cloud by winter rocket go it') == {'m': 0, 'o': 3}\nassert letter_stats('apple is stone river') == {'m': 0, 'o': 1}\nassert letter_stats('of pixel falcon a orange') == {'m': 0, 'o': 3}\nassert letter_stats('stone') == {'m': 0, 'o': 1}\nassert letter_stats('') == {'m': 0, 'o': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'mo'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'mo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'm'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('rocket')` يُرجع `{'m': 0, 'o': 1}`.\nالجواب:", "qhash": "7226c1cf5ee4fee0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('vector pixel OK') == 'bkizux vodkr OK'", "assert decode('winter window to cloud') == 'cotzkx cotjuc zu iruaj'", "assert decode('planet planet banana music') == 'vrgtkz vrgtkz hgtgtg sayoi'", "assert decode('planet engine on vector data') == 'vrgtkz ktmotk ut bkizux jgzg'", "assert decode('vector') == 'bkizux'", "assert decode('code') == 'iujk'", "assert decode('') == ''"], "test_code": "assert decode('vector pixel OK') == 'bkizux vodkr OK'\nassert decode('winter window to cloud') == 'cotzkx cotjuc zu iruaj'\nassert decode('planet planet banana music') == 'vrgtkz vrgtkz hgtgtg sayoi'\nassert decode('planet engine on vector data') == 'vrgtkz ktmotk ut bkizux jgzg'\nassert decode('vector') == 'bkizux'\nassert decode('code') == 'iujk'\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 + (-20)) % 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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('vector pixel OK')` يُرجع `'bkizux vodkr OK'`.\nالجواب:", "qhash": "a01a3262f9018b60"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "tests": ["assert series(3) == 2208", "assert series(5) == 35400", "assert series(0) == 0", "assert series(15) == 18393600", "assert series(2) == 264", "assert series(1) == 8", "assert series(0) == 0"], "test_code": "assert series(3) == 2208\nassert series(5) == 35400\nassert series(0) == 0\nassert series(15) == 18393600\nassert series(2) == 264\nassert series(1) == 8\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `series(3)` يُرجع `2208`.\nالجواب:", "qhash": "d0f27e6abc137da4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 24691\nsteps = 0\nwhile n > 1:\n n = n // 4\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 24691\nsteps = 0\nwhile n > 1:\n n = n // 4\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "2d0596302ae44c3e", "answer": "1 7", "completion": " الناتج:\n```text\n1 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(9))\nprint(calc(9, 19))\nprint(calc(calc(19), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=4):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(9))\nprint(calc(9, 19))\nprint(calc(calc(19), 9))\n```\nالجواب:", "qhash": "158042dcaff7d302", "answer": "-49\n-86\n-144", "completion": " الناتج:\n```text\n-49\n-86\n-144\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('بيت بحر قلم') == 0", "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('بيت بحر قلم') == 0\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ش» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('مكتبة مكتبة وردة نهار ميناء بحر طائرة سفينة')` يُرجع `0`.\nالجواب:", "qhash": "e52b30301e2882bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('أحمد', 91), ('علي', 4), ('زينب', 6), ('سلمى', 48)]\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 = [('أحمد', 91), ('علي', 4), ('زينب', 6), ('سلمى', 48)]\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": "4975121edfbfa7be", "answer": "[('علي', 4), ('زينب', 6), ('سلمى', 48), ('أحمد', 91)]\n['أحمد', 'سلمى']", "completion": " الناتج:\n```text\n[('علي', 4), ('زينب', 6), ('سلمى', 48), ('أحمد', 91)]\n['أحمد', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 2 for x in range(0, 14) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 2 for x in range(0, 14) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "5082cfb2d508224b", "answer": "[7, 47, 119]\n3 173", "completion": " الناتج:\n```text\n[7, 47, 119]\n3 173\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(compute(8))\nprint(compute(8, -8))\nprint(compute(compute(-8), 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(compute(8))\nprint(compute(8, -8))\nprint(compute(compute(-8), 8))\n```\nالجواب:", "qhash": "9ee1fdaf53a9e1f2", "answer": "46\n56\n52", "completion": " الناتج:\n```text\n46\n56\n52\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'gl'}", "tests": ["assert letter_stats('signal signal up data at') == {'g': 2, 'l': 2}", "assert letter_stats('to river it cloud window it') == {'g': 0, 'l': 1}", "assert letter_stats('brain signal vector we light') == {'g': 2, 'l': 2}", "assert letter_stats('orange vector music camel desert engine') == {'g': 2, 'l': 1}", "assert letter_stats('python at is') == {'g': 0, 'l': 0}", "assert letter_stats('a cloud engine brain is an') == {'g': 1, 'l': 1}", "assert letter_stats('') == {'g': 0, 'l': 0}"], "test_code": "assert letter_stats('signal signal up data at') == {'g': 2, 'l': 2}\nassert letter_stats('to river it cloud window it') == {'g': 0, 'l': 1}\nassert letter_stats('brain signal vector we light') == {'g': 2, 'l': 2}\nassert letter_stats('orange vector music camel desert engine') == {'g': 2, 'l': 1}\nassert letter_stats('python at is') == {'g': 0, 'l': 0}\nassert letter_stats('a cloud engine brain is an') == {'g': 1, 'l': 1}\nassert letter_stats('') == {'g': 0, 'l': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'gl'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'gl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'l' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('signal signal up data at')` يجب أن تُرجع `{'g': 2, 'l': 2}`.\nالجواب:", "qhash": "9d30e777c5dbbeea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ه')", "tests": ["assert count_hits('خبز نهر قهوة تفاحة ميناء معلم') == 2", "assert count_hits('صحراء') == 0", "assert count_hits('طائرة ليل نهر سماء ليل مكتبة') == 1", "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('خبز نهر قهوة تفاحة ميناء معلم') == 2\nassert count_hits('صحراء') == 0\nassert count_hits('طائرة ليل نهر سماء ليل مكتبة') == 1\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('خبز نهر قهوة تفاحة ميناء معلم')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "20be1e1fb5d22dad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert div_not([89, 3, 25, 38, 30, 12, 25, 36, 88, 20, 7]) == 1", "assert div_not([81]) == 1", "assert div_not([68, 90, -20, 71, 6]) == 0", "assert div_not([24, -19, 0, 87, -24, 65, 58, -35, 10, -8, 41]) == 0", "assert div_not([68, 15, 51, 53, 59, 4, 7, 58, -24, 90, 8]) == 0", "assert div_not([52, 30, 73, -27, 11, -20]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([89, 3, 25, 38, 30, 12, 25, 36, 88, 20, 7]) == 1\nassert div_not([81]) == 1\nassert div_not([68, 90, -20, 71, 6]) == 0\nassert div_not([24, -19, 0, 87, -24, 65, 58, -35, 10, -8, 41]) == 0\nassert div_not([68, 15, 51, 53, 59, 4, 7, 58, -24, 90, 8]) == 0\nassert div_not([52, 30, 73, -27, 11, -20]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 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 % 9 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([89, 3, 25, 38, 30, 12, 25, 36, 88, 20, 7])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "cb1bef6db10b2005"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return sum(1 for w in text.split() if 'ي' in w)", "tests": ["assert count_letter('سفينة سيارة طائرة قمر خبز') == 2", "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"], "test_code": "assert count_letter('سفينة سيارة طائرة قمر خبز') == 2\nassert 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", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ي» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('سفينة سيارة طائرة قمر خبز')` يُرجع `2`.\nالجواب:", "qhash": "2d8b5c3c60e4f6fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 139:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([17, 49, 1, 10, 21, 48, 8, 18]) == [17, 66, 67, 77, 98, 0, 8, 26]", "assert reset_sum([53, 83, 127, 60, 73, 63, -7, 113]) == [53, 136, 0, 60, 133, 0, -7, 106]", "assert reset_sum([]) == []", "assert reset_sum([121, 137, 71, 23, 44, 23, 135, 99, 133, 50]) == [121, 0, 71, 94, 138, 0, 135, 0, 133, 0]", "assert reset_sum([17, 139]) == [17, 0]", "assert reset_sum([85, 51, 134, 123, 89, 135]) == [85, 136, 0, 123, 0, 135]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([17, 49, 1, 10, 21, 48, 8, 18]) == [17, 66, 67, 77, 98, 0, 8, 26]\nassert reset_sum([53, 83, 127, 60, 73, 63, -7, 113]) == [53, 136, 0, 60, 133, 0, -7, 106]\nassert reset_sum([]) == []\nassert reset_sum([121, 137, 71, 23, 44, 23, 135, 99, 133, 50]) == [121, 0, 71, 94, 138, 0, 135, 0, 133, 0]\nassert reset_sum([17, 139]) == [17, 0]\nassert reset_sum([85, 51, 134, 123, 89, 135]) == [85, 136, 0, 123, 0, 135]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 139:\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 > 139:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 139 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([17, 49, 1, 10, 21, 48, 8, 18])` يجب أن تُرجع `[17, 66, 67, 77, 98, 0, 8, 26]`.\nالجواب:", "qhash": "9ddc1734221c2577"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 6 * x ** 2 + (6) * x + (1)", "tests": ["assert quad(2) == 37", "assert quad(1) == 13", "assert quad(17) == 1837", "assert quad(18) == 2053", "assert quad(-19) == 2053", "assert quad(2) == 37", "assert quad(20) == 2521", "assert quad(0) == 1"], "test_code": "assert quad(2) == 37\nassert quad(1) == 13\nassert quad(17) == 1837\nassert quad(18) == 2053\nassert quad(-19) == 2053\nassert quad(2) == 37\nassert quad(20) == 2521\nassert quad(0) == 1", "answer": "def quad(x):\n return 6 * x ** 2 + (6) * x + (1)", "completion": " ```python\ndef quad(x):\n return 6 * x ** 2 + (6) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 6x² + 6x + 1 عند العدد الصحيح x.\nمثال: `quad(2)` يجب أن تُرجع `37`.\nالجواب:", "qhash": "98d585bcf9078bb1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "tests": ["assert mult_sum(87) == 1050", "assert mult_sum(80) == 886", "assert mult_sum(91) == 1138", "assert mult_sum(11) == 12", "assert mult_sum(36) == 158", "assert mult_sum(120) == 1964", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(87) == 1050\nassert mult_sum(80) == 886\nassert mult_sum(91) == 1138\nassert mult_sum(11) == 12\nassert mult_sum(36) == 158\nassert mult_sum(120) == 1964\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 14.\nمثال: `mult_sum(87)` يجب أن تُرجع `1050`.\nالجواب:", "qhash": "3f4af03784077260"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(21) == 36", "assert mult_sum(290) == 8562", "assert mult_sum(214) == 4515", "assert mult_sum(92) == 952", "assert mult_sum(284) == 7990", "assert mult_sum(148) == 2187", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(21) == 36\nassert mult_sum(290) == 8562\nassert mult_sum(214) == 4515\nassert mult_sum(92) == 952\nassert mult_sum(284) == 7990\nassert mult_sum(148) == 2187\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(21)` يُرجع `36`.\nالجواب:", "qhash": "6fc426a6b180c1ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([81, 40, 80, 69, 90, 56, 31, 12, 74, 20, 80, 55]) == 2", "assert count_special([-25, 81, -32, 62, -35, 80, -22, 70, 1]) == 3", "assert count_special([-3]) == 0", "assert count_special([76, -24, 64, -27, 35, 53, -31, -28, 69, 44]) == 0", "assert count_special([-3, 0, 88, 78, 17, 7, -7, 80, 22, 48]) == 2", "assert count_special([81, 89, -32, 1, 23]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([81, 40, 80, 69, 90, 56, 31, 12, 74, 20, 80, 55]) == 2\nassert count_special([-25, 81, -32, 62, -35, 80, -22, 70, 1]) == 3\nassert count_special([-3]) == 0\nassert count_special([76, -24, 64, -27, 35, 53, -31, -28, 69, 44]) == 0\nassert count_special([-3, 0, 88, 78, 17, 7, -7, 80, 22, 48]) == 2\nassert count_special([81, 89, -32, 1, 23]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([81, 40, 80, 69, 90, 56, 31, 12, 74, 20, 80, 55])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "81ec40d6b3616744"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 129:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([4, 1, 42, 1, 1, 39, 25, 16, 5, 62]) == [4, 5, 47, 48, 49, 88, 113, 129, 0, 62]", "assert acc_reset([68, 52, 27, 5, 108]) == [68, 120, 0, 5, 113]", "assert acc_reset([126]) == [126]", "assert acc_reset([]) == []", "assert acc_reset([31, 35, 101]) == [31, 66, 0]", "assert acc_reset([-1, 68, 57, 91, 57, 9, 19, 93, 9, 87]) == [-1, 67, 124, 0, 57, 66, 85, 0, 9, 96]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([4, 1, 42, 1, 1, 39, 25, 16, 5, 62]) == [4, 5, 47, 48, 49, 88, 113, 129, 0, 62]\nassert acc_reset([68, 52, 27, 5, 108]) == [68, 120, 0, 5, 113]\nassert acc_reset([126]) == [126]\nassert acc_reset([]) == []\nassert acc_reset([31, 35, 101]) == [31, 66, 0]\nassert acc_reset([-1, 68, 57, 91, 57, 9, 19, 93, 9, 87]) == [-1, 67, 124, 0, 57, 66, 85, 0, 9, 96]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 129:\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 > 129:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 129 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([4, 1, 42, 1, 1, 39, 25, 16, 5, 62])` يجب أن تُرجع `[4, 5, 47, 48, 49, 88, 113, 129, 0, 62]`.\nالجواب:", "qhash": "52db64805ef1f4db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('جبل نهار عربية عربية عربية') == 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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ن»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('لغة قلم شجرة مدينة وردة برمجة مطر')` يُرجع `0`.\nالجواب:", "qhash": "f32491e8480e166c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(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 tally_div([54, 83, 18, 46, 73, 14, 14, 61, 10, 42]) == 0", "assert tally_div([57]) == 0", "assert tally_div([-12, 19, 83, 67, 21, -24]) == 2", "assert tally_div([]) == 0", "assert tally_div([-31, -37, 33, -38, -7, 78, 72]) == 1", "assert tally_div([-14, 63, -27, 68, 84, 46, 14]) == 2", "assert tally_div([]) == 0"], "test_code": "assert tally_div([54, 83, 18, 46, 73, 14, 14, 61, 10, 42]) == 0\nassert tally_div([57]) == 0\nassert tally_div([-12, 19, 83, 67, 21, -24]) == 2\nassert tally_div([]) == 0\nassert tally_div([-31, -37, 33, -38, -7, 78, 72]) == 1\nassert tally_div([-14, 63, -27, 68, 84, 46, 14]) == 2\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `tally_div([54, 83, 18, 46, 73, 14, 14, 61, 10, 42])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "482486ac77cfa37f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "tests": ["assert fact_mod(12) == 17", "assert fact_mod(16) == 12", "assert fact_mod(15) == 34", "assert fact_mod(50) == 42", "assert fact_mod(44) == 20", "assert fact_mod(40) == 58", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(12) == 17\nassert fact_mod(16) == 12\nassert fact_mod(15) == 34\nassert fact_mod(50) == 42\nassert fact_mod(44) == 20\nassert fact_mod(40) == 58\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(12)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "46eb1fc46344f1bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('to !') == 'oj !'", "assert cipher('code vector code table planet') == 'xjyz qzxojm xjyz ovwgz kgvizo'", "assert cipher('matrix planet at') == 'hvomds kgvizo vo'", "assert cipher('in go OK') == 'di bj OK'", "assert cipher('falcon winter of winter in') == 'avgxji rdiozm ja rdiozm di'", "assert cipher('data garden !') == 'yvov bvmyzi !'", "assert cipher('') == ''"], "test_code": "assert cipher('to !') == 'oj !'\nassert cipher('code vector code table planet') == 'xjyz qzxojm xjyz ovwgz kgvizo'\nassert cipher('matrix planet at') == 'hvomds kgvizo vo'\nassert cipher('in go OK') == 'di bj OK'\nassert cipher('falcon winter of winter in') == 'avgxji rdiozm ja rdiozm di'\nassert cipher('data garden !') == 'yvov bvmyzi !'\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 + (21)) % 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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('to !')` يُرجع `'oj !'`.\nالجواب:", "qhash": "63a7097e3fdc5937"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "tests": ["assert power_sum(6) == 3087", "assert power_sum(12) == 42588", "assert power_sum(15) == 100800", "assert power_sum(9) == 14175", "assert power_sum(5) == 1575", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 3087\nassert power_sum(12) == 42588\nassert power_sum(15) == 100800\nassert power_sum(9) == 14175\nassert power_sum(5) == 1575\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 ** 3\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `power_sum(6)` يُرجع `3087`.\nالجواب:", "qhash": "84858901f9320abe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 51:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([23, 27, 4, 22, 8]) == [23, 50, 0, 22, 30]", "assert reset_sum([4, 14, 15]) == [4, 18, 33]", "assert reset_sum([28, -6, 7, 4, 36, 46, 38, 36, 47]) == [28, 22, 29, 33, 0, 46, 0, 36, 0]", "assert reset_sum([16, 28, 5, 8, 18, -6]) == [16, 44, 49, 0, 18, 12]", "assert reset_sum([41, 21]) == [41, 0]", "assert reset_sum([14, 36, 16, -9, 28, 14, 29]) == [14, 50, 0, -9, 19, 33, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([23, 27, 4, 22, 8]) == [23, 50, 0, 22, 30]\nassert reset_sum([4, 14, 15]) == [4, 18, 33]\nassert reset_sum([28, -6, 7, 4, 36, 46, 38, 36, 47]) == [28, 22, 29, 33, 0, 46, 0, 36, 0]\nassert reset_sum([16, 28, 5, 8, 18, -6]) == [16, 44, 49, 0, 18, 12]\nassert reset_sum([41, 21]) == [41, 0]\nassert reset_sum([14, 36, 16, -9, 28, 14, 29]) == [14, 50, 0, -9, 19, 33, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 51:\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 > 51:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 51 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([23, 27, 4, 22, 8])` يجب أن تُرجع `[23, 50, 0, 22, 30]`.\nالجواب:", "qhash": "4beb74b3ac2a8908"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if w.startswith('ع'))", "tests": ["assert count_hits('علم دفتر مدرسة علم فجر فجر دفتر حديقة') == 2", "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('علم دفتر مدرسة علم فجر فجر دفتر حديقة') == 2\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('علم دفتر مدرسة علم فجر فجر دفتر حديقة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "90736ea5c6e6aabb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 3 for x in range(3, 16) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 3 for x in range(3, 16) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a3e9cc3cddd1e70c", "answer": "[13, 33, 61, 97, 141, 193]\n6 538", "completion": " الناتج:\n```text\n[13, 33, 61, 97, 141, 193]\n6 538\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('matrix summer go') == 'go-summer-matrix'", "assert flip_words('') == ''", "assert flip_words('vector coffee coffee signal orange camel') == 'camel-orange-signal-coffee-coffee-vector'", "assert flip_words('we') == 'we'", "assert flip_words('it table') == 'table-it'", "assert flip_words('in light orange banana brain table we light') == 'light-we-table-brain-banana-orange-light-in'", "assert flip_words('is at coffee to river a') == 'river-to-coffee-at-is'"], "test_code": "assert flip_words('matrix summer go') == 'go-summer-matrix'\nassert flip_words('') == ''\nassert flip_words('vector coffee coffee signal orange camel') == 'camel-orange-signal-coffee-coffee-vector'\nassert flip_words('we') == 'we'\nassert flip_words('it table') == 'table-it'\nassert flip_words('in light orange banana brain table we light') == 'light-we-table-brain-banana-orange-light-in'\nassert flip_words('is at coffee to river a') == 'river-to-coffee-at-is'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `flip_words('matrix summer go')` يُرجع `'go-summer-matrix'`.\nالجواب:", "qhash": "2db62c8267d45d1b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 79", "tests": ["assert mfact(6) == 9", "assert mfact(28) == 73", "assert mfact(43) == 28", "assert mfact(24) == 55", "assert mfact(60) == 32", "assert mfact(34) == 42", "assert mfact(0) == 1"], "test_code": "assert mfact(6) == 9\nassert mfact(28) == 73\nassert mfact(43) == 28\nassert mfact(24) == 55\nassert mfact(60) == 32\nassert mfact(34) == 42\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 79", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(6)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "71eda9dfe3e9bdb0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 8\nfor n in range(1, 25, 1):\n acc -= n * 2\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 8\nfor n in range(1, 25, 1):\n acc -= n * 2\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "b68c4e6a9487a1d9", "answer": "-592\n24", "completion": " الناتج:\n```text\n-592\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ir'}", "tests": ["assert char_freq('vector stone river is') == {'i': 2, 'r': 3}", "assert char_freq('cloud brain cloud falcon') == {'i': 1, 'r': 1}", "assert char_freq('engine') == {'i': 1, 'r': 0}", "assert char_freq('of python we go desert orange') == {'i': 0, 'r': 2}", "assert char_freq('go river to') == {'i': 1, 'r': 2}", "assert char_freq('camel table') == {'i': 0, 'r': 0}", "assert char_freq('') == {'i': 0, 'r': 0}"], "test_code": "assert char_freq('vector stone river is') == {'i': 2, 'r': 3}\nassert char_freq('cloud brain cloud falcon') == {'i': 1, 'r': 1}\nassert char_freq('engine') == {'i': 1, 'r': 0}\nassert char_freq('of python we go desert orange') == {'i': 0, 'r': 2}\nassert char_freq('go river to') == {'i': 1, 'r': 2}\nassert char_freq('camel table') == {'i': 0, 'r': 0}\nassert char_freq('') == {'i': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ir'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'i'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('vector stone river is')` يُرجع `{'i': 2, 'r': 3}`.\nالجواب:", "qhash": "69c5d845bc05860e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=5):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(6))\nprint(g(6, -9))\nprint(g(g(-9), 6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=5):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(6))\nprint(g(6, -9))\nprint(g(g(-9), 6))\n```\nالجواب:", "qhash": "c0462da47c1c27d6", "answer": "-23\n-9\n-42", "completion": " الناتج:\n```text\n-23\n-9\n-42\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'bco'}", "tests": ["assert char_counts('falcon garden to to it camel') == {'b': 0, 'c': 2, 'o': 3}", "assert char_counts('garden') == {'b': 0, 'c': 0, 'o': 0}", "assert char_counts('pixel vector falcon stone') == {'b': 0, 'c': 2, 'o': 3}", "assert char_counts('summer of vector') == {'b': 0, 'c': 1, 'o': 2}", "assert char_counts('window orange pixel rocket banana') == {'b': 1, 'c': 1, 'o': 3}", "assert char_counts('stone signal pixel signal is summer') == {'b': 0, 'c': 0, 'o': 1}", "assert char_counts('') == {'b': 0, 'c': 0, 'o': 0}"], "test_code": "assert char_counts('falcon garden to to it camel') == {'b': 0, 'c': 2, 'o': 3}\nassert char_counts('garden') == {'b': 0, 'c': 0, 'o': 0}\nassert char_counts('pixel vector falcon stone') == {'b': 0, 'c': 2, 'o': 3}\nassert char_counts('summer of vector') == {'b': 0, 'c': 1, 'o': 2}\nassert char_counts('window orange pixel rocket banana') == {'b': 1, 'c': 1, 'o': 3}\nassert char_counts('stone signal pixel signal is summer') == {'b': 0, 'c': 0, 'o': 1}\nassert char_counts('') == {'b': 0, 'c': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'bco'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'bco'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('falcon garden to to it camel')` يُرجع `{'b': 0, 'c': 2, 'o': 3}`.\nالجواب:", "qhash": "75632abb908718c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert spin([34, 4, 0, 8]) == [0, 8, 34, 4]", "assert spin([13, 11, -7, 37, -1, 19, 0, 49, 42, 22]) == [-1, 19, 0, 49, 42, 22, 13, 11, -7, 37]", "assert spin([38, 21, 18]) == [38, 21, 18]", "assert spin([2]) == [2]", "assert spin([31, 4, 21]) == [31, 4, 21]", "assert spin([46, 44, -4, 21, 43, 23, 28]) == [44, -4, 21, 43, 23, 28, 46]", "assert spin([]) == []"], "test_code": "assert spin([34, 4, 0, 8]) == [0, 8, 34, 4]\nassert spin([13, 11, -7, 37, -1, 19, 0, 49, 42, 22]) == [-1, 19, 0, 49, 42, 22, 13, 11, -7, 37]\nassert spin([38, 21, 18]) == [38, 21, 18]\nassert spin([2]) == [2]\nassert spin([31, 4, 21]) == [31, 4, 21]\nassert spin([46, 44, -4, 21, 43, 23, 28]) == [44, -4, 21, 43, 23, 28, 46]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef spin(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `spin([34, 4, 0, 8])` يُرجع `[0, 8, 34, 4]`.\nالجواب:", "qhash": "34a05bc066734c40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 17\nfor n in range(0, 14, 2):\n s -= n * 9\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 17\nfor n in range(0, 14, 2):\n s -= n * 9\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "8650a6fcd12ec3ae", "answer": "-361\n12", "completion": " الناتج:\n```text\n-361\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 37", "tests": ["assert mfact(9) == 8", "assert mfact(31) == 21", "assert mfact(6) == 12", "assert mfact(57) == 0", "assert mfact(32) == 21", "assert mfact(8) == 32", "assert mfact(0) == 1"], "test_code": "assert mfact(9) == 8\nassert mfact(31) == 21\nassert mfact(6) == 12\nassert mfact(57) == 0\nassert mfact(32) == 21\nassert mfact(8) == 32\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 37", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(9)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "dfbd0ac7379e2463"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([8, 69, 89, 66, 58, 2]) == [8, 77, 166, 0, 58, 60]", "assert cumulative([]) == []", "assert cumulative([30, 118, 82]) == [30, 148, 0]", "assert cumulative([-9, 128, 92, 11, 74]) == [-9, 119, 0, 11, 85]", "assert cumulative([]) == []", "assert cumulative([63, 47, 142, 60, 79, 37, 103, 32]) == [63, 110, 0, 60, 139, 176, 0, 32]", "assert cumulative([]) == []"], "test_code": "assert cumulative([8, 69, 89, 66, 58, 2]) == [8, 77, 166, 0, 58, 60]\nassert cumulative([]) == []\nassert cumulative([30, 118, 82]) == [30, 148, 0]\nassert cumulative([-9, 128, 92, 11, 74]) == [-9, 119, 0, 11, 85]\nassert cumulative([]) == []\nassert cumulative([63, 47, 142, 60, 79, 37, 103, 32]) == [63, 110, 0, 60, 139, 176, 0, 32]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\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 > 182:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 182 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([8, 69, 89, 66, 58, 2])` يجب أن تُرجع `[8, 77, 166, 0, 58, 60]`.\nالجواب:", "qhash": "3c535e60dce96fa9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(782463391))\nprint(calc(calc(782463391)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(782463391))\nprint(calc(calc(782463391)))\n```\nالجواب:", "qhash": "a296ae362ea29e98", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة تفاحة ليل') == 1", "assert starts_count('ليل عمل لغة برتقال علم') == 2", "assert starts_count('حصان نهر') == 0", "assert starts_count('صديق وردة ميناء') == 0", "assert starts_count('حصان بيت طائرة عربية لغة دفتر معلم') == 1", "assert starts_count('شجرة سماء حصان لغة معلم قلم') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('قهوة تفاحة ليل') == 1\nassert starts_count('ليل عمل لغة برتقال علم') == 2\nassert starts_count('حصان نهر') == 0\nassert starts_count('صديق وردة ميناء') == 0\nassert starts_count('حصان بيت طائرة عربية لغة دفتر معلم') == 1\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:\n if w.startswith('ل'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ل»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef starts_count(text):\n count = 0\n for w in text:\n if w.startswith('ل'):\n count += 1\n return count\n```\nمثال: `starts_count('قهوة تفاحة ليل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "1580031ae4d6dbf5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 2 * x ** 2 + (-9) * x + (1)", "tests": ["assert poly(1) == -6", "assert poly(17) == 426", "assert poly(12) == 181", "assert poly(-18) == 811", "assert poly(-10) == 291", "assert poly(-14) == 519", "assert poly(11) == 144", "assert poly(0) == 1"], "test_code": "assert poly(1) == -6\nassert poly(17) == 426\nassert poly(12) == 181\nassert poly(-18) == 811\nassert poly(-10) == 291\nassert poly(-14) == 519\nassert poly(11) == 144\nassert poly(0) == 1", "answer": "def poly(x):\n return 2 * x ** 2 + (-9) * x + (1)", "completion": " ```python\ndef poly(x):\n return 2 * x ** 2 + (-9) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 2x² - 9x + 1 عند العدد الصحيح x.\nمثال: `poly(1)` يجب أن تُرجع `-6`.\nالجواب:", "qhash": "280305fe75057a7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -6 * x ** 2 + (-9) * x + (1)", "tests": ["assert eval_poly(7) == -356", "assert eval_poly(15) == -1484", "assert eval_poly(13) == -1130", "assert eval_poly(-17) == -1580", "assert eval_poly(13) == -1130", "assert eval_poly(3) == -80", "assert eval_poly(-18) == -1781", "assert eval_poly(0) == 1"], "test_code": "assert eval_poly(7) == -356\nassert eval_poly(15) == -1484\nassert eval_poly(13) == -1130\nassert eval_poly(-17) == -1580\nassert eval_poly(13) == -1130\nassert eval_poly(3) == -80\nassert eval_poly(-18) == -1781\nassert eval_poly(0) == 1", "answer": "def eval_poly(x):\n return -6 * x ** 2 + (-9) * x + (1)", "completion": " ```python\ndef eval_poly(x):\n return -6 * x ** 2 + (-9) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -6x² - 9x + 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(7)` يُرجع `-356`.\nالجواب:", "qhash": "693dd5a685255501"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "tests": ["assert multiples_total(79) == 920", "assert multiples_total(260) == 10014", "assert multiples_total(60) == 514", "assert multiples_total(192) == 5513", "assert multiples_total(215) == 6723", "assert multiples_total(166) == 4085", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(79) == 920\nassert multiples_total(260) == 10014\nassert multiples_total(60) == 514\nassert multiples_total(192) == 5513\nassert multiples_total(215) == 6723\nassert multiples_total(166) == 4085\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 % 8 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(79)` يُرجع `920`.\nالجواب:", "qhash": "141b4b724e742e2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('rocket window') == 'xuiqkz cotjuc'", "assert shift_letters('winter') == 'cotzkx'", "assert shift_letters('we OK') == 'ck OK'", "assert shift_letters('matrix falcon falcon') == 'sgzxod lgriut lgriut'", "assert shift_letters('pixel music winter window rocket') == 'vodkr sayoi cotzkx cotjuc xuiqkz'", "assert shift_letters('desert') == 'jkykxz'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('rocket window') == 'xuiqkz cotjuc'\nassert shift_letters('winter') == 'cotzkx'\nassert shift_letters('we OK') == 'ck OK'\nassert shift_letters('matrix falcon falcon') == 'sgzxod lgriut lgriut'\nassert shift_letters('pixel music winter window rocket') == 'vodkr sayoi cotzkx cotjuc xuiqkz'\nassert shift_letters('desert') == 'jkykxz'\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 + (-20)) % 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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('rocket window')` يجب أن تُرجع `'xuiqkz cotjuc'`.\nالجواب:", "qhash": "935e248b50776b0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -11 <= x <= 6)", "tests": ["assert clip_scale([-11, -8, 15, -12]) == [-11, -8]", "assert clip_scale([19, 52, 10, -25, 39, 49, 42, 1, 15]) == [1]", "assert clip_scale([42, 31, 10]) == []", "assert clip_scale([23, -6, -28, -30, -21, -15, 39, 7]) == [-6]", "assert clip_scale([5, -26, -12, 21, 47, 19, 20, 13, -12, 56]) == [5]", "assert clip_scale([14, -22, 20, 43, 12, 21, 31, -26, 23, 4]) == [4]", "assert clip_scale([43, -17, 18, 45, 49, -24, 58, 11]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-11, -8, 15, -12]) == [-11, -8]\nassert clip_scale([19, 52, 10, -25, 39, 49, 42, 1, 15]) == [1]\nassert clip_scale([42, 31, 10]) == []\nassert clip_scale([23, -6, -28, -30, -21, -15, 39, 7]) == [-6]\nassert clip_scale([5, -26, -12, 21, 47, 19, 20, 13, -12, 56]) == [5]\nassert clip_scale([14, -22, 20, 43, 12, 21, 31, -26, 23, 4]) == [4]\nassert clip_scale([43, -17, 18, 45, 49, -24, 58, 11]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -11 <= x <= 6)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if -11 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -11 و6 (شاملًا الطرفين) في 1.\nمثال: `clip_scale([-11, -8, 15, -12])` يجب أن تُرجع `[-11, -8]`.\nالجواب:", "qhash": "8835e4b3b9f64b13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'stone'\nprint(name.replace('e', '0'))\nprint(name.split('_'))\nprint(name.index('e') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'stone'\nprint(name.replace('e', '0'))\nprint(name.split('_'))\nprint(name.index('e') + len(name))\n```\nالجواب:", "qhash": "3089a2f68d49223a", "answer": "ston0\n['stone']\n9", "completion": " الناتج:\n```text\nston0\n['stone']\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 66", "tests": ["assert digits_mod(79853) == 36", "assert digits_mod(995419) == 39", "assert digits_mod(169104) == 63", "assert digits_mod(678348) == 16", "assert digits_mod(131867) == 22", "assert digits_mod(961497) == 48", "assert digits_mod(33276) == 47", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(79853) == 36\nassert digits_mod(995419) == 39\nassert digits_mod(169104) == 63\nassert digits_mod(678348) == 16\nassert digits_mod(131867) == 22\nassert digits_mod(961497) == 48\nassert digits_mod(33276) == 47\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 66", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 66\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 66.\nللتوضيح: الاستدعاء `digits_mod(79853)` يُرجع `36`.\nالجواب:", "qhash": "bfc3058c1bf7cc9b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 44) == 1)", "tests": ["assert phi_upto(42) == 19", "assert phi_upto(16) == 7", "assert phi_upto(62) == 28", "assert phi_upto(154) == 70", "assert phi_upto(185) == 85", "assert phi_upto(83) == 38", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(42) == 19\nassert phi_upto(16) == 7\nassert phi_upto(62) == 28\nassert phi_upto(154) == 70\nassert phi_upto(185) == 85\nassert phi_upto(83) == 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, 44) == 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, 44) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 44) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(42)` يُرجع `19`.\nالجواب:", "qhash": "eab9bfdbcc8113e5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([46, -11, 1, 36]) == 36", "assert best_multiple([-12, -6, -6]) == -6", "assert best_multiple([1, 7]) == None", "assert best_multiple([-31, 15, 3, -25, 35, -14, -13, -4, 6]) == 6", "assert best_multiple([33, -40, -27, 14, 34, 41, 3, 36]) == 36", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([46, -11, 1, 36]) == 36\nassert best_multiple([-12, -6, -6]) == -6\nassert best_multiple([1, 7]) == None\nassert best_multiple([-31, 15, 3, -25, 35, -14, -13, -4, 6]) == 6\nassert best_multiple([33, -40, -27, 14, 34, 41, 3, 36]) == 36\nassert best_multiple([]) == None", "answer": "def best_multiple(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 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 % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `best_multiple([46, -11, 1, 36])` يجب أن تُرجع `36`.\nالجواب:", "qhash": "5a593155bc5903e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('camel brain matrix camel A1') == 'pnzry oenva zngevk pnzry A1'", "assert shift_letters('apple cloud is window') == 'nccyr pybhq vf jvaqbj'", "assert shift_letters('go planet at camel brain') == 'tb cynarg ng pnzry oenva'", "assert shift_letters('an an music 2024') == 'na na zhfvp 2024'", "assert shift_letters('coffee by an') == 'pbssrr ol na'", "assert shift_letters('vector rocket window it engine A1') == 'irpgbe ebpxrg jvaqbj vg ratvar A1'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('camel brain matrix camel A1') == 'pnzry oenva zngevk pnzry A1'\nassert shift_letters('apple cloud is window') == 'nccyr pybhq vf jvaqbj'\nassert shift_letters('go planet at camel brain') == 'tb cynarg ng pnzry oenva'\nassert shift_letters('an an music 2024') == 'na na zhfvp 2024'\nassert shift_letters('coffee by an') == 'pbssrr ol na'\nassert shift_letters('vector rocket window it engine A1') == 'irpgbe ebpxrg jvaqbj vg ratvar A1'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('camel brain matrix camel A1')` يجب أن تُرجع `'pnzry oenva zngevk pnzry A1'`.\nالجواب:", "qhash": "de99fbe972d6a521"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 89", "tests": ["assert mfact(8) == 32", "assert mfact(52) == 43", "assert mfact(36) == 74", "assert mfact(56) == 5", "assert mfact(16) == 3", "assert mfact(2) == 2", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 32\nassert mfact(52) == 43\nassert mfact(36) == 74\nassert mfact(56) == 5\nassert mfact(16) == 3\nassert mfact(2) == 2\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 89", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(8)` يُرجع `32`.\nالجواب:", "qhash": "33a777a03d1b57e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert play(24) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun']", "assert play(20) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun']", "assert play(3) == ['1', '2', '3']", "assert play(0) == []", "assert play(7) == ['1', '2', '3', 'Sun', '5', '6', '7']"], "test_code": "assert play(24) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun']\nassert play(20) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun']\nassert play(3) == ['1', '2', '3']\nassert play(0) == []\nassert play(7) == ['1', '2', '3', 'Sun', '5', '6', '7']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 11 == 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 % 4 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(24)` يجب أن تُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21', 'Moon', '23', 'Sun']`.\nالجواب:", "qhash": "3f5afafef6a8bd74"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=2):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(20))\nprint(g(20, -7))\nprint(g(g(-7), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=2):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(20))\nprint(g(20, -7))\nprint(g(g(-7), 20))\n```\nالجواب:", "qhash": "aa33940bf9b875fe", "answer": "-22\n-13\n-29", "completion": " الناتج:\n```text\n-22\n-13\n-29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-1, 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(-1, 5))\n```\nالجواب:", "qhash": "36b5bdc50625645f", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-3, 36, 10, -2, 19]\nprint(a[3:4])\nprint(a[::2])\nprint(min(a[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-3, 36, 10, -2, 19]\nprint(a[3:4])\nprint(a[::2])\nprint(min(a[3:4]))\n```\nالجواب:", "qhash": "be10483400464680", "answer": "[-2]\n[-3, 10, 19]\n-2", "completion": " الناتج:\n```text\n[-2]\n[-3, 10, 19]\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(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 running_sum([13, 2, 12, 16, 4]) == [13, 15, 27, 43, 47]", "assert running_sum([4, 60, 39, 4, 51, 56, 10]) == [4, 64, 0, 4, 55, 0, 10]", "assert running_sum([29, 43, 64, -4, 42, 2, 36, 2]) == [29, 0, 64, 60, 0, 2, 38, 40]", "assert running_sum([]) == []", "assert running_sum([-4, 39]) == [-4, 35]", "assert running_sum([29, 0, 3, 55, 52, -3, 26]) == [29, 29, 32, 0, 52, 49, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([13, 2, 12, 16, 4]) == [13, 15, 27, 43, 47]\nassert running_sum([4, 60, 39, 4, 51, 56, 10]) == [4, 64, 0, 4, 55, 0, 10]\nassert running_sum([29, 43, 64, -4, 42, 2, 36, 2]) == [29, 0, 64, 60, 0, 2, 38, 40]\nassert running_sum([]) == []\nassert running_sum([-4, 39]) == [-4, 35]\nassert running_sum([29, 0, 3, 55, 52, -3, 26]) == [29, 29, 32, 0, 52, 49, 0]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 64 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([13, 2, 12, 16, 4])` يُرجع `[13, 15, 27, 43, 47]`.\nالجواب:", "qhash": "7dc660de3b0a2c7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert count_initial('بيت بيت نور باب قمر شجرة') == 3", "assert count_initial('دفتر قلم بحر') == 1", "assert count_initial('سيارة ميناء بحر برمجة بحر مكتبة برتقال حصان') == 4", "assert count_initial('دفتر معلم بحر علم') == 1", "assert count_initial('لغة حديقة نهار سوق بحر برتقال برتقال') == 3", "assert count_initial('شجرة لغة') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('بيت بيت نور باب قمر شجرة') == 3\nassert count_initial('دفتر قلم بحر') == 1\nassert count_initial('سيارة ميناء بحر برمجة بحر مكتبة برتقال حصان') == 4\nassert count_initial('دفتر معلم بحر علم') == 1\nassert count_initial('لغة حديقة نهار سوق بحر برتقال برتقال') == 3\nassert count_initial('شجرة لغة') == 0\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(line):\n count = 0\n for w in line.split():\n if 'ب' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('بيت بيت نور باب قمر شجرة')` يُرجع `3`.\nالجواب:", "qhash": "efe6237036138a98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if 'ن' in w)", "tests": ["assert count_hits('شجرة عربية سماء') == 0", "assert count_hits('حديقة قهوة مطر ليل') == 0", "assert count_hits('وردة نور') == 1", "assert count_hits('كتاب مكتبة') == 0", "assert count_hits('طالب باب جمل سلام طالب وردة قلم') == 0", "assert count_hits('تفاحة حديقة رمل سفينة ليل مكتبة برتقال صحراء') == 1", "assert count_hits('سماء سلام مدرسة') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('شجرة عربية سماء') == 0\nassert count_hits('حديقة قهوة مطر ليل') == 0\nassert count_hits('وردة نور') == 1\nassert count_hits('كتاب مكتبة') == 0\nassert count_hits('طالب باب جمل سلام طالب وردة قلم') == 0\nassert count_hits('تفاحة حديقة رمل سفينة ليل مكتبة برتقال صحراء') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ن» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('شجرة عربية سماء')` يُرجع `0`.\nالجواب:", "qhash": "84c2d5542356c99a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('rocket window up') == 'up,window,rocket'", "assert rev_join('river') == 'river'", "assert rev_join('stone orange data a signal winter') == 'winter,signal,a,data,orange,stone'", "assert rev_join('code desert cloud code river') == 'river,code,cloud,desert,code'", "assert rev_join('signal banana') == 'banana,signal'", "assert rev_join('python of') == 'of,python'", "assert rev_join('data camel to signal camel falcon camel go') == 'go,camel,falcon,camel,signal,to,camel,data'"], "test_code": "assert rev_join('rocket window up') == 'up,window,rocket'\nassert rev_join('river') == 'river'\nassert rev_join('stone orange data a signal winter') == 'winter,signal,a,data,orange,stone'\nassert rev_join('code desert cloud code river') == 'river,code,cloud,desert,code'\nassert rev_join('signal banana') == 'banana,signal'\nassert rev_join('python of') == 'of,python'\nassert rev_join('data camel to signal camel falcon camel go') == 'go,camel,falcon,camel,signal,to,camel,data'", "answer": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `rev_join('rocket window up')` يجب أن تُرجع `'up,window,rocket'`.\nالجواب:", "qhash": "3f7a6676f6eb28c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'winter_window'\nprint(s.count('w'))\nprint(s[0:8])\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'winter_window'\nprint(s.count('w'))\nprint(s[0:8])\nprint(s[::-1])\n```\nالجواب:", "qhash": "5bcccfabb4c6a13c", "answer": "3\nwinter_w\nwodniw_retniw", "completion": " الناتج:\n```text\n3\nwinter_w\nwodniw_retniw\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "tests": ["assert roll([16, 26, 40, 44, 31, 1, 6]) == [44, 31, 1, 6, 16, 26, 40]", "assert roll([44, 20, 47, 19, 23]) == [44, 20, 47, 19, 23]", "assert roll([40, 22, 16, -3]) == [16, -3, 40, 22]", "assert roll([13, 37, 34, 8, 16]) == [13, 37, 34, 8, 16]", "assert roll([48, 16, 19, 46, 34, -9, 18, -9, 34]) == [16, 19, 46, 34, -9, 18, -9, 34, 48]", "assert roll([-9, -7, 33]) == [-7, 33, -9]", "assert roll([]) == []"], "test_code": "assert roll([16, 26, 40, 44, 31, 1, 6]) == [44, 31, 1, 6, 16, 26, 40]\nassert roll([44, 20, 47, 19, 23]) == [44, 20, 47, 19, 23]\nassert roll([40, 22, 16, -3]) == [16, -3, 40, 22]\nassert roll([13, 37, 34, 8, 16]) == [13, 37, 34, 8, 16]\nassert roll([48, 16, 19, 46, 34, -9, 18, -9, 34]) == [16, 19, 46, 34, -9, 18, -9, 34, 48]\nassert roll([-9, -7, 33]) == [-7, 33, -9]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef roll(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(items):\n if not items:\n return []\n k = 10 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `roll([16, 26, 40, 44, 31, 1, 6])` يُرجع `[44, 31, 1, 6, 16, 26, 40]`.\nالجواب:", "qhash": "cdf96325f8f3225f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('جمل امل ميناء امل بحر') == 2", "assert count_prefix('امل باب شجرة سلام حديقة ميناء') == 1", "assert count_prefix('مدرسة برتقال كتاب عربية') == 0", "assert count_prefix('تفاحة سوق قمر امل') == 1", "assert count_prefix('امل امل صديق فجر علم صحراء شمس لغة') == 2", "assert count_prefix('علم امل طالب') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('جمل امل ميناء امل بحر') == 2\nassert count_prefix('امل باب شجرة سلام حديقة ميناء') == 1\nassert count_prefix('مدرسة برتقال كتاب عربية') == 0\nassert count_prefix('تفاحة سوق قمر امل') == 1\nassert count_prefix('امل امل صديق فجر علم صحراء شمس لغة') == 2\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('جمل امل ميناء امل بحر')` يُرجع `2`.\nالجواب:", "qhash": "a86b27c544231a8f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('desert 2024') == 'cdrdqs 2024'", "assert cipher('coffee of OK') == 'bneedd ne OK'", "assert cipher('desert engine python winter A1') == 'cdrdqs dmfhmd oxsgnm vhmsdq A1'", "assert cipher('river light cloud in') == 'qhudq khfgs bkntc hm'", "assert cipher('it') == 'hs'", "assert cipher('a at music window !') == 'z zs ltrhb vhmcnv !'", "assert cipher('') == ''"], "test_code": "assert cipher('desert 2024') == 'cdrdqs 2024'\nassert cipher('coffee of OK') == 'bneedd ne OK'\nassert cipher('desert engine python winter A1') == 'cdrdqs dmfhmd oxsgnm vhmsdq A1'\nassert cipher('river light cloud in') == 'qhudq khfgs bkntc hm'\nassert cipher('it') == 'hs'\nassert cipher('a at music window !') == 'z zs ltrhb vhmcnv !'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('desert 2024')` يُرجع `'cdrdqs 2024'`.\nالجواب:", "qhash": "588da3b2439fea83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_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 turn_list([35, 30, 28]) == [35, 30, 28]", "assert turn_list([-3, 34, 34, -1]) == [-3, 34, 34, -1]", "assert turn_list([9, 40, 19, 21, 15, 0, 48]) == [19, 21, 15, 0, 48, 9, 40]", "assert turn_list([20, 49, 36]) == [20, 49, 36]", "assert turn_list([41, 31, 44, 13, -9, 41, 24, 35, 29, 13, 34, -6]) == [41, 31, 44, 13, -9, 41, 24, 35, 29, 13, 34, -6]", "assert turn_list([45, 11, 5, 38]) == [45, 11, 5, 38]", "assert turn_list([]) == []"], "test_code": "assert turn_list([35, 30, 28]) == [35, 30, 28]\nassert turn_list([-3, 34, 34, -1]) == [-3, 34, 34, -1]\nassert turn_list([9, 40, 19, 21, 15, 0, 48]) == [19, 21, 15, 0, 48, 9, 40]\nassert turn_list([20, 49, 36]) == [20, 49, 36]\nassert turn_list([41, 31, 44, 13, -9, 41, 24, 35, 29, 13, 34, -6]) == [41, 31, 44, 13, -9, 41, 24, 35, 29, 13, 34, -6]\nassert turn_list([45, 11, 5, 38]) == [45, 11, 5, 38]\nassert turn_list([]) == []", "answer": "def turn_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 turn_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 turn_list(items):\n if not items:\n return []\n k = 12 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([35, 30, 28])` يُرجع `[35, 30, 28]`.\nالجواب:", "qhash": "f4f8e8311d84873c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([23, 24, 1, 1, 21, 2, 28, 39, 4]) == [23, 47, 48, 49, 70, 0, 28, 67, 0]", "assert rolling_total([15, -10, 15]) == [15, 5, 20]", "assert rolling_total([6, 2, 31, 60, 46]) == [6, 8, 39, 0, 46]", "assert rolling_total([-3, 18, 10, -10]) == [-3, 15, 25, 15]", "assert rolling_total([54, 58, 28, 31, 25, -5, 67, 52, 38]) == [54, 0, 28, 59, 0, -5, 62, 0, 38]", "assert rolling_total([43, 51, 17, 66, 14, 22]) == [43, 0, 17, 0, 14, 36]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([23, 24, 1, 1, 21, 2, 28, 39, 4]) == [23, 47, 48, 49, 70, 0, 28, 67, 0]\nassert rolling_total([15, -10, 15]) == [15, 5, 20]\nassert rolling_total([6, 2, 31, 60, 46]) == [6, 8, 39, 0, 46]\nassert rolling_total([-3, 18, 10, -10]) == [-3, 15, 25, 15]\nassert rolling_total([54, 58, 28, 31, 25, -5, 67, 52, 38]) == [54, 0, 28, 59, 0, -5, 62, 0, 38]\nassert rolling_total([43, 51, 17, 66, 14, 22]) == [43, 0, 17, 0, 14, 36]\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 70 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([23, 24, 1, 1, 21, 2, 28, 39, 4])` يجب أن تُرجع `[23, 47, 48, 49, 70, 0, 28, 67, 0]`.\nالجواب:", "qhash": "e7e3a29533f87ddd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('لغة برتقال سيارة ليل') == 2", "assert lead_count('برتقال طالب لغة لغة') == 2", "assert lead_count('طالب حاسوب') == 0", "assert lead_count('خبز بيت مدرسة') == 0", "assert lead_count('رمل سلام نهار') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('تفاحة ماء شمس معلم شجرة خبز') == 0\nassert lead_count('لغة برتقال سيارة ليل') == 2\nassert lead_count('برتقال طالب لغة لغة') == 2\nassert lead_count('طالب حاسوب') == 0\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": "898e11c9c1a82109"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89", "tests": ["assert multi_fact(7) == 16", "assert multi_fact(21) == 60", "assert multi_fact(37) == 39", "assert multi_fact(39) == 8", "assert multi_fact(3) == 3", "assert multi_fact(39) == 8", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(7) == 16\nassert multi_fact(21) == 60\nassert multi_fact(37) == 39\nassert multi_fact(39) == 8\nassert multi_fact(3) == 3\nassert multi_fact(39) == 8\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(7)` يُرجع `16`.\nالجواب:", "qhash": "809ef28491af4ca3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_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 tally_div([21, 46, 64, 47, 54, 70, 90, 68, 60]) == 0", "assert tally_div([-1, 50]) == 0", "assert tally_div([43, 67, -27, 29, 0]) == 0", "assert tally_div([66, 90, 62, 80, 70]) == 0", "assert tally_div([-28, 12, 22, 21]) == 0", "assert tally_div([47, 56, 12, 45, 16, 54, -31, -28, 80, 23, -25]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([21, 46, 64, 47, 54, 70, 90, 68, 60]) == 0\nassert tally_div([-1, 50]) == 0\nassert tally_div([43, 67, -27, 29, 0]) == 0\nassert tally_div([66, 90, 62, 80, 70]) == 0\nassert tally_div([-28, 12, 22, 21]) == 0\nassert tally_div([47, 56, 12, 45, 16, 54, -31, -28, 80, 23, -25]) == 0\nassert tally_div([]) == 0", "answer": "def tally_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 tally_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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `tally_div([21, 46, 64, 47, 54, 70, 90, 68, 60])` يُرجع `0`.\nالجواب:", "qhash": "f8d16839a8cdf80d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert spin([10, 8, 39]) == [10, 8, 39]", "assert spin([-1, 24, 20, 42, 17, -7, 37]) == [-7, 37, -1, 24, 20, 42, 17]", "assert spin([-9, 26, 11, 0, 41, 5, 38, 25, -3, 13, 25, 16]) == [-9, 26, 11, 0, 41, 5, 38, 25, -3, 13, 25, 16]", "assert spin([-6, -2, 30, 33, 19, 44, 18, 48, 50, 45, 2]) == [-2, 30, 33, 19, 44, 18, 48, 50, 45, 2, -6]", "assert spin([17, 27, 39, 34, -5, 44, 48, 14, 31, 38]) == [39, 34, -5, 44, 48, 14, 31, 38, 17, 27]", "assert spin([11]) == [11]", "assert spin([]) == []"], "test_code": "assert spin([10, 8, 39]) == [10, 8, 39]\nassert spin([-1, 24, 20, 42, 17, -7, 37]) == [-7, 37, -1, 24, 20, 42, 17]\nassert spin([-9, 26, 11, 0, 41, 5, 38, 25, -3, 13, 25, 16]) == [-9, 26, 11, 0, 41, 5, 38, 25, -3, 13, 25, 16]\nassert spin([-6, -2, 30, 33, 19, 44, 18, 48, 50, 45, 2]) == [-2, 30, 33, 19, 44, 18, 48, 50, 45, 2, -6]\nassert spin([17, 27, 39, 34, -5, 44, 48, 14, 31, 38]) == [39, 34, -5, 44, 48, 14, 31, 38, 17, 27]\nassert spin([11]) == [11]\nassert spin([]) == []", "answer": "def spin(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef spin(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return ____\n```\nمثال: `spin([10, 8, 39])` يجب أن تُرجع `[10, 8, 39]`.\nالجواب:", "qhash": "7e37b40239c93e47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 5 for x in xs if 12 <= x <= 18)", "tests": ["assert filter_range([11, 3, 12, 22]) == [60]", "assert filter_range([]) == []", "assert filter_range([57, -5, 0, -27, -22, 12]) == [60]", "assert filter_range([15, 22, 21, 13, 19, 32, -17, -24, 4, 43]) == [65, 75]", "assert filter_range([7, 12, 14, 37, 6, 16, 49, 35, 52, -30]) == [60, 70, 80]", "assert filter_range([40, 26, 55, 20, 6]) == []", "assert filter_range([-30, 51, 49, -8, 26, 39]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([11, 3, 12, 22]) == [60]\nassert filter_range([]) == []\nassert filter_range([57, -5, 0, -27, -22, 12]) == [60]\nassert filter_range([15, 22, 21, 13, 19, 32, -17, -24, 4, 43]) == [65, 75]\nassert filter_range([7, 12, 14, 37, 6, 16, 49, 35, 52, -30]) == [60, 70, 80]\nassert filter_range([40, 26, 55, 20, 6]) == []\nassert filter_range([-30, 51, 49, -8, 26, 39]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 5 for x in xs if 12 <= x <= 18)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 5 for x in xs if 12 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 12 و18 (شاملًا الطرفين) في 5.\nمثال: `filter_range([11, 3, 12, 22])` يجب أن تُرجع `[60]`.\nالجواب:", "qhash": "da4247ba7e5d812a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [0, 29, 3, 8, 5]\nprint(data[2:5])\nprint(data[::2])\nprint(sum(data[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [0, 29, 3, 8, 5]\nprint(data[2:5])\nprint(data[::2])\nprint(sum(data[2:5]))\n```\nالجواب:", "qhash": "647ad01e5fc02304", "answer": "[3, 8, 5]\n[0, 3, 5]\n16", "completion": " الناتج:\n```text\n[3, 8, 5]\n[0, 3, 5]\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 159:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([34, 52, 11, 39, 43, 50]) == [34, 86, 97, 136, 0, 50]", "assert running_sum([37, 44, 3]) == [37, 81, 84]", "assert running_sum([126, 62, 46, 138]) == [126, 0, 46, 0]", "assert running_sum([67, 139, 93]) == [67, 0, 93]", "assert running_sum([43, 39, 114, 98]) == [43, 82, 0, 98]", "assert running_sum([113, 72, 88, 37, 146, 80, 69]) == [113, 0, 88, 125, 0, 80, 149]", "assert running_sum([]) == []"], "test_code": "assert running_sum([34, 52, 11, 39, 43, 50]) == [34, 86, 97, 136, 0, 50]\nassert running_sum([37, 44, 3]) == [37, 81, 84]\nassert running_sum([126, 62, 46, 138]) == [126, 0, 46, 0]\nassert running_sum([67, 139, 93]) == [67, 0, 93]\nassert running_sum([43, 39, 114, 98]) == [43, 82, 0, 98]\nassert running_sum([113, 72, 88, 37, 146, 80, 69]) == [113, 0, 88, 125, 0, 80, 149]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 159:\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 > 159:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 159 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([34, 52, 11, 39, 43, 50])` يجب أن تُرجع `[34, 86, 97, 136, 0, 50]`.\nالجواب:", "qhash": "cfc7d17c142b90df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "tests": ["assert pow_total(7) == 232064", "assert pow_total(12) == 5045664", "assert pow_total(14) == 12318600", "assert pow_total(1) == 8", "assert pow_total(7) == 232064", "assert pow_total(1) == 8", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 232064\nassert pow_total(12) == 5045664\nassert pow_total(14) == 12318600\nassert pow_total(1) == 8\nassert pow_total(7) == 232064\nassert pow_total(1) == 8\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total\n```\nمثال: `pow_total(7)` يجب أن تُرجع `232064`.\nالجواب:", "qhash": "6cb4c0dcda9d9021"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "tests": ["assert sum_div(294) == 12362", "assert sum_div(271) == 10665", "assert sum_div(3) == 0", "assert sum_div(71) == 732", "assert sum_div(133) == 2565", "assert sum_div(145) == 2984", "assert sum_div(1) == 0"], "test_code": "assert sum_div(294) == 12362\nassert sum_div(271) == 10665\nassert sum_div(3) == 0\nassert sum_div(71) == 732\nassert sum_div(133) == 2565\nassert sum_div(145) == 2984\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(294)` يُرجع `12362`.\nالجواب:", "qhash": "857a2b110964df10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(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 max_of_div([23, -17, 48, -6, 13]) == None", "assert max_of_div([-35, -7, -28]) == -7", "assert max_of_div([1, 8, 15]) == None", "assert max_of_div([11, -24]) == None", "assert max_of_div([-14, -25, -11, -38, -11, -8, -42, 22]) == -14", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([23, -17, 48, -6, 13]) == None\nassert max_of_div([-35, -7, -28]) == -7\nassert max_of_div([1, 8, 15]) == None\nassert max_of_div([11, -24]) == None\nassert max_of_div([-14, -25, -11, -38, -11, -8, -42, 22]) == -14\nassert max_of_div([]) == None", "answer": "def max_of_div(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 max_of_div(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 max_of_div(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 max_of_div(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للتوضيح: الاستدعاء `max_of_div([23, -17, 48, -6, 13])` يُرجع `None`.\nالجواب:", "qhash": "4cd15bf3e3a4ad71"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'imnu'}", "tests": ["assert char_counts('cloud window vector banana') == {'i': 1, 'm': 0, 'n': 3, 'u': 1}", "assert char_counts('river garden falcon') == {'i': 1, 'm': 0, 'n': 2, 'u': 0}", "assert char_counts('code') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}", "assert char_counts('window apple brain cloud light') == {'i': 3, 'm': 0, 'n': 2, 'u': 1}", "assert char_counts('summer pixel') == {'i': 1, 'm': 2, 'n': 0, 'u': 1}", "assert char_counts('table') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}", "assert char_counts('') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}"], "test_code": "assert char_counts('cloud window vector banana') == {'i': 1, 'm': 0, 'n': 3, 'u': 1}\nassert char_counts('river garden falcon') == {'i': 1, 'm': 0, 'n': 2, 'u': 0}\nassert char_counts('code') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}\nassert char_counts('window apple brain cloud light') == {'i': 3, 'm': 0, 'n': 2, 'u': 1}\nassert char_counts('summer pixel') == {'i': 1, 'm': 2, 'n': 0, 'u': 1}\nassert char_counts('table') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}\nassert char_counts('') == {'i': 0, 'm': 0, 'n': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'imnu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'imnu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'i'، 'm'، 'n'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('cloud window vector banana')` يجب أن تُرجع `{'i': 1, 'm': 0, 'n': 3, 'u': 1}`.\nالجواب:", "qhash": "f069b61ed1eca4a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'زينب': 16, 'باسل': 33, 'راشد': 32}\npoints['زينب'] += 17\npoints['أحمد'] = 44\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 = {'زينب': 16, 'باسل': 33, 'راشد': 32}\npoints['زينب'] += 17\npoints['أحمد'] = 44\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": "83ea5485ad7175e4", "answer": "4\nأحمد\n142\n[('راشد', 32), ('باسل', 33)]", "completion": " الناتج:\n```text\n4\nأحمد\n142\n[('راشد', 32), ('باسل', 33)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ه'))", "tests": ["assert letter_hits('قلم جبل صديق مطر') == 0", "assert letter_hits('صحراء كتاب تفاحة طائرة باب بحر صحراء برتقال') == 0", "assert letter_hits('شمس ماء خبز لغة عمل ماء طالب شمس') == 0", "assert letter_hits('شمس ليل شمس وردة دفتر كتاب') == 0", "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('شمس ماء خبز لغة عمل ماء طالب شمس') == 0\nassert letter_hits('شمس ليل شمس وردة دفتر كتاب') == 0\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 w.startswith('ه'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ه'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه».\nمثال: `letter_hits('قلم جبل صديق مطر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "51ddf841c1c94933"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "flip_words", "reference": "def flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert flip_words('an vector light code camel river') == 'river_camel_code_light_vector'", "assert flip_words('rocket desert we table python') == 'python_table_desert_rocket'", "assert flip_words('river a music go by it') == 'music_river'", "assert flip_words('planet matrix brain summer coffee brain pixel cloud') == 'cloud_pixel_brain_coffee_summer_brain_matrix_planet'", "assert flip_words('at desert window code') == 'code_window_desert'", "assert flip_words('an signal pixel coffee of engine coffee') == 'coffee_engine_coffee_pixel_signal'", "assert flip_words('in camel summer up of by') == 'summer_camel'"], "test_code": "assert flip_words('an vector light code camel river') == 'river_camel_code_light_vector'\nassert flip_words('rocket desert we table python') == 'python_table_desert_rocket'\nassert flip_words('river a music go by it') == 'music_river'\nassert flip_words('planet matrix brain summer coffee brain pixel cloud') == 'cloud_pixel_brain_coffee_summer_brain_matrix_planet'\nassert flip_words('at desert window code') == 'code_window_desert'\nassert flip_words('an signal pixel coffee of engine coffee') == 'coffee_engine_coffee_pixel_signal'\nassert flip_words('in camel summer up of by') == 'summer_camel'", "answer": "def flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `flip_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `flip_words('an vector light code camel river')` يُرجع `'river_camel_code_light_vector'`.\nالجواب:", "qhash": "4a8680ff802b0206"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'dh'}", "tests": ["assert letter_stats('vector pixel') == {'d': 0, 'h': 0}", "assert letter_stats('cloud apple brain data planet') == {'d': 2, 'h': 0}", "assert letter_stats('of signal on at table music') == {'d': 0, 'h': 0}", "assert letter_stats('go to pixel stone garden planet') == {'d': 1, 'h': 0}", "assert letter_stats('a') == {'d': 0, 'h': 0}", "assert letter_stats('window in') == {'d': 1, 'h': 0}", "assert letter_stats('') == {'d': 0, 'h': 0}"], "test_code": "assert letter_stats('vector pixel') == {'d': 0, 'h': 0}\nassert letter_stats('cloud apple brain data planet') == {'d': 2, 'h': 0}\nassert letter_stats('of signal on at table music') == {'d': 0, 'h': 0}\nassert letter_stats('go to pixel stone garden planet') == {'d': 1, 'h': 0}\nassert letter_stats('a') == {'d': 0, 'h': 0}\nassert letter_stats('window in') == {'d': 1, 'h': 0}\nassert letter_stats('') == {'d': 0, 'h': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'dh'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'dh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'h' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('vector pixel')` يُرجع `{'d': 0, 'h': 0}`.\nالجواب:", "qhash": "1752990377a47192"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [27, 21, 37, 31, 12, 19, 15]\nprint(xs[0:1])\nprint(xs[::2])\nprint(len(xs[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [27, 21, 37, 31, 12, 19, 15]\nprint(xs[0:1])\nprint(xs[::2])\nprint(len(xs[0:1]))\n```\nالجواب:", "qhash": "0f4d6a4288d7a353", "answer": "[27]\n[27, 37, 12, 15]\n1", "completion": " الناتج:\n```text\n[27]\n[27, 37, 12, 15]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -17 <= x <= 23)", "tests": ["assert pick_between([-17, -5, -6, 22]) == [-17, -6, -5, 22]", "assert pick_between([-15, -26, 0, -7, -18]) == [-15, -7, 0]", "assert pick_between([12, 24, -30, -6, 27, 60, 24]) == [-6, 12]", "assert pick_between([-21, 58, 53]) == []", "assert pick_between([]) == []", "assert pick_between([7]) == [7]", "assert pick_between([54, 10, 40, -27]) == [10]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-17, -5, -6, 22]) == [-17, -6, -5, 22]\nassert pick_between([-15, -26, 0, -7, -18]) == [-15, -7, 0]\nassert pick_between([12, 24, -30, -6, 27, 60, 24]) == [-6, 12]\nassert pick_between([-21, 58, 53]) == []\nassert pick_between([]) == []\nassert pick_between([7]) == [7]\nassert pick_between([54, 10, 40, -27]) == [10]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -17 <= x <= 23)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 1 for x in xs if -17 <= x <= 23)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -17 و23 (شاملًا الطرفين) في 1.\nمثال: `pick_between([-17, -5, -6, 22])` يجب أن تُرجع `[-17, -6, -5, 22]`.\nالجواب:", "qhash": "e85b8d3c9efb4f5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'rocket_falcon'\nprint(s.replace('t', '0'))\nprint(s[-2:])\nprint(s.count('t'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'rocket_falcon'\nprint(s.replace('t', '0'))\nprint(s[-2:])\nprint(s.count('t'))\n```\nالجواب:", "qhash": "f1fc1de4e85df256", "answer": "rocke0_falcon\non\n1", "completion": " الناتج:\n```text\nrocke0_falcon\non\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "tests": ["assert count_initial('ميناء سيارة مدرسة صحراء جمل') == 1", "assert count_initial('معلم جبل جمل فجر نور مدينة') == 2", "assert count_initial('جبل نهار ماء') == 1", "assert count_initial('ميناء جمل جمل مكتبة') == 2", "assert count_initial('سماء قلم ميناء نهار لغة تفاحة') == 0", "assert count_initial('جبل جمل علم علم حصان جمل') == 3", "assert count_initial('') == 0"], "test_code": "assert count_initial('ميناء سيارة مدرسة صحراء جمل') == 1\nassert count_initial('معلم جبل جمل فجر نور مدينة') == 2\nassert count_initial('جبل نهار ماء') == 1\nassert count_initial('ميناء جمل جمل مكتبة') == 2\nassert count_initial('سماء قلم ميناء نهار لغة تفاحة') == 0\nassert count_initial('جبل جمل علم علم حصان جمل') == 3\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text:\n if w.startswith('ج'):\n count += 1\n return count\n```\nمثال: `count_initial('ميناء سيارة مدرسة صحراء جمل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "11c63fa62b1653d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 9 for x in range(2, 16) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 9 for x in range(2, 16) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "934762ef25667f30", "answer": "[0, 55, 160]\n3 215", "completion": " الناتج:\n```text\n[0, 55, 160]\n3 215\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'apple'\nprint(s.count('l'))\nprint(s.split('_'))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'apple'\nprint(s.count('l'))\nprint(s.split('_'))\nprint(len(s))\n```\nالجواب:", "qhash": "84a4769184a5fd2c", "answer": "1\n['apple']\n5", "completion": " الناتج:\n```text\n1\n['apple']\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [3, -12, 27, 27, 36, -20, 17]\nprint(sorted(nums, key=lambda x: (abs(x - -4), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [3, -12, 27, 27, 36, -20, 17]\nprint(sorted(nums, key=lambda x: (abs(x - -4), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "d52080f7e16ea95f", "answer": "[3, -12, -20, 17, 27, 27, 36]\n[36, 27, 27]", "completion": " الناتج:\n```text\n[3, -12, -20, 17, 27, 27, 36]\n[36, 27, 27]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'gnr'}", "tests": ["assert freq_of('at of we winter') == {'g': 0, 'n': 1, 'r': 1}", "assert freq_of('it data') == {'g': 0, 'n': 0, 'r': 0}", "assert freq_of('camel is') == {'g': 0, 'n': 0, 'r': 0}", "assert freq_of('up') == {'g': 0, 'n': 0, 'r': 0}", "assert freq_of('camel') == {'g': 0, 'n': 0, 'r': 0}", "assert freq_of('coffee') == {'g': 0, 'n': 0, 'r': 0}", "assert freq_of('') == {'g': 0, 'n': 0, 'r': 0}"], "test_code": "assert freq_of('at of we winter') == {'g': 0, 'n': 1, 'r': 1}\nassert freq_of('it data') == {'g': 0, 'n': 0, 'r': 0}\nassert freq_of('camel is') == {'g': 0, 'n': 0, 'r': 0}\nassert freq_of('up') == {'g': 0, 'n': 0, 'r': 0}\nassert freq_of('camel') == {'g': 0, 'n': 0, 'r': 0}\nassert freq_of('coffee') == {'g': 0, 'n': 0, 'r': 0}\nassert freq_of('') == {'g': 0, 'n': 0, 'r': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'gnr'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'gnr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'n'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('at of we winter')` يُرجع `{'g': 0, 'n': 1, 'r': 1}`.\nالجواب:", "qhash": "1dcdc163561ef305"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 29", "tests": ["assert prod_mod(5) == 15", "assert prod_mod(36) == 16", "assert prod_mod(57) == 0", "assert prod_mod(27) == 17", "assert prod_mod(27) == 17", "assert prod_mod(53) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(5) == 15\nassert prod_mod(36) == 16\nassert prod_mod(57) == 0\nassert prod_mod(27) == 17\nassert prod_mod(27) == 17\nassert prod_mod(53) == 0\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 29", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(5)` يُرجع `15`.\nالجواب:", "qhash": "6e4e29c071482b9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [7, 39, 6, -7, 24, -3, 37, 20]\nprint(data[1:8])\nprint(data[::2])\nprint(len(data[1:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [7, 39, 6, -7, 24, -3, 37, 20]\nprint(data[1:8])\nprint(data[::2])\nprint(len(data[1:8]))\n```\nالجواب:", "qhash": "89eb2392f17494d9", "answer": "[39, 6, -7, 24, -3, 37, 20]\n[7, 6, 24, 37]\n7", "completion": " الناتج:\n```text\n[39, 6, -7, 24, -3, 37, 20]\n[7, 6, 24, 37]\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'camel'\nprint(name.replace('l', 'X'))\nprint(len(name))\nprint(name[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'camel'\nprint(name.replace('l', 'X'))\nprint(len(name))\nprint(name[-4:])\n```\nالجواب:", "qhash": "21e238b4ce9f5fc0", "answer": "cameX\n5\namel", "completion": " الناتج:\n```text\ncameX\n5\namel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'صديق'\nprint(len(kalima))\nprint(kalima.count('ص'))\nprint(kalima.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'صديق'\nprint(len(kalima))\nprint(kalima.count('ص'))\nprint(kalima.split())\n```\nالجواب:", "qhash": "86106e682b512c49", "answer": "4\n1\n['صديق']", "completion": " الناتج:\n```text\n4\n1\n['صديق']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 6\nfor x in range(7, 30, 2):\n acc -= x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 6\nfor x in range(7, 30, 2):\n acc -= x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "1ffdb6b549684b2f", "answer": "-1722\n29", "completion": " الناتج:\n```text\n-1722\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([6, 19, 44, 33, 50, 37]) == 0", "assert div_not([-26, 74, 25]) == 0", "assert div_not([63]) == 1", "assert div_not([]) == 0", "assert div_not([-39]) == 0", "assert div_not([81, -1, 2, 72, 26, -16, -6]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([6, 19, 44, 33, 50, 37]) == 0\nassert div_not([-26, 74, 25]) == 0\nassert div_not([63]) == 1\nassert div_not([]) == 0\nassert div_not([-39]) == 0\nassert div_not([81, -1, 2, 72, 26, -16, -6]) == 1\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `div_not([6, 19, 44, 33, 50, 37])` يُرجع `0`.\nالجواب:", "qhash": "0bacfbcbe476a39a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'ليلى': 28, 'وليد': 49, 'رنا': 39, 'سعيد': 46}\nmarks['سعيد'] += 6\nmarks['منى'] = 14\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, 'وليد': 49, 'رنا': 39, 'سعيد': 46}\nmarks['سعيد'] += 6\nmarks['منى'] = 14\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": "2c3e25c123fa781d", "answer": "5\nسعيد\n182\n[('منى', 14), ('ليلى', 28)]", "completion": " الناتج:\n```text\n5\nسعيد\n182\n[('منى', 14), ('ليلى', 28)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ت')", "tests": ["assert count_letter('ميناء سماء نهار ميناء سيارة') == 0", "assert count_letter('جبل صديق حديقة بيت مدرسة ماء سماء') == 1", "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('جبل صديق حديقة بيت مدرسة ماء سماء') == 1\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 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": "3fb32e3f6b4c410e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'باب'\nprint(text[::-1])\nprint(text[-1])\nprint(text.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'باب'\nprint(text[::-1])\nprint(text[-1])\nprint(text.replace(' ', '-'))\n```\nالجواب:", "qhash": "6ae08b1991b773b4", "answer": "باب\nب\nباب", "completion": " الناتج:\n```text\nباب\nب\nباب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('it Hello') == 'oz Hkrru'", "assert cipher('river summer table window data Hello') == 'xobkx yasskx zghrk cotjuc jgzg Hkrru'", "assert cipher('on planet we') == 'ut vrgtkz ck'", "assert cipher('window pixel') == 'cotjuc vodkr'", "assert cipher('light pixel') == 'romnz vodkr'", "assert cipher('it') == 'oz'", "assert cipher('') == ''"], "test_code": "assert cipher('it Hello') == 'oz Hkrru'\nassert cipher('river summer table window data Hello') == 'xobkx yasskx zghrk cotjuc jgzg Hkrru'\nassert cipher('on planet we') == 'ut vrgtkz ck'\nassert cipher('window pixel') == 'cotjuc vodkr'\nassert cipher('light pixel') == 'romnz vodkr'\nassert cipher('it') == 'oz'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('it Hello')` يجب أن تُرجع `'oz Hkrru'`.\nالجواب:", "qhash": "086ef4f5b0b4497e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سوق بحر برمجة حديقة سوق') == 2", "assert lead_count('برتقال مطر قمر صحراء حديقة ليل بيت') == 2", "assert lead_count('عربية برمجة برتقال نهر ليل ماء برمجة باب') == 4", "assert lead_count('لغة سماء برتقال سماء') == 1", "assert lead_count('عربية كتاب طائرة بيت بحر دفتر عربية') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('دفتر سيارة برمجة سيارة') == 1\nassert lead_count('سوق بحر برمجة حديقة سوق') == 2\nassert lead_count('برتقال مطر قمر صحراء حديقة ليل بيت') == 2\nassert lead_count('عربية برمجة برتقال نهر ليل ماء برمجة باب') == 4\nassert lead_count('لغة سماء برتقال سماء') == 1\nassert lead_count('عربية كتاب طائرة بيت بحر دفتر عربية') == 2\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": "1965fcfa9cb18721"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 38) == 1)", "tests": ["assert coprime_count(102) == 48", "assert coprime_count(2) == 1", "assert coprime_count(32) == 15", "assert coprime_count(5) == 3", "assert coprime_count(25) == 12", "assert coprime_count(70) == 33", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(102) == 48\nassert coprime_count(2) == 1\nassert coprime_count(32) == 15\nassert coprime_count(5) == 3\nassert coprime_count(25) == 12\nassert coprime_count(70) == 33\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, 38) == 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, 38) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 38) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(102)` يُرجع `48`.\nالجواب:", "qhash": "beb232df39a19a5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 1:\n return 5\n return 1 * rec(n - 1) + 1\n\nprint(rec(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 1:\n return 5\n return 1 * rec(n - 1) + 1\n\nprint(rec(4))\n```\nالجواب:", "qhash": "7e277915e4a45a6a", "answer": "8", "completion": " الناتج:\n```text\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(-2, 8))", "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(-2, 8))\n```\nالجواب:", "qhash": "1905990a51545c53", "answer": "256", "completion": " الناتج:\n```text\n256\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 32493\ncount = 0\nwhile x > 13:\n x = x // 8\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 32493\ncount = 0\nwhile x > 13:\n x = x // 8\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "ff8a925ed7a370a3", "answer": "7 4", "completion": " الناتج:\n```text\n7 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78", "tests": ["assert pow_digits(98273) == 51", "assert pow_digits(900847) == 54", "assert pow_digits(367786) == 9", "assert pow_digits(838724) == 50", "assert pow_digits(715387) == 41", "assert pow_digits(841455) == 69", "assert pow_digits(778149) == 26", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(98273) == 51\nassert pow_digits(900847) == 54\nassert pow_digits(367786) == 9\nassert pow_digits(838724) == 50\nassert pow_digits(715387) == 41\nassert pow_digits(841455) == 69\nassert pow_digits(778149) == 26\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 78.\nمثال: `pow_digits(98273)` يجب أن تُرجع `51`.\nالجواب:", "qhash": "e547d84d5ea48b9b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 43)", "tests": ["assert in_range_scaled([8, 8, 30, 30, 9]) == [60, 60]", "assert in_range_scaled([17, 49, 45, 46, 2, 44]) == [34]", "assert in_range_scaled([6, -29, -7, 38, 17, 10, 13, 49, -2]) == [20, 26, 34, 76]", "assert in_range_scaled([1, -15, 7, 60, -16, -29, -19, -19, -12, 58]) == []", "assert in_range_scaled([16, -6, -24, -29, 11, 24, 30, 35, 47, 17]) == [22, 32, 34, 48, 60, 70]", "assert in_range_scaled([60, 14, -3, 52]) == [28]", "assert in_range_scaled([-12, 22, 59, -29, 46, 55, -8]) == [44]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([8, 8, 30, 30, 9]) == [60, 60]\nassert in_range_scaled([17, 49, 45, 46, 2, 44]) == [34]\nassert in_range_scaled([6, -29, -7, 38, 17, 10, 13, 49, -2]) == [20, 26, 34, 76]\nassert in_range_scaled([1, -15, 7, 60, -16, -29, -19, -19, -12, 58]) == []\nassert in_range_scaled([16, -6, -24, -29, 11, 24, 30, 35, 47, 17]) == [22, 32, 34, 48, 60, 70]\nassert in_range_scaled([60, 14, -3, 52]) == [28]\nassert in_range_scaled([-12, 22, 59, -29, 46, 55, -8]) == [44]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 43)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 43)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و43 (شاملًا الطرفين) في 2.\nمثال: `in_range_scaled([8, 8, 30, 30, 9])` يجب أن تُرجع `[60, 60]`.\nالجواب:", "qhash": "19d206f5564d5940"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert backwards('is in banana brain engine') == 'engine brain banana'", "assert backwards('code summer it light') == 'light summer'", "assert backwards('rocket river cloud python stone desert by') == 'desert stone python cloud river rocket'", "assert backwards('data python engine on to falcon planet') == 'planet falcon engine python'", "assert backwards('signal') == 'signal'", "assert backwards('an in of on') == ''", "assert backwards('vector up apple apple up window light') == 'light window apple apple vector'"], "test_code": "assert backwards('is in banana brain engine') == 'engine brain banana'\nassert backwards('code summer it light') == 'light summer'\nassert backwards('rocket river cloud python stone desert by') == 'desert stone python cloud river rocket'\nassert backwards('data python engine on to falcon planet') == 'planet falcon engine python'\nassert backwards('signal') == 'signal'\nassert backwards('an in of on') == ''\nassert backwards('vector up apple apple up window light') == 'light window apple apple vector'", "answer": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `backwards('is in banana brain engine')` يُرجع `'engine brain banana'`.\nالجواب:", "qhash": "6d85b05fd615b0f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert cycle([27, 34, 20, 34, 46]) == [46, 27, 34, 20, 34]", "assert cycle([28, -7, 36, 48, 47]) == [47, 28, -7, 36, 48]", "assert cycle([18, 1]) == [18, 1]", "assert cycle([40, 17, 33, 10, 15, 39]) == [15, 39, 40, 17, 33, 10]", "assert cycle([31, 23, 9, 38, 27]) == [27, 31, 23, 9, 38]", "assert cycle([21, 32, 25, 15, 8, -6, -9, 44, -4, 19, -2, 31]) == [8, -6, -9, 44, -4, 19, -2, 31, 21, 32, 25, 15]", "assert cycle([]) == []"], "test_code": "assert cycle([27, 34, 20, 34, 46]) == [46, 27, 34, 20, 34]\nassert cycle([28, -7, 36, 48, 47]) == [47, 28, -7, 36, 48]\nassert cycle([18, 1]) == [18, 1]\nassert cycle([40, 17, 33, 10, 15, 39]) == [15, 39, 40, 17, 33, 10]\nassert cycle([31, 23, 9, 38, 27]) == [27, 31, 23, 9, 38]\nassert cycle([21, 32, 25, 15, 8, -6, -9, 44, -4, 19, -2, 31]) == [8, -6, -9, 44, -4, 19, -2, 31, 21, 32, 25, 15]\nassert cycle([]) == []", "answer": "def cycle(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef cycle(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return ____\n```\nمثال: `cycle([27, 34, 20, 34, 46])` يجب أن تُرجع `[46, 27, 34, 20, 34]`.\nالجواب:", "qhash": "e474ecfe3760b486"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 7 for x in range(-1, 5) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 7 for x in range(-1, 5) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "240d3c5579c6f6ba", "answer": "[-6]\n1 -6", "completion": " الناتج:\n```text\n[-6]\n1 -6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23", "tests": ["assert sum_digit_pow(61693) == 2", "assert sum_digit_pow(86877) == 13", "assert sum_digit_pow(432392) == 0", "assert sum_digit_pow(397923) == 10", "assert sum_digit_pow(702149) == 0", "assert sum_digit_pow(427926) == 7", "assert sum_digit_pow(764019) == 4", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(61693) == 2\nassert sum_digit_pow(86877) == 13\nassert sum_digit_pow(432392) == 0\nassert sum_digit_pow(397923) == 10\nassert sum_digit_pow(702149) == 0\nassert sum_digit_pow(427926) == 7\nassert sum_digit_pow(764019) == 4\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 23.\nمثال: `sum_digit_pow(61693)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "99537fc77a8cab76"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('at window we planet at by brain in') == 'planet/window'", "assert rev_join('rocket falcon light on matrix by go in') == 'matrix/falcon/rocket'", "assert rev_join('code up orange an up') == 'orange'", "assert rev_join('banana on to winter go brain garden pixel') == 'garden/winter/banana'", "assert rev_join('window') == 'window'", "assert rev_join('brain up up python') == 'python'", "assert rev_join('brain signal coffee') == 'coffee/signal'"], "test_code": "assert rev_join('at window we planet at by brain in') == 'planet/window'\nassert rev_join('rocket falcon light on matrix by go in') == 'matrix/falcon/rocket'\nassert rev_join('code up orange an up') == 'orange'\nassert rev_join('banana on to winter go brain garden pixel') == 'garden/winter/banana'\nassert rev_join('window') == 'window'\nassert rev_join('brain up up python') == 'python'\nassert rev_join('brain signal coffee') == 'coffee/signal'", "answer": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `rev_join('at window we planet at by brain in')` يُرجع `'planet/window'`.\nالجواب:", "qhash": "1a95f3c227632fbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('a to planet we') == 'planet'", "assert rev_long_words('we pixel rocket signal at') == 'signal,rocket,pixel'", "assert rev_long_words('signal summer in garden') == 'garden,summer,signal'", "assert rev_long_words('') == ''", "assert rev_long_words('an stone in stone signal banana winter table') == 'table,winter,banana,signal,stone,stone'", "assert rev_long_words('by window on desert up river to') == 'river,desert,window'", "assert rev_long_words('river engine matrix orange it apple pixel') == 'pixel,apple,orange,matrix,engine,river'"], "test_code": "assert rev_long_words('a to planet we') == 'planet'\nassert rev_long_words('we pixel rocket signal at') == 'signal,rocket,pixel'\nassert rev_long_words('signal summer in garden') == 'garden,summer,signal'\nassert rev_long_words('') == ''\nassert rev_long_words('an stone in stone signal banana winter table') == 'table,winter,banana,signal,stone,stone'\nassert rev_long_words('by window on desert up river to') == 'river,desert,window'\nassert rev_long_words('river engine matrix orange it apple pixel') == 'pixel,apple,orange,matrix,engine,river'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_long_words('a to planet we')` يُرجع `'planet'`.\nالجواب:", "qhash": "774720010bdb7f53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [10, 21, -3, -9, 13, 31, 30]\nprint(a[0:2])\nprint(a[::3])\nprint(max(a[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [10, 21, -3, -9, 13, 31, 30]\nprint(a[0:2])\nprint(a[::3])\nprint(max(a[0:2]))\n```\nالجواب:", "qhash": "4bf5b76a60b1c72d", "answer": "[10, 21]\n[10, -9, 30]\n21", "completion": " الناتج:\n```text\n[10, 21]\n[10, -9, 30]\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * -1 + -7 for x in range(-1, 14) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * -1 + -7 for x in range(-1, 14) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e2024a84a2e96fb6", "answer": "[-8, -11, -14, -17, -20]\n5 -70", "completion": " الناتج:\n```text\n[-8, -11, -14, -17, -20]\n5 -70\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([-3, 3, 31, 21, 29, 36, 58]) == None", "assert max_multiple([-16, -24, -24]) == -16", "assert max_multiple([1, 9]) == None", "assert max_multiple([27, 35, 26, 39, -37, 12]) == None", "assert max_multiple([-3, 3, -44, -26, 40, 42]) == 40", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-3, 3, 31, 21, 29, 36, 58]) == None\nassert max_multiple([-16, -24, -24]) == -16\nassert max_multiple([1, 9]) == None\nassert max_multiple([27, 35, 26, 39, -37, 12]) == None\nassert max_multiple([-3, 3, -44, -26, 40, 42]) == 40\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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للتوضيح: الاستدعاء `max_multiple([-3, 3, 31, 21, 29, 36, 58])` يُرجع `None`.\nالجواب:", "qhash": "b4c004ad7fe3270a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [4, 6, 15, -4, 10]\nprint(items[2:4])\nprint(items[::-1])\nprint(max(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [4, 6, 15, -4, 10]\nprint(items[2:4])\nprint(items[::-1])\nprint(max(items[2:4]))\n```\nالجواب:", "qhash": "6fa53249c2931ddf", "answer": "[15, -4]\n[10, -4, 15, 6, 4]\n15", "completion": " الناتج:\n```text\n[15, -4]\n[10, -4, 15, 6, 4]\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "tests": ["assert weighted_sum(5) == 4895", "assert weighted_sum(8) == 43860", "assert weighted_sum(9) == 76665", "assert weighted_sum(6) == 11375", "assert weighted_sum(6) == 11375", "assert weighted_sum(1) == 5", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 4895\nassert weighted_sum(8) == 43860\nassert weighted_sum(9) == 76665\nassert weighted_sum(6) == 11375\nassert weighted_sum(6) == 11375\nassert weighted_sum(1) == 5\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `4895`.\nالجواب:", "qhash": "06e38efdf2dd63f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert total_pow(4) == 2832", "assert total_pow(5) == 7832", "assert total_pow(11) == 319792", "assert total_pow(9) == 122664", "assert total_pow(0) == 0", "assert total_pow(1) == 8", "assert total_pow(0) == 0"], "test_code": "assert total_pow(4) == 2832\nassert total_pow(5) == 7832\nassert total_pow(11) == 319792\nassert total_pow(9) == 122664\nassert total_pow(0) == 0\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 ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `total_pow(4)` يُرجع `2832`.\nالجواب:", "qhash": "4ce361fc82538db8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سماء بيت علم صديق ليل') == 0", "assert lead_count('سيارة شجرة') == 0", "assert lead_count('برتقال رمل رمل سماء قمر جمل') == 2", "assert lead_count('مدرسة باب') == 0", "assert lead_count('بيت برمجة حديقة صديق جمل') == 0", "assert lead_count('قلم كتاب رمل رمل رمل شمس دفتر ماء') == 3", "assert lead_count('') == 0"], "test_code": "assert lead_count('سماء بيت علم صديق ليل') == 0\nassert lead_count('سيارة شجرة') == 0\nassert lead_count('برتقال رمل رمل سماء قمر جمل') == 2\nassert lead_count('مدرسة باب') == 0\nassert lead_count('بيت برمجة حديقة صديق جمل') == 0\nassert lead_count('قلم كتاب رمل رمل رمل شمس دفتر ماء') == 3\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.split():\n if w.endswith('ر'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ر». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ر'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('سماء بيت علم صديق ليل')` يُرجع `0`.\nالجواب:", "qhash": "47871fb2f0e5c8b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 11", "tests": ["assert sum_digit_pow(72928) == 0", "assert sum_digit_pow(161343) == 0", "assert sum_digit_pow(115920) == 10", "assert sum_digit_pow(435872) == 6", "assert sum_digit_pow(329248) == 4", "assert sum_digit_pow(164530) == 4", "assert sum_digit_pow(226143) == 5", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(72928) == 0\nassert sum_digit_pow(161343) == 0\nassert sum_digit_pow(115920) == 10\nassert sum_digit_pow(435872) == 6\nassert sum_digit_pow(329248) == 4\nassert sum_digit_pow(164530) == 4\nassert sum_digit_pow(226143) == 5\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 11", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 11.\nمثال: `sum_digit_pow(72928)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "278b09ff4f70f66f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=1):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(calc(13))\nprint(calc(13, -5))\nprint(calc(calc(-5), 13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=1):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(calc(13))\nprint(calc(13, -5))\nprint(calc(calc(-5), 13))\n```\nالجواب:", "qhash": "5ee8f83cd2e10c5c", "answer": "25\n31\n23", "completion": " الناتج:\n```text\n25\n31\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'ليل مدرسة'\nprint(len(s.replace(' ', '')))\nprint(s.replace(' ', '-'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'ليل مدرسة'\nprint(len(s.replace(' ', '')))\nprint(s.replace(' ', '-'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "adf2c1ea363b6037", "answer": "8\nليل-مدرسة\nةسردم ليل", "completion": " الناتج:\n```text\n8\nليل-مدرسة\nةسردم ليل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Foo'\n if i % 10 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(24) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22', '23', '24']", "assert game(16) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16']", "assert game(17) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17']", "assert game(23) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22', '23']", "assert game(7) == ['1', '2', '3', '4', 'Foo', '6', '7']"], "test_code": "assert game(24) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22', '23', '24']\nassert game(16) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16']\nassert game(17) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17']\nassert game(23) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22', '23']\nassert game(7) == ['1', '2', '3', '4', 'Foo', '6', '7']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Foo'، وعلى 10 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(24)` يجب أن تُرجع `['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22', '23', '24']`.\nالجواب:", "qhash": "831fbfef6008d8a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -5 * x ** 2 + (-3) * x + (3)", "tests": ["assert evaluate(7) == -263", "assert evaluate(16) == -1325", "assert evaluate(-12) == -681", "assert evaluate(15) == -1167", "assert evaluate(18) == -1671", "assert evaluate(4) == -89", "assert evaluate(-16) == -1229", "assert evaluate(0) == 3"], "test_code": "assert evaluate(7) == -263\nassert evaluate(16) == -1325\nassert evaluate(-12) == -681\nassert evaluate(15) == -1167\nassert evaluate(18) == -1671\nassert evaluate(4) == -89\nassert evaluate(-16) == -1229\nassert evaluate(0) == 3", "answer": "def evaluate(x):\n return -5 * x ** 2 + (-3) * x + (3)", "completion": " ```python\ndef evaluate(x):\n return -5 * x ** 2 + (-3) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -5x² - 3x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(7)` يُرجع `-263`.\nالجواب:", "qhash": "e60d61f3375a5ac9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'حسن': 9, 'زينب': 37, 'علي': 9, 'نور': 36, 'راشد': 47}\nd['علي'] += 14\nd['هشام'] = 13\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('منى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'حسن': 9, 'زينب': 37, 'علي': 9, 'نور': 36, 'راشد': 47}\nd['علي'] += 14\nd['هشام'] = 13\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('منى', -1))\n```\nالجواب:", "qhash": "f454f9070c2fcdd4", "answer": "6\nراشد\n165\n-1", "completion": " الناتج:\n```text\n6\nراشد\n165\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'حسن': 22, 'زينب': 14, 'يوسف': 18, 'سعيد': 41, 'فيصل': 2}\nd['يوسف'] += 12\nd['سلمى'] = 47\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 = {'حسن': 22, 'زينب': 14, 'يوسف': 18, 'سعيد': 41, 'فيصل': 2}\nd['يوسف'] += 12\nd['سلمى'] = 47\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": "58585f47a86dd426", "answer": "6\nسلمى\n156\n[('فيصل', 2), ('زينب', 14)]", "completion": " الناتج:\n```text\n6\nسلمى\n156\n[('فيصل', 2), ('زينب', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-10, -15, 31, 16, -2, 36, 37, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 17), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-10, -15, 31, 16, -2, 36, 37, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 17), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "67282346be30480e", "answer": "[16, 18, 31, -2, 36, 37, -10, -15]\n[37, 36, 31]", "completion": " الناتج:\n```text\n[16, 18, 31, -2, 36, 37, -10, -15]\n[37, 36, 31]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -5 for x in xs if -20 <= x <= 16)", "tests": ["assert filter_range([25, 5, 5, 14]) == [-70, -25, -25]", "assert filter_range([]) == []", "assert filter_range([36, 52, -20, 4, -18]) == [-20, 90, 100]", "assert filter_range([26, -3, -24, 42]) == [15]", "assert filter_range([42, 28, -4, 36, -17, 57, 49, 4, -14, -22]) == [-20, 20, 70, 85]", "assert filter_range([16, 24, 1, 48, 47, -24]) == [-80, -5]", "assert filter_range([31, 43, 35, -29]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([25, 5, 5, 14]) == [-70, -25, -25]\nassert filter_range([]) == []\nassert filter_range([36, 52, -20, 4, -18]) == [-20, 90, 100]\nassert filter_range([26, -3, -24, 42]) == [15]\nassert filter_range([42, 28, -4, 36, -17, 57, 49, 4, -14, -22]) == [-20, 20, 70, 85]\nassert filter_range([16, 24, 1, 48, 47, -24]) == [-80, -5]\nassert filter_range([31, 43, 35, -29]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -5 for x in xs if -20 <= x <= 16)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -5 for x in xs if -20 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -20 و16 (شاملًا الطرفين) في -5.\nمثال: `filter_range([25, 5, 5, 14])` يجب أن تُرجع `[-70, -25, -25]`.\nالجواب:", "qhash": "562431a71537b6b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'معلم مطر'\nprint(text[0])\nprint(text.count('م'))\nprint('م' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'معلم مطر'\nprint(text[0])\nprint(text.count('م'))\nprint('م' in text)\n```\nالجواب:", "qhash": "ac856b61f1bdcdc0", "answer": "م\n3\nTrue", "completion": " الناتج:\n```text\nم\n3\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'an'}", "tests": ["assert count_chars('it') == {'a': 0, 'n': 0}", "assert count_chars('an cloud pixel by camel') == {'a': 2, 'n': 1}", "assert count_chars('python apple go') == {'a': 1, 'n': 1}", "assert count_chars('camel') == {'a': 1, 'n': 0}", "assert count_chars('in') == {'a': 0, 'n': 1}", "assert count_chars('signal') == {'a': 1, 'n': 1}", "assert count_chars('') == {'a': 0, 'n': 0}"], "test_code": "assert count_chars('it') == {'a': 0, 'n': 0}\nassert count_chars('an cloud pixel by camel') == {'a': 2, 'n': 1}\nassert count_chars('python apple go') == {'a': 1, 'n': 1}\nassert count_chars('camel') == {'a': 1, 'n': 0}\nassert count_chars('in') == {'a': 0, 'n': 1}\nassert count_chars('signal') == {'a': 1, 'n': 1}\nassert count_chars('') == {'a': 0, 'n': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'an'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'an'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'n' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('it')` يُرجع `{'a': 0, 'n': 0}`.\nالجواب:", "qhash": "ca3b19f40c6a4cee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert sum_terms(3) == 396", "assert sum_terms(5) == 2475", "assert sum_terms(10) == 33275", "assert sum_terms(1) == 11", "assert sum_terms(4) == 1100", "assert sum_terms(1) == 11", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 396\nassert sum_terms(5) == 2475\nassert sum_terms(10) == 33275\nassert sum_terms(1) == 11\nassert sum_terms(4) == 1100\nassert sum_terms(1) == 11\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total\n```\nمثال: `sum_terms(3)` يجب أن تُرجع `396`.\nالجواب:", "qhash": "94569927725ecd0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('brain to brain at banana cloud it') == 'cloud banana brain brain'", "assert flip_words('music stone a vector garden brain matrix go') == 'matrix brain garden vector stone music'", "assert flip_words('coffee cloud music is go on garden at') == 'garden music cloud coffee'", "assert flip_words('stone data river camel orange matrix code of') == 'code matrix orange camel river data stone'", "assert flip_words('pixel window coffee to matrix pixel') == 'pixel matrix coffee window pixel'", "assert flip_words('') == ''", "assert flip_words('') == ''"], "test_code": "assert flip_words('brain to brain at banana cloud it') == 'cloud banana brain brain'\nassert flip_words('music stone a vector garden brain matrix go') == 'matrix brain garden vector stone music'\nassert flip_words('coffee cloud music is go on garden at') == 'garden music cloud coffee'\nassert flip_words('stone data river camel orange matrix code of') == 'code matrix orange camel river data stone'\nassert flip_words('pixel window coffee to matrix pixel') == 'pixel matrix coffee window pixel'\nassert flip_words('') == ''\nassert flip_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `flip_words('brain to brain at banana cloud it')` يُرجع `'cloud banana brain brain'`.\nالجواب:", "qhash": "2174d0a6ab8eca87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert sum_terms(5) == 120", "assert sum_terms(5) == 120", "assert sum_terms(6) == 168", "assert sum_terms(4) == 80", "assert sum_terms(12) == 624", "assert sum_terms(1) == 8", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(5) == 120\nassert sum_terms(5) == 120\nassert sum_terms(6) == 168\nassert sum_terms(4) == 80\nassert sum_terms(12) == 624\nassert sum_terms(1) == 8\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(5)` يُرجع `120`.\nالجواب:", "qhash": "78fc18049b439dee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 7\nfor j in range(4, 17, 2):\n acc += j * 9\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 7\nfor j in range(4, 17, 2):\n acc += j * 9\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "a68467215b217e3c", "answer": "637\n16", "completion": " الناتج:\n```text\n637\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([27, -25, 13, -26, -18, 60, -3, 7, 43]) == 7", "assert max_of_div([-14, -28, -7]) == -7", "assert max_of_div([1, 8, 15, 22]) == None", "assert max_of_div([24, -32, -12, 8, 18, -35, -29, -17, -15]) == -35", "assert max_of_div([-24, 40, -40, 36]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([27, -25, 13, -26, -18, 60, -3, 7, 43]) == 7\nassert max_of_div([-14, -28, -7]) == -7\nassert max_of_div([1, 8, 15, 22]) == None\nassert max_of_div([24, -32, -12, 8, 18, -35, -29, -17, -15]) == -35\nassert max_of_div([-24, 40, -40, 36]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_of_div([27, -25, 13, -26, -18, 60, -3, 7, 43])` يجب أن تُرجع `7`.\nالجواب:", "qhash": "8a84596ebf90b11a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert total_multiples(243) == 4920", "assert total_multiples(133) == 1518", "assert total_multiples(158) == 2106", "assert total_multiples(151) == 1950", "assert total_multiples(162) == 2106", "assert total_multiples(169) == 2436", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(243) == 4920\nassert total_multiples(133) == 1518\nassert total_multiples(158) == 2106\nassert total_multiples(151) == 1950\nassert total_multiples(162) == 2106\nassert total_multiples(169) == 2436\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 12.\nمثال: `total_multiples(243)` يجب أن تُرجع `4920`.\nالجواب:", "qhash": "a138654aba174d17"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_sel([47, 65, 39, 12, 26, 15, 60, 13, 77, 50, 79]) == 4", "assert count_sel([66]) == 1", "assert count_sel([65, 23, 81, 71, -33, 74, 38, 59, -37, 77, -28, 7]) == 2", "assert count_sel([-35, 86, -25]) == 0", "assert count_sel([-14, -27, -15, 10, -23, -9]) == 3", "assert count_sel([10, 23, 52, 23]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([47, 65, 39, 12, 26, 15, 60, 13, 77, 50, 79]) == 4\nassert count_sel([66]) == 1\nassert count_sel([65, 23, 81, 71, -33, 74, 38, 59, -37, 77, -28, 7]) == 2\nassert count_sel([-35, 86, -25]) == 0\nassert count_sel([-14, -27, -15, 10, -23, -9]) == 3\nassert count_sel([10, 23, 52, 23]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([47, 65, 39, 12, 26, 15, 60, 13, 77, 50, 79])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "6783a26e7230e04a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['river', 'summer', 'light', 'planet', 'camel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['river', 'summer', 'light', 'planet', 'camel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "f8e04b99a4d14896", "answer": "['river', 'light', 'camel', 'summer', 'planet']\n['summer', 'planet', 'river']", "completion": " الناتج:\n```text\n['river', 'light', 'camel', 'summer', 'planet']\n['summer', 'planet', 'river']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 144:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([39, 13, 25, 53, 7, 11, 5, 73, 43, 36]) == [39, 52, 77, 130, 137, 0, 5, 78, 121, 0]", "assert reset_sum([142, 41, 27, 129, 72, 79]) == [142, 0, 27, 0, 72, 0]", "assert reset_sum([-1, 44, 55, -9, 64]) == [-1, 43, 98, 89, 0]", "assert reset_sum([76, 23, 111, 45, 60]) == [76, 99, 0, 45, 105]", "assert reset_sum([45, 128, 78, 97]) == [45, 0, 78, 0]", "assert reset_sum([]) == []", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([39, 13, 25, 53, 7, 11, 5, 73, 43, 36]) == [39, 52, 77, 130, 137, 0, 5, 78, 121, 0]\nassert reset_sum([142, 41, 27, 129, 72, 79]) == [142, 0, 27, 0, 72, 0]\nassert reset_sum([-1, 44, 55, -9, 64]) == [-1, 43, 98, 89, 0]\nassert reset_sum([76, 23, 111, 45, 60]) == [76, 99, 0, 45, 105]\nassert reset_sum([45, 128, 78, 97]) == [45, 0, 78, 0]\nassert reset_sum([]) == []\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 144:\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 > 144:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 144 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([39, 13, 25, 53, 7, 11, 5, 73, 43, 36])` يُرجع `[39, 52, 77, 130, 137, 0, 5, 78, 121, 0]`.\nالجواب:", "qhash": "a54c24176bddfd47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -1 * x ** 2 + (2) * x + (5)", "tests": ["assert eval_poly(9) == -58", "assert eval_poly(1) == 6", "assert eval_poly(-7) == -58", "assert eval_poly(-14) == -219", "assert eval_poly(1) == 6", "assert eval_poly(-20) == -435", "assert eval_poly(1) == 6", "assert eval_poly(0) == 5"], "test_code": "assert eval_poly(9) == -58\nassert eval_poly(1) == 6\nassert eval_poly(-7) == -58\nassert eval_poly(-14) == -219\nassert eval_poly(1) == 6\nassert eval_poly(-20) == -435\nassert eval_poly(1) == 6\nassert eval_poly(0) == 5", "answer": "def eval_poly(x):\n return -1 * x ** 2 + (2) * x + (5)", "completion": " ```python\ndef eval_poly(x):\n return -1 * x ** 2 + (2) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -1x² + 2x + 5 عند العدد الصحيح x.\nمثال: `eval_poly(9)` يجب أن تُرجع `-58`.\nالجواب:", "qhash": "609210735416a101"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 13 == 0)", "tests": ["assert add_multiples(288) == 22165", "assert add_multiples(17) == 85", "assert add_multiples(59) == 922", "assert add_multiples(101) == 2758", "assert add_multiples(112) == 3288", "assert add_multiples(130) == 4485", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(288) == 22165\nassert add_multiples(17) == 85\nassert add_multiples(59) == 922\nassert add_multiples(101) == 2758\nassert add_multiples(112) == 3288\nassert add_multiples(130) == 4485\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 13 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 13.\nمثال: `add_multiples(288)` يجب أن تُرجع `22165`.\nالجواب:", "qhash": "dcef2b8257848235"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [27, 20, -9, 9, 6, 37, 10, -8, 11]\nprint(a[1:3])\nprint(a[::-2])\nprint(min(a[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [27, 20, -9, 9, 6, 37, 10, -8, 11]\nprint(a[1:3])\nprint(a[::-2])\nprint(min(a[1:3]))\n```\nالجواب:", "qhash": "452fbe6e5013f954", "answer": "[20, -9]\n[11, 10, 6, -9, 27]\n-9", "completion": " الناتج:\n```text\n[20, -9]\n[11, 10, 6, -9, 27]\n-9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 19\nfor j in range(7, 30, 3):\n total -= j * 6\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 19\nfor j in range(7, 30, 3):\n total -= j * 6\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "973555a0352068ab", "answer": "-821\n28", "completion": " الناتج:\n```text\n-821\n28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('in data falcon brain signal to is') == 'is,to,signal,brain,falcon,data,in'", "assert invert_words('planet apple falcon code desert engine falcon') == 'falcon,engine,desert,code,falcon,apple,planet'", "assert invert_words('on window brain') == 'brain,window,on'", "assert invert_words('river table apple up') == 'up,apple,table,river'", "assert invert_words('') == ''", "assert invert_words('garden on') == 'on,garden'", "assert invert_words('of stone data engine on planet at') == 'at,planet,on,engine,data,stone,of'"], "test_code": "assert invert_words('in data falcon brain signal to is') == 'is,to,signal,brain,falcon,data,in'\nassert invert_words('planet apple falcon code desert engine falcon') == 'falcon,engine,desert,code,falcon,apple,planet'\nassert invert_words('on window brain') == 'brain,window,on'\nassert invert_words('river table apple up') == 'up,apple,table,river'\nassert invert_words('') == ''\nassert invert_words('garden on') == 'on,garden'\nassert invert_words('of stone data engine on planet at') == 'at,planet,on,engine,data,stone,of'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `invert_words('in data falcon brain signal to is')` يُرجع `'is,to,signal,brain,falcon,data,in'`.\nالجواب:", "qhash": "ea71ad3bedd379c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([50, 18, -22, 18, 22]) == 18", "assert find_max_div([-9, -15, -3]) == -3", "assert find_max_div([1, 4, 7]) == None", "assert find_max_div([-16, -36, -38]) == -36", "assert find_max_div([37, -34, -49, -24, -7, -38, 20]) == -24", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([50, 18, -22, 18, 22]) == 18\nassert find_max_div([-9, -15, -3]) == -3\nassert find_max_div([1, 4, 7]) == None\nassert find_max_div([-16, -36, -38]) == -36\nassert find_max_div([37, -34, -49, -24, -7, -38, 20]) == -24\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(nums):\n best = 0\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 find_max_div(nums):\n best = 0\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مثال: `find_max_div([50, 18, -22, 18, 22])` يجب أن تُرجع `18`.\nالجواب:", "qhash": "9d5a4c65d03cd075"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert sum_powers(5) == 22125", "assert sum_powers(4) == 6500", "assert sum_powers(4) == 6500", "assert sum_powers(10) == 1104125", "assert sum_powers(0) == 0", "assert sum_powers(1) == 5", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 22125\nassert sum_powers(4) == 6500\nassert sum_powers(4) == 6500\nassert sum_powers(10) == 1104125\nassert sum_powers(0) == 0\nassert sum_powers(1) == 5\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(5)` يُرجع `22125`.\nالجواب:", "qhash": "1d482554555eeddf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'brain_cloud'\nprint(word.find('u'))\nprint(word.count('u'))\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'brain_cloud'\nprint(word.find('u'))\nprint(word.count('u'))\nprint(word.split('_'))\n```\nالجواب:", "qhash": "d439382b9f1723b8", "answer": "9\n1\n['brain', 'cloud']", "completion": " الناتج:\n```text\n9\n1\n['brain', 'cloud']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['river', 'summer', 'matrix', 'coffee', 'camel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['river', 'summer', 'matrix', 'coffee', 'camel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "df757ab66109760d", "answer": "['river', 'camel', 'summer', 'matrix', 'coffee']\n['summer', 'matrix', 'coffee']", "completion": " الناتج:\n```text\n['river', 'camel', 'summer', 'matrix', 'coffee']\n['summer', 'matrix', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 20\nfor i in range(-2, 12, 2):\n total += i * 7\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 20\nfor i in range(-2, 12, 2):\n total += i * 7\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "0d08d533dde82f45", "answer": "216\n10", "completion": " الناتج:\n```text\n216\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'bgm'}", "tests": ["assert tally('river') == {'b': 0, 'g': 0, 'm': 0}", "assert tally('orange we to') == {'b': 0, 'g': 1, 'm': 0}", "assert tally('coffee an winter') == {'b': 0, 'g': 0, 'm': 0}", "assert tally('a pixel vector pixel window') == {'b': 0, 'g': 0, 'm': 0}", "assert tally('matrix falcon cloud pixel go planet') == {'b': 0, 'g': 1, 'm': 1}", "assert tally('desert we') == {'b': 0, 'g': 0, 'm': 0}", "assert tally('') == {'b': 0, 'g': 0, 'm': 0}"], "test_code": "assert tally('river') == {'b': 0, 'g': 0, 'm': 0}\nassert tally('orange we to') == {'b': 0, 'g': 1, 'm': 0}\nassert tally('coffee an winter') == {'b': 0, 'g': 0, 'm': 0}\nassert tally('a pixel vector pixel window') == {'b': 0, 'g': 0, 'm': 0}\nassert tally('matrix falcon cloud pixel go planet') == {'b': 0, 'g': 1, 'm': 1}\nassert tally('desert we') == {'b': 0, 'g': 0, 'm': 0}\nassert tally('') == {'b': 0, 'g': 0, 'm': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'bgm'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'bgm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'g'، 'm' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('river')` يجب أن تُرجع `{'b': 0, 'g': 0, 'm': 0}`.\nالجواب:", "qhash": "eb0f2b88c979fffd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 48924\nc = 0\nwhile n > 19:\n n = n // 8\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 48924\nc = 0\nwhile n > 19:\n n = n // 8\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "2a0fab05188a352b", "answer": "11 4", "completion": " الناتج:\n```text\n11 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(9) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9']", "assert game(16) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping']", "assert game(5) == ['1', '2', '3', 'Ping', 'Pong']", "assert game(24) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23', 'Ping']", "assert game(18) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18']"], "test_code": "assert game(9) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9']\nassert game(16) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping']\nassert game(5) == ['1', '2', '3', 'Ping', 'Pong']\nassert game(24) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23', 'Ping']\nassert game(18) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\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 % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Ping'، وإن قَبِلها على 5 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(9)` يُرجع `['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9']`.\nالجواب:", "qhash": "763620162a7e5ab6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= -7)", "tests": ["assert filter_range([2, -12, -13, 0, -7]) == [-65, -60, -35]", "assert filter_range([52]) == []", "assert filter_range([]) == []", "assert filter_range([18, -29, -5, 7, 1, 57, 60, 25, 14, 48]) == []", "assert filter_range([-17, -8, 57, 24, 30, 9, 57, 56, -1]) == [-40]", "assert filter_range([37, 9, -14, -13, 11, 34, -9, -16]) == [-70, -65, -45]", "assert filter_range([33, 29]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([2, -12, -13, 0, -7]) == [-65, -60, -35]\nassert filter_range([52]) == []\nassert filter_range([]) == []\nassert filter_range([18, -29, -5, 7, 1, 57, 60, 25, 14, 48]) == []\nassert filter_range([-17, -8, 57, 24, 30, 9, 57, 56, -1]) == [-40]\nassert filter_range([37, 9, -14, -13, 11, 34, -9, -16]) == [-70, -65, -45]\nassert filter_range([33, 29]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= -7)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= -7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -14 و-7 (شاملًا الطرفين) في 5.\nمثال: `filter_range([2, -12, -13, 0, -7])` يجب أن تُرجع `[-65, -60, -35]`.\nالجواب:", "qhash": "ed03aa3637ece196"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(206) == 8013", "assert total_multiples(188) == 6834", "assert total_multiples(193) == 7215", "assert total_multiples(47) == 399", "assert total_multiples(91) == 1551", "assert total_multiples(199) == 7608", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(206) == 8013\nassert total_multiples(188) == 6834\nassert total_multiples(193) == 7215\nassert total_multiples(47) == 399\nassert total_multiples(91) == 1551\nassert total_multiples(199) == 7608\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 % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(206)` يُرجع `8013`.\nالجواب:", "qhash": "6c7a57f76c7d513d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'vector'\nprint(text.capitalize())\nprint(text.split('_'))\nprint(text.count('e'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'vector'\nprint(text.capitalize())\nprint(text.split('_'))\nprint(text.count('e'))\n```\nالجواب:", "qhash": "9923080dc22de954", "answer": "Vector\n['vector']\n1", "completion": " الناتج:\n```text\nVector\n['vector']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 36", "tests": ["assert digit_power(68410) == 25", "assert digit_power(185437) == 4", "assert digit_power(753318) == 15", "assert digit_power(850148) == 26", "assert digit_power(162724) == 4", "assert digit_power(76792) == 31", "assert digit_power(180140) == 26", "assert digit_power(0) == 0"], "test_code": "assert digit_power(68410) == 25\nassert digit_power(185437) == 4\nassert digit_power(753318) == 15\nassert digit_power(850148) == 26\nassert digit_power(162724) == 4\nassert digit_power(76792) == 31\nassert digit_power(180140) == 26\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 36", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 36\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 36.\nمثال: `digit_power(68410)` يجب أن تُرجع `25`.\nالجواب:", "qhash": "bbb02cded3b6c3fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_by([7, 34, 10, 30, 47, 21, 16]) == [30, 47, 21, 16, 7, 34, 10]", "assert rotate_by([22, 22, -5, 5, 45, 48, 1]) == [5, 45, 48, 1, 22, 22, -5]", "assert rotate_by([16, 42, 46]) == [16, 42, 46]", "assert rotate_by([46, 38, 39, 23, 19, 8, 28]) == [23, 19, 8, 28, 46, 38, 39]", "assert rotate_by([0, -8, 6, 19, 32, 11, 30, 45, 35, 0, 14]) == [32, 11, 30, 45, 35, 0, 14, 0, -8, 6, 19]", "assert rotate_by([47, 34, 47, 49, 17, 13]) == [47, 34, 47, 49, 17, 13]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([7, 34, 10, 30, 47, 21, 16]) == [30, 47, 21, 16, 7, 34, 10]\nassert rotate_by([22, 22, -5, 5, 45, 48, 1]) == [5, 45, 48, 1, 22, 22, -5]\nassert rotate_by([16, 42, 46]) == [16, 42, 46]\nassert rotate_by([46, 38, 39, 23, 19, 8, 28]) == [23, 19, 8, 28, 46, 38, 39]\nassert rotate_by([0, -8, 6, 19, 32, 11, 30, 45, 35, 0, 14]) == [32, 11, 30, 45, 35, 0, 14, 0, -8, 6, 19]\nassert rotate_by([47, 34, 47, 49, 17, 13]) == [47, 34, 47, 49, 17, 13]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return ____\n```\nمثال: `rotate_by([7, 34, 10, 30, 47, 21, 16])` يجب أن تُرجع `[30, 47, 21, 16, 7, 34, 10]`.\nالجواب:", "qhash": "e5a203d93db2e5aa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(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_div([-29, 7, -30, 37, -4, -3, 57, 53]) == -4", "assert max_div([-8, -8, -8]) == -8", "assert max_div([1, 5]) == None", "assert max_div([-15, 35, 25]) == None", "assert max_div([-17, -7, -49, 6, 24, -22]) == 24", "assert max_div([]) == None"], "test_code": "assert max_div([-29, 7, -30, 37, -4, -3, 57, 53]) == -4\nassert max_div([-8, -8, -8]) == -8\nassert max_div([1, 5]) == None\nassert max_div([-15, 35, 25]) == None\nassert max_div([-17, -7, -49, 6, 24, -22]) == 24\nassert max_div([]) == None", "answer": "def max_div(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_div(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_div(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_div(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_div([-29, 7, -30, 37, -4, -3, 57, 53])` يُرجع `-4`.\nالجواب:", "qhash": "0757a31cf63ef0e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -2 * x ** 2 + (0) * x + (-5)", "tests": ["assert p(5) == -55", "assert p(-4) == -37", "assert p(1) == -7", "assert p(-3) == -23", "assert p(-10) == -205", "assert p(-9) == -167", "assert p(-20) == -805", "assert p(0) == -5"], "test_code": "assert p(5) == -55\nassert p(-4) == -37\nassert p(1) == -7\nassert p(-3) == -23\nassert p(-10) == -205\nassert p(-9) == -167\nassert p(-20) == -805\nassert p(0) == -5", "answer": "def p(x):\n return -2 * x ** 2 + (0) * x + (-5)", "completion": " ```python\ndef p(x):\n return -2 * x ** 2 + (0) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -2x² + 0x - 5 عند العدد الصحيح x.\nمثال: `p(5)` يجب أن تُرجع `-55`.\nالجواب:", "qhash": "a2844bfa979554c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'chnr'}", "tests": ["assert count_chars('brain apple summer') == {'c': 0, 'h': 0, 'n': 1, 'r': 2}", "assert count_chars('cloud light') == {'c': 1, 'h': 1, 'n': 0, 'r': 0}", "assert count_chars('garden falcon summer') == {'c': 1, 'h': 0, 'n': 2, 'r': 2}", "assert count_chars('an up data it summer code') == {'c': 1, 'h': 0, 'n': 1, 'r': 1}", "assert count_chars('we on light river') == {'c': 0, 'h': 1, 'n': 1, 'r': 2}", "assert count_chars('planet banana we camel orange rocket') == {'c': 2, 'h': 0, 'n': 4, 'r': 2}", "assert count_chars('') == {'c': 0, 'h': 0, 'n': 0, 'r': 0}"], "test_code": "assert count_chars('brain apple summer') == {'c': 0, 'h': 0, 'n': 1, 'r': 2}\nassert count_chars('cloud light') == {'c': 1, 'h': 1, 'n': 0, 'r': 0}\nassert count_chars('garden falcon summer') == {'c': 1, 'h': 0, 'n': 2, 'r': 2}\nassert count_chars('an up data it summer code') == {'c': 1, 'h': 0, 'n': 1, 'r': 1}\nassert count_chars('we on light river') == {'c': 0, 'h': 1, 'n': 1, 'r': 2}\nassert count_chars('planet banana we camel orange rocket') == {'c': 2, 'h': 0, 'n': 4, 'r': 2}\nassert count_chars('') == {'c': 0, 'h': 0, 'n': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'chnr'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'chnr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'h'، 'n'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('brain apple summer')` يُرجع `{'c': 0, 'h': 0, 'n': 1, 'r': 2}`.\nالجواب:", "qhash": "7ffe913e2e3e9ece"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('stone it pixel camel') == 'dezyp te atipw nlxpw'", "assert rot('go 2024') == 'rz 2024'", "assert rot('planet') == 'awlype'", "assert rot('a OK') == 'l OK'", "assert rot('engine to cloud in light A1') == 'pyrtyp ez nwzfo ty wtrse A1'", "assert rot('cloud vector data') == 'nwzfo gpnezc olel'", "assert rot('') == ''"], "test_code": "assert rot('stone it pixel camel') == 'dezyp te atipw nlxpw'\nassert rot('go 2024') == 'rz 2024'\nassert rot('planet') == 'awlype'\nassert rot('a OK') == 'l OK'\nassert rot('engine to cloud in light A1') == 'pyrtyp ez nwzfo ty wtrse A1'\nassert rot('cloud vector data') == 'nwzfo gpnezc olel'\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 + (11)) % 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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('stone it pixel camel')` يجب أن تُرجع `'dezyp te atipw nlxpw'`.\nالجواب:", "qhash": "8babedd487df0150"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert roll([19, 35, 2, 24]) == [35, 2, 24, 19]", "assert roll([2, 14, 35, 44, 2, 0, -7, 19, 44]) == [44, 2, 14, 35, 44, 2, 0, -7, 19]", "assert roll([18, 47, -1, 33, 11, 34, 15, 40, 12, 40, -8, 5]) == [34, 15, 40, 12, 40, -8, 5, 18, 47, -1, 33, 11]", "assert roll([36, 33, 30, 17, 2, -3, 22, 22, 12]) == [12, 36, 33, 30, 17, 2, -3, 22, 22]", "assert roll([28, -1, 21, 48, 49, 16, 22]) == [48, 49, 16, 22, 28, -1, 21]", "assert roll([30, 18, 47, 32, -5, 41, 4, 29, -4]) == [-4, 30, 18, 47, 32, -5, 41, 4, 29]", "assert roll([]) == []"], "test_code": "assert roll([19, 35, 2, 24]) == [35, 2, 24, 19]\nassert roll([2, 14, 35, 44, 2, 0, -7, 19, 44]) == [44, 2, 14, 35, 44, 2, 0, -7, 19]\nassert roll([18, 47, -1, 33, 11, 34, 15, 40, 12, 40, -8, 5]) == [34, 15, 40, 12, 40, -8, 5, 18, 47, -1, 33, 11]\nassert roll([36, 33, 30, 17, 2, -3, 22, 22, 12]) == [12, 36, 33, 30, 17, 2, -3, 22, 22]\nassert roll([28, -1, 21, 48, 49, 16, 22]) == [48, 49, 16, 22, 28, -1, 21]\nassert roll([30, 18, 47, 32, -5, 41, 4, 29, -4]) == [-4, 30, 18, 47, 32, -5, 41, 4, 29]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `roll([19, 35, 2, 24])` يُرجع `[35, 2, 24, 19]`.\nالجواب:", "qhash": "69cb151333f73074"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bhs'}", "tests": ["assert freq_of('summer engine an') == {'b': 0, 'h': 0, 's': 1}", "assert freq_of('in camel orange') == {'b': 0, 'h': 0, 's': 0}", "assert freq_of('garden pixel an cloud orange') == {'b': 0, 'h': 0, 's': 0}", "assert freq_of('coffee orange falcon signal') == {'b': 0, 'h': 0, 's': 1}", "assert freq_of('on summer vector rocket camel') == {'b': 0, 'h': 0, 's': 1}", "assert freq_of('engine planet') == {'b': 0, 'h': 0, 's': 0}", "assert freq_of('') == {'b': 0, 'h': 0, 's': 0}"], "test_code": "assert freq_of('summer engine an') == {'b': 0, 'h': 0, 's': 1}\nassert freq_of('in camel orange') == {'b': 0, 'h': 0, 's': 0}\nassert freq_of('garden pixel an cloud orange') == {'b': 0, 'h': 0, 's': 0}\nassert freq_of('coffee orange falcon signal') == {'b': 0, 'h': 0, 's': 1}\nassert freq_of('on summer vector rocket camel') == {'b': 0, 'h': 0, 's': 1}\nassert freq_of('engine planet') == {'b': 0, 'h': 0, 's': 0}\nassert freq_of('') == {'b': 0, 'h': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bhs'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bhs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'h'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('summer engine an')` يُرجع `{'b': 0, 'h': 0, 's': 1}`.\nالجواب:", "qhash": "929c45a98d2ae3ad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -8 * x ** 2 + (0) * x + (-4)", "tests": ["assert eval_poly(5) == -204", "assert eval_poly(8) == -516", "assert eval_poly(-15) == -1804", "assert eval_poly(13) == -1356", "assert eval_poly(6) == -292", "assert eval_poly(-13) == -1356", "assert eval_poly(-7) == -396", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(5) == -204\nassert eval_poly(8) == -516\nassert eval_poly(-15) == -1804\nassert eval_poly(13) == -1356\nassert eval_poly(6) == -292\nassert eval_poly(-13) == -1356\nassert eval_poly(-7) == -396\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return -8 * x ** 2 + (0) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return -8 * x ** 2 + (0) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -8x² + 0x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(5)` يُرجع `-204`.\nالجواب:", "qhash": "31673fc7fb53cefd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [3, 19, 23, 3, 37, 40, -1, 17, 32]\nprint(nums[3:4])\nprint(nums[::-2])\nprint(min(nums[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [3, 19, 23, 3, 37, 40, -1, 17, 32]\nprint(nums[3:4])\nprint(nums[::-2])\nprint(min(nums[3:4]))\n```\nالجواب:", "qhash": "cf3efeb3187115e5", "answer": "[3]\n[32, -1, 37, 23, 3]\n3", "completion": " الناتج:\n```text\n[3]\n[32, -1, 37, 23, 3]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('لغة') == 0", "assert count_letter('نور صديق ليل') == 1", "assert count_letter('سماء') == 0", "assert count_letter('صحراء مدرسة سيارة حديقة حاسوب مطر رمل سوق') == 5", "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('نور صديق ليل') == 1\nassert count_letter('سماء') == 0\nassert count_letter('صحراء مدرسة سيارة حديقة حاسوب مطر رمل سوق') == 5\nassert count_letter('حصان خبز') == 0\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": "e5d9c261d3be018f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(2))\nprint(g(2, 8))\nprint(g(g(8), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(2))\nprint(g(2, 8))\nprint(g(g(8), 2))\n```\nالجواب:", "qhash": "538f5bf259549d9e", "answer": "-33\n-38\n-57", "completion": " الناتج:\n```text\n-33\n-38\n-57\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 1 for x in range(-5, 9) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 1 for x in range(-5, 9) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "b5a3a47c31995397", "answer": "[8, 3, 48]\n3 59", "completion": " الناتج:\n```text\n[8, 3, 48]\n3 59\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 1 for x in xs if 7 <= x <= 32)", "tests": ["assert select_range([36, 34, 40, 24, -2, 28, 38]) == [24, 28]", "assert select_range([]) == []", "assert select_range([]) == []", "assert select_range([]) == []", "assert select_range([57, 32, 16, 36, -8, -7]) == [16, 32]", "assert select_range([19, 32, 35, 40, 47, 52, -4, -1]) == [19, 32]", "assert select_range([-12, 30, 18, 44, 49, 52, -30]) == [18, 30]", "assert select_range([]) == []"], "test_code": "assert select_range([36, 34, 40, 24, -2, 28, 38]) == [24, 28]\nassert select_range([]) == []\nassert select_range([]) == []\nassert select_range([]) == []\nassert select_range([57, 32, 16, 36, -8, -7]) == [16, 32]\nassert select_range([19, 32, 35, 40, 47, 52, -4, -1]) == [19, 32]\nassert select_range([-12, 30, 18, 44, 49, 52, -30]) == [18, 30]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 1 for x in xs if 7 <= x <= 32)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 1 for x in xs if 7 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 7 و32 (شاملًا الطرفين) في 1.\nمثال: `select_range([36, 34, 40, 24, -2, 28, 38])` يجب أن تُرجع `[24, 28]`.\nالجواب:", "qhash": "2da74db48ba6d836"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [23, 27, -2, -2, 38, 35, 38, 20]\nprint(items[3:7])\nprint(items[::-2])\nprint(min(items[3:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [23, 27, -2, -2, 38, 35, 38, 20]\nprint(items[3:7])\nprint(items[::-2])\nprint(min(items[3:7]))\n```\nالجواب:", "qhash": "a74d05b226322ef1", "answer": "[-2, 38, 35, 38]\n[20, 35, -2, 27]\n-2", "completion": " الناتج:\n```text\n[-2, 38, 35, 38]\n[20, 35, -2, 27]\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(13) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13']", "assert label_numbers(7) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7']", "assert label_numbers(23) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'Hi', '17', 'HiYo', '19', 'Hi', '21', 'Hi', '23']", "assert label_numbers(18) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'Hi', '17', 'HiYo']", "assert label_numbers(4) == ['1', 'Hi', '3', 'Hi']"], "test_code": "assert label_numbers(13) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13']\nassert label_numbers(7) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7']\nassert label_numbers(23) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'Hi', '17', 'HiYo', '19', 'Hi', '21', 'Hi', '23']\nassert label_numbers(18) == ['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'Hi', '17', 'HiYo']\nassert label_numbers(4) == ['1', 'Hi', '3', 'Hi']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Hi'، وعلى 6 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(13)` يجب أن تُرجع `['1', 'Hi', '3', 'Hi', '5', 'HiYo', '7', 'Hi', '9', 'Hi', '11', 'HiYo', '13']`.\nالجواب:", "qhash": "bb1ce43af6f4af46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('python python music by camel') == 'camel|music|python|python'", "assert mirror_words('table camel signal of vector coffee summer') == 'summer|coffee|vector|signal|camel|table'", "assert mirror_words('light garden cloud') == 'cloud|garden|light'", "assert mirror_words('vector in of planet') == 'planet|vector'", "assert mirror_words('an') == ''", "assert mirror_words('river falcon on falcon to') == 'falcon|falcon|river'", "assert mirror_words('planet table rocket summer on planet desert') == 'desert|planet|summer|rocket|table|planet'"], "test_code": "assert mirror_words('python python music by camel') == 'camel|music|python|python'\nassert mirror_words('table camel signal of vector coffee summer') == 'summer|coffee|vector|signal|camel|table'\nassert mirror_words('light garden cloud') == 'cloud|garden|light'\nassert mirror_words('vector in of planet') == 'planet|vector'\nassert mirror_words('an') == ''\nassert mirror_words('river falcon on falcon to') == 'falcon|falcon|river'\nassert mirror_words('planet table rocket summer on planet desert') == 'desert|planet|summer|rocket|table|planet'", "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('python python music by camel')` يجب أن تُرجع `'camel|music|python|python'`.\nالجواب:", "qhash": "3a2c10d214a9537c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([11, 41, 48]) == [41, 48, 11]", "assert rotate_by([23, 13, 17]) == [13, 17, 23]", "assert rotate_by([12, 41, 27, 1, 35, -7, 10, 49, 42, 31, 23, 12]) == [49, 42, 31, 23, 12, 12, 41, 27, 1, 35, -7, 10]", "assert rotate_by([-5, 42, 48, 6]) == [6, -5, 42, 48]", "assert rotate_by([0, 43, 11, -3, 46, 41, 10, 8]) == [8, 0, 43, 11, -3, 46, 41, 10]", "assert rotate_by([9, 24, -2, 48, 35, 20, 5]) == [9, 24, -2, 48, 35, 20, 5]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([11, 41, 48]) == [41, 48, 11]\nassert rotate_by([23, 13, 17]) == [13, 17, 23]\nassert rotate_by([12, 41, 27, 1, 35, -7, 10, 49, 42, 31, 23, 12]) == [49, 42, 31, 23, 12, 12, 41, 27, 1, 35, -7, 10]\nassert rotate_by([-5, 42, 48, 6]) == [6, -5, 42, 48]\nassert rotate_by([0, 43, 11, -3, 46, 41, 10, 8]) == [8, 0, 43, 11, -3, 46, 41, 10]\nassert rotate_by([9, 24, -2, 48, 35, 20, 5]) == [9, 24, -2, 48, 35, 20, 5]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([11, 41, 48])` يُرجع `[41, 48, 11]`.\nالجواب:", "qhash": "80ebaecf60a03633"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 2) == 1)", "tests": ["assert count_gcd1(121) == 61", "assert count_gcd1(47) == 24", "assert count_gcd1(33) == 17", "assert count_gcd1(59) == 30", "assert count_gcd1(152) == 76", "assert count_gcd1(39) == 20", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(121) == 61\nassert count_gcd1(47) == 24\nassert count_gcd1(33) == 17\nassert count_gcd1(59) == 30\nassert count_gcd1(152) == 76\nassert count_gcd1(39) == 20\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, 2) == 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, 2) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 2) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(121)` يُرجع `61`.\nالجواب:", "qhash": "ce8b1a73adc55a77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('falcon music orange falcon') == 'falcon orange music falcon'", "assert flip_words('orange pixel coffee brain') == 'brain coffee pixel orange'", "assert flip_words('of a engine in matrix garden') == 'garden matrix engine'", "assert flip_words('banana up light a signal pixel pixel summer') == 'summer pixel pixel signal light banana'", "assert flip_words('table signal music data python of in') == 'python music signal table'", "assert flip_words('on vector music') == 'music vector'", "assert flip_words('pixel engine an an code falcon') == 'falcon engine pixel'"], "test_code": "assert flip_words('falcon music orange falcon') == 'falcon orange music falcon'\nassert flip_words('orange pixel coffee brain') == 'brain coffee pixel orange'\nassert flip_words('of a engine in matrix garden') == 'garden matrix engine'\nassert flip_words('banana up light a signal pixel pixel summer') == 'summer pixel pixel signal light banana'\nassert flip_words('table signal music data python of in') == 'python music signal table'\nassert flip_words('on vector music') == 'music vector'\nassert flip_words('pixel engine an an code falcon') == 'falcon engine pixel'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `flip_words('falcon music orange falcon')` يُرجع `'falcon orange music falcon'`.\nالجواب:", "qhash": "89b6a6f82d737bd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=7):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(18))\nprint(h(18, -9))\nprint(h(h(-9), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=7):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(18))\nprint(h(18, -9))\nprint(h(h(-9), 18))\n```\nالجواب:", "qhash": "084fd3744cd32095", "answer": "-25\n-9\n-34", "completion": " الناتج:\n```text\n-25\n-9\n-34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "tests": ["assert sum_multiples(176) == 3283", "assert sum_multiples(94) == 889", "assert sum_multiples(151) == 2469", "assert sum_multiples(141) == 2178", "assert sum_multiples(160) == 2779", "assert sum_multiples(113) == 1408", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(176) == 3283\nassert sum_multiples(94) == 889\nassert sum_multiples(151) == 2469\nassert sum_multiples(141) == 2178\nassert sum_multiples(160) == 2779\nassert sum_multiples(113) == 1408\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 % 12 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 12.\nمثال: `sum_multiples(176)` يجب أن تُرجع `3283`.\nالجواب:", "qhash": "c207654653a236c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('نور صحراء سوق عربية مدرسة') == 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('ماء دفتر سلام حصان') == 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\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": "492a77e59d581459"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert game(16) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16']", "assert game(23) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16', '17', 'Tic', '19', '20', 'TicTac', '22', '23']", "assert game(12) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic']", "assert game(24) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16', '17', 'Tic', '19', '20', 'TicTac', '22', '23', 'Tic']", "assert game(3) == ['1', '2', 'Tic']"], "test_code": "assert game(16) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16']\nassert game(23) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16', '17', 'Tic', '19', '20', 'TicTac', '22', '23']\nassert game(12) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic']\nassert game(24) == ['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16', '17', 'Tic', '19', '20', 'TicTac', '22', '23', 'Tic']\nassert game(3) == ['1', '2', 'Tic']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Tic'\n if i % 7 == 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 % 3 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Tic'، وعلى 7 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(16)` يجب أن تُرجع `['1', '2', 'Tic', '4', '5', 'Tic', 'Tac', '8', 'Tic', '10', '11', 'Tic', '13', 'Tac', 'Tic', '16']`.\nالجواب:", "qhash": "adbdae4698674865"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 396\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 = 396\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": "42b607a6a213d591", "answer": "27", "completion": " الناتج:\n```text\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 18 <= x <= 30)", "tests": ["assert pick_between([17, 30, 20, 39]) == [60, 90]", "assert pick_between([-19, -26, 12, -13, 26, -21, -3, 17, 18, 36]) == [54, 78]", "assert pick_between([26, -27, -16, -14, 19]) == [57, 78]", "assert pick_between([55, -29, -19, 47, -6, -20, -28]) == []", "assert pick_between([6, -1, 12, 55, 34, 56, 46, 40, -10, 2]) == []", "assert pick_between([44, 5, 1, 49, 17, 6, 4, 1]) == []", "assert pick_between([-18, 23]) == [69]", "assert pick_between([]) == []"], "test_code": "assert pick_between([17, 30, 20, 39]) == [60, 90]\nassert pick_between([-19, -26, 12, -13, 26, -21, -3, 17, 18, 36]) == [54, 78]\nassert pick_between([26, -27, -16, -14, 19]) == [57, 78]\nassert pick_between([55, -29, -19, 47, -6, -20, -28]) == []\nassert pick_between([6, -1, 12, 55, 34, 56, 46, 40, -10, 2]) == []\nassert pick_between([44, 5, 1, 49, 17, 6, 4, 1]) == []\nassert pick_between([-18, 23]) == [69]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 18 <= x <= 30)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 3 for x in xs if 18 <= x <= 30)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 18 و30 (شاملًا الطرفين) في 3.\nمثال: `pick_between([17, 30, 20, 39])` يجب أن تُرجع `[60, 90]`.\nالجواب:", "qhash": "2cc8a61ac72a3f60"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('signal signal river falcon vector') == 'zpnuhs zpnuhs ypcly mhsjvu cljavy'", "assert caesar('brain light brain by on 2024') == 'iyhpu spnoa iyhpu if vu 2024'", "assert caesar('planet winter winter') == 'wshula dpualy dpualy'", "assert caesar('coffee go coffee') == 'jvmmll nv jvmmll'", "assert caesar('matrix to music desert data') == 'thaype av tbzpj klzlya khah'", "assert caesar('an of') == 'hu vm'", "assert caesar('') == ''"], "test_code": "assert caesar('signal signal river falcon vector') == 'zpnuhs zpnuhs ypcly mhsjvu cljavy'\nassert caesar('brain light brain by on 2024') == 'iyhpu spnoa iyhpu if vu 2024'\nassert caesar('planet winter winter') == 'wshula dpualy dpualy'\nassert caesar('coffee go coffee') == 'jvmmll nv jvmmll'\nassert caesar('matrix to music desert data') == 'thaype av tbzpj klzlya khah'\nassert caesar('an of') == 'hu vm'\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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('signal signal river falcon vector')` يجب أن تُرجع `'zpnuhs zpnuhs ypcly mhsjvu cljavy'`.\nالجواب:", "qhash": "78b96fe1cd4a4e95"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 364\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 = 364\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": "e790ab63893ef78d", "answer": "94", "completion": " الناتج:\n```text\n94\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([67, 22, 15, 34, 76, 17, 53, 1, 67, 59, 54, 86]) == 2", "assert only_div([5, 63]) == 1", "assert only_div([66, 85, 15]) == 2", "assert only_div([29, 10, 84]) == 0", "assert only_div([]) == 0", "assert only_div([47]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([67, 22, 15, 34, 76, 17, 53, 1, 67, 59, 54, 86]) == 2\nassert only_div([5, 63]) == 1\nassert only_div([66, 85, 15]) == 2\nassert only_div([29, 10, 84]) == 0\nassert only_div([]) == 0\nassert only_div([47]) == 0\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([67, 22, 15, 34, 76, 17, 53, 1, 67, 59, 54, 86])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "5df5de15aa7372f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 53", "tests": ["assert rec_prod(9) == 44", "assert rec_prod(31) == 51", "assert rec_prod(20) == 38", "assert rec_prod(1) == 1", "assert rec_prod(11) == 7", "assert rec_prod(56) == 37", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(9) == 44\nassert rec_prod(31) == 51\nassert rec_prod(20) == 38\nassert rec_prod(1) == 1\nassert rec_prod(11) == 7\nassert rec_prod(56) == 37\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 53", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(9)` يُرجع `44`.\nالجواب:", "qhash": "362bb435e0026a9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'amo'}", "tests": ["assert tally('in brain falcon an cloud window') == {'a': 3, 'm': 0, 'o': 3}", "assert tally('apple pixel an pixel') == {'a': 2, 'm': 0, 'o': 0}", "assert tally('go') == {'a': 0, 'm': 0, 'o': 1}", "assert tally('by') == {'a': 0, 'm': 0, 'o': 0}", "assert tally('data engine orange') == {'a': 3, 'm': 0, 'o': 1}", "assert tally('engine camel music engine python garden') == {'a': 2, 'm': 2, 'o': 1}", "assert tally('') == {'a': 0, 'm': 0, 'o': 0}"], "test_code": "assert tally('in brain falcon an cloud window') == {'a': 3, 'm': 0, 'o': 3}\nassert tally('apple pixel an pixel') == {'a': 2, 'm': 0, 'o': 0}\nassert tally('go') == {'a': 0, 'm': 0, 'o': 1}\nassert tally('by') == {'a': 0, 'm': 0, 'o': 0}\nassert tally('data engine orange') == {'a': 3, 'm': 0, 'o': 1}\nassert tally('engine camel music engine python garden') == {'a': 2, 'm': 2, 'o': 1}\nassert tally('') == {'a': 0, 'm': 0, 'o': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'amo'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'amo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'm'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('in brain falcon an cloud window')` يجب أن تُرجع `{'a': 3, 'm': 0, 'o': 3}`.\nالجواب:", "qhash": "d8948c425d78dddf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert div_not([86, 42, 12, 39, 71, 25]) == 0", "assert div_not([40, 52, 73, -8, -21]) == 1", "assert div_not([78, 82]) == 0", "assert div_not([-26, 84, 0]) == 0", "assert div_not([8, 1, 19, 52, 47, -9, 42, 45, -36, 86, 80, -16]) == 0", "assert div_not([81, -17, -22, 51]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([86, 42, 12, 39, 71, 25]) == 0\nassert div_not([40, 52, 73, -8, -21]) == 1\nassert div_not([78, 82]) == 0\nassert div_not([-26, 84, 0]) == 0\nassert div_not([8, 1, 19, 52, 47, -9, 42, 45, -36, 86, 80, -16]) == 0\nassert div_not([81, -17, -22, 51]) == 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 % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([86, 42, 12, 39, 71, 25])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "26f9f2e681ae9ad5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return text.count('س')", "tests": ["assert letter_count('تفاحة ميناء شمس جبل سلام') == 2", "assert letter_count('') == 0", "assert letter_count('وردة') == 0", "assert letter_count('سوق حديقة طائرة عمل شجرة ليل') == 1", "assert letter_count('نهار شمس عربية مكتبة مكتبة') == 1", "assert letter_count('تفاحة صديق جمل علم نهار نهار عمل شجرة') == 0", "assert letter_count('باب صديق مكتبة رمل حصان') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('تفاحة ميناء شمس جبل سلام') == 2\nassert letter_count('') == 0\nassert letter_count('وردة') == 0\nassert letter_count('سوق حديقة طائرة عمل شجرة ليل') == 1\nassert letter_count('نهار شمس عربية مكتبة مكتبة') == 1\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('تفاحة ميناء شمس جبل سلام')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "16de3b6d3c1d292f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('stone we go it data stone by banana') == 'banana/stone/stone'", "assert reverse_words('to at desert an river') == 'river/desert'", "assert reverse_words('camel matrix engine cloud on falcon pixel') == 'pixel/falcon/cloud/engine/matrix/camel'", "assert reverse_words('brain orange') == 'orange/brain'", "assert reverse_words('an music cloud matrix pixel desert stone cloud') == 'cloud/stone/desert/pixel/matrix/cloud/music'", "assert reverse_words('window rocket') == 'rocket/window'", "assert reverse_words('') == ''"], "test_code": "assert reverse_words('stone we go it data stone by banana') == 'banana/stone/stone'\nassert reverse_words('to at desert an river') == 'river/desert'\nassert reverse_words('camel matrix engine cloud on falcon pixel') == 'pixel/falcon/cloud/engine/matrix/camel'\nassert reverse_words('brain orange') == 'orange/brain'\nassert reverse_words('an music cloud matrix pixel desert stone cloud') == 'cloud/stone/desert/pixel/matrix/cloud/music'\nassert reverse_words('window rocket') == 'rocket/window'\nassert reverse_words('') == ''", "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('stone we go it data stone by banana')` يجب أن تُرجع `'banana/stone/stone'`.\nالجواب:", "qhash": "c6f5f7c1e2d16da5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(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 running_sum([5, 12, 48, 16, 41, 27, 11, 22, 17, 10]) == [5, 17, 65, 81, 0, 27, 38, 60, 77, 87]", "assert running_sum([]) == []", "assert running_sum([]) == []", "assert running_sum([]) == []", "assert running_sum([18, 11, 82, 68, -9, 40, 57, 0]) == [18, 29, 0, 68, 59, 0, 57, 57]", "assert running_sum([62, 5, 3, 79, 33]) == [62, 67, 70, 0, 33]", "assert running_sum([]) == []"], "test_code": "assert running_sum([5, 12, 48, 16, 41, 27, 11, 22, 17, 10]) == [5, 17, 65, 81, 0, 27, 38, 60, 77, 87]\nassert running_sum([]) == []\nassert running_sum([]) == []\nassert running_sum([]) == []\nassert running_sum([18, 11, 82, 68, -9, 40, 57, 0]) == [18, 29, 0, 68, 59, 0, 57, 57]\nassert running_sum([62, 5, 3, 79, 33]) == [62, 67, 70, 0, 33]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 90 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([5, 12, 48, 16, 41, 27, 11, 22, 17, 10])` يجب أن تُرجع `[5, 17, 65, 81, 0, 27, 38, 60, 77, 87]`.\nالجواب:", "qhash": "4de3d9db0726de50"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 5 for x in range(3, 17) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 5 for x in range(3, 17) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "17479bd9c06b751b", "answer": "[4, 20, 44, 76, 116, 164, 220]\n7 644", "completion": " الناتج:\n```text\n[4, 20, 44, 76, 116, 164, 220]\n7 644\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سماء سيارة شجرة جمل ليل معلم معلم') == 6", "assert how_many('قهوة رمل جبل ليل علم') == 2", "assert how_many('فجر طائرة سماء') == 1", "assert how_many('جمل نهر ليل') == 1", "assert how_many('') == 0"], "test_code": "assert how_many('رمل طائرة جبل') == 1\nassert how_many('قمر صديق') == 1\nassert how_many('') == 0\nassert how_many('سماء سيارة شجرة جمل ليل معلم معلم') == 6\nassert how_many('قهوة رمل جبل ليل علم') == 2\nassert how_many('فجر طائرة سماء') == 1\nassert how_many('جمل نهر ليل') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «م» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('رمل طائرة جبل')` يُرجع `1`.\nالجواب:", "qhash": "ebee6ed0799ee134"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(15))\n```\nالجواب:", "qhash": "84fc1f25021b2da0", "answer": "1597", "completion": " الناتج:\n```text\n1597\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [1, 38, 12, 29, 0, -2, -9]\nprint(lst[2:5])\nprint(lst[::2])\nprint(max(lst[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [1, 38, 12, 29, 0, -2, -9]\nprint(lst[2:5])\nprint(lst[::2])\nprint(max(lst[2:5]))\n```\nالجواب:", "qhash": "09679b114b130958", "answer": "[12, 29, 0]\n[1, 12, 0, -9]\n29", "completion": " الناتج:\n```text\n[12, 29, 0]\n[1, 12, 0, -9]\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [35, 28, 5, -7, 10, -8, 20]\nprint(nums[2:5])\nprint(nums[::3])\nprint(min(nums[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [35, 28, 5, -7, 10, -8, 20]\nprint(nums[2:5])\nprint(nums[::3])\nprint(min(nums[2:5]))\n```\nالجواب:", "qhash": "fbedaa4bf421ff02", "answer": "[5, -7, 10]\n[35, -7, 20]\n-7", "completion": " الناتج:\n```text\n[5, -7, 10]\n[35, -7, 20]\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 173:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([8, 45, 56, 44, 56, 19, 43]) == [8, 53, 109, 153, 0, 19, 62]", "assert acc_reset([167, 94, 108, 26, 1, 108, 73, 164, 30, 143]) == [167, 0, 108, 134, 135, 0, 73, 0, 30, 173]", "assert acc_reset([120]) == [120]", "assert acc_reset([161, 153, 116, 10]) == [161, 0, 116, 126]", "assert acc_reset([106, -10, 67, 117, 75, 146, 130]) == [106, 96, 163, 0, 75, 0, 130]", "assert acc_reset([63, 151, 158, 144, 5, 44, 143, 7, 126, 143]) == [63, 0, 158, 0, 5, 49, 0, 7, 133, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([8, 45, 56, 44, 56, 19, 43]) == [8, 53, 109, 153, 0, 19, 62]\nassert acc_reset([167, 94, 108, 26, 1, 108, 73, 164, 30, 143]) == [167, 0, 108, 134, 135, 0, 73, 0, 30, 173]\nassert acc_reset([120]) == [120]\nassert acc_reset([161, 153, 116, 10]) == [161, 0, 116, 126]\nassert acc_reset([106, -10, 67, 117, 75, 146, 130]) == [106, 96, 163, 0, 75, 0, 130]\nassert acc_reset([63, 151, 158, 144, 5, 44, 143, 7, 126, 143]) == [63, 0, 158, 0, 5, 49, 0, 7, 133, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 173:\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 > 173:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 173 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([8, 45, 56, 44, 56, 19, 43])` يجب أن تُرجع `[8, 53, 109, 153, 0, 19, 62]`.\nالجواب:", "qhash": "54a9f02f695a5646"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('apple pixel pixel') == 'zookd ohwdk ohwdk'", "assert shift_letters('python it up summer') == 'oxsgnm hs to rtlldq'", "assert shift_letters('brain on music pixel garden Hello') == 'aqzhm nm ltrhb ohwdk fzqcdm Hdkkn'", "assert shift_letters('window is apple banana at 2024') == 'vhmcnv hr zookd azmzmz zs 2024'", "assert shift_letters('garden table falcon light Hello') == 'fzqcdm szakd ezkbnm khfgs Hdkkn'", "assert shift_letters('matrix at') == 'lzsqhw zs'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('apple pixel pixel') == 'zookd ohwdk ohwdk'\nassert shift_letters('python it up summer') == 'oxsgnm hs to rtlldq'\nassert shift_letters('brain on music pixel garden Hello') == 'aqzhm nm ltrhb ohwdk fzqcdm Hdkkn'\nassert shift_letters('window is apple banana at 2024') == 'vhmcnv hr zookd azmzmz zs 2024'\nassert shift_letters('garden table falcon light Hello') == 'fzqcdm szakd ezkbnm khfgs Hdkkn'\nassert shift_letters('matrix at') == 'lzsqhw zs'\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 + (25)) % 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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('apple pixel pixel')` يجب أن تُرجع `'zookd ohwdk ohwdk'`.\nالجواب:", "qhash": "d7f92fd4c6b6185e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 73", "tests": ["assert prod_mod(8) == 32", "assert prod_mod(13) == 1", "assert prod_mod(39) == 28", "assert prod_mod(59) == 52", "assert prod_mod(5) == 5", "assert prod_mod(12) == 19", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(8) == 32\nassert prod_mod(13) == 1\nassert prod_mod(39) == 28\nassert prod_mod(59) == 52\nassert prod_mod(5) == 5\nassert prod_mod(12) == 19\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 73", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(8)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "657745b4f0b8965d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [10, 23, 30, 13, 8, 8, 30, 34, 37]\nprint(a[1:6])\nprint(a[::2])\nprint(sum(a[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [10, 23, 30, 13, 8, 8, 30, 34, 37]\nprint(a[1:6])\nprint(a[::2])\nprint(sum(a[1:6]))\n```\nالجواب:", "qhash": "c879826c94e14842", "answer": "[23, 30, 13, 8, 8]\n[10, 30, 8, 30, 37]\n82", "completion": " الناتج:\n```text\n[23, 30, 13, 8, 8]\n[10, 30, 8, 30, 37]\n82\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([6, 84, 44, 58, 17, 37, 82, 79, 38]) == [6, 90, 134, 0, 17, 54, 136, 0, 38]", "assert acc_reset([61, 150, 42, 77, 39, 13, 59, -7]) == [61, 0, 42, 119, 158, 171, 0, -7]", "assert acc_reset([58, 175]) == [58, 0]", "assert acc_reset([102, 130, 92, 11, 1, 30, 5, 160, 150, 89]) == [102, 0, 92, 103, 104, 134, 139, 0, 150, 0]", "assert acc_reset([45, 142, 154, 87, 136, 46, 118]) == [45, 187, 0, 87, 0, 46, 164]", "assert acc_reset([171, 169, 5, 69]) == [171, 0, 5, 74]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([6, 84, 44, 58, 17, 37, 82, 79, 38]) == [6, 90, 134, 0, 17, 54, 136, 0, 38]\nassert acc_reset([61, 150, 42, 77, 39, 13, 59, -7]) == [61, 0, 42, 119, 158, 171, 0, -7]\nassert acc_reset([58, 175]) == [58, 0]\nassert acc_reset([102, 130, 92, 11, 1, 30, 5, 160, 150, 89]) == [102, 0, 92, 103, 104, 134, 139, 0, 150, 0]\nassert acc_reset([45, 142, 154, 87, 136, 46, 118]) == [45, 187, 0, 87, 0, 46, 164]\nassert acc_reset([171, 169, 5, 69]) == [171, 0, 5, 74]\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 188 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([6, 84, 44, 58, 17, 37, 82, 79, 38])` يُرجع `[6, 90, 134, 0, 17, 54, 136, 0, 38]`.\nالجواب:", "qhash": "b60c9433fcb01ec2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([19, 14, 1, 21, 4, 19, 18, 24, 23]) == [19, 33, 34, 0, 4, 23, 41, 0, 23]", "assert reset_sum([-7, 8]) == [-7, 1]", "assert reset_sum([-3, 13, 18, 25, 25]) == [-3, 10, 28, 0, 25]", "assert reset_sum([6, -1, 7, 6, 3]) == [6, 5, 12, 18, 21]", "assert reset_sum([-2]) == [-2]", "assert reset_sum([-9, 21, 9, 16]) == [-9, 12, 21, 37]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([19, 14, 1, 21, 4, 19, 18, 24, 23]) == [19, 33, 34, 0, 4, 23, 41, 0, 23]\nassert reset_sum([-7, 8]) == [-7, 1]\nassert reset_sum([-3, 13, 18, 25, 25]) == [-3, 10, 28, 0, 25]\nassert reset_sum([6, -1, 7, 6, 3]) == [6, 5, 12, 18, 21]\nassert reset_sum([-2]) == [-2]\nassert reset_sum([-9, 21, 9, 16]) == [-9, 12, 21, 37]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\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 > 41:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 41 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([19, 14, 1, 21, 4, 19, 18, 24, 23])` يُرجع `[19, 33, 34, 0, 4, 23, 41, 0, 23]`.\nالجواب:", "qhash": "e9ce04fe41a7f0f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عمل شجرة عمل ماء عمل وردة') == 0", "assert prefix_hits('شمس برتقال برمجة خبز عربية') == 0", "assert prefix_hits('جمل سفينة عربية جمل جمل لغة وردة برمجة') == 3", "assert prefix_hits('دفتر مكتبة صديق') == 0", "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('جمل سفينة عربية جمل جمل لغة وردة برمجة') == 3\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:\n if w.startswith('ج'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ج»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef prefix_hits(line):\n count = 0\n for w in line:\n if w.startswith('ج'):\n count += 1\n return count\n```\nمثال: `prefix_hits('جبل حاسوب بيت ماء نهار')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "10ee5c2982b4b064"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert turn_list([23, 17, 34]) == [34, 23, 17]", "assert turn_list([46, 34, 30, 40, -7, -9]) == [-9, 46, 34, 30, 40, -7]", "assert turn_list([29, 9, 3, 50, 42]) == [3, 50, 42, 29, 9]", "assert turn_list([30, 46, 3, 21, 42]) == [3, 21, 42, 30, 46]", "assert turn_list([-2, -3, -4, 9, 26, -7, -9, 42, 18, -5, -6, 34]) == [34, -2, -3, -4, 9, 26, -7, -9, 42, 18, -5, -6]", "assert turn_list([14, 24, 44]) == [44, 14, 24]", "assert turn_list([]) == []"], "test_code": "assert turn_list([23, 17, 34]) == [34, 23, 17]\nassert turn_list([46, 34, 30, 40, -7, -9]) == [-9, 46, 34, 30, 40, -7]\nassert turn_list([29, 9, 3, 50, 42]) == [3, 50, 42, 29, 9]\nassert turn_list([30, 46, 3, 21, 42]) == [3, 21, 42, 30, 46]\nassert turn_list([-2, -3, -4, 9, 26, -7, -9, 42, 18, -5, -6, 34]) == [34, -2, -3, -4, 9, 26, -7, -9, 42, 18, -5, -6]\nassert turn_list([14, 24, 44]) == [44, 14, 24]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 13 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([23, 17, 34])` يُرجع `[34, 23, 17]`.\nالجواب:", "qhash": "3012879c2a2362ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'لغة'\nprint('ة' in kalima)\nprint(kalima[::-1])\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'لغة'\nprint('ة' in kalima)\nprint(kalima[::-1])\nprint(len(kalima))\n```\nالجواب:", "qhash": "3507c84bdf118bb9", "answer": "True\nةغل\n3", "completion": " الناتج:\n```text\nTrue\nةغل\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "how_many", "reference": "def how_many(text):\n return text.count('ه')", "tests": ["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", "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('قهوة باب عربية') == 1\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('مطر مكتبة سيارة شمس حصان')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "5b125d16f9ab8770"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 56) == 1)", "tests": ["assert coprime_count(56) == 24", "assert coprime_count(141) == 61", "assert coprime_count(67) == 29", "assert coprime_count(106) == 45", "assert coprime_count(53) == 23", "assert coprime_count(87) == 38", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(56) == 24\nassert coprime_count(141) == 61\nassert coprime_count(67) == 29\nassert coprime_count(106) == 45\nassert coprime_count(53) == 23\nassert coprime_count(87) == 38\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, 56) == 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, 56) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 56) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(56)` يُرجع `24`.\nالجواب:", "qhash": "99cb77c587d5a276"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 14\nfor n in range(1, 19, 1):\n acc += n * 2\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 14\nfor n in range(1, 19, 1):\n acc += n * 2\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "ea8cd8fb21a0b097", "answer": "356\n18", "completion": " الناتج:\n```text\n356\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'cdhn'}", "tests": ["assert tally('matrix desert') == {'c': 0, 'd': 1, 'h': 0, 'n': 0}", "assert tally('pixel') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}", "assert tally('by river') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}", "assert tally('code we winter go table desert') == {'c': 1, 'd': 2, 'h': 0, 'n': 1}", "assert tally('desert engine camel') == {'c': 1, 'd': 1, 'h': 0, 'n': 2}", "assert tally('we camel cloud on') == {'c': 2, 'd': 1, 'h': 0, 'n': 1}", "assert tally('') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}"], "test_code": "assert tally('matrix desert') == {'c': 0, 'd': 1, 'h': 0, 'n': 0}\nassert tally('pixel') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}\nassert tally('by river') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}\nassert tally('code we winter go table desert') == {'c': 1, 'd': 2, 'h': 0, 'n': 1}\nassert tally('desert engine camel') == {'c': 1, 'd': 1, 'h': 0, 'n': 2}\nassert tally('we camel cloud on') == {'c': 2, 'd': 1, 'h': 0, 'n': 1}\nassert tally('') == {'c': 0, 'd': 0, 'h': 0, 'n': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'cdhn'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'cdhn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'd'، 'h'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('matrix desert')` يجب أن تُرجع `{'c': 0, 'd': 1, 'h': 0, 'n': 0}`.\nالجواب:", "qhash": "b8aef61e677bae9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('an apple river A1') == 're rggcv izmvi A1'", "assert rotate_letters('of an a') == 'fw re r'", "assert rotate_letters('python window') == 'gpkyfe nzeufn'", "assert rotate_letters('an up banana rocket') == 're lg srerer iftbvk'", "assert rotate_letters('falcon a') == 'wrctfe r'", "assert rotate_letters('winter') == 'nzekvi'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('an apple river A1') == 're rggcv izmvi A1'\nassert rotate_letters('of an a') == 'fw re r'\nassert rotate_letters('python window') == 'gpkyfe nzeufn'\nassert rotate_letters('an up banana rocket') == 're lg srerer iftbvk'\nassert rotate_letters('falcon a') == 'wrctfe r'\nassert rotate_letters('winter') == 'nzekvi'\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 + (-9)) % 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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('an apple river A1')` يجب أن تُرجع `'re rggcv izmvi A1'`.\nالجواب:", "qhash": "63eefcd836072971"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 4 + 8 for x in range(1, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 4 + 8 for x in range(1, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "82761cef2156d43d", "answer": "[16, 24, 32, 40, 48]\n5 160", "completion": " الناتج:\n```text\n[16, 24, 32, 40, 48]\n5 160\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'قلم'\nprint('ت' in s)\nprint(s.split())\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'قلم'\nprint('ت' in s)\nprint(s.split())\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "3be014f72a4576dd", "answer": "False\n['قلم']\n3", "completion": " الناتج:\n```text\nFalse\n['قلم']\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([31, 23, 28, 8, 5, 40, 33, 43]) == [31, 54, 82, 0, 5, 45, 78, 0]", "assert rolling_total([11, 52, 72, 76, 25, 43]) == [11, 63, 0, 76, 0, 43]", "assert rolling_total([34, 65, 27, 8, 64, 36, 69, 70]) == [34, 0, 27, 35, 0, 36, 0, 70]", "assert rolling_total([-4, 9, 54]) == [-4, 5, 59]", "assert rolling_total([65]) == [65]", "assert rolling_total([64, -7, 68, -10, 45, 65, 11]) == [64, 57, 0, -10, 35, 0, 11]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([31, 23, 28, 8, 5, 40, 33, 43]) == [31, 54, 82, 0, 5, 45, 78, 0]\nassert rolling_total([11, 52, 72, 76, 25, 43]) == [11, 63, 0, 76, 0, 43]\nassert rolling_total([34, 65, 27, 8, 64, 36, 69, 70]) == [34, 0, 27, 35, 0, 36, 0, 70]\nassert rolling_total([-4, 9, 54]) == [-4, 5, 59]\nassert rolling_total([65]) == [65]\nassert rolling_total([64, -7, 68, -10, 45, 65, 11]) == [64, 57, 0, -10, 35, 0, 11]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\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 > 82:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 82 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([31, 23, 28, 8, 5, 40, 33, 43])` يجب أن تُرجع `[31, 54, 82, 0, 5, 45, 78, 0]`.\nالجواب:", "qhash": "413b94a568f3eac8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert multiples_total(36) == 105", "assert multiples_total(51) == 196", "assert multiples_total(132) == 1197", "assert multiples_total(251) == 4410", "assert multiples_total(141) == 1470", "assert multiples_total(119) == 952", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(36) == 105\nassert multiples_total(51) == 196\nassert multiples_total(132) == 1197\nassert multiples_total(251) == 4410\nassert multiples_total(141) == 1470\nassert multiples_total(119) == 952\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(36)` يُرجع `105`.\nالجواب:", "qhash": "9e1a8581814dc75c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=1):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(15))\nprint(f(15, -4))\nprint(f(f(-4), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=1):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(15))\nprint(f(15, -4))\nprint(f(f(-4), 15))\n```\nالجواب:", "qhash": "80ee1f3e835661f1", "answer": "-16\n-11\n-20", "completion": " الناتج:\n```text\n-16\n-11\n-20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 4 * x ** 2 + (-2) * x + (-5)", "tests": ["assert eval_poly(1) == -3", "assert eval_poly(10) == 375", "assert eval_poly(3) == 25", "assert eval_poly(-10) == 415", "assert eval_poly(5) == 85", "assert eval_poly(17) == 1117", "assert eval_poly(15) == 865", "assert eval_poly(0) == -5"], "test_code": "assert eval_poly(1) == -3\nassert eval_poly(10) == 375\nassert eval_poly(3) == 25\nassert eval_poly(-10) == 415\nassert eval_poly(5) == 85\nassert eval_poly(17) == 1117\nassert eval_poly(15) == 865\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)` تحسب المقدار 4x² - 2x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(1)` يُرجع `-3`.\nالجواب:", "qhash": "38662631c7f065ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)", "tests": ["assert total_multiples(79) == 920", "assert total_multiples(178) == 4770", "assert total_multiples(223) == 7370", "assert total_multiples(16) == 34", "assert total_multiples(71) == 772", "assert total_multiples(279) == 11620", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(79) == 920\nassert total_multiples(178) == 4770\nassert total_multiples(223) == 7370\nassert total_multiples(16) == 34\nassert total_multiples(71) == 772\nassert total_multiples(279) == 11620\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 10.\nمثال: `total_multiples(79)` يجب أن تُرجع `920`.\nالجواب:", "qhash": "98cc83d0bc246347"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 62", "tests": ["assert dig_pow_mod(40193) == 17", "assert dig_pow_mod(895039) == 6", "assert dig_pow_mod(712909) == 40", "assert dig_pow_mod(55177) == 39", "assert dig_pow_mod(147939) == 51", "assert dig_pow_mod(921399) == 3", "assert dig_pow_mod(958041) == 7", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(40193) == 17\nassert dig_pow_mod(895039) == 6\nassert dig_pow_mod(712909) == 40\nassert dig_pow_mod(55177) == 39\nassert dig_pow_mod(147939) == 51\nassert dig_pow_mod(921399) == 3\nassert dig_pow_mod(958041) == 7\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 62", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 62\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 62.\nمثال: `dig_pow_mod(40193)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "ed2abc80c8fc2df6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('summer falcon by go river') == 'vxpphu idofrq eb jr ulyhu'", "assert cipher('engine garden') == 'hqjlqh jdughq'", "assert cipher('in pixel in 2024') == 'lq slaho lq 2024'", "assert cipher('is to desert 2024') == 'lv wr ghvhuw 2024'", "assert cipher('desert orange a up music !') == 'ghvhuw rudqjh d xs pxvlf !'", "assert cipher('we 2024') == 'zh 2024'", "assert cipher('') == ''"], "test_code": "assert cipher('summer falcon by go river') == 'vxpphu idofrq eb jr ulyhu'\nassert cipher('engine garden') == 'hqjlqh jdughq'\nassert cipher('in pixel in 2024') == 'lq slaho lq 2024'\nassert cipher('is to desert 2024') == 'lv wr ghvhuw 2024'\nassert cipher('desert orange a up music !') == 'ghvhuw rudqjh d xs pxvlf !'\nassert cipher('we 2024') == 'zh 2024'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('summer falcon by go river')` يجب أن تُرجع `'vxpphu idofrq eb jr ulyhu'`.\nالجواب:", "qhash": "d573c3ae88275a3f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 31", "tests": ["assert sum_digit_pow(82121) == 3", "assert sum_digit_pow(141390) == 16", "assert sum_digit_pow(818745) == 7", "assert sum_digit_pow(682984) == 26", "assert sum_digit_pow(177436) == 2", "assert sum_digit_pow(603827) == 21", "assert sum_digit_pow(759100) == 20", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(82121) == 3\nassert sum_digit_pow(141390) == 16\nassert sum_digit_pow(818745) == 7\nassert sum_digit_pow(682984) == 26\nassert sum_digit_pow(177436) == 2\nassert sum_digit_pow(603827) == 21\nassert sum_digit_pow(759100) == 20\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 31", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 31.\nللتوضيح: الاستدعاء `sum_digit_pow(82121)` يُرجع `3`.\nالجواب:", "qhash": "b5c7ba4bcc1ccf07"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=4):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(9))\nprint(h(9, -2))\nprint(h(h(-2), 9))", "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(9))\nprint(h(9, -2))\nprint(h(h(-2), 9))\n```\nالجواب:", "qhash": "a5af7e1f0f4a7956", "answer": "5\n11\n11", "completion": " الناتج:\n```text\n5\n11\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 3 + 3 for x in range(-6, 2) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 3 + 3 for x in range(-6, 2) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "40227c257f474cec", "answer": "[-9, 0]\n2 -9", "completion": " الناتج:\n```text\n[-9, 0]\n2 -9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert cycle([50, 9, 21, 49, 23, 2, 50]) == [23, 2, 50, 50, 9, 21, 49]", "assert cycle([32]) == [32]", "assert cycle([34, 11, 0]) == [0, 34, 11]", "assert cycle([12, 24]) == [12, 24]", "assert cycle([8, -6, 4, 12, 33]) == [8, -6, 4, 12, 33]", "assert cycle([5, 9, 6, 22, 20, 32, 1]) == [20, 32, 1, 5, 9, 6, 22]", "assert cycle([]) == []"], "test_code": "assert cycle([50, 9, 21, 49, 23, 2, 50]) == [23, 2, 50, 50, 9, 21, 49]\nassert cycle([32]) == [32]\nassert cycle([34, 11, 0]) == [0, 34, 11]\nassert cycle([12, 24]) == [12, 24]\nassert cycle([8, -6, 4, 12, 33]) == [8, -6, 4, 12, 33]\nassert cycle([5, 9, 6, 22, 20, 32, 1]) == [20, 32, 1, 5, 9, 6, 22]\nassert cycle([]) == []", "answer": "def cycle(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 cycle(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 cycle(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([50, 9, 21, 49, 23, 2, 50])` يُرجع `[23, 2, 50, 50, 9, 21, 49]`.\nالجواب:", "qhash": "30f7d395af8ff91f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 28717\ncount = 0\nwhile x > 3:\n x = x // 7\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 28717\ncount = 0\nwhile x > 3:\n x = x // 7\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "af2f5302904715a7", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'علي': 14, 'مريم': 18, 'زينب': 24, 'سعيد': 20, 'رنا': 43}\npoints['سعيد'] += 20\npoints['راشد'] = 52\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 = {'علي': 14, 'مريم': 18, 'زينب': 24, 'سعيد': 20, 'رنا': 43}\npoints['سعيد'] += 20\npoints['راشد'] = 52\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": "39f3f46b8ac16629", "answer": "6\nراشد\n191\n[('علي', 14), ('مريم', 18)]", "completion": " الناتج:\n```text\n6\nراشد\n191\n[('علي', 14), ('مريم', 18)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total", "tests": ["assert power_sum(3) == 98", "assert power_sum(1) == 7", "assert power_sum(12) == 4550", "assert power_sum(14) == 7105", "assert power_sum(2) == 35", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(3) == 98\nassert power_sum(1) == 7\nassert power_sum(12) == 4550\nassert power_sum(14) == 7105\nassert power_sum(2) == 35\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 ** 2\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `power_sum(3)` يُرجع `98`.\nالجواب:", "qhash": "bc2fb622f6594fdb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 9", "tests": ["assert digit_score(43074) == 0", "assert digit_score(326057) == 6", "assert digit_score(975019) == 3", "assert digit_score(414680) == 7", "assert digit_score(589344) == 4", "assert digit_score(615108) == 1", "assert digit_score(559876) == 1", "assert digit_score(0) == 0"], "test_code": "assert digit_score(43074) == 0\nassert digit_score(326057) == 6\nassert digit_score(975019) == 3\nassert digit_score(414680) == 7\nassert digit_score(589344) == 4\nassert digit_score(615108) == 1\nassert digit_score(559876) == 1\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 9", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 9\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 9.\nللتوضيح: الاستدعاء `digit_score(43074)` يُرجع `0`.\nالجواب:", "qhash": "ddc39d1b18845039"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(10))\n```\nالجواب:", "qhash": "6182fab26d3fc6ca", "answer": "233", "completion": " الناتج:\n```text\n233\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'حسن': 28, 'منى': 42, 'هشام': 17, 'وليد': 46, 'هدى': 2}\nscores['هشام'] += 8\nscores['سعيد'] = 56\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'حسن': 28, 'منى': 42, 'هشام': 17, 'وليد': 46, 'هدى': 2}\nscores['هشام'] += 8\nscores['سعيد'] = 56\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('يوسف', -1))\n```\nالجواب:", "qhash": "f1a5aa81a6a23bcd", "answer": "6\nسعيد\n199\n-1", "completion": " الناتج:\n```text\n6\nسعيد\n199\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('ليل تفاحة نهر حاسوب') == 1", "assert letter_hits('طائرة جبل') == 0", "assert letter_hits('شمس حديقة قهوة برتقال جمل طالب تفاحة') == 1", "assert letter_hits('برمجة دفتر وردة صديق نهر خبز ليل سوق') == 1", "assert letter_hits('') == 0", "assert letter_hits('قهوة') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('سوق عمل رمل شمس صحراء مدرسة مطر حاسوب') == 0\nassert letter_hits('ليل تفاحة نهر حاسوب') == 1\nassert letter_hits('طائرة جبل') == 0\nassert letter_hits('شمس حديقة قهوة برتقال جمل طالب تفاحة') == 1\nassert letter_hits('برمجة دفتر وردة صديق نهر خبز ليل سوق') == 1\nassert letter_hits('') == 0\nassert letter_hits('قهوة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ه» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('سوق عمل رمل شمس صحراء مدرسة مطر حاسوب')` يُرجع `0`.\nالجواب:", "qhash": "a7af3716b871ae13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سيارة جبل ماء بيت') == 0", "assert lead_count('طالب علم') == 0", "assert lead_count('مدينة قمر تفاحة جبل باب تفاحة') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('حديقة طائرة شجرة تفاحة بيت تفاحة') == 2\nassert lead_count('حاسوب صحراء فجر فجر تفاحة وردة سماء تفاحة') == 2\nassert lead_count('سفينة حصان جبل حاسوب شجرة تفاحة تفاحة سيارة') == 2\nassert lead_count('سيارة جبل ماء بيت') == 0\nassert lead_count('طالب علم') == 0\nassert lead_count('مدينة قمر تفاحة جبل باب تفاحة') == 2\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": "8bfa9475536a8e45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20']", "assert fizz(3) == ['1', '2', '3']", "assert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']", "assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']", "assert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17']"], "test_code": "assert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20']\nassert fizz(3) == ['1', '2', '3']\nassert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']\nassert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']\nassert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 9 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(20)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20']`.\nالجواب:", "qhash": "99a933fd0416f854"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 0\n return go(n - 1) + go(n - 2)\n\nprint(go(17))", "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(17))\n```\nالجواب:", "qhash": "57cfd51a9e9d1919", "answer": "1597", "completion": " الناتج:\n```text\n1597\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(188) == 2790", "assert multiples_total(147) == 1800", "assert multiples_total(178) == 2610", "assert multiples_total(112) == 1026", "assert multiples_total(250) == 5166", "assert multiples_total(3) == 0", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(188) == 2790\nassert multiples_total(147) == 1800\nassert multiples_total(178) == 2610\nassert multiples_total(112) == 1026\nassert multiples_total(250) == 5166\nassert multiples_total(3) == 0\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 12.\nمثال: `multiples_total(188)` يجب أن تُرجع `2790`.\nالجواب:", "qhash": "308c67b592b02936"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [24, 0, -4, 16, 26, 10, 21, 18]\nprint(nums[0:1])\nprint(nums[::2])\nprint(max(nums[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [24, 0, -4, 16, 26, 10, 21, 18]\nprint(nums[0:1])\nprint(nums[::2])\nprint(max(nums[0:1]))\n```\nالجواب:", "qhash": "f4a37e61c0540587", "answer": "[24]\n[24, -4, 26, 21]\n24", "completion": " الناتج:\n```text\n[24]\n[24, -4, 26, 21]\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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_special([26, 78, 20, 82, 60, 58, 10, 18, 26, 33]) == 2", "assert count_special([-19, -17, 1, 5, -12, -40, 31, 5]) == 0", "assert count_special([48, 5, 12, -14, 77, 38, 68, 71, 18, -27, -22, 22]) == 1", "assert count_special([14, -5, -8, 24, 1, 73, -8, 44, 50]) == 0", "assert count_special([87, 21]) == 0", "assert count_special([16, 72, 81, 50, 83, 22, 76, -25, 55, 89, 3, 8]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([26, 78, 20, 82, 60, 58, 10, 18, 26, 33]) == 2\nassert count_special([-19, -17, 1, 5, -12, -40, 31, 5]) == 0\nassert count_special([48, 5, 12, -14, 77, 38, 68, 71, 18, -27, -22, 22]) == 1\nassert count_special([14, -5, -8, 24, 1, 73, -8, 44, 50]) == 0\nassert count_special([87, 21]) == 0\nassert count_special([16, 72, 81, 50, 83, 22, 76, -25, 55, 89, 3, 8]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([26, 78, 20, 82, 60, 58, 10, 18, 26, 33])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d105cb035d8652d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['window', 'apple', 'banana', 'desert', 'pixel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['window', 'apple', 'banana', 'desert', 'pixel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "eee6c8476f39e3ba", "answer": "['apple', 'pixel', 'window', 'banana', 'desert']\n['window', 'desert', 'banana']", "completion": " الناتج:\n```text\n['apple', 'pixel', 'window', 'banana', 'desert']\n['window', 'desert', 'banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 5 for x in range(-3, 6) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 5 for x in range(-3, 6) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a362d59b8380cb2e", "answer": "[-1, -4, 11]\n3 6", "completion": " الناتج:\n```text\n[-1, -4, 11]\n3 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -4 * x ** 2 + (9) * x + (8)", "tests": ["assert quad(9) == -235", "assert quad(11) == -377", "assert quad(-16) == -1160", "assert quad(5) == -47", "assert quad(5) == -47", "assert quad(-13) == -785", "assert quad(6) == -82", "assert quad(0) == 8"], "test_code": "assert quad(9) == -235\nassert quad(11) == -377\nassert quad(-16) == -1160\nassert quad(5) == -47\nassert quad(5) == -47\nassert quad(-13) == -785\nassert quad(6) == -82\nassert quad(0) == 8", "answer": "def quad(x):\n return -4 * x ** 2 + (9) * x + (8)", "completion": " ```python\ndef quad(x):\n return -4 * x ** 2 + (9) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -4x² + 9x + 8 عند العدد الصحيح x.\nمثال: `quad(9)` يجب أن تُرجع `-235`.\nالجواب:", "qhash": "e01990c45a6e4d1e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 52)", "tests": ["assert select_range([21, 25, 35, 37, 59, 42, 8, 61]) == [105, 125, 175, 185, 210]", "assert select_range([3, -15, -17, 9, 22, 30]) == [110, 150]", "assert select_range([34, 9, 54, 11, 7, 33, -21, -24, -28, 23]) == [115, 165, 170]", "assert select_range([35, 45, 11]) == [175, 225]", "assert select_range([-26, 49, 34, 11]) == [170, 245]", "assert select_range([58]) == []", "assert select_range([39, 38, 1, -10, 50, 11, -24]) == [190, 195, 250]", "assert select_range([]) == []"], "test_code": "assert select_range([21, 25, 35, 37, 59, 42, 8, 61]) == [105, 125, 175, 185, 210]\nassert select_range([3, -15, -17, 9, 22, 30]) == [110, 150]\nassert select_range([34, 9, 54, 11, 7, 33, -21, -24, -28, 23]) == [115, 165, 170]\nassert select_range([35, 45, 11]) == [175, 225]\nassert select_range([-26, 49, 34, 11]) == [170, 245]\nassert select_range([58]) == []\nassert select_range([39, 38, 1, -10, 50, 11, -24]) == [190, 195, 250]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 52)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 52)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 13 ≤ x ≤ 52، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([21, 25, 35, 37, 59, 42, 8, 61])` يُرجع `[105, 125, 175, 185, 210]`.\nالجواب:", "qhash": "ebdfca49c28095f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'جمل'\nprint(kalima.count('س'))\nprint('س' in kalima)\nprint(kalima.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'جمل'\nprint(kalima.count('س'))\nprint('س' in kalima)\nprint(kalima.split())\n```\nالجواب:", "qhash": "41ce57885961b2ce", "answer": "0\nFalse\n['جمل']", "completion": " الناتج:\n```text\n0\nFalse\n['جمل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 41", "tests": ["assert multi_fact(9) == 4", "assert multi_fact(27) == 16", "assert multi_fact(0) == 1", "assert multi_fact(14) == 40", "assert multi_fact(21) == 32", "assert multi_fact(31) == 4", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(9) == 4\nassert multi_fact(27) == 16\nassert multi_fact(0) == 1\nassert multi_fact(14) == 40\nassert multi_fact(21) == 32\nassert multi_fact(31) == 4\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 41", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(9)` يُرجع `4`.\nالجواب:", "qhash": "81ab247ee7bf5327"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('cloud music coffee winter') == 'sbekt ckiys sevvuu mydjuh'", "assert caesar('at') == 'qj'", "assert caesar('engine of orange by A1') == 'udwydu ev ehqdwu ro A1'", "assert caesar('code to stone we code OK') == 'setu je ijedu mu setu OK'", "assert caesar('banana window in in table') == 'rqdqdq mydtem yd yd jqrbu'", "assert caesar('on on engine river stone') == 'ed ed udwydu hyluh ijedu'", "assert caesar('') == ''"], "test_code": "assert caesar('cloud music coffee winter') == 'sbekt ckiys sevvuu mydjuh'\nassert caesar('at') == 'qj'\nassert caesar('engine of orange by A1') == 'udwydu ev ehqdwu ro A1'\nassert caesar('code to stone we code OK') == 'setu je ijedu mu setu OK'\nassert caesar('banana window in in table') == 'rqdqdq mydtem yd yd jqrbu'\nassert caesar('on on engine river stone') == 'ed ed udwydu hyluh ijedu'\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 + (16)) % 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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('cloud music coffee winter')` يجب أن تُرجع `'sbekt ckiys sevvuu mydjuh'`.\nالجواب:", "qhash": "47d2741be9f9092b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=4):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(-4))\nprint(compute(-4, 8))\nprint(compute(compute(8), -4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=4):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(-4))\nprint(compute(-4, 8))\nprint(compute(compute(8), -4))\n```\nالجواب:", "qhash": "9d99623a5d9964d3", "answer": "0\n4\n8", "completion": " الناتج:\n```text\n0\n4\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 16\nfor n in range(8, 27, 4):\n total += n * 2\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 16\nfor n in range(8, 27, 4):\n total += n * 2\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "d6893d07ee0ea897", "answer": "176\n24", "completion": " الناتج:\n```text\n176\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(26) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', '16', '17', 'Fizz', '19', '20', 'Buzz', '22', '23', 'Fizz', '25', '26']", "assert fizz(6) == ['1', '2', '3', '4', '5', 'Fizz']", "assert fizz(12) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz']", "assert fizz(14) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz', '13', 'Buzz']", "assert fizz(4) == ['1', '2', '3', '4']"], "test_code": "assert fizz(26) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', '16', '17', 'Fizz', '19', '20', 'Buzz', '22', '23', 'Fizz', '25', '26']\nassert fizz(6) == ['1', '2', '3', '4', '5', 'Fizz']\nassert fizz(12) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz']\nassert fizz(14) == ['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz', '13', 'Buzz']\nassert fizz(4) == ['1', '2', '3', '4']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Fizz'\n if i % 7 == 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 % 6 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Fizz'، وعلى 7 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(26)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Fizz', 'Buzz', '8', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', '16', '17', 'Fizz', '19', '20', 'Buzz', '22', '23', 'Fizz', '25', '26']`.\nالجواب:", "qhash": "9277da3a2dab090f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ت»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('شجرة قمر كتاب')` يُرجع `0`.\nالجواب:", "qhash": "973f584895270d86"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([14, 2, 17, 60, 49, 90, 40, 4, 66]) == 0", "assert only_div([47, 41, -3, -13]) == 1", "assert only_div([46, 55]) == 0", "assert only_div([-37, 50, -6, 73, 66, 15, 38, 79, 64]) == 1", "assert only_div([17, 15, -31, 19, 85, 47, 43]) == 1", "assert only_div([4, 19, 86, 62, 12, 2, 58]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([14, 2, 17, 60, 49, 90, 40, 4, 66]) == 0\nassert only_div([47, 41, -3, -13]) == 1\nassert only_div([46, 55]) == 0\nassert only_div([-37, 50, -6, 73, 66, 15, 38, 79, 64]) == 1\nassert only_div([17, 15, -31, 19, 85, 47, 43]) == 1\nassert only_div([4, 19, 86, 62, 12, 2, 58]) == 0\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([14, 2, 17, 60, 49, 90, 40, 4, 66])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "7aa1ca26723e520b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'river_cloud'\nprint(word.index('i') + len(word))\nprint(word.upper())\nprint(word[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'river_cloud'\nprint(word.index('i') + len(word))\nprint(word.upper())\nprint(word[-4:])\n```\nالجواب:", "qhash": "49031fb82afc34be", "answer": "12\nRIVER_CLOUD\nloud", "completion": " الناتج:\n```text\n12\nRIVER_CLOUD\nloud\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 11 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']", "assert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15']", "assert fizz(5) == ['1', '2', '3', '4', '5']", "assert fizz(4) == ['1', '2', '3', '4']", "assert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18']"], "test_code": "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']\nassert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15']\nassert fizz(5) == ['1', '2', '3', '4', '5']\nassert fizz(4) == ['1', '2', '3', '4']\nassert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Ping'، وعلى 11 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(14)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']`.\nالجواب:", "qhash": "d3357260a250e787"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "tests": ["assert series(4) == 90", "assert series(2) == 15", "assert series(13) == 2457", "assert series(0) == 0", "assert series(6) == 273", "assert series(1) == 3", "assert series(0) == 0"], "test_code": "assert series(4) == 90\nassert series(2) == 15\nassert series(13) == 2457\nassert series(0) == 0\nassert series(6) == 273\nassert series(1) == 3\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 2\n return total\n```\nمثال: `series(4)` يجب أن تُرجع `90`.\nالجواب:", "qhash": "ad949c8848dc1f6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total", "tests": ["assert series(7) == 32732", "assert series(3) == 686", "assert series(4) == 2478", "assert series(9) == 107331", "assert series(1) == 7", "assert series(1) == 7", "assert series(0) == 0"], "test_code": "assert series(7) == 32732\nassert series(3) == 686\nassert series(4) == 2478\nassert series(9) == 107331\nassert series(1) == 7\nassert series(1) == 7\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 4\n return total\n```\nمثال: `series(7)` يجب أن تُرجع `32732`.\nالجواب:", "qhash": "4476ee12ec32243f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 17 <= x <= 40)", "tests": ["assert clip_scale([38, 28, 39, 18, 43, 15]) == [18, 28, 38, 39]", "assert clip_scale([-7, 39, 46, -7, -20]) == [39]", "assert clip_scale([58, 52, 17, 29]) == [17, 29]", "assert clip_scale([]) == []", "assert clip_scale([4, 7, 27, 58, -5]) == [27]", "assert clip_scale([-29, 2, 49, 19, 49, -2, 57, 1]) == [19]", "assert clip_scale([55, 4]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([38, 28, 39, 18, 43, 15]) == [18, 28, 38, 39]\nassert clip_scale([-7, 39, 46, -7, -20]) == [39]\nassert clip_scale([58, 52, 17, 29]) == [17, 29]\nassert clip_scale([]) == []\nassert clip_scale([4, 7, 27, 58, -5]) == [27]\nassert clip_scale([-29, 2, 49, 19, 49, -2, 57, 1]) == [19]\nassert clip_scale([55, 4]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 17 <= x <= 40)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if 17 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 17 ≤ x ≤ 40، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([38, 28, 39, 18, 43, 15])` يُرجع `[18, 28, 38, 39]`.\nالجواب:", "qhash": "2ea3a10e880faa1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 10\nfor x in range(8, 33, 4):\n total -= x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 10\nfor x in range(8, 33, 4):\n total -= x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "e1a175512b5f18e9", "answer": "-1250\n32", "completion": " الناتج:\n```text\n-1250\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-1, 31, 16, -3, 26, -4, 40, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-1, 31, 16, -3, 26, -4, 40, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "44b0be49db13ebef", "answer": "[26, 31, 16, 14, 40, -1, -3, -4]\n[40, 31, 26]", "completion": " الناتج:\n```text\n[26, 31, 16, 14, 40, -1, -3, -4]\n[40, 31, 26]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert div_not([59, 81, 89, 47, 87, 9, 15, 0]) == 0", "assert div_not([-33, 67, 28, 40, 16, 70, 61, 56, -5, 58, 26]) == 0", "assert div_not([87, 86, 85, -35, 2, -17, 55, 12, 10, 68, 78]) == 1", "assert div_not([80, 78, -30, 72, 69, 7, 19]) == 1", "assert div_not([-12, -39, 45]) == 0", "assert div_not([60, 33, 51, 63, 67, 4, 51]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([59, 81, 89, 47, 87, 9, 15, 0]) == 0\nassert div_not([-33, 67, 28, 40, 16, 70, 61, 56, -5, 58, 26]) == 0\nassert div_not([87, 86, 85, -35, 2, -17, 55, 12, 10, 68, 78]) == 1\nassert div_not([80, 78, -30, 72, 69, 7, 19]) == 1\nassert div_not([-12, -39, 45]) == 0\nassert div_not([60, 33, 51, 63, 67, 4, 51]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([59, 81, 89, 47, 87, 9, 15, 0])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ecbf951912f55507"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_count(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ا»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('صحراء كتاب باب علم قلم مدرسة علم')` يُرجع `0`.\nالجواب:", "qhash": "41274bffc9426e52"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 3 * x ** 2 + (5) * x + (5)", "tests": ["assert eval_poly(1) == 13", "assert eval_poly(14) == 663", "assert eval_poly(4) == 73", "assert eval_poly(1) == 13", "assert eval_poly(11) == 423", "assert eval_poly(-5) == 55", "assert eval_poly(18) == 1067", "assert eval_poly(0) == 5"], "test_code": "assert eval_poly(1) == 13\nassert eval_poly(14) == 663\nassert eval_poly(4) == 73\nassert eval_poly(1) == 13\nassert eval_poly(11) == 423\nassert eval_poly(-5) == 55\nassert eval_poly(18) == 1067\nassert eval_poly(0) == 5", "answer": "def eval_poly(x):\n return 3 * x ** 2 + (5) * x + (5)", "completion": " ```python\ndef eval_poly(x):\n return 3 * x ** 2 + (5) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 3x² + 5x + 5 عند العدد الصحيح x.\nمثال: `eval_poly(1)` يجب أن تُرجع `13`.\nالجواب:", "qhash": "6b908383d18555eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([49, 50, 61, 72, 15, 29, 11, 26, 31, 27]) == 1", "assert div_not([54, -8, -38, 12, 10, 66, -28, 3, 82, 75, -22, -20]) == 1", "assert div_not([14, 14, -35, 88, 12, 44]) == 0", "assert div_not([18]) == 1", "assert div_not([79, -24]) == 0", "assert div_not([50, 47, 50, 84, -20, -13]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([49, 50, 61, 72, 15, 29, 11, 26, 31, 27]) == 1\nassert div_not([54, -8, -38, 12, 10, 66, -28, 3, 82, 75, -22, -20]) == 1\nassert div_not([14, 14, -35, 88, 12, 44]) == 0\nassert div_not([18]) == 1\nassert div_not([79, -24]) == 0\nassert div_not([50, 47, 50, 84, -20, -13]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([49, 50, 61, 72, 15, 29, 11, 26, 31, 27])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d3b4b972648c2309"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('data to vector OK') == 'urkr kf mvtkfi OK'", "assert rot('window 2024') == 'nzeufn 2024'", "assert rot('at A1') == 'rk A1'", "assert rot('summer coffee') == 'jlddvi tfwwvv'", "assert rot('table vector') == 'krscv mvtkfi'", "assert rot('in orange data A1') == 'ze firexv urkr A1'", "assert rot('') == ''"], "test_code": "assert rot('data to vector OK') == 'urkr kf mvtkfi OK'\nassert rot('window 2024') == 'nzeufn 2024'\nassert rot('at A1') == 'rk A1'\nassert rot('summer coffee') == 'jlddvi tfwwvv'\nassert rot('table vector') == 'krscv mvtkfi'\nassert rot('in orange data A1') == 'ze firexv urkr 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 + (-9)) % 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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('data to vector OK')` يجب أن تُرجع `'urkr kf mvtkfi OK'`.\nالجواب:", "qhash": "d287f881eeadb4dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "tests": ["assert digit_score(28028) == 18", "assert digit_score(458269) == 2", "assert digit_score(210521) == 21", "assert digit_score(704602) == 9", "assert digit_score(106395) == 6", "assert digit_score(503085) == 15", "assert digit_score(963969) == 4", "assert digit_score(0) == 0"], "test_code": "assert digit_score(28028) == 18\nassert digit_score(458269) == 2\nassert digit_score(210521) == 21\nassert digit_score(704602) == 9\nassert digit_score(106395) == 6\nassert digit_score(503085) == 15\nassert digit_score(963969) == 4\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 22.\nللتوضيح: الاستدعاء `digit_score(28028)` يُرجع `18`.\nالجواب:", "qhash": "3752d89fd7dd8145"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['orange', 'music', 'table', 'stone', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['orange', 'music', 'table', 'stone', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "dde02865e0121cda", "answer": "['music', 'table', 'stone', 'orange', 'garden']\n['orange', 'garden', 'table']", "completion": " الناتج:\n```text\n['music', 'table', 'stone', 'orange', 'garden']\n['orange', 'garden', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 8) // 2 for x in range(-3, 4) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 8) // 2 for x in range(-3, 4) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "b555a5360458d5b8", "answer": "[2, 3, 4, 5]\n4 14", "completion": " الناتج:\n```text\n[2, 3, 4, 5]\n4 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 13", "tests": ["assert fact_mod(4) == 11", "assert fact_mod(50) == 0", "assert fact_mod(4) == 11", "assert fact_mod(46) == 0", "assert fact_mod(28) == 0", "assert fact_mod(5) == 3", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 11\nassert fact_mod(50) == 0\nassert fact_mod(4) == 11\nassert fact_mod(46) == 0\nassert fact_mod(28) == 0\nassert fact_mod(5) == 3\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 13", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(4)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "d29517a57aa4ec37"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 35", "tests": ["assert dig_pow_mod(1635) == 19", "assert dig_pow_mod(415209) == 17", "assert dig_pow_mod(167854) == 1", "assert dig_pow_mod(545314) == 21", "assert dig_pow_mod(959828) == 25", "assert dig_pow_mod(901561) == 22", "assert dig_pow_mod(631139) == 21", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(1635) == 19\nassert dig_pow_mod(415209) == 17\nassert dig_pow_mod(167854) == 1\nassert dig_pow_mod(545314) == 21\nassert dig_pow_mod(959828) == 25\nassert dig_pow_mod(901561) == 22\nassert dig_pow_mod(631139) == 21\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 35", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 35\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 35.\nللتوضيح: الاستدعاء `dig_pow_mod(1635)` يُرجع `19`.\nالجواب:", "qhash": "8e9d66fbb5abc06a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 17", "tests": ["assert fact_mod(6) == 6", "assert fact_mod(48) == 0", "assert fact_mod(26) == 0", "assert fact_mod(0) == 1", "assert fact_mod(42) == 0", "assert fact_mod(19) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 6\nassert fact_mod(48) == 0\nassert fact_mod(26) == 0\nassert fact_mod(0) == 1\nassert fact_mod(42) == 0\nassert fact_mod(19) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 17", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(6)` يُرجع `6`.\nالجواب:", "qhash": "3820aec925f49859"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('brain matrix python OK') == 'vluch gunlcr jsnbih OK'", "assert decode('an A1') == 'uh A1'", "assert decode('brain on') == 'vluch ih'", "assert decode('orange rocket in planet Hello') == 'iluhay liweyn ch jfuhyn Hyffi'", "assert decode('winter by') == 'qchnyl vs'", "assert decode('it music light planet') == 'cn gomcw fcabn jfuhyn'", "assert decode('') == ''"], "test_code": "assert decode('brain matrix python OK') == 'vluch gunlcr jsnbih OK'\nassert decode('an A1') == 'uh A1'\nassert decode('brain on') == 'vluch ih'\nassert decode('orange rocket in planet Hello') == 'iluhay liweyn ch jfuhyn Hyffi'\nassert decode('winter by') == 'qchnyl vs'\nassert decode('it music light planet') == 'cn gomcw fcabn jfuhyn'\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 + (20)) % 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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('brain matrix python OK')` يُرجع `'vluch gunlcr jsnbih OK'`.\nالجواب:", "qhash": "4353c1a78acf3417"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-4, -28, -10, 38, 2, 54, 22, -17, 18]) == 22", "assert find_max_div([-55, -11, -11]) == -11", "assert find_max_div([1]) == None", "assert find_max_div([31, -15, 27, -22, -21, 10, -21]) == -22", "assert find_max_div([26, 41, 28, 26, 36]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-4, -28, -10, 38, 2, 54, 22, -17, 18]) == 22\nassert find_max_div([-55, -11, -11]) == -11\nassert find_max_div([1]) == None\nassert find_max_div([31, -15, 27, -22, -21, 10, -21]) == -22\nassert find_max_div([26, 41, 28, 26, 36]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([-4, -28, -10, 38, 2, 54, 22, -17, 18])` يُرجع `22`.\nالجواب:", "qhash": "bb9cf7833fefea78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('رنا', 94), ('ليلى', 23), ('خالد', 100), ('يوسف', 45)]\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 = [('رنا', 94), ('ليلى', 23), ('خالد', 100), ('يوسف', 45)]\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": "8130768ea92d7a55", "answer": "[('ليلى', 23), ('يوسف', 45), ('رنا', 94), ('خالد', 100)]\n['خالد', 'رنا']", "completion": " الناتج:\n```text\n[('ليلى', 23), ('يوسف', 45), ('رنا', 94), ('خالد', 100)]\n['خالد', 'رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'حاسوب'\nprint(text.replace(' ', '-'))\nprint(text[::-1])\nprint(text.find('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'حاسوب'\nprint(text.replace(' ', '-'))\nprint(text[::-1])\nprint(text.find('ب'))\n```\nالجواب:", "qhash": "5d86ff80ce9cdb8a", "answer": "حاسوب\nبوساح\n4", "completion": " الناتج:\n```text\nحاسوب\nبوساح\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'ليلى': 9, 'أحمد': 25, 'راشد': 6}\npoints['ليلى'] += 8\npoints['حسن'] = 26\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 36])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'ليلى': 9, 'أحمد': 25, 'راشد': 6}\npoints['ليلى'] += 8\npoints['حسن'] = 26\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 36])\n```\nالجواب:", "qhash": "632994c0a1318f31", "answer": "4\nحسن\n74\n[]", "completion": " الناتج:\n```text\n4\nحسن\n74\n[]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('حسن', 37), ('هدى', 39), ('ليلى', 46), ('علي', 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 = [('حسن', 37), ('هدى', 39), ('ليلى', 46), ('علي', 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": "7a1f6d9047606e2a", "answer": "[('علي', 11), ('حسن', 37), ('هدى', 39), ('ليلى', 46)]\n['ليلى', 'هدى']", "completion": " الناتج:\n```text\n[('علي', 11), ('حسن', 37), ('هدى', 39), ('ليلى', 46)]\n['ليلى', 'هدى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'code_pixel'\nprint(text.find('x'))\nprint(text.count('x'))\nprint(text.index('x') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'code_pixel'\nprint(text.find('x'))\nprint(text.count('x'))\nprint(text.index('x') + len(text))\n```\nالجواب:", "qhash": "8bb345d7afd90a22", "answer": "7\n1\n17", "completion": " الناتج:\n```text\n7\n1\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 94163\ncount = 0\nwhile m > 17:\n m = m // 4\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 94163\ncount = 0\nwhile m > 17:\n m = m // 4\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "8f97bdce353a366b", "answer": "5 7", "completion": " الناتج:\n```text\n5 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(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 running_sum([75, 16, 31, 94, 74, 95, 26, 41]) == [75, 91, 122, 0, 74, 169, 195, 0]", "assert running_sum([]) == []", "assert running_sum([29, 176, 147, 153, 98]) == [29, 0, 147, 0, 98]", "assert running_sum([25, 72, 150, 96, 80, 2, 143, 20, 99]) == [25, 97, 0, 96, 176, 178, 0, 20, 119]", "assert running_sum([36, 142, 121, 129, 45, 148, 122, 118, 179]) == [36, 178, 0, 129, 174, 0, 122, 0, 179]", "assert running_sum([53, 100, 172, 22, 59, 66]) == [53, 153, 0, 22, 81, 147]", "assert running_sum([]) == []"], "test_code": "assert running_sum([75, 16, 31, 94, 74, 95, 26, 41]) == [75, 91, 122, 0, 74, 169, 195, 0]\nassert running_sum([]) == []\nassert running_sum([29, 176, 147, 153, 98]) == [29, 0, 147, 0, 98]\nassert running_sum([25, 72, 150, 96, 80, 2, 143, 20, 99]) == [25, 97, 0, 96, 176, 178, 0, 20, 119]\nassert running_sum([36, 142, 121, 129, 45, 148, 122, 118, 179]) == [36, 178, 0, 129, 174, 0, 122, 0, 179]\nassert running_sum([53, 100, 172, 22, 59, 66]) == [53, 153, 0, 22, 81, 147]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 200 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([75, 16, 31, 94, 74, 95, 26, 41])` يُرجع `[75, 91, 122, 0, 74, 169, 195, 0]`.\nالجواب:", "qhash": "c95bcc768a296bbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_by([4, 43, 10]) == [4, 43, 10]", "assert rotate_by([14, 16, -5, -3, 12, 44, 8, 10, 34, 40, 47, 10]) == [40, 47, 10, 14, 16, -5, -3, 12, 44, 8, 10, 34]", "assert rotate_by([35, 36, 26]) == [35, 36, 26]", "assert rotate_by([1, 11, 46, 13, 15, 48, 33, 44, 29, 8]) == [48, 33, 44, 29, 8, 1, 11, 46, 13, 15]", "assert rotate_by([8, -1, 0, 31, 37, 19, 12, 39, -6, 4]) == [19, 12, 39, -6, 4, 8, -1, 0, 31, 37]", "assert rotate_by([9]) == [9]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([4, 43, 10]) == [4, 43, 10]\nassert rotate_by([14, 16, -5, -3, 12, 44, 8, 10, 34, 40, 47, 10]) == [40, 47, 10, 14, 16, -5, -3, 12, 44, 8, 10, 34]\nassert rotate_by([35, 36, 26]) == [35, 36, 26]\nassert rotate_by([1, 11, 46, 13, 15, 48, 33, 44, 29, 8]) == [48, 33, 44, 29, 8, 1, 11, 46, 13, 15]\nassert rotate_by([8, -1, 0, 31, 37, 19, 12, 39, -6, 4]) == [19, 12, 39, -6, 4, 8, -1, 0, 31, 37]\nassert rotate_by([9]) == [9]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 15 % 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 = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([4, 43, 10])` يُرجع `[4, 43, 10]`.\nالجواب:", "qhash": "b29b3b14f8bd5ffa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([60, 7, 11, 16, 17, -11, 48]) == 60", "assert biggest_mult([-12, -30, -6]) == -6", "assert biggest_mult([1, 7, 13, 19]) == None", "assert biggest_mult([23, -3, 2, 11, 29, 29, -38, 26]) == None", "assert biggest_mult([19, 40, -11, -16]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([60, 7, 11, 16, 17, -11, 48]) == 60\nassert biggest_mult([-12, -30, -6]) == -6\nassert biggest_mult([1, 7, 13, 19]) == None\nassert biggest_mult([23, -3, 2, 11, 29, 29, -38, 26]) == None\nassert biggest_mult([19, 40, -11, -16]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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مثال: `biggest_mult([60, 7, 11, 16, 17, -11, 48])` يجب أن تُرجع `60`.\nالجواب:", "qhash": "dd16bf8542246b18"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -3 * x ** 2 + (0) * x + (-4)", "tests": ["assert quad(2) == -16", "assert quad(-19) == -1087", "assert quad(19) == -1087", "assert quad(8) == -196", "assert quad(14) == -592", "assert quad(-4) == -52", "assert quad(20) == -1204", "assert quad(0) == -4"], "test_code": "assert quad(2) == -16\nassert quad(-19) == -1087\nassert quad(19) == -1087\nassert quad(8) == -196\nassert quad(14) == -592\nassert quad(-4) == -52\nassert quad(20) == -1204\nassert quad(0) == -4", "answer": "def quad(x):\n return -3 * x ** 2 + (0) * x + (-4)", "completion": " ```python\ndef quad(x):\n return -3 * x ** 2 + (0) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -3x² + 0x - 4 عند العدد الصحيح x.\nمثال: `quad(2)` يجب أن تُرجع `-16`.\nالجواب:", "qhash": "ca9c4a6d509e5b63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'cego'}", "tests": ["assert char_counts('brain engine orange on falcon') == {'c': 1, 'e': 3, 'g': 2, 'o': 3}", "assert char_counts('falcon table on music is light') == {'c': 2, 'e': 1, 'g': 1, 'o': 2}", "assert char_counts('it banana a to planet engine') == {'c': 0, 'e': 3, 'g': 1, 'o': 1}", "assert char_counts('to winter at engine is to') == {'c': 0, 'e': 3, 'g': 1, 'o': 2}", "assert char_counts('river brain rocket is we') == {'c': 1, 'e': 3, 'g': 0, 'o': 1}", "assert char_counts('matrix camel cloud brain') == {'c': 2, 'e': 1, 'g': 0, 'o': 1}", "assert char_counts('') == {'c': 0, 'e': 0, 'g': 0, 'o': 0}"], "test_code": "assert char_counts('brain engine orange on falcon') == {'c': 1, 'e': 3, 'g': 2, 'o': 3}\nassert char_counts('falcon table on music is light') == {'c': 2, 'e': 1, 'g': 1, 'o': 2}\nassert char_counts('it banana a to planet engine') == {'c': 0, 'e': 3, 'g': 1, 'o': 1}\nassert char_counts('to winter at engine is to') == {'c': 0, 'e': 3, 'g': 1, 'o': 2}\nassert char_counts('river brain rocket is we') == {'c': 1, 'e': 3, 'g': 0, 'o': 1}\nassert char_counts('matrix camel cloud brain') == {'c': 2, 'e': 1, 'g': 0, 'o': 1}\nassert char_counts('') == {'c': 0, 'e': 0, 'g': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'cego'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'cego'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'e'، 'g'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('brain engine orange on falcon')` يجب أن تُرجع `{'c': 1, 'e': 3, 'g': 2, 'o': 3}`.\nالجواب:", "qhash": "87b6ab48f37add7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'صحراء'\nprint(w[::-1])\nprint(w.split())\nprint(w.count('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'صحراء'\nprint(w[::-1])\nprint(w.split())\nprint(w.count('ر'))\n```\nالجواب:", "qhash": "b35f24e5c946776e", "answer": "ءارحص\n['صحراء']\n1", "completion": " الناتج:\n```text\nءارحص\n['صحراء']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 8) == 1)", "tests": ["assert rel_prime_count(80) == 40", "assert rel_prime_count(38) == 19", "assert rel_prime_count(35) == 18", "assert rel_prime_count(102) == 51", "assert rel_prime_count(138) == 69", "assert rel_prime_count(42) == 21", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(80) == 40\nassert rel_prime_count(38) == 19\nassert rel_prime_count(35) == 18\nassert rel_prime_count(102) == 51\nassert rel_prime_count(138) == 69\nassert rel_prime_count(42) == 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, 8) == 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, 8) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 8، أي أن القاسم المشترك الأكبر لها مع 8 يساوي 1.\nمثال: `rel_prime_count(80)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "666b22d171d94bc2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-6, 0, 14, 34, 33, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-6, 0, 14, 34, 33, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "071409936f1a3028", "answer": "[14, 0, 33, 34, -6, -10]\n[34, 33, 14]", "completion": " الناتج:\n```text\n[14, 0, 33, 34, -6, -10]\n[34, 33, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 6\nfor j in range(0, 12, 4):\n acc -= j * 7\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 6\nfor j in range(0, 12, 4):\n acc -= j * 7\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "684e0693802b9d83", "answer": "-78\n8", "completion": " الناتج:\n```text\n-78\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "tests": ["assert add_multiples(275) == 12561", "assert add_multiples(269) == 12019", "assert add_multiples(261) == 11226", "assert add_multiples(184) == 5490", "assert add_multiples(170) == 4791", "assert add_multiples(132) == 2841", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(275) == 12561\nassert add_multiples(269) == 12019\nassert add_multiples(261) == 11226\nassert add_multiples(184) == 5490\nassert add_multiples(170) == 4791\nassert add_multiples(132) == 2841\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 9.\nمثال: `add_multiples(275)` يجب أن تُرجع `12561`.\nالجواب:", "qhash": "36da5e544479323d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [12, 34, -1, 22, 22, 25, 37]\nprint(xs[0:6])\nprint(xs[::-1])\nprint(min(xs[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [12, 34, -1, 22, 22, 25, 37]\nprint(xs[0:6])\nprint(xs[::-1])\nprint(min(xs[0:6]))\n```\nالجواب:", "qhash": "e11799b340b39758", "answer": "[12, 34, -1, 22, 22, 25]\n[37, 25, 22, 22, -1, 34, 12]\n-1", "completion": " الناتج:\n```text\n[12, 34, -1, 22, 22, 25]\n[37, 25, 22, 22, -1, 34, 12]\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 1 + 8 for x in range(-2, 5) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 1 + 8 for x in range(-2, 5) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f2616681eb6600fb", "answer": "[7, 9, 11]\n3 27", "completion": " الناتج:\n```text\n[7, 9, 11]\n3 27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 18\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 = 18\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": "8a6f14cd356905d7", "answer": "20", "completion": " الناتج:\n```text\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(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 how_many_div([50, 80, 23, 49, 40, 52, 12, 60, 12, 50]) == 3", "assert how_many_div([9, -37, -28, 11, 52, 48, 78, -18, 1, -5, -1]) == 2", "assert how_many_div([50, 63, 11, -10, 17, 12, 86]) == 1", "assert how_many_div([-4, 66, 51]) == 2", "assert how_many_div([38, 47, 51, -7, 52, 86]) == 1", "assert how_many_div([-23, -30, 28, 41, -36]) == 1", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([50, 80, 23, 49, 40, 52, 12, 60, 12, 50]) == 3\nassert how_many_div([9, -37, -28, 11, 52, 48, 78, -18, 1, -5, -1]) == 2\nassert how_many_div([50, 63, 11, -10, 17, 12, 86]) == 1\nassert how_many_div([-4, 66, 51]) == 2\nassert how_many_div([38, 47, 51, -7, 52, 86]) == 1\nassert how_many_div([-23, -30, 28, 41, -36]) == 1\nassert how_many_div([]) == 0", "answer": "def how_many_div(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 how_many_div(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 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([50, 80, 23, 49, 40, 52, 12, 60, 12, 50])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "2a0961484fe7cbb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['light', 'rocket', 'data', 'summer', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['light', 'rocket', 'data', 'summer', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "076907523e925012", "answer": "['data', 'light', 'rocket', 'summer', 'winter']\n['winter', 'summer', 'rocket']", "completion": " الناتج:\n```text\n['data', 'light', 'rocket', 'summer', 'winter']\n['winter', 'summer', 'rocket']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-12, 34, -2, 31, 26, 35, -2, -5]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-12, 34, -2, 31, 26, 35, -2, -5]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "fc3b18187503fa97", "answer": "[26, 31, 34, 35, -2, -2, -5, -12]\n[35, 34, 31]", "completion": " الناتج:\n```text\n[26, 31, 34, 35, -2, -2, -5, -12]\n[35, 34, 31]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [11, 16, 20, 18, 23]\nprint(a[2:4])\nprint(a[::2])\nprint(max(a[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [11, 16, 20, 18, 23]\nprint(a[2:4])\nprint(a[::2])\nprint(max(a[2:4]))\n```\nالجواب:", "qhash": "9e1ee4d74c662e75", "answer": "[20, 18]\n[11, 20, 23]\n20", "completion": " الناتج:\n```text\n[20, 18]\n[11, 20, 23]\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 5 <= x <= 39)", "tests": ["assert pick_between([46, 11, 43, -2, 48, 28, 4, -2, 12]) == [-112, -48, -44]", "assert pick_between([51, 38, 23, -1, 38, 57, 59, -23, 42, 37]) == [-152, -152, -148, -92]", "assert pick_between([52, -10, -15, 26, 0, 28, 19, 7, -17]) == [-112, -104, -76, -28]", "assert pick_between([-18, -30]) == []", "assert pick_between([-2, -16, 40]) == []", "assert pick_between([20, -25, -9, -5, 54]) == [-80]", "assert pick_between([8, 15, 48, -15, 33, 60]) == [-132, -60, -32]", "assert pick_between([]) == []"], "test_code": "assert pick_between([46, 11, 43, -2, 48, 28, 4, -2, 12]) == [-112, -48, -44]\nassert pick_between([51, 38, 23, -1, 38, 57, 59, -23, 42, 37]) == [-152, -152, -148, -92]\nassert pick_between([52, -10, -15, 26, 0, 28, 19, 7, -17]) == [-112, -104, -76, -28]\nassert pick_between([-18, -30]) == []\nassert pick_between([-2, -16, 40]) == []\nassert pick_between([20, -25, -9, -5, 54]) == [-80]\nassert pick_between([8, 15, 48, -15, 33, 60]) == [-132, -60, -32]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 5 <= x <= 39)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -4 for x in xs if 5 <= x <= 39)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 5 ≤ x ≤ 39، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([46, 11, 43, -2, 48, 28, 4, -2, 12])` يُرجع `[-112, -48, -44]`.\nالجواب:", "qhash": "0bcff2fb678b640d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('to rocket apple to window data coffee rocket') == 'rocket|coffee|data|window|apple|rocket'", "assert words_reversed('we') == ''", "assert words_reversed('on vector') == 'vector'", "assert words_reversed('of') == ''", "assert words_reversed('on in apple orange') == 'orange|apple'", "assert words_reversed('pixel falcon go table summer light desert') == 'desert|light|summer|table|falcon|pixel'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('to rocket apple to window data coffee rocket') == 'rocket|coffee|data|window|apple|rocket'\nassert words_reversed('we') == ''\nassert words_reversed('on vector') == 'vector'\nassert words_reversed('of') == ''\nassert words_reversed('on in apple orange') == 'orange|apple'\nassert words_reversed('pixel falcon go table summer light desert') == 'desert|light|summer|table|falcon|pixel'\nassert words_reversed('') == ''", "answer": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `words_reversed('to rocket apple to window data coffee rocket')` يُرجع `'rocket|coffee|data|window|apple|rocket'`.\nالجواب:", "qhash": "a818c169c44722a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('vector planet') == 'irpgbe cynarg'", "assert encode('banana pixel in') == 'onanan cvkry va'", "assert encode('go falcon in window Hello') == 'tb snypba va jvaqbj Hryyb'", "assert encode('to') == 'gb'", "assert encode('brain coffee !') == 'oenva pbssrr !'", "assert encode('summer vector an Hello') == 'fhzzre irpgbe na Hryyb'", "assert encode('') == ''"], "test_code": "assert encode('vector planet') == 'irpgbe cynarg'\nassert encode('banana pixel in') == 'onanan cvkry va'\nassert encode('go falcon in window Hello') == 'tb snypba va jvaqbj Hryyb'\nassert encode('to') == 'gb'\nassert encode('brain coffee !') == 'oenva pbssrr !'\nassert encode('summer vector an Hello') == 'fhzzre irpgbe na Hryyb'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('vector planet')` يُرجع `'irpgbe cynarg'`.\nالجواب:", "qhash": "11941af038f9e57d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert words_reversed('python camel music is') == 'is|music|camel|python'", "assert words_reversed('window a winter by music of go') == 'go|of|music|by|winter|a|window'", "assert words_reversed('winter coffee is code') == 'code|is|coffee|winter'", "assert words_reversed('matrix data music is') == 'is|music|data|matrix'", "assert words_reversed('desert music an banana') == 'banana|an|music|desert'", "assert words_reversed('window to an coffee orange engine') == 'engine|orange|coffee|an|to|window'", "assert words_reversed('signal data table light') == 'light|table|data|signal'"], "test_code": "assert words_reversed('python camel music is') == 'is|music|camel|python'\nassert words_reversed('window a winter by music of go') == 'go|of|music|by|winter|a|window'\nassert words_reversed('winter coffee is code') == 'code|is|coffee|winter'\nassert words_reversed('matrix data music is') == 'is|music|data|matrix'\nassert words_reversed('desert music an banana') == 'banana|an|music|desert'\nassert words_reversed('window to an coffee orange engine') == 'engine|orange|coffee|an|to|window'\nassert words_reversed('signal data table light') == 'light|table|data|signal'", "answer": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `words_reversed('python camel music is')` يُرجع `'is|music|camel|python'`.\nالجواب:", "qhash": "5cbc3e17468130b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('coffee coffee matrix it python by table') == 'table/by/python/it/matrix/coffee/coffee'", "assert words_reversed('brain banana window') == 'window/banana/brain'", "assert words_reversed('code engine python garden on') == 'on/garden/python/engine/code'", "assert words_reversed('brain is') == 'is/brain'", "assert words_reversed('cloud banana vector winter pixel matrix banana an') == 'an/banana/matrix/pixel/winter/vector/banana/cloud'", "assert words_reversed('winter desert') == 'desert/winter'", "assert words_reversed('vector python brain coffee music') == 'music/coffee/brain/python/vector'"], "test_code": "assert words_reversed('coffee coffee matrix it python by table') == 'table/by/python/it/matrix/coffee/coffee'\nassert words_reversed('brain banana window') == 'window/banana/brain'\nassert words_reversed('code engine python garden on') == 'on/garden/python/engine/code'\nassert words_reversed('brain is') == 'is/brain'\nassert words_reversed('cloud banana vector winter pixel matrix banana an') == 'an/banana/matrix/pixel/winter/vector/banana/cloud'\nassert words_reversed('winter desert') == 'desert/winter'\nassert words_reversed('vector python brain coffee music') == 'music/coffee/brain/python/vector'", "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('coffee coffee matrix it python by table')` يجب أن تُرجع `'table/by/python/it/matrix/coffee/coffee'`.\nالجواب:", "qhash": "991ab1e31892cdca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if 3 <= x <= 41)", "tests": ["assert filter_range([43, 29, 18, 19, -3, 21, 28]) == [-29, -28, -21, -19, -18]", "assert filter_range([19, 30, -29, 35, 11, 12]) == [-35, -30, -19, -12, -11]", "assert filter_range([-8, 58, 46, 24]) == [-24]", "assert filter_range([-6, 60, 28, -17, 3, 19]) == [-28, -19, -3]", "assert filter_range([-8, 23, -1, 49, -19, 0, 49, 46]) == [-23]", "assert filter_range([51, 34]) == [-34]", "assert filter_range([38, 52, 51, 13, 28, 41, 60, 56, 24]) == [-41, -38, -28, -24, -13]", "assert filter_range([]) == []"], "test_code": "assert filter_range([43, 29, 18, 19, -3, 21, 28]) == [-29, -28, -21, -19, -18]\nassert filter_range([19, 30, -29, 35, 11, 12]) == [-35, -30, -19, -12, -11]\nassert filter_range([-8, 58, 46, 24]) == [-24]\nassert filter_range([-6, 60, 28, -17, 3, 19]) == [-28, -19, -3]\nassert filter_range([-8, 23, -1, 49, -19, 0, 49, 46]) == [-23]\nassert filter_range([51, 34]) == [-34]\nassert filter_range([38, 52, 51, 13, 28, 41, 60, 56, 24]) == [-41, -38, -28, -24, -13]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if 3 <= x <= 41)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if 3 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 3 ≤ x ≤ 41، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([43, 29, 18, 19, -3, 21, 28])` يُرجع `[-29, -28, -21, -19, -18]`.\nالجواب:", "qhash": "7a66bcd70c441ff3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'rocket_river'\nprint(s[-3:])\nprint(s[0:11])\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'rocket_river'\nprint(s[-3:])\nprint(s[0:11])\nprint(s.split('_'))\n```\nالجواب:", "qhash": "7e2b8df3ea419afc", "answer": "ver\nrocket_rive\n['rocket', 'river']", "completion": " الناتج:\n```text\nver\nrocket_rive\n['rocket', 'river']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -4 for x in xs if 14 <= x <= 40)", "tests": ["assert filter_range([36, 22, 10, 26]) == [-144, -104, -88]", "assert filter_range([31, 58, 49, 47, 51, 25, 15, 27, 28, -13]) == [-124, -112, -108, -100, -60]", "assert filter_range([6, -30, -18, 60, -15, 44, 51, 58]) == []", "assert filter_range([-8, -28, 32, -30, 10, -28, 20, -10]) == [-128, -80]", "assert filter_range([-24]) == []", "assert filter_range([9, -20, 36, 27, 18, 28, 9, 32]) == [-144, -128, -112, -108, -72]", "assert filter_range([5, -1, -7, 40, 18, 41, -5, -9, 4, 0]) == [-160, -72]", "assert filter_range([]) == []"], "test_code": "assert filter_range([36, 22, 10, 26]) == [-144, -104, -88]\nassert filter_range([31, 58, 49, 47, 51, 25, 15, 27, 28, -13]) == [-124, -112, -108, -100, -60]\nassert filter_range([6, -30, -18, 60, -15, 44, 51, 58]) == []\nassert filter_range([-8, -28, 32, -30, 10, -28, 20, -10]) == [-128, -80]\nassert filter_range([-24]) == []\nassert filter_range([9, -20, 36, 27, 18, 28, 9, 32]) == [-144, -128, -112, -108, -72]\nassert filter_range([5, -1, -7, 40, 18, 41, -5, -9, 4, 0]) == [-160, -72]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -4 for x in xs if 14 <= x <= 40)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -4 for x in xs if 14 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 14 ≤ x ≤ 40، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([36, 22, 10, 26])` يُرجع `[-144, -104, -88]`.\nالجواب:", "qhash": "c91b89fa69d8d3fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('رمل مكتبة عربية طائرة سماء شمس نهار رمل') == 2", "assert count_initial('رمل باب بيت رمل') == 2", "assert count_initial('علم رمل برمجة') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('علم دفتر طائرة سماء فجر معلم') == 0\nassert count_initial('حاسوب جبل كتاب نور رمل جمل') == 1\nassert count_initial('رمل رمل مدرسة حديقة سوق ميناء سوق') == 2\nassert count_initial('رمل مكتبة عربية طائرة سماء شمس نهار رمل') == 2\nassert count_initial('رمل باب بيت رمل') == 2\nassert count_initial('علم رمل برمجة') == 1\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:\n if w.startswith('ر'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ر». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_initial(sentence):\n count = 0\n for w in sentence:\n if w.startswith('ر'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('علم دفتر طائرة سماء فجر معلم')` يُرجع `0`.\nالجواب:", "qhash": "067f3bc16da009a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert spin([4, 50, 36]) == [36, 4, 50]", "assert spin([4, 2, 5, 2, 20, 30, -7, 42, 5, 13, 41]) == [-7, 42, 5, 13, 41, 4, 2, 5, 2, 20, 30]", "assert spin([46, 39, 39, 37, 36, 19, 46, 20]) == [46, 39, 39, 37, 36, 19, 46, 20]", "assert spin([-6, 15, 26, -3, 41]) == [41, -6, 15, 26, -3]", "assert spin([46, 49, 37, 1]) == [46, 49, 37, 1]", "assert spin([2, 18, 46, 11, 39]) == [39, 2, 18, 46, 11]", "assert spin([]) == []"], "test_code": "assert spin([4, 50, 36]) == [36, 4, 50]\nassert spin([4, 2, 5, 2, 20, 30, -7, 42, 5, 13, 41]) == [-7, 42, 5, 13, 41, 4, 2, 5, 2, 20, 30]\nassert spin([46, 39, 39, 37, 36, 19, 46, 20]) == [46, 39, 39, 37, 36, 19, 46, 20]\nassert spin([-6, 15, 26, -3, 41]) == [41, -6, 15, 26, -3]\nassert spin([46, 49, 37, 1]) == [46, 49, 37, 1]\nassert spin([2, 18, 46, 11, 39]) == [39, 2, 18, 46, 11]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([4, 50, 36])` يُرجع `[36, 4, 50]`.\nالجواب:", "qhash": "83039345336846ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'data'\nprint(word.split('_'))\nprint(word.replace('a', '0'))\nprint(word[0:1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'data'\nprint(word.split('_'))\nprint(word.replace('a', '0'))\nprint(word[0:1])\n```\nالجواب:", "qhash": "62ac780945fb59a1", "answer": "['data']\nd0t0\nd", "completion": " الناتج:\n```text\n['data']\nd0t0\nd\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 185:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([70, 48, 61, 39, 4, 37]) == [70, 118, 179, 0, 4, 41]", "assert rolling_total([163, 43, 106, 97, 47]) == [163, 0, 106, 0, 47]", "assert rolling_total([113]) == [113]", "assert rolling_total([26, 93, 17, 155]) == [26, 119, 136, 0]", "assert rolling_total([80, 101, 121]) == [80, 181, 0]", "assert rolling_total([22, 116]) == [22, 138]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([70, 48, 61, 39, 4, 37]) == [70, 118, 179, 0, 4, 41]\nassert rolling_total([163, 43, 106, 97, 47]) == [163, 0, 106, 0, 47]\nassert rolling_total([113]) == [113]\nassert rolling_total([26, 93, 17, 155]) == [26, 119, 136, 0]\nassert rolling_total([80, 101, 121]) == [80, 181, 0]\nassert rolling_total([22, 116]) == [22, 138]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 185:\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 > 185:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 185 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([70, 48, 61, 39, 4, 37])` يجب أن تُرجع `[70, 118, 179, 0, 4, 41]`.\nالجواب:", "qhash": "2492dbd17a9a2491"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if -19 <= x <= 13)", "tests": ["assert between_times([-4, -7, -11, 10, 12, 22, -3, 21]) == [-11, -7, -4, -3, 10, 12]", "assert between_times([12, 11, -11, -27, 10, 22, 15, -2, 8, 15]) == [-11, -2, 8, 10, 11, 12]", "assert between_times([42, 50, -8, 11, -25, -12, 28, 38, 10, 60]) == [-12, -8, 10, 11]", "assert between_times([3, 57, 54, -21]) == [3]", "assert between_times([33, 50, 28, 55, 46, 56, 58, 37]) == []", "assert between_times([36, 2, 41, 38, 3, 49]) == [2, 3]", "assert between_times([17, 47]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([-4, -7, -11, 10, 12, 22, -3, 21]) == [-11, -7, -4, -3, 10, 12]\nassert between_times([12, 11, -11, -27, 10, 22, 15, -2, 8, 15]) == [-11, -2, 8, 10, 11, 12]\nassert between_times([42, 50, -8, 11, -25, -12, 28, 38, 10, 60]) == [-12, -8, 10, 11]\nassert between_times([3, 57, 54, -21]) == [3]\nassert between_times([33, 50, 28, 55, 46, 56, 58, 37]) == []\nassert between_times([36, 2, 41, 38, 3, 49]) == [2, 3]\nassert between_times([17, 47]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if -19 <= x <= 13)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if -19 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق -19 ≤ x ≤ 13، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([-4, -7, -11, 10, 12, 22, -3, 21])` يُرجع `[-11, -7, -4, -3, 10, 12]`.\nالجواب:", "qhash": "069a99e9969b04b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [-2, 23, 30, 7, 36, 3, 35, 24, 18]\nprint(items[0:7])\nprint(items[::-2])\nprint(sum(items[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [-2, 23, 30, 7, 36, 3, 35, 24, 18]\nprint(items[0:7])\nprint(items[::-2])\nprint(sum(items[0:7]))\n```\nالجواب:", "qhash": "4d78f8d661cccf26", "answer": "[-2, 23, 30, 7, 36, 3, 35]\n[18, 35, 36, 30, -2]\n132", "completion": " الناتج:\n```text\n[-2, 23, 30, 7, 36, 3, 35]\n[18, 35, 36, 30, -2]\n132\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('نور عربية بحر جبل ماء تفاحة قهوة') == 1", "assert count_letter('فجر قهوة حصان رمل قلم لغة لغة فجر') == 2", "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('نور عربية بحر جبل ماء تفاحة قهوة') == 1\nassert count_letter('فجر قهوة حصان رمل قلم لغة لغة فجر') == 2\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": "686d51b5dab0b0e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(13) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13']", "assert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9']", "assert fizz(7) == ['1', '2', '3', '4', '5', 'Foo', '7']", "assert fizz(22) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar']", "assert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9']"], "test_code": "assert fizz(13) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13']\nassert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9']\nassert fizz(7) == ['1', '2', '3', '4', '5', 'Foo', '7']\nassert fizz(22) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar']\nassert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 11 == 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 % 6 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Foo'، وإن قَبِلها على 11 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(13)` يُرجع `['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13']`.\nالجواب:", "qhash": "fe008ce8c99e2e50"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('ماء برتقال فجر سلام حديقة') == 1", "assert prefix_hits('فجر حصان نور حاسوب شجرة') == 1", "assert prefix_hits('قمر حاسوب فجر قمر') == 1", "assert prefix_hits('طائرة فجر فجر سوق') == 2", "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('قمر حاسوب فجر قمر') == 1\nassert prefix_hits('طائرة فجر فجر سوق') == 2\nassert prefix_hits('برمجة مطر سلام مطر') == 0\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 w.endswith('ف'):\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 w.endswith('ف'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('ماء برتقال فجر سلام حديقة')` يُرجع `1`.\nالجواب:", "qhash": "e303a672f301ba0d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert turn_list([31, 4, 23, 4, 5]) == [5, 31, 4, 23, 4]", "assert turn_list([4, -6]) == [4, -6]", "assert turn_list([-6, -2, 7, 6, 2, 0, 18, 19, 32, -3]) == [2, 0, 18, 19, 32, -3, -6, -2, 7, 6]", "assert turn_list([36, 48, 3, 14, 17, 12, 23, 12, 33, 40, 44, 19]) == [33, 40, 44, 19, 36, 48, 3, 14, 17, 12, 23, 12]", "assert turn_list([20, 9]) == [20, 9]", "assert turn_list([20, 30]) == [20, 30]", "assert turn_list([]) == []"], "test_code": "assert turn_list([31, 4, 23, 4, 5]) == [5, 31, 4, 23, 4]\nassert turn_list([4, -6]) == [4, -6]\nassert turn_list([-6, -2, 7, 6, 2, 0, 18, 19, 32, -3]) == [2, 0, 18, 19, 32, -3, -6, -2, 7, 6]\nassert turn_list([36, 48, 3, 14, 17, 12, 23, 12, 33, 40, 44, 19]) == [33, 40, 44, 19, 36, 48, 3, 14, 17, 12, 23, 12]\nassert turn_list([20, 9]) == [20, 9]\nassert turn_list([20, 30]) == [20, 30]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 16 % 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 = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nمثال: `turn_list([31, 4, 23, 4, 5])` يجب أن تُرجع `[5, 31, 4, 23, 4]`.\nالجواب:", "qhash": "e3f4af83ff0c49fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(268) == 5535", "assert mult_sum(15) == 9", "assert mult_sum(60) == 234", "assert mult_sum(232) == 4050", "assert mult_sum(85) == 585", "assert mult_sum(290) == 6657", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(268) == 5535\nassert mult_sum(15) == 9\nassert mult_sum(60) == 234\nassert mult_sum(232) == 4050\nassert mult_sum(85) == 585\nassert mult_sum(290) == 6657\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(268)` يُرجع `5535`.\nالجواب:", "qhash": "63ac0a5e4918215e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('باسل', 5), ('علي', 83), ('منى', 19), ('سلمى', 39)]\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 = [('باسل', 5), ('علي', 83), ('منى', 19), ('سلمى', 39)]\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": "acfbec0098ce8bac", "answer": "[('باسل', 5), ('منى', 19), ('سلمى', 39), ('علي', 83)]\n['علي', 'سلمى']", "completion": " الناتج:\n```text\n[('باسل', 5), ('منى', 19), ('سلمى', 39), ('علي', 83)]\n['علي', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert sum_multiples(257) == 6159", "assert sum_multiples(176) == 2718", "assert sum_multiples(149) == 1923", "assert sum_multiples(264) == 6159", "assert sum_multiples(71) == 438", "assert sum_multiples(9) == 8", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(257) == 6159\nassert sum_multiples(176) == 2718\nassert sum_multiples(149) == 1923\nassert sum_multiples(264) == 6159\nassert sum_multiples(71) == 438\nassert sum_multiples(9) == 8\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `sum_multiples(257)` يجب أن تُرجع `6159`.\nالجواب:", "qhash": "4679897822ec1538"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Red'\n if i % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert play(24) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19', 'Red', 'Blue', '22', '23', '24']", "assert play(19) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19']", "assert play(9) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9']", "assert play(11) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11']", "assert play(25) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19', 'Red', 'Blue', '22', '23', '24', 'Red']"], "test_code": "assert play(24) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19', 'Red', 'Blue', '22', '23', '24']\nassert play(19) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19']\nassert play(9) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9']\nassert play(11) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11']\nassert play(25) == ['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19', 'Red', 'Blue', '22', '23', '24', 'Red']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Red'\n if i % 7 == 0:\n s += 'Blue'\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 += 'Red'\n if i % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Red'، وعلى 7 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(24)` يجب أن تُرجع `['1', '2', '3', '4', 'Red', '6', 'Blue', '8', '9', 'Red', '11', '12', '13', 'Blue', 'Red', '16', '17', '18', '19', 'Red', 'Blue', '22', '23', '24']`.\nالجواب:", "qhash": "c8110332c74871a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 5) // 3 for x in range(-2, 7) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 5) // 3 for x in range(-2, 7) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "cc4482e9ee88e3e4", "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": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'mnr'}", "tests": ["assert char_freq('signal cloud music') == {'m': 1, 'n': 1, 'r': 0}", "assert char_freq('in table at') == {'m': 0, 'n': 1, 'r': 0}", "assert char_freq('to window') == {'m': 0, 'n': 1, 'r': 0}", "assert char_freq('of apple') == {'m': 0, 'n': 0, 'r': 0}", "assert char_freq('it') == {'m': 0, 'n': 0, 'r': 0}", "assert char_freq('cloud up') == {'m': 0, 'n': 0, 'r': 0}", "assert char_freq('') == {'m': 0, 'n': 0, 'r': 0}"], "test_code": "assert char_freq('signal cloud music') == {'m': 1, 'n': 1, 'r': 0}\nassert char_freq('in table at') == {'m': 0, 'n': 1, 'r': 0}\nassert char_freq('to window') == {'m': 0, 'n': 1, 'r': 0}\nassert char_freq('of apple') == {'m': 0, 'n': 0, 'r': 0}\nassert char_freq('it') == {'m': 0, 'n': 0, 'r': 0}\nassert char_freq('cloud up') == {'m': 0, 'n': 0, 'r': 0}\nassert char_freq('') == {'m': 0, 'n': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'mnr'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'mnr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'm'، 'n'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('signal cloud music')` يُرجع `{'m': 1, 'n': 1, 'r': 0}`.\nالجواب:", "qhash": "ccacf20c2b89764b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n <= 0:\n return 1\n return 3 * go(n - 1) + 3\n\nprint(go(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n <= 0:\n return 1\n return 3 * go(n - 1) + 3\n\nprint(go(2))\n```\nالجواب:", "qhash": "2fb46a3f459795ae", "answer": "21", "completion": " الناتج:\n```text\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 308\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 = 308\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": "5192247d1d3bf6a4", "answer": "24", "completion": " الناتج:\n```text\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('window code python table winter music pixel') == 'pixel music winter table python code window'", "assert backwards('pixel') == 'pixel'", "assert backwards('coffee on python stone a') == 'a stone python on coffee'", "assert backwards('matrix data matrix falcon banana garden code python') == 'python code garden banana falcon matrix data matrix'", "assert backwards('a we go table data planet') == 'planet data table go we a'", "assert backwards('window planet music matrix on') == 'on matrix music planet window'", "assert backwards('we a winter matrix falcon coffee') == 'coffee falcon matrix winter a we'"], "test_code": "assert backwards('window code python table winter music pixel') == 'pixel music winter table python code window'\nassert backwards('pixel') == 'pixel'\nassert backwards('coffee on python stone a') == 'a stone python on coffee'\nassert backwards('matrix data matrix falcon banana garden code python') == 'python code garden banana falcon matrix data matrix'\nassert backwards('a we go table data planet') == 'planet data table go we a'\nassert backwards('window planet music matrix on') == 'on matrix music planet window'\nassert backwards('we a winter matrix falcon coffee') == 'coffee falcon matrix winter a we'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `backwards('window code python table winter music pixel')` يُرجع `'pixel music winter table python code window'`.\nالجواب:", "qhash": "d00a0a448ac846d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'قمر'\nprint(text[-1])\nprint(text.replace(' ', '-'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'قمر'\nprint(text[-1])\nprint(text.replace(' ', '-'))\nprint(len(text))\n```\nالجواب:", "qhash": "39d5dbc4467ab177", "answer": "ر\nقمر\n3", "completion": " الناتج:\n```text\nر\nقمر\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert only_div([74, 18, 27, 28, 38, 3, 16, 2, 63, 14, 22, 60]) == 8", "assert only_div([26]) == 1", "assert only_div([9, -18, 40, -25]) == 1", "assert only_div([17, 0, 45, -13, -20, 73, 8, 38, 33, 28, -8, 14]) == 6", "assert only_div([]) == 0", "assert only_div([-29, 34, 64, 30, 31, -40, 35]) == 4", "assert only_div([]) == 0"], "test_code": "assert only_div([74, 18, 27, 28, 38, 3, 16, 2, 63, 14, 22, 60]) == 8\nassert only_div([26]) == 1\nassert only_div([9, -18, 40, -25]) == 1\nassert only_div([17, 0, 45, -13, -20, 73, 8, 38, 33, 28, -8, 14]) == 6\nassert only_div([]) == 0\nassert only_div([-29, 34, 64, 30, 31, -40, 35]) == 4\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 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 % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 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([74, 18, 27, 28, 38, 3, 16, 2, 63, 14, 22, 60])` يُرجع `8`.\nالجواب:", "qhash": "e23bca2ba2a3b8c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([45, 63, 41, 56, 88, 70, 42]) == 0", "assert only_div([-29, 61, 87, -32, 54, -1]) == 0", "assert only_div([11, -17, 37, -15, 22, 8, -11, 83, -23]) == 0", "assert only_div([-1, 17]) == 0", "assert only_div([-7, 14, 46, 23, 16, 23, -37, -21, 31, 85, 9, 79]) == 0", "assert only_div([-29, 90, -22, -9, -12, -18, -4, 23]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([45, 63, 41, 56, 88, 70, 42]) == 0\nassert only_div([-29, 61, 87, -32, 54, -1]) == 0\nassert only_div([11, -17, 37, -15, 22, 8, -11, 83, -23]) == 0\nassert only_div([-1, 17]) == 0\nassert only_div([-7, 14, 46, 23, 16, 23, -37, -21, 31, 85, 9, 79]) == 0\nassert only_div([-29, 90, -22, -9, -12, -18, -4, 23]) == 0\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([45, 63, 41, 56, 88, 70, 42])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "42f8c2e44772e5fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 8 == 0)", "tests": ["assert add_multiples(69) == 612", "assert add_multiples(217) == 5940", "assert add_multiples(299) == 11100", "assert add_multiples(95) == 1104", "assert add_multiples(72) == 612", "assert add_multiples(299) == 11100", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(69) == 612\nassert add_multiples(217) == 5940\nassert add_multiples(299) == 11100\nassert add_multiples(95) == 1104\nassert add_multiples(72) == 612\nassert add_multiples(299) == 11100\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 8 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 8.\nمثال: `add_multiples(69)` يجب أن تُرجع `612`.\nالجواب:", "qhash": "2f4576f075fc030a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'aort'}", "tests": ["assert char_freq('by a') == {'a': 1, 'o': 0, 'r': 0, 't': 0}", "assert char_freq('an vector data pixel in on') == {'a': 3, 'o': 2, 'r': 1, 't': 2}", "assert char_freq('winter is to window up stone') == {'a': 0, 'o': 3, 'r': 1, 't': 3}", "assert char_freq('vector stone') == {'a': 0, 'o': 2, 'r': 1, 't': 2}", "assert char_freq('banana at at it up table') == {'a': 6, 'o': 0, 'r': 0, 't': 4}", "assert char_freq('to falcon is') == {'a': 1, 'o': 2, 'r': 0, 't': 1}", "assert char_freq('') == {'a': 0, 'o': 0, 'r': 0, 't': 0}"], "test_code": "assert char_freq('by a') == {'a': 1, 'o': 0, 'r': 0, 't': 0}\nassert char_freq('an vector data pixel in on') == {'a': 3, 'o': 2, 'r': 1, 't': 2}\nassert char_freq('winter is to window up stone') == {'a': 0, 'o': 3, 'r': 1, 't': 3}\nassert char_freq('vector stone') == {'a': 0, 'o': 2, 'r': 1, 't': 2}\nassert char_freq('banana at at it up table') == {'a': 6, 'o': 0, 'r': 0, 't': 4}\nassert char_freq('to falcon is') == {'a': 1, 'o': 2, 'r': 0, 't': 1}\nassert char_freq('') == {'a': 0, 'o': 0, 'r': 0, 't': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'aort'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'aort'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'o'، 'r'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('by a')` يُرجع `{'a': 1, 'o': 0, 'r': 0, 't': 0}`.\nالجواب:", "qhash": "abdaadd6b8e04d87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38", "tests": ["assert digit_score(76182) == 24", "assert digit_score(105415) == 16", "assert digit_score(205373) == 20", "assert digit_score(317522) == 20", "assert digit_score(736985) == 0", "assert digit_score(224414) == 17", "assert digit_score(249360) == 24", "assert digit_score(0) == 0"], "test_code": "assert digit_score(76182) == 24\nassert digit_score(105415) == 16\nassert digit_score(205373) == 20\nassert digit_score(317522) == 20\nassert digit_score(736985) == 0\nassert digit_score(224414) == 17\nassert digit_score(249360) == 24\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 38.\nللتوضيح: الاستدعاء `digit_score(76182)` يُرجع `24`.\nالجواب:", "qhash": "8f9793da7283c394"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(0))\nprint(f(0, 10))\nprint(f(f(10), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(0))\nprint(f(0, 10))\nprint(f(f(10), 0))\n```\nالجواب:", "qhash": "30a433e718babaf7", "answer": "20\n50\n230", "completion": " الناتج:\n```text\n20\n50\n230\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'خالد': 15, 'منى': 25, 'فيصل': 23, 'هشام': 21, 'سعيد': 31}\nd['هشام'] += 6\nd['علي'] = 31\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 15])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'خالد': 15, 'منى': 25, 'فيصل': 23, 'هشام': 21, 'سعيد': 31}\nd['هشام'] += 6\nd['علي'] = 31\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 15])\n```\nالجواب:", "qhash": "dc28536e2643c0dd", "answer": "6\nسعيد\n152\n['منى', 'فيصل', 'هشام', 'سعيد', 'علي']", "completion": " الناتج:\n```text\n6\nسعيد\n152\n['منى', 'فيصل', 'هشام', 'سعيد', 'علي']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 76) == 1)", "tests": ["assert coprime_count(11) == 6", "assert coprime_count(125) == 60", "assert coprime_count(91) == 44", "assert coprime_count(21) == 10", "assert coprime_count(126) == 60", "assert coprime_count(154) == 73", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(11) == 6\nassert coprime_count(125) == 60\nassert coprime_count(91) == 44\nassert coprime_count(21) == 10\nassert coprime_count(126) == 60\nassert coprime_count(154) == 73\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, 76) == 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, 76) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 76، أي أن القاسم المشترك الأكبر لها مع 76 يساوي 1.\nمثال: `coprime_count(11)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "6306831b26f79398"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('summer at it apple pixel rocket rocket table') == 'table|rocket|rocket|pixel|apple|it|at|summer'", "assert rev_join('apple an planet a stone summer planet signal') == 'signal|planet|summer|stone|a|planet|an|apple'", "assert rev_join('desert garden vector stone camel signal winter table') == 'table|winter|signal|camel|stone|vector|garden|desert'", "assert rev_join('an cloud stone') == 'stone|cloud|an'", "assert rev_join('an we to') == 'to|we|an'", "assert rev_join('we river') == 'river|we'", "assert rev_join('is to light table brain') == 'brain|table|light|to|is'"], "test_code": "assert rev_join('summer at it apple pixel rocket rocket table') == 'table|rocket|rocket|pixel|apple|it|at|summer'\nassert rev_join('apple an planet a stone summer planet signal') == 'signal|planet|summer|stone|a|planet|an|apple'\nassert rev_join('desert garden vector stone camel signal winter table') == 'table|winter|signal|camel|stone|vector|garden|desert'\nassert rev_join('an cloud stone') == 'stone|cloud|an'\nassert rev_join('an we to') == 'to|we|an'\nassert rev_join('we river') == 'river|we'\nassert rev_join('is to light table brain') == 'brain|table|light|to|is'", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `rev_join('summer at it apple pixel rocket rocket table')` يجب أن تُرجع `'table|rocket|rocket|pixel|apple|it|at|summer'`.\nالجواب:", "qhash": "9f011e482f841be1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 7 * x ** 2 + (7) * x + (-9)", "tests": ["assert eval_poly(6) == 285", "assert eval_poly(-10) == 621", "assert eval_poly(-6) == 201", "assert eval_poly(-18) == 2133", "assert eval_poly(19) == 2651", "assert eval_poly(-17) == 1895", "assert eval_poly(-20) == 2651", "assert eval_poly(0) == -9"], "test_code": "assert eval_poly(6) == 285\nassert eval_poly(-10) == 621\nassert eval_poly(-6) == 201\nassert eval_poly(-18) == 2133\nassert eval_poly(19) == 2651\nassert eval_poly(-17) == 1895\nassert eval_poly(-20) == 2651\nassert eval_poly(0) == -9", "answer": "def eval_poly(x):\n return 7 * x ** 2 + (7) * x + (-9)", "completion": " ```python\ndef eval_poly(x):\n return 7 * x ** 2 + (7) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 7x² + 7x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(6)` يُرجع `285`.\nالجواب:", "qhash": "333f3c7a01b6d6ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([18, 36, 37, 30, 29, 2, 20, 43]) == [18, 54, 0, 30, 59, 61, 81, 0]", "assert capped_cumsum([13, -8, 24, 81, 39, 28, 53, 39, -9]) == [13, 5, 29, 0, 39, 67, 0, 39, 30]", "assert capped_cumsum([65, 9, -4, 55, 38, 54, 80, 81]) == [65, 74, 70, 0, 38, 0, 80, 0]", "assert capped_cumsum([23, 65, -1, 83, 57, 50]) == [23, 0, -1, 82, 0, 50]", "assert capped_cumsum([25, 70, 20, 85, 64]) == [25, 0, 20, 0, 64]", "assert capped_cumsum([59, 31, 5, 84, 8]) == [59, 0, 5, 0, 8]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([18, 36, 37, 30, 29, 2, 20, 43]) == [18, 54, 0, 30, 59, 61, 81, 0]\nassert capped_cumsum([13, -8, 24, 81, 39, 28, 53, 39, -9]) == [13, 5, 29, 0, 39, 67, 0, 39, 30]\nassert capped_cumsum([65, 9, -4, 55, 38, 54, 80, 81]) == [65, 74, 70, 0, 38, 0, 80, 0]\nassert capped_cumsum([23, 65, -1, 83, 57, 50]) == [23, 0, -1, 82, 0, 50]\nassert capped_cumsum([25, 70, 20, 85, 64]) == [25, 0, 20, 0, 64]\nassert capped_cumsum([59, 31, 5, 84, 8]) == [59, 0, 5, 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 > 85:\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 > 85:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 85 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([18, 36, 37, 30, 29, 2, 20, 43])` يُرجع `[18, 54, 0, 30, 59, 61, 81, 0]`.\nالجواب:", "qhash": "2db9578230318f80"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 9 * x ** 2 + (0) * x + (4)", "tests": ["assert p(5) == 229", "assert p(-5) == 229", "assert p(12) == 1300", "assert p(-7) == 445", "assert p(15) == 2029", "assert p(19) == 3253", "assert p(12) == 1300", "assert p(0) == 4"], "test_code": "assert p(5) == 229\nassert p(-5) == 229\nassert p(12) == 1300\nassert p(-7) == 445\nassert p(15) == 2029\nassert p(19) == 3253\nassert p(12) == 1300\nassert p(0) == 4", "answer": "def p(x):\n return 9 * x ** 2 + (0) * x + (4)", "completion": " ```python\ndef p(x):\n return 9 * x ** 2 + (0) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 9x² + 0x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(5)` يُرجع `229`.\nالجواب:", "qhash": "fec48565b4830f9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(193748932))\nprint(go(go(193748932)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(193748932))\nprint(go(go(193748932)))\n```\nالجواب:", "qhash": "17936dead01cef86", "answer": "46\n10", "completion": " الناتج:\n```text\n46\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert game(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']", "assert game(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']", "assert game(3) == ['1', '2', '3']", "assert game(8) == ['1', '2', '3', '4', '5', '6', 'Hi', '8']", "assert game(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']"], "test_code": "assert game(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']\nassert game(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']\nassert game(3) == ['1', '2', '3']\nassert game(8) == ['1', '2', '3', '4', '5', '6', 'Hi', '8']\nassert game(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Hi'، وإن قَبِلها على 10 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(16)` يُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']`.\nالجواب:", "qhash": "5aa2136f04c70296"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert words_reversed('rocket banana python table planet engine it') == 'it,engine,planet,table,python,banana,rocket'", "assert words_reversed('brain brain signal camel') == 'camel,signal,brain,brain'", "assert words_reversed('') == ''", "assert words_reversed('camel') == 'camel'", "assert words_reversed('') == ''", "assert words_reversed('on light apple a we') == 'we,a,apple,light,on'", "assert words_reversed('window camel window') == 'window,camel,window'"], "test_code": "assert words_reversed('rocket banana python table planet engine it') == 'it,engine,planet,table,python,banana,rocket'\nassert words_reversed('brain brain signal camel') == 'camel,signal,brain,brain'\nassert words_reversed('') == ''\nassert words_reversed('camel') == 'camel'\nassert words_reversed('') == ''\nassert words_reversed('on light apple a we') == 'we,a,apple,light,on'\nassert words_reversed('window camel window') == 'window,camel,window'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `words_reversed('rocket banana python table planet engine it')` يُرجع `'it,engine,planet,table,python,banana,rocket'`.\nالجواب:", "qhash": "4acf816a923c264a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 8 <= x <= 47)", "tests": ["assert in_range_scaled([41, 1, 29, 17, -2]) == [-164, -116, -68]", "assert in_range_scaled([-10, 29, 57, 34, 1, 34, 15]) == [-136, -136, -116, -60]", "assert in_range_scaled([36, 36, 54, 41]) == [-164, -144, -144]", "assert in_range_scaled([45, 54, 38, -22, 6, 4, 53, 45, 21, 50]) == [-180, -180, -152, -84]", "assert in_range_scaled([-12, 21, -26, 46]) == [-184, -84]", "assert in_range_scaled([59, -26, 15, 3, -5, 48, 3, -1]) == [-60]", "assert in_range_scaled([-1, -3, 20, -21, 27]) == [-108, -80]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([41, 1, 29, 17, -2]) == [-164, -116, -68]\nassert in_range_scaled([-10, 29, 57, 34, 1, 34, 15]) == [-136, -136, -116, -60]\nassert in_range_scaled([36, 36, 54, 41]) == [-164, -144, -144]\nassert in_range_scaled([45, 54, 38, -22, 6, 4, 53, 45, 21, 50]) == [-180, -180, -152, -84]\nassert in_range_scaled([-12, 21, -26, 46]) == [-184, -84]\nassert in_range_scaled([59, -26, 15, 3, -5, 48, 3, -1]) == [-60]\nassert in_range_scaled([-1, -3, 20, -21, 27]) == [-108, -80]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 8 <= x <= 47)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 8 <= x <= 47)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 8 ≤ x ≤ 47، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([41, 1, 29, 17, -2])` يُرجع `[-164, -116, -68]`.\nالجواب:", "qhash": "a00ae9fddf27a89f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([41, 88, 74, 75, 86, 32, 38, 7, 36, 25, 59]) == 0", "assert div_not([78, 0, -22]) == 0", "assert div_not([19, 49, 1, 25, 48, 57]) == 0", "assert div_not([58, -37, 87, 25, 67, 48, 12, -23, -30, 37, 51]) == 0", "assert div_not([30, 35, 72, 3, 27]) == 0", "assert div_not([-1, -13, 5, -34, 29, 70, 85, 11, 9]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([41, 88, 74, 75, 86, 32, 38, 7, 36, 25, 59]) == 0\nassert div_not([78, 0, -22]) == 0\nassert div_not([19, 49, 1, 25, 48, 57]) == 0\nassert div_not([58, -37, 87, 25, 67, 48, 12, -23, -30, 37, 51]) == 0\nassert div_not([30, 35, 72, 3, 27]) == 0\nassert div_not([-1, -13, 5, -34, 29, 70, 85, 11, 9]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([41, 88, 74, 75, 86, 32, 38, 7, 36, 25, 59])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "3f65db26df3594fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)", "tests": ["assert add_multiples(148) == 2931", "assert add_multiples(240) == 7560", "assert add_multiples(151) == 3081", "assert add_multiples(252) == 8295", "assert add_multiples(260) == 8802", "assert add_multiples(245) == 7800", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(148) == 2931\nassert add_multiples(240) == 7560\nassert add_multiples(151) == 3081\nassert add_multiples(252) == 8295\nassert add_multiples(260) == 8802\nassert add_multiples(245) == 7800\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(148)` يُرجع `2931`.\nالجواب:", "qhash": "cb1e8c464baae26b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -2 for x in xs if 15 <= x <= 41)", "tests": ["assert between_times([18, 49, 25, 13, 37, 18]) == [-74, -50, -36, -36]", "assert between_times([48]) == []", "assert between_times([-18, 40, 58, -17, -18]) == [-80]", "assert between_times([]) == []", "assert between_times([1, 57, -2, 12, 13, 0, -3]) == []", "assert between_times([-21, 59]) == []", "assert between_times([47, -30, 45, 27, -21]) == [-54]", "assert between_times([]) == []"], "test_code": "assert between_times([18, 49, 25, 13, 37, 18]) == [-74, -50, -36, -36]\nassert between_times([48]) == []\nassert between_times([-18, 40, 58, -17, -18]) == [-80]\nassert between_times([]) == []\nassert between_times([1, 57, -2, 12, 13, 0, -3]) == []\nassert between_times([-21, 59]) == []\nassert between_times([47, -30, 45, 27, -21]) == [-54]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -2 for x in xs if 15 <= x <= 41)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -2 for x in xs if 15 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 15 ≤ x ≤ 41، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([18, 49, 25, 13, 37, 18])` يُرجع `[-74, -50, -36, -36]`.\nالجواب:", "qhash": "ee620c0f3c90659c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'bcrt'}", "tests": ["assert char_counts('vector river python') == {'b': 0, 'c': 1, 'r': 3, 't': 2}", "assert char_counts('code we') == {'b': 0, 'c': 1, 'r': 0, 't': 0}", "assert char_counts('signal in we pixel') == {'b': 0, 'c': 0, 'r': 0, 't': 0}", "assert char_counts('apple cloud river') == {'b': 0, 'c': 1, 'r': 2, 't': 0}", "assert char_counts('light go brain rocket of orange') == {'b': 1, 'c': 1, 'r': 3, 't': 2}", "assert char_counts('at rocket is at on desert') == {'b': 0, 'c': 1, 'r': 2, 't': 4}", "assert char_counts('') == {'b': 0, 'c': 0, 'r': 0, 't': 0}"], "test_code": "assert char_counts('vector river python') == {'b': 0, 'c': 1, 'r': 3, 't': 2}\nassert char_counts('code we') == {'b': 0, 'c': 1, 'r': 0, 't': 0}\nassert char_counts('signal in we pixel') == {'b': 0, 'c': 0, 'r': 0, 't': 0}\nassert char_counts('apple cloud river') == {'b': 0, 'c': 1, 'r': 2, 't': 0}\nassert char_counts('light go brain rocket of orange') == {'b': 1, 'c': 1, 'r': 3, 't': 2}\nassert char_counts('at rocket is at on desert') == {'b': 0, 'c': 1, 'r': 2, 't': 4}\nassert char_counts('') == {'b': 0, 'c': 0, 'r': 0, 't': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'bcrt'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'bcrt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'c'، 'r'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('vector river python')` يجب أن تُرجع `{'b': 0, 'c': 1, 'r': 3, 't': 2}`.\nالجواب:", "qhash": "0021ab1baae2c06c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_list([26, 23, 14]) == [14, 26, 23]", "assert rotate_list([16, 46, 40, 39, 47, 34, 2, -5]) == [16, 46, 40, 39, 47, 34, 2, -5]", "assert rotate_list([49, 3, 31, 49, 45, 27, 41, 10]) == [49, 3, 31, 49, 45, 27, 41, 10]", "assert rotate_list([1, 17]) == [1, 17]", "assert rotate_list([4, 23, 43, -3, 1, -2]) == [43, -3, 1, -2, 4, 23]", "assert rotate_list([-9, 21, -9, 50, 17, 44, 35, 3, 25, -3, -4]) == [25, -3, -4, -9, 21, -9, 50, 17, 44, 35, 3]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([26, 23, 14]) == [14, 26, 23]\nassert rotate_list([16, 46, 40, 39, 47, 34, 2, -5]) == [16, 46, 40, 39, 47, 34, 2, -5]\nassert rotate_list([49, 3, 31, 49, 45, 27, 41, 10]) == [49, 3, 31, 49, 45, 27, 41, 10]\nassert rotate_list([1, 17]) == [1, 17]\nassert rotate_list([4, 23, 43, -3, 1, -2]) == [43, -3, 1, -2, 4, 23]\nassert rotate_list([-9, 21, -9, 50, 17, 44, 35, 3, 25, -3, -4]) == [25, -3, -4, -9, 21, -9, 50, 17, 44, 35, 3]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([26, 23, 14])` يُرجع `[14, 26, 23]`.\nالجواب:", "qhash": "d75fff090e0d922b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 119:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([1, 32, 33, 14, 2, 57, 26, 29]) == [1, 33, 66, 80, 82, 0, 26, 55]", "assert capped_cumsum([114]) == [114]", "assert capped_cumsum([105, 28, 90, 21, 44, 97, 73]) == [105, 0, 90, 111, 0, 97, 0]", "assert capped_cumsum([114, 49]) == [114, 0]", "assert capped_cumsum([58, 39, 3, 9, 97, 88, 48, -5, 30, 94]) == [58, 97, 100, 109, 0, 88, 0, -5, 25, 119]", "assert capped_cumsum([-9, 104, 19]) == [-9, 95, 114]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([1, 32, 33, 14, 2, 57, 26, 29]) == [1, 33, 66, 80, 82, 0, 26, 55]\nassert capped_cumsum([114]) == [114]\nassert capped_cumsum([105, 28, 90, 21, 44, 97, 73]) == [105, 0, 90, 111, 0, 97, 0]\nassert capped_cumsum([114, 49]) == [114, 0]\nassert capped_cumsum([58, 39, 3, 9, 97, 88, 48, -5, 30, 94]) == [58, 97, 100, 109, 0, 88, 0, -5, 25, 119]\nassert capped_cumsum([-9, 104, 19]) == [-9, 95, 114]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 119:\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 > 119:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 119 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([1, 32, 33, 14, 2, 57, 26, 29])` يجب أن تُرجع `[1, 33, 66, 80, 82, 0, 26, 55]`.\nالجواب:", "qhash": "f7626156cd455938"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(9, 4))", "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(9, 4))\n```\nالجواب:", "qhash": "34b984e0e3a48bb8", "answer": "6561", "completion": " الناتج:\n```text\n6561\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('on light coffee summer go 2024') == 'xw urpqc lxoonn bdvvna px 2024'", "assert shift_letters('orange music') == 'xajwpn vdbrl'", "assert shift_letters('of we apple window vector !') == 'xo fn jyyun frwmxf enlcxa !'", "assert shift_letters('signal') == 'brpwju'", "assert shift_letters('light camel window winter to') == 'urpqc ljvnu frwmxf frwcna cx'", "assert shift_letters('apple code an orange it') == 'jyyun lxmn jw xajwpn rc'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('on light coffee summer go 2024') == 'xw urpqc lxoonn bdvvna px 2024'\nassert shift_letters('orange music') == 'xajwpn vdbrl'\nassert shift_letters('of we apple window vector !') == 'xo fn jyyun frwmxf enlcxa !'\nassert shift_letters('signal') == 'brpwju'\nassert shift_letters('light camel window winter to') == 'urpqc ljvnu frwmxf frwcna cx'\nassert shift_letters('apple code an orange it') == 'jyyun lxmn jw xajwpn rc'\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 + (-17)) % 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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('on light coffee summer go 2024')` يجب أن تُرجع `'xw urpqc lxoonn bdvvna px 2024'`.\nالجواب:", "qhash": "f1ab53fd713ff935"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('لغة مدرسة برتقال ميناء كتاب فجر بحر شجرة') == 1", "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('لغة مدرسة برتقال ميناء كتاب فجر بحر شجرة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ك»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('معلم برمجة سوق حاسوب بيت ليل مطر')` يُرجع `0`.\nالجواب:", "qhash": "1f56ef8f57c11afa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=8):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(compute(-7))\nprint(compute(-7, 16))\nprint(compute(compute(16), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=8):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(compute(-7))\nprint(compute(-7, 16))\nprint(compute(compute(16), -7))\n```\nالجواب:", "qhash": "bb4414ef700d649d", "answer": "-23\n-39\n-26", "completion": " الناتج:\n```text\n-23\n-39\n-26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert pow_total(4) == 500", "assert pow_total(8) == 6480", "assert pow_total(7) == 3920", "assert pow_total(6) == 2205", "assert pow_total(7) == 3920", "assert pow_total(1) == 5", "assert pow_total(0) == 0"], "test_code": "assert pow_total(4) == 500\nassert pow_total(8) == 6480\nassert pow_total(7) == 3920\nassert pow_total(6) == 2205\nassert pow_total(7) == 3920\nassert pow_total(1) == 5\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total\n```\nمثال: `pow_total(4)` يجب أن تُرجع `500`.\nالجواب:", "qhash": "cc160ef8c9aad9c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "tests": ["assert power_sum(4) == 360", "assert power_sum(4) == 360", "assert power_sum(13) == 9828", "assert power_sum(6) == 1092", "assert power_sum(11) == 6072", "assert power_sum(1) == 12", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 360\nassert power_sum(4) == 360\nassert power_sum(13) == 9828\nassert power_sum(6) == 1092\nassert power_sum(11) == 6072\nassert power_sum(1) == 12\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 2\n return total\n```\nمثال: `power_sum(4)` يجب أن تُرجع `360`.\nالجواب:", "qhash": "408f241bddfda6c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('on river brain apple orange') == 'wv zqdmz jziqv ixxtm wzivom'", "assert encode('camel Hello') == 'kiumt Hmttw'", "assert encode('summer data engine python OK') == 'acuumz libi mvoqvm xgbpwv OK'", "assert encode('brain is river matrix') == 'jziqv qa zqdmz uibzqf'", "assert encode('camel') == 'kiumt'", "assert encode('python summer brain') == 'xgbpwv acuumz jziqv'", "assert encode('') == ''"], "test_code": "assert encode('on river brain apple orange') == 'wv zqdmz jziqv ixxtm wzivom'\nassert encode('camel Hello') == 'kiumt Hmttw'\nassert encode('summer data engine python OK') == 'acuumz libi mvoqvm xgbpwv OK'\nassert encode('brain is river matrix') == 'jziqv qa zqdmz uibzqf'\nassert encode('camel') == 'kiumt'\nassert encode('python summer brain') == 'xgbpwv acuumz jziqv'\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 + (8)) % 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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('on river brain apple orange')` يُرجع `'wv zqdmz jziqv ixxtm wzivom'`.\nالجواب:", "qhash": "e48de1cb7ebb6bb5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "lead_count", "reference": "def lead_count(s):\n count = 0\n for w in s.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('حصان رمل بحر طالب علم نهار') == 1", "assert lead_count('برتقال قهوة نهار') == 1", "assert lead_count('نهر نور نور وردة برمجة') == 3", "assert lead_count('') == 0"], "test_code": "assert lead_count('قمر سلام طائرة نهر نهر') == 2\nassert lead_count('خبز قهوة نهار') == 1\nassert lead_count('سماء نهر نهار ماء حاسوب') == 2\nassert lead_count('حصان رمل بحر طالب علم نهار') == 1\nassert lead_count('برتقال قهوة نهار') == 1\nassert lead_count('نهر نور نور وردة برمجة') == 3\nassert lead_count('') == 0", "answer": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ن'):\n count += 1\n return count", "completion": " ```python\ndef lead_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 lead_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 lead_count(s):\n count = 0\n for w in s.split():\n if w.endswith('ن'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('قمر سلام طائرة نهر نهر')` يُرجع `2`.\nالجواب:", "qhash": "9c018b0b4d2eabf5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return 6 * x ** 2 + (-9) * x + (-5)", "tests": ["assert p(5) == 100", "assert p(-3) == 76", "assert p(-15) == 1480", "assert p(-13) == 1126", "assert p(-11) == 820", "assert p(-20) == 2575", "assert p(-2) == 37", "assert p(0) == -5"], "test_code": "assert p(5) == 100\nassert p(-3) == 76\nassert p(-15) == 1480\nassert p(-13) == 1126\nassert p(-11) == 820\nassert p(-20) == 2575\nassert p(-2) == 37\nassert p(0) == -5", "answer": "def p(x):\n return 6 * x ** 2 + (-9) * x + (-5)", "completion": " ```python\ndef p(x):\n return 6 * x ** 2 + (-9) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود 6x² - 9x - 5 عند العدد الصحيح x.\nمثال: `p(5)` يجب أن تُرجع `100`.\nالجواب:", "qhash": "8a969c5a223b6366"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('coffee rocket table in A1') == 'kwnnmm zwksmb bijtm qv A1'", "assert cipher('code cloud by table') == 'kwlm ktwcl jg bijtm'", "assert cipher('desert we go python pixel') == 'lmamzb em ow xgbpwv xqfmt'", "assert cipher('go apple 2024') == 'ow ixxtm 2024'", "assert cipher('vector of') == 'dmkbwz wn'", "assert cipher('rocket summer at at signal Hello') == 'zwksmb acuumz ib ib aqovit Hmttw'", "assert cipher('') == ''"], "test_code": "assert cipher('coffee rocket table in A1') == 'kwnnmm zwksmb bijtm qv A1'\nassert cipher('code cloud by table') == 'kwlm ktwcl jg bijtm'\nassert cipher('desert we go python pixel') == 'lmamzb em ow xgbpwv xqfmt'\nassert cipher('go apple 2024') == 'ow ixxtm 2024'\nassert cipher('vector of') == 'dmkbwz wn'\nassert cipher('rocket summer at at signal Hello') == 'zwksmb acuumz ib ib aqovit Hmttw'\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 + (8)) % 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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('coffee rocket table in A1')` يُرجع `'kwnnmm zwksmb bijtm qv A1'`.\nالجواب:", "qhash": "dd32a5a29e746486"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 6\nfor x in range(9, 19, 4):\n result -= x * 6\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 6\nfor x in range(9, 19, 4):\n result -= x * 6\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "f1a22c9f1988702a", "answer": "-228\n17", "completion": " الناتج:\n```text\n-228\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=6):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(-10))\nprint(g(-10, -7))\nprint(g(g(-7), -10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=6):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(-10))\nprint(g(-10, -7))\nprint(g(g(-7), -10))\n```\nالجواب:", "qhash": "39484053095e2f11", "answer": "-4\n-17\n9", "completion": " الناتج:\n```text\n-4\n-17\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 38) == 1)", "tests": ["assert count_coprime(12) == 6", "assert count_coprime(191) == 91", "assert count_coprime(188) == 89", "assert count_coprime(148) == 70", "assert count_coprime(167) == 80", "assert count_coprime(4) == 2", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(12) == 6\nassert count_coprime(191) == 91\nassert count_coprime(188) == 89\nassert count_coprime(148) == 70\nassert count_coprime(167) == 80\nassert count_coprime(4) == 2\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, 38) == 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, 38) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 38، أي أن القاسم المشترك الأكبر لها مع 38 يساوي 1.\nمثال: `count_coprime(12)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "a6db03ea13f4a16a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert mult_sum(55) == 252", "assert mult_sum(245) == 5302", "assert mult_sum(45) == 204", "assert mult_sum(171) == 2604", "assert mult_sum(39) == 122", "assert mult_sum(114) == 1176", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(55) == 252\nassert mult_sum(245) == 5302\nassert mult_sum(45) == 204\nassert mult_sum(171) == 2604\nassert mult_sum(39) == 122\nassert mult_sum(114) == 1176\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 % 14 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(55)` يُرجع `252`.\nالجواب:", "qhash": "d39c5a8bda2fa96c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 21) == 1)", "tests": ["assert rel_prime_count(66) == 38", "assert rel_prime_count(151) == 87", "assert rel_prime_count(193) == 111", "assert rel_prime_count(83) == 48", "assert rel_prime_count(38) == 22", "assert rel_prime_count(4) == 3", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(66) == 38\nassert rel_prime_count(151) == 87\nassert rel_prime_count(193) == 111\nassert rel_prime_count(83) == 48\nassert rel_prime_count(38) == 22\nassert rel_prime_count(4) == 3\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, 21) == 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, 21) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 21، أي أن القاسم المشترك الأكبر لها مع 21 يساوي 1.\nمثال: `rel_prime_count(66)` يجب أن تُرجع `38`.\nالجواب:", "qhash": "751a69eb9eb84de6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'قمر عمل'\nprint(w[0])\nprint('ت' in w)\nprint(w.count('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'قمر عمل'\nprint(w[0])\nprint('ت' in w)\nprint(w.count('ت'))\n```\nالجواب:", "qhash": "27fe31712c9880ad", "answer": "ق\nFalse\n0", "completion": " الناتج:\n```text\nق\nFalse\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'orange'\nprint(word.replace('o', '0'))\nprint(word.split('_'))\nprint(word.count('o'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'orange'\nprint(word.replace('o', '0'))\nprint(word.split('_'))\nprint(word.count('o'))\n```\nالجواب:", "qhash": "4a59de691fee6e58", "answer": "0range\n['orange']\n1", "completion": " الناتج:\n```text\n0range\n['orange']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "02aba018a6e578e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'هشام': 11, 'علي': 4, 'نور': 8}\nmarks['هشام'] += 18\nmarks['هدى'] = 39\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'هشام': 11, 'علي': 4, 'نور': 8}\nmarks['هشام'] += 18\nmarks['هدى'] = 39\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))\n```\nالجواب:", "qhash": "49afec395427867c", "answer": "4\nهدى\n80\n-1", "completion": " الناتج:\n```text\n4\nهدى\n80\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert div_not([65, 51, 25, 44, 37, 83, 2, 15, 43]) == 1", "assert div_not([9, -36, 77, 30, 63, 85, 90, 81, 83, 15, 30, 48]) == 1", "assert div_not([67, 19, 69]) == 0", "assert div_not([-2]) == 0", "assert div_not([40, 55, 74, -8, 32, 43, 50, -9]) == 0", "assert div_not([24, -1, 45]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([65, 51, 25, 44, 37, 83, 2, 15, 43]) == 1\nassert div_not([9, -36, 77, 30, 63, 85, 90, 81, 83, 15, 30, 48]) == 1\nassert div_not([67, 19, 69]) == 0\nassert div_not([-2]) == 0\nassert div_not([40, 55, 74, -8, 32, 43, 50, -9]) == 0\nassert div_not([24, -1, 45]) == 0\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([65, 51, 25, 44, 37, 83, 2, 15, 43])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "4bbec8e9690b07bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('of code river on python OK') == 'kb ykza neran kj lupdkj OK'", "assert caesar('in vector we an brain') == 'ej raypkn sa wj xnwej'", "assert caesar('window light on brain stone A1') == 'sejzks hecdp kj xnwej opkja A1'", "assert caesar('desert') == 'zaoanp'", "assert caesar('vector rocket music on a') == 'raypkn nkygap iqoey kj w'", "assert caesar('rocket data winter apple') == 'nkygap zwpw sejpan wllha'", "assert caesar('') == ''"], "test_code": "assert caesar('of code river on python OK') == 'kb ykza neran kj lupdkj OK'\nassert caesar('in vector we an brain') == 'ej raypkn sa wj xnwej'\nassert caesar('window light on brain stone A1') == 'sejzks hecdp kj xnwej opkja A1'\nassert caesar('desert') == 'zaoanp'\nassert caesar('vector rocket music on a') == 'raypkn nkygap iqoey kj w'\nassert caesar('rocket data winter apple') == 'nkygap zwpw sejpan wllha'\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 + (-4)) % 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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('of code river on python OK')` يُرجع `'kb ykza neran kj lupdkj OK'`.\nالجواب:", "qhash": "af901d0943857893"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 85) == 1)", "tests": ["assert count_coprime(83) == 63", "assert count_coprime(44) == 34", "assert count_coprime(169) == 128", "assert count_coprime(61) == 46", "assert count_coprime(75) == 56", "assert count_coprime(102) == 77", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(83) == 63\nassert count_coprime(44) == 34\nassert count_coprime(169) == 128\nassert count_coprime(61) == 46\nassert count_coprime(75) == 56\nassert count_coprime(102) == 77\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, 85) == 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, 85) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 85) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(83)` يُرجع `63`.\nالجواب:", "qhash": "c4e366084f60c1f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('قمر سوق ميناء شجرة مكتبة نهر سماء') == 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"], "test_code": "assert how_many('مدرسة مطر لغة سفينة جمل تفاحة حديقة') == 0\nassert 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", "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": "36b68f5974c95597"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 11\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 = 11\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": "e74bd55d687ac1d3", "answer": "14", "completion": " الناتج:\n```text\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('بحر ليل لغة وردة') == 2", "assert prefix_hits('سلام ماء برمجة وردة علم مدينة ليل') == 1", "assert prefix_hits('ليل عربية سماء رمل وردة حصان') == 1", "assert prefix_hits('ليل طائرة سماء شجرة جمل وردة') == 1", "assert prefix_hits('سوق طائرة') == 0", "assert prefix_hits('طائرة رمل قهوة شمس لغة نور ليل') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('بحر ليل لغة وردة') == 2\nassert prefix_hits('سلام ماء برمجة وردة علم مدينة ليل') == 1\nassert prefix_hits('ليل عربية سماء رمل وردة حصان') == 1\nassert prefix_hits('ليل طائرة سماء شجرة جمل وردة') == 1\nassert prefix_hits('سوق طائرة') == 0\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:\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('بحر ليل لغة وردة')` يُرجع `2`.\nالجواب:", "qhash": "d2775bb204bca872"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 3 * x ** 2 + (3) * x + (3)", "tests": ["assert eval_poly(4) == 63", "assert eval_poly(-2) == 9", "assert eval_poly(4) == 63", "assert eval_poly(-15) == 633", "assert eval_poly(13) == 549", "assert eval_poly(1) == 9", "assert eval_poly(12) == 471", "assert eval_poly(0) == 3"], "test_code": "assert eval_poly(4) == 63\nassert eval_poly(-2) == 9\nassert eval_poly(4) == 63\nassert eval_poly(-15) == 633\nassert eval_poly(13) == 549\nassert eval_poly(1) == 9\nassert eval_poly(12) == 471\nassert eval_poly(0) == 3", "answer": "def eval_poly(x):\n return 3 * x ** 2 + (3) * x + (3)", "completion": " ```python\ndef eval_poly(x):\n return 3 * x ** 2 + (3) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 3x² + 3x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(4)` يُرجع `63`.\nالجواب:", "qhash": "df263bbb935ec566"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Ping']", "assert fizz(11) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Ping']", "assert fizz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22']"], "test_code": "assert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Ping']\nassert fizz(11) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Ping']\nassert fizz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Ping'، وإن قَبِلها على 10 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(20)` يُرجع `['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong']`.\nالجواب:", "qhash": "f06f5c0981458844"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 41", "tests": ["assert fact_mod(6) == 18", "assert fact_mod(21) == 40", "assert fact_mod(38) == 12", "assert fact_mod(59) == 0", "assert fact_mod(47) == 0", "assert fact_mod(5) == 10", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 18\nassert fact_mod(21) == 40\nassert fact_mod(38) == 12\nassert fact_mod(59) == 0\nassert fact_mod(47) == 0\nassert fact_mod(5) == 10\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 41", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 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": "7584abf54019b0c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [40, 24, 1, -7, -3]\nprint(nums[0:3])\nprint(nums[::3])\nprint(len(nums[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [40, 24, 1, -7, -3]\nprint(nums[0:3])\nprint(nums[::3])\nprint(len(nums[0:3]))\n```\nالجواب:", "qhash": "93092fd6c661e65b", "answer": "[40, 24, 1]\n[40, -7]\n3", "completion": " الناتج:\n```text\n[40, 24, 1]\n[40, -7]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 104:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([34, 32, 40, 3, 46, 43, 7, 16, 2]) == [34, 66, 0, 3, 49, 92, 99, 0, 2]", "assert rolling_total([47, 89, 72]) == [47, 0, 72]", "assert rolling_total([25, 25, -8, 32, 26, 101]) == [25, 50, 42, 74, 100, 0]", "assert rolling_total([2, 104, -3, 55, 41, 93, 13, 58, 52, 64]) == [2, 0, -3, 52, 93, 0, 13, 71, 0, 64]", "assert rolling_total([1, -10, 28, 1, 20]) == [1, -9, 19, 20, 40]", "assert rolling_total([34, 63, 65, 21, 37, 14, 85]) == [34, 97, 0, 21, 58, 72, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([34, 32, 40, 3, 46, 43, 7, 16, 2]) == [34, 66, 0, 3, 49, 92, 99, 0, 2]\nassert rolling_total([47, 89, 72]) == [47, 0, 72]\nassert rolling_total([25, 25, -8, 32, 26, 101]) == [25, 50, 42, 74, 100, 0]\nassert rolling_total([2, 104, -3, 55, 41, 93, 13, 58, 52, 64]) == [2, 0, -3, 52, 93, 0, 13, 71, 0, 64]\nassert rolling_total([1, -10, 28, 1, 20]) == [1, -9, 19, 20, 40]\nassert rolling_total([34, 63, 65, 21, 37, 14, 85]) == [34, 97, 0, 21, 58, 72, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 104:\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 > 104:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 104 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([34, 32, 40, 3, 46, 43, 7, 16, 2])` يُرجع `[34, 66, 0, 3, 49, 92, 99, 0, 2]`.\nالجواب:", "qhash": "e702c6fa55cacbe5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -2 + 7 for x in range(6, 21) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -2 + 7 for x in range(6, 21) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a2b65322bca53f7c", "answer": "[-5, -9, -13, -17, -21, -25, -29, -33]\n8 -152", "completion": " الناتج:\n```text\n[-5, -9, -13, -17, -21, -25, -29, -33]\n8 -152\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'brain_rocket'\nprint(text[2:11])\nprint(text.replace('k', '*'))\nprint(text.index('k') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'brain_rocket'\nprint(text[2:11])\nprint(text.replace('k', '*'))\nprint(text.index('k') + len(text))\n```\nالجواب:", "qhash": "0ba19717e50a871f", "answer": "ain_rocke\nbrain_roc*et\n21", "completion": " الناتج:\n```text\nain_rocke\nbrain_roc*et\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(15) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15']", "assert fizz(22) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping', '17', '18', '19', 'Ping', 'Pong', '22']", "assert fizz(5) == ['1', '2', '3', 'Ping', '5']", "assert fizz(16) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping']", "assert fizz(23) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping', '17', '18', '19', 'Ping', 'Pong', '22', '23']"], "test_code": "assert fizz(15) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15']\nassert fizz(22) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping', '17', '18', '19', 'Ping', 'Pong', '22']\nassert fizz(5) == ['1', '2', '3', 'Ping', '5']\nassert fizz(16) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping']\nassert fizz(23) == ['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15', 'Ping', '17', '18', '19', 'Ping', 'Pong', '22', '23']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 7 == 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 % 4 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 7 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(15)` يجب أن تُرجع `['1', '2', '3', 'Ping', '5', '6', 'Pong', 'Ping', '9', '10', '11', 'Ping', '13', 'Pong', '15']`.\nالجواب:", "qhash": "ddb8aa04e81ed734"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([33, 71, 44, 61, 25, 1, 17, 44, 74, 47, 27, 72]) == 0", "assert count_special([]) == 0", "assert count_special([84, 61]) == 0", "assert count_special([44, -36, 66, 50, 15]) == 0", "assert count_special([45, -8]) == 1", "assert count_special([15, 58, -39, 10, -1]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([33, 71, 44, 61, 25, 1, 17, 44, 74, 47, 27, 72]) == 0\nassert count_special([]) == 0\nassert count_special([84, 61]) == 0\nassert count_special([44, -36, 66, 50, 15]) == 0\nassert count_special([45, -8]) == 1\nassert count_special([15, 58, -39, 10, -1]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([33, 71, 44, 61, 25, 1, 17, 44, 74, 47, 27, 72])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "d82d7062bf51a796"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_div([65, 16, 74, 78, 15, 47, 55]) == 0", "assert count_div([77, 49, 37, -18, 32, 18, 54, 75, 56, 27]) == 4", "assert count_div([15, 75, -4, 33, 42, -36, 46, -7, 1, -23]) == 1", "assert count_div([-34, -22, 26, 90, -31, 17, 11, -8, -39, 55, 57]) == 0", "assert count_div([-23, -9, 36, 82, -35, 80, 28, 72, 58, 57, 36, 64]) == 4", "assert count_div([65, -15, 76, 86, 72, -11]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([65, 16, 74, 78, 15, 47, 55]) == 0\nassert count_div([77, 49, 37, -18, 32, 18, 54, 75, 56, 27]) == 4\nassert count_div([15, 75, -4, 33, 42, -36, 46, -7, 1, -23]) == 1\nassert count_div([-34, -22, 26, 90, -31, 17, 11, -8, -39, 55, 57]) == 0\nassert count_div([-23, -9, 36, 82, -35, 80, 28, 72, 58, 57, 36, 64]) == 4\nassert count_div([65, -15, 76, 86, 72, -11]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([65, 16, 74, 78, 15, 47, 55])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "6e3e1cf1a7d8241d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_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 how_many_div([53, 56, 32, 11, 29, 39, 16, 16, 18, 17]) == 0", "assert how_many_div([79, 31, 4, 41]) == 0", "assert how_many_div([-38, 66, 6, -2, 49, -18, 54]) == 0", "assert how_many_div([-10, 89, 55, -13, 15, -18, 61, 84, -37, 9]) == 3", "assert how_many_div([74, 45, 48, 36, 25, 8, 77, -7]) == 2", "assert how_many_div([3, 45]) == 1", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([53, 56, 32, 11, 29, 39, 16, 16, 18, 17]) == 0\nassert how_many_div([79, 31, 4, 41]) == 0\nassert how_many_div([-38, 66, 6, -2, 49, -18, 54]) == 0\nassert how_many_div([-10, 89, 55, -13, 15, -18, 61, 84, -37, 9]) == 3\nassert how_many_div([74, 45, 48, 36, 25, 8, 77, -7]) == 2\nassert how_many_div([3, 45]) == 1\nassert how_many_div([]) == 0", "answer": "def how_many_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 how_many_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 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([53, 56, 32, 11, 29, 39, 16, 16, 18, 17])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "44501c4e3abd7f6f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -9 * x ** 2 + (-5) * x + (-4)", "tests": ["assert value_at(3) == -100", "assert value_at(13) == -1590", "assert value_at(10) == -954", "assert value_at(4) == -168", "assert value_at(-16) == -2228", "assert value_at(13) == -1590", "assert value_at(-3) == -70", "assert value_at(0) == -4"], "test_code": "assert value_at(3) == -100\nassert value_at(13) == -1590\nassert value_at(10) == -954\nassert value_at(4) == -168\nassert value_at(-16) == -2228\nassert value_at(13) == -1590\nassert value_at(-3) == -70\nassert value_at(0) == -4", "answer": "def value_at(x):\n return -9 * x ** 2 + (-5) * x + (-4)", "completion": " ```python\ndef value_at(x):\n return -9 * x ** 2 + (-5) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -9x² - 5x - 4 عند العدد الصحيح x.\nمثال: `value_at(3)` يجب أن تُرجع `-100`.\nالجواب:", "qhash": "6fd2e21c746081fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= 17)", "tests": ["assert in_range_scaled([-16, 23, -25, -13, 9]) == [-45, 65, 80]", "assert in_range_scaled([58, 0, -23]) == [0]", "assert in_range_scaled([-6, -25, -30, -8, 43, 8]) == [-40, 30, 40]", "assert in_range_scaled([12, 60, 40]) == [-60]", "assert in_range_scaled([28, 6, 59]) == [-30]", "assert in_range_scaled([-27, 7, -5, 15, -29]) == [-75, -35, 25]", "assert in_range_scaled([28, 3, 59, 53, 21, 51]) == [-15]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-16, 23, -25, -13, 9]) == [-45, 65, 80]\nassert in_range_scaled([58, 0, -23]) == [0]\nassert in_range_scaled([-6, -25, -30, -8, 43, 8]) == [-40, 30, 40]\nassert in_range_scaled([12, 60, 40]) == [-60]\nassert in_range_scaled([28, 6, 59]) == [-30]\nassert in_range_scaled([-27, 7, -5, 15, -29]) == [-75, -35, 25]\nassert in_range_scaled([28, 3, 59, 53, 21, 51]) == [-15]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= 17)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و17 (شاملًا الطرفين) في -5.\nمثال: `in_range_scaled([-16, 23, -25, -13, 9])` يجب أن تُرجع `[-45, 65, 80]`.\nالجواب:", "qhash": "b3c67773c99e449c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [2, 39, 30, -3, 34, 10]\nprint(a[1:2])\nprint(a[::3])\nprint(sum(a[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [2, 39, 30, -3, 34, 10]\nprint(a[1:2])\nprint(a[::3])\nprint(sum(a[1:2]))\n```\nالجواب:", "qhash": "3e70c16d98984a34", "answer": "[39]\n[2, -3]\n39", "completion": " الناتج:\n```text\n[39]\n[2, -3]\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 116\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 = 116\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": "f0b4319e77851a8b", "answer": "20", "completion": " الناتج:\n```text\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert sum_terms(4) == 330", "assert sum_terms(7) == 1540", "assert sum_terms(4) == 330", "assert sum_terms(3) == 154", "assert sum_terms(10) == 4235", "assert sum_terms(1) == 11", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 330\nassert sum_terms(7) == 1540\nassert sum_terms(4) == 330\nassert sum_terms(3) == 154\nassert sum_terms(10) == 4235\nassert sum_terms(1) == 11\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `330`.\nالجواب:", "qhash": "7a188f687894e21b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حديقة عمل بيت قمر نور عمل بيت') == 2", "assert count_prefix('بحر بيت حاسوب علم مكتبة') == 1", "assert count_prefix('دفتر عمل بحر بيت باب') == 1", "assert count_prefix('عمل جمل نهر بيت') == 1", "assert count_prefix('عربية وردة علم وردة عمل مدينة سيارة') == 3", "assert count_prefix('عربية علم لغة قهوة') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('حديقة عمل بيت قمر نور عمل بيت') == 2\nassert count_prefix('بحر بيت حاسوب علم مكتبة') == 1\nassert count_prefix('دفتر عمل بحر بيت باب') == 1\nassert count_prefix('عمل جمل نهر بيت') == 1\nassert count_prefix('عربية وردة علم وردة عمل مدينة سيارة') == 3\nassert count_prefix('عربية علم لغة قهوة') == 2\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('حديقة عمل بيت قمر نور عمل بيت')` يُرجع `2`.\nالجواب:", "qhash": "bf56cb03436555e5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -3 + 10 for x in range(2, 7) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -3 + 10 for x in range(2, 7) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "fb46e2d858385a49", "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": "functions", "template": "p_func#0", "code": "def h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(-2))\nprint(h(-2, 10))\nprint(h(h(10), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(-2))\nprint(h(-2, 10))\nprint(h(h(10), -2))\n```\nالجواب:", "qhash": "3654f95e4eb31a18", "answer": "-8\n-22\n-19", "completion": " الناتج:\n```text\n-8\n-22\n-19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert cycle([42, 11, 12, 45, 16, 17, 36, 16]) == [45, 16, 17, 36, 16, 42, 11, 12]", "assert cycle([48]) == [48]", "assert cycle([21, 25, 48, 49, 35, 20, 40, 23, 44, 30, 40]) == [44, 30, 40, 21, 25, 48, 49, 35, 20, 40, 23]", "assert cycle([29, 50, 16, 25, 17, 40, 20, -9, 32, 44, 31]) == [32, 44, 31, 29, 50, 16, 25, 17, 40, 20, -9]", "assert cycle([39, -8, 32, 45, 21, 47, 9, 11, 43, -8]) == [-8, 39, -8, 32, 45, 21, 47, 9, 11, 43]", "assert cycle([-6, 8, 24, 45, 35]) == [35, -6, 8, 24, 45]", "assert cycle([]) == []"], "test_code": "assert cycle([42, 11, 12, 45, 16, 17, 36, 16]) == [45, 16, 17, 36, 16, 42, 11, 12]\nassert cycle([48]) == [48]\nassert cycle([21, 25, 48, 49, 35, 20, 40, 23, 44, 30, 40]) == [44, 30, 40, 21, 25, 48, 49, 35, 20, 40, 23]\nassert cycle([29, 50, 16, 25, 17, 40, 20, -9, 32, 44, 31]) == [32, 44, 31, 29, 50, 16, 25, 17, 40, 20, -9]\nassert cycle([39, -8, 32, 45, 21, 47, 9, 11, 43, -8]) == [-8, 39, -8, 32, 45, 21, 47, 9, 11, 43]\nassert cycle([-6, 8, 24, 45, 35]) == [35, -6, 8, 24, 45]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([42, 11, 12, 45, 16, 17, 36, 16])` يُرجع `[45, 16, 17, 36, 16, 42, 11, 12]`.\nالجواب:", "qhash": "ca7264d886d99b23"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ب')", "tests": ["assert count_letter('حديقة خبز نهر نهر صديق طائرة لغة') == 1", "assert count_letter('') == 0", "assert count_letter('صديق شجرة خبز') == 1", "assert count_letter('صحراء نهار سيارة') == 0", "assert count_letter('طائرة برتقال طائرة حاسوب مكتبة') == 3", "assert count_letter('مدينة') == 0", "assert count_letter('رمل برتقال عمل خبز علم تفاحة مدينة') == 2", "assert count_letter('') == 0"], "test_code": "assert count_letter('حديقة خبز نهر نهر صديق طائرة لغة') == 1\nassert count_letter('') == 0\nassert count_letter('صديق شجرة خبز') == 1\nassert count_letter('صحراء نهار سيارة') == 0\nassert count_letter('طائرة برتقال طائرة حاسوب مكتبة') == 3\nassert count_letter('مدينة') == 0\nassert count_letter('رمل برتقال عمل خبز علم تفاحة مدينة') == 2\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)` بحيث تُعيد عدد مرات ظهور الحرف «ب» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('حديقة خبز نهر نهر صديق طائرة لغة')` يُرجع `1`.\nالجواب:", "qhash": "43709e31496a7b43"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('باسل', 21), ('ليلى', 54), ('زينب', 2), ('مريم', 72)]\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 = [('باسل', 21), ('ليلى', 54), ('زينب', 2), ('مريم', 72)]\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": "2918dcfd9ff699af", "answer": "[('زينب', 2), ('باسل', 21), ('ليلى', 54), ('مريم', 72)]\n['مريم', 'ليلى']", "completion": " الناتج:\n```text\n[('زينب', 2), ('باسل', 21), ('ليلى', 54), ('مريم', 72)]\n['مريم', 'ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81", "tests": ["assert digits_mod(79348) == 31", "assert digits_mod(543494) == 29", "assert digits_mod(674230) == 22", "assert digits_mod(961809) == 33", "assert digits_mod(546358) == 31", "assert digits_mod(191122) == 16", "assert digits_mod(284775) == 33", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(79348) == 31\nassert digits_mod(543494) == 29\nassert digits_mod(674230) == 22\nassert digits_mod(961809) == 33\nassert digits_mod(546358) == 31\nassert digits_mod(191122) == 16\nassert digits_mod(284775) == 33\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 81.\nللتوضيح: الاستدعاء `digits_mod(79348)` يُرجع `31`.\nالجواب:", "qhash": "c68f41fb22eb80b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 0:\n return 4\n return 3 * f(n - 1) + 2\n\nprint(f(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 0:\n return 4\n return 3 * f(n - 1) + 2\n\nprint(f(4))\n```\nالجواب:", "qhash": "f28bbde5b21fb0c9", "answer": "404", "completion": " الناتج:\n```text\n404\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert tally_div([38, 3, 12, 25, 6, 25, 35]) == 2", "assert tally_div([25, 9, 21, -34, 55, 35, -19, 63, -21, 30]) == 0", "assert tally_div([48]) == 1", "assert tally_div([80, 82, 26, -38, 60, -23, -29, 44, 4, 2, 56]) == 0", "assert tally_div([-35, 77, -15]) == 0", "assert tally_div([45, 17, 12, 81, 31, -17]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([38, 3, 12, 25, 6, 25, 35]) == 2\nassert tally_div([25, 9, 21, -34, 55, 35, -19, 63, -21, 30]) == 0\nassert tally_div([48]) == 1\nassert tally_div([80, 82, 26, -38, 60, -23, -29, 44, 4, 2, 56]) == 0\nassert tally_div([-35, 77, -15]) == 0\nassert tally_div([45, 17, 12, 81, 31, -17]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([38, 3, 12, 25, 6, 25, 35])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "79abbc76ccc5eb8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -9 * x ** 2 + (0) * x + (1)", "tests": ["assert p(1) == -8", "assert p(-18) == -2915", "assert p(-14) == -1763", "assert p(9) == -728", "assert p(-9) == -728", "assert p(-3) == -80", "assert p(10) == -899", "assert p(0) == 1"], "test_code": "assert p(1) == -8\nassert p(-18) == -2915\nassert p(-14) == -1763\nassert p(9) == -728\nassert p(-9) == -728\nassert p(-3) == -80\nassert p(10) == -899\nassert p(0) == 1", "answer": "def p(x):\n return -9 * x ** 2 + (0) * x + (1)", "completion": " ```python\ndef p(x):\n return -9 * x ** 2 + (0) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -9x² + 0x + 1 عند العدد الصحيح x.\nمثال: `p(1)` يجب أن تُرجع `-8`.\nالجواب:", "qhash": "010fbf6829a9b1fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([69, 71, 76, 86, 84, 8, 52, 24, 77]) == [69, 140, 0, 86, 170, 0, 52, 76, 153]", "assert reset_sum([121, 118, 106, 122, 164, 147]) == [121, 0, 106, 0, 164, 0]", "assert reset_sum([93, 48, 151, 127]) == [93, 141, 0, 127]", "assert reset_sum([96, 25, 93, 92]) == [96, 121, 0, 92]", "assert reset_sum([165, 9, 12, 40, 66]) == [165, 174, 0, 40, 106]", "assert reset_sum([82, 117, 89, 54, 144]) == [82, 0, 89, 143, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([69, 71, 76, 86, 84, 8, 52, 24, 77]) == [69, 140, 0, 86, 170, 0, 52, 76, 153]\nassert reset_sum([121, 118, 106, 122, 164, 147]) == [121, 0, 106, 0, 164, 0]\nassert reset_sum([93, 48, 151, 127]) == [93, 141, 0, 127]\nassert reset_sum([96, 25, 93, 92]) == [96, 121, 0, 92]\nassert reset_sum([165, 9, 12, 40, 66]) == [165, 174, 0, 40, 106]\nassert reset_sum([82, 117, 89, 54, 144]) == [82, 0, 89, 143, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\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 > 175:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 175 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([69, 71, 76, 86, 84, 8, 52, 24, 77])` يُرجع `[69, 140, 0, 86, 170, 0, 52, 76, 153]`.\nالجواب:", "qhash": "61293d171e1bb189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(6))\n```\nالجواب:", "qhash": "cc79d4bd826fe7be", "answer": "47", "completion": " الناتج:\n```text\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 17\nfor n in range(-2, 6, 1):\n acc += n * 7\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 17\nfor n in range(-2, 6, 1):\n acc += n * 7\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "99b90b7eaa5dd862", "answer": "101\n5", "completion": " الناتج:\n```text\n101\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 91681\nsteps = 0\nwhile n > 18:\n n = n // 8\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 91681\nsteps = 0\nwhile n > 18:\n n = n // 8\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "1d7469c3232836df", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 19", "tests": ["assert mfact(8) == 13", "assert mfact(5) == 5", "assert mfact(20) == 7", "assert mfact(36) == 18", "assert mfact(56) == 8", "assert mfact(22) == 14", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 13\nassert mfact(5) == 5\nassert mfact(20) == 7\nassert mfact(36) == 18\nassert mfact(56) == 8\nassert mfact(22) == 14\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 19", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(8)` يُرجع `13`.\nالجواب:", "qhash": "52a10392ff79a44f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('python falcon we') == 'dmhvcb tozqcb ks'", "assert shift_letters('garden banana go go by') == 'uofrsb pobobo uc uc pm'", "assert shift_letters('garden camel') == 'uofrsb qoasz'", "assert shift_letters('winter window desert') == 'kwbhsf kwbrck rsgsfh'", "assert shift_letters('at apple go light') == 'oh oddzs uc zwuvh'", "assert shift_letters('we go') == 'ks uc'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('python falcon we') == 'dmhvcb tozqcb ks'\nassert shift_letters('garden banana go go by') == 'uofrsb pobobo uc uc pm'\nassert shift_letters('garden camel') == 'uofrsb qoasz'\nassert shift_letters('winter window desert') == 'kwbhsf kwbrck rsgsfh'\nassert shift_letters('at apple go light') == 'oh oddzs uc zwuvh'\nassert shift_letters('we go') == 'ks uc'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('python falcon we')` يُرجع `'dmhvcb tozqcb ks'`.\nالجواب:", "qhash": "82efc7213cd7b790"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['light', 'orange', 'brain', 'signal', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['light', 'orange', 'brain', 'signal', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "ad352c58cc68057f", "answer": "['light', 'brain', 'orange', 'signal', 'winter']\n['winter', 'signal', 'orange']", "completion": " الناتج:\n```text\n['light', 'brain', 'orange', 'signal', 'winter']\n['winter', 'signal', 'orange']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 10) // 5 for x in range(3, 17) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 10) // 5 for x in range(3, 17) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "f3c980474ce621a1", "answer": "[3, 4, 5]\n3 12", "completion": " الناتج:\n```text\n[3, 4, 5]\n3 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [28, 11, 18, 21, 5]\nprint(lst[3:5])\nprint(lst[::2])\nprint(max(lst[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [28, 11, 18, 21, 5]\nprint(lst[3:5])\nprint(lst[::2])\nprint(max(lst[3:5]))\n```\nالجواب:", "qhash": "a815e35c53098faf", "answer": "[21, 5]\n[28, 18, 5]\n21", "completion": " الناتج:\n```text\n[21, 5]\n[28, 18, 5]\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def 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 max_div([50, -7, 42, -25, 17, 11, 55, -29, 60]) == None", "assert max_div([-36, -45, -36]) == -36", "assert max_div([1, 10, 19, 28]) == None", "assert max_div([-34, -38, 39, -4, 18]) == 18", "assert max_div([1, 44, -18, 26, 31, -7, 28, 10]) == -18", "assert max_div([]) == None"], "test_code": "assert max_div([50, -7, 42, -25, 17, 11, 55, -29, 60]) == None\nassert max_div([-36, -45, -36]) == -36\nassert max_div([1, 10, 19, 28]) == None\nassert max_div([-34, -38, 39, -4, 18]) == 18\nassert max_div([1, 44, -18, 26, 31, -7, 28, 10]) == -18\nassert max_div([]) == None", "answer": "def 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 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 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 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مثال: `max_div([50, -7, 42, -25, 17, 11, 55, -29, 60])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "dc3e6e7bd78e62ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 4 + 1 for x in range(1, 11) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 4 + 1 for x in range(1, 11) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "5883a8e983183b4f", "answer": "[17, 33]\n2 50", "completion": " الناتج:\n```text\n[17, 33]\n2 50\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'حسن': 9, 'هدى': 37, 'زينب': 28}\nscores['هدى'] += 13\nscores['سعيد'] = 53\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'حسن': 9, 'هدى': 37, 'زينب': 28}\nscores['هدى'] += 13\nscores['سعيد'] = 53\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('باسل', -1))\n```\nالجواب:", "qhash": "cb64fbb5fa26caa4", "answer": "4\nسعيد\n140\n-1", "completion": " الناتج:\n```text\n4\nسعيد\n140\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-19, 8, 8, 28, 23]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-19, 8, 8, 28, 23]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "446aec7d826f8e6f", "answer": "[28, 23, 8, 8, -19]\n[28, 23, 8]", "completion": " الناتج:\n```text\n[28, 23, 8, 8, -19]\n[28, 23, 8]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 265\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 = 265\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": "b11f46a65c81becb", "answer": "122", "completion": " الناتج:\n```text\n122\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 18)", "tests": ["assert filter_range([13, 27, 18, 0, 13, 10, -8, -2]) == [-24, -6, 0, 30, 39, 39, 54]", "assert filter_range([-11, 34, -22, -26, -23, 5, 46, 47, 37]) == [-33, 15]", "assert filter_range([37, 27, 35, 57, 57, -26]) == []", "assert filter_range([24]) == []", "assert filter_range([]) == []", "assert filter_range([59, 17, -29, -17, -7, 26, 1]) == [-51, -21, 3, 51]", "assert filter_range([]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([13, 27, 18, 0, 13, 10, -8, -2]) == [-24, -6, 0, 30, 39, 39, 54]\nassert filter_range([-11, 34, -22, -26, -23, 5, 46, 47, 37]) == [-33, 15]\nassert filter_range([37, 27, 35, 57, 57, -26]) == []\nassert filter_range([24]) == []\nassert filter_range([]) == []\nassert filter_range([59, 17, -29, -17, -7, 26, 1]) == [-51, -21, 3, 51]\nassert filter_range([]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 18)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -18 ≤ x ≤ 18، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([13, 27, 18, 0, 13, 10, -8, -2])` يُرجع `[-24, -6, 0, 30, 39, 39, 54]`.\nالجواب:", "qhash": "c4f2c8f37418bdf7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'vector'\nprint(name.find('c'))\nprint(len(name))\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'vector'\nprint(name.find('c'))\nprint(len(name))\nprint(name.split('_'))\n```\nالجواب:", "qhash": "258c31cc0b3de32b", "answer": "2\n6\n['vector']", "completion": " الناتج:\n```text\n2\n6\n['vector']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('pixel') == 'cvkry'", "assert encode('at we an by Hello') == 'ng jr na ol Hryyb'", "assert encode('cloud matrix to is A1') == 'pybhq zngevk gb vf A1'", "assert encode('falcon up') == 'snypba hc'", "assert encode('camel banana music go Hello') == 'pnzry onanan zhfvp tb Hryyb'", "assert encode('window !') == 'jvaqbj !'", "assert encode('') == ''"], "test_code": "assert encode('pixel') == 'cvkry'\nassert encode('at we an by Hello') == 'ng jr na ol Hryyb'\nassert encode('cloud matrix to is A1') == 'pybhq zngevk gb vf A1'\nassert encode('falcon up') == 'snypba hc'\nassert encode('camel banana music go Hello') == 'pnzry onanan zhfvp tb Hryyb'\nassert encode('window !') == 'jvaqbj !'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('pixel')` يجب أن تُرجع `'cvkry'`.\nالجواب:", "qhash": "323f5391540a3835"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'pixel_window'\nprint(word.upper())\nprint(word.index('i') + len(word))\nprint(word.count('i'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'pixel_window'\nprint(word.upper())\nprint(word.index('i') + len(word))\nprint(word.count('i'))\n```\nالجواب:", "qhash": "72bcdbc0445fa6ed", "answer": "PIXEL_WINDOW\n13\n2", "completion": " الناتج:\n```text\nPIXEL_WINDOW\n13\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=6):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(19))\nprint(g(19, 3))\nprint(g(g(3), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=6):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(19))\nprint(g(19, 3))\nprint(g(g(3), 19))\n```\nالجواب:", "qhash": "c1712238c62d21a7", "answer": "-25\n-22\n-22", "completion": " الناتج:\n```text\n-25\n-22\n-22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'علي': 15, 'عمر': 27, 'فيصل': 38}\nd['عمر'] += 16\nd['ليلى'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 23])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'علي': 15, 'عمر': 27, 'فيصل': 38}\nd['عمر'] += 16\nd['ليلى'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 23])\n```\nالجواب:", "qhash": "e19bb729ef507c65", "answer": "4\nعمر\n101\n['عمر', 'فيصل']", "completion": " الناتج:\n```text\n4\nعمر\n101\n['عمر', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل بحر نهار') == 0", "assert prefix_hits('سيارة رمل قهوة برمجة كتاب طائرة') == 0", "assert prefix_hits('شجرة سفينة قمر ليل مطر عربية لغة طالب') == 2", "assert prefix_hits('عربية نهر جبل') == 0", "assert prefix_hits('قمر طالب برمجة باب جمل') == 0", "assert prefix_hits('خبز صديق كتاب لغة بيت ليل برتقال') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('جبل بحر نهار') == 0\nassert prefix_hits('سيارة رمل قهوة برمجة كتاب طائرة') == 0\nassert prefix_hits('شجرة سفينة قمر ليل مطر عربية لغة طالب') == 2\nassert prefix_hits('عربية نهر جبل') == 0\nassert prefix_hits('قمر طالب برمجة باب جمل') == 0\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('جبل بحر نهار')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "cb19b3041e8d89bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'فيصل': 0, 'رنا': 10, 'هشام': 26}\nmarks['هشام'] += 12\nmarks['راشد'] = 11\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 = {'فيصل': 0, 'رنا': 10, 'هشام': 26}\nmarks['هشام'] += 12\nmarks['راشد'] = 11\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": "6f4fdfa7769d053a", "answer": "4\nهشام\n59\n[('فيصل', 0), ('رنا', 10)]", "completion": " الناتج:\n```text\n4\nهشام\n59\n[('فيصل', 0), ('رنا', 10)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 10", "tests": ["assert digits_mod(87908) == 4", "assert digits_mod(685502) == 8", "assert digits_mod(706120) == 4", "assert digits_mod(417442) == 6", "assert digits_mod(869360) == 0", "assert digits_mod(760569) == 9", "assert digits_mod(821913) == 6", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(87908) == 4\nassert digits_mod(685502) == 8\nassert digits_mod(706120) == 4\nassert digits_mod(417442) == 6\nassert digits_mod(869360) == 0\nassert digits_mod(760569) == 9\nassert digits_mod(821913) == 6\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 10", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 10\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 10.\nمثال: `digits_mod(87908)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "8d87d6652784d0df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'سعيد': 8, 'باسل': 25, 'وليد': 22, 'هشام': 30, 'رنا': 32}\npoints['هشام'] += 6\npoints['خالد'] = 33\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 = {'سعيد': 8, 'باسل': 25, 'وليد': 22, 'هشام': 30, 'رنا': 32}\npoints['هشام'] += 6\npoints['خالد'] = 33\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": "a5f624e718478e62", "answer": "6\nهشام\n156\n['باسل', 'وليد', 'هشام', 'رنا', 'خالد']", "completion": " الناتج:\n```text\n6\nهشام\n156\n['باسل', 'وليد', 'هشام', 'رنا', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'نور': 20, 'أحمد': 20, 'مريم': 3, 'سعيد': 2}\nd['سعيد'] += 7\nd['خالد'] = 40\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 = {'نور': 20, 'أحمد': 20, 'مريم': 3, 'سعيد': 2}\nd['سعيد'] += 7\nd['خالد'] = 40\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": "23064e42322953ac", "answer": "5\nخالد\n92\n[('مريم', 3), ('سعيد', 9)]", "completion": " الناتج:\n```text\n5\nخالد\n92\n[('مريم', 3), ('سعيد', 9)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'egr'}", "tests": ["assert char_counts('planet engine is code pixel') == {'e': 5, 'g': 1, 'r': 0}", "assert char_counts('signal data planet river data falcon') == {'e': 2, 'g': 1, 'r': 2}", "assert char_counts('by coffee banana in signal') == {'e': 2, 'g': 1, 'r': 0}", "assert char_counts('pixel') == {'e': 1, 'g': 0, 'r': 0}", "assert char_counts('winter') == {'e': 1, 'g': 0, 'r': 1}", "assert char_counts('in summer to table') == {'e': 2, 'g': 0, 'r': 1}", "assert char_counts('') == {'e': 0, 'g': 0, 'r': 0}"], "test_code": "assert char_counts('planet engine is code pixel') == {'e': 5, 'g': 1, 'r': 0}\nassert char_counts('signal data planet river data falcon') == {'e': 2, 'g': 1, 'r': 2}\nassert char_counts('by coffee banana in signal') == {'e': 2, 'g': 1, 'r': 0}\nassert char_counts('pixel') == {'e': 1, 'g': 0, 'r': 0}\nassert char_counts('winter') == {'e': 1, 'g': 0, 'r': 1}\nassert char_counts('in summer to table') == {'e': 2, 'g': 0, 'r': 1}\nassert char_counts('') == {'e': 0, 'g': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'egr'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'egr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'g'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('planet engine is code pixel')` يجب أن تُرجع `{'e': 5, 'g': 1, 'r': 0}`.\nالجواب:", "qhash": "9db475161d7ee9c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['river', 'cloud', 'music', 'banana', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['river', 'cloud', 'music', 'banana', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "2e11c70ea88945cb", "answer": "['river', 'cloud', 'music', 'apple', 'banana']\n['banana', 'river', 'music']", "completion": " الناتج:\n```text\n['river', 'cloud', 'music', 'apple', 'banana']\n['banana', 'river', 'music']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 62", "tests": ["assert digit_score(78656) == 32", "assert digit_score(30180) == 12", "assert digit_score(613810) == 19", "assert digit_score(636282) == 27", "assert digit_score(5690) == 20", "assert digit_score(637479) == 36", "assert digit_score(877503) == 30", "assert digit_score(0) == 0"], "test_code": "assert digit_score(78656) == 32\nassert digit_score(30180) == 12\nassert digit_score(613810) == 19\nassert digit_score(636282) == 27\nassert digit_score(5690) == 20\nassert digit_score(637479) == 36\nassert digit_score(877503) == 30\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 62", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 62\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 62.\nللتوضيح: الاستدعاء `digit_score(78656)` يُرجع `32`.\nالجواب:", "qhash": "3c994784fb1fbd60"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'girs'}", "tests": ["assert freq_of('orange') == {'g': 1, 'i': 0, 'r': 1, 's': 0}", "assert freq_of('on') == {'g': 0, 'i': 0, 'r': 0, 's': 0}", "assert freq_of('orange is a') == {'g': 1, 'i': 1, 'r': 1, 's': 1}", "assert freq_of('data of on') == {'g': 0, 'i': 0, 'r': 0, 's': 0}", "assert freq_of('by') == {'g': 0, 'i': 0, 'r': 0, 's': 0}", "assert freq_of('cloud orange at') == {'g': 1, 'i': 0, 'r': 1, 's': 0}", "assert freq_of('') == {'g': 0, 'i': 0, 'r': 0, 's': 0}"], "test_code": "assert freq_of('orange') == {'g': 1, 'i': 0, 'r': 1, 's': 0}\nassert freq_of('on') == {'g': 0, 'i': 0, 'r': 0, 's': 0}\nassert freq_of('orange is a') == {'g': 1, 'i': 1, 'r': 1, 's': 1}\nassert freq_of('data of on') == {'g': 0, 'i': 0, 'r': 0, 's': 0}\nassert freq_of('by') == {'g': 0, 'i': 0, 'r': 0, 's': 0}\nassert freq_of('cloud orange at') == {'g': 1, 'i': 0, 'r': 1, 's': 0}\nassert freq_of('') == {'g': 0, 'i': 0, 'r': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'girs'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'girs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'i'، 'r'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('orange')` يُرجع `{'g': 1, 'i': 0, 'r': 1, 's': 0}`.\nالجواب:", "qhash": "102172ef47983064"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'تفاحة مطر'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(kalima[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'تفاحة مطر'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(kalima[0])\n```\nالجواب:", "qhash": "bf011b13f901afaa", "answer": "['تفاحة', 'مطر']\n8\nت", "completion": " الناتج:\n```text\n['تفاحة', 'مطر']\n8\nت\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('نهر حصان شمس دفتر معلم نور مدرسة تفاحة') == 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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ع» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('طائرة جبل شمس عربية دفتر باب نهر برمجة')` يُرجع `1`.\nالجواب:", "qhash": "a865edad8cb47d10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'camel'\nprint(s.split('_'))\nprint(len(s))\nprint(s[1:5])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'camel'\nprint(s.split('_'))\nprint(len(s))\nprint(s[1:5])\n```\nالجواب:", "qhash": "4fae1816fa8e21a9", "answer": "['camel']\n5\namel", "completion": " الناتج:\n```text\n['camel']\n5\namel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 1\n return total", "tests": ["assert scaled_powers(8) == 180", "assert scaled_powers(1) == 5", "assert scaled_powers(5) == 75", "assert scaled_powers(1) == 5", "assert scaled_powers(11) == 330", "assert scaled_powers(1) == 5", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 180\nassert scaled_powers(1) == 5\nassert scaled_powers(5) == 75\nassert scaled_powers(1) == 5\nassert scaled_powers(11) == 330\nassert scaled_powers(1) == 5\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 1\n return total\n```\nمثال: `scaled_powers(8)` يجب أن تُرجع `180`.\nالجواب:", "qhash": "92e3512ded2dd8c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'جمل'\nprint(text[-1])\nprint(text.split())\nprint(text.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'جمل'\nprint(text[-1])\nprint(text.split())\nprint(text.count('ب'))\n```\nالجواب:", "qhash": "1a9f511fec409ce1", "answer": "ل\n['جمل']\n0", "completion": " الناتج:\n```text\nل\n['جمل']\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ل')", "tests": ["assert letter_hits('ماء مطر برمجة نور صحراء مدينة جمل') == 1", "assert letter_hits('دفتر لغة قمر جمل مدينة حصان جمل باب') == 3", "assert letter_hits('بحر سفينة برمجة حصان قمر') == 0", "assert letter_hits('جمل قلم بحر نهار طالب') == 3", "assert letter_hits('علم قمر تفاحة قلم سماء شمس') == 2", "assert letter_hits('ماء مدينة بحر سلام ليل صحراء صديق جمل') == 4", "assert letter_hits('كتاب سفينة جبل قهوة سفينة سيارة حصان علم') == 2", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('ماء مطر برمجة نور صحراء مدينة جمل') == 1\nassert letter_hits('دفتر لغة قمر جمل مدينة حصان جمل باب') == 3\nassert letter_hits('بحر سفينة برمجة حصان قمر') == 0\nassert letter_hits('جمل قلم بحر نهار طالب') == 3\nassert letter_hits('علم قمر تفاحة قلم سماء شمس') == 2\nassert letter_hits('ماء مدينة بحر سلام ليل صحراء صديق جمل') == 4\nassert letter_hits('كتاب سفينة جبل قهوة سفينة سيارة حصان علم') == 2\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": "5f4c329de9c02aef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 997", "tests": ["assert multi_fact(7) == 55", "assert multi_fact(6) == 720", "assert multi_fact(22) == 492", "assert multi_fact(10) == 717", "assert multi_fact(31) == 172", "assert multi_fact(60) == 342", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(7) == 55\nassert multi_fact(6) == 720\nassert multi_fact(22) == 492\nassert multi_fact(10) == 717\nassert multi_fact(31) == 172\nassert multi_fact(60) == 342\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 997", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(7)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "d20bf85747843830"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 9\nfor n in range(4, 18, 1):\n acc -= n * 7\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 9\nfor n in range(4, 18, 1):\n acc -= n * 7\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "ac3a8ecbd0f50517", "answer": "-1020\n17", "completion": " الناتج:\n```text\n-1020\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[k:] + items[:k]", "tests": ["assert roll([10, 35, 22, 5, 7]) == [10, 35, 22, 5, 7]", "assert roll([44, 43, 0, 21, 30, 40, 44, 14, 23]) == [44, 14, 23, 44, 43, 0, 21, 30, 40]", "assert roll([49, 4, 42, 4]) == [4, 49, 4, 42]", "assert roll([22, 11, 9, 45, 50, 12, 4, 41, 35, 44, 36]) == [50, 12, 4, 41, 35, 44, 36, 22, 11, 9, 45]", "assert roll([24, 11, 44, 24, -4, 50, 50, -4, 36]) == [50, -4, 36, 24, 11, 44, 24, -4, 50]", "assert roll([36, 17]) == [17, 36]", "assert roll([]) == []"], "test_code": "assert roll([10, 35, 22, 5, 7]) == [10, 35, 22, 5, 7]\nassert roll([44, 43, 0, 21, 30, 40, 44, 14, 23]) == [44, 14, 23, 44, 43, 0, 21, 30, 40]\nassert roll([49, 4, 42, 4]) == [4, 49, 4, 42]\nassert roll([22, 11, 9, 45, 50, 12, 4, 41, 35, 44, 36]) == [50, 12, 4, 41, 35, 44, 36, 22, 11, 9, 45]\nassert roll([24, 11, 44, 24, -4, 50, 50, -4, 36]) == [50, -4, 36, 24, 11, 44, 24, -4, 50]\nassert roll([36, 17]) == [17, 36]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return ____\n```\nمثال: `roll([10, 35, 22, 5, 7])` يجب أن تُرجع `[10, 35, 22, 5, 7]`.\nالجواب:", "qhash": "b5982dbcccc6be20"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'garden'\nprint(word.capitalize())\nprint(word.find('e'))\nprint(word[-2:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'garden'\nprint(word.capitalize())\nprint(word.find('e'))\nprint(word[-2:])\n```\nالجواب:", "qhash": "e4d424f9bc092a93", "answer": "Garden\n4\nen", "completion": " الناتج:\n```text\nGarden\n4\nen\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('engine it at camel by') == 'engine'", "assert rev_join('code') == ''", "assert rev_join('orange of python falcon engine of') == 'engine falcon python orange'", "assert rev_join('signal planet table') == 'planet signal'", "assert rev_join('to at by') == ''", "assert rev_join('python of orange orange camel desert banana') == 'banana desert orange orange python'", "assert rev_join('vector python summer an engine desert is engine') == 'engine desert engine summer python vector'"], "test_code": "assert rev_join('engine it at camel by') == 'engine'\nassert rev_join('code') == ''\nassert rev_join('orange of python falcon engine of') == 'engine falcon python orange'\nassert rev_join('signal planet table') == 'planet signal'\nassert rev_join('to at by') == ''\nassert rev_join('python of orange orange camel desert banana') == 'banana desert orange orange python'\nassert rev_join('vector python summer an engine desert is engine') == 'engine desert engine summer python vector'", "answer": "def rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_join('engine it at camel by')` يُرجع `'engine'`.\nالجواب:", "qhash": "6e0e522d23a64a56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 15\nfor j in range(2, 8, 1):\n acc -= j * 6\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 15\nfor j in range(2, 8, 1):\n acc -= j * 6\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "78d3e2edc914be53", "answer": "-147\n7", "completion": " الناتج:\n```text\n-147\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([3, -10, 49, 7, 39, -3]) == 39", "assert max_multiple([-12, -6, -12]) == -6", "assert max_multiple([1, 4]) == None", "assert max_multiple([36, 8, 20, 27, 35, -26]) == 36", "assert max_multiple([20, -32, -18, -5, 9]) == 9", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([3, -10, 49, 7, 39, -3]) == 39\nassert max_multiple([-12, -6, -12]) == -6\nassert max_multiple([1, 4]) == None\nassert max_multiple([36, 8, 20, 27, 35, -26]) == 36\nassert max_multiple([20, -32, -18, -5, 9]) == 9\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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للتوضيح: الاستدعاء `max_multiple([3, -10, 49, 7, 39, -3])` يُرجع `39`.\nالجواب:", "qhash": "564f36868de8c4ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [3, -9, 13, 1, 32, 13, 15]\nprint(lst[3:7])\nprint(lst[::-2])\nprint(max(lst[3:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [3, -9, 13, 1, 32, 13, 15]\nprint(lst[3:7])\nprint(lst[::-2])\nprint(max(lst[3:7]))\n```\nالجواب:", "qhash": "a7f1d8e07dac1d97", "answer": "[1, 32, 13, 15]\n[15, 32, 13, 3]\n32", "completion": " الناتج:\n```text\n[1, 32, 13, 15]\n[15, 32, 13, 3]\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "tests": ["assert sum_div(272) == 9115", "assert sum_div(29) == 118", "assert sum_div(242) == 7325", "assert sum_div(5) == 0", "assert sum_div(53) == 364", "assert sum_div(64) == 483", "assert sum_div(1) == 0"], "test_code": "assert sum_div(272) == 9115\nassert sum_div(29) == 118\nassert sum_div(242) == 7325\nassert sum_div(5) == 0\nassert sum_div(53) == 364\nassert sum_div(64) == 483\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 8.\nمثال: `sum_div(272)` يجب أن تُرجع `9115`.\nالجواب:", "qhash": "bf893c2eeb370171"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "tests": ["assert power_sum(3) == 108", "assert power_sum(5) == 675", "assert power_sum(7) == 2352", "assert power_sum(14) == 33075", "assert power_sum(6) == 1323", "assert power_sum(1) == 3", "assert power_sum(0) == 0"], "test_code": "assert power_sum(3) == 108\nassert power_sum(5) == 675\nassert power_sum(7) == 2352\nassert power_sum(14) == 33075\nassert power_sum(6) == 1323\nassert power_sum(1) == 3\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `power_sum(3)` يُرجع `108`.\nالجواب:", "qhash": "6127140861cdcac9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'demn'}", "tests": ["assert letter_stats('light a go matrix in table') == {'d': 0, 'e': 1, 'm': 1, 'n': 1}", "assert letter_stats('a in in it on to') == {'d': 0, 'e': 0, 'm': 0, 'n': 3}", "assert letter_stats('up desert vector a brain') == {'d': 1, 'e': 3, 'm': 0, 'n': 1}", "assert letter_stats('rocket') == {'d': 0, 'e': 1, 'm': 0, 'n': 0}", "assert letter_stats('python vector an at') == {'d': 0, 'e': 1, 'm': 0, 'n': 2}", "assert letter_stats('a rocket python table pixel') == {'d': 0, 'e': 3, 'm': 0, 'n': 1}", "assert letter_stats('') == {'d': 0, 'e': 0, 'm': 0, 'n': 0}"], "test_code": "assert letter_stats('light a go matrix in table') == {'d': 0, 'e': 1, 'm': 1, 'n': 1}\nassert letter_stats('a in in it on to') == {'d': 0, 'e': 0, 'm': 0, 'n': 3}\nassert letter_stats('up desert vector a brain') == {'d': 1, 'e': 3, 'm': 0, 'n': 1}\nassert letter_stats('rocket') == {'d': 0, 'e': 1, 'm': 0, 'n': 0}\nassert letter_stats('python vector an at') == {'d': 0, 'e': 1, 'm': 0, 'n': 2}\nassert letter_stats('a rocket python table pixel') == {'d': 0, 'e': 3, 'm': 0, 'n': 1}\nassert letter_stats('') == {'d': 0, 'e': 0, 'm': 0, 'n': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'demn'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'demn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'e'، 'm'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('light a go matrix in table')` يجب أن تُرجع `{'d': 0, 'e': 1, 'm': 1, 'n': 1}`.\nالجواب:", "qhash": "ba050461ed41ecbe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "tests": ["assert multiples_total(271) == 10175", "assert multiples_total(229) == 6935", "assert multiples_total(156) == 3470", "assert multiples_total(259) == 9116", "assert multiples_total(193) == 5058", "assert multiples_total(152) == 3161", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(271) == 10175\nassert multiples_total(229) == 6935\nassert multiples_total(156) == 3470\nassert multiples_total(259) == 9116\nassert multiples_total(193) == 5058\nassert multiples_total(152) == 3161\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 % 11 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(271)` يُرجع `10175`.\nالجواب:", "qhash": "21efe77164138ff1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('light banana we') == 'oljkw edqdqd zh'", "assert rotate_letters('winter go falcon garden winter') == 'zlqwhu jr idofrq jdughq zlqwhu'", "assert rotate_letters('desert') == 'ghvhuw'", "assert rotate_letters('vector at a on a') == 'yhfwru dw d rq d'", "assert rotate_letters('at to in A1') == 'dw wr lq A1'", "assert rotate_letters('window to') == 'zlqgrz wr'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('light banana we') == 'oljkw edqdqd zh'\nassert rotate_letters('winter go falcon garden winter') == 'zlqwhu jr idofrq jdughq zlqwhu'\nassert rotate_letters('desert') == 'ghvhuw'\nassert rotate_letters('vector at a on a') == 'yhfwru dw d rq d'\nassert rotate_letters('at to in A1') == 'dw wr lq A1'\nassert rotate_letters('window to') == 'zlqgrz wr'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('light banana we')` يُرجع `'oljkw edqdqd zh'`.\nالجواب:", "qhash": "9840105be97fcafb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(arr):\n if not arr:\n return []\n k = 5 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_list([10, 18, 33, 12, 45, 44, 36]) == [33, 12, 45, 44, 36, 10, 18]", "assert rotate_list([49, 3, 42, 3, 13, 31, 7, 26, 9, 42]) == [31, 7, 26, 9, 42, 49, 3, 42, 3, 13]", "assert rotate_list([41, 40, 1]) == [40, 1, 41]", "assert rotate_list([-6, 48, 30, 22, 14, 34, 12, 18, 47, 49, 50, 1]) == [18, 47, 49, 50, 1, -6, 48, 30, 22, 14, 34, 12]", "assert rotate_list([10, 46, 26, 15, 11, 33, 7, 2, 39]) == [11, 33, 7, 2, 39, 10, 46, 26, 15]", "assert rotate_list([21, 41, 10, -8, 18]) == [21, 41, 10, -8, 18]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([10, 18, 33, 12, 45, 44, 36]) == [33, 12, 45, 44, 36, 10, 18]\nassert rotate_list([49, 3, 42, 3, 13, 31, 7, 26, 9, 42]) == [31, 7, 26, 9, 42, 49, 3, 42, 3, 13]\nassert rotate_list([41, 40, 1]) == [40, 1, 41]\nassert rotate_list([-6, 48, 30, 22, 14, 34, 12, 18, 47, 49, 50, 1]) == [18, 47, 49, 50, 1, -6, 48, 30, 22, 14, 34, 12]\nassert rotate_list([10, 46, 26, 15, 11, 33, 7, 2, 39]) == [11, 33, 7, 2, 39, 10, 46, 26, 15]\nassert rotate_list([21, 41, 10, -8, 18]) == [21, 41, 10, -8, 18]\nassert rotate_list([]) == []", "answer": "def rotate_list(arr):\n if not arr:\n return []\n k = 5 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 5 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 5 % len(arr)\n return ____\n```\nمثال: `rotate_list([10, 18, 33, 12, 45, 44, 36])` يجب أن تُرجع `[33, 12, 45, 44, 36, 10, 18]`.\nالجواب:", "qhash": "5b451ae5d4183fb3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 20) == 1)", "tests": ["assert coprime_count(90) == 36", "assert coprime_count(96) == 38", "assert coprime_count(175) == 70", "assert coprime_count(47) == 19", "assert coprime_count(148) == 59", "assert coprime_count(160) == 64", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(90) == 36\nassert coprime_count(96) == 38\nassert coprime_count(175) == 70\nassert coprime_count(47) == 19\nassert coprime_count(148) == 59\nassert coprime_count(160) == 64\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, 20) == 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, 20) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 20، أي أن القاسم المشترك الأكبر لها مع 20 يساوي 1.\nمثال: `coprime_count(90)` يجب أن تُرجع `36`.\nالجواب:", "qhash": "147d3998d50043af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('vector coffee garden music we') == 'we-music-garden-coffee-vector'", "assert backwards('cloud stone banana to') == 'to-banana-stone-cloud'", "assert backwards('camel by winter vector orange') == 'orange-vector-winter-by-camel'", "assert backwards('') == ''", "assert backwards('is window summer music cloud') == 'cloud-music-summer-window-is'", "assert backwards('') == ''", "assert backwards('vector apple of it rocket apple matrix winter') == 'winter-matrix-apple-rocket-it-of-apple-vector'"], "test_code": "assert backwards('vector coffee garden music we') == 'we-music-garden-coffee-vector'\nassert backwards('cloud stone banana to') == 'to-banana-stone-cloud'\nassert backwards('camel by winter vector orange') == 'orange-vector-winter-by-camel'\nassert backwards('') == ''\nassert backwards('is window summer music cloud') == 'cloud-music-summer-window-is'\nassert backwards('') == ''\nassert backwards('vector apple of it rocket apple matrix winter') == 'winter-matrix-apple-rocket-it-of-apple-vector'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `backwards('vector coffee garden music we')` يُرجع `'we-music-garden-coffee-vector'`.\nالجواب:", "qhash": "65c7bfa1b6a28af0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 87) == 1)", "tests": ["assert phi_upto(142) == 92", "assert phi_upto(109) == 71", "assert phi_upto(76) == 49", "assert phi_upto(13) == 9", "assert phi_upto(43) == 28", "assert phi_upto(192) == 124", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(142) == 92\nassert phi_upto(109) == 71\nassert phi_upto(76) == 49\nassert phi_upto(13) == 9\nassert phi_upto(43) == 28\nassert phi_upto(192) == 124\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, 87) == 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, 87) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 87، أي أن القاسم المشترك الأكبر لها مع 87 يساوي 1.\nمثال: `phi_upto(142)` يجب أن تُرجع `92`.\nالجواب:", "qhash": "f046806a19787cb5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'شجرة'\nprint(w[-1])\nprint(w.find('ب'))\nprint(len(w.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'شجرة'\nprint(w[-1])\nprint(w.find('ب'))\nprint(len(w.replace(' ', '')))\n```\nالجواب:", "qhash": "1711d1d3c7a695c1", "answer": "ة\n-1\n4", "completion": " الناتج:\n```text\nة\n-1\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'light'\nprint(word[-4:])\nprint(word[::-1])\nprint(word[0:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'light'\nprint(word[-4:])\nprint(word[::-1])\nprint(word[0:4])\n```\nالجواب:", "qhash": "e0795088b3d5ee17", "answer": "ight\nthgil\nligh", "completion": " الناتج:\n```text\night\nthgil\nligh\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 4)", "tests": ["assert pick_between([13, 12, 3, -14, 11, 13]) == [-6, 28]", "assert pick_between([4, -23, -5, 1, -29, 45, 9]) == [-8, -2, 10]", "assert pick_between([52, 28]) == []", "assert pick_between([-25, 40, 14, 46, 41, 35, 27, 14]) == []", "assert pick_between([37, 36, 52, 1]) == [-2]", "assert pick_between([-5, 52, 37]) == [10]", "assert pick_between([16, 28, -1, 50]) == [2]", "assert pick_between([]) == []"], "test_code": "assert pick_between([13, 12, 3, -14, 11, 13]) == [-6, 28]\nassert pick_between([4, -23, -5, 1, -29, 45, 9]) == [-8, -2, 10]\nassert pick_between([52, 28]) == []\nassert pick_between([-25, 40, 14, 46, 41, 35, 27, 14]) == []\nassert pick_between([37, 36, 52, 1]) == [-2]\nassert pick_between([-5, 52, 37]) == [10]\nassert pick_between([16, 28, -1, 50]) == [2]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 4)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -16 و4 (شاملًا الطرفين) في -2.\nمثال: `pick_between([13, 12, 3, -14, 11, 13])` يجب أن تُرجع `[-6, 28]`.\nالجواب:", "qhash": "e0c688a85ab16b00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 1 + 0 for x in range(-6, 4) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 1 + 0 for x in range(-6, 4) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "003cea375dd52df5", "answer": "[-6, -3, 0, 3]\n4 -6", "completion": " الناتج:\n```text\n[-6, -3, 0, 3]\n4 -6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return -4 * x ** 2 + (7) * x + (-6)", "tests": ["assert poly(10) == -336", "assert poly(-16) == -1142", "assert poly(-2) == -36", "assert poly(-20) == -1746", "assert poly(18) == -1176", "assert poly(-6) == -192", "assert poly(15) == -801", "assert poly(0) == -6"], "test_code": "assert poly(10) == -336\nassert poly(-16) == -1142\nassert poly(-2) == -36\nassert poly(-20) == -1746\nassert poly(18) == -1176\nassert poly(-6) == -192\nassert poly(15) == -801\nassert poly(0) == -6", "answer": "def poly(x):\n return -4 * x ** 2 + (7) * x + (-6)", "completion": " ```python\ndef poly(x):\n return -4 * x ** 2 + (7) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار -4x² + 7x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(10)` يُرجع `-336`.\nالجواب:", "qhash": "e242942400b57858"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'do'}", "tests": ["assert char_freq('orange coffee data table music rocket') == {'d': 1, 'o': 3}", "assert char_freq('matrix stone music planet python') == {'d': 0, 'o': 2}", "assert char_freq('signal table river pixel rocket signal') == {'d': 0, 'o': 1}", "assert char_freq('go summer') == {'d': 0, 'o': 1}", "assert char_freq('winter code winter brain up brain') == {'d': 1, 'o': 1}", "assert char_freq('garden engine matrix a in light') == {'d': 1, 'o': 0}", "assert char_freq('') == {'d': 0, 'o': 0}"], "test_code": "assert char_freq('orange coffee data table music rocket') == {'d': 1, 'o': 3}\nassert char_freq('matrix stone music planet python') == {'d': 0, 'o': 2}\nassert char_freq('signal table river pixel rocket signal') == {'d': 0, 'o': 1}\nassert char_freq('go summer') == {'d': 0, 'o': 1}\nassert char_freq('winter code winter brain up brain') == {'d': 1, 'o': 1}\nassert char_freq('garden engine matrix a in light') == {'d': 1, 'o': 0}\nassert char_freq('') == {'d': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'do'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'do'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('orange coffee data table music rocket')` يجب أن تُرجع `{'d': 1, 'o': 3}`.\nالجواب:", "qhash": "231885a806c5e891"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 14\nfor j in range(2, 20, 1):\n result -= j * 1\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 14\nfor j in range(2, 20, 1):\n result -= j * 1\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "f047f067da0ee510", "answer": "-175\n19", "completion": " الناتج:\n```text\n-175\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('coffee river by of 2024') == 'xjaazz mdqzm wt ja 2024'", "assert caesar('signal desert river orange') == 'ndbivg yznzmo mdqzm jmvibz'", "assert caesar('orange winter a rocket') == 'jmvibz rdiozm v mjxfzo'", "assert caesar('banana orange by pixel A1') == 'wviviv jmvibz wt kdszg A1'", "assert caesar('light') == 'gdbco'", "assert caesar('vector winter on') == 'qzxojm rdiozm ji'", "assert caesar('') == ''"], "test_code": "assert caesar('coffee river by of 2024') == 'xjaazz mdqzm wt ja 2024'\nassert caesar('signal desert river orange') == 'ndbivg yznzmo mdqzm jmvibz'\nassert caesar('orange winter a rocket') == 'jmvibz rdiozm v mjxfzo'\nassert caesar('banana orange by pixel A1') == 'wviviv jmvibz wt kdszg A1'\nassert caesar('light') == 'gdbco'\nassert caesar('vector winter on') == 'qzxojm rdiozm ji'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('coffee river by of 2024')` يُرجع `'xjaazz mdqzm wt ja 2024'`.\nالجواب:", "qhash": "d0b299144bf46eb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(164374582))\nprint(go(go(164374582)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(164374582))\nprint(go(go(164374582)))\n```\nالجواب:", "qhash": "05d77e68867e7d94", "answer": "40\n4", "completion": " الناتج:\n```text\n40\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert cycle([26, 17, 17, 17, 33, 20, 21]) == [17, 17, 17, 33, 20, 21, 26]", "assert cycle([-1, 2, 45, 21, 37, 0, 4, 29, 27, 42, 48]) == [45, 21, 37, 0, 4, 29, 27, 42, 48, -1, 2]", "assert cycle([27, 33, 36, -6, 40, 15, 24]) == [33, 36, -6, 40, 15, 24, 27]", "assert cycle([-8, 34, 50, 40, 30, 29, 29, 40, 26, 19, 33]) == [50, 40, 30, 29, 29, 40, 26, 19, 33, -8, 34]", "assert cycle([48, 37, 44]) == [37, 44, 48]", "assert cycle([11, 49, 9, 22, -9, 2, 36, 39, 41]) == [39, 41, 11, 49, 9, 22, -9, 2, 36]", "assert cycle([]) == []"], "test_code": "assert cycle([26, 17, 17, 17, 33, 20, 21]) == [17, 17, 17, 33, 20, 21, 26]\nassert cycle([-1, 2, 45, 21, 37, 0, 4, 29, 27, 42, 48]) == [45, 21, 37, 0, 4, 29, 27, 42, 48, -1, 2]\nassert cycle([27, 33, 36, -6, 40, 15, 24]) == [33, 36, -6, 40, 15, 24, 27]\nassert cycle([-8, 34, 50, 40, 30, 29, 29, 40, 26, 19, 33]) == [50, 40, 30, 29, 29, 40, 26, 19, 33, -8, 34]\nassert cycle([48, 37, 44]) == [37, 44, 48]\nassert cycle([11, 49, 9, 22, -9, 2, 36, 39, 41]) == [39, 41, 11, 49, 9, 22, -9, 2, 36]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([26, 17, 17, 17, 33, 20, 21])` يُرجع `[17, 17, 17, 33, 20, 21, 26]`.\nالجواب:", "qhash": "f4ac8f5599f5ec3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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 count_sel([54, 57, 47, 89, 41, 13, 42, 65]) == 1", "assert count_sel([]) == 0", "assert count_sel([-16, 1]) == 0", "assert count_sel([-1, 68, -15, 49, 50, 52, 22, 29, 85, 17, 49]) == 0", "assert count_sel([56, 18, -19, 67, 14]) == 1", "assert count_sel([28, 76, 35, 86]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([54, 57, 47, 89, 41, 13, 42, 65]) == 1\nassert count_sel([]) == 0\nassert count_sel([-16, 1]) == 0\nassert count_sel([-1, 68, -15, 49, 50, 52, 22, 29, 85, 17, 49]) == 0\nassert count_sel([56, 18, -19, 67, 14]) == 1\nassert count_sel([28, 76, 35, 86]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(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 count_sel(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 count_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_sel([54, 57, 47, 89, 41, 13, 42, 65])` يُرجع `1`.\nالجواب:", "qhash": "ab05f4f3a1141445"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 149\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 = 149\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": "b0af6dc17b60754f", "answer": "23", "completion": " الناتج:\n```text\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['cloud', 'pixel', 'falcon', 'brain', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['cloud', 'pixel', 'falcon', 'brain', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "8cd0bb912c905a9a", "answer": "['cloud', 'pixel', 'brain', 'falcon', 'planet']\n['planet', 'falcon', 'pixel']", "completion": " الناتج:\n```text\n['cloud', 'pixel', 'brain', 'falcon', 'planet']\n['planet', 'falcon', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(47766695))\nprint(calc(calc(47766695)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(47766695))\nprint(calc(calc(47766695)))\n```\nالجواب:", "qhash": "3c22cf9653b54ed8", "answer": "50\n5", "completion": " الناتج:\n```text\n50\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('نهار ليل رمل ليل') == 2", "assert count_start('برمجة سلام باب لغة باب ميناء') == 1", "assert count_start('لغة ليل سماء خبز سلام صديق لغة ميناء') == 3", "assert count_start('مدرسة نهر قهوة مدينة') == 0", "assert count_start('سفينة وردة ميناء مدرسة') == 0", "assert count_start('صديق صحراء تفاحة جبل') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('نهار ليل رمل ليل') == 2\nassert count_start('برمجة سلام باب لغة باب ميناء') == 1\nassert count_start('لغة ليل سماء خبز سلام صديق لغة ميناء') == 3\nassert count_start('مدرسة نهر قهوة مدينة') == 0\nassert count_start('سفينة وردة ميناء مدرسة') == 0\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.split():\n if w.endswith('ل'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ل». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_start(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ل'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('نهار ليل رمل ليل')` يُرجع `2`.\nالجواب:", "qhash": "67b28c22c508c9e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 19\nfor i in range(7, 19, 3):\n acc += i * 4\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 19\nfor i in range(7, 19, 3):\n acc += i * 4\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "583e13a74e6c18dc", "answer": "203\n16", "completion": " الناتج:\n```text\n203\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_special([36, 59, 3, 37, 78, 7]) == 2", "assert count_special([43]) == 0", "assert count_special([61, 85, 48]) == 1", "assert count_special([0, 46, 61, 41, 3, 78, 82, 85, 66, 82, 69]) == 2", "assert count_special([40, -34, 35, -8, 25, 87]) == 0", "assert count_special([-6]) == 1", "assert count_special([]) == 0"], "test_code": "assert count_special([36, 59, 3, 37, 78, 7]) == 2\nassert count_special([43]) == 0\nassert count_special([61, 85, 48]) == 1\nassert count_special([0, 46, 61, 41, 3, 78, 82, 85, 66, 82, 69]) == 2\nassert count_special([40, -34, 35, -8, 25, 87]) == 0\nassert count_special([-6]) == 1\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([36, 59, 3, 37, 78, 7])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "3024c91f84c7f135"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "begin_count", "reference": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ح'):\n count += 1\n return count", "tests": ["assert begin_count('قلم مطر حديقة باب حصان حصان') == 3", "assert begin_count('جمل جمل حديقة صديق ليل حاسوب برمجة') == 2", "assert begin_count('نور ماء') == 0", "assert begin_count('شجرة تفاحة حصان') == 1", "assert begin_count('حاسوب طالب') == 1", "assert begin_count('سيارة خبز باب حصان مدرسة حصان معلم رمل') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('قلم مطر حديقة باب حصان حصان') == 3\nassert begin_count('جمل جمل حديقة صديق ليل حاسوب برمجة') == 2\nassert begin_count('نور ماء') == 0\nassert begin_count('شجرة تفاحة حصان') == 1\nassert begin_count('حاسوب طالب') == 1\nassert begin_count('سيارة خبز باب حصان مدرسة حصان معلم رمل') == 2\nassert begin_count('') == 0", "answer": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ح'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(text):\n count = 0\n for w in text:\n if w.startswith('ح'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('قلم مطر حديقة باب حصان حصان')` يُرجع `3`.\nالجواب:", "qhash": "e47752a9c3b4f695"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'هدى': 27, 'يوسف': 42, 'ليلى': 18, 'زينب': 15, 'رنا': 48}\npoints['يوسف'] += 10\npoints['سلمى'] = 54\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('فيصل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'هدى': 27, 'يوسف': 42, 'ليلى': 18, 'زينب': 15, 'رنا': 48}\npoints['يوسف'] += 10\npoints['سلمى'] = 54\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('فيصل', -1))\n```\nالجواب:", "qhash": "a07e205fc261f963", "answer": "6\nسلمى\n214\n-1", "completion": " الناتج:\n```text\n6\nسلمى\n214\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(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_matching([81, 74, 37, 28, 69, 71, 82]) == 0", "assert count_matching([-6, 75, -25, -21]) == 0", "assert count_matching([36, -22, 61, 89, 61, 51, -33, 85, -28, 88, -8]) == 3", "assert count_matching([40, 22, 58, -12, 17, 79]) == 2", "assert count_matching([-12, 26, 49, 7, -37, 81, 1, 87, -8, 5, -21, -38]) == 2", "assert count_matching([8]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([81, 74, 37, 28, 69, 71, 82]) == 0\nassert count_matching([-6, 75, -25, -21]) == 0\nassert count_matching([36, -22, 61, 89, 61, 51, -33, 85, -28, 88, -8]) == 3\nassert count_matching([40, 22, 58, -12, 17, 79]) == 2\nassert count_matching([-12, 26, 49, 7, -37, 81, 1, 87, -8, 5, -21, -38]) == 2\nassert count_matching([8]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(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_matching(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_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_matching([81, 74, 37, 28, 69, 71, 82])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "6696f391da988520"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -9 * x ** 2 + (3) * x + (0)", "tests": ["assert quad(4) == -132", "assert quad(-2) == -42", "assert quad(8) == -552", "assert quad(4) == -132", "assert quad(6) == -306", "assert quad(-13) == -1560", "assert quad(0) == 0", "assert quad(0) == 0"], "test_code": "assert quad(4) == -132\nassert quad(-2) == -42\nassert quad(8) == -552\nassert quad(4) == -132\nassert quad(6) == -306\nassert quad(-13) == -1560\nassert quad(0) == 0\nassert quad(0) == 0", "answer": "def quad(x):\n return -9 * x ** 2 + (3) * x + (0)", "completion": " ```python\ndef quad(x):\n return -9 * x ** 2 + (3) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -9x² + 3x + 0 عند العدد الصحيح x.\nمثال: `quad(4)` يجب أن تُرجع `-132`.\nالجواب:", "qhash": "3c15b27a6207f015"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_div([16, 62, 84, 56, 22, 30]) == 0", "assert count_div([2, -9, -5]) == 1", "assert count_div([32, 42, 82]) == 0", "assert count_div([57, 5, 43, 77, 1, 90, 47]) == 0", "assert count_div([46, 2, 84, 66, 35, 43, -21]) == 0", "assert count_div([-21, 38, 79, 27, 35, 31, -33, 18, 56, -3]) == 2", "assert count_div([]) == 0"], "test_code": "assert count_div([16, 62, 84, 56, 22, 30]) == 0\nassert count_div([2, -9, -5]) == 1\nassert count_div([32, 42, 82]) == 0\nassert count_div([57, 5, 43, 77, 1, 90, 47]) == 0\nassert count_div([46, 2, 84, 66, 35, 43, -21]) == 0\nassert count_div([-21, 38, 79, 27, 35, 31, -33, 18, 56, -3]) == 2\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([16, 62, 84, 56, 22, 30])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "45f6bea91628c523"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 318\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 = 318\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": "3d77dec2bdc658d4", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 43", "tests": ["assert rec_prod(6) == 18", "assert rec_prod(9) == 33", "assert rec_prod(60) == 28", "assert rec_prod(54) == 33", "assert rec_prod(55) == 0", "assert rec_prod(0) == 1", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 18\nassert rec_prod(9) == 33\nassert rec_prod(60) == 28\nassert rec_prod(54) == 33\nassert rec_prod(55) == 0\nassert rec_prod(0) == 1\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 43", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(6)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "ee510d21c32c3fe1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('music light in 2024') == 'ksqga jgefr gl 2024'", "assert shift_text('summer vector garden') == 'qskkcp tcarmp eypbcl'", "assert shift_text('pixel pixel of') == 'ngvcj ngvcj md'", "assert shift_text('go !') == 'em !'", "assert shift_text('orange brain we music in') == 'mpylec zpygl uc ksqga gl'", "assert shift_text('window by window camel') == 'uglbmu zw uglbmu aykcj'", "assert shift_text('') == ''"], "test_code": "assert shift_text('music light in 2024') == 'ksqga jgefr gl 2024'\nassert shift_text('summer vector garden') == 'qskkcp tcarmp eypbcl'\nassert shift_text('pixel pixel of') == 'ngvcj ngvcj md'\nassert shift_text('go !') == 'em !'\nassert shift_text('orange brain we music in') == 'mpylec zpygl uc ksqga gl'\nassert shift_text('window by window camel') == 'uglbmu zw uglbmu aykcj'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('music light in 2024')` يُرجع `'ksqga jgefr gl 2024'`.\nالجواب:", "qhash": "7bcf95ddb99c7c78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('صحراء سفينة') == 0", "assert prefix_hits('حاسوب تفاحة مدينة لغة مكتبة') == 1", "assert prefix_hits('مدرسة باب حاسوب سفينة ليل خبز') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حديقة جبل عمل نهر برمجة') == 1\nassert prefix_hits('سماء حاسوب سلام لغة رمل حصان عربية') == 2\nassert prefix_hits('مدينة خبز حديقة حديقة ميناء معلم سيارة كتاب') == 2\nassert prefix_hits('صحراء سفينة') == 0\nassert prefix_hits('حاسوب تفاحة مدينة لغة مكتبة') == 1\nassert prefix_hits('مدرسة باب حاسوب سفينة ليل خبز') == 1\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": "c684e4b897e34888"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('م')", "tests": ["assert count_ar('لغة معلم تفاحة علم برمجة عربية') == 4", "assert count_ar('مطر') == 1", "assert count_ar('مدينة تفاحة مدينة شمس خبز قهوة علم') == 4", "assert count_ar('رمل') == 1", "assert count_ar('عمل برتقال حاسوب برتقال قلم باب جمل') == 3", "assert count_ar('بيت قهوة علم نهر تفاحة حصان سوق') == 1", "assert count_ar('دفتر طالب') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('لغة معلم تفاحة علم برمجة عربية') == 4\nassert count_ar('مطر') == 1\nassert count_ar('مدينة تفاحة مدينة شمس خبز قهوة علم') == 4\nassert count_ar('رمل') == 1\nassert count_ar('عمل برتقال حاسوب برتقال قلم باب جمل') == 3\nassert count_ar('بيت قهوة علم نهر تفاحة حصان سوق') == 1\nassert count_ar('دفتر طالب') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('م')", "completion": " ```python\ndef count_ar(text):\n return text.count('م')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_ar(text)` بحيث تُعيد عدد مرات ظهور الحرف «م» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('لغة معلم تفاحة علم برمجة عربية')` يُرجع `4`.\nالجواب:", "qhash": "3371573e40c69b5f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=7):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(13))\nprint(calc(13, 13))\nprint(calc(calc(13), 13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=7):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(13))\nprint(calc(13, 13))\nprint(calc(calc(13), 13))\n```\nالجواب:", "qhash": "9605c478c6d73ddc", "answer": "6\n26\n19", "completion": " الناتج:\n```text\n6\n26\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "tests": ["assert pow_total(3) == 1078", "assert pow_total(2) == 187", "assert pow_total(8) == 96492", "assert pow_total(2) == 187", "assert pow_total(9) == 168663", "assert pow_total(1) == 11", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 1078\nassert pow_total(2) == 187\nassert pow_total(8) == 96492\nassert pow_total(2) == 187\nassert pow_total(9) == 168663\nassert pow_total(1) == 11\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `pow_total(3)` يُرجع `1078`.\nالجواب:", "qhash": "69584978acda7e2b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -6 * x ** 2 + (-9) * x + (2)", "tests": ["assert quad(6) == -268", "assert quad(-6) == -160", "assert quad(20) == -2578", "assert quad(-3) == -25", "assert quad(-2) == -4", "assert quad(-3) == -25", "assert quad(7) == -355", "assert quad(0) == 2"], "test_code": "assert quad(6) == -268\nassert quad(-6) == -160\nassert quad(20) == -2578\nassert quad(-3) == -25\nassert quad(-2) == -4\nassert quad(-3) == -25\nassert quad(7) == -355\nassert quad(0) == 2", "answer": "def quad(x):\n return -6 * x ** 2 + (-9) * x + (2)", "completion": " ```python\ndef quad(x):\n return -6 * x ** 2 + (-9) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -6x² - 9x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(6)` يُرجع `-268`.\nالجواب:", "qhash": "5ec6e982479bf060"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_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 turn_list([34, 20, 32, 10, 7]) == [34, 20, 32, 10, 7]", "assert turn_list([40, 17, 39]) == [17, 39, 40]", "assert turn_list([39, 23, -2, 49, 1, 28, 1, -3, 21, 50]) == [39, 23, -2, 49, 1, 28, 1, -3, 21, 50]", "assert turn_list([48, -9]) == [48, -9]", "assert turn_list([19, 38, -9, 18, 12, -3, -7, 24, 43, 16]) == [19, 38, -9, 18, 12, -3, -7, 24, 43, 16]", "assert turn_list([35, 16, 41, 50, -5, 24, 20, 21, -3, 20, 25]) == [41, 50, -5, 24, 20, 21, -3, 20, 25, 35, 16]", "assert turn_list([]) == []"], "test_code": "assert turn_list([34, 20, 32, 10, 7]) == [34, 20, 32, 10, 7]\nassert turn_list([40, 17, 39]) == [17, 39, 40]\nassert turn_list([39, 23, -2, 49, 1, 28, 1, -3, 21, 50]) == [39, 23, -2, 49, 1, 28, 1, -3, 21, 50]\nassert turn_list([48, -9]) == [48, -9]\nassert turn_list([19, 38, -9, 18, 12, -3, -7, 24, 43, 16]) == [19, 38, -9, 18, 12, -3, -7, 24, 43, 16]\nassert turn_list([35, 16, 41, 50, -5, 24, 20, 21, -3, 20, 25]) == [41, 50, -5, 24, 20, 21, -3, 20, 25, 35, 16]\nassert turn_list([]) == []", "answer": "def turn_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 turn_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 turn_list(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([34, 20, 32, 10, 7])` يُرجع `[34, 20, 32, 10, 7]`.\nالجواب:", "qhash": "9aa2e49badea4c2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([39, 7, 43, 13, 65, 79]) == 0", "assert count_matching([25, 84, 30, 29]) == 2", "assert count_matching([78, 19, 41]) == 1", "assert count_matching([15, 35, 45, -30, -28, 37, 46]) == 3", "assert count_matching([10, 17, -30, 75, 1, 32, 8, -32]) == 2", "assert count_matching([-4, 60, 47, -9, 52, 8, -28]) == 4", "assert count_matching([]) == 0"], "test_code": "assert count_matching([39, 7, 43, 13, 65, 79]) == 0\nassert count_matching([25, 84, 30, 29]) == 2\nassert count_matching([78, 19, 41]) == 1\nassert count_matching([15, 35, 45, -30, -28, 37, 46]) == 3\nassert count_matching([10, 17, -30, 75, 1, 32, 8, -32]) == 2\nassert count_matching([-4, 60, 47, -9, 52, 8, -28]) == 4\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([39, 7, 43, 13, 65, 79])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "37699c8da6251949"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ف'):\n count += 1\n return count", "tests": ["assert begin_count('مكتبة فجر سماء فجر عمل كتاب صديق') == 2", "assert begin_count('فجر شمس ماء شمس لغة فجر') == 2", "assert begin_count('طالب مدينة فجر فجر') == 2", "assert begin_count('فجر سفينة صديق') == 1", "assert begin_count('سوق فجر فجر سلام قهوة') == 2", "assert begin_count('مدينة سوق بيت نهر ميناء رمل') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('مكتبة فجر سماء فجر عمل كتاب صديق') == 2\nassert begin_count('فجر شمس ماء شمس لغة فجر') == 2\nassert begin_count('طالب مدينة فجر فجر') == 2\nassert begin_count('فجر سفينة صديق') == 1\nassert begin_count('سوق فجر فجر سلام قهوة') == 2\nassert begin_count('مدينة سوق بيت نهر ميناء رمل') == 0\nassert begin_count('') == 0", "answer": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ف'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(text):\n count = 0\n for w in text:\n if w.startswith('ف'):\n count += 1\n return count\n```\nمثال: `begin_count('مكتبة فجر سماء فجر عمل كتاب صديق')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "610fef7960a33a40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('علم سيارة حاسوب برتقال سيارة وردة برمجة') == 1", "assert count_prefix('مطر سماء') == 0", "assert count_prefix('تفاحة نور وردة وردة ميناء عمل') == 2", "assert count_prefix('دفتر سيارة خبز وردة دفتر') == 1", "assert count_prefix('حصان دفتر صحراء وردة وردة عمل ماء عمل') == 2", "assert count_prefix('سوق قلم صديق وردة بحر') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('علم سيارة حاسوب برتقال سيارة وردة برمجة') == 1\nassert count_prefix('مطر سماء') == 0\nassert count_prefix('تفاحة نور وردة وردة ميناء عمل') == 2\nassert count_prefix('دفتر سيارة خبز وردة دفتر') == 1\nassert count_prefix('حصان دفتر صحراء وردة وردة عمل ماء عمل') == 2\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:\n if w.startswith('و'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «و». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_prefix(sentence):\n count = 0\n for w in sentence:\n if w.startswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('علم سيارة حاسوب برتقال سيارة وردة برمجة')` يُرجع `1`.\nالجواب:", "qhash": "0bdf9e5ebc77a814"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([22, -25, 26, -30, 32, 26, 45]) == None", "assert best_multiple([-60, -48, -36]) == -36", "assert best_multiple([1, 13, 25, 37]) == None", "assert best_multiple([1, -26, -21]) == None", "assert best_multiple([50, 5, -48]) == -48", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([22, -25, 26, -30, 32, 26, 45]) == None\nassert best_multiple([-60, -48, -36]) == -36\nassert best_multiple([1, 13, 25, 37]) == None\nassert best_multiple([1, -26, -21]) == None\nassert best_multiple([50, 5, -48]) == -48\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([22, -25, 26, -30, 32, 26, 45])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "0e356307f71b7211"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert spin([49, 2, 46]) == [49, 2, 46]", "assert spin([50, 31, 46]) == [50, 31, 46]", "assert spin([30, 40, 16, 40, 39, 7, 14, -2]) == [39, 7, 14, -2, 30, 40, 16, 40]", "assert spin([-5, 17, 43, 7, -3, 25]) == [-5, 17, 43, 7, -3, 25]", "assert spin([8, 35, 43, 4, 34, 3, 19, -2, 40, 4, 0, -2]) == [8, 35, 43, 4, 34, 3, 19, -2, 40, 4, 0, -2]", "assert spin([-9]) == [-9]", "assert spin([]) == []"], "test_code": "assert spin([49, 2, 46]) == [49, 2, 46]\nassert spin([50, 31, 46]) == [50, 31, 46]\nassert spin([30, 40, 16, 40, 39, 7, 14, -2]) == [39, 7, 14, -2, 30, 40, 16, 40]\nassert spin([-5, 17, 43, 7, -3, 25]) == [-5, 17, 43, 7, -3, 25]\nassert spin([8, 35, 43, 4, 34, 3, 19, -2, 40, 4, 0, -2]) == [8, 35, 43, 4, 34, 3, 19, -2, 40, 4, 0, -2]\nassert spin([-9]) == [-9]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(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 spin(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return ____\n```\nمثال: `spin([49, 2, 46])` يجب أن تُرجع `[49, 2, 46]`.\nالجواب:", "qhash": "7a05ca634d6dcd40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if 0 <= x <= 11)", "tests": ["assert between_times([-4, 4, -10, -3, 18, -4, 4, -3]) == [4, 4]", "assert between_times([2, 14, 20, -8, 44, 43, 52, -11, 27, 23]) == [2]", "assert between_times([7, 57, 31, -7, 17, 46, 24]) == [7]", "assert between_times([11, -15, 32, -20]) == [11]", "assert between_times([8, 19, -7, -19]) == [8]", "assert between_times([-25, 22, -3, -13, -15, 55, 25, -14, 42]) == []", "assert between_times([43, 48, 29, 46, 20, 19, 27, 44]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([-4, 4, -10, -3, 18, -4, 4, -3]) == [4, 4]\nassert between_times([2, 14, 20, -8, 44, 43, 52, -11, 27, 23]) == [2]\nassert between_times([7, 57, 31, -7, 17, 46, 24]) == [7]\nassert between_times([11, -15, 32, -20]) == [11]\nassert between_times([8, 19, -7, -19]) == [8]\nassert between_times([-25, 22, -3, -13, -15, 55, 25, -14, 42]) == []\nassert between_times([43, 48, 29, 46, 20, 19, 27, 44]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if 0 <= x <= 11)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if 0 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 0 ≤ x ≤ 11، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([-4, 4, -10, -3, 18, -4, 4, -3])` يُرجع `[4, 4]`.\nالجواب:", "qhash": "f7c8516730ee23af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'desert'\nprint(text.replace('r', '0'))\nprint(text.count('r'))\nprint(text.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'desert'\nprint(text.replace('r', '0'))\nprint(text.count('r'))\nprint(text.split('_'))\n```\nالجواب:", "qhash": "666636a31e512f69", "answer": "dese0t\n1\n['desert']", "completion": " الناتج:\n```text\ndese0t\n1\n['desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 44643\ncount = 0\nwhile m > 6:\n m = m // 7\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 44643\ncount = 0\nwhile m > 6:\n m = m // 7\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "91b0b3549b5611ce", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'drst'}", "tests": ["assert count_chars('python') == {'d': 0, 'r': 0, 's': 0, 't': 1}", "assert count_chars('data banana matrix it python') == {'d': 1, 'r': 1, 's': 0, 't': 4}", "assert count_chars('go data pixel') == {'d': 1, 'r': 0, 's': 0, 't': 1}", "assert count_chars('camel orange at of') == {'d': 0, 'r': 1, 's': 0, 't': 1}", "assert count_chars('light an an window python') == {'d': 1, 'r': 0, 's': 0, 't': 2}", "assert count_chars('go') == {'d': 0, 'r': 0, 's': 0, 't': 0}", "assert count_chars('') == {'d': 0, 'r': 0, 's': 0, 't': 0}"], "test_code": "assert count_chars('python') == {'d': 0, 'r': 0, 's': 0, 't': 1}\nassert count_chars('data banana matrix it python') == {'d': 1, 'r': 1, 's': 0, 't': 4}\nassert count_chars('go data pixel') == {'d': 1, 'r': 0, 's': 0, 't': 1}\nassert count_chars('camel orange at of') == {'d': 0, 'r': 1, 's': 0, 't': 1}\nassert count_chars('light an an window python') == {'d': 1, 'r': 0, 's': 0, 't': 2}\nassert count_chars('go') == {'d': 0, 'r': 0, 's': 0, 't': 0}\nassert count_chars('') == {'d': 0, 'r': 0, 's': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'drst'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'drst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'r'، 's'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('python')` يُرجع `{'d': 0, 'r': 0, 's': 0, 't': 1}`.\nالجواب:", "qhash": "ae994e3c2180bf51"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('data an python') == 'python/data'", "assert words_reversed('camel camel rocket') == 'rocket/camel/camel'", "assert words_reversed('by garden on of data') == 'data/garden'", "assert words_reversed('at is at') == ''", "assert words_reversed('brain stone cloud') == 'cloud/stone/brain'", "assert words_reversed('apple orange to pixel at desert desert') == 'desert/desert/pixel/orange/apple'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('data an python') == 'python/data'\nassert words_reversed('camel camel rocket') == 'rocket/camel/camel'\nassert words_reversed('by garden on of data') == 'data/garden'\nassert words_reversed('at is at') == ''\nassert words_reversed('brain stone cloud') == 'cloud/stone/brain'\nassert words_reversed('apple orange to pixel at desert desert') == 'desert/desert/pixel/orange/apple'\nassert words_reversed('') == ''", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('data an python')` يُرجع `'python/data'`.\nالجواب:", "qhash": "ac8ce1693d84ca56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'معلم وردة'\nprint(s.find('ع'))\nprint(s[0])\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'معلم وردة'\nprint(s.find('ع'))\nprint(s[0])\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "98326af0054882af", "answer": "1\nم\nمعلم-وردة", "completion": " الناتج:\n```text\n1\nم\nمعلم-وردة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(-5, 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(-5, 2))\n```\nالجواب:", "qhash": "0df245b7dde3ddc5", "answer": "25", "completion": " الناتج:\n```text\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "tests": ["assert digit_score(19357) == 25", "assert digit_score(258978) == 39", "assert digit_score(239510) == 20", "assert digit_score(302013) == 9", "assert digit_score(395053) == 25", "assert digit_score(471556) == 28", "assert digit_score(426175) == 25", "assert digit_score(0) == 0"], "test_code": "assert digit_score(19357) == 25\nassert digit_score(258978) == 39\nassert digit_score(239510) == 20\nassert digit_score(302013) == 9\nassert digit_score(395053) == 25\nassert digit_score(471556) == 28\nassert digit_score(426175) == 25\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 95.\nللتوضيح: الاستدعاء `digit_score(19357)` يُرجع `25`.\nالجواب:", "qhash": "28e89e5252256881"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('up signal it a') == 'ez csqxkv sd k'", "assert shift_text('stone summer planet vector') == 'cdyxo cewwob zvkxod fomdyb'", "assert shift_text('up at orange') == 'ez kd ybkxqo'", "assert shift_text('winter') == 'gsxdob'", "assert shift_text('camel matrix is we to OK') == 'mkwov wkdbsh sc go dy OK'", "assert shift_text('cloud go in go') == 'mvyen qy sx qy'", "assert shift_text('') == ''"], "test_code": "assert shift_text('up signal it a') == 'ez csqxkv sd k'\nassert shift_text('stone summer planet vector') == 'cdyxo cewwob zvkxod fomdyb'\nassert shift_text('up at orange') == 'ez kd ybkxqo'\nassert shift_text('winter') == 'gsxdob'\nassert shift_text('camel matrix is we to OK') == 'mkwov wkdbsh sc go dy OK'\nassert shift_text('cloud go in go') == 'mvyen qy sx qy'\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 + (-16)) % 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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('up signal it a')` يُرجع `'ez csqxkv sd k'`.\nالجواب:", "qhash": "fbfefcb11f895480"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "tests": ["assert sum_terms(7) == 6272", "assert sum_terms(10) == 24200", "assert sum_terms(1) == 8", "assert sum_terms(10) == 24200", "assert sum_terms(15) == 115200", "assert sum_terms(1) == 8", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 6272\nassert sum_terms(10) == 24200\nassert sum_terms(1) == 8\nassert sum_terms(10) == 24200\nassert sum_terms(15) == 115200\nassert sum_terms(1) == 8\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(7)` يُرجع `6272`.\nالجواب:", "qhash": "4116c0c6fd180d83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([10, 5, 9, 21, 21, 20, 13]) == [10, 15, 24, 0, 21, 41, 0]", "assert acc_reset([26, 30]) == [26, 0]", "assert acc_reset([33, 38, 17, 28, 3, 2, 26, 38]) == [33, 0, 17, 0, 3, 5, 31, 0]", "assert acc_reset([27, 2, 40, -4, -9, -6, 27]) == [27, 29, 0, -4, -13, -19, 8]", "assert acc_reset([17, -4]) == [17, 13]", "assert acc_reset([-5]) == [-5]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([10, 5, 9, 21, 21, 20, 13]) == [10, 15, 24, 0, 21, 41, 0]\nassert acc_reset([26, 30]) == [26, 0]\nassert acc_reset([33, 38, 17, 28, 3, 2, 26, 38]) == [33, 0, 17, 0, 3, 5, 31, 0]\nassert acc_reset([27, 2, 40, -4, -9, -6, 27]) == [27, 29, 0, -4, -13, -19, 8]\nassert acc_reset([17, -4]) == [17, 13]\nassert acc_reset([-5]) == [-5]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\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 > 41:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 41 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([10, 5, 9, 21, 21, 20, 13])` يُرجع `[10, 15, 24, 0, 21, 41, 0]`.\nالجواب:", "qhash": "89cf6310a4841af8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 80", "tests": ["assert sum_digit_pow(1261) == 50", "assert sum_digit_pow(380754) == 47", "assert sum_digit_pow(633503) == 30", "assert sum_digit_pow(227249) == 16", "assert sum_digit_pow(27778) == 21", "assert sum_digit_pow(100092) == 42", "assert sum_digit_pow(33315) == 15", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(1261) == 50\nassert sum_digit_pow(380754) == 47\nassert sum_digit_pow(633503) == 30\nassert sum_digit_pow(227249) == 16\nassert sum_digit_pow(27778) == 21\nassert sum_digit_pow(100092) == 42\nassert sum_digit_pow(33315) == 15\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 80", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 80\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 80.\nللتوضيح: الاستدعاء `sum_digit_pow(1261)` يُرجع `50`.\nالجواب:", "qhash": "754589e254c40119"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=9):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(calc(-8))\nprint(calc(-8, 16))\nprint(calc(calc(16), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=9):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(calc(-8))\nprint(calc(-8, 16))\nprint(calc(calc(16), -8))\n```\nالجواب:", "qhash": "4a20c530bcdfa6e6", "answer": "-26\n-40\n-25", "completion": " الناتج:\n```text\n-26\n-40\n-25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([8, 37, 15, 35, 13]) == [35, 13, 8, 37, 15]", "assert rotate_by([18, 45, 31, 8, 25, 23, 40]) == [25, 23, 40, 18, 45, 31, 8]", "assert rotate_by([25, 11, 6, 11, 46, 25, 39, 5, 35]) == [25, 11, 6, 11, 46, 25, 39, 5, 35]", "assert rotate_by([18, 9, 34, 4, 32, -9, 44]) == [32, -9, 44, 18, 9, 34, 4]", "assert rotate_by([39, -4, 36, -2, 8, 8, 10, -2]) == [36, -2, 8, 8, 10, -2, 39, -4]", "assert rotate_by([1, 35, 1, 17, 8]) == [17, 8, 1, 35, 1]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([8, 37, 15, 35, 13]) == [35, 13, 8, 37, 15]\nassert rotate_by([18, 45, 31, 8, 25, 23, 40]) == [25, 23, 40, 18, 45, 31, 8]\nassert rotate_by([25, 11, 6, 11, 46, 25, 39, 5, 35]) == [25, 11, 6, 11, 46, 25, 39, 5, 35]\nassert rotate_by([18, 9, 34, 4, 32, -9, 44]) == [32, -9, 44, 18, 9, 34, 4]\nassert rotate_by([39, -4, 36, -2, 8, 8, 10, -2]) == [36, -2, 8, 8, 10, -2, 39, -4]\nassert rotate_by([1, 35, 1, 17, 8]) == [17, 8, 1, 35, 1]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([8, 37, 15, 35, 13])` يُرجع `[35, 13, 8, 37, 15]`.\nالجواب:", "qhash": "37ba282b13804cf7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('coffee summer is an go planet is') == 'planet summer coffee'", "assert backwards('matrix orange window at desert of') == 'desert window orange matrix'", "assert backwards('music go data python to stone orange rocket') == 'rocket orange python'", "assert backwards('') == ''", "assert backwards('winter music table python brain falcon vector') == 'vector falcon python winter'", "assert backwards('an code to planet pixel python apple') == 'python planet'", "assert backwards('table we camel signal banana') == 'banana signal'"], "test_code": "assert backwards('coffee summer is an go planet is') == 'planet summer coffee'\nassert backwards('matrix orange window at desert of') == 'desert window orange matrix'\nassert backwards('music go data python to stone orange rocket') == 'rocket orange python'\nassert backwards('') == ''\nassert backwards('winter music table python brain falcon vector') == 'vector falcon python winter'\nassert backwards('an code to planet pixel python apple') == 'python planet'\nassert backwards('table we camel signal banana') == 'banana signal'", "answer": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `backwards(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ' '.\nمثال: `backwards('coffee summer is an go planet is')` يجب أن تُرجع `'planet summer coffee'`.\nالجواب:", "qhash": "841d9edfc6077c13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "tests": ["assert total_multiples(158) == 4137", "assert total_multiples(220) == 7884", "assert total_multiples(234) == 9013", "assert total_multiples(159) == 4137", "assert total_multiples(174) == 5134", "assert total_multiples(181) == 5490", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(158) == 4137\nassert total_multiples(220) == 7884\nassert total_multiples(234) == 9013\nassert total_multiples(159) == 4137\nassert total_multiples(174) == 5134\nassert total_multiples(181) == 5490\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 9.\nمثال: `total_multiples(158)` يجب أن تُرجع `4137`.\nالجواب:", "qhash": "e9c8e814a958ea5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('engine summer camel up we Hello') == 'ratvar fhzzre pnzry hc jr Hryyb'", "assert shift_text('falcon window rocket OK') == 'snypba jvaqbj ebpxrg OK'", "assert shift_text('rocket go python python is') == 'ebpxrg tb clguba clguba vf'", "assert shift_text('of window') == 'bs jvaqbj'", "assert shift_text('at window rocket') == 'ng jvaqbj ebpxrg'", "assert shift_text('apple river coffee on OK') == 'nccyr evire pbssrr ba OK'", "assert shift_text('') == ''"], "test_code": "assert shift_text('engine summer camel up we Hello') == 'ratvar fhzzre pnzry hc jr Hryyb'\nassert shift_text('falcon window rocket OK') == 'snypba jvaqbj ebpxrg OK'\nassert shift_text('rocket go python python is') == 'ebpxrg tb clguba clguba vf'\nassert shift_text('of window') == 'bs jvaqbj'\nassert shift_text('at window rocket') == 'ng jvaqbj ebpxrg'\nassert shift_text('apple river coffee on OK') == 'nccyr evire pbssrr ba OK'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('engine summer camel up we Hello')` يجب أن تُرجع `'ratvar fhzzre pnzry hc jr Hryyb'`.\nالجواب:", "qhash": "38a1d218aaef176f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 8) == 1)", "tests": ["assert rel_prime_count(116) == 58", "assert rel_prime_count(154) == 77", "assert rel_prime_count(55) == 28", "assert rel_prime_count(198) == 99", "assert rel_prime_count(148) == 74", "assert rel_prime_count(55) == 28", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(116) == 58\nassert rel_prime_count(154) == 77\nassert rel_prime_count(55) == 28\nassert rel_prime_count(198) == 99\nassert rel_prime_count(148) == 74\nassert rel_prime_count(55) == 28\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, 8) == 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, 8) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 8) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(116)` يُرجع `58`.\nالجواب:", "qhash": "b520291b85a94e10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -6 * x ** 2 + (-7) * x + (0)", "tests": ["assert eval_poly(7) == -343", "assert eval_poly(5) == -185", "assert eval_poly(4) == -124", "assert eval_poly(-7) == -245", "assert eval_poly(-9) == -423", "assert eval_poly(-1) == 1", "assert eval_poly(-5) == -115", "assert eval_poly(0) == 0"], "test_code": "assert eval_poly(7) == -343\nassert eval_poly(5) == -185\nassert eval_poly(4) == -124\nassert eval_poly(-7) == -245\nassert eval_poly(-9) == -423\nassert eval_poly(-1) == 1\nassert eval_poly(-5) == -115\nassert eval_poly(0) == 0", "answer": "def eval_poly(x):\n return -6 * x ** 2 + (-7) * x + (0)", "completion": " ```python\ndef eval_poly(x):\n return -6 * x ** 2 + (-7) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -6x² - 7x + 0 عند العدد الصحيح x.\nمثال: `eval_poly(7)` يجب أن تُرجع `-343`.\nالجواب:", "qhash": "a7e0c91acddfff71"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 9 * x ** 2 + (6) * x + (-1)", "tests": ["assert evaluate(1) == 14", "assert evaluate(-18) == 2807", "assert evaluate(5) == 254", "assert evaluate(18) == 3023", "assert evaluate(8) == 623", "assert evaluate(14) == 1847", "assert evaluate(0) == -1", "assert evaluate(0) == -1"], "test_code": "assert evaluate(1) == 14\nassert evaluate(-18) == 2807\nassert evaluate(5) == 254\nassert evaluate(18) == 3023\nassert evaluate(8) == 623\nassert evaluate(14) == 1847\nassert evaluate(0) == -1\nassert evaluate(0) == -1", "answer": "def evaluate(x):\n return 9 * x ** 2 + (6) * x + (-1)", "completion": " ```python\ndef evaluate(x):\n return 9 * x ** 2 + (6) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 9x² + 6x - 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(1)` يُرجع `14`.\nالجواب:", "qhash": "5d243444b4b95e10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_matching([64, 40, 75, 22, 64, 77, 18, 88]) == 2", "assert count_matching([19, -11, -36, -39, 66, -29, 88, 48, -20]) == 4", "assert count_matching([5, -34, -31, 66, -10, 44, 67]) == 1", "assert count_matching([0, 47, -9, 28, -8, -36, 6, 32, 45, 22, 43]) == 4", "assert count_matching([47, 10, -2, 29, -20, -29, 29]) == 0", "assert count_matching([85, 89, 4, 80, 26, 89, 77, 86]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([64, 40, 75, 22, 64, 77, 18, 88]) == 2\nassert count_matching([19, -11, -36, -39, 66, -29, 88, 48, -20]) == 4\nassert count_matching([5, -34, -31, 66, -10, 44, 67]) == 1\nassert count_matching([0, 47, -9, 28, -8, -36, 6, 32, 45, 22, 43]) == 4\nassert count_matching([47, 10, -2, 29, -20, -29, 29]) == 0\nassert count_matching([85, 89, 4, 80, 26, 89, 77, 86]) == 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 % 7 != 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 % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 7، واكتب الدالة بعد إكمالها.\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([64, 40, 75, 22, 64, 77, 18, 88])` يُرجع `2`.\nالجواب:", "qhash": "869dedfcdb92da26"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(12))\n```\nالجواب:", "qhash": "76b5952feb7e2559", "answer": "144", "completion": " الناتج:\n```text\n144\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([59, 14, 37, 2, 31]) == None", "assert largest_div([-22, -44, -44]) == -22", "assert largest_div([1, 12, 23]) == None", "assert largest_div([]) == None", "assert largest_div([-5, -39, 24]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([59, 14, 37, 2, 31]) == None\nassert largest_div([-22, -44, -44]) == -22\nassert largest_div([1, 12, 23]) == None\nassert largest_div([]) == None\nassert largest_div([-5, -39, 24]) == None\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(arr):\n best = 0\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `largest_div([59, 14, 37, 2, 31])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "8cdc9374401375f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "tests": ["assert pow_total(7) == 232064", "assert pow_total(12) == 5045664", "assert pow_total(4) == 10400", "assert pow_total(8) == 494208", "assert pow_total(4) == 10400", "assert pow_total(1) == 8", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 232064\nassert pow_total(12) == 5045664\nassert pow_total(4) == 10400\nassert pow_total(8) == 494208\nassert pow_total(4) == 10400\nassert pow_total(1) == 8\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * 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 = 8 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × 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 = 8 * i ** 5\n return total\n```\nمثال: `pow_total(7)` يجب أن تُرجع `232064`.\nالجواب:", "qhash": "fe9bf06d6a87145a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67", "tests": ["assert prod_mod(6) == 12", "assert prod_mod(59) == 13", "assert prod_mod(31) == 31", "assert prod_mod(54) == 40", "assert prod_mod(4) == 4", "assert prod_mod(24) == 48", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 12\nassert prod_mod(59) == 13\nassert prod_mod(31) == 31\nassert prod_mod(54) == 40\nassert prod_mod(4) == 4\nassert prod_mod(24) == 48\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(6)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "117b2243ff03689f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total", "tests": ["assert sum_powers(6) == 455", "assert sum_powers(9) == 1425", "assert sum_powers(14) == 5075", "assert sum_powers(11) == 2530", "assert sum_powers(1) == 5", "assert sum_powers(1) == 5", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 455\nassert sum_powers(9) == 1425\nassert sum_powers(14) == 5075\nassert sum_powers(11) == 2530\nassert sum_powers(1) == 5\nassert sum_powers(1) == 5\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `455`.\nالجواب:", "qhash": "f2ce7e35e976df6e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(14))\nprint(calc(14, 13))\nprint(calc(calc(13), 14))", "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(14))\nprint(calc(14, 13))\nprint(calc(calc(13), 14))\n```\nالجواب:", "qhash": "13179cf99e42353c", "answer": "38\n29\n91", "completion": " الناتج:\n```text\n38\n29\n91\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([3, 21, 13, 6, 17]) == None", "assert max_multiple([-11, -44, -55]) == -11", "assert max_multiple([1]) == None", "assert max_multiple([14, 32, 0, -32, 10, -36, -39]) == 0", "assert max_multiple([13, 48, -33, 26, -18, 48]) == -33", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([3, 21, 13, 6, 17]) == None\nassert max_multiple([-11, -44, -55]) == -11\nassert max_multiple([1]) == None\nassert max_multiple([14, 32, 0, -32, 10, -36, -39]) == 0\nassert max_multiple([13, 48, -33, 26, -18, 48]) == -33\nassert max_multiple([]) == None", "answer": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_multiple(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_multiple([3, 21, 13, 6, 17])` يُرجع `None`.\nالجواب:", "qhash": "73476eb59b4ed453"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 2 for x in range(3, 15) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 2 for x in range(3, 15) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "401b58d349a1360c", "answer": "[34, 98, 194]\n3 326", "completion": " الناتج:\n```text\n[34, 98, 194]\n3 326\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 110:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([34, 58, 27, 44, 26, 18, 17, 9]) == [34, 92, 0, 44, 70, 88, 105, 0]", "assert running_sum([11, 72, 15, 89, 17, 42, 107, 37]) == [11, 83, 98, 0, 17, 59, 0, 37]", "assert running_sum([44, -5, 62, 50, 17, 109]) == [44, 39, 101, 0, 17, 0]", "assert running_sum([79, 59]) == [79, 0]", "assert running_sum([55, 110, 53, 84, 27, 76, 106, 51, 72, 27]) == [55, 0, 53, 0, 27, 103, 0, 51, 0, 27]", "assert running_sum([10, 23]) == [10, 33]", "assert running_sum([]) == []"], "test_code": "assert running_sum([34, 58, 27, 44, 26, 18, 17, 9]) == [34, 92, 0, 44, 70, 88, 105, 0]\nassert running_sum([11, 72, 15, 89, 17, 42, 107, 37]) == [11, 83, 98, 0, 17, 59, 0, 37]\nassert running_sum([44, -5, 62, 50, 17, 109]) == [44, 39, 101, 0, 17, 0]\nassert running_sum([79, 59]) == [79, 0]\nassert running_sum([55, 110, 53, 84, 27, 76, 106, 51, 72, 27]) == [55, 0, 53, 0, 27, 103, 0, 51, 0, 27]\nassert running_sum([10, 23]) == [10, 33]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 110:\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 > 110:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 110 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([34, 58, 27, 44, 26, 18, 17, 9])` يُرجع `[34, 92, 0, 44, 70, 88, 105, 0]`.\nالجواب:", "qhash": "c7745e9ed4f68bad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حصان برمجة حصان شمس') == 2", "assert starts_count('نهر سماء حديقة قلم برمجة') == 1", "assert starts_count('تفاحة نور سفينة') == 0", "assert starts_count('خبز شمس تفاحة مدينة') == 0", "assert starts_count('حصان صديق دفتر دفتر ليل') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('قهوة ليل') == 0\nassert starts_count('حصان برمجة حصان شمس') == 2\nassert starts_count('نهر سماء حديقة قلم برمجة') == 1\nassert starts_count('تفاحة نور سفينة') == 0\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 'ح' in w:\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 'ح' in w:\n count += 1\n return count\n```\nمثال: `starts_count('قهوة ليل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "112a57861a25eef2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(11))\n```\nالجواب:", "qhash": "1ab35cc17f0304b8", "answer": "521", "completion": " الناتج:\n```text\n521\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 61) == 1)", "tests": ["assert phi_upto(34) == 34", "assert phi_upto(134) == 132", "assert phi_upto(105) == 104", "assert phi_upto(101) == 100", "assert phi_upto(108) == 107", "assert phi_upto(12) == 12", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(34) == 34\nassert phi_upto(134) == 132\nassert phi_upto(105) == 104\nassert phi_upto(101) == 100\nassert phi_upto(108) == 107\nassert phi_upto(12) == 12\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 61، أي أن القاسم المشترك الأكبر لها مع 61 يساوي 1.\nمثال: `phi_upto(34)` يجب أن تُرجع `34`.\nالجواب:", "qhash": "51ec6c068a8ba4dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([15, 30, 26, 8, 13, 50, 18, 20]) == [30, 26, 8, 13, 50, 18, 20, 15]", "assert spin([31, 42, 29, 27, 31, 44, 7, 20]) == [42, 29, 27, 31, 44, 7, 20, 31]", "assert spin([-1, 15]) == [15, -1]", "assert spin([9, 44, 24, 27, 46, 14, 27, 12]) == [44, 24, 27, 46, 14, 27, 12, 9]", "assert spin([25, -5]) == [-5, 25]", "assert spin([-2, 40, -3, 9, 24, 31, 20, 16, 16, -2, 21]) == [-2, 21, -2, 40, -3, 9, 24, 31, 20, 16, 16]", "assert spin([]) == []"], "test_code": "assert spin([15, 30, 26, 8, 13, 50, 18, 20]) == [30, 26, 8, 13, 50, 18, 20, 15]\nassert spin([31, 42, 29, 27, 31, 44, 7, 20]) == [42, 29, 27, 31, 44, 7, 20, 31]\nassert spin([-1, 15]) == [15, -1]\nassert spin([9, 44, 24, 27, 46, 14, 27, 12]) == [44, 24, 27, 46, 14, 27, 12, 9]\nassert spin([25, -5]) == [-5, 25]\nassert spin([-2, 40, -3, 9, 24, 31, 20, 16, 16, -2, 21]) == [-2, 21, -2, 40, -3, 9, 24, 31, 20, 16, 16]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nمثال: `spin([15, 30, 26, 8, 13, 50, 18, 20])` يجب أن تُرجع `[30, 26, 8, 13, 50, 18, 20, 15]`.\nالجواب:", "qhash": "1f3ea3920519a5e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 47", "tests": ["assert multi_fact(7) == 28", "assert multi_fact(19) == 39", "assert multi_fact(8) == 33", "assert multi_fact(39) == 9", "assert multi_fact(28) == 34", "assert multi_fact(45) == 43", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(7) == 28\nassert multi_fact(19) == 39\nassert multi_fact(8) == 33\nassert multi_fact(39) == 9\nassert multi_fact(28) == 34\nassert multi_fact(45) == 43\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 47", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(7)` يجب أن تُرجع `28`.\nالجواب:", "qhash": "df5f1a20464cf9c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_div([50, 67, 57, 25, 40, 76, 38, 27, 68, 61, 21, 21]) == 0", "assert count_div([-38, 71, 62, 16, -34, 61, -27]) == 0", "assert count_div([22, 15, 30, -22, 86, 20, -33, -27, 17, -40, -31, 42]) == 1", "assert count_div([70, 89, 9, 80, 27, 44, -25]) == 0", "assert count_div([15, 16, -17, 52, 38, 13, 39, 20, -15, -16, 25, 37]) == 0", "assert count_div([6, -40, 87, 55, 15]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([50, 67, 57, 25, 40, 76, 38, 27, 68, 61, 21, 21]) == 0\nassert count_div([-38, 71, 62, 16, -34, 61, -27]) == 0\nassert count_div([22, 15, 30, -22, 86, 20, -33, -27, 17, -40, -31, 42]) == 1\nassert count_div([70, 89, 9, 80, 27, 44, -25]) == 0\nassert count_div([15, 16, -17, 52, 38, 13, 39, 20, -15, -16, 25, 37]) == 0\nassert count_div([6, -40, 87, 55, 15]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([50, 67, 57, 25, 40, 76, 38, 27, 68, 61, 21, 21])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "c79934e133ef4fa1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 15:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([1, 4, 11, 4, 11, 5, 10, 12]) == [1, 5, 0, 4, 15, 0, 10, 0]", "assert acc_reset([]) == []", "assert acc_reset([-7, -3]) == [-7, -10]", "assert acc_reset([-1, 6, -2, -9, 7]) == [-1, 5, 3, -6, 1]", "assert acc_reset([-9, 15, 13, 12, -10]) == [-9, 6, 0, 12, 2]", "assert acc_reset([6, -2, -6, 9, 14, 7, -8, 8, 4, 15]) == [6, 4, -2, 7, 0, 7, -1, 7, 11, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([1, 4, 11, 4, 11, 5, 10, 12]) == [1, 5, 0, 4, 15, 0, 10, 0]\nassert acc_reset([]) == []\nassert acc_reset([-7, -3]) == [-7, -10]\nassert acc_reset([-1, 6, -2, -9, 7]) == [-1, 5, 3, -6, 1]\nassert acc_reset([-9, 15, 13, 12, -10]) == [-9, 6, 0, 12, 2]\nassert acc_reset([6, -2, -6, 9, 14, 7, -8, 8, 4, 15]) == [6, 4, -2, 7, 0, 7, -1, 7, 11, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 15:\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 > 15:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 15 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([1, 4, 11, 4, 11, 5, 10, 12])` يُرجع `[1, 5, 0, 4, 15, 0, 10, 0]`.\nالجواب:", "qhash": "d973d6381d16ece0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'nort'}", "tests": ["assert char_counts('it river') == {'n': 0, 'o': 0, 'r': 2, 't': 1}", "assert char_counts('engine engine coffee') == {'n': 4, 'o': 1, 'r': 0, 't': 0}", "assert char_counts('falcon') == {'n': 1, 'o': 1, 'r': 0, 't': 0}", "assert char_counts('summer music up river') == {'n': 0, 'o': 0, 'r': 3, 't': 0}", "assert char_counts('engine brain') == {'n': 3, 'o': 0, 'r': 1, 't': 0}", "assert char_counts('banana of go') == {'n': 2, 'o': 2, 'r': 0, 't': 0}", "assert char_counts('') == {'n': 0, 'o': 0, 'r': 0, 't': 0}"], "test_code": "assert char_counts('it river') == {'n': 0, 'o': 0, 'r': 2, 't': 1}\nassert char_counts('engine engine coffee') == {'n': 4, 'o': 1, 'r': 0, 't': 0}\nassert char_counts('falcon') == {'n': 1, 'o': 1, 'r': 0, 't': 0}\nassert char_counts('summer music up river') == {'n': 0, 'o': 0, 'r': 3, 't': 0}\nassert char_counts('engine brain') == {'n': 3, 'o': 0, 'r': 1, 't': 0}\nassert char_counts('banana of go') == {'n': 2, 'o': 2, 'r': 0, 't': 0}\nassert char_counts('') == {'n': 0, 'o': 0, 'r': 0, 't': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'nort'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'nort'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'n'، 'o'، 'r'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('it river')` يجب أن تُرجع `{'n': 0, 'o': 0, 'r': 2, 't': 1}`.\nالجواب:", "qhash": "23bc2523bf887c55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-27, 35, 1, -25, 33, 29, 22, 36, 17]) == None", "assert find_max_div([-10, -50, -40]) == -10", "assert find_max_div([1]) == None", "assert find_max_div([13, 15, 3, -28, 6, 14, 6, 37, 5]) == None", "assert find_max_div([-40, -44, -18, 45, 9, -19]) == -40", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-27, 35, 1, -25, 33, 29, 22, 36, 17]) == None\nassert find_max_div([-10, -50, -40]) == -10\nassert find_max_div([1]) == None\nassert find_max_div([13, 15, 3, -28, 6, 14, 6, 37, 5]) == None\nassert find_max_div([-40, -44, -18, 45, 9, -19]) == -40\nassert find_max_div([]) == None", "answer": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 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 % 10 == 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 % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `find_max_div([-27, 35, 1, -25, 33, 29, 22, 36, 17])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "504c43d453395840"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([43, 65, 54, 64, 8, 49, 79, 62, 28]) == 0", "assert tally_div([54, 0, 79, 39, 3, 53, 55, 38, 86]) == 2", "assert tally_div([56, 89, 55]) == 0", "assert tally_div([6, -9]) == 1", "assert tally_div([]) == 0", "assert tally_div([4, 67, 61, -39, 86, 4, -4]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([43, 65, 54, 64, 8, 49, 79, 62, 28]) == 0\nassert tally_div([54, 0, 79, 39, 3, 53, 55, 38, 86]) == 2\nassert tally_div([56, 89, 55]) == 0\nassert tally_div([6, -9]) == 1\nassert tally_div([]) == 0\nassert tally_div([4, 67, 61, -39, 86, 4, -4]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([43, 65, 54, 64, 8, 49, 79, 62, 28])` يُرجع `0`.\nالجواب:", "qhash": "7ddbfb03ce6f2220"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'river_garden'\nprint(text[2:12])\nprint(text.upper())\nprint(text.find('g'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'river_garden'\nprint(text[2:12])\nprint(text.upper())\nprint(text.find('g'))\n```\nالجواب:", "qhash": "a7f671ccd7434b1d", "answer": "ver_garden\nRIVER_GARDEN\n6", "completion": " الناتج:\n```text\nver_garden\nRIVER_GARDEN\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 372\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 = 372\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": "9cc083b589ccbdd6", "answer": "19", "completion": " الناتج:\n```text\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 27)", "tests": ["assert clip_scale([36, 16, 13, 12, 35, 19, 27, 36, 21, 12]) == [12, 12, 13, 16, 19, 21, 27]", "assert clip_scale([26, -24, -21, 9, 46]) == [26]", "assert clip_scale([-23, -8, 14, 45, 18, 33, 14]) == [14, 14, 18]", "assert clip_scale([-15, 12, -25, 46, 43, -28, 42]) == [12]", "assert clip_scale([-30, 41, 24, -22, -10, -13, 32, -29, 15, -5]) == [15, 24]", "assert clip_scale([-30, 55, 51, 4, 7, -3]) == []", "assert clip_scale([-2, 23, 39, 39, 11, -20, 16]) == [11, 16, 23]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([36, 16, 13, 12, 35, 19, 27, 36, 21, 12]) == [12, 12, 13, 16, 19, 21, 27]\nassert clip_scale([26, -24, -21, 9, 46]) == [26]\nassert clip_scale([-23, -8, 14, 45, 18, 33, 14]) == [14, 14, 18]\nassert clip_scale([-15, 12, -25, 46, 43, -28, 42]) == [12]\nassert clip_scale([-30, 41, 24, -22, -10, -13, 32, -29, 15, -5]) == [15, 24]\nassert clip_scale([-30, 55, 51, 4, 7, -3]) == []\nassert clip_scale([-2, 23, 39, 39, 11, -20, 16]) == [11, 16, 23]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 27)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 10 ≤ x ≤ 27، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([36, 16, 13, 12, 35, 19, 27, 36, 21, 12])` يُرجع `[12, 12, 13, 16, 19, 21, 27]`.\nالجواب:", "qhash": "7ad0d2a1145aba1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 9) // 3 for x in range(3, 10) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 9) // 3 for x in range(3, 10) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "069fb83e236ffbf0", "answer": "[4, 5]\n2 9", "completion": " الناتج:\n```text\n[4, 5]\n2 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'خالد': 31, 'منى': 29, 'فيصل': 13}\nmarks['فيصل'] += 20\nmarks['راشد'] = 50\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 = {'خالد': 31, 'منى': 29, 'فيصل': 13}\nmarks['فيصل'] += 20\nmarks['راشد'] = 50\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": "76504295bcd49eaa", "answer": "4\nراشد\n143\n['خالد', 'منى', 'فيصل', 'راشد']", "completion": " الناتج:\n```text\n4\nراشد\n143\n['خالد', 'منى', 'فيصل', 'راشد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(2684119))\nprint(go(go(2684119)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(2684119))\nprint(go(go(2684119)))\n```\nالجواب:", "qhash": "0215a5594a403054", "answer": "31\n4", "completion": " الناتج:\n```text\n31\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "tests": ["assert add_multiples(67) == 669", "assert add_multiples(134) == 2596", "assert add_multiples(160) == 3625", "assert add_multiples(279) == 11064", "assert add_multiples(197) == 5590", "assert add_multiples(80) == 966", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(67) == 669\nassert add_multiples(134) == 2596\nassert add_multiples(160) == 3625\nassert add_multiples(279) == 11064\nassert add_multiples(197) == 5590\nassert add_multiples(80) == 966\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 % 7 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 7.\nمثال: `add_multiples(67)` يجب أن تُرجع `669`.\nالجواب:", "qhash": "d4cd8ccce489399c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'blr'}", "tests": ["assert tally('light data') == {'b': 0, 'l': 1, 'r': 0}", "assert tally('python stone matrix planet falcon window') == {'b': 0, 'l': 2, 'r': 1}", "assert tally('is it matrix by brain at') == {'b': 2, 'l': 0, 'r': 2}", "assert tally('banana engine') == {'b': 1, 'l': 0, 'r': 0}", "assert tally('it we go matrix cloud garden') == {'b': 0, 'l': 1, 'r': 2}", "assert tally('falcon music on rocket go river') == {'b': 0, 'l': 1, 'r': 3}", "assert tally('') == {'b': 0, 'l': 0, 'r': 0}"], "test_code": "assert tally('light data') == {'b': 0, 'l': 1, 'r': 0}\nassert tally('python stone matrix planet falcon window') == {'b': 0, 'l': 2, 'r': 1}\nassert tally('is it matrix by brain at') == {'b': 2, 'l': 0, 'r': 2}\nassert tally('banana engine') == {'b': 1, 'l': 0, 'r': 0}\nassert tally('it we go matrix cloud garden') == {'b': 0, 'l': 1, 'r': 2}\nassert tally('falcon music on rocket go river') == {'b': 0, 'l': 1, 'r': 3}\nassert tally('') == {'b': 0, 'l': 0, 'r': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'blr'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'blr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'l'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('light data')` يجب أن تُرجع `{'b': 0, 'l': 1, 'r': 0}`.\nالجواب:", "qhash": "ab2be2c0db9f165a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([48, 26, 43, 10, 61, 74, 79, 5]) == 1", "assert only_div([47, 4, 63, 1]) == 1", "assert only_div([-34, 71, 11, -11, -22]) == 0", "assert only_div([3, 42, 64, 79, -38, 79, -17, 33, -36]) == 2", "assert only_div([79, 22, -39, 70, 66, 25, 2, -39, 55]) == 0", "assert only_div([70, -5, -5, 5, 51]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([48, 26, 43, 10, 61, 74, 79, 5]) == 1\nassert only_div([47, 4, 63, 1]) == 1\nassert only_div([-34, 71, 11, -11, -22]) == 0\nassert only_div([3, 42, 64, 79, -38, 79, -17, 33, -36]) == 2\nassert only_div([79, 22, -39, 70, 66, 25, 2, -39, 55]) == 0\nassert only_div([70, -5, -5, 5, 51]) == 0\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([48, 26, 43, 10, 61, 74, 79, 5])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "571dbc7dd78a1807"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'apple'\nprint(name.upper())\nprint(name.replace('l', '0'))\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'apple'\nprint(name.upper())\nprint(name.replace('l', '0'))\nprint(name.capitalize())\n```\nالجواب:", "qhash": "a7356aeff54dd732", "answer": "APPLE\napp0e\nApple", "completion": " الناتج:\n```text\nAPPLE\napp0e\nApple\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ن'):\n count += 1\n return count", "tests": ["assert count_prefix('نهار جمل حصان ماء نور تفاحة') == 2", "assert count_prefix('صحراء فجر') == 0", "assert count_prefix('حصان قمر طالب نهر طالب') == 1", "assert count_prefix('ميناء بحر حصان صديق معلم') == 0", "assert count_prefix('صحراء شجرة') == 0", "assert count_prefix('رمل قلم نور') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('نهار جمل حصان ماء نور تفاحة') == 2\nassert count_prefix('صحراء فجر') == 0\nassert count_prefix('حصان قمر طالب نهر طالب') == 1\nassert count_prefix('ميناء بحر حصان صديق معلم') == 0\nassert count_prefix('صحراء شجرة') == 0\nassert count_prefix('رمل قلم نور') == 1\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ن'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s:\n if w.startswith('ن'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('نهار جمل حصان ماء نور تفاحة')` يُرجع `2`.\nالجواب:", "qhash": "40e1ecd3e7243d45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert count_prefix('ميناء امل وردة') == 1", "assert count_prefix('برمجة صحراء بيت كتاب امل امل') == 2", "assert count_prefix('نهار ليل') == 0", "assert count_prefix('طائرة جبل امل قمر حديقة امل جبل قمر') == 2", "assert count_prefix('امل نهر معلم نهار') == 1", "assert count_prefix('شجرة رمل تفاحة صديق') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('ميناء امل وردة') == 1\nassert count_prefix('برمجة صحراء بيت كتاب امل امل') == 2\nassert count_prefix('نهار ليل') == 0\nassert count_prefix('طائرة جبل امل قمر حديقة امل جبل قمر') == 2\nassert count_prefix('امل نهر معلم نهار') == 1\nassert count_prefix('شجرة رمل تفاحة صديق') == 0\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s.split():\n if w.endswith('ا'):\n count += 1\n return count\n```\nمثال: `count_prefix('ميناء امل وردة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "7b81edbe398f6a85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حاسوب ليل نهار') == 1", "assert prefix_hits('حصان جبل صديق نهار ماء معلم') == 1", "assert prefix_hits('عربية حاسوب ليل كتاب ليل نهر') == 1", "assert prefix_hits('سوق نور') == 0", "assert prefix_hits('حديقة حصان سلام عربية عربية جمل وردة') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('نهار ليل صحراء طالب حديقة سماء حديقة') == 2\nassert prefix_hits('حاسوب ليل نهار') == 1\nassert prefix_hits('حصان جبل صديق نهار ماء معلم') == 1\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 'ح' in w:\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 'ح' in w:\n count += 1\n return count\n```\nمثال: `prefix_hits('نهار ليل صحراء طالب حديقة سماء حديقة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "50684b0799a29fb5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 10) // 5 for x in range(0, 8) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 10) // 5 for x in range(0, 8) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "b35e31a4428ce0a0", "answer": "[2, 3]\n2 5", "completion": " الناتج:\n```text\n[2, 3]\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [-2, 19, 21, 8, 4, 17]\nprint(xs[3:6])\nprint(xs[::-2])\nprint(max(xs[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [-2, 19, 21, 8, 4, 17]\nprint(xs[3:6])\nprint(xs[::-2])\nprint(max(xs[3:6]))\n```\nالجواب:", "qhash": "26d316c8ffda3ee7", "answer": "[8, 4, 17]\n[17, 8, 19]\n17", "completion": " الناتج:\n```text\n[8, 4, 17]\n[17, 8, 19]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-23, 37, 46, -7, -17, 46, 43, 47]) == -7", "assert find_max_div([-7, -28, -35]) == -7", "assert find_max_div([1, 8, 15, 22]) == None", "assert find_max_div([-33, 29]) == None", "assert find_max_div([-20, -48, 22, 30]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-23, 37, 46, -7, -17, 46, 43, 47]) == -7\nassert find_max_div([-7, -28, -35]) == -7\nassert find_max_div([1, 8, 15, 22]) == None\nassert find_max_div([-33, 29]) == None\nassert find_max_div([-20, -48, 22, 30]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(nums):\n best = 0\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(nums):\n best = 0\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([-23, 37, 46, -7, -17, 46, 43, 47])` يُرجع `-7`.\nالجواب:", "qhash": "f892a9eb607a86cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 29) == 1)", "tests": ["assert phi_upto(13) == 13", "assert phi_upto(44) == 43", "assert phi_upto(176) == 170", "assert phi_upto(181) == 175", "assert phi_upto(80) == 78", "assert phi_upto(187) == 181", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(13) == 13\nassert phi_upto(44) == 43\nassert phi_upto(176) == 170\nassert phi_upto(181) == 175\nassert phi_upto(80) == 78\nassert phi_upto(187) == 181\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, 29) == 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, 29) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 29، أي أن القاسم المشترك الأكبر لها مع 29 يساوي 1.\nمثال: `phi_upto(13)` يجب أن تُرجع `13`.\nالجواب:", "qhash": "9416f97ece478830"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert rev_join('a an pixel stone') == 'stone|pixel'", "assert rev_join('a') == ''", "assert rev_join('banana') == 'banana'", "assert rev_join('on in') == ''", "assert rev_join('data stone') == 'stone'", "assert rev_join('on we of river of') == 'river'", "assert rev_join('in desert stone rocket at desert') == 'desert|rocket|stone|desert'"], "test_code": "assert rev_join('a an pixel stone') == 'stone|pixel'\nassert rev_join('a') == ''\nassert rev_join('banana') == 'banana'\nassert rev_join('on in') == ''\nassert rev_join('data stone') == 'stone'\nassert rev_join('on we of river of') == 'river'\nassert rev_join('in desert stone rocket at desert') == 'desert|rocket|stone|desert'", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_join('a an pixel stone')` يُرجع `'stone|pixel'`.\nالجواب:", "qhash": "d115bbf9d6c91305"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 98:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([37, 9, 40, 15, 32, 37, 33, 6, 14]) == [37, 46, 86, 0, 32, 69, 0, 6, 20]", "assert cumulative([95, 86, 83]) == [95, 0, 83]", "assert cumulative([82]) == [82]", "assert cumulative([7, -2, 8, -1]) == [7, 5, 13, 12]", "assert cumulative([4, -3, 40, 74, -6, 75, 75, 63, 75, 46]) == [4, 1, 41, 0, -6, 69, 0, 63, 0, 46]", "assert cumulative([17, 25, 47, -3]) == [17, 42, 89, 86]", "assert cumulative([]) == []"], "test_code": "assert cumulative([37, 9, 40, 15, 32, 37, 33, 6, 14]) == [37, 46, 86, 0, 32, 69, 0, 6, 20]\nassert cumulative([95, 86, 83]) == [95, 0, 83]\nassert cumulative([82]) == [82]\nassert cumulative([7, -2, 8, -1]) == [7, 5, 13, 12]\nassert cumulative([4, -3, 40, 74, -6, 75, 75, 63, 75, 46]) == [4, 1, 41, 0, -6, 69, 0, 63, 0, 46]\nassert cumulative([17, 25, 47, -3]) == [17, 42, 89, 86]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 98:\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 > 98:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 98 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([37, 9, 40, 15, 32, 37, 33, 6, 14])` يجب أن تُرجع `[37, 46, 86, 0, 32, 69, 0, 6, 20]`.\nالجواب:", "qhash": "4c6902d49a37955f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('we') == 'nv'", "assert cipher('apple code light') == 'rggcv tfuv czxyk'", "assert cipher('up is it by by A1') == 'lg zj zk sp sp A1'", "assert cipher('rocket banana winter') == 'iftbvk srerer nzekvi'", "assert cipher('river a rocket we of') == 'izmvi r iftbvk nv fw'", "assert cipher('pixel') == 'gzovc'", "assert cipher('') == ''"], "test_code": "assert cipher('we') == 'nv'\nassert cipher('apple code light') == 'rggcv tfuv czxyk'\nassert cipher('up is it by by A1') == 'lg zj zk sp sp A1'\nassert cipher('rocket banana winter') == 'iftbvk srerer nzekvi'\nassert cipher('river a rocket we of') == 'izmvi r iftbvk nv fw'\nassert cipher('pixel') == 'gzovc'\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 + (17)) % 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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('we')` يُرجع `'nv'`.\nالجواب:", "qhash": "283f36e997522988"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'رنا': 22, 'هشام': 47, 'ليلى': 48, 'مريم': 36, 'زينب': 21}\nscores['هشام'] += 8\nscores['علي'] = 8\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 = {'رنا': 22, 'هشام': 47, 'ليلى': 48, 'مريم': 36, 'زينب': 21}\nscores['هشام'] += 8\nscores['علي'] = 8\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": "3d0ede7c34f5fb36", "answer": "6\nهشام\n190\n[('علي', 8), ('زينب', 21)]", "completion": " الناتج:\n```text\n6\nهشام\n190\n[('علي', 8), ('زينب', 21)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(-4, 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(-4, 5))\n```\nالجواب:", "qhash": "c3249ef13283cb52", "answer": "-1024", "completion": " الناتج:\n```text\n-1024\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 3 + -2 for x in range(2, 8) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 3 + -2 for x in range(2, 8) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "be0136657da3dc14", "answer": "[7, 16]\n2 23", "completion": " الناتج:\n```text\n[7, 16]\n2 23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('apple in window') == 'window-in-apple'", "assert rev_join('it signal engine python planet falcon') == 'falcon-planet-python-engine-signal-it'", "assert rev_join('cloud planet at planet') == 'planet-at-planet-cloud'", "assert rev_join('falcon desert desert window') == 'window-desert-desert-falcon'", "assert rev_join('it brain brain banana to desert music desert') == 'desert-music-desert-to-banana-brain-brain-it'", "assert rev_join('summer matrix an it planet vector pixel') == 'pixel-vector-planet-it-an-matrix-summer'", "assert rev_join('brain stone desert engine summer is of') == 'of-is-summer-engine-desert-stone-brain'"], "test_code": "assert rev_join('apple in window') == 'window-in-apple'\nassert rev_join('it signal engine python planet falcon') == 'falcon-planet-python-engine-signal-it'\nassert rev_join('cloud planet at planet') == 'planet-at-planet-cloud'\nassert rev_join('falcon desert desert window') == 'window-desert-desert-falcon'\nassert rev_join('it brain brain banana to desert music desert') == 'desert-music-desert-to-banana-brain-brain-it'\nassert rev_join('summer matrix an it planet vector pixel') == 'pixel-vector-planet-it-an-matrix-summer'\nassert rev_join('brain stone desert engine summer is of') == 'of-is-summer-engine-desert-stone-brain'", "answer": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `rev_join('apple in window')` يُرجع `'window-in-apple'`.\nالجواب:", "qhash": "785402f764bfa665"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total", "tests": ["assert pow_total(7) == 4676", "assert pow_total(7) == 4676", "assert pow_total(8) == 8772", "assert pow_total(1) == 1", "assert pow_total(11) == 39974", "assert pow_total(1) == 1", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 4676\nassert pow_total(7) == 4676\nassert pow_total(8) == 8772\nassert pow_total(1) == 1\nassert pow_total(11) == 39974\nassert pow_total(1) == 1\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total\n```\n", "buggy": "def pow_total(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 pow_total(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `pow_total(7)` يُرجع `4676`.\nالجواب:", "qhash": "d513cb530efd3eee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 53:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([29, 29, 28, 7, 23, 7, 7, 23, 12]) == [29, 0, 28, 35, 0, 7, 14, 37, 49]", "assert acc_reset([40, 25, 12, 6, 19, 52, 38, 35, -9, -3]) == [40, 0, 12, 18, 37, 0, 38, 0, -9, -12]", "assert acc_reset([53, 16, 47, 15, 13, -2, 19, 10, 23]) == [53, 0, 47, 0, 13, 11, 30, 40, 0]", "assert acc_reset([27]) == [27]", "assert acc_reset([47, 41]) == [47, 0]", "assert acc_reset([]) == []", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([29, 29, 28, 7, 23, 7, 7, 23, 12]) == [29, 0, 28, 35, 0, 7, 14, 37, 49]\nassert acc_reset([40, 25, 12, 6, 19, 52, 38, 35, -9, -3]) == [40, 0, 12, 18, 37, 0, 38, 0, -9, -12]\nassert acc_reset([53, 16, 47, 15, 13, -2, 19, 10, 23]) == [53, 0, 47, 0, 13, 11, 30, 40, 0]\nassert acc_reset([27]) == [27]\nassert acc_reset([47, 41]) == [47, 0]\nassert acc_reset([]) == []\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 53:\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 > 53:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 53 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([29, 29, 28, 7, 23, 7, 7, 23, 12])` يجب أن تُرجع `[29, 0, 28, 35, 0, 7, 14, 37, 49]`.\nالجواب:", "qhash": "1c83275f61483f91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 1\nfor x in range(-4, 11, 3):\n total += x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 1\nfor x in range(-4, 11, 3):\n total += x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "ef4c4e4051a5df62", "answer": "91\n8", "completion": " الناتج:\n```text\n91\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 13) == 1)", "tests": ["assert count_gcd1(80) == 74", "assert count_gcd1(98) == 91", "assert count_gcd1(189) == 175", "assert count_gcd1(105) == 97", "assert count_gcd1(155) == 144", "assert count_gcd1(139) == 129", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(80) == 74\nassert count_gcd1(98) == 91\nassert count_gcd1(189) == 175\nassert count_gcd1(105) == 97\nassert count_gcd1(155) == 144\nassert count_gcd1(139) == 129\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, 13) == 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, 13) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 13) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(80)` يُرجع `74`.\nالجواب:", "qhash": "c4542a57c261e779"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=6):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(0))\nprint(compute(0, 17))\nprint(compute(compute(17), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=6):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(0))\nprint(compute(0, 17))\nprint(compute(compute(17), 0))\n```\nالجواب:", "qhash": "338d20f95417a4fe", "answer": "6\n17\n11", "completion": " الناتج:\n```text\n6\n17\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'نور'\nprint(len(text.replace(' ', '')))\nprint(text[::-1])\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'نور'\nprint(len(text.replace(' ', '')))\nprint(text[::-1])\nprint(text[0])\n```\nالجواب:", "qhash": "68ce069cf60a2551", "answer": "3\nرون\nن", "completion": " الناتج:\n```text\n3\nرون\nن\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 2\nfor n in range(2, 23, 1):\n acc -= n * 2\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 2\nfor n in range(2, 23, 1):\n acc -= n * 2\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "19d653e74428db9e", "answer": "-502\n22", "completion": " الناتج:\n```text\n-502\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 112:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([18, 3, 30, 28, 55, 13, 53, 43, 23]) == [18, 21, 51, 79, 0, 13, 66, 109, 0]", "assert reset_sum([56, 16, 32]) == [56, 72, 104]", "assert reset_sum([112, 46, -2, 5, 60, 51, 51, 81, 16, 58]) == [112, 0, -2, 3, 63, 0, 51, 0, 16, 74]", "assert reset_sum([21, 103, 107, 103, -3, 2, 111, 41, 12, 60]) == [21, 0, 107, 0, -3, -1, 110, 0, 12, 72]", "assert reset_sum([42, 83, 43, 40, 10, 33, 111, 62, 67]) == [42, 0, 43, 83, 93, 0, 111, 0, 67]", "assert reset_sum([83, 50, -2, 98, 70, 60, 97, 106, 24, 49]) == [83, 0, -2, 96, 0, 60, 0, 106, 0, 49]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([18, 3, 30, 28, 55, 13, 53, 43, 23]) == [18, 21, 51, 79, 0, 13, 66, 109, 0]\nassert reset_sum([56, 16, 32]) == [56, 72, 104]\nassert reset_sum([112, 46, -2, 5, 60, 51, 51, 81, 16, 58]) == [112, 0, -2, 3, 63, 0, 51, 0, 16, 74]\nassert reset_sum([21, 103, 107, 103, -3, 2, 111, 41, 12, 60]) == [21, 0, 107, 0, -3, -1, 110, 0, 12, 72]\nassert reset_sum([42, 83, 43, 40, 10, 33, 111, 62, 67]) == [42, 0, 43, 83, 93, 0, 111, 0, 67]\nassert reset_sum([83, 50, -2, 98, 70, 60, 97, 106, 24, 49]) == [83, 0, -2, 96, 0, 60, 0, 106, 0, 49]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 112:\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 > 112:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 112 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([18, 3, 30, 28, 55, 13, 53, 43, 23])` يُرجع `[18, 21, 51, 79, 0, 13, 66, 109, 0]`.\nالجواب:", "qhash": "944cbb2b56f7c186"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total", "tests": ["assert sum_terms(3) == 980", "assert sum_terms(5) == 9790", "assert sum_terms(1) == 10", "assert sum_terms(12) == 607100", "assert sum_terms(5) == 9790", "assert sum_terms(1) == 10", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 980\nassert sum_terms(5) == 9790\nassert sum_terms(1) == 10\nassert sum_terms(12) == 607100\nassert sum_terms(5) == 9790\nassert sum_terms(1) == 10\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 10 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(3)` يُرجع `980`.\nالجواب:", "qhash": "733f3a35e2dbcc84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_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 how_many_div([86, 78, 90, 38, 83, 71, 48, 49, 63, 31, 11, 44]) == 2", "assert how_many_div([-4, 76, 3, 43, -40, 82, -24]) == 0", "assert how_many_div([8, 69, 89, 29, -23, 7, -19, -2]) == 0", "assert how_many_div([79, 85, 49, 49, 17, 72, 78, -7, 4, -4]) == 1", "assert how_many_div([]) == 0", "assert how_many_div([58, -39, 32, -34, 44, -29, 25, -34, 11, 17, 9]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([86, 78, 90, 38, 83, 71, 48, 49, 63, 31, 11, 44]) == 2\nassert how_many_div([-4, 76, 3, 43, -40, 82, -24]) == 0\nassert how_many_div([8, 69, 89, 29, -23, 7, -19, -2]) == 0\nassert how_many_div([79, 85, 49, 49, 17, 72, 78, -7, 4, -4]) == 1\nassert how_many_div([]) == 0\nassert how_many_div([58, -39, 32, -34, 44, -29, 25, -34, 11, 17, 9]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_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 how_many_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 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([86, 78, 90, 38, 83, 71, 48, 49, 63, 31, 11, 44])` يُرجع `2`.\nالجواب:", "qhash": "28c216a6e22fdd3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert reverse_words('go data river') == 'river-data'", "assert reverse_words('cloud up code') == 'code-cloud'", "assert reverse_words('summer') == 'summer'", "assert reverse_words('apple winter of rocket summer') == 'summer-rocket-winter-apple'", "assert reverse_words('') == ''", "assert reverse_words('python river falcon vector camel we garden by') == 'garden-camel-vector-falcon-river-python'", "assert reverse_words('vector river coffee desert table') == 'table-desert-coffee-river-vector'"], "test_code": "assert reverse_words('go data river') == 'river-data'\nassert reverse_words('cloud up code') == 'code-cloud'\nassert reverse_words('summer') == 'summer'\nassert reverse_words('apple winter of rocket summer') == 'summer-rocket-winter-apple'\nassert reverse_words('') == ''\nassert reverse_words('python river falcon vector camel we garden by') == 'garden-camel-vector-falcon-river-python'\nassert reverse_words('vector river coffee desert table') == 'table-desert-coffee-river-vector'", "answer": "def reverse_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reverse_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `reverse_words('go data river')` يجب أن تُرجع `'river-data'`.\nالجواب:", "qhash": "d9ccc0bc8a4c96ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة قمر قلم نور فجر مكتبة') == 3", "assert count_prefix('كتاب فجر قلم صديق قلم قلم') == 3", "assert count_prefix('قلم شمس سفينة نهار طالب قهوة') == 2", "assert count_prefix('معلم قلم شمس') == 1", "assert count_prefix('رمل بحر ماء قمر رمل طالب قلم') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('بيت حصان سوق معلم سوق قلم') == 1\nassert count_prefix('قهوة قمر قلم نور فجر مكتبة') == 3\nassert count_prefix('كتاب فجر قلم صديق قلم قلم') == 3\nassert count_prefix('قلم شمس سفينة نهار طالب قهوة') == 2\nassert count_prefix('معلم قلم شمس') == 1\nassert count_prefix('رمل بحر ماء قمر رمل طالب قلم') == 2\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": "25f59e81058ae929"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 37", "tests": ["assert digit_power(36393) == 33", "assert digit_power(186242) == 14", "assert digit_power(117994) == 7", "assert digit_power(372982) == 26", "assert digit_power(487817) == 21", "assert digit_power(996061) == 13", "assert digit_power(804823) == 9", "assert digit_power(0) == 0"], "test_code": "assert digit_power(36393) == 33\nassert digit_power(186242) == 14\nassert digit_power(117994) == 7\nassert digit_power(372982) == 26\nassert digit_power(487817) == 21\nassert digit_power(996061) == 13\nassert digit_power(804823) == 9\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 37", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 37.\nللتوضيح: الاستدعاء `digit_power(36393)` يُرجع `33`.\nالجواب:", "qhash": "d7ebd66cdc34b9ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [-2, -5, 27, 6, -1, 33, -4, 23, 23]\nprint(lst[2:5])\nprint(lst[::3])\nprint(sum(lst[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [-2, -5, 27, 6, -1, 33, -4, 23, 23]\nprint(lst[2:5])\nprint(lst[::3])\nprint(sum(lst[2:5]))\n```\nالجواب:", "qhash": "e9a2c79847c69e18", "answer": "[27, 6, -1]\n[-2, 6, -4]\n32", "completion": " الناتج:\n```text\n[27, 6, -1]\n[-2, 6, -4]\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19']", "assert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17']", "assert fizz(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19', 'Yo', 'Hi', '22', '23']", "assert fizz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']", "assert fizz(2) == ['1', '2']"], "test_code": "assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19']\nassert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17']\nassert fizz(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19', 'Yo', 'Hi', '22', '23']\nassert fizz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']\nassert fizz(2) == ['1', '2']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Hi'، وعلى 10 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(19)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19']`.\nالجواب:", "qhash": "f97ff7cbf916dd78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -2 <= x <= 28)", "tests": ["assert clip_scale([-9, -10, -7, 11]) == [22]", "assert clip_scale([25, 33, 22, -14, 36, 26, -7]) == [44, 50, 52]", "assert clip_scale([16, 14, 41, 3, -6, 41, -30, -8, 49, 21]) == [6, 28, 32, 42]", "assert clip_scale([-25]) == []", "assert clip_scale([1]) == [2]", "assert clip_scale([57, -25, 31, 45, 8, 34, 21]) == [16, 42]", "assert clip_scale([60, 28, 38, 5, 36, 3, -25]) == [6, 10, 56]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-9, -10, -7, 11]) == [22]\nassert clip_scale([25, 33, 22, -14, 36, 26, -7]) == [44, 50, 52]\nassert clip_scale([16, 14, 41, 3, -6, 41, -30, -8, 49, 21]) == [6, 28, 32, 42]\nassert clip_scale([-25]) == []\nassert clip_scale([1]) == [2]\nassert clip_scale([57, -25, 31, 45, 8, 34, 21]) == [16, 42]\nassert clip_scale([60, 28, 38, 5, 36, 3, -25]) == [6, 10, 56]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -2 <= x <= 28)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if -2 <= x <= 28)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق -2 ≤ x ≤ 28، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([-9, -10, -7, 11])` يُرجع `[22]`.\nالجواب:", "qhash": "19915ee087da29f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "tests": ["assert sum_terms(8) == 1224", "assert sum_terms(6) == 546", "assert sum_terms(5) == 330", "assert sum_terms(2) == 30", "assert sum_terms(9) == 1710", "assert sum_terms(1) == 6", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(8) == 1224\nassert sum_terms(6) == 546\nassert sum_terms(5) == 330\nassert sum_terms(2) == 30\nassert sum_terms(9) == 1710\nassert sum_terms(1) == 6\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 2\n return total\n```\nمثال: `sum_terms(8)` يجب أن تُرجع `1224`.\nالجواب:", "qhash": "9a2f7135bc00273f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * -1 + -3 for x in range(1, 16) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * -1 + -3 for x in range(1, 16) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "035645a0890341f0", "answer": "[-6, -9, -12, -15, -18]\n5 -60", "completion": " الناتج:\n```text\n[-6, -9, -12, -15, -18]\n5 -60\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 4 * x ** 2 + (-5) * x + (4)", "tests": ["assert poly(1) == 3", "assert poly(15) == 829", "assert poly(-2) == 30", "assert poly(10) == 354", "assert poly(17) == 1075", "assert poly(8) == 220", "assert poly(-4) == 88", "assert poly(0) == 4"], "test_code": "assert poly(1) == 3\nassert poly(15) == 829\nassert poly(-2) == 30\nassert poly(10) == 354\nassert poly(17) == 1075\nassert poly(8) == 220\nassert poly(-4) == 88\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)` تُرجع قيمة كثيرة الحدود 4x² - 5x + 4 عند العدد الصحيح x.\nمثال: `poly(1)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "4e7426d642abb0d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(16))\nprint(h(16, 1))\nprint(h(h(1), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(16))\nprint(h(16, 1))\nprint(h(h(1), 16))\n```\nالجواب:", "qhash": "87a8f97435d512e3", "answer": "137\n143\n560", "completion": " الناتج:\n```text\n137\n143\n560\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 5) == 1)", "tests": ["assert count_coprime(76) == 61", "assert count_coprime(20) == 16", "assert count_coprime(126) == 101", "assert count_coprime(69) == 56", "assert count_coprime(40) == 32", "assert count_coprime(152) == 122", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(76) == 61\nassert count_coprime(20) == 16\nassert count_coprime(126) == 101\nassert count_coprime(69) == 56\nassert count_coprime(40) == 32\nassert count_coprime(152) == 122\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, 5) == 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, 5) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 5) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(76)` يُرجع `61`.\nالجواب:", "qhash": "f3ec0805d2434985"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('apple of planet planet') == 'hwwsl vm wshula wshula'", "assert encode('stone to at pixel matrix 2024') == 'zavul av ha wpels thaype 2024'", "assert encode('garden') == 'nhyklu'", "assert encode('window OK') == 'dpukvd OK'", "assert encode('rocket brain planet coffee cloud') == 'yvjrla iyhpu wshula jvmmll jsvbk'", "assert encode('at brain music signal A1') == 'ha iyhpu tbzpj zpnuhs A1'", "assert encode('') == ''"], "test_code": "assert encode('apple of planet planet') == 'hwwsl vm wshula wshula'\nassert encode('stone to at pixel matrix 2024') == 'zavul av ha wpels thaype 2024'\nassert encode('garden') == 'nhyklu'\nassert encode('window OK') == 'dpukvd OK'\nassert encode('rocket brain planet coffee cloud') == 'yvjrla iyhpu wshula jvmmll jsvbk'\nassert encode('at brain music signal A1') == 'ha iyhpu tbzpj zpnuhs A1'\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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('apple of planet planet')` يُرجع `'hwwsl vm wshula wshula'`.\nالجواب:", "qhash": "56bf6694b453c4f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل جبل برتقال') == 2", "assert lead_count('جمل نهار قمر باب مطر عربية بحر جمل') == 2", "assert lead_count('جمل دفتر حديقة عربية طالب') == 1", "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('جمل دفتر حديقة عربية طالب') == 1\nassert lead_count('ماء سوق مطر كتاب جبل') == 1\nassert lead_count('مكتبة مطر حصان عربية جبل باب كتاب') == 1\nassert lead_count('سماء دفتر') == 0\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.split():\n if w.endswith('ج'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ج»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ج'):\n count += 1\n return count\n```\nمثال: `lead_count('جبل جبل برتقال')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "1c8a6712b0b13b04"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('signal') == 'vljqdo'", "assert encode('is coffee in') == 'lv friihh lq'", "assert encode('up') == 'xs'", "assert encode('rocket at matrix') == 'urfnhw dw pdwula'", "assert encode('brain') == 'eudlq'", "assert encode('river') == 'ulyhu'", "assert encode('') == ''"], "test_code": "assert encode('signal') == 'vljqdo'\nassert encode('is coffee in') == 'lv friihh lq'\nassert encode('up') == 'xs'\nassert encode('rocket at matrix') == 'urfnhw dw pdwula'\nassert encode('brain') == 'eudlq'\nassert encode('river') == 'ulyhu'\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 + (3)) % 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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('signal')` يجب أن تُرجع `'vljqdo'`.\nالجواب:", "qhash": "2b77d58477491fd7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([41, 63, 8, 61, 21, 56, 43, 51, 32, 44]) == [41, 104, 112, 0, 21, 77, 120, 0, 32, 76]", "assert rolling_total([79, 22]) == [79, 101]", "assert rolling_total([122, 43]) == [122, 0]", "assert rolling_total([6, 130, 125, 89, 34, -4, 107, 39, 91, 116]) == [6, 0, 125, 0, 34, 30, 0, 39, 130, 0]", "assert rolling_total([35, 119, 66]) == [35, 0, 66]", "assert rolling_total([93, 61]) == [93, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([41, 63, 8, 61, 21, 56, 43, 51, 32, 44]) == [41, 104, 112, 0, 21, 77, 120, 0, 32, 76]\nassert rolling_total([79, 22]) == [79, 101]\nassert rolling_total([122, 43]) == [122, 0]\nassert rolling_total([6, 130, 125, 89, 34, -4, 107, 39, 91, 116]) == [6, 0, 125, 0, 34, 30, 0, 39, 130, 0]\nassert rolling_total([35, 119, 66]) == [35, 0, 66]\nassert rolling_total([93, 61]) == [93, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\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 > 133:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 133 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([41, 63, 8, 61, 21, 56, 43, 51, 32, 44])` يجب أن تُرجع `[41, 104, 112, 0, 21, 77, 120, 0, 32, 76]`.\nالجواب:", "qhash": "e308148241108312"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('نهار قمر حاسوب دفتر قهوة') == 2", "assert lead_count('قلم عربية قهوة') == 2", "assert lead_count('شجرة طالب قلم ماء قمر قلم مدرسة ميناء') == 3", "assert lead_count('قهوة قلم مدرسة دفتر') == 2", "assert lead_count('سفينة حديقة دفتر مدينة تفاحة') == 0", "assert lead_count('دفتر قهوة طالب عمل لغة باب وردة') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('نهار قمر حاسوب دفتر قهوة') == 2\nassert lead_count('قلم عربية قهوة') == 2\nassert lead_count('شجرة طالب قلم ماء قمر قلم مدرسة ميناء') == 3\nassert lead_count('قهوة قلم مدرسة دفتر') == 2\nassert lead_count('سفينة حديقة دفتر مدينة تفاحة') == 0\nassert lead_count('دفتر قهوة طالب عمل لغة باب وردة') == 1\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('نهار قمر حاسوب دفتر قهوة')` يُرجع `2`.\nالجواب:", "qhash": "de76f5626ecc726f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 34", "tests": ["assert pow_digits(78046) == 29", "assert pow_digits(905841) == 17", "assert pow_digits(349410) == 21", "assert pow_digits(419179) == 25", "assert pow_digits(839798) == 8", "assert pow_digits(974391) == 33", "assert pow_digits(843207) == 6", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(78046) == 29\nassert pow_digits(905841) == 17\nassert pow_digits(349410) == 21\nassert pow_digits(419179) == 25\nassert pow_digits(839798) == 8\nassert pow_digits(974391) == 33\nassert pow_digits(843207) == 6\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 34", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 34\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 34.\nمثال: `pow_digits(78046)` يجب أن تُرجع `29`.\nالجواب:", "qhash": "b229c69f1e272802"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'حسن': 18, 'يوسف': 10, 'باسل': 33, 'هدى': 32}\npoints['هدى'] += 17\npoints['خالد'] = 54\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'حسن': 18, 'يوسف': 10, 'باسل': 33, 'هدى': 32}\npoints['هدى'] += 17\npoints['خالد'] = 54\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('باسل', -1))\n```\nالجواب:", "qhash": "2e17c404f3cd2fe3", "answer": "5\nخالد\n164\n33", "completion": " الناتج:\n```text\n5\nخالد\n164\n33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 10", "tests": ["assert digit_power(36572) == 3", "assert digit_power(692459) == 5", "assert digit_power(913708) == 8", "assert digit_power(184802) == 3", "assert digit_power(710483) == 3", "assert digit_power(672858) == 6", "assert digit_power(684841) == 1", "assert digit_power(0) == 0"], "test_code": "assert digit_power(36572) == 3\nassert digit_power(692459) == 5\nassert digit_power(913708) == 8\nassert digit_power(184802) == 3\nassert digit_power(710483) == 3\nassert digit_power(672858) == 6\nassert digit_power(684841) == 1\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 10", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 10\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 10.\nللتوضيح: الاستدعاء `digit_power(36572)` يُرجع `3`.\nالجواب:", "qhash": "1b2632cd5832fdc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(522093075))\nprint(calc(calc(522093075)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(522093075))\nprint(calc(calc(522093075)))\n```\nالجواب:", "qhash": "ec8dc287ec3e3af3", "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_caesar#1", "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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('brain python camel') == 'jziqv xgbpwv kiumt'", "assert rotate_letters('rocket winter it banana of A1') == 'zwksmb eqvbmz qb jivivi wn A1'", "assert rotate_letters('river') == 'zqdmz'", "assert rotate_letters('by vector winter cloud !') == 'jg dmkbwz eqvbmz ktwcl !'", "assert rotate_letters('rocket') == 'zwksmb'", "assert rotate_letters('of 2024') == 'wn 2024'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('brain python camel') == 'jziqv xgbpwv kiumt'\nassert rotate_letters('rocket winter it banana of A1') == 'zwksmb eqvbmz qb jivivi wn A1'\nassert rotate_letters('river') == 'zqdmz'\nassert rotate_letters('by vector winter cloud !') == 'jg dmkbwz eqvbmz ktwcl !'\nassert rotate_letters('rocket') == 'zwksmb'\nassert rotate_letters('of 2024') == 'wn 2024'\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 + (-18)) % 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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('brain python camel')` يُرجع `'jziqv xgbpwv kiumt'`.\nالجواب:", "qhash": "fa545afc296beeff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 46903\ncount = 0\nwhile n > 9:\n n = n // 4\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 46903\ncount = 0\nwhile n > 9:\n n = n // 4\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "1d91d16211cc3c21", "answer": "2 7", "completion": " الناتج:\n```text\n2 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total", "tests": ["assert scaled_powers(6) == 84", "assert scaled_powers(2) == 12", "assert scaled_powers(1) == 4", "assert scaled_powers(1) == 4", "assert scaled_powers(10) == 220", "assert scaled_powers(1) == 4", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 84\nassert scaled_powers(2) == 12\nassert scaled_powers(1) == 4\nassert scaled_powers(1) == 4\nassert scaled_powers(10) == 220\nassert scaled_powers(1) == 4\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 1\n return total\n```\nمثال: `scaled_powers(6)` يجب أن تُرجع `84`.\nالجواب:", "qhash": "d63fc90cddd05bc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'ميناء ليل'\nprint(w[-1])\nprint(w[::-1])\nprint(len(w))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'ميناء ليل'\nprint(w[-1])\nprint(w[::-1])\nprint(len(w))\n```\nالجواب:", "qhash": "c062ee0ca6954bea", "answer": "ل\nليل ءانيم\n9", "completion": " الناتج:\n```text\nل\nليل ءانيم\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert count_prefix('ماء ميناء جمل قمر لغة حصان باب') == 1", "assert count_prefix('بيت معلم') == 1", "assert count_prefix('باب فجر قمر نهر بحر باب بيت') == 4", "assert count_prefix('ليل حديقة سفينة بيت بحر دفتر') == 2", "assert count_prefix('برمجة شجرة مطر بيت لغة') == 2", "assert count_prefix('بيت طائرة بحر نور مكتبة ميناء برتقال') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('ماء ميناء جمل قمر لغة حصان باب') == 1\nassert count_prefix('بيت معلم') == 1\nassert count_prefix('باب فجر قمر نهر بحر باب بيت') == 4\nassert count_prefix('ليل حديقة سفينة بيت بحر دفتر') == 2\nassert count_prefix('برمجة شجرة مطر بيت لغة') == 2\nassert count_prefix('بيت طائرة بحر نور مكتبة ميناء برتقال') == 3\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s:\n if w.startswith('ب'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('ماء ميناء جمل قمر لغة حصان باب')` يُرجع `1`.\nالجواب:", "qhash": "31229ed2bc21fc20"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 3 for x in xs if 6 <= x <= 46)", "tests": ["assert select_range([56, 31, 11, 17, -3, 44, 54, 30]) == [33, 51, 90, 93, 132]", "assert select_range([53, 43, -28, 28]) == [84, 129]", "assert select_range([53, 22, 5, 18, 44, 2, 22]) == [54, 66, 66, 132]", "assert select_range([]) == []", "assert select_range([-5, -25]) == []", "assert select_range([]) == []", "assert select_range([-16]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([56, 31, 11, 17, -3, 44, 54, 30]) == [33, 51, 90, 93, 132]\nassert select_range([53, 43, -28, 28]) == [84, 129]\nassert select_range([53, 22, 5, 18, 44, 2, 22]) == [54, 66, 66, 132]\nassert select_range([]) == []\nassert select_range([-5, -25]) == []\nassert select_range([]) == []\nassert select_range([-16]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 3 for x in xs if 6 <= x <= 46)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 3 for x in xs if 6 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 6 ≤ x ≤ 46، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([56, 31, 11, 17, -3, 44, 54, 30])` يُرجع `[33, 51, 90, 93, 132]`.\nالجواب:", "qhash": "1427f13ebf478147"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 7\nfor i in range(5, 22, 2):\n acc += i * 4\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 7\nfor i in range(5, 22, 2):\n acc += i * 4\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "29050f80d5fcd5db", "answer": "475\n21", "completion": " الناتج:\n```text\n475\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'river_window'\nprint(name[-3:])\nprint(name.split('_'))\nprint(name.index('i') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'river_window'\nprint(name[-3:])\nprint(name.split('_'))\nprint(name.index('i') + len(name))\n```\nالجواب:", "qhash": "0bf250da2be7d277", "answer": "dow\n['river', 'window']\n13", "completion": " الناتج:\n```text\ndow\n['river', 'window']\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 62) == 1)", "tests": ["assert count_gcd1(13) == 7", "assert count_gcd1(159) == 77", "assert count_gcd1(29) == 15", "assert count_gcd1(10) == 5", "assert count_gcd1(13) == 7", "assert count_gcd1(113) == 55", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(13) == 7\nassert count_gcd1(159) == 77\nassert count_gcd1(29) == 15\nassert count_gcd1(10) == 5\nassert count_gcd1(13) == 7\nassert count_gcd1(113) == 55\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, 62) == 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, 62) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 62، أي أن القاسم المشترك الأكبر لها مع 62 يساوي 1.\nمثال: `count_gcd1(13)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "20c5f68d8f7088f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('up at 2024') == 'je pi 2024'", "assert rotate_letters('brain matrix') == 'qgpxc bpigxm'", "assert rotate_letters('apple it we OK') == 'peeat xi lt OK'", "assert rotate_letters('table') == 'ipqat'", "assert rotate_letters('matrix planet pixel of an') == 'bpigxm eapcti exmta du pc'", "assert rotate_letters('brain desert engine') == 'qgpxc sthtgi tcvxct'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('up at 2024') == 'je pi 2024'\nassert rotate_letters('brain matrix') == 'qgpxc bpigxm'\nassert rotate_letters('apple it we OK') == 'peeat xi lt OK'\nassert rotate_letters('table') == 'ipqat'\nassert rotate_letters('matrix planet pixel of an') == 'bpigxm eapcti exmta du pc'\nassert rotate_letters('brain desert engine') == 'qgpxc sthtgi tcvxct'\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 + (15)) % 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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('up at 2024')` يُرجع `'je pi 2024'`.\nالجواب:", "qhash": "1d22e3e0cf5730e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 6 * x ** 2 + (8) * x + (-8)", "tests": ["assert value_at(4) == 120", "assert value_at(-15) == 1222", "assert value_at(2) == 32", "assert value_at(3) == 70", "assert value_at(8) == 440", "assert value_at(-7) == 230", "assert value_at(-4) == 56", "assert value_at(0) == -8"], "test_code": "assert value_at(4) == 120\nassert value_at(-15) == 1222\nassert value_at(2) == 32\nassert value_at(3) == 70\nassert value_at(8) == 440\nassert value_at(-7) == 230\nassert value_at(-4) == 56\nassert value_at(0) == -8", "answer": "def value_at(x):\n return 6 * x ** 2 + (8) * x + (-8)", "completion": " ```python\ndef value_at(x):\n return 6 * x ** 2 + (8) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 6x² + 8x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(4)` يُرجع `120`.\nالجواب:", "qhash": "be18354808fbbe40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 82", "tests": ["assert pow_digits(70452) == 48", "assert pow_digits(407346) == 58", "assert pow_digits(857468) == 50", "assert pow_digits(444010) == 29", "assert pow_digits(79577) == 79", "assert pow_digits(294803) == 28", "assert pow_digits(42829) == 9", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(70452) == 48\nassert pow_digits(407346) == 58\nassert pow_digits(857468) == 50\nassert pow_digits(444010) == 29\nassert pow_digits(79577) == 79\nassert pow_digits(294803) == 28\nassert pow_digits(42829) == 9\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 82", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 82\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 82.\nمثال: `pow_digits(70452)` يجب أن تُرجع `48`.\nالجواب:", "qhash": "95285be8cdd14c30"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6", "tests": ["assert pow_digits(10911) == 0", "assert pow_digits(299874) == 3", "assert pow_digits(326245) == 4", "assert pow_digits(724489) == 4", "assert pow_digits(457606) == 4", "assert pow_digits(70001) == 2", "assert pow_digits(800128) == 1", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(10911) == 0\nassert pow_digits(299874) == 3\nassert pow_digits(326245) == 4\nassert pow_digits(724489) == 4\nassert pow_digits(457606) == 4\nassert pow_digits(70001) == 2\nassert pow_digits(800128) == 1\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 6.\nمثال: `pow_digits(10911)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ff8106fc8e8ab3d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ي')", "tests": ["assert letter_hits('مدينة معلم بيت مطر نهار طالب') == 2", "assert letter_hits('دفتر نور معلم') == 0", "assert letter_hits('حديقة جبل حديقة') == 2", "assert letter_hits('برتقال دفتر شجرة ليل شجرة') == 1", "assert letter_hits('سيارة سلام سلام شمس عربية جمل كتاب جبل') == 2", "assert letter_hits('سفينة عربية دفتر قمر مكتبة شجرة') == 2", "assert letter_hits('بحر طالب حصان ميناء لغة نور كتاب') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('مدينة معلم بيت مطر نهار طالب') == 2\nassert letter_hits('دفتر نور معلم') == 0\nassert letter_hits('حديقة جبل حديقة') == 2\nassert letter_hits('برتقال دفتر شجرة ليل شجرة') == 1\nassert letter_hits('سيارة سلام سلام شمس عربية جمل كتاب جبل') == 2\nassert letter_hits('سفينة عربية دفتر قمر مكتبة شجرة') == 2\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('مدينة معلم بيت مطر نهار طالب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "ca100338d505449e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "tests": ["assert pow_total(8) == 26316", "assert pow_total(14) == 383061", "assert pow_total(2) == 51", "assert pow_total(2) == 51", "assert pow_total(5) == 2937", "assert pow_total(1) == 3", "assert pow_total(0) == 0"], "test_code": "assert pow_total(8) == 26316\nassert pow_total(14) == 383061\nassert pow_total(2) == 51\nassert pow_total(2) == 51\nassert pow_total(5) == 2937\nassert pow_total(1) == 3\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 4\n return total\n```\nمثال: `pow_total(8)` يجب أن تُرجع `26316`.\nالجواب:", "qhash": "2b82b260930c6153"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 4\nfor x in range(6, 11, 2):\n result -= x * 5\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 4\nfor x in range(6, 11, 2):\n result -= x * 5\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "a72340aad689985b", "answer": "-116\n10", "completion": " الناتج:\n```text\n-116\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_sel([21, 75, 87, 64, 69, 81, 59, 24, 12, 34, 85]) == 1", "assert count_sel([70, -25]) == 0", "assert count_sel([21, 0, -1, -2, 44, -21]) == 0", "assert count_sel([-11]) == 0", "assert count_sel([-28, 64, -30]) == 0", "assert count_sel([60, -4, -8, 71, -12, 72, -34, 68, -14]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([21, 75, 87, 64, 69, 81, 59, 24, 12, 34, 85]) == 1\nassert count_sel([70, -25]) == 0\nassert count_sel([21, 0, -1, -2, 44, -21]) == 0\nassert count_sel([-11]) == 0\nassert count_sel([-28, 64, -30]) == 0\nassert count_sel([60, -4, -8, 71, -12, 72, -34, 68, -14]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 9 == 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 % 9 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([21, 75, 87, 64, 69, 81, 59, 24, 12, 34, 85])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "943d42092c3804d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'زينب': 36, 'سلمى': 26, 'هدى': 41, 'نور': 23}\nscores['زينب'] += 13\nscores['علي'] = 50\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 30])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'زينب': 36, 'سلمى': 26, 'هدى': 41, 'نور': 23}\nscores['زينب'] += 13\nscores['علي'] = 50\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 30])\n```\nالجواب:", "qhash": "5a1098b7ef3e30b3", "answer": "5\nعلي\n189\n['زينب', 'هدى', 'علي']", "completion": " الناتج:\n```text\n5\nعلي\n189\n['زينب', 'هدى', 'علي']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['banana', 'desert', 'planet', 'code', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['banana', 'desert', 'planet', 'code', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "139971fd965a1e67", "answer": "['code', 'table', 'banana', 'desert', 'planet']\n['planet', 'desert', 'banana']", "completion": " الناتج:\n```text\n['code', 'table', 'banana', 'desert', 'planet']\n['planet', 'desert', 'banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "tests": ["assert sum_terms(7) == 1568", "assert sum_terms(6) == 882", "assert sum_terms(1) == 2", "assert sum_terms(2) == 18", "assert sum_terms(0) == 0", "assert sum_terms(1) == 2", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 1568\nassert sum_terms(6) == 882\nassert sum_terms(1) == 2\nassert sum_terms(2) == 18\nassert sum_terms(0) == 0\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 ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 2 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(7)` يُرجع `1568`.\nالجواب:", "qhash": "3453bb4c372f9be7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'coffee_rocket'\nprint(word.upper())\nprint(word.count('c'))\nprint(word.index('c') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'coffee_rocket'\nprint(word.upper())\nprint(word.count('c'))\nprint(word.index('c') + len(word))\n```\nالجواب:", "qhash": "2949d27199588d3c", "answer": "COFFEE_ROCKET\n2\n13", "completion": " الناتج:\n```text\nCOFFEE_ROCKET\n2\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 81) == 1)", "tests": ["assert rel_prime_count(65) == 44", "assert rel_prime_count(181) == 121", "assert rel_prime_count(67) == 45", "assert rel_prime_count(142) == 95", "assert rel_prime_count(74) == 50", "assert rel_prime_count(72) == 48", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(65) == 44\nassert rel_prime_count(181) == 121\nassert rel_prime_count(67) == 45\nassert rel_prime_count(142) == 95\nassert rel_prime_count(74) == 50\nassert rel_prime_count(72) == 48\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, 81) == 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, 81) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 81، أي أن القاسم المشترك الأكبر لها مع 81 يساوي 1.\nمثال: `rel_prime_count(65)` يجب أن تُرجع `44`.\nالجواب:", "qhash": "4fdba9ba925bd759"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([-27, 45, 10, -18, 60, 58]) == 60", "assert find_max_div([-10, -6, -8]) == -6", "assert find_max_div([1, 3]) == None", "assert find_max_div([40, 2, -25, 38, -8, 7, 38, 6]) == 40", "assert find_max_div([8, -19, -21, 22, 4]) == 22", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-27, 45, 10, -18, 60, 58]) == 60\nassert find_max_div([-10, -6, -8]) == -6\nassert find_max_div([1, 3]) == None\nassert find_max_div([40, 2, -25, 38, -8, 7, 38, 6]) == 40\nassert find_max_div([8, -19, -21, 22, 4]) == 22\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(arr):\n best = 0\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 find_max_div(arr):\n best = 0\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للتوضيح: الاستدعاء `find_max_div([-27, 45, 10, -18, 60, 58])` يُرجع `60`.\nالجواب:", "qhash": "476cca6a05e50145"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'pixel_engine'\nprint(text.split('_'))\nprint(text.index('i') + len(text))\nprint(text.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'pixel_engine'\nprint(text.split('_'))\nprint(text.index('i') + len(text))\nprint(text.upper())\n```\nالجواب:", "qhash": "6a5dc314eecb1baf", "answer": "['pixel', 'engine']\n13\nPIXEL_ENGINE", "completion": " الناتج:\n```text\n['pixel', 'engine']\n13\nPIXEL_ENGINE\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([25, 1, 12, 23, -29, 49, -12, 14]) == 12", "assert max_div([-9, -9, -9]) == -9", "assert max_div([1, 4]) == None", "assert max_div([32, -4, 40, -38, -39, 5, 2, 3, -3]) == 3", "assert max_div([-39, -2, 39, 32, 6, 28, -34]) == 39", "assert max_div([]) == None"], "test_code": "assert max_div([25, 1, 12, 23, -29, 49, -12, 14]) == 12\nassert max_div([-9, -9, -9]) == -9\nassert max_div([1, 4]) == None\nassert max_div([32, -4, 40, -38, -39, 5, 2, 3, -3]) == 3\nassert max_div([-39, -2, 39, 32, 6, 28, -34]) == 39\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = None\n for x in arr:\n if x % 3 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 3 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_div([25, 1, 12, 23, -29, 49, -12, 14])` يجب أن تُرجع `12`.\nالجواب:", "qhash": "14e8fd21a09d7403"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('music window matrix to') == 'qywmg amrhsa qexvmb xs'", "assert caesar('at A1') == 'ex A1'", "assert caesar('up') == 'yt'", "assert caesar('brain') == 'fvemr'", "assert caesar('cloud stone orange signal') == 'gpsyh wxsri sverki wmkrep'", "assert caesar('engine') == 'irkmri'", "assert caesar('') == ''"], "test_code": "assert caesar('music window matrix to') == 'qywmg amrhsa qexvmb xs'\nassert caesar('at A1') == 'ex A1'\nassert caesar('up') == 'yt'\nassert caesar('brain') == 'fvemr'\nassert caesar('cloud stone orange signal') == 'gpsyh wxsri sverki wmkrep'\nassert caesar('engine') == 'irkmri'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('music window matrix to')` يُرجع `'qywmg amrhsa qexvmb xs'`.\nالجواب:", "qhash": "219deea1153f459a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'elnu'}", "tests": ["assert freq_of('table planet a music') == {'e': 2, 'l': 2, 'n': 1, 'u': 1}", "assert freq_of('data river') == {'e': 1, 'l': 0, 'n': 0, 'u': 0}", "assert freq_of('we') == {'e': 1, 'l': 0, 'n': 0, 'u': 0}", "assert freq_of('a winter garden we falcon desert') == {'e': 5, 'l': 1, 'n': 3, 'u': 0}", "assert freq_of('garden on') == {'e': 1, 'l': 0, 'n': 2, 'u': 0}", "assert freq_of('engine a garden') == {'e': 3, 'l': 0, 'n': 3, 'u': 0}", "assert freq_of('') == {'e': 0, 'l': 0, 'n': 0, 'u': 0}"], "test_code": "assert freq_of('table planet a music') == {'e': 2, 'l': 2, 'n': 1, 'u': 1}\nassert freq_of('data river') == {'e': 1, 'l': 0, 'n': 0, 'u': 0}\nassert freq_of('we') == {'e': 1, 'l': 0, 'n': 0, 'u': 0}\nassert freq_of('a winter garden we falcon desert') == {'e': 5, 'l': 1, 'n': 3, 'u': 0}\nassert freq_of('garden on') == {'e': 1, 'l': 0, 'n': 2, 'u': 0}\nassert freq_of('engine a garden') == {'e': 3, 'l': 0, 'n': 3, 'u': 0}\nassert freq_of('') == {'e': 0, 'l': 0, 'n': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'elnu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'elnu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'l'، 'n'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('table planet a music')` يجب أن تُرجع `{'e': 2, 'l': 2, 'n': 1, 'u': 1}`.\nالجواب:", "qhash": "9d7c1b5566f84181"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(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 tally_div([42, 55, 77, 53, 65, 54, 10, 49, 88, 71, 45]) == 2", "assert tally_div([54, 62, -21, 1]) == 0", "assert tally_div([-6, -21, -34, 74, 79, 77, 88, 17, 40]) == 1", "assert tally_div([4, 49, -9, 35, 90, 34, 89, 36, 51]) == 2", "assert tally_div([74, 61, -38]) == 0", "assert tally_div([83, 39, -11, 87, 65, -37, 88, 2, 48]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([42, 55, 77, 53, 65, 54, 10, 49, 88, 71, 45]) == 2\nassert tally_div([54, 62, -21, 1]) == 0\nassert tally_div([-6, -21, -34, 74, 79, 77, 88, 17, 40]) == 1\nassert tally_div([4, 49, -9, 35, 90, 34, 89, 36, 51]) == 2\nassert tally_div([74, 61, -38]) == 0\nassert tally_div([83, 39, -11, 87, 65, -37, 88, 2, 48]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `tally_div([42, 55, 77, 53, 65, 54, 10, 49, 88, 71, 45])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "cce8e7b3321303bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_list([31, 46, 48, 27, 5, 39, 34, 44]) == [48, 27, 5, 39, 34, 44, 31, 46]", "assert rotate_list([0, 23, 31]) == [0, 23, 31]", "assert rotate_list([-5, 39, 12, 20, 17, 33]) == [-5, 39, 12, 20, 17, 33]", "assert rotate_list([-3, -3, 17, 39, 41, 23]) == [-3, -3, 17, 39, 41, 23]", "assert rotate_list([45, -4, 8, 16, 46, 38, 29, 48]) == [8, 16, 46, 38, 29, 48, 45, -4]", "assert rotate_list([-2, -1, -4, 21, 13, 46, 33, 47]) == [-4, 21, 13, 46, 33, 47, -2, -1]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([31, 46, 48, 27, 5, 39, 34, 44]) == [48, 27, 5, 39, 34, 44, 31, 46]\nassert rotate_list([0, 23, 31]) == [0, 23, 31]\nassert rotate_list([-5, 39, 12, 20, 17, 33]) == [-5, 39, 12, 20, 17, 33]\nassert rotate_list([-3, -3, 17, 39, 41, 23]) == [-3, -3, 17, 39, 41, 23]\nassert rotate_list([45, -4, 8, 16, 46, 38, 29, 48]) == [8, 16, 46, 38, 29, 48, 45, -4]\nassert rotate_list([-2, -1, -4, 21, 13, 46, 33, 47]) == [-4, 21, 13, 46, 33, 47, -2, -1]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 6 % len(xs)\n return ____\n```\nمثال: `rotate_list([31, 46, 48, 27, 5, 39, 34, 44])` يجب أن تُرجع `[48, 27, 5, 39, 34, 44, 31, 46]`.\nالجواب:", "qhash": "1dea3d9a5160f723"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(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 max_div([22, 60, 24, 10, -23, 25, 4, 55]) == 60", "assert max_div([-24, -24, -12]) == -12", "assert max_div([1, 7]) == None", "assert max_div([-34, 35, -36, -40, -13, 3, 27, -37, 22]) == -36", "assert max_div([-40, -4, 42]) == 42", "assert max_div([]) == None"], "test_code": "assert max_div([22, 60, 24, 10, -23, 25, 4, 55]) == 60\nassert max_div([-24, -24, -12]) == -12\nassert max_div([1, 7]) == None\nassert max_div([-34, 35, -36, -40, -13, 3, 27, -37, 22]) == -36\nassert max_div([-40, -4, 42]) == 42\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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 max_div(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للتوضيح: الاستدعاء `max_div([22, 60, 24, 10, -23, 25, 4, 55])` يُرجع `60`.\nالجواب:", "qhash": "ea27de2891c91f7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 6 * x ** 2 + (-3) * x + (2)", "tests": ["assert eval_poly(5) == 137", "assert eval_poly(7) == 275", "assert eval_poly(15) == 1307", "assert eval_poly(-18) == 2000", "assert eval_poly(-20) == 2462", "assert eval_poly(15) == 1307", "assert eval_poly(0) == 2", "assert eval_poly(0) == 2"], "test_code": "assert eval_poly(5) == 137\nassert eval_poly(7) == 275\nassert eval_poly(15) == 1307\nassert eval_poly(-18) == 2000\nassert eval_poly(-20) == 2462\nassert eval_poly(15) == 1307\nassert eval_poly(0) == 2\nassert eval_poly(0) == 2", "answer": "def eval_poly(x):\n return 6 * x ** 2 + (-3) * x + (2)", "completion": " ```python\ndef eval_poly(x):\n return 6 * x ** 2 + (-3) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 6x² - 3x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(5)` يُرجع `137`.\nالجواب:", "qhash": "ff39ff7905464e0d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 164:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([13, 49, 23, 55, 10, 5]) == [13, 62, 85, 140, 150, 155]", "assert reset_sum([12, 88]) == [12, 100]", "assert reset_sum([156, 14, 117, 59, 109, 73, 39, 99]) == [156, 0, 117, 0, 109, 0, 39, 138]", "assert reset_sum([142, 161, 1, 49, 80, 164, -1, 21]) == [142, 0, 1, 50, 130, 0, -1, 20]", "assert reset_sum([50, 4]) == [50, 54]", "assert reset_sum([85, 131, 28, 28, 63, 146, 56]) == [85, 0, 28, 56, 119, 0, 56]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([13, 49, 23, 55, 10, 5]) == [13, 62, 85, 140, 150, 155]\nassert reset_sum([12, 88]) == [12, 100]\nassert reset_sum([156, 14, 117, 59, 109, 73, 39, 99]) == [156, 0, 117, 0, 109, 0, 39, 138]\nassert reset_sum([142, 161, 1, 49, 80, 164, -1, 21]) == [142, 0, 1, 50, 130, 0, -1, 20]\nassert reset_sum([50, 4]) == [50, 54]\nassert reset_sum([85, 131, 28, 28, 63, 146, 56]) == [85, 0, 28, 56, 119, 0, 56]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 164:\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 > 164:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 164 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([13, 49, 23, 55, 10, 5])` يُرجع `[13, 62, 85, 140, 150, 155]`.\nالجواب:", "qhash": "90f282dbdef4a6e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 19\nfor x in range(2, 9, 4):\n s -= x * 5\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 19\nfor x in range(2, 9, 4):\n s -= x * 5\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "b6efe0afb21c4db4", "answer": "-21\n6", "completion": " الناتج:\n```text\n-21\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 50", "tests": ["assert digits_mod(22808) == 24", "assert digits_mod(505555) == 25", "assert digits_mod(416074) == 10", "assert digits_mod(504119) == 44", "assert digits_mod(438265) == 20", "assert digits_mod(476159) == 40", "assert digits_mod(913439) == 41", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(22808) == 24\nassert digits_mod(505555) == 25\nassert digits_mod(416074) == 10\nassert digits_mod(504119) == 44\nassert digits_mod(438265) == 20\nassert digits_mod(476159) == 40\nassert digits_mod(913439) == 41\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 50", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 50\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 50.\nللتوضيح: الاستدعاء `digits_mod(22808)` يُرجع `24`.\nالجواب:", "qhash": "2925c2c3dd681fbb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'برتقال'\nprint(kalima.find('ت'))\nprint(kalima.count('ت'))\nprint(kalima[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'برتقال'\nprint(kalima.find('ت'))\nprint(kalima.count('ت'))\nprint(kalima[::-1])\n```\nالجواب:", "qhash": "05e87e2fb58ee6f0", "answer": "2\n1\nلاقترب", "completion": " الناتج:\n```text\n2\n1\nلاقترب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert sum_terms(5) == 605", "assert sum_terms(11) == 5566", "assert sum_terms(1) == 11", "assert sum_terms(4) == 330", "assert sum_terms(14) == 11165", "assert sum_terms(1) == 11", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(5) == 605\nassert sum_terms(11) == 5566\nassert sum_terms(1) == 11\nassert sum_terms(4) == 330\nassert sum_terms(14) == 11165\nassert sum_terms(1) == 11\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(5)` يُرجع `605`.\nالجواب:", "qhash": "805e450a4fa1fe41"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert invert_words('light coffee signal pixel') == 'pixel|signal|coffee|light'", "assert invert_words('is coffee coffee winter vector an a') == 'vector|winter|coffee|coffee'", "assert invert_words('summer by matrix engine planet code') == 'code|planet|engine|matrix|summer'", "assert invert_words('signal music cloud music python banana table garden') == 'garden|table|banana|python|music|cloud|music|signal'", "assert invert_words('go python brain a data') == 'data|brain|python'", "assert invert_words('python') == 'python'", "assert invert_words('python music') == 'music|python'"], "test_code": "assert invert_words('light coffee signal pixel') == 'pixel|signal|coffee|light'\nassert invert_words('is coffee coffee winter vector an a') == 'vector|winter|coffee|coffee'\nassert invert_words('summer by matrix engine planet code') == 'code|planet|engine|matrix|summer'\nassert invert_words('signal music cloud music python banana table garden') == 'garden|table|banana|python|music|cloud|music|signal'\nassert invert_words('go python brain a data') == 'data|brain|python'\nassert invert_words('python') == 'python'\nassert invert_words('python music') == 'music|python'", "answer": "def invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `invert_words('light coffee signal pixel')` يُرجع `'pixel|signal|coffee|light'`.\nالجواب:", "qhash": "6ed37b46b6b0fb7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38", "tests": ["assert digit_score(13210) == 7", "assert digit_score(983209) == 31", "assert digit_score(366973) == 34", "assert digit_score(470483) == 26", "assert digit_score(99829) == 37", "assert digit_score(979330) == 31", "assert digit_score(580695) == 33", "assert digit_score(0) == 0"], "test_code": "assert digit_score(13210) == 7\nassert digit_score(983209) == 31\nassert digit_score(366973) == 34\nassert digit_score(470483) == 26\nassert digit_score(99829) == 37\nassert digit_score(979330) == 31\nassert digit_score(580695) == 33\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 38\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 38.\nمثال: `digit_score(13210)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "bb5441a19c29c50e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert roll([15, 29, 8, 28, 6, 0, 48]) == [29, 8, 28, 6, 0, 48, 15]", "assert roll([42, 32, 9, -1, 36, 44, 26]) == [32, 9, -1, 36, 44, 26, 42]", "assert roll([42, 19, 10, 37, 35, 4, 35, 28, 10, 22, 20, 21]) == [19, 10, 37, 35, 4, 35, 28, 10, 22, 20, 21, 42]", "assert roll([13, 35, 10, 15, 5, 37, 40, 50, 20, 34]) == [35, 10, 15, 5, 37, 40, 50, 20, 34, 13]", "assert roll([10, 32, 7, 11]) == [32, 7, 11, 10]", "assert roll([37, 8, 20, -3, 43, 32, 23, 21, 43, 33, -5, 34]) == [8, 20, -3, 43, 32, 23, 21, 43, 33, -5, 34, 37]", "assert roll([]) == []"], "test_code": "assert roll([15, 29, 8, 28, 6, 0, 48]) == [29, 8, 28, 6, 0, 48, 15]\nassert roll([42, 32, 9, -1, 36, 44, 26]) == [32, 9, -1, 36, 44, 26, 42]\nassert roll([42, 19, 10, 37, 35, 4, 35, 28, 10, 22, 20, 21]) == [19, 10, 37, 35, 4, 35, 28, 10, 22, 20, 21, 42]\nassert roll([13, 35, 10, 15, 5, 37, 40, 50, 20, 34]) == [35, 10, 15, 5, 37, 40, 50, 20, 34, 13]\nassert roll([10, 32, 7, 11]) == [32, 7, 11, 10]\nassert roll([37, 8, 20, -3, 43, 32, 23, 21, 43, 33, -5, 34]) == [8, 20, -3, 43, 32, 23, 21, 43, 33, -5, 34, 37]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return ____\n```\nمثال: `roll([15, 29, 8, 28, 6, 0, 48])` يجب أن تُرجع `[29, 8, 28, 6, 0, 48, 15]`.\nالجواب:", "qhash": "4677ea37007d89d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "tests": ["assert sum_terms(6) == 91", "assert sum_terms(14) == 1015", "assert sum_terms(15) == 1240", "assert sum_terms(5) == 55", "assert sum_terms(14) == 1015", "assert sum_terms(1) == 1", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(6) == 91\nassert sum_terms(14) == 1015\nassert sum_terms(15) == 1240\nassert sum_terms(5) == 55\nassert sum_terms(14) == 1015\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 ** 2\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(6)` يُرجع `91`.\nالجواب:", "qhash": "efe025d6c6bcbb66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('river of pixel orange pixel of cloud') == 'orange'", "assert rev_join('to rocket falcon vector winter') == 'winter_vector_falcon_rocket'", "assert rev_join('window vector summer signal music desert') == 'desert_signal_summer_vector_window'", "assert rev_join('table apple at to table data') == ''", "assert rev_join('pixel of') == ''", "assert rev_join('at') == ''", "assert rev_join('is desert signal in window data brain desert') == 'desert_window_signal_desert'"], "test_code": "assert rev_join('river of pixel orange pixel of cloud') == 'orange'\nassert rev_join('to rocket falcon vector winter') == 'winter_vector_falcon_rocket'\nassert rev_join('window vector summer signal music desert') == 'desert_signal_summer_vector_window'\nassert rev_join('table apple at to table data') == ''\nassert rev_join('pixel of') == ''\nassert rev_join('at') == ''\nassert rev_join('is desert signal in window data brain desert') == 'desert_window_signal_desert'", "answer": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_join('river of pixel orange pixel of cloud')` يُرجع `'orange'`.\nالجواب:", "qhash": "899ac44316087d73"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=2):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(-8))\nprint(h(-8, -1))\nprint(h(h(-1), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=2):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(-8))\nprint(h(-8, -1))\nprint(h(h(-1), -8))\n```\nالجواب:", "qhash": "5689e0d1662c9672", "answer": "-10\n-7\n11", "completion": " الناتج:\n```text\n-10\n-7\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 4\nfor n in range(10, 20, 2):\n s -= n * 2\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 4\nfor n in range(10, 20, 2):\n s -= n * 2\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "32f4c2419b1fa6d5", "answer": "-136\n18", "completion": " الناتج:\n```text\n-136\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 5\n return total", "tests": ["assert power_sum(5) == 8850", "assert power_sum(3) == 552", "assert power_sum(15) == 4598400", "assert power_sum(10) == 441650", "assert power_sum(7) == 58016", "assert power_sum(1) == 2", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 8850\nassert power_sum(3) == 552\nassert power_sum(15) == 4598400\nassert power_sum(10) == 441650\nassert power_sum(7) == 58016\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 ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * 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 = 2 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × 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 = 2 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `power_sum(5)` يُرجع `8850`.\nالجواب:", "qhash": "c48f458d27b6aafd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('نهر مدرسة') == 1", "assert how_many('طائرة رمل صحراء لغة سوق وردة بحر') == 1", "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('نهر مدرسة') == 1\nassert how_many('طائرة رمل صحراء لغة سوق وردة بحر') == 1\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": "206c43d3d7ca2add"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "58978e46e0279a98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [12, 39, 16, 26, 33, -4, 7]\nprint(lst[1:3])\nprint(lst[::-2])\nprint(len(lst[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [12, 39, 16, 26, 33, -4, 7]\nprint(lst[1:3])\nprint(lst[::-2])\nprint(len(lst[1:3]))\n```\nالجواب:", "qhash": "431940bdee8d25b3", "answer": "[39, 16]\n[7, 33, 16, 12]\n2", "completion": " الناتج:\n```text\n[39, 16]\n[7, 33, 16, 12]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 77) == 1)", "tests": ["assert coprimes(100) == 78", "assert coprimes(60) == 47", "assert coprimes(137) == 107", "assert coprimes(149) == 116", "assert coprimes(75) == 59", "assert coprimes(199) == 155", "assert coprimes(1) == 1"], "test_code": "assert coprimes(100) == 78\nassert coprimes(60) == 47\nassert coprimes(137) == 107\nassert coprimes(149) == 116\nassert coprimes(75) == 59\nassert coprimes(199) == 155\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, 77) == 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, 77) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 77، أي أن القاسم المشترك الأكبر لها مع 77 يساوي 1.\nمثال: `coprimes(100)` يجب أن تُرجع `78`.\nالجواب:", "qhash": "e84f5f22f6d366b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('we signal apple pixel rocket') == 'rocket pixel apple signal'", "assert words_reversed('at by pixel banana summer pixel desert') == 'desert pixel summer banana pixel'", "assert words_reversed('matrix at go') == 'matrix'", "assert words_reversed('camel') == 'camel'", "assert words_reversed('') == ''", "assert words_reversed('data summer code engine falcon window at') == 'window falcon engine code summer data'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('we signal apple pixel rocket') == 'rocket pixel apple signal'\nassert words_reversed('at by pixel banana summer pixel desert') == 'desert pixel summer banana pixel'\nassert words_reversed('matrix at go') == 'matrix'\nassert words_reversed('camel') == 'camel'\nassert words_reversed('') == ''\nassert words_reversed('data summer code engine falcon window at') == 'window falcon engine code summer data'\nassert words_reversed('') == ''", "answer": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `words_reversed('we signal apple pixel rocket')` يُرجع `'rocket pixel apple signal'`.\nالجواب:", "qhash": "330192e3bd939023"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'يوسف': 3, 'عمر': 33, 'رنا': 29, 'نور': 37}\nmarks['يوسف'] += 5\nmarks['سعيد'] = 53\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'يوسف': 3, 'عمر': 33, 'رنا': 29, 'نور': 37}\nmarks['يوسف'] += 5\nmarks['سعيد'] = 53\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))\n```\nالجواب:", "qhash": "9df8a6805f5849ec", "answer": "5\nسعيد\n160\n-1", "completion": " الناتج:\n```text\n5\nسعيد\n160\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total", "tests": ["assert power_sum(3) == 98", "assert power_sum(8) == 1428", "assert power_sum(9) == 1995", "assert power_sum(12) == 4550", "assert power_sum(4) == 210", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(3) == 98\nassert power_sum(8) == 1428\nassert power_sum(9) == 1995\nassert power_sum(12) == 4550\nassert power_sum(4) == 210\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 ** 2\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 2\n return total\n```\nمثال: `power_sum(3)` يجب أن تُرجع `98`.\nالجواب:", "qhash": "5059bf1915e3f809"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'هشام': 0, 'عمر': 27, 'فيصل': 6, 'حسن': 37, 'رنا': 14}\nd['حسن'] += 1\nd['سلمى'] = 57\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('وليد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'هشام': 0, 'عمر': 27, 'فيصل': 6, 'حسن': 37, 'رنا': 14}\nd['حسن'] += 1\nd['سلمى'] = 57\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('وليد', -1))\n```\nالجواب:", "qhash": "a38b444e73dc023a", "answer": "6\nسلمى\n142\n-1", "completion": " الناتج:\n```text\n6\nسلمى\n142\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert turn_list([44, 32, 39, 7, 45, 33]) == [44, 32, 39, 7, 45, 33]", "assert turn_list([24, -9, 20, 5, 37, 2, -5, 26, 6, 46, 42, 27]) == [-5, 26, 6, 46, 42, 27, 24, -9, 20, 5, 37, 2]", "assert turn_list([5, 17, 36, 6, 30]) == [6, 30, 5, 17, 36]", "assert turn_list([39, 31]) == [39, 31]", "assert turn_list([35, -5]) == [35, -5]", "assert turn_list([30, 10, 39, -7, -7, 7, -6]) == [-7, 7, -6, 30, 10, 39, -7]", "assert turn_list([]) == []"], "test_code": "assert turn_list([44, 32, 39, 7, 45, 33]) == [44, 32, 39, 7, 45, 33]\nassert turn_list([24, -9, 20, 5, 37, 2, -5, 26, 6, 46, 42, 27]) == [-5, 26, 6, 46, 42, 27, 24, -9, 20, 5, 37, 2]\nassert turn_list([5, 17, 36, 6, 30]) == [6, 30, 5, 17, 36]\nassert turn_list([39, 31]) == [39, 31]\nassert turn_list([35, -5]) == [35, -5]\nassert turn_list([30, 10, 39, -7, -7, 7, -6]) == [-7, 7, -6, 30, 10, 39, -7]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef turn_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 turn_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([44, 32, 39, 7, 45, 33])` يُرجع `[44, 32, 39, 7, 45, 33]`.\nالجواب:", "qhash": "b49acfe954052530"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 63", "tests": ["assert digits_mod(51133) == 22", "assert digits_mod(225594) == 48", "assert digits_mod(930393) == 9", "assert digits_mod(122980) == 28", "assert digits_mod(871674) == 24", "assert digits_mod(799313) == 5", "assert digits_mod(265259) == 59", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(51133) == 22\nassert digits_mod(225594) == 48\nassert digits_mod(930393) == 9\nassert digits_mod(122980) == 28\nassert digits_mod(871674) == 24\nassert digits_mod(799313) == 5\nassert digits_mod(265259) == 59\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 63", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 63\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 63.\nمثال: `digits_mod(51133)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "77f8a6c7c07ca695"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 6\nfor i in range(-3, 11, 1):\n s += i * 1\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 6\nfor i in range(-3, 11, 1):\n s += i * 1\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "6eedac7dd5815512", "answer": "55\n10", "completion": " الناتج:\n```text\n55\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert only_div([8, 13, 29, 84, 89, 14, 51, 55, 69, 30]) == 4", "assert only_div([-15, -14, 21, 14, 81, 11]) == 2", "assert only_div([]) == 0", "assert only_div([50, 28, -12, -3, -9, -1]) == 3", "assert only_div([13, 11, -12, 58, -17, -31, -15, -40, 58, 54, 75, -37]) == 4", "assert only_div([60, -28, 73, 48, 9, 23, 23, 4]) == 4", "assert only_div([]) == 0"], "test_code": "assert only_div([8, 13, 29, 84, 89, 14, 51, 55, 69, 30]) == 4\nassert only_div([-15, -14, 21, 14, 81, 11]) == 2\nassert only_div([]) == 0\nassert only_div([50, 28, -12, -3, -9, -1]) == 3\nassert only_div([13, 11, -12, 58, -17, -31, -15, -40, 58, 54, 75, -37]) == 4\nassert only_div([60, -28, 73, 48, 9, 23, 23, 4]) == 4\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 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 % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 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([8, 13, 29, 84, 89, 14, 51, 55, 69, 30])` يُرجع `4`.\nالجواب:", "qhash": "3be89f9d50eeadc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'abhr'}", "tests": ["assert letter_stats('signal by on it') == {'a': 1, 'b': 1, 'h': 0, 'r': 0}", "assert letter_stats('window') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}", "assert letter_stats('signal camel go') == {'a': 2, 'b': 0, 'h': 0, 'r': 0}", "assert letter_stats('apple winter river') == {'a': 1, 'b': 0, 'h': 0, 'r': 3}", "assert letter_stats('apple we banana') == {'a': 4, 'b': 1, 'h': 0, 'r': 0}", "assert letter_stats('python python') == {'a': 0, 'b': 0, 'h': 2, 'r': 0}", "assert letter_stats('') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}"], "test_code": "assert letter_stats('signal by on it') == {'a': 1, 'b': 1, 'h': 0, 'r': 0}\nassert letter_stats('window') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}\nassert letter_stats('signal camel go') == {'a': 2, 'b': 0, 'h': 0, 'r': 0}\nassert letter_stats('apple winter river') == {'a': 1, 'b': 0, 'h': 0, 'r': 3}\nassert letter_stats('apple we banana') == {'a': 4, 'b': 1, 'h': 0, 'r': 0}\nassert letter_stats('python python') == {'a': 0, 'b': 0, 'h': 2, 'r': 0}\nassert letter_stats('') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'abhr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'abhr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'b'، 'h'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('signal by on it')` يجب أن تُرجع `{'a': 1, 'b': 1, 'h': 0, 'r': 0}`.\nالجواب:", "qhash": "e56e16678f1018c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=9):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(calc(-9))\nprint(calc(-9, 1))\nprint(calc(calc(1), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=9):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(calc(-9))\nprint(calc(-9, 1))\nprint(calc(calc(1), -9))\n```\nالجواب:", "qhash": "e6b281dd422e21ea", "answer": "-18\n-10\n17", "completion": " الناتج:\n```text\n-18\n-10\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert cycle([49, 50, 22, 21, 7, 5, 1]) == [50, 22, 21, 7, 5, 1, 49]", "assert cycle([-1, -5, 15, 24]) == [-1, -5, 15, 24]", "assert cycle([23, 36, 20, 26, 26, 13, -4, 27, 5, 2, 0]) == [5, 2, 0, 23, 36, 20, 26, 26, 13, -4, 27]", "assert cycle([23, 20]) == [23, 20]", "assert cycle([47, 30, 13, 19, 1, -4, 6, 50, -4, 50]) == [-4, 50, 47, 30, 13, 19, 1, -4, 6, 50]", "assert cycle([-8]) == [-8]", "assert cycle([]) == []"], "test_code": "assert cycle([49, 50, 22, 21, 7, 5, 1]) == [50, 22, 21, 7, 5, 1, 49]\nassert cycle([-1, -5, 15, 24]) == [-1, -5, 15, 24]\nassert cycle([23, 36, 20, 26, 26, 13, -4, 27, 5, 2, 0]) == [5, 2, 0, 23, 36, 20, 26, 26, 13, -4, 27]\nassert cycle([23, 20]) == [23, 20]\nassert cycle([47, 30, 13, 19, 1, -4, 6, 50, -4, 50]) == [-4, 50, 47, 30, 13, 19, 1, -4, 6, 50]\nassert cycle([-8]) == [-8]\nassert cycle([]) == []", "answer": "def cycle(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef cycle(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return ____\n```\nمثال: `cycle([49, 50, 22, 21, 7, 5, 1])` يجب أن تُرجع `[50, 22, 21, 7, 5, 1, 49]`.\nالجواب:", "qhash": "7224961babb23076"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [31, 34, 2, 22, 4, 25, 15, 17]\nprint(data[0:1])\nprint(data[::3])\nprint(max(data[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [31, 34, 2, 22, 4, 25, 15, 17]\nprint(data[0:1])\nprint(data[::3])\nprint(max(data[0:1]))\n```\nالجواب:", "qhash": "19691fddad6042a7", "answer": "[31]\n[31, 22, 15]\n31", "completion": " الناتج:\n```text\n[31]\n[31, 22, 15]\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-20, 31, 16, 18]) == 16", "assert best_multiple([-40, -24, -16]) == -16", "assert best_multiple([1, 9, 17]) == None", "assert best_multiple([9, -34, 20]) == None", "assert best_multiple([15, 5, -4, -32, -32]) == -32", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-20, 31, 16, 18]) == 16\nassert best_multiple([-40, -24, -16]) == -16\nassert best_multiple([1, 9, 17]) == None\nassert best_multiple([9, -34, 20]) == None\nassert best_multiple([15, 5, -4, -32, -32]) == -32\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(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للتوضيح: الاستدعاء `best_multiple([-20, 31, 16, 18])` يُرجع `16`.\nالجواب:", "qhash": "5b7d7dba95982349"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-5))\nprint(calc(-5, -2))\nprint(calc(calc(-2), -5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-5))\nprint(calc(-5, -2))\nprint(calc(calc(-2), -5))\n```\nالجواب:", "qhash": "1c579f03b6971a6a", "answer": "1\n-11\n17", "completion": " الناتج:\n```text\n1\n-11\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([-14, 0, 14, 39, 28, 59, 16, 33]) == 28", "assert max_multiple([-28, -35, -7]) == -7", "assert max_multiple([1, 8]) == None", "assert max_multiple([-3, 17]) == None", "assert max_multiple([-6, 12, -3, -12, -29, -17, -6, -17]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-14, 0, 14, 39, 28, 59, 16, 33]) == 28\nassert max_multiple([-28, -35, -7]) == -7\nassert max_multiple([1, 8]) == None\nassert max_multiple([-3, 17]) == None\nassert max_multiple([-6, 12, -3, -12, -29, -17, -6, -17]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_multiple([-14, 0, 14, 39, 28, 59, 16, 33])` يجب أن تُرجع `28`.\nالجواب:", "qhash": "ec43bccc3f6ff3f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'eils'}", "tests": ["assert freq_of('python code up data') == {'e': 1, 'i': 0, 'l': 0, 's': 0}", "assert freq_of('an summer window up orange falcon') == {'e': 2, 'i': 1, 'l': 1, 's': 1}", "assert freq_of('falcon pixel river brain') == {'e': 2, 'i': 3, 'l': 2, 's': 0}", "assert freq_of('a planet garden camel in rocket') == {'e': 4, 'i': 1, 'l': 2, 's': 0}", "assert freq_of('river of') == {'e': 1, 'i': 1, 'l': 0, 's': 0}", "assert freq_of('of at matrix pixel summer') == {'e': 2, 'i': 2, 'l': 1, 's': 1}", "assert freq_of('') == {'e': 0, 'i': 0, 'l': 0, 's': 0}"], "test_code": "assert freq_of('python code up data') == {'e': 1, 'i': 0, 'l': 0, 's': 0}\nassert freq_of('an summer window up orange falcon') == {'e': 2, 'i': 1, 'l': 1, 's': 1}\nassert freq_of('falcon pixel river brain') == {'e': 2, 'i': 3, 'l': 2, 's': 0}\nassert freq_of('a planet garden camel in rocket') == {'e': 4, 'i': 1, 'l': 2, 's': 0}\nassert freq_of('river of') == {'e': 1, 'i': 1, 'l': 0, 's': 0}\nassert freq_of('of at matrix pixel summer') == {'e': 2, 'i': 2, 'l': 1, 's': 1}\nassert freq_of('') == {'e': 0, 'i': 0, 'l': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'eils'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'eils'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'i'، 'l'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('python code up data')` يُرجع `{'e': 1, 'i': 0, 'l': 0, 's': 0}`.\nالجواب:", "qhash": "eb9617b8ec3bbbaf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([-21, 12, 40, -22]) == None", "assert max_div([-18, -27, -36]) == -18", "assert max_div([1, 10, 19]) == None", "assert max_div([40]) == None", "assert max_div([16, 0, 1, 42, -44, 13, 3, 49, -50]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([-21, 12, 40, -22]) == None\nassert max_div([-18, -27, -36]) == -18\nassert max_div([1, 10, 19]) == None\nassert max_div([40]) == None\nassert max_div([16, 0, 1, 42, -44, 13, 3, 49, -50]) == 0\nassert max_div([]) == None", "answer": "def max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([-21, 12, 40, -22])` يُرجع `None`.\nالجواب:", "qhash": "8456f10a80f12322"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 5) // 4 for x in range(1, 6) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 5) // 4 for x in range(1, 6) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e7afc7119bd6cb4b", "answer": "[1, 2]\n2 3", "completion": " الناتج:\n```text\n[1, 2]\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 2 for x in xs if 19 <= x <= 26)", "tests": ["assert filter_range([21, 16, 28, 10, 27, 30, 34, 27, 36, 13]) == [42]", "assert filter_range([]) == []", "assert filter_range([36, 18]) == []", "assert filter_range([12, -28, -29]) == []", "assert filter_range([34, 21, -29, 41, 45, 42]) == [42]", "assert filter_range([-18]) == []", "assert filter_range([38, 58, -16, 0, 9, 48, -11, 56, 5, -15]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([21, 16, 28, 10, 27, 30, 34, 27, 36, 13]) == [42]\nassert filter_range([]) == []\nassert filter_range([36, 18]) == []\nassert filter_range([12, -28, -29]) == []\nassert filter_range([34, 21, -29, 41, 45, 42]) == [42]\nassert filter_range([-18]) == []\nassert filter_range([38, 58, -16, 0, 9, 48, -11, 56, 5, -15]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 2 for x in xs if 19 <= x <= 26)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 2 for x in xs if 19 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 19 ≤ x ≤ 26، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([21, 16, 28, 10, 27, 30, 34, 27, 36, 13])` يُرجع `[42]`.\nالجواب:", "qhash": "eff0ff20fb68bbca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 17\nfor x in range(-1, 13, 3):\n total -= x * 2\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 17\nfor x in range(-1, 13, 3):\n total -= x * 2\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "c86851846fe3ca5a", "answer": "-33\n11", "completion": " الناتج:\n```text\n-33\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'bdr'}", "tests": ["assert char_freq('python data window an winter') == {'b': 0, 'd': 2, 'r': 1}", "assert char_freq('brain stone up winter') == {'b': 1, 'd': 0, 'r': 2}", "assert char_freq('cloud music pixel of') == {'b': 0, 'd': 1, 'r': 0}", "assert char_freq('on data brain signal planet up') == {'b': 1, 'd': 1, 'r': 1}", "assert char_freq('to') == {'b': 0, 'd': 0, 'r': 0}", "assert char_freq('window is cloud up up go') == {'b': 0, 'd': 2, 'r': 0}", "assert char_freq('') == {'b': 0, 'd': 0, 'r': 0}"], "test_code": "assert char_freq('python data window an winter') == {'b': 0, 'd': 2, 'r': 1}\nassert char_freq('brain stone up winter') == {'b': 1, 'd': 0, 'r': 2}\nassert char_freq('cloud music pixel of') == {'b': 0, 'd': 1, 'r': 0}\nassert char_freq('on data brain signal planet up') == {'b': 1, 'd': 1, 'r': 1}\nassert char_freq('to') == {'b': 0, 'd': 0, 'r': 0}\nassert char_freq('window is cloud up up go') == {'b': 0, 'd': 2, 'r': 0}\nassert char_freq('') == {'b': 0, 'd': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'bdr'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'bdr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'd'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('python data window an winter')` يُرجع `{'b': 0, 'd': 2, 'r': 1}`.\nالجواب:", "qhash": "287742777e32f3b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'نور عمل'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ل'))\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'نور عمل'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ل'))\nprint(kalima[-1])\n```\nالجواب:", "qhash": "4e7316b3d08a60b4", "answer": "6\n1\nل", "completion": " الناتج:\n```text\n6\n1\nل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(-8))\nprint(f(-8, 3))\nprint(f(f(3), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(-8))\nprint(f(-8, 3))\nprint(f(f(3), -8))\n```\nالجواب:", "qhash": "8f254808a1375a5d", "answer": "-3\n7\n78", "completion": " الناتج:\n```text\n-3\n7\n78\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19", "tests": ["assert rec_prod(4) == 8", "assert rec_prod(58) == 0", "assert rec_prod(26) == 10", "assert rec_prod(11) == 2", "assert rec_prod(26) == 10", "assert rec_prod(5) == 15", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(4) == 8\nassert rec_prod(58) == 0\nassert rec_prod(26) == 10\nassert rec_prod(11) == 2\nassert rec_prod(26) == 10\nassert rec_prod(5) == 15\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(4)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "b96ec1231bf8c1da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'pixel_signal'\nprint(text.split('_'))\nprint(text.replace('l', '#'))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'pixel_signal'\nprint(text.split('_'))\nprint(text.replace('l', '#'))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "e2b799cc628f9673", "answer": "['pixel', 'signal']\npixe#_signa#\nPixel_signal", "completion": " الناتج:\n```text\n['pixel', 'signal']\npixe#_signa#\nPixel_signal\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert div_not([48, 24, 25, 56, 43, 22, 86, 60, 73, 87, 51, 90]) == 0", "assert div_not([72, 20, -31, 46, 70, 26]) == 0", "assert div_not([]) == 0", "assert div_not([59, -2, 54, 3]) == 0", "assert div_not([10, 42, 30, 79, 48, -34, 53, 88, 0, 72, 45]) == 0", "assert div_not([-2, 0, 9, -31, 35, 36, 80, 67, -24]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([48, 24, 25, 56, 43, 22, 86, 60, 73, 87, 51, 90]) == 0\nassert div_not([72, 20, -31, 46, 70, 26]) == 0\nassert div_not([]) == 0\nassert div_not([59, -2, 54, 3]) == 0\nassert div_not([10, 42, 30, 79, 48, -34, 53, 88, 0, 72, 45]) == 0\nassert div_not([-2, 0, 9, -31, 35, 36, 80, 67, -24]) == 0\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 2، واكتب الدالة بعد إكمالها.\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([48, 24, 25, 56, 43, 22, 86, 60, 73, 87, 51, 90])` يُرجع `0`.\nالجواب:", "qhash": "0215fe741936b6e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 83", "tests": ["assert rec_prod(11) == 65", "assert rec_prod(44) == 48", "assert rec_prod(42) == 43", "assert rec_prod(4) == 4", "assert rec_prod(54) == 48", "assert rec_prod(53) == 77", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 65\nassert rec_prod(44) == 48\nassert rec_prod(42) == 43\nassert rec_prod(4) == 4\nassert rec_prod(54) == 48\nassert rec_prod(53) == 77\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 83", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 83\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 83 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(11)` يجب أن تُرجع `65`.\nالجواب:", "qhash": "9f323e176536f849"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ه'))", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ه'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ه'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه».\nمثال: `letter_count('ليل رمل باب شجرة وردة رمل ليل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e70721cc93ad8db3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [-6, 0, 27, 40, 2, -9, 4, 0, -1]\nprint(lst[0:6])\nprint(lst[::3])\nprint(len(lst[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [-6, 0, 27, 40, 2, -9, 4, 0, -1]\nprint(lst[0:6])\nprint(lst[::3])\nprint(len(lst[0:6]))\n```\nالجواب:", "qhash": "dba864c73572653d", "answer": "[-6, 0, 27, 40, 2, -9]\n[-6, 40, 4]\n6", "completion": " الناتج:\n```text\n[-6, 0, 27, 40, 2, -9]\n[-6, 40, 4]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'coffee'\nprint(name.upper())\nprint(name.capitalize())\nprint(name.index('c') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'coffee'\nprint(name.upper())\nprint(name.capitalize())\nprint(name.index('c') + len(name))\n```\nالجواب:", "qhash": "dfd5bd218f3d7247", "answer": "COFFEE\nCoffee\n6", "completion": " الناتج:\n```text\nCOFFEE\nCoffee\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "invert_words", "reference": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert invert_words('brain brain python in brain signal') == 'signal/brain/python/brain/brain'", "assert invert_words('a river engine planet to') == 'planet/engine/river'", "assert invert_words('by code') == 'code'", "assert invert_words('') == ''", "assert invert_words('winter python orange matrix on matrix an') == 'matrix/matrix/orange/python/winter'", "assert invert_words('stone we falcon camel winter winter') == 'winter/winter/camel/falcon/stone'", "assert invert_words('it engine an table') == 'table/engine'"], "test_code": "assert invert_words('brain brain python in brain signal') == 'signal/brain/python/brain/brain'\nassert invert_words('a river engine planet to') == 'planet/engine/river'\nassert invert_words('by code') == 'code'\nassert invert_words('') == ''\nassert invert_words('winter python orange matrix on matrix an') == 'matrix/matrix/orange/python/winter'\nassert invert_words('stone we falcon camel winter winter') == 'winter/winter/camel/falcon/stone'\nassert invert_words('it engine an table') == 'table/engine'", "answer": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `invert_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `invert_words('brain brain python in brain signal')` يجب أن تُرجع `'signal/brain/python/brain/brain'`.\nالجواب:", "qhash": "4d42f65e9d793293"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 42262\ncount = 0\nwhile n > 17:\n n = n // 3\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 42262\ncount = 0\nwhile n > 17:\n n = n // 3\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "b5ca8ca8b9b8a6b8", "answer": "6 8", "completion": " الناتج:\n```text\n6 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 8 * x ** 2 + (6) * x + (6)", "tests": ["assert eval_poly(2) == 50", "assert eval_poly(12) == 1230", "assert eval_poly(-5) == 176", "assert eval_poly(3) == 96", "assert eval_poly(-2) == 26", "assert eval_poly(-16) == 1958", "assert eval_poly(-4) == 110", "assert eval_poly(0) == 6"], "test_code": "assert eval_poly(2) == 50\nassert eval_poly(12) == 1230\nassert eval_poly(-5) == 176\nassert eval_poly(3) == 96\nassert eval_poly(-2) == 26\nassert eval_poly(-16) == 1958\nassert eval_poly(-4) == 110\nassert eval_poly(0) == 6", "answer": "def eval_poly(x):\n return 8 * x ** 2 + (6) * x + (6)", "completion": " ```python\ndef eval_poly(x):\n return 8 * x ** 2 + (6) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 8x² + 6x + 6 عند العدد الصحيح x.\nمثال: `eval_poly(2)` يجب أن تُرجع `50`.\nالجواب:", "qhash": "6f80264bc418e5eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 6 * x ** 2 + (-9) * x + (-8)", "tests": ["assert value_at(1) == -11", "assert value_at(-5) == 187", "assert value_at(0) == -8", "assert value_at(-6) == 262", "assert value_at(6) == 154", "assert value_at(-20) == 2572", "assert value_at(0) == -8", "assert value_at(0) == -8"], "test_code": "assert value_at(1) == -11\nassert value_at(-5) == 187\nassert value_at(0) == -8\nassert value_at(-6) == 262\nassert value_at(6) == 154\nassert value_at(-20) == 2572\nassert value_at(0) == -8\nassert value_at(0) == -8", "answer": "def value_at(x):\n return 6 * x ** 2 + (-9) * x + (-8)", "completion": " ```python\ndef value_at(x):\n return 6 * x ** 2 + (-9) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 6x² - 9x - 8 عند العدد الصحيح x.\nمثال: `value_at(1)` يجب أن تُرجع `-11`.\nالجواب:", "qhash": "22d6dcad3ae198f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سفينة'\nprint(text[0])\nprint(text.find('ا'))\nprint(text.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سفينة'\nprint(text[0])\nprint(text.find('ا'))\nprint(text.split())\n```\nالجواب:", "qhash": "1bbeffb845e2d8bc", "answer": "س\n-1\n['سفينة']", "completion": " الناتج:\n```text\nس\n-1\n['سفينة']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 6 for x in range(-4, 4) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 6 for x in range(-4, 4) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "eb08755c45dd262a", "answer": "[3, -5]\n2 -2", "completion": " الناتج:\n```text\n[3, -5]\n2 -2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 15 == 0)", "tests": ["assert total_multiples(182) == 4950", "assert total_multiples(78) == 925", "assert total_multiples(147) == 3159", "assert total_multiples(77) == 925", "assert total_multiples(226) == 7824", "assert total_multiples(284) == 11905", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(182) == 4950\nassert total_multiples(78) == 925\nassert total_multiples(147) == 3159\nassert total_multiples(77) == 925\nassert total_multiples(226) == 7824\nassert total_multiples(284) == 11905\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 15 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(182)` يُرجع `4950`.\nالجواب:", "qhash": "158af7ecf63759b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'زينب': 13, 'أحمد': 11, 'نور': 24, 'عمر': 19}\npoints['عمر'] += 4\npoints['يوسف'] = 4\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'زينب': 13, 'أحمد': 11, 'نور': 24, 'عمر': 19}\npoints['عمر'] += 4\npoints['يوسف'] = 4\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('علي', -1))\n```\nالجواب:", "qhash": "f77764da0eab75a8", "answer": "5\nنور\n75\n-1", "completion": " الناتج:\n```text\n5\nنور\n75\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'code'\nprint(word.capitalize())\nprint(word.count('d'))\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'code'\nprint(word.capitalize())\nprint(word.count('d'))\nprint(len(word))\n```\nالجواب:", "qhash": "4bffa72209ac8c6f", "answer": "Code\n1\n4", "completion": " الناتج:\n```text\nCode\n1\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة نهار قلم دفتر') == 2", "assert count_start('قمر مدرسة') == 1", "assert count_start('قمر مدرسة قمر قهوة') == 3", "assert count_start('كتاب لغة قلم صحراء') == 1", "assert count_start('ميناء برمجة ليل') == 0", "assert count_start('جبل ليل نهار مطر قهوة علم سماء') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('قهوة نهار قلم دفتر') == 2\nassert count_start('قمر مدرسة') == 1\nassert count_start('قمر مدرسة قمر قهوة') == 3\nassert count_start('كتاب لغة قلم صحراء') == 1\nassert count_start('ميناء برمجة ليل') == 0\nassert count_start('جبل ليل نهار مطر قهوة علم سماء') == 1\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.split():\n if w.endswith('ق'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ق»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ق'):\n count += 1\n return count\n```\nمثال: `count_start('قهوة نهار قلم دفتر')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "9d60748223dea9e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 1:\n return 3\n return 2 * go(n - 1) + 0\n\nprint(go(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 1:\n return 3\n return 2 * go(n - 1) + 0\n\nprint(go(8))\n```\nالجواب:", "qhash": "29126e008a26bfa3", "answer": "384", "completion": " الناتج:\n```text\n384\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([-11, -29, 31, -14, 39]) == -11", "assert find_max_div([-44, -44, -55]) == -44", "assert find_max_div([1, 12]) == None", "assert find_max_div([4]) == None", "assert find_max_div([32, 16, 15, 23, 43]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-11, -29, 31, -14, 39]) == -11\nassert find_max_div([-44, -44, -55]) == -44\nassert find_max_div([1, 12]) == None\nassert find_max_div([4]) == None\nassert find_max_div([32, 16, 15, 23, 43]) == None\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_div(nums):\n best = 0\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 find_max_div(nums):\n best = 0\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للتوضيح: الاستدعاء `find_max_div([-11, -29, 31, -14, 39])` يُرجع `-11`.\nالجواب:", "qhash": "916bf5f63208ef9b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'حديقة'\nprint(len(s.replace(' ', '')))\nprint(s.split())\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'حديقة'\nprint(len(s.replace(' ', '')))\nprint(s.split())\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "69637e8f94ce286b", "answer": "5\n['حديقة']\nحديقة", "completion": " الناتج:\n```text\n5\n['حديقة']\nحديقة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 2:\n return n + 2\n return f(n - 1) + f(n - 2)\n\nprint(f(8))", "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(8))\n```\nالجواب:", "qhash": "4c6c39e74bfe6432", "answer": "89", "completion": " الناتج:\n```text\n89\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 2 + 1 for x in range(5, 15) if x % 5 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 2 + 1 for x in range(5, 15) if x % 5 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "3a908713278ff208", "answer": "[11, 21]\n2 32", "completion": " الناتج:\n```text\n[11, 21]\n2 32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert series(8) == 14256", "assert series(6) == 4851", "assert series(7) == 8624", "assert series(5) == 2475", "assert series(5) == 2475", "assert series(1) == 11", "assert series(0) == 0"], "test_code": "assert series(8) == 14256\nassert series(6) == 4851\nassert series(7) == 8624\nassert series(5) == 2475\nassert series(5) == 2475\nassert series(1) == 11\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `series(8)` يُرجع `14256`.\nالجواب:", "qhash": "2b54230b8cbff7db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 6\nfor j in range(-4, 18, 2):\n s -= j * 8\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 6\nfor j in range(-4, 18, 2):\n s -= j * 8\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "dbc307e5ba6084e9", "answer": "-522\n16", "completion": " الناتج:\n```text\n-522\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 93", "tests": ["assert sum_digit_pow(86269) == 31", "assert sum_digit_pow(130627) == 19", "assert sum_digit_pow(794008) == 28", "assert sum_digit_pow(323072) == 17", "assert sum_digit_pow(794661) == 33", "assert sum_digit_pow(817743) == 30", "assert sum_digit_pow(140602) == 13", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(86269) == 31\nassert sum_digit_pow(130627) == 19\nassert sum_digit_pow(794008) == 28\nassert sum_digit_pow(323072) == 17\nassert sum_digit_pow(794661) == 33\nassert sum_digit_pow(817743) == 30\nassert sum_digit_pow(140602) == 13\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 93", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 93\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 93.\nمثال: `sum_digit_pow(86269)` يجب أن تُرجع `31`.\nالجواب:", "qhash": "b8ac4f1279558599"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 13\nfor i in range(9, 20, 1):\n s -= i * 8\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 13\nfor i in range(9, 20, 1):\n s -= i * 8\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "dc33c7027bef2e15", "answer": "-1219\n19", "completion": " الناتج:\n```text\n-1219\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total", "tests": ["assert weighted_sum(8) == 15552", "assert weighted_sum(12) == 73008", "assert weighted_sum(7) == 9408", "assert weighted_sum(12) == 73008", "assert weighted_sum(12) == 73008", "assert weighted_sum(1) == 12", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 15552\nassert weighted_sum(12) == 73008\nassert weighted_sum(7) == 9408\nassert weighted_sum(12) == 73008\nassert weighted_sum(12) == 73008\nassert weighted_sum(1) == 12\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 3\n return total\n```\nمثال: `weighted_sum(8)` يجب أن تُرجع `15552`.\nالجواب:", "qhash": "980396f87d3f6344"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(20) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo', 'Bar', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'Foo', '19', 'Foo']", "assert fizzbuzz(10) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo']", "assert fizzbuzz(4) == ['1', 'Foo', '3', 'Foo']", "assert fizzbuzz(10) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo']", "assert fizzbuzz(23) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo', 'Bar', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'Foo', '19', 'Foo', '21', 'FooBar', '23']"], "test_code": "assert fizzbuzz(20) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo', 'Bar', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'Foo', '19', 'Foo']\nassert fizzbuzz(10) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo']\nassert fizzbuzz(4) == ['1', 'Foo', '3', 'Foo']\nassert fizzbuzz(10) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo']\nassert fizzbuzz(23) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo', 'Bar', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'Foo', '19', 'Foo', '21', 'FooBar', '23']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Foo'، وإن قَبِلها على 11 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(20)` يُرجع `['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'Foo', 'Bar', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'Foo', '19', 'Foo']`.\nالجواب:", "qhash": "16b07c4971c33083"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67", "tests": ["assert prod_mod(12) == 49", "assert prod_mod(59) == 13", "assert prod_mod(45) == 47", "assert prod_mod(29) == 62", "assert prod_mod(50) == 33", "assert prod_mod(48) == 38", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(12) == 49\nassert prod_mod(59) == 13\nassert prod_mod(45) == 47\nassert prod_mod(29) == 62\nassert prod_mod(50) == 33\nassert prod_mod(48) == 38\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(12)` يجب أن تُرجع `49`.\nالجواب:", "qhash": "ec7572577b3b8d5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 15) == 1)", "tests": ["assert count_coprime(46) == 25", "assert count_coprime(53) == 29", "assert count_coprime(44) == 24", "assert count_coprime(3) == 2", "assert count_coprime(190) == 101", "assert count_coprime(72) == 38", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(46) == 25\nassert count_coprime(53) == 29\nassert count_coprime(44) == 24\nassert count_coprime(3) == 2\nassert count_coprime(190) == 101\nassert count_coprime(72) == 38\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, 15) == 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, 15) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 15، أي أن القاسم المشترك الأكبر لها مع 15 يساوي 1.\nمثال: `count_coprime(46)` يجب أن تُرجع `25`.\nالجواب:", "qhash": "32d9365f29a82faf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 61", "tests": ["assert step_product(9) == 40", "assert step_product(12) == 53", "assert step_product(48) == 3", "assert step_product(48) == 3", "assert step_product(53) == 38", "assert step_product(20) == 52", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 40\nassert step_product(12) == 53\nassert step_product(48) == 3\nassert step_product(48) == 3\nassert step_product(53) == 38\nassert step_product(20) == 52\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 61", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(9)` يُرجع `40`.\nالجواب:", "qhash": "01ee0e5cc0f6ffae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate([1, 29, 37, 47, 36, 35, 44, 1]) == [1, 29, 37, 47, 36, 35, 44, 1]", "assert rotate([5, -2, 16, 49, -4, 2, -4]) == [16, 49, -4, 2, -4, 5, -2]", "assert rotate([36, 36, 23, -5, 5]) == [36, 23, -5, 5, 36]", "assert rotate([22]) == [22]", "assert rotate([2, 7, 24, -1, 40, 6, 44, 47]) == [2, 7, 24, -1, 40, 6, 44, 47]", "assert rotate([16, 45, 20, 41, 25, 13]) == [25, 13, 16, 45, 20, 41]", "assert rotate([]) == []"], "test_code": "assert rotate([1, 29, 37, 47, 36, 35, 44, 1]) == [1, 29, 37, 47, 36, 35, 44, 1]\nassert rotate([5, -2, 16, 49, -4, 2, -4]) == [16, 49, -4, 2, -4, 5, -2]\nassert rotate([36, 36, 23, -5, 5]) == [36, 23, -5, 5, 36]\nassert rotate([22]) == [22]\nassert rotate([2, 7, 24, -1, 40, 6, 44, 47]) == [2, 7, 24, -1, 40, 6, 44, 47]\nassert rotate([16, 45, 20, 41, 25, 13]) == [25, 13, 16, 45, 20, 41]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nمثال: `rotate([1, 29, 37, 47, 36, 35, 44, 1])` يجب أن تُرجع `[1, 29, 37, 47, 36, 35, 44, 1]`.\nالجواب:", "qhash": "8031e8f82ee79bed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'orange_python'\nprint(name.find('r'))\nprint(name.upper())\nprint(name.index('r') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'orange_python'\nprint(name.find('r'))\nprint(name.upper())\nprint(name.index('r') + len(name))\n```\nالجواب:", "qhash": "e032184f73a3548c", "answer": "1\nORANGE_PYTHON\n14", "completion": " الناتج:\n```text\n1\nORANGE_PYTHON\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 17\nfor i in range(5, 19, 1):\n s -= i * 7\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 17\nfor i in range(5, 19, 1):\n s -= i * 7\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "f37eff3d720b1f7f", "answer": "-1110\n18", "completion": " الناتج:\n```text\n-1110\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)", "tests": ["assert multiples_total(128) == 2901", "assert multiples_total(207) == 7565", "assert multiples_total(57) == 588", "assert multiples_total(241) == 10477", "assert multiples_total(256) == 11466", "assert multiples_total(6) == 4", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(128) == 2901\nassert multiples_total(207) == 7565\nassert multiples_total(57) == 588\nassert multiples_total(241) == 10477\nassert multiples_total(256) == 11466\nassert multiples_total(6) == 4\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 7.\nمثال: `multiples_total(128)` يجب أن تُرجع `2901`.\nالجواب:", "qhash": "53548c3d9b134538"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 85) == 1)", "tests": ["assert coprime_count(99) == 76", "assert coprime_count(120) == 90", "assert coprime_count(146) == 110", "assert coprime_count(86) == 65", "assert coprime_count(181) == 137", "assert coprime_count(11) == 9", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(99) == 76\nassert coprime_count(120) == 90\nassert coprime_count(146) == 110\nassert coprime_count(86) == 65\nassert coprime_count(181) == 137\nassert coprime_count(11) == 9\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, 85) == 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, 85) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 85) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(99)` يُرجع `76`.\nالجواب:", "qhash": "58b865c17dfe988b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 20 <= x <= 50)", "tests": ["assert pick_between([53, 16, 33, 36, 20, 58]) == [60, 99, 108]", "assert pick_between([-7, 3, -30]) == []", "assert pick_between([-28, 21, 50, -20, 49, -7]) == [63, 147, 150]", "assert pick_between([56, 26, 18, -21, 53, 31, 32, -10, -29, -12]) == [78, 93, 96]", "assert pick_between([31, 12, 22, 38, -10]) == [66, 93, 114]", "assert pick_between([16, 15, 47, 6, -28, -13, 40]) == [120, 141]", "assert pick_between([]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([53, 16, 33, 36, 20, 58]) == [60, 99, 108]\nassert pick_between([-7, 3, -30]) == []\nassert pick_between([-28, 21, 50, -20, 49, -7]) == [63, 147, 150]\nassert pick_between([56, 26, 18, -21, 53, 31, 32, -10, -29, -12]) == [78, 93, 96]\nassert pick_between([31, 12, 22, 38, -10]) == [66, 93, 114]\nassert pick_between([16, 15, 47, 6, -28, -13, 40]) == [120, 141]\nassert pick_between([]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 20 <= x <= 50)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 3 for x in xs if 20 <= x <= 50)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 50، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([53, 16, 33, 36, 20, 58])` يُرجع `[60, 99, 108]`.\nالجواب:", "qhash": "8ac8cfb476992e8a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert reverse_words('python rocket signal') == 'signal/rocket/python'", "assert reverse_words('matrix matrix up summer falcon') == 'falcon/summer/matrix/matrix'", "assert reverse_words('pixel stone python pixel cloud to coffee data') == 'data/coffee/cloud/pixel/python/stone/pixel'", "assert reverse_words('summer it pixel') == 'pixel/summer'", "assert reverse_words('') == ''", "assert reverse_words('python desert falcon by it') == 'falcon/desert/python'", "assert reverse_words('river in data') == 'data/river'"], "test_code": "assert reverse_words('python rocket signal') == 'signal/rocket/python'\nassert reverse_words('matrix matrix up summer falcon') == 'falcon/summer/matrix/matrix'\nassert reverse_words('pixel stone python pixel cloud to coffee data') == 'data/coffee/cloud/pixel/python/stone/pixel'\nassert reverse_words('summer it pixel') == 'pixel/summer'\nassert reverse_words('') == ''\nassert reverse_words('python desert falcon by it') == 'falcon/desert/python'\nassert reverse_words('river in data') == 'data/river'", "answer": "def reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `reverse_words('python rocket signal')` يُرجع `'signal/rocket/python'`.\nالجواب:", "qhash": "136a5058aab5ac33"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'بحر'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'بحر'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(kalima[-1])\n```\nالجواب:", "qhash": "6ae7cebcf30c6cc0", "answer": "['بحر']\n3\nر", "completion": " الناتج:\n```text\n['بحر']\n3\nر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 18329\nc = 0\nwhile n > 13:\n n = n // 2\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 18329\nc = 0\nwhile n > 13:\n n = n // 2\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "67a1c4c94530c9d0", "answer": "8 11", "completion": " الناتج:\n```text\n8 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([5, 17, 40, 59, 71, 28, 70, 77, 87, 24]) == 2", "assert div_not([-35, 72, 83, -38, 12, 59, 51, 11, 14]) == 3", "assert div_not([70, 75]) == 0", "assert div_not([87, 47, 40, 4, 61, -25, 26, 74, -32, 81]) == 2", "assert div_not([4, 67]) == 0", "assert div_not([15, -4, 51, 36, 42, 2, 46]) == 3", "assert div_not([]) == 0"], "test_code": "assert div_not([5, 17, 40, 59, 71, 28, 70, 77, 87, 24]) == 2\nassert div_not([-35, 72, 83, -38, 12, 59, 51, 11, 14]) == 3\nassert div_not([70, 75]) == 0\nassert div_not([87, 47, 40, 4, 61, -25, 26, 74, -32, 81]) == 2\nassert div_not([4, 67]) == 0\nassert div_not([15, -4, 51, 36, 42, 2, 46]) == 3\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([5, 17, 40, 59, 71, 28, 70, 77, 87, 24])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "1cbc4f2ead41329d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(914830946))\nprint(go(go(914830946)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(914830946))\nprint(go(go(914830946)))\n```\nالجواب:", "qhash": "014ab52ecf275194", "answer": "44\n8", "completion": " الناتج:\n```text\n44\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 8\nfor n in range(8, 20, 2):\n total -= n * 5\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 8\nfor n in range(8, 20, 2):\n total -= n * 5\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "6d057ed8f4156c6d", "answer": "-382\n18", "completion": " الناتج:\n```text\n-382\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)", "tests": ["assert clip_scale([18, 29, 14, 16, 19, 24, 7, 10, 33]) == [-66, -58, -48, -38, -36, -32, -28, -20]", "assert clip_scale([19, 24, 35]) == [-70, -48, -38]", "assert clip_scale([5, -21, 53, -12]) == []", "assert clip_scale([6, -14, -15, -26, 2]) == []", "assert clip_scale([5, 5, -5, -9, 37, 55]) == [-74]", "assert clip_scale([-19, 39, 11]) == [-78, -22]", "assert clip_scale([-26, 16, 46, -1, 5, 44, 4, 44]) == [-92, -88, -88, -32]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([18, 29, 14, 16, 19, 24, 7, 10, 33]) == [-66, -58, -48, -38, -36, -32, -28, -20]\nassert clip_scale([19, 24, 35]) == [-70, -48, -38]\nassert clip_scale([5, -21, 53, -12]) == []\nassert clip_scale([6, -14, -15, -26, 2]) == []\nassert clip_scale([5, 5, -5, -9, 37, 55]) == [-74]\nassert clip_scale([-19, 39, 11]) == [-78, -22]\nassert clip_scale([-26, 16, 46, -1, 5, 44, 4, 44]) == [-92, -88, -88, -32]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 9 ≤ x ≤ 46، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([18, 29, 14, 16, 19, 24, 7, 10, 33])` يُرجع `[-66, -58, -48, -38, -36, -32, -28, -20]`.\nالجواب:", "qhash": "ad0cfa7695ba83e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'عمر': 23, 'خالد': 17, 'رنا': 37}\nd['عمر'] += 1\nd['ليلى'] = 40\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('وليد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'عمر': 23, 'خالد': 17, 'رنا': 37}\nd['عمر'] += 1\nd['ليلى'] = 40\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('وليد', -1))\n```\nالجواب:", "qhash": "91ebb105f259c600", "answer": "4\nليلى\n118\n-1", "completion": " الناتج:\n```text\n4\nليلى\n118\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'dhim'}", "tests": ["assert freq_of('up go go table a falcon') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}", "assert freq_of('code summer orange matrix light') == {'d': 1, 'h': 1, 'i': 2, 'm': 3}", "assert freq_of('rocket window a') == {'d': 1, 'h': 0, 'i': 1, 'm': 0}", "assert freq_of('we') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}", "assert freq_of('we by summer') == {'d': 0, 'h': 0, 'i': 0, 'm': 2}", "assert freq_of('to') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}", "assert freq_of('') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}"], "test_code": "assert freq_of('up go go table a falcon') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}\nassert freq_of('code summer orange matrix light') == {'d': 1, 'h': 1, 'i': 2, 'm': 3}\nassert freq_of('rocket window a') == {'d': 1, 'h': 0, 'i': 1, 'm': 0}\nassert freq_of('we') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}\nassert freq_of('we by summer') == {'d': 0, 'h': 0, 'i': 0, 'm': 2}\nassert freq_of('to') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}\nassert freq_of('') == {'d': 0, 'h': 0, 'i': 0, 'm': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'dhim'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'dhim'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'h'، 'i'، 'm' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('up go go table a falcon')` يجب أن تُرجع `{'d': 0, 'h': 0, 'i': 0, 'm': 0}`.\nالجواب:", "qhash": "365688663b4bb801"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(19))\nprint(compute(19, 11))\nprint(compute(compute(11), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(19))\nprint(compute(19, 11))\nprint(compute(compute(11), 19))\n```\nالجواب:", "qhash": "38957a9225a1ec7b", "answer": "168\n160\n845", "completion": " الناتج:\n```text\n168\n160\n845\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 3\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 + 3\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(11))\n```\nالجواب:", "qhash": "5b5216f8f1114bef", "answer": "521", "completion": " الناتج:\n```text\n521\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'itu'}", "tests": ["assert tally('coffee music we is coffee') == {'i': 2, 't': 0, 'u': 1}", "assert tally('at winter') == {'i': 1, 't': 2, 'u': 0}", "assert tally('rocket') == {'i': 0, 't': 1, 'u': 0}", "assert tally('on is banana desert code in') == {'i': 2, 't': 1, 'u': 0}", "assert tally('to') == {'i': 0, 't': 1, 'u': 0}", "assert tally('orange summer rocket desert brain') == {'i': 1, 't': 2, 'u': 1}", "assert tally('') == {'i': 0, 't': 0, 'u': 0}"], "test_code": "assert tally('coffee music we is coffee') == {'i': 2, 't': 0, 'u': 1}\nassert tally('at winter') == {'i': 1, 't': 2, 'u': 0}\nassert tally('rocket') == {'i': 0, 't': 1, 'u': 0}\nassert tally('on is banana desert code in') == {'i': 2, 't': 1, 'u': 0}\nassert tally('to') == {'i': 0, 't': 1, 'u': 0}\nassert tally('orange summer rocket desert brain') == {'i': 1, 't': 2, 'u': 1}\nassert tally('') == {'i': 0, 't': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'itu'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'itu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'i'، 't'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('coffee music we is coffee')` يجب أن تُرجع `{'i': 2, 't': 0, 'u': 1}`.\nالجواب:", "qhash": "e859a3beaa03c412"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'stone'\nprint(name.count('e'))\nprint(name.find('e'))\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'stone'\nprint(name.count('e'))\nprint(name.find('e'))\nprint(name.split('_'))\n```\nالجواب:", "qhash": "12033af3abd75adf", "answer": "1\n4\n['stone']", "completion": " الناتج:\n```text\n1\n4\n['stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 12\nfor n in range(8, 14, 2):\n result += n * 5\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 12\nfor n in range(8, 14, 2):\n result += n * 5\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "26e38b297c323238", "answer": "162\n12", "completion": " الناتج:\n```text\n162\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('apple matrix brain window') == 'window/brain/matrix/apple'", "assert mirror_words('') == ''", "assert mirror_words('winter coffee stone by in banana falcon') == 'falcon/banana/stone/coffee/winter'", "assert mirror_words('summer to in brain') == 'brain/summer'", "assert mirror_words('garden of rocket music desert an is light') == 'light/desert/music/rocket/garden'", "assert mirror_words('') == ''", "assert mirror_words('python window up data engine') == 'engine/data/window/python'"], "test_code": "assert mirror_words('apple matrix brain window') == 'window/brain/matrix/apple'\nassert mirror_words('') == ''\nassert mirror_words('winter coffee stone by in banana falcon') == 'falcon/banana/stone/coffee/winter'\nassert mirror_words('summer to in brain') == 'brain/summer'\nassert mirror_words('garden of rocket music desert an is light') == 'light/desert/music/rocket/garden'\nassert mirror_words('') == ''\nassert mirror_words('python window up data engine') == 'engine/data/window/python'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `mirror_words('apple matrix brain window')` يُرجع `'window/brain/matrix/apple'`.\nالجواب:", "qhash": "9b0ebe9fedcc6969"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([-3, 51, 2, 54, 60, 11]) == None", "assert largest_div([-14, -7, -21]) == -7", "assert largest_div([1, 8]) == None", "assert largest_div([4, -35, 20, -19, 19, 6]) == -35", "assert largest_div([-39, 29, 29, 49, 17, 34]) == 49", "assert largest_div([]) == None"], "test_code": "assert largest_div([-3, 51, 2, 54, 60, 11]) == None\nassert largest_div([-14, -7, -21]) == -7\nassert largest_div([1, 8]) == None\nassert largest_div([4, -35, 20, -19, 19, 6]) == -35\nassert largest_div([-39, 29, 29, 49, 17, 34]) == 49\nassert largest_div([]) == None", "answer": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `largest_div([-3, 51, 2, 54, 60, 11])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "1c2f4ba7e4cc4e61"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 47) == 1)", "tests": ["assert coprime_count(47) == 46", "assert coprime_count(144) == 141", "assert coprime_count(132) == 130", "assert coprime_count(107) == 105", "assert coprime_count(67) == 66", "assert coprime_count(200) == 196", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(47) == 46\nassert coprime_count(144) == 141\nassert coprime_count(132) == 130\nassert coprime_count(107) == 105\nassert coprime_count(67) == 66\nassert coprime_count(200) == 196\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, 47) == 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, 47) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 47، أي أن القاسم المشترك الأكبر لها مع 47 يساوي 1.\nمثال: `coprime_count(47)` يجب أن تُرجع `46`.\nالجواب:", "qhash": "ae494dcf269f6c82"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('صديق حصان كتاب باب ليل جبل نور') == 1", "assert begin_count('حاسوب رمل دفتر حصان') == 2", "assert begin_count('مكتبة فجر حصان ماء حصان تفاحة') == 2", "assert begin_count('وردة معلم مدينة مدرسة بيت علم') == 0", "assert begin_count('شجرة سفينة قمر ماء حاسوب حاسوب') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('جبل قمر حاسوب بيت سيارة') == 1\nassert begin_count('صديق حصان كتاب باب ليل جبل نور') == 1\nassert begin_count('حاسوب رمل دفتر حصان') == 2\nassert begin_count('مكتبة فجر حصان ماء حصان تفاحة') == 2\nassert begin_count('وردة معلم مدينة مدرسة بيت علم') == 0\nassert begin_count('شجرة سفينة قمر ماء حاسوب حاسوب') == 2\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": "5694bec2b134f1b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 10", "tests": ["assert digits_mod(20164) == 9", "assert digits_mod(553161) == 5", "assert digits_mod(633798) == 4", "assert digits_mod(820810) == 3", "assert digits_mod(377549) == 1", "assert digits_mod(339002) == 1", "assert digits_mod(400373) == 1", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(20164) == 9\nassert digits_mod(553161) == 5\nassert digits_mod(633798) == 4\nassert digits_mod(820810) == 3\nassert digits_mod(377549) == 1\nassert digits_mod(339002) == 1\nassert digits_mod(400373) == 1\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 10", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 10\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 10.\nمثال: `digits_mod(20164)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "8f02b7bcfd92b302"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('winter cloud up camel light OK') == 'bnsyjw hqtzi zu hfrjq qnlmy OK'", "assert rot('up winter cloud !') == 'zu bnsyjw hqtzi !'", "assert rot('by by to pixel in') == 'gd gd yt uncjq ns'", "assert rot('brain window brain is camel') == 'gwfns bnsitb gwfns nx hfrjq'", "assert rot('desert orange pixel stone winter') == 'ijxjwy twfslj uncjq xytsj bnsyjw'", "assert rot('to orange apple is 2024') == 'yt twfslj fuuqj nx 2024'", "assert rot('') == ''"], "test_code": "assert rot('winter cloud up camel light OK') == 'bnsyjw hqtzi zu hfrjq qnlmy OK'\nassert rot('up winter cloud !') == 'zu bnsyjw hqtzi !'\nassert rot('by by to pixel in') == 'gd gd yt uncjq ns'\nassert rot('brain window brain is camel') == 'gwfns bnsitb gwfns nx hfrjq'\nassert rot('desert orange pixel stone winter') == 'ijxjwy twfslj uncjq xytsj bnsyjw'\nassert rot('to orange apple is 2024') == 'yt twfslj fuuqj nx 2024'\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 + (5)) % 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 + (5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('winter cloud up camel light OK')` يُرجع `'bnsyjw hqtzi zu hfrjq qnlmy OK'`.\nالجواب:", "qhash": "0b93a9ec92eebf58"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 7 for x in range(-1, 7) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 7 for x in range(-1, 7) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "243a9e101f3062e8", "answer": "[-6, 29]\n2 23", "completion": " الناتج:\n```text\n[-6, 29]\n2 23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'aghl'}", "tests": ["assert letter_stats('falcon river code light') == {'a': 1, 'g': 1, 'h': 1, 'l': 2}", "assert letter_stats('desert') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}", "assert letter_stats('vector on of vector code') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}", "assert letter_stats('apple window python winter light') == {'a': 1, 'g': 1, 'h': 2, 'l': 2}", "assert letter_stats('up signal summer cloud at') == {'a': 2, 'g': 1, 'h': 0, 'l': 2}", "assert letter_stats('pixel brain') == {'a': 1, 'g': 0, 'h': 0, 'l': 1}", "assert letter_stats('') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}"], "test_code": "assert letter_stats('falcon river code light') == {'a': 1, 'g': 1, 'h': 1, 'l': 2}\nassert letter_stats('desert') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}\nassert letter_stats('vector on of vector code') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}\nassert letter_stats('apple window python winter light') == {'a': 1, 'g': 1, 'h': 2, 'l': 2}\nassert letter_stats('up signal summer cloud at') == {'a': 2, 'g': 1, 'h': 0, 'l': 2}\nassert letter_stats('pixel brain') == {'a': 1, 'g': 0, 'h': 0, 'l': 1}\nassert letter_stats('') == {'a': 0, 'g': 0, 'h': 0, 'l': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'aghl'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'aghl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'g'، 'h'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('falcon river code light')` يُرجع `{'a': 1, 'g': 1, 'h': 1, 'l': 2}`.\nالجواب:", "qhash": "34d29d088039e434"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "tests": ["assert sum_powers(7) == 29008", "assert sum_powers(10) == 220825", "assert sum_powers(1) == 1", "assert sum_powers(8) == 61776", "assert sum_powers(8) == 61776", "assert sum_powers(1) == 1", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(7) == 29008\nassert sum_powers(10) == 220825\nassert sum_powers(1) == 1\nassert sum_powers(8) == 61776\nassert sum_powers(8) == 61776\nassert sum_powers(1) == 1\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 1 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 5\n return total\n```\nمثال: `sum_powers(7)` يجب أن تُرجع `29008`.\nالجواب:", "qhash": "5185ea8cf64fe083"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([3, 83, 5, 79, 17, 30, 69]) == 0", "assert count_matching([-34, 64, 43, -20, 62, 2, -17, -35]) == 1", "assert count_matching([62, 12, -37, 45, 80, -32, 74, -23, -10, -24, 49]) == 1", "assert count_matching([-16, 89, 29, 75, 33, 90, 4]) == 1", "assert count_matching([18, 63, 53, -36, 75, -6]) == 1", "assert count_matching([17, 43, 49]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([3, 83, 5, 79, 17, 30, 69]) == 0\nassert count_matching([-34, 64, 43, -20, 62, 2, -17, -35]) == 1\nassert count_matching([62, 12, -37, 45, 80, -32, 74, -23, -10, -24, 49]) == 1\nassert count_matching([-16, 89, 29, 75, 33, 90, 4]) == 1\nassert count_matching([18, 63, 53, -36, 75, -6]) == 1\nassert count_matching([17, 43, 49]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([3, 83, 5, 79, 17, 30, 69])` يُرجع `0`.\nالجواب:", "qhash": "10d90764cd2545ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([34, 28, 74, 47, 57, 17]) == [34, 62, 136, 183, 0, 17]", "assert acc_reset([12, 49, 139, 156, 63, 93, 160, 175, 137, 33]) == [12, 61, 0, 156, 0, 93, 0, 175, 0, 33]", "assert acc_reset([48, -7, 148, 59, 166, 104, 170, 3]) == [48, 41, 0, 59, 0, 104, 0, 3]", "assert acc_reset([154]) == [154]", "assert acc_reset([168, 32]) == [168, 0]", "assert acc_reset([153, 108, 151, 134, 57, 19]) == [153, 0, 151, 0, 57, 76]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([34, 28, 74, 47, 57, 17]) == [34, 62, 136, 183, 0, 17]\nassert acc_reset([12, 49, 139, 156, 63, 93, 160, 175, 137, 33]) == [12, 61, 0, 156, 0, 93, 0, 175, 0, 33]\nassert acc_reset([48, -7, 148, 59, 166, 104, 170, 3]) == [48, 41, 0, 59, 0, 104, 0, 3]\nassert acc_reset([154]) == [154]\nassert acc_reset([168, 32]) == [168, 0]\nassert acc_reset([153, 108, 151, 134, 57, 19]) == [153, 0, 151, 0, 57, 76]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\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 > 186:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 186 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([34, 28, 74, 47, 57, 17])` يجب أن تُرجع `[34, 62, 136, 183, 0, 17]`.\nالجواب:", "qhash": "1f1931724cee39d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'acmr'}", "tests": ["assert letter_stats('desert code desert') == {'a': 0, 'c': 1, 'm': 0, 'r': 2}", "assert letter_stats('falcon data cloud') == {'a': 3, 'c': 2, 'm': 0, 'r': 0}", "assert letter_stats('a apple falcon banana') == {'a': 6, 'c': 1, 'm': 0, 'r': 0}", "assert letter_stats('is apple') == {'a': 1, 'c': 0, 'm': 0, 'r': 0}", "assert letter_stats('brain summer data') == {'a': 3, 'c': 0, 'm': 2, 'r': 2}", "assert letter_stats('window banana an apple on') == {'a': 5, 'c': 0, 'm': 0, 'r': 0}", "assert letter_stats('') == {'a': 0, 'c': 0, 'm': 0, 'r': 0}"], "test_code": "assert letter_stats('desert code desert') == {'a': 0, 'c': 1, 'm': 0, 'r': 2}\nassert letter_stats('falcon data cloud') == {'a': 3, 'c': 2, 'm': 0, 'r': 0}\nassert letter_stats('a apple falcon banana') == {'a': 6, 'c': 1, 'm': 0, 'r': 0}\nassert letter_stats('is apple') == {'a': 1, 'c': 0, 'm': 0, 'r': 0}\nassert letter_stats('brain summer data') == {'a': 3, 'c': 0, 'm': 2, 'r': 2}\nassert letter_stats('window banana an apple on') == {'a': 5, 'c': 0, 'm': 0, 'r': 0}\nassert letter_stats('') == {'a': 0, 'c': 0, 'm': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'acmr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'acmr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'c'، 'm'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('desert code desert')` يجب أن تُرجع `{'a': 0, 'c': 1, 'm': 0, 'r': 2}`.\nالجواب:", "qhash": "9a0dd85a69de8952"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -9 * x ** 2 + (6) * x + (8)", "tests": ["assert quad(4) == -112", "assert quad(14) == -1672", "assert quad(1) == 5", "assert quad(-12) == -1360", "assert quad(13) == -1435", "assert quad(-11) == -1147", "assert quad(17) == -2491", "assert quad(0) == 8"], "test_code": "assert quad(4) == -112\nassert quad(14) == -1672\nassert quad(1) == 5\nassert quad(-12) == -1360\nassert quad(13) == -1435\nassert quad(-11) == -1147\nassert quad(17) == -2491\nassert quad(0) == 8", "answer": "def quad(x):\n return -9 * x ** 2 + (6) * x + (8)", "completion": " ```python\ndef quad(x):\n return -9 * x ** 2 + (6) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -9x² + 6x + 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(4)` يُرجع `-112`.\nالجواب:", "qhash": "ace01e9344e97781"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 194\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 = 194\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": "ae7835401ca3af23", "answer": "119", "completion": " الناتج:\n```text\n119\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('صديق خبز نور جبل نهر سيارة') == 2", "assert starts_count('نهر علم جبل سماء') == 1", "assert starts_count('ماء تفاحة صحراء قلم علم نور') == 1", "assert starts_count('جبل مكتبة نهر ميناء لغة') == 1", "assert starts_count('شمس نور عربية نور علم') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('سوق حصان ميناء فجر') == 0\nassert starts_count('صديق خبز نور جبل نهر سيارة') == 2\nassert starts_count('نهر علم جبل سماء') == 1\nassert starts_count('ماء تفاحة صحراء قلم علم نور') == 1\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:\n if w.startswith('ن'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ن». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef starts_count(text):\n count = 0\n for w in text:\n if w.startswith('ن'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('سوق حصان ميناء فجر')` يُرجع `0`.\nالجواب:", "qhash": "19f499f5848515e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 29) == 1)", "tests": ["assert count_coprime(144) == 140", "assert count_coprime(187) == 181", "assert count_coprime(112) == 109", "assert count_coprime(111) == 108", "assert count_coprime(168) == 163", "assert count_coprime(78) == 76", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(144) == 140\nassert count_coprime(187) == 181\nassert count_coprime(112) == 109\nassert count_coprime(111) == 108\nassert count_coprime(168) == 163\nassert count_coprime(78) == 76\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, 29) == 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, 29) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 29) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(144)` يُرجع `140`.\nالجواب:", "qhash": "0dcff87e03644965"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 41)", "tests": ["assert filter_range([44, 15, 31, 7, 35, 50, 12, 3, 24]) == [36, 45, 72, 93, 105]", "assert filter_range([-26, -23, -27, 52]) == []", "assert filter_range([0, 25]) == [75]", "assert filter_range([0, 52, -18, 1]) == []", "assert filter_range([29]) == [87]", "assert filter_range([36, 33, 55, 32, 33]) == [96, 99, 99, 108]", "assert filter_range([-23, -12]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([44, 15, 31, 7, 35, 50, 12, 3, 24]) == [36, 45, 72, 93, 105]\nassert filter_range([-26, -23, -27, 52]) == []\nassert filter_range([0, 25]) == [75]\nassert filter_range([0, 52, -18, 1]) == []\nassert filter_range([29]) == [87]\nassert filter_range([36, 33, 55, 32, 33]) == [96, 99, 99, 108]\nassert filter_range([-23, -12]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 41)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و41 (شاملًا الطرفين) في 3.\nمثال: `filter_range([44, 15, 31, 7, 35, 50, 12, 3, 24])` يجب أن تُرجع `[36, 45, 72, 93, 105]`.\nالجواب:", "qhash": "148609cc976d8513"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)", "tests": ["assert mult_sum(119) == 1708", "assert mult_sum(296) == 10443", "assert mult_sum(62) == 441", "assert mult_sum(86) == 888", "assert mult_sum(282) == 9574", "assert mult_sum(193) == 4347", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(119) == 1708\nassert mult_sum(296) == 10443\nassert mult_sum(62) == 441\nassert mult_sum(86) == 888\nassert mult_sum(282) == 9574\nassert mult_sum(193) == 4347\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(119)` يُرجع `1708`.\nالجواب:", "qhash": "4c478cc21a313ee1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 13) == 1)", "tests": ["assert rel_prime_count(148) == 137", "assert rel_prime_count(75) == 70", "assert rel_prime_count(100) == 93", "assert rel_prime_count(196) == 181", "assert rel_prime_count(76) == 71", "assert rel_prime_count(196) == 181", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(148) == 137\nassert rel_prime_count(75) == 70\nassert rel_prime_count(100) == 93\nassert rel_prime_count(196) == 181\nassert rel_prime_count(76) == 71\nassert rel_prime_count(196) == 181\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, 13) == 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, 13) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 13، أي أن القاسم المشترك الأكبر لها مع 13 يساوي 1.\nمثال: `rel_prime_count(148)` يجب أن تُرجع `137`.\nالجواب:", "qhash": "8d7556101f67dd81"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('نور', 74), ('هدى', 16), ('رنا', 56), ('سلمى', 57)]\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 = [('نور', 74), ('هدى', 16), ('رنا', 56), ('سلمى', 57)]\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": "7308bd690096e9cc", "answer": "[('هدى', 16), ('رنا', 56), ('سلمى', 57), ('نور', 74)]\n['نور', 'سلمى']", "completion": " الناتج:\n```text\n[('هدى', 16), ('رنا', 56), ('سلمى', 57), ('نور', 74)]\n['نور', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -2 * x ** 2 + (3) * x + (-7)", "tests": ["assert p(8) == -111", "assert p(-14) == -441", "assert p(14) == -357", "assert p(-12) == -331", "assert p(-10) == -237", "assert p(-20) == -867", "assert p(-20) == -867", "assert p(0) == -7"], "test_code": "assert p(8) == -111\nassert p(-14) == -441\nassert p(14) == -357\nassert p(-12) == -331\nassert p(-10) == -237\nassert p(-20) == -867\nassert p(-20) == -867\nassert p(0) == -7", "answer": "def p(x):\n return -2 * x ** 2 + (3) * x + (-7)", "completion": " ```python\ndef p(x):\n return -2 * x ** 2 + (3) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -2x² + 3x - 7 عند العدد الصحيح x.\nمثال: `p(8)` يجب أن تُرجع `-111`.\nالجواب:", "qhash": "3ff78007e218af2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if 17 <= x <= 23)", "tests": ["assert select_range([21, 33, 20, 23, 22]) == [-92, -88, -84, -80]", "assert select_range([-25, -22, -14, -27, 3, -18, -26, -12, 42]) == []", "assert select_range([56, 2, 9, -7, -15, 46, 37]) == []", "assert select_range([43, -17, 43, 33]) == []", "assert select_range([36, -30, 11, 46, 17, -14, -3]) == [-68]", "assert select_range([32, -26, 16, 25, 52, 38, -18]) == []", "assert select_range([0]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([21, 33, 20, 23, 22]) == [-92, -88, -84, -80]\nassert select_range([-25, -22, -14, -27, 3, -18, -26, -12, 42]) == []\nassert select_range([56, 2, 9, -7, -15, 46, 37]) == []\nassert select_range([43, -17, 43, 33]) == []\nassert select_range([36, -30, 11, 46, 17, -14, -3]) == [-68]\nassert select_range([32, -26, 16, 25, 52, 38, -18]) == []\nassert select_range([0]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if 17 <= x <= 23)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if 17 <= x <= 23)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 17 ≤ x ≤ 23، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([21, 33, 20, 23, 22])` يُرجع `[-92, -88, -84, -80]`.\nالجواب:", "qhash": "5b35a87ea76edbb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(3))\n```\nالجواب:", "qhash": "71e88a9285baf6f7", "answer": "2", "completion": " الناتج:\n```text\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -7 * x ** 2 + (1) * x + (9)", "tests": ["assert quad(5) == -161", "assert quad(-5) == -171", "assert quad(5) == -161", "assert quad(6) == -237", "assert quad(17) == -1997", "assert quad(-6) == -249", "assert quad(2) == -17", "assert quad(0) == 9"], "test_code": "assert quad(5) == -161\nassert quad(-5) == -171\nassert quad(5) == -161\nassert quad(6) == -237\nassert quad(17) == -1997\nassert quad(-6) == -249\nassert quad(2) == -17\nassert quad(0) == 9", "answer": "def quad(x):\n return -7 * x ** 2 + (1) * x + (9)", "completion": " ```python\ndef quad(x):\n return -7 * x ** 2 + (1) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -7x² + 1x + 9 عند العدد الصحيح x.\nمثال: `quad(5)` يجب أن تُرجع `-161`.\nالجواب:", "qhash": "d1ec990366d891b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ت')", "tests": ["assert count_hits('ميناء تفاحة برتقال') == 2", "assert count_hits('حصان حاسوب صديق بحر وردة جبل كتاب') == 1", "assert count_hits('قلم نور نهر جبل خبز مدينة جمل') == 0", "assert count_hits('ليل قلم ماء تفاحة ميناء بحر') == 1", "assert count_hits('جبل سوق شجرة خبز جمل شمس برتقال فجر') == 1", "assert count_hits('صحراء عربية دفتر علم حديقة') == 1", "assert count_hits('') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('ميناء تفاحة برتقال') == 2\nassert count_hits('حصان حاسوب صديق بحر وردة جبل كتاب') == 1\nassert count_hits('قلم نور نهر جبل خبز مدينة جمل') == 0\nassert count_hits('ليل قلم ماء تفاحة ميناء بحر') == 1\nassert count_hits('جبل سوق شجرة خبز جمل شمس برتقال فجر') == 1\nassert count_hits('صحراء عربية دفتر علم حديقة') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ت» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('ميناء تفاحة برتقال')` يُرجع `2`.\nالجواب:", "qhash": "a2280a95a8088d94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 7\nfor j in range(9, 13, 3):\n acc -= j * 9\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 7\nfor j in range(9, 13, 3):\n acc -= j * 9\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "7e5fc147cbc50876", "answer": "-182\n12", "completion": " الناتج:\n```text\n-182\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(18))\nprint(compute(18, -8))\nprint(compute(compute(-8), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(18))\nprint(compute(18, -8))\nprint(compute(compute(-8), 18))\n```\nالجواب:", "qhash": "20db508d90875025", "answer": "161\n170\n163", "completion": " الناتج:\n```text\n161\n170\n163\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('is a an falcon camel A1') == 'gq y yl dyjaml aykcj A1'", "assert cipher('at coffee A1') == 'yr amddcc A1'", "assert cipher('brain a apple pixel A1') == 'zpygl y ynnjc ngvcj A1'", "assert cipher('brain !') == 'zpygl !'", "assert cipher('matrix Hello') == 'kyrpgv Hcjjm'", "assert cipher('summer') == 'qskkcp'", "assert cipher('') == ''"], "test_code": "assert cipher('is a an falcon camel A1') == 'gq y yl dyjaml aykcj A1'\nassert cipher('at coffee A1') == 'yr amddcc A1'\nassert cipher('brain a apple pixel A1') == 'zpygl y ynnjc ngvcj A1'\nassert cipher('brain !') == 'zpygl !'\nassert cipher('matrix Hello') == 'kyrpgv Hcjjm'\nassert cipher('summer') == 'qskkcp'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('is a an falcon camel A1')` يجب أن تُرجع `'gq y yl dyjaml aykcj A1'`.\nالجواب:", "qhash": "7143223dadcb6e35"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'خالد': 6, 'عمر': 41, 'باسل': 17, 'أحمد': 37}\npoints['خالد'] += 15\npoints['هشام'] = 56\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 = {'خالد': 6, 'عمر': 41, 'باسل': 17, 'أحمد': 37}\npoints['خالد'] += 15\npoints['هشام'] = 56\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": "723d924b34cf556e", "answer": "5\nهشام\n172\n[('باسل', 17), ('خالد', 21)]", "completion": " الناتج:\n```text\n5\nهشام\n172\n[('باسل', 17), ('خالد', 21)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 31", "tests": ["assert fact_mod(10) == 27", "assert fact_mod(57) == 0", "assert fact_mod(20) == 2", "assert fact_mod(60) == 30", "assert fact_mod(4) == 8", "assert fact_mod(7) == 12", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(10) == 27\nassert fact_mod(57) == 0\nassert fact_mod(20) == 2\nassert fact_mod(60) == 30\nassert fact_mod(4) == 8\nassert fact_mod(7) == 12\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 31", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(10)` يجب أن تُرجع `27`.\nالجواب:", "qhash": "085390b2e282c7d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "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 % 2 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([64, 45, 68, 28, 13, 48, 19, 75, 75, 4]) == 1", "assert how_many_div([84, -9, -4, 47, 74, 63, 67, 63, -21, -37, -1, 25]) == 3", "assert how_many_div([77, 10, 23, 81, -5, -29, 36, 40, 30]) == 1", "assert how_many_div([-1, 76, -10, -29, -25]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([-29, 19, 8, -14]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([64, 45, 68, 28, 13, 48, 19, 75, 75, 4]) == 1\nassert how_many_div([84, -9, -4, 47, 74, 63, 67, 63, -21, -37, -1, 25]) == 3\nassert how_many_div([77, 10, 23, 81, -5, -29, 36, 40, 30]) == 1\nassert how_many_div([-1, 76, -10, -29, -25]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([-29, 19, 8, -14]) == 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 % 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 % 9 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([64, 45, 68, 28, 13, 48, 19, 75, 75, 4])` يُرجع `1`.\nالجواب:", "qhash": "ebc8656fa1e41dfd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(g(7))\nprint(g(7, 4))\nprint(g(g(4), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(g(7))\nprint(g(7, 4))\nprint(g(g(4), 7))\n```\nالجواب:", "qhash": "465ba59c2983d4bc", "answer": "40\n38\n125", "completion": " الناتج:\n```text\n40\n38\n125\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "flip_words", "reference": "def flip_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert flip_words('banana planet we vector stone cloud') == 'cloud-stone-vector-planet-banana'", "assert flip_words('window') == 'window'", "assert flip_words('light on is brain signal table window') == 'window-table-signal-brain-light'", "assert flip_words('a up cloud pixel on in coffee') == 'coffee-pixel-cloud'", "assert flip_words('a orange go by to rocket light at') == 'light-rocket-orange'", "assert flip_words('go winter go light python stone') == 'stone-python-light-winter'", "assert flip_words('') == ''"], "test_code": "assert flip_words('banana planet we vector stone cloud') == 'cloud-stone-vector-planet-banana'\nassert flip_words('window') == 'window'\nassert flip_words('light on is brain signal table window') == 'window-table-signal-brain-light'\nassert flip_words('a up cloud pixel on in coffee') == 'coffee-pixel-cloud'\nassert flip_words('a orange go by to rocket light at') == 'light-rocket-orange'\nassert flip_words('go winter go light python stone') == 'stone-python-light-winter'\nassert flip_words('') == ''", "answer": "def flip_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef flip_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `flip_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `flip_words('banana planet we vector stone cloud')` يجب أن تُرجع `'cloud-stone-vector-planet-banana'`.\nالجواب:", "qhash": "34f85fea59ffe94b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert weighted_sum(5) == 605", "assert weighted_sum(2) == 55", "assert weighted_sum(9) == 3135", "assert weighted_sum(10) == 4235", "assert weighted_sum(1) == 11", "assert weighted_sum(1) == 11", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 605\nassert weighted_sum(2) == 55\nassert weighted_sum(9) == 3135\nassert weighted_sum(10) == 4235\nassert weighted_sum(1) == 11\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 ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `605`.\nالجواب:", "qhash": "bac04c68bc636472"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('طائرة') == 0", "assert count_letter('') == 0", "assert count_letter('معلم صديق مدرسة طالب جبل عمل') == 0", "assert count_letter('صديق ليل رمل كتاب سلام برمجة نهر رمل') == 1", "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('صديق ليل رمل كتاب سلام برمجة نهر رمل') == 1\nassert count_letter('عمل سيارة حديقة حاسوب شجرة') == 0\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ن» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('دفتر صديق معلم باب')` يُرجع `0`.\nالجواب:", "qhash": "c9f1399b35f8d0b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 2\nfor i in range(9, 32, 1):\n s += i * 8\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 2\nfor i in range(9, 32, 1):\n s += i * 8\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "6dd2d7f5e24bd7d3", "answer": "3682\n31", "completion": " الناتج:\n```text\n3682\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [13, 20, 4, 25, -9, 18, 3, 22, 8]\nprint(xs[1:3])\nprint(xs[::-1])\nprint(min(xs[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [13, 20, 4, 25, -9, 18, 3, 22, 8]\nprint(xs[1:3])\nprint(xs[::-1])\nprint(min(xs[1:3]))\n```\nالجواب:", "qhash": "708f6e2e077de3a6", "answer": "[20, 4]\n[8, 22, 3, 18, -9, 25, 4, 20, 13]\n4", "completion": " الناتج:\n```text\n[20, 4]\n[8, 22, 3, 18, -9, 25, 4, 20, 13]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 20\nfor i in range(-5, 9, 4):\n acc += i * 7\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 20\nfor i in range(-5, 9, 4):\n acc += i * 7\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "cf56d073fd26a29f", "answer": "48\n7", "completion": " الناتج:\n```text\n48\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[k:] + items[:k]", "tests": ["assert shift_list([34, 50, 4, 7, 29, 26, 6, 4]) == [7, 29, 26, 6, 4, 34, 50, 4]", "assert shift_list([18, 0, 9, 41, -1]) == [-1, 18, 0, 9, 41]", "assert shift_list([34, 39, 50, 9, 7]) == [7, 34, 39, 50, 9]", "assert shift_list([20, 38]) == [38, 20]", "assert shift_list([34, 12, 50, -2, 19, -7, 48, -6, 11, 32, 20]) == [11, 32, 20, 34, 12, 50, -2, 19, -7, 48, -6]", "assert shift_list([25, 13, 36, 12, 18, 2, 36, -7, 27, 40, 29]) == [27, 40, 29, 25, 13, 36, 12, 18, 2, 36, -7]", "assert shift_list([]) == []"], "test_code": "assert shift_list([34, 50, 4, 7, 29, 26, 6, 4]) == [7, 29, 26, 6, 4, 34, 50, 4]\nassert shift_list([18, 0, 9, 41, -1]) == [-1, 18, 0, 9, 41]\nassert shift_list([34, 39, 50, 9, 7]) == [7, 34, 39, 50, 9]\nassert shift_list([20, 38]) == [38, 20]\nassert shift_list([34, 12, 50, -2, 19, -7, 48, -6, 11, 32, 20]) == [11, 32, 20, 34, 12, 50, -2, 19, -7, 48, -6]\nassert shift_list([25, 13, 36, 12, 18, 2, 36, -7, 27, 40, 29]) == [27, 40, 29, 25, 13, 36, 12, 18, 2, 36, -7]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return ____\n```\nمثال: `shift_list([34, 50, 4, 7, 29, 26, 6, 4])` يجب أن تُرجع `[7, 29, 26, 6, 4, 34, 50, 4]`.\nالجواب:", "qhash": "2e456634292878e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (-3) * x + (-5)", "tests": ["assert evaluate(1) == -7", "assert evaluate(4) == -1", "assert evaluate(-3) == 13", "assert evaluate(-7) == 65", "assert evaluate(-8) == 83", "assert evaluate(13) == 125", "assert evaluate(10) == 65", "assert evaluate(0) == -5"], "test_code": "assert evaluate(1) == -7\nassert evaluate(4) == -1\nassert evaluate(-3) == 13\nassert evaluate(-7) == 65\nassert evaluate(-8) == 83\nassert evaluate(13) == 125\nassert evaluate(10) == 65\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n return 1 * x ** 2 + (-3) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (-3) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 1x² - 3x - 5 عند العدد الصحيح x.\nمثال: `evaluate(1)` يجب أن تُرجع `-7`.\nالجواب:", "qhash": "a6351af550d50c0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 13", "tests": ["assert digits_mod(61433) == 10", "assert digits_mod(467405) == 6", "assert digits_mod(746227) == 7", "assert digits_mod(394780) == 11", "assert digits_mod(293176) == 11", "assert digits_mod(488551) == 0", "assert digits_mod(600452) == 10", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(61433) == 10\nassert digits_mod(467405) == 6\nassert digits_mod(746227) == 7\nassert digits_mod(394780) == 11\nassert digits_mod(293176) == 11\nassert digits_mod(488551) == 0\nassert digits_mod(600452) == 10\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 13", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 13.\nمثال: `digits_mod(61433)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "bb7f370181e0a73c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 17 % len(items)\n return items[k:] + items[:k]", "tests": ["assert cycle([18, 43, 2, 32, 12, 6, 13, 29]) == [43, 2, 32, 12, 6, 13, 29, 18]", "assert cycle([8, 12, 18, 43, 43, 37, 33, 47, 26, 18, 12, 9]) == [37, 33, 47, 26, 18, 12, 9, 8, 12, 18, 43, 43]", "assert cycle([43, 1, 18, 17, 17]) == [18, 17, 17, 43, 1]", "assert cycle([1, 25, -1, 22, 7, 21, 39, 39, 43, 14, -2, 21]) == [21, 39, 39, 43, 14, -2, 21, 1, 25, -1, 22, 7]", "assert cycle([14, 36, 47, 15, 5, 9, 23, -8, 33, -3, -9]) == [23, -8, 33, -3, -9, 14, 36, 47, 15, 5, 9]", "assert cycle([40, 14, 12, 26, 13]) == [12, 26, 13, 40, 14]", "assert cycle([]) == []"], "test_code": "assert cycle([18, 43, 2, 32, 12, 6, 13, 29]) == [43, 2, 32, 12, 6, 13, 29, 18]\nassert cycle([8, 12, 18, 43, 43, 37, 33, 47, 26, 18, 12, 9]) == [37, 33, 47, 26, 18, 12, 9, 8, 12, 18, 43, 43]\nassert cycle([43, 1, 18, 17, 17]) == [18, 17, 17, 43, 1]\nassert cycle([1, 25, -1, 22, 7, 21, 39, 39, 43, 14, -2, 21]) == [21, 39, 39, 43, 14, -2, 21, 1, 25, -1, 22, 7]\nassert cycle([14, 36, 47, 15, 5, 9, 23, -8, 33, -3, -9]) == [23, -8, 33, -3, -9, 14, 36, 47, 15, 5, 9]\nassert cycle([40, 14, 12, 26, 13]) == [12, 26, 13, 40, 14]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 17 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 17 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 17 % len(items)\n return ____\n```\nمثال: `cycle([18, 43, 2, 32, 12, 6, 13, 29])` يجب أن تُرجع `[43, 2, 32, 12, 6, 13, 29, 18]`.\nالجواب:", "qhash": "8a1563fcac3c487d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 1:\n return 5\n return 3 * go(n - 1) + 3\n\nprint(go(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 1:\n return 5\n return 3 * go(n - 1) + 3\n\nprint(go(7))\n```\nالجواب:", "qhash": "a27aacc1c3c12123", "answer": "4737", "completion": " الناتج:\n```text\n4737\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(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 tally_div([47, 9, 12, 25, 45, 19]) == 0", "assert tally_div([-30, 26]) == 1", "assert tally_div([18, 4, 82, 56, 65, 41, 49, -27, -40, 4]) == 5", "assert tally_div([79, 8, 13, 31, -13, 62, 21, 43, 65, -14]) == 3", "assert tally_div([]) == 0", "assert tally_div([-15, -29, 9, 67, -25, 80, 72]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([47, 9, 12, 25, 45, 19]) == 0\nassert tally_div([-30, 26]) == 1\nassert tally_div([18, 4, 82, 56, 65, 41, 49, -27, -40, 4]) == 5\nassert tally_div([79, 8, 13, 31, -13, 62, 21, 43, 65, -14]) == 3\nassert tally_div([]) == 0\nassert tally_div([-15, -29, 9, 67, -25, 80, 72]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `tally_div([47, 9, 12, 25, 45, 19])` يُرجع `0`.\nالجواب:", "qhash": "0a5d83a395ad7298"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(26) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26']", "assert label_numbers(22) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz']", "assert label_numbers(0) == []", "assert label_numbers(16) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16']", "assert label_numbers(21) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21']"], "test_code": "assert label_numbers(26) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26']\nassert label_numbers(22) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz']\nassert label_numbers(0) == []\nassert label_numbers(16) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16']\nassert label_numbers(21) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21']", "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 % 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 % 5 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Fizz'، وعلى 11 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(26)` يجب أن تُرجع `['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26']`.\nالجواب:", "qhash": "75cdd3aa5c13c396"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('علم مدينة بيت برتقال باب باب مطر مكتبة') == 0", "assert letter_hits('حاسوب دفتر سلام طائرة طائرة سلام حصان حديقة') == 1", "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('علم مدينة بيت برتقال باب باب مطر مكتبة') == 0\nassert letter_hits('حاسوب دفتر سلام طائرة طائرة سلام حصان حديقة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «و» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('شمس تفاحة خبز')` يُرجع `0`.\nالجواب:", "qhash": "5c788bab023fddca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -6 <= x <= -1)", "tests": ["assert clip_scale([8, 6, -1, -8, 8, 9, 2, -9, 2, -16]) == [-2]", "assert clip_scale([51, -28]) == []", "assert clip_scale([42, -11]) == []", "assert clip_scale([50, 14]) == []", "assert clip_scale([-19, 60, 4]) == []", "assert clip_scale([47, -29, 57]) == []", "assert clip_scale([18, 14, 8, -17, 42, -11, 32, -25]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([8, 6, -1, -8, 8, 9, 2, -9, 2, -16]) == [-2]\nassert clip_scale([51, -28]) == []\nassert clip_scale([42, -11]) == []\nassert clip_scale([50, 14]) == []\nassert clip_scale([-19, 60, 4]) == []\nassert clip_scale([47, -29, 57]) == []\nassert clip_scale([18, 14, 8, -17, 42, -11, 32, -25]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -6 <= x <= -1)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if -6 <= x <= -1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و-1 (شاملًا الطرفين) في 2.\nمثال: `clip_scale([8, 6, -1, -8, 8, 9, 2, -9, 2, -16])` يجب أن تُرجع `[-2]`.\nالجواب:", "qhash": "135c08b94abac9ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 145:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([62, 3, 34, 41, 32]) == [62, 65, 99, 140, 0]", "assert cumulative([129, 142, 59, 103, 52]) == [129, 0, 59, 0, 52]", "assert cumulative([134, 27, -3, 54, 2, 61, 71]) == [134, 0, -3, 51, 53, 114, 0]", "assert cumulative([43, 37, 142]) == [43, 80, 0]", "assert cumulative([52, 25, 51, 48]) == [52, 77, 128, 0]", "assert cumulative([69, 117, -4]) == [69, 0, -4]", "assert cumulative([]) == []"], "test_code": "assert cumulative([62, 3, 34, 41, 32]) == [62, 65, 99, 140, 0]\nassert cumulative([129, 142, 59, 103, 52]) == [129, 0, 59, 0, 52]\nassert cumulative([134, 27, -3, 54, 2, 61, 71]) == [134, 0, -3, 51, 53, 114, 0]\nassert cumulative([43, 37, 142]) == [43, 80, 0]\nassert cumulative([52, 25, 51, 48]) == [52, 77, 128, 0]\nassert cumulative([69, 117, -4]) == [69, 0, -4]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 145:\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 > 145:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 145 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([62, 3, 34, 41, 32])` يجب أن تُرجع `[62, 65, 99, 140, 0]`.\nالجواب:", "qhash": "826c13d8ca91a0bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([-18, 13, -6, 10]) == 10", "assert max_multiple([-4, -6, -8]) == -4", "assert max_multiple([1, 3]) == None", "assert max_multiple([-20, -28, -12, 39]) == -12", "assert max_multiple([33, 24, 17, 12, 7]) == 24", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-18, 13, -6, 10]) == 10\nassert max_multiple([-4, -6, -8]) == -4\nassert max_multiple([1, 3]) == None\nassert max_multiple([-20, -28, -12, 39]) == -12\nassert max_multiple([33, 24, 17, 12, 7]) == 24\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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للتوضيح: الاستدعاء `max_multiple([-18, 13, -6, 10])` يُرجع `10`.\nالجواب:", "qhash": "5cf41b063549cd75"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [33, -2, 40, 14, 6, 31, 7]\nprint(lst[0:7])\nprint(lst[::-2])\nprint(len(lst[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [33, -2, 40, 14, 6, 31, 7]\nprint(lst[0:7])\nprint(lst[::-2])\nprint(len(lst[0:7]))\n```\nالجواب:", "qhash": "34daaf139dc517f9", "answer": "[33, -2, 40, 14, 6, 31, 7]\n[7, 6, 40, 33]\n7", "completion": " الناتج:\n```text\n[33, -2, 40, 14, 6, 31, 7]\n[7, 6, 40, 33]\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([59, -10, -4, 40]) == 40", "assert max_div([-50, -50, -10]) == -10", "assert max_div([1, 11]) == None", "assert max_div([33]) == None", "assert max_div([-33, -9, 29, -29, 24, -22, 22, 13]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([59, -10, -4, 40]) == 40\nassert max_div([-50, -50, -10]) == -10\nassert max_div([1, 11]) == None\nassert max_div([33]) == None\nassert max_div([-33, -9, 29, -29, 24, -22, 22, 13]) == None\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = None\n for x in arr:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_div([59, -10, -4, 40])` يجب أن تُرجع `40`.\nالجواب:", "qhash": "f4671d4cf9e27cd7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'رنا': 26, 'فيصل': 8, 'حسن': 26}\nd['رنا'] += 18\nd['باسل'] = 9\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 36])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'رنا': 26, 'فيصل': 8, 'حسن': 26}\nd['رنا'] += 18\nd['باسل'] = 9\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 36])\n```\nالجواب:", "qhash": "5fa88e1420431522", "answer": "4\nرنا\n87\n['رنا']", "completion": " الناتج:\n```text\n4\nرنا\n87\n['رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(16) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo', '13', 'Bar', '15', 'Foo']", "assert play(16) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo', '13', 'Bar', '15', 'Foo']", "assert play(9) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9']", "assert play(5) == ['1', '2', '3', 'Foo', '5']", "assert play(3) == ['1', '2', '3']"], "test_code": "assert play(16) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo', '13', 'Bar', '15', 'Foo']\nassert play(16) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo', '13', 'Bar', '15', 'Foo']\nassert play(9) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9']\nassert play(5) == ['1', '2', '3', 'Foo', '5']\nassert play(3) == ['1', '2', '3']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\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 % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Foo'، وعلى 7 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(16)` يجب أن تُرجع `['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo', '13', 'Bar', '15', 'Foo']`.\nالجواب:", "qhash": "7ef1bd784a7350a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=7):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(8))\nprint(compute(8, 17))\nprint(compute(compute(17), 8))", "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(8))\nprint(compute(8, 17))\nprint(compute(compute(17), 8))\n```\nالجواب:", "qhash": "7cc14eb998f9dcfb", "answer": "1\n25\n2", "completion": " الناتج:\n```text\n1\n25\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "4fae7fb8d783b2bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 3\nfor n in range(5, 22, 2):\n result -= n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 3\nfor n in range(5, 22, 2):\n result -= n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "648f37be52667e94", "answer": "-933\n21", "completion": " الناتج:\n```text\n-933\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 4 + 2 for x in range(4, 18) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 4 + 2 for x in range(4, 18) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "09017e8b8887b7d3", "answer": "[22, 38, 54, 70]\n4 184", "completion": " الناتج:\n```text\n[22, 38, 54, 70]\n4 184\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([57, 5, 7, 8, 33, 23, 8]) == 8", "assert max_multiple([-16, -4, -8]) == -4", "assert max_multiple([1, 5, 9]) == None", "assert max_multiple([-11, -24, -16, -40, 23, -31, -6, 40]) == 40", "assert max_multiple([-17, -1, 2, 40]) == 40", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([57, 5, 7, 8, 33, 23, 8]) == 8\nassert max_multiple([-16, -4, -8]) == -4\nassert max_multiple([1, 5, 9]) == None\nassert max_multiple([-11, -24, -16, -40, 23, -31, -6, 40]) == 40\nassert max_multiple([-17, -1, 2, 40]) == 40\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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مثال: `max_multiple([57, 5, 7, 8, 33, 23, 8])` يجب أن تُرجع `8`.\nالجواب:", "qhash": "693eed2a33bb7fe7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'عمر': 42, 'خالد': 36, 'ليلى': 47}\nscores['عمر'] += 15\nscores['باسل'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 30])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'عمر': 42, 'خالد': 36, 'ليلى': 47}\nscores['عمر'] += 15\nscores['باسل'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 30])\n```\nالجواب:", "qhash": "5d83eb6be44068c8", "answer": "4\nعمر\n174\n['عمر', 'خالد', 'ليلى', 'باسل']", "completion": " الناتج:\n```text\n4\nعمر\n174\n['عمر', 'خالد', 'ليلى', 'باسل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([10, 5, 1, 15, 13, 4, 2, 14, 16]) == [10, 15, 16, 0, 13, 17, 19, 0, 16]", "assert capped_cumsum([6, -3, 3, -7, 1, 17, 22, -8, -4, 12]) == [6, 3, 6, -1, 0, 17, 0, -8, -12, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([5]) == [5]", "assert capped_cumsum([-8, 20, 22, 11, 14]) == [-8, 12, 0, 11, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([10, 5, 1, 15, 13, 4, 2, 14, 16]) == [10, 15, 16, 0, 13, 17, 19, 0, 16]\nassert capped_cumsum([6, -3, 3, -7, 1, 17, 22, -8, -4, 12]) == [6, 3, 6, -1, 0, 17, 0, -8, -12, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([5]) == [5]\nassert capped_cumsum([-8, 20, 22, 11, 14]) == [-8, 12, 0, 11, 0]\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 > 22:\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 > 22:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 22 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([10, 5, 1, 15, 13, 4, 2, 14, 16])` يُرجع `[10, 15, 16, 0, 13, 17, 19, 0, 16]`.\nالجواب:", "qhash": "43cdd32f65f1662c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if 1 <= x <= 20)", "tests": ["assert between_times([-8, 26, 29, 11]) == [-55]", "assert between_times([33, 41, 21, 27, 25, 7]) == [-35]", "assert between_times([45, 46, 2, -27, -19, 24]) == [-10]", "assert between_times([-9, -25, 3, 12]) == [-60, -15]", "assert between_times([-6, 12, 45, 20, -15, 52, -16]) == [-100, -60]", "assert between_times([-28, 27, 33, 44]) == []", "assert between_times([-3, 18, 14]) == [-90, -70]", "assert between_times([]) == []"], "test_code": "assert between_times([-8, 26, 29, 11]) == [-55]\nassert between_times([33, 41, 21, 27, 25, 7]) == [-35]\nassert between_times([45, 46, 2, -27, -19, 24]) == [-10]\nassert between_times([-9, -25, 3, 12]) == [-60, -15]\nassert between_times([-6, 12, 45, 20, -15, 52, -16]) == [-100, -60]\nassert between_times([-28, 27, 33, 44]) == []\nassert between_times([-3, 18, 14]) == [-90, -70]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if 1 <= x <= 20)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if 1 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 1 و20 (شاملًا الطرفين) في -5.\nمثال: `between_times([-8, 26, 29, 11])` يجب أن تُرجع `[-55]`.\nالجواب:", "qhash": "c28a66ec6631b94d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 1 * x ** 2 + (-4) * x + (-2)", "tests": ["assert value_at(4) == -2", "assert value_at(10) == 58", "assert value_at(11) == 75", "assert value_at(-8) == 94", "assert value_at(7) == 19", "assert value_at(-8) == 94", "assert value_at(-12) == 190", "assert value_at(0) == -2"], "test_code": "assert value_at(4) == -2\nassert value_at(10) == 58\nassert value_at(11) == 75\nassert value_at(-8) == 94\nassert value_at(7) == 19\nassert value_at(-8) == 94\nassert value_at(-12) == 190\nassert value_at(0) == -2", "answer": "def value_at(x):\n return 1 * x ** 2 + (-4) * x + (-2)", "completion": " ```python\ndef value_at(x):\n return 1 * x ** 2 + (-4) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 1x² - 4x - 2 عند العدد الصحيح x.\nمثال: `value_at(4)` يجب أن تُرجع `-2`.\nالجواب:", "qhash": "64caf81eff851dc4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert turn_list([50, 20, 39, 49, 15, 40, 10]) == [40, 10, 50, 20, 39, 49, 15]", "assert turn_list([5, 11, 26, 4, 41, -4, 3, 36, -7]) == [36, -7, 5, 11, 26, 4, 41, -4, 3]", "assert turn_list([7, 30, 50, 46, 6, 26, 33, 13, -3, 18, 26]) == [18, 26, 7, 30, 50, 46, 6, 26, 33, 13, -3]", "assert turn_list([34, 45, -3, 27, 36, 24, 41, 21, 26, 38, 36]) == [38, 36, 34, 45, -3, 27, 36, 24, 41, 21, 26]", "assert turn_list([-7, 4, 40, 24, 16, 42, 5]) == [42, 5, -7, 4, 40, 24, 16]", "assert turn_list([15, 24]) == [15, 24]", "assert turn_list([]) == []"], "test_code": "assert turn_list([50, 20, 39, 49, 15, 40, 10]) == [40, 10, 50, 20, 39, 49, 15]\nassert turn_list([5, 11, 26, 4, 41, -4, 3, 36, -7]) == [36, -7, 5, 11, 26, 4, 41, -4, 3]\nassert turn_list([7, 30, 50, 46, 6, 26, 33, 13, -3, 18, 26]) == [18, 26, 7, 30, 50, 46, 6, 26, 33, 13, -3]\nassert turn_list([34, 45, -3, 27, 36, 24, 41, 21, 26, 38, 36]) == [38, 36, 34, 45, -3, 27, 36, 24, 41, 21, 26]\nassert turn_list([-7, 4, 40, 24, 16, 42, 5]) == [42, 5, -7, 4, 40, 24, 16]\nassert turn_list([15, 24]) == [15, 24]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 2 % 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 = 2 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return ____\n```\nمثال: `turn_list([50, 20, 39, 49, 15, 40, 10])` يجب أن تُرجع `[40, 10, 50, 20, 39, 49, 15]`.\nالجواب:", "qhash": "386b1c82a2911288"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "tests": ["assert scaled_powers(6) == 1323", "assert scaled_powers(9) == 6075", "assert scaled_powers(14) == 33075", "assert scaled_powers(15) == 43200", "assert scaled_powers(12) == 18252", "assert scaled_powers(1) == 3", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 1323\nassert scaled_powers(9) == 6075\nassert scaled_powers(14) == 33075\nassert scaled_powers(15) == 43200\nassert scaled_powers(12) == 18252\nassert scaled_powers(1) == 3\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(6)` يُرجع `1323`.\nالجواب:", "qhash": "e772449004869fcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'قهوة'\nprint(text[-1])\nprint(len(text.replace(' ', '')))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'قهوة'\nprint(text[-1])\nprint(len(text.replace(' ', '')))\nprint(text[::-1])\n```\nالجواب:", "qhash": "d12e9fc617dfb9c1", "answer": "ة\n4\nةوهق", "completion": " الناتج:\n```text\nة\n4\nةوهق\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [38, 27, -6, 32, 6, 40, -3, -12]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [38, 27, -6, 32, 6, 40, -3, -12]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "9681bcc707dbe82a", "answer": "[27, 32, 38, 40, 6, -3, -6, -12]\n[40, 38, 32]", "completion": " الناتج:\n```text\n[27, 32, 38, 40, 6, -3, -6, -12]\n[40, 38, 32]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('to go signal up') == 'xs ks wmkrep yt'", "assert rotate_letters('orange winter code A1') == 'sverki amrxiv gshi A1'", "assert rotate_letters('river banana desert pixel !') == 'vmziv ferere hiwivx tmbip !'", "assert rotate_letters('banana table planet python') == 'ferere xefpi tperix tcxlsr'", "assert rotate_letters('rocket on river stone go Hello') == 'vsgoix sr vmziv wxsri ks Hipps'", "assert rotate_letters('window rocket signal 2024') == 'amrhsa vsgoix wmkrep 2024'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('to go signal up') == 'xs ks wmkrep yt'\nassert rotate_letters('orange winter code A1') == 'sverki amrxiv gshi A1'\nassert rotate_letters('river banana desert pixel !') == 'vmziv ferere hiwivx tmbip !'\nassert rotate_letters('banana table planet python') == 'ferere xefpi tperix tcxlsr'\nassert rotate_letters('rocket on river stone go Hello') == 'vsgoix sr vmziv wxsri ks Hipps'\nassert rotate_letters('window rocket signal 2024') == 'amrhsa vsgoix wmkrep 2024'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('to go signal up')` يجب أن تُرجع `'xs ks wmkrep yt'`.\nالجواب:", "qhash": "1ebf4dc8dfd100dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'os'}", "tests": ["assert tally('an of python up in vector') == {'o': 3, 's': 0}", "assert tally('window pixel vector planet pixel coffee') == {'o': 3, 's': 0}", "assert tally('brain at') == {'o': 0, 's': 0}", "assert tally('a we data') == {'o': 0, 's': 0}", "assert tally('orange orange orange') == {'o': 3, 's': 0}", "assert tally('it up music') == {'o': 0, 's': 1}", "assert tally('') == {'o': 0, 's': 0}"], "test_code": "assert tally('an of python up in vector') == {'o': 3, 's': 0}\nassert tally('window pixel vector planet pixel coffee') == {'o': 3, 's': 0}\nassert tally('brain at') == {'o': 0, 's': 0}\nassert tally('a we data') == {'o': 0, 's': 0}\nassert tally('orange orange orange') == {'o': 3, 's': 0}\nassert tally('it up music') == {'o': 0, 's': 1}\nassert tally('') == {'o': 0, 's': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'os'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'os'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'o'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('an of python up in vector')` يُرجع `{'o': 3, 's': 0}`.\nالجواب:", "qhash": "613d4c115d031445"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 16397\nc = 0\nwhile n > 16:\n n = n // 4\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 16397\nc = 0\nwhile n > 16:\n n = n // 4\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "80f764aa87dd27e1", "answer": "16 5", "completion": " الناتج:\n```text\n16 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_list([9, 21, 21, 21]) == [21, 21, 21, 9]", "assert rotate_list([-2, 10, 33, 18, 22, 26]) == [18, 22, 26, -2, 10, 33]", "assert rotate_list([4, 47, 36, 31, 24, 11, 31]) == [24, 11, 31, 4, 47, 36, 31]", "assert rotate_list([17, -6, 32, 41, 13, 23, 20, 25]) == [23, 20, 25, 17, -6, 32, 41, 13]", "assert rotate_list([46, 7, -8, 4, 4, 22, 8, 18, 14, 48, 5]) == [14, 48, 5, 46, 7, -8, 4, 4, 22, 8, 18]", "assert rotate_list([-7, 39, 44, 25, 18, 37, -5, 37, -3, 43]) == [37, -3, 43, -7, 39, 44, 25, 18, 37, -5]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([9, 21, 21, 21]) == [21, 21, 21, 9]\nassert rotate_list([-2, 10, 33, 18, 22, 26]) == [18, 22, 26, -2, 10, 33]\nassert rotate_list([4, 47, 36, 31, 24, 11, 31]) == [24, 11, 31, 4, 47, 36, 31]\nassert rotate_list([17, -6, 32, 41, 13, 23, 20, 25]) == [23, 20, 25, 17, -6, 32, 41, 13]\nassert rotate_list([46, 7, -8, 4, 4, 22, 8, 18, 14, 48, 5]) == [14, 48, 5, 46, 7, -8, 4, 4, 22, 8, 18]\nassert rotate_list([-7, 39, 44, 25, 18, 37, -5, 37, -3, 43]) == [37, -3, 43, -7, 39, 44, 25, 18, 37, -5]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([9, 21, 21, 21])` يُرجع `[21, 21, 21, 9]`.\nالجواب:", "qhash": "6538a94ab139b745"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(32) == 87", "assert total_multiples(224) == 4713", "assert total_multiples(258) == 6393", "assert total_multiples(15) == 20", "assert total_multiples(5) == 0", "assert total_multiples(292) == 8316", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(32) == 87\nassert total_multiples(224) == 4713\nassert total_multiples(258) == 6393\nassert total_multiples(15) == 20\nassert total_multiples(5) == 0\nassert total_multiples(292) == 8316\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 % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(32)` يُرجع `87`.\nالجواب:", "qhash": "12796b90d02cc0ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_div([69, 36, 81, 62, 58, 32]) == 0", "assert count_div([]) == 0", "assert count_div([86, 79, -21, 83, 41]) == 0", "assert count_div([50]) == 0", "assert count_div([49, -23, 18, 13, 60, 34, 59, 39, 55, 36, 26, -28]) == 1", "assert count_div([89, -27, -21]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([69, 36, 81, 62, 58, 32]) == 0\nassert count_div([]) == 0\nassert count_div([86, 79, -21, 83, 41]) == 0\nassert count_div([50]) == 0\nassert count_div([49, -23, 18, 13, 60, 34, 59, 39, 55, 36, 26, -28]) == 1\nassert count_div([89, -27, -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 % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([69, 36, 81, 62, 58, 32])` يُرجع `0`.\nالجواب:", "qhash": "33b9323c0d5794b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'مريم': 35, 'رنا': 38, 'حسن': 7, 'خالد': 27, 'يوسف': 4}\nd['مريم'] += 8\nd['سلمى'] = 41\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 = {'مريم': 35, 'رنا': 38, 'حسن': 7, 'خالد': 27, 'يوسف': 4}\nd['مريم'] += 8\nd['سلمى'] = 41\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": "fe8bacd2a40fe271", "answer": "6\nمريم\n160\n[('يوسف', 4), ('حسن', 7)]", "completion": " الناتج:\n```text\n6\nمريم\n160\n[('يوسف', 4), ('حسن', 7)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('winter up') == 'htyepc fa'", "assert shift_letters('signal python OK') == 'dtrylw ajeszy OK'", "assert shift_letters('engine !') == 'pyrtyp !'", "assert shift_letters('river winter !') == 'ctgpc htyepc !'", "assert shift_letters('of it window to an Hello') == 'zq te htyozh ez ly Hpwwz'", "assert shift_letters('at brain') == 'le mclty'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('winter up') == 'htyepc fa'\nassert shift_letters('signal python OK') == 'dtrylw ajeszy OK'\nassert shift_letters('engine !') == 'pyrtyp !'\nassert shift_letters('river winter !') == 'ctgpc htyepc !'\nassert shift_letters('of it window to an Hello') == 'zq te htyozh ez ly Hpwwz'\nassert shift_letters('at brain') == 'le mclty'\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 + (-15)) % 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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('winter up')` يجب أن تُرجع `'htyepc fa'`.\nالجواب:", "qhash": "d95fc9feb8ba748c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('هدى', 55), ('سعيد', 86), ('حسن', 74), ('عمر', 99)]\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), ('سعيد', 86), ('حسن', 74), ('عمر', 99)]\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": "49eeccca3106408b", "answer": "[('هدى', 55), ('حسن', 74), ('سعيد', 86), ('عمر', 99)]\n['عمر', 'سعيد']", "completion": " الناتج:\n```text\n[('هدى', 55), ('حسن', 74), ('سعيد', 86), ('عمر', 99)]\n['عمر', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'banana_engine'\nprint(name.replace('b', '*'))\nprint(name[-1:])\nprint(name.index('b') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'banana_engine'\nprint(name.replace('b', '*'))\nprint(name[-1:])\nprint(name.index('b') + len(name))\n```\nالجواب:", "qhash": "c6d499720bc9a004", "answer": "*anana_engine\ne\n13", "completion": " الناتج:\n```text\n*anana_engine\ne\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 78:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([4, 24, 11, 39, 41, 16, 2, 43]) == [4, 28, 39, 78, 0, 16, 18, 61]", "assert cumulative([-9, 23]) == [-9, 14]", "assert cumulative([38, 70, 50, 24]) == [38, 0, 50, 74]", "assert cumulative([35, 0, -1, 28, 69]) == [35, 35, 34, 62, 0]", "assert cumulative([33, 12]) == [33, 45]", "assert cumulative([50, 48, -9, 15, 11, 60, 74, 61, 37]) == [50, 0, -9, 6, 17, 77, 0, 61, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([4, 24, 11, 39, 41, 16, 2, 43]) == [4, 28, 39, 78, 0, 16, 18, 61]\nassert cumulative([-9, 23]) == [-9, 14]\nassert cumulative([38, 70, 50, 24]) == [38, 0, 50, 74]\nassert cumulative([35, 0, -1, 28, 69]) == [35, 35, 34, 62, 0]\nassert cumulative([33, 12]) == [33, 45]\nassert cumulative([50, 48, -9, 15, 11, 60, 74, 61, 37]) == [50, 0, -9, 6, 17, 77, 0, 61, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 78:\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 > 78:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 78 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([4, 24, 11, 39, 41, 16, 2, 43])` يُرجع `[4, 28, 39, 78, 0, 16, 18, 61]`.\nالجواب:", "qhash": "1467ada3917dc211"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "lead_count", "reference": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert lead_count('قمر طائرة حاسوب سيارة عمل برمجة') == 1", "assert lead_count('علم صديق لغة مدرسة مدرسة') == 0", "assert lead_count('باب فجر قلم طائرة') == 1", "assert lead_count('برمجة قلم تفاحة قهوة سوق معلم باب باب') == 3", "assert lead_count('حصان قلم سفينة بحر') == 1", "assert lead_count('سلام تفاحة') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('قمر طائرة حاسوب سيارة عمل برمجة') == 1\nassert lead_count('علم صديق لغة مدرسة مدرسة') == 0\nassert lead_count('باب فجر قلم طائرة') == 1\nassert lead_count('برمجة قلم تفاحة قهوة سوق معلم باب باب') == 3\nassert lead_count('حصان قلم سفينة بحر') == 1\nassert lead_count('سلام تفاحة') == 0\nassert lead_count('') == 0", "answer": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef lead_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 lead_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 lead_count(s):\n count = 0\n for w in s:\n if w.startswith('ب'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('قمر طائرة حاسوب سيارة عمل برمجة')` يُرجع `1`.\nالجواب:", "qhash": "e99112ecd5de9031"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سيارة حديقة'\nprint('ت' in text)\nprint(len(text))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سيارة حديقة'\nprint('ت' in text)\nprint(len(text))\nprint(text[::-1])\n```\nالجواب:", "qhash": "4be7cbe3004e3023", "answer": "False\n11\nةقيدح ةرايس", "completion": " الناتج:\n```text\nFalse\n11\nةقيدح ةرايس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "tests": ["assert sum_multiples(213) == 11342", "assert sum_multiples(124) == 3782", "assert sum_multiples(90) == 1980", "assert sum_multiples(266) == 17556", "assert sum_multiples(54) == 702", "assert sum_multiples(153) == 5852", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(213) == 11342\nassert sum_multiples(124) == 3782\nassert sum_multiples(90) == 1980\nassert sum_multiples(266) == 17556\nassert sum_multiples(54) == 702\nassert sum_multiples(153) == 5852\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 % 4 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 4، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(213)` يُرجع `11342`.\nالجواب:", "qhash": "b052e0400ac31471"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (7) * x + (3)", "tests": ["assert evaluate(8) == 123", "assert evaluate(4) == 47", "assert evaluate(15) == 333", "assert evaluate(-4) == -9", "assert evaluate(-5) == -7", "assert evaluate(2) == 21", "assert evaluate(-1) == -3", "assert evaluate(0) == 3"], "test_code": "assert evaluate(8) == 123\nassert evaluate(4) == 47\nassert evaluate(15) == 333\nassert evaluate(-4) == -9\nassert evaluate(-5) == -7\nassert evaluate(2) == 21\nassert evaluate(-1) == -3\nassert evaluate(0) == 3", "answer": "def evaluate(x):\n return 1 * x ** 2 + (7) * x + (3)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (7) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 1x² + 7x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(8)` يُرجع `123`.\nالجواب:", "qhash": "a0b15420877a3a3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 16\nfor i in range(1, 21, 3):\n s -= i * 4\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 16\nfor i in range(1, 21, 3):\n s -= i * 4\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "c6fa4e3876bd52c2", "answer": "-264\n19", "completion": " الناتج:\n```text\n-264\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([6, 16, 33]) == [33, 6, 16]", "assert shift_list([8, -5, 11, 47, -9, 46, 22, 25, 35, 20]) == [22, 25, 35, 20, 8, -5, 11, 47, -9, 46]", "assert shift_list([-6, 25, 21, 49]) == [-6, 25, 21, 49]", "assert shift_list([15, 20, 21, 19, 39, 20, 41, 46, -2]) == [20, 41, 46, -2, 15, 20, 21, 19, 39]", "assert shift_list([36, 11, 50, 27, -9, 6, 18, 16, 30, 14]) == [18, 16, 30, 14, 36, 11, 50, 27, -9, 6]", "assert shift_list([30, 31, 43, 16, 3, 5, 28]) == [16, 3, 5, 28, 30, 31, 43]", "assert shift_list([]) == []"], "test_code": "assert shift_list([6, 16, 33]) == [33, 6, 16]\nassert shift_list([8, -5, 11, 47, -9, 46, 22, 25, 35, 20]) == [22, 25, 35, 20, 8, -5, 11, 47, -9, 46]\nassert shift_list([-6, 25, 21, 49]) == [-6, 25, 21, 49]\nassert shift_list([15, 20, 21, 19, 39, 20, 41, 46, -2]) == [20, 41, 46, -2, 15, 20, 21, 19, 39]\nassert shift_list([36, 11, 50, 27, -9, 6, 18, 16, 30, 14]) == [18, 16, 30, 14, 36, 11, 50, 27, -9, 6]\nassert shift_list([30, 31, 43, 16, 3, 5, 28]) == [16, 3, 5, 28, 30, 31, 43]\nassert shift_list([]) == []", "answer": "def shift_list(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 shift_list(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 shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return ____\n```\nمثال: `shift_list([6, 16, 33])` يجب أن تُرجع `[33, 6, 16]`.\nالجواب:", "qhash": "5ba8028ffe88c079"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('rocket a to code signal') == 'signal_rocket'", "assert flip_words('winter pixel light window cloud') == 'window_winter'", "assert flip_words('a is we we') == ''", "assert flip_words('cloud it it river engine in desert') == 'desert_engine'", "assert flip_words('go') == ''", "assert flip_words('data') == ''", "assert flip_words('it at river') == ''"], "test_code": "assert flip_words('rocket a to code signal') == 'signal_rocket'\nassert flip_words('winter pixel light window cloud') == 'window_winter'\nassert flip_words('a is we we') == ''\nassert flip_words('cloud it it river engine in desert') == 'desert_engine'\nassert flip_words('go') == ''\nassert flip_words('data') == ''\nassert flip_words('it at river') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `flip_words('rocket a to code signal')` يُرجع `'signal_rocket'`.\nالجواب:", "qhash": "d00ddc12891a772d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ك'))", "tests": ["assert letter_hits('قمر مدينة سلام مطر كتاب دفتر علم صحراء') == 1", "assert letter_hits('مكتبة معلم جبل مطر برتقال جبل باب') == 0", "assert letter_hits('بيت باب معلم جمل ليل سفينة برتقال حديقة') == 0", "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('بيت باب معلم جمل ليل سفينة برتقال حديقة') == 0\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 sum(1 for w in text.split() if w.startswith('ك'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ك'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_hits(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ك»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('قمر مدينة سلام مطر كتاب دفتر علم صحراء')` يُرجع `1`.\nالجواب:", "qhash": "74ffbd4b7bc1a9f9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=0):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(19))\nprint(calc(19, -3))\nprint(calc(calc(-3), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=0):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(19))\nprint(calc(19, -3))\nprint(calc(calc(-3), 19))\n```\nالجواب:", "qhash": "0054093cc1e21b52", "answer": "152\n155\n149", "completion": " الناتج:\n```text\n152\n155\n149\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [27, 40, -3, 16, -3]\nprint(a[2:4])\nprint(a[::-1])\nprint(len(a[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [27, 40, -3, 16, -3]\nprint(a[2:4])\nprint(a[::-1])\nprint(len(a[2:4]))\n```\nالجواب:", "qhash": "a1cd8eb941115457", "answer": "[-3, 16]\n[-3, 16, -3, 40, 27]\n2", "completion": " الناتج:\n```text\n[-3, 16]\n[-3, 16, -3, 40, 27]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'ميناء سفينة'\nprint(s[0])\nprint(s.find('ر'))\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'ميناء سفينة'\nprint(s[0])\nprint(s.find('ر'))\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "0f4ae1e9ea326601", "answer": "م\n-1\n10", "completion": " الناتج:\n```text\nم\n-1\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(9))\nprint(compute(9, -4))\nprint(compute(compute(-4), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(compute(9))\nprint(compute(9, -4))\nprint(compute(compute(-4), 9))\n```\nالجواب:", "qhash": "c105e87e84d356b2", "answer": "80\n85\n86", "completion": " الناتج:\n```text\n80\n85\n86\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'camel'\nprint(len(s))\nprint(s.count('e'))\nprint(s.find('e'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'camel'\nprint(len(s))\nprint(s.count('e'))\nprint(s.find('e'))\n```\nالجواب:", "qhash": "05604aff03ed5348", "answer": "5\n1\n3", "completion": " الناتج:\n```text\n5\n1\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'river'\nprint(s[::-1])\nprint(s.index('v') + len(s))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'river'\nprint(s[::-1])\nprint(s.index('v') + len(s))\nprint(len(s))\n```\nالجواب:", "qhash": "f75bf1731b4abb85", "answer": "revir\n7\n5", "completion": " الناتج:\n```text\nrevir\n7\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [18, -20, 28, -5, 12, -13, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [18, -20, 28, -5, 12, -13, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ca025e2cffa989d3", "answer": "[28, 18, 35, 12, -5, -13, -20]\n[35, 28, 18]", "completion": " الناتج:\n```text\n[28, 18, 35, 12, -5, -13, -20]\n[35, 28, 18]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [18, 21, 24, 11, -3, 3, 17]\nprint(nums[0:3])\nprint(nums[::2])\nprint(len(nums[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [18, 21, 24, 11, -3, 3, 17]\nprint(nums[0:3])\nprint(nums[::2])\nprint(len(nums[0:3]))\n```\nالجواب:", "qhash": "68d5315228ae3d2a", "answer": "[18, 21, 24]\n[18, 24, -3, 17]\n3", "completion": " الناتج:\n```text\n[18, 21, 24]\n[18, 24, -3, 17]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قلم دفتر سوق نور قمر مطر فجر تفاحة') == 2", "assert starts_count('قمر برمجة صديق') == 1", "assert starts_count('سماء علم مكتبة سماء بيت') == 0", "assert starts_count('باب نور قهوة قهوة نور') == 2", "assert starts_count('مدينة جمل قمر سماء') == 1", "assert starts_count('قلم عربية قهوة بيت برمجة دفتر حاسوب') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('قلم دفتر سوق نور قمر مطر فجر تفاحة') == 2\nassert starts_count('قمر برمجة صديق') == 1\nassert starts_count('سماء علم مكتبة سماء بيت') == 0\nassert starts_count('باب نور قهوة قهوة نور') == 2\nassert starts_count('مدينة جمل قمر سماء') == 1\nassert starts_count('قلم عربية قهوة بيت برمجة دفتر حاسوب') == 2\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 'ق' in w:\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 'ق' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('قلم دفتر سوق نور قمر مطر فجر تفاحة')` يُرجع `2`.\nالجواب:", "qhash": "1ffb379e5d89a5b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('at camel A1') == 'fy hfrjq A1'", "assert decode('by code light go it') == 'gd htij qnlmy lt ny'", "assert decode('it') == 'ny'", "assert decode('on to Hello') == 'ts yt Hjqqt'", "assert decode('it') == 'ny'", "assert decode('banana cloud of we vector !') == 'gfsfsf hqtzi tk bj ajhytw !'", "assert decode('') == ''"], "test_code": "assert decode('at camel A1') == 'fy hfrjq A1'\nassert decode('by code light go it') == 'gd htij qnlmy lt ny'\nassert decode('it') == 'ny'\nassert decode('on to Hello') == 'ts yt Hjqqt'\nassert decode('it') == 'ny'\nassert decode('banana cloud of we vector !') == 'gfsfsf hqtzi tk bj ajhytw !'\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 + (-21)) % 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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('at camel A1')` يُرجع `'fy hfrjq A1'`.\nالجواب:", "qhash": "32208e5a566282b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 276\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 = 276\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": "dea6c16c9fe0e91d", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(985933160))\nprint(go(go(985933160)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(985933160))\nprint(go(go(985933160)))\n```\nالجواب:", "qhash": "c0b0fc4f836edbd0", "answer": "44\n8", "completion": " الناتج:\n```text\n44\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['falcon', 'light', 'python', 'rocket', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['falcon', 'light', 'python', 'rocket', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "081aedc7b29dc2f0", "answer": "['light', 'falcon', 'python', 'rocket', 'summer']\n['summer', 'rocket', 'python']", "completion": " الناتج:\n```text\n['light', 'falcon', 'python', 'rocket', 'summer']\n['summer', 'rocket', 'python']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 10\nfor x in range(-3, 11, 1):\n result += x * 9\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 10\nfor x in range(-3, 11, 1):\n result += x * 9\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "af558d45987175c3", "answer": "451\n10", "completion": " الناتج:\n```text\n451\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_list([37, 48, 45, 46, 24, 27, 33, 40]) == [40, 37, 48, 45, 46, 24, 27, 33]", "assert rotate_list([6, -6, 7, 44, 48, 43, 42, 0, 23, 42]) == [43, 42, 0, 23, 42, 6, -6, 7, 44, 48]", "assert rotate_list([24, 20, 11, -7, -2, 32, 11]) == [20, 11, -7, -2, 32, 11, 24]", "assert rotate_list([32, -2]) == [-2, 32]", "assert rotate_list([11, -7]) == [-7, 11]", "assert rotate_list([28]) == [28]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([37, 48, 45, 46, 24, 27, 33, 40]) == [40, 37, 48, 45, 46, 24, 27, 33]\nassert rotate_list([6, -6, 7, 44, 48, 43, 42, 0, 23, 42]) == [43, 42, 0, 23, 42, 6, -6, 7, 44, 48]\nassert rotate_list([24, 20, 11, -7, -2, 32, 11]) == [20, 11, -7, -2, 32, 11, 24]\nassert rotate_list([32, -2]) == [-2, 32]\nassert rotate_list([11, -7]) == [-7, 11]\nassert rotate_list([28]) == [28]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nمثال: `rotate_list([37, 48, 45, 46, 24, 27, 33, 40])` يجب أن تُرجع `[40, 37, 48, 45, 46, 24, 27, 33]`.\nالجواب:", "qhash": "67d9980761f63dca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [10, 35, -8, 16, -2, 14, -5, 16, 8]\nprint(items[0:7])\nprint(items[::-2])\nprint(max(items[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [10, 35, -8, 16, -2, 14, -5, 16, 8]\nprint(items[0:7])\nprint(items[::-2])\nprint(max(items[0:7]))\n```\nالجواب:", "qhash": "c9aebf127baab4e3", "answer": "[10, 35, -8, 16, -2, 14, -5]\n[8, -5, -2, -8, 10]\n35", "completion": " الناتج:\n```text\n[10, 35, -8, 16, -2, 14, -5]\n[8, -5, -2, -8, 10]\n35\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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 max_div([-18, -2, -4, -23, -6, 52, 20, 41]) == None", "assert max_div([-16, -40, -40]) == -16", "assert max_div([1, 9, 17]) == None", "assert max_div([37, 14]) == None", "assert max_div([4, -33, -21]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([-18, -2, -4, -23, -6, 52, 20, 41]) == None\nassert max_div([-16, -40, -40]) == -16\nassert max_div([1, 9, 17]) == None\nassert max_div([37, 14]) == None\nassert max_div([4, -33, -21]) == None\nassert max_div([]) == None", "answer": "def max_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 max_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 max_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_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للتوضيح: الاستدعاء `max_div([-18, -2, -4, -23, -6, 52, 20, 41])` يُرجع `None`.\nالجواب:", "qhash": "5e7f4e0bd500fca4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'عمر': 17, 'يوسف': 47, 'حسن': 49, 'مريم': 45}\npoints['عمر'] += 16\npoints['باسل'] = 23\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'عمر': 17, 'يوسف': 47, 'حسن': 49, 'مريم': 45}\npoints['عمر'] += 16\npoints['باسل'] = 23\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('راشد', -1))\n```\nالجواب:", "qhash": "c65ec272de543522", "answer": "5\nحسن\n197\n-1", "completion": " الناتج:\n```text\n5\nحسن\n197\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 10) // 4 for x in range(2, 14) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 10) // 4 for x in range(2, 14) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "1aadeb8de15d2a5d", "answer": "[3, 4, 5]\n3 12", "completion": " الناتج:\n```text\n[3, 4, 5]\n3 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 41) == 1)", "tests": ["assert phi_upto(65) == 64", "assert phi_upto(23) == 23", "assert phi_upto(101) == 99", "assert phi_upto(62) == 61", "assert phi_upto(26) == 26", "assert phi_upto(75) == 74", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(65) == 64\nassert phi_upto(23) == 23\nassert phi_upto(101) == 99\nassert phi_upto(62) == 61\nassert phi_upto(26) == 26\nassert phi_upto(75) == 74\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, 41) == 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, 41) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 41، أي أن القاسم المشترك الأكبر لها مع 41 يساوي 1.\nمثال: `phi_upto(65)` يجب أن تُرجع `64`.\nالجواب:", "qhash": "46d6728ddef138d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 16)", "tests": ["assert between_times([25, 20, -7, -6, -4]) == []", "assert between_times([33, -17, 26]) == []", "assert between_times([-8, 36, -17, 58, -20, 33, 38]) == []", "assert between_times([51, 50, 7, 23, 28, -29]) == [28]", "assert between_times([52, 26, -18]) == []", "assert between_times([25, 43, 26, -24, 20, 17, 49, 9, 31, -12]) == [36]", "assert between_times([-11, 41]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([25, 20, -7, -6, -4]) == []\nassert between_times([33, -17, 26]) == []\nassert between_times([-8, 36, -17, 58, -20, 33, 38]) == []\nassert between_times([51, 50, 7, 23, 28, -29]) == [28]\nassert between_times([52, 26, -18]) == []\nassert between_times([25, 43, 26, -24, 20, 17, 49, 9, 31, -12]) == [36]\nassert between_times([-11, 41]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 16)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 2 و16 (شاملًا الطرفين) في 4.\nمثال: `between_times([25, 20, -7, -6, -4])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "470bc15c80904d85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 15\nfor i in range(-1, 11, 4):\n s += i * 9\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 15\nfor i in range(-1, 11, 4):\n s += i * 9\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "ef013104ebb1588c", "answer": "96\n7", "completion": " الناتج:\n```text\n96\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 7\nfor i in range(10, 27, 2):\n s += i * 9\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 7\nfor i in range(10, 27, 2):\n s += i * 9\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "cb054ed8b25a0d3c", "answer": "1465\n26", "completion": " الناتج:\n```text\n1465\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert turn_list([26, 20, 16, 35, 15]) == [16, 35, 15, 26, 20]", "assert turn_list([27]) == [27]", "assert turn_list([41, 14, 46, 8, 32, 8, 34, 9]) == [46, 8, 32, 8, 34, 9, 41, 14]", "assert turn_list([49, 0, 12, 12, 20, -1, 32, 0, 43]) == [12, 12, 20, -1, 32, 0, 43, 49, 0]", "assert turn_list([21, -1, 24, -8, 12, 27, 45, 44]) == [24, -8, 12, 27, 45, 44, 21, -1]", "assert turn_list([26, 44, 7, 34, 23, -6, -9, -9, 21, 6, -9, 28]) == [7, 34, 23, -6, -9, -9, 21, 6, -9, 28, 26, 44]", "assert turn_list([]) == []"], "test_code": "assert turn_list([26, 20, 16, 35, 15]) == [16, 35, 15, 26, 20]\nassert turn_list([27]) == [27]\nassert turn_list([41, 14, 46, 8, 32, 8, 34, 9]) == [46, 8, 32, 8, 34, 9, 41, 14]\nassert turn_list([49, 0, 12, 12, 20, -1, 32, 0, 43]) == [12, 12, 20, -1, 32, 0, 43, 49, 0]\nassert turn_list([21, -1, 24, -8, 12, 27, 45, 44]) == [24, -8, 12, 27, 45, 44, 21, -1]\nassert turn_list([26, 44, 7, 34, 23, -6, -9, -9, 21, 6, -9, 28]) == [7, 34, 23, -6, -9, -9, 21, 6, -9, 28, 26, 44]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef turn_list(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 turn_list(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return ____\n```\nمثال: `turn_list([26, 20, 16, 35, 15])` يجب أن تُرجع `[16, 35, 15, 26, 20]`.\nالجواب:", "qhash": "fef49f972d281ee3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('it desert falcon garden banana banana') == 'banana|banana|garden|falcon|desert'", "assert mirror_words('') == ''", "assert mirror_words('planet by rocket pixel') == 'pixel|rocket|planet'", "assert mirror_words('river brain to to by is coffee river') == 'river|coffee|brain|river'", "assert mirror_words('engine vector summer matrix to summer garden') == 'garden|summer|matrix|summer|vector|engine'", "assert mirror_words('planet go') == 'planet'", "assert mirror_words('by') == ''"], "test_code": "assert mirror_words('it desert falcon garden banana banana') == 'banana|banana|garden|falcon|desert'\nassert mirror_words('') == ''\nassert mirror_words('planet by rocket pixel') == 'pixel|rocket|planet'\nassert mirror_words('river brain to to by is coffee river') == 'river|coffee|brain|river'\nassert mirror_words('engine vector summer matrix to summer garden') == 'garden|summer|matrix|summer|vector|engine'\nassert mirror_words('planet go') == 'planet'\nassert mirror_words('by') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `mirror_words('it desert falcon garden banana banana')` يُرجع `'banana|banana|garden|falcon|desert'`.\nالجواب:", "qhash": "5ae9d2bf42d0b01a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'راشد': 43, 'سعيد': 7, 'باسل': 23, 'يوسف': 13, 'هشام': 21}\npoints['يوسف'] += 1\npoints['خالد'] = 50\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 = {'راشد': 43, 'سعيد': 7, 'باسل': 23, 'يوسف': 13, 'هشام': 21}\npoints['يوسف'] += 1\npoints['خالد'] = 50\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": "2dab928d6a5998be", "answer": "6\nخالد\n158\n[('سعيد', 7), ('يوسف', 14)]", "completion": " الناتج:\n```text\n6\nخالد\n158\n[('سعيد', 7), ('يوسف', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -3 for x in xs if -5 <= x <= 13)", "tests": ["assert filter_range([6, 3, -3, 13, 9, -9, -4]) == [-39, -27, -18, -9, 9, 12]", "assert filter_range([23, -7, 56, 37, 14, -28]) == []", "assert filter_range([-9, 31, 14, 9]) == [-27]", "assert filter_range([56, -19, 44, 27, -30, 36]) == []", "assert filter_range([-29, 53, 11, 40, 50, 8]) == [-33, -24]", "assert filter_range([35, 3]) == [-9]", "assert filter_range([-29, -6, 7, 5]) == [-21, -15]", "assert filter_range([]) == []"], "test_code": "assert filter_range([6, 3, -3, 13, 9, -9, -4]) == [-39, -27, -18, -9, 9, 12]\nassert filter_range([23, -7, 56, 37, 14, -28]) == []\nassert filter_range([-9, 31, 14, 9]) == [-27]\nassert filter_range([56, -19, 44, 27, -30, 36]) == []\nassert filter_range([-29, 53, 11, 40, 50, 8]) == [-33, -24]\nassert filter_range([35, 3]) == [-9]\nassert filter_range([-29, -6, 7, 5]) == [-21, -15]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -3 for x in xs if -5 <= x <= 13)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -3 for x in xs if -5 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -5 ≤ x ≤ 13، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([6, 3, -3, 13, 9, -9, -4])` يُرجع `[-39, -27, -18, -9, 9, 12]`.\nالجواب:", "qhash": "1f7dd42fedfb70a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([68, 64, 55, 82, 27, 44, 35, 66, 20, 85]) == [68, 132, 0, 82, 109, 153, 0, 66, 86, 0]", "assert capped_cumsum([158, 138, 9, 13, 150, 131, 100]) == [158, 0, 9, 22, 0, 131, 0]", "assert capped_cumsum([137, -8]) == [137, 129]", "assert capped_cumsum([6, 37, 147, 48]) == [6, 43, 0, 48]", "assert capped_cumsum([46, 128, 60]) == [46, 0, 60]", "assert capped_cumsum([125, 51]) == [125, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([68, 64, 55, 82, 27, 44, 35, 66, 20, 85]) == [68, 132, 0, 82, 109, 153, 0, 66, 86, 0]\nassert capped_cumsum([158, 138, 9, 13, 150, 131, 100]) == [158, 0, 9, 22, 0, 131, 0]\nassert capped_cumsum([137, -8]) == [137, 129]\nassert capped_cumsum([6, 37, 147, 48]) == [6, 43, 0, 48]\nassert capped_cumsum([46, 128, 60]) == [46, 0, 60]\nassert capped_cumsum([125, 51]) == [125, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\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 > 165:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 165 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([68, 64, 55, 82, 27, 44, 35, 66, 20, 85])` يجب أن تُرجع `[68, 132, 0, 82, 109, 153, 0, 66, 86, 0]`.\nالجواب:", "qhash": "359a5192ffa7476b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([18, 49, 32, 31, 10, 38]) == [32, 31, 10, 38, 18, 49]", "assert roll([36, 35, 30, 21, 2, 40]) == [30, 21, 2, 40, 36, 35]", "assert roll([43, 30, 30, -8, 13, -5, 3, 35, 2, -9, 0]) == [30, 30, -8, 13, -5, 3, 35, 2, -9, 0, 43]", "assert roll([17, 0, 49, 6, -9, 40, 29]) == [-9, 40, 29, 17, 0, 49, 6]", "assert roll([5, 8, 44, 40]) == [44, 40, 5, 8]", "assert roll([-1, -2, -4, -5, 19, 30, 14, 10]) == [14, 10, -1, -2, -4, -5, 19, 30]", "assert roll([]) == []"], "test_code": "assert roll([18, 49, 32, 31, 10, 38]) == [32, 31, 10, 38, 18, 49]\nassert roll([36, 35, 30, 21, 2, 40]) == [30, 21, 2, 40, 36, 35]\nassert roll([43, 30, 30, -8, 13, -5, 3, 35, 2, -9, 0]) == [30, 30, -8, 13, -5, 3, 35, 2, -9, 0, 43]\nassert roll([17, 0, 49, 6, -9, 40, 29]) == [-9, 40, 29, 17, 0, 49, 6]\nassert roll([5, 8, 44, 40]) == [44, 40, 5, 8]\nassert roll([-1, -2, -4, -5, 19, 30, 14, 10]) == [14, 10, -1, -2, -4, -5, 19, 30]\nassert roll([]) == []", "answer": "def roll(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 roll(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 roll(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return ____\n```\nمثال: `roll([18, 49, 32, 31, 10, 38])` يجب أن تُرجع `[32, 31, 10, 38, 18, 49]`.\nالجواب:", "qhash": "86237dd27e39335d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عمل قلم') == 0", "assert count_start('تفاحة قهوة شمس حديقة تفاحة') == 2", "assert count_start('تفاحة تفاحة دفتر نور فجر') == 2", "assert count_start('تفاحة طائرة فجر تفاحة فجر') == 2", "assert count_start('بيت مطر تفاحة سماء رمل صديق تفاحة رمل') == 2", "assert count_start('حصان بيت برمجة نهار قهوة سفينة تفاحة') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('عمل قلم') == 0\nassert count_start('تفاحة قهوة شمس حديقة تفاحة') == 2\nassert count_start('تفاحة تفاحة دفتر نور فجر') == 2\nassert count_start('تفاحة طائرة فجر تفاحة فجر') == 2\nassert count_start('بيت مطر تفاحة سماء رمل صديق تفاحة رمل') == 2\nassert count_start('حصان بيت برمجة نهار قهوة سفينة تفاحة') == 1\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.split():\n if w.endswith('ت'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ت»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(text):\n count = 0\n for w in text.split():\n if w.endswith('ت'):\n count += 1\n return count\n```\nمثال: `count_start('عمل قلم')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "cf8a5bf51a40a43c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 32, 'سعيد': 47, 'فيصل': 33, 'مريم': 17, 'خالد': 42}\npoints['يوسف'] += 4\npoints['منى'] = 14\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 33])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 32, 'سعيد': 47, 'فيصل': 33, 'مريم': 17, 'خالد': 42}\npoints['يوسف'] += 4\npoints['منى'] = 14\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 33])\n```\nالجواب:", "qhash": "8b3a329eedee6b2e", "answer": "6\nسعيد\n189\n['يوسف', 'سعيد', 'خالد']", "completion": " الناتج:\n```text\n6\nسعيد\n189\n['يوسف', 'سعيد', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 6) // 5 for x in range(-5, 2) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 6) // 5 for x in range(-5, 2) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "2d307fd29fc0d56b", "answer": "[0]\n1 0", "completion": " الناتج:\n```text\n[0]\n1 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 26) == 1)", "tests": ["assert count_gcd1(71) == 33", "assert count_gcd1(113) == 53", "assert count_gcd1(193) == 90", "assert count_gcd1(132) == 61", "assert count_gcd1(104) == 48", "assert count_gcd1(88) == 41", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(71) == 33\nassert count_gcd1(113) == 53\nassert count_gcd1(193) == 90\nassert count_gcd1(132) == 61\nassert count_gcd1(104) == 48\nassert count_gcd1(88) == 41\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, 26) == 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, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 26، أي أن القاسم المشترك الأكبر لها مع 26 يساوي 1.\nمثال: `count_gcd1(71)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "51b1646f7b2cd9e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "tests": ["assert weighted_sum(5) == 1800", "assert weighted_sum(2) == 72", "assert weighted_sum(8) == 10368", "assert weighted_sum(13) == 66248", "assert weighted_sum(4) == 800", "assert weighted_sum(1) == 8", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 1800\nassert weighted_sum(2) == 72\nassert weighted_sum(8) == 10368\nassert weighted_sum(13) == 66248\nassert weighted_sum(4) == 800\nassert weighted_sum(1) == 8\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 3\n return total\n```\nمثال: `weighted_sum(5)` يجب أن تُرجع `1800`.\nالجواب:", "qhash": "ddc207536e90790e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ف')", "tests": ["assert count_hits('نهر عربية حديقة علم دفتر طائرة') == 1", "assert count_hits('ميناء جمل نهر كتاب') == 0", "assert count_hits('كتاب عربية سلام مطر حصان كتاب باب') == 0", "assert count_hits('عمل حديقة قهوة لغة مطر') == 0", "assert count_hits('حصان حاسوب مطر حديقة سفينة صديق صحراء ليل') == 1", "assert count_hits('باب صديق مدرسة جبل') == 0", "assert count_hits('فجر قمر جمل مكتبة ميناء') == 1", "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('حصان حاسوب مطر حديقة سفينة صديق صحراء ليل') == 1\nassert count_hits('باب صديق مدرسة جبل') == 0\nassert count_hits('فجر قمر جمل مكتبة ميناء') == 1\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('نهر عربية حديقة علم دفتر طائرة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "2e28608f2da52b83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert only_div([60, 55, 13, 85, 22, 12, 24, 15, 55, 54, 89]) == 5", "assert only_div([70, -16, 23, 14, 39, 59, -19, 36, 60, 54, -3]) == 2", "assert only_div([81, 84, 47, 8, -7, 0]) == 0", "assert only_div([84, 88, 7]) == 0", "assert only_div([]) == 0", "assert only_div([69, 56, 69, 27, 85, -18, 40, 29, -39, 71]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([60, 55, 13, 85, 22, 12, 24, 15, 55, 54, 89]) == 5\nassert only_div([70, -16, 23, 14, 39, 59, -19, 36, 60, 54, -3]) == 2\nassert only_div([81, 84, 47, 8, -7, 0]) == 0\nassert only_div([84, 88, 7]) == 0\nassert only_div([]) == 0\nassert only_div([69, 56, 69, 27, 85, -18, 40, 29, -39, 71]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([60, 55, 13, 85, 22, 12, 24, 15, 55, 54, 89])` يجب أن تُرجع `5`.\nالجواب:", "qhash": "c749faf386f5ae34"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [8, 25, 36, 19, 16, -1]\nprint(nums[3:6])\nprint(nums[::3])\nprint(sum(nums[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [8, 25, 36, 19, 16, -1]\nprint(nums[3:6])\nprint(nums[::3])\nprint(sum(nums[3:6]))\n```\nالجواب:", "qhash": "3746839be7958cdb", "answer": "[19, 16, -1]\n[8, 19]\n34", "completion": " الناتج:\n```text\n[19, 16, -1]\n[8, 19]\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -4 * x ** 2 + (3) * x + (-9)", "tests": ["assert quad(6) == -135", "assert quad(-1) == -16", "assert quad(4) == -61", "assert quad(5) == -94", "assert quad(-19) == -1510", "assert quad(-12) == -621", "assert quad(-14) == -835", "assert quad(0) == -9"], "test_code": "assert quad(6) == -135\nassert quad(-1) == -16\nassert quad(4) == -61\nassert quad(5) == -94\nassert quad(-19) == -1510\nassert quad(-12) == -621\nassert quad(-14) == -835\nassert quad(0) == -9", "answer": "def quad(x):\n return -4 * x ** 2 + (3) * x + (-9)", "completion": " ```python\ndef quad(x):\n return -4 * x ** 2 + (3) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -4x² + 3x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(6)` يُرجع `-135`.\nالجواب:", "qhash": "599386f83dda6778"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [2, 37, 13, 34, -6]\nprint(nums[0:3])\nprint(nums[::3])\nprint(sum(nums[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [2, 37, 13, 34, -6]\nprint(nums[0:3])\nprint(nums[::3])\nprint(sum(nums[0:3]))\n```\nالجواب:", "qhash": "497bbe5986d07803", "answer": "[2, 37, 13]\n[2, 34]\n52", "completion": " الناتج:\n```text\n[2, 37, 13]\n[2, 34]\n52\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ه')", "tests": ["assert letter_hits('وردة علم باب مدينة تفاحة ميناء طالب عمل') == 0", "assert letter_hits('لغة مطر حاسوب عمل') == 0", "assert letter_hits('كتاب') == 0", "assert letter_hits('عمل سوق مكتبة تفاحة سماء مطر عمل') == 0", "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('كتاب') == 0\nassert letter_hits('عمل سوق مكتبة تفاحة سماء مطر عمل') == 0\nassert letter_hits('سلام قلم') == 0\nassert letter_hits('نور باب') == 0\nassert letter_hits('') == 0\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('وردة علم باب مدينة تفاحة ميناء طالب عمل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "3399e34301ac8fda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_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 max_of_div([32, 59, 57, 56]) == 56", "assert max_of_div([-24, -16, -32]) == -16", "assert max_of_div([1, 9, 17]) == None", "assert max_of_div([30]) == None", "assert max_of_div([13, -19, 24, 23, 0]) == 24", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([32, 59, 57, 56]) == 56\nassert max_of_div([-24, -16, -32]) == -16\nassert max_of_div([1, 9, 17]) == None\nassert max_of_div([30]) == None\nassert max_of_div([13, -19, 24, 23, 0]) == 24\nassert max_of_div([]) == None", "answer": "def max_of_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 max_of_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 max_of_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 max_of_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مثال: `max_of_div([32, 59, 57, 56])` يجب أن تُرجع `56`.\nالجواب:", "qhash": "0e5c272298cb1ac0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'apple'\nprint(len(s))\nprint(s[::-1])\nprint(s.index('p') + len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'apple'\nprint(len(s))\nprint(s[::-1])\nprint(s.index('p') + len(s))\n```\nالجواب:", "qhash": "4f2a4770ac4e3285", "answer": "5\nelppa\n6", "completion": " الناتج:\n```text\n5\nelppa\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'جمل فجر'\nprint(text.replace(' ', '-'))\nprint(text.count('ر'))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'جمل فجر'\nprint(text.replace(' ', '-'))\nprint(text.count('ر'))\nprint(text[::-1])\n```\nالجواب:", "qhash": "732741b28ba9c609", "answer": "جمل-فجر\n1\nرجف لمج", "completion": " الناتج:\n```text\nجمل-فجر\n1\nرجف لمج\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(compute(5))\nprint(compute(5, -1))\nprint(compute(compute(-1), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(compute(5))\nprint(compute(5, -1))\nprint(compute(compute(-1), 5))\n```\nالجواب:", "qhash": "c4dbbedc6e34506e", "answer": "53\n31\n277", "completion": " الناتج:\n```text\n53\n31\n277\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= -9)", "tests": ["assert filter_range([-10, -7, -13, -15, 1, -26, -5]) == [-75, -65, -50]", "assert filter_range([49]) == []", "assert filter_range([-9, -10, -29, 32, -28, -25, 28, 27, 31, 47]) == [-50, -45]", "assert filter_range([59, 53, 4, -12, 41, -25, 37, 32, 52]) == [-60]", "assert filter_range([-1, 24, 11]) == []", "assert filter_range([53, 15, 13, 40, 47, 54, 27, 58, 48]) == []", "assert filter_range([4]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([-10, -7, -13, -15, 1, -26, -5]) == [-75, -65, -50]\nassert filter_range([49]) == []\nassert filter_range([-9, -10, -29, 32, -28, -25, 28, 27, 31, 47]) == [-50, -45]\nassert filter_range([59, 53, 4, -12, 41, -25, 37, 32, 52]) == [-60]\nassert filter_range([-1, 24, 11]) == []\nassert filter_range([53, 15, 13, 40, 47, 54, 27, 58, 48]) == []\nassert filter_range([4]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= -9)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 5 for x in xs if -16 <= x <= -9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -16 ≤ x ≤ -9، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([-10, -7, -13, -15, 1, -26, -5])` يُرجع `[-75, -65, -50]`.\nالجواب:", "qhash": "3ec25847c043837b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [-1, -7, 4, 10, 17, 18, 21, 25, 35]\nprint(lst[1:6])\nprint(lst[::3])\nprint(min(lst[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [-1, -7, 4, 10, 17, 18, 21, 25, 35]\nprint(lst[1:6])\nprint(lst[::3])\nprint(min(lst[1:6]))\n```\nالجواب:", "qhash": "c82d1e68e47ce925", "answer": "[-7, 4, 10, 17, 18]\n[-1, 10, 21]\n-7", "completion": " الناتج:\n```text\n[-7, 4, 10, 17, 18]\n[-1, 10, 21]\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([1, -7, 0, 30]) == 0", "assert best_multiple([-40, -16, -24]) == -16", "assert best_multiple([1]) == None", "assert best_multiple([27, 2, 34, 4, 23, -8, 14, -36]) == -8", "assert best_multiple([24, 48, -6, -42]) == 48", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([1, -7, 0, 30]) == 0\nassert best_multiple([-40, -16, -24]) == -16\nassert best_multiple([1]) == None\nassert best_multiple([27, 2, 34, 4, 23, -8, 14, -36]) == -8\nassert best_multiple([24, 48, -6, -42]) == 48\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(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مثال: `best_multiple([1, -7, 0, 30])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "a390da91d627dc28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(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_special([56, 6, 27, 81, 90, 66, 7, 63, 13]) == 3", "assert count_special([7, 70, 60, -23, -32, -32, -8, 24, 39]) == 0", "assert count_special([]) == 0", "assert count_special([34, 36, 30, 4]) == 1", "assert count_special([-30, 35, 87, 2, 51, -11, -2, -38]) == 0", "assert count_special([-34, -12]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([56, 6, 27, 81, 90, 66, 7, 63, 13]) == 3\nassert count_special([7, 70, 60, -23, -32, -32, -8, 24, 39]) == 0\nassert count_special([]) == 0\nassert count_special([34, 36, 30, 4]) == 1\nassert count_special([-30, 35, 87, 2, 51, -11, -2, -38]) == 0\nassert count_special([-34, -12]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_special([56, 6, 27, 81, 90, 66, 7, 63, 13])` يُرجع `3`.\nالجواب:", "qhash": "779afce0098b6026"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'حاسوب'\nprint(len(s))\nprint(s.find('ت'))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'حاسوب'\nprint(len(s))\nprint(s.find('ت'))\nprint(s[-1])\n```\nالجواب:", "qhash": "1860ba7d24a8fbfa", "answer": "5\n-1\nب", "completion": " الناتج:\n```text\n5\n-1\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('music river matrix a') == 'a/matrix/river/music'", "assert backwards('stone winter desert is falcon is') == 'is/falcon/is/desert/winter/stone'", "assert backwards('') == ''", "assert backwards('signal desert banana') == 'banana/desert/signal'", "assert backwards('') == ''", "assert backwards('engine garden brain rocket camel we') == 'we/camel/rocket/brain/garden/engine'", "assert backwards('up falcon engine desert pixel at to pixel') == 'pixel/to/at/pixel/desert/engine/falcon/up'"], "test_code": "assert backwards('music river matrix a') == 'a/matrix/river/music'\nassert backwards('stone winter desert is falcon is') == 'is/falcon/is/desert/winter/stone'\nassert backwards('') == ''\nassert backwards('signal desert banana') == 'banana/desert/signal'\nassert backwards('') == ''\nassert backwards('engine garden brain rocket camel we') == 'we/camel/rocket/brain/garden/engine'\nassert backwards('up falcon engine desert pixel at to pixel') == 'pixel/to/at/pixel/desert/engine/falcon/up'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('music river matrix a')` يُرجع `'a/matrix/river/music'`.\nالجواب:", "qhash": "cb39b4e1d893553c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [14, 38, -7, 38, 38, 36, -1, 12, 13]\nprint(data[0:8])\nprint(data[::-1])\nprint(min(data[0:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [14, 38, -7, 38, 38, 36, -1, 12, 13]\nprint(data[0:8])\nprint(data[::-1])\nprint(min(data[0:8]))\n```\nالجواب:", "qhash": "4f8909c8374505a9", "answer": "[14, 38, -7, 38, 38, 36, -1, 12]\n[13, 12, -1, 36, 38, 38, -7, 38, 14]\n-7", "completion": " الناتج:\n```text\n[14, 38, -7, 38, 38, 36, -1, 12]\n[13, 12, -1, 36, 38, 38, -7, 38, 14]\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('شجرة عربية لغة حصان') == 1", "assert count_ar('طائرة') == 0", "assert count_ar('وردة سوق ماء ماء قمر برمجة مكتبة خبز') == 0", "assert count_ar('') == 0", "assert count_ar('برتقال تفاحة برتقال') == 2", "assert count_ar('') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('ميناء برتقال عمل حصان') == 2\nassert count_ar('شجرة عربية لغة حصان') == 1\nassert count_ar('طائرة') == 0\nassert count_ar('وردة سوق ماء ماء قمر برمجة مكتبة خبز') == 0\nassert count_ar('') == 0\nassert count_ar('برتقال تفاحة برتقال') == 2\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": "a6137f64db20996b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -7 <= x <= 29)", "tests": ["assert in_range_scaled([29, 25, 21, 3, 33, -9, 16]) == [-87, -75, -63, -48, -9]", "assert in_range_scaled([-8, 20, 2, 30, -11, -29, 2, 5]) == [-60, -15, -6, -6]", "assert in_range_scaled([-14, 19, 19, 49, 1, 16]) == [-57, -57, -48, -3]", "assert in_range_scaled([41, 22, -8, 60, 1, 43, 49, -29, -10]) == [-66, -3]", "assert in_range_scaled([-7, 46, 21, 48]) == [-63, 21]", "assert in_range_scaled([22, -1, 31, 20, 4, 46, -10]) == [-66, -60, -12, 3]", "assert in_range_scaled([-16, 17, 4]) == [-51, -12]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([29, 25, 21, 3, 33, -9, 16]) == [-87, -75, -63, -48, -9]\nassert in_range_scaled([-8, 20, 2, 30, -11, -29, 2, 5]) == [-60, -15, -6, -6]\nassert in_range_scaled([-14, 19, 19, 49, 1, 16]) == [-57, -57, -48, -3]\nassert in_range_scaled([41, 22, -8, 60, 1, 43, 49, -29, -10]) == [-66, -3]\nassert in_range_scaled([-7, 46, 21, 48]) == [-63, 21]\nassert in_range_scaled([22, -1, 31, 20, 4, 46, -10]) == [-66, -60, -12, 3]\nassert in_range_scaled([-16, 17, 4]) == [-51, -12]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -7 <= x <= 29)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -7 <= x <= 29)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و29 (شاملًا الطرفين) في -3.\nمثال: `in_range_scaled([29, 25, 21, 3, 33, -9, 16])` يجب أن تُرجع `[-87, -75, -63, -48, -9]`.\nالجواب:", "qhash": "d892934d73d83a54"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(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_special([66, 83, 86, 28, 26, 36, 14]) == 0", "assert count_special([84, 75, 35, 5, 56, 63]) == 3", "assert count_special([-22, 44, 83, 23, 22, 65, 10, -16, -15, 24]) == 3", "assert count_special([-23, -37, 29, 55, 21, 14, 6, 86, -8, 29]) == 1", "assert count_special([-37, 30, -1, -5, 49, -24, -11, -3, 27, -37, 60, 84]) == 2", "assert count_special([45, -9]) == 1", "assert count_special([]) == 0"], "test_code": "assert count_special([66, 83, 86, 28, 26, 36, 14]) == 0\nassert count_special([84, 75, 35, 5, 56, 63]) == 3\nassert count_special([-22, 44, 83, 23, 22, 65, 10, -16, -15, 24]) == 3\nassert count_special([-23, -37, 29, 55, 21, 14, 6, 86, -8, 29]) == 1\nassert count_special([-37, 30, -1, -5, 49, -24, -11, -3, 27, -37, 60, 84]) == 2\nassert count_special([45, -9]) == 1\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_special([66, 83, 86, 28, 26, 36, 14])` يُرجع `0`.\nالجواب:", "qhash": "c53a05eea6453a9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 13", "tests": ["assert prod_mod(8) == 2", "assert prod_mod(43) == 0", "assert prod_mod(42) == 0", "assert prod_mod(10) == 7", "assert prod_mod(18) == 5", "assert prod_mod(5) == 10", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(8) == 2\nassert prod_mod(43) == 0\nassert prod_mod(42) == 0\nassert prod_mod(10) == 7\nassert prod_mod(18) == 5\nassert prod_mod(5) == 10\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 13", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(8)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "9bf53d92d13e8f55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "tests": ["assert total_pow(5) == 660", "assert total_pow(8) == 2448", "assert total_pow(9) == 3420", "assert total_pow(2) == 60", "assert total_pow(7) == 1680", "assert total_pow(1) == 12", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 660\nassert total_pow(8) == 2448\nassert total_pow(9) == 3420\nassert total_pow(2) == 60\nassert total_pow(7) == 1680\nassert total_pow(1) == 12\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 2\n return total\n```\nمثال: `total_pow(5)` يجب أن تُرجع `660`.\nالجواب:", "qhash": "05f86927060daca7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 7", "tests": ["assert fact_mod(11) == 0", "assert fact_mod(12) == 6", "assert fact_mod(20) == 2", "assert fact_mod(54) == 0", "assert fact_mod(25) == 0", "assert fact_mod(35) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 0\nassert fact_mod(12) == 6\nassert fact_mod(20) == 2\nassert fact_mod(54) == 0\nassert fact_mod(25) == 0\nassert fact_mod(35) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 7", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(11)` يُرجع `0`.\nالجواب:", "qhash": "7619f6430b405193"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 10\nfor i in range(2, 6, 1):\n total -= i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 10\nfor i in range(2, 6, 1):\n total -= i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "10805ea94f5ad4c0", "answer": "-74\n5", "completion": " الناتج:\n```text\n-74\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'co'}", "tests": ["assert count_chars('an matrix vector') == {'c': 1, 'o': 1}", "assert count_chars('desert it orange by data') == {'c': 0, 'o': 1}", "assert count_chars('stone it table') == {'c': 0, 'o': 1}", "assert count_chars('garden camel light by brain coffee') == {'c': 2, 'o': 1}", "assert count_chars('data an music orange apple') == {'c': 1, 'o': 1}", "assert count_chars('code stone') == {'c': 1, 'o': 2}", "assert count_chars('') == {'c': 0, 'o': 0}"], "test_code": "assert count_chars('an matrix vector') == {'c': 1, 'o': 1}\nassert count_chars('desert it orange by data') == {'c': 0, 'o': 1}\nassert count_chars('stone it table') == {'c': 0, 'o': 1}\nassert count_chars('garden camel light by brain coffee') == {'c': 2, 'o': 1}\nassert count_chars('data an music orange apple') == {'c': 1, 'o': 1}\nassert count_chars('code stone') == {'c': 1, 'o': 2}\nassert count_chars('') == {'c': 0, 'o': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'co'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'co'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('an matrix vector')` يُرجع `{'c': 1, 'o': 1}`.\nالجواب:", "qhash": "012b65252e5ea9c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 51)", "tests": ["assert between_times([37, 5, 44, 3, 13, 25]) == [65, 125, 185, 220]", "assert between_times([-29, 2, 52, 20, -5, -6, 8]) == [100]", "assert between_times([51, 40, 2, 13, 48]) == [65, 200, 240, 255]", "assert between_times([-20, -30]) == []", "assert between_times([39, 44, 52, 12, 28, 9, 2]) == [140, 195, 220]", "assert between_times([23, 10]) == [115]", "assert between_times([0, -13, 26, 31, -13, -10]) == [130, 155]", "assert between_times([]) == []"], "test_code": "assert between_times([37, 5, 44, 3, 13, 25]) == [65, 125, 185, 220]\nassert between_times([-29, 2, 52, 20, -5, -6, 8]) == [100]\nassert between_times([51, 40, 2, 13, 48]) == [65, 200, 240, 255]\nassert between_times([-20, -30]) == []\nassert between_times([39, 44, 52, 12, 28, 9, 2]) == [140, 195, 220]\nassert between_times([23, 10]) == [115]\nassert between_times([0, -13, 26, 31, -13, -10]) == [130, 155]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 51)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 51)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 13 ≤ x ≤ 51، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([37, 5, 44, 3, 13, 25])` يُرجع `[65, 125, 185, 220]`.\nالجواب:", "qhash": "de3744c933081f32"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 79", "tests": ["assert digit_power(28089) == 55", "assert digit_power(392414) == 48", "assert digit_power(255538) == 73", "assert digit_power(281605) == 51", "assert digit_power(82123) == 3", "assert digit_power(681457) == 33", "assert digit_power(250882) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(28089) == 55\nassert digit_power(392414) == 48\nassert digit_power(255538) == 73\nassert digit_power(281605) == 51\nassert digit_power(82123) == 3\nassert digit_power(681457) == 33\nassert digit_power(250882) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 79", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 79.\nمثال: `digit_power(28089)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "310d077442724ce4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['desert', 'vector', 'winter', 'signal', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['desert', 'vector', 'winter', 'signal', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "d310c4ddb3c8f54d", "answer": "['desert', 'vector', 'winter', 'signal', 'summer']\n['winter', 'vector', 'summer']", "completion": " الناتج:\n```text\n['desert', 'vector', 'winter', 'signal', 'summer']\n['winter', 'vector', 'summer']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -5 for x in xs if -4 <= x <= 14)", "tests": ["assert select_range([10, 11, 9, 22, 5, 15]) == [-55, -50, -45, -25]", "assert select_range([44, 28, 54]) == []", "assert select_range([15, 51, -28, -1, 0, 43, -11, 18, -24]) == [0, 5]", "assert select_range([14, 50, 2, 8, 19]) == [-70, -40, -10]", "assert select_range([49]) == []", "assert select_range([-27, 42, 60]) == []", "assert select_range([6, -24, 48, 37, -17, 40, 29, 23, 1, -19]) == [-30, -5]", "assert select_range([]) == []"], "test_code": "assert select_range([10, 11, 9, 22, 5, 15]) == [-55, -50, -45, -25]\nassert select_range([44, 28, 54]) == []\nassert select_range([15, 51, -28, -1, 0, 43, -11, 18, -24]) == [0, 5]\nassert select_range([14, 50, 2, 8, 19]) == [-70, -40, -10]\nassert select_range([49]) == []\nassert select_range([-27, 42, 60]) == []\nassert select_range([6, -24, 48, 37, -17, 40, 29, 23, 1, -19]) == [-30, -5]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -5 for x in xs if -4 <= x <= 14)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -5 for x in xs if -4 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -4 ≤ x ≤ 14، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([10, 11, 9, 22, 5, 15])` يُرجع `[-55, -50, -45, -25]`.\nالجواب:", "qhash": "7c80ac9732fa82f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 1 + 2 for x in range(6, 18) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 1 + 2 for x in range(6, 18) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "7b9714a3b90880b4", "answer": "[11, 16]\n2 27", "completion": " الناتج:\n```text\n[11, 16]\n2 27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -7 * x ** 2 + (-9) * x + (-7)", "tests": ["assert p(1) == -23", "assert p(11) == -953", "assert p(10) == -797", "assert p(-6) == -205", "assert p(-5) == -137", "assert p(20) == -2987", "assert p(3) == -97", "assert p(0) == -7"], "test_code": "assert p(1) == -23\nassert p(11) == -953\nassert p(10) == -797\nassert p(-6) == -205\nassert p(-5) == -137\nassert p(20) == -2987\nassert p(3) == -97\nassert p(0) == -7", "answer": "def p(x):\n return -7 * x ** 2 + (-9) * x + (-7)", "completion": " ```python\ndef p(x):\n return -7 * x ** 2 + (-9) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -7x² - 9x - 7 عند العدد الصحيح x.\nمثال: `p(1)` يجب أن تُرجع `-23`.\nالجواب:", "qhash": "fb99f48d324c6fe1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 71", "tests": ["assert mfact(6) == 10", "assert mfact(45) == 3", "assert mfact(55) == 57", "assert mfact(18) == 56", "assert mfact(22) == 61", "assert mfact(1) == 1", "assert mfact(0) == 1"], "test_code": "assert mfact(6) == 10\nassert mfact(45) == 3\nassert mfact(55) == 57\nassert mfact(18) == 56\nassert mfact(22) == 61\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)) % 71", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(6)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "6f2d4e9fbf515672"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "reverse_words", "reference": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert reverse_words('is apple data window matrix') == 'matrix window data apple is'", "assert reverse_words('') == ''", "assert reverse_words('matrix winter winter desert cloud') == 'cloud desert winter winter matrix'", "assert reverse_words('music apple falcon code engine table') == 'table engine code falcon apple music'", "assert reverse_words('') == ''", "assert reverse_words('') == ''", "assert reverse_words('matrix desert') == 'desert matrix'"], "test_code": "assert reverse_words('is apple data window matrix') == 'matrix window data apple is'\nassert reverse_words('') == ''\nassert reverse_words('matrix winter winter desert cloud') == 'cloud desert winter winter matrix'\nassert reverse_words('music apple falcon code engine table') == 'table engine code falcon apple music'\nassert reverse_words('') == ''\nassert reverse_words('') == ''\nassert reverse_words('matrix desert') == 'desert matrix'", "answer": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reverse_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ' '.\nمثال: `reverse_words('is apple data window matrix')` يجب أن تُرجع `'matrix window data apple is'`.\nالجواب:", "qhash": "16b9524ccd338541"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'ليلى': 20, 'منى': 9, 'يوسف': 34, 'سعيد': 43, 'رنا': 42}\nmarks['سعيد'] += 20\nmarks['نور'] = 0\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'ليلى': 20, 'منى': 9, 'يوسف': 34, 'سعيد': 43, 'رنا': 42}\nmarks['سعيد'] += 20\nmarks['نور'] = 0\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('مريم', -1))\n```\nالجواب:", "qhash": "976b62137bc01b73", "answer": "6\nسعيد\n168\n-1", "completion": " الناتج:\n```text\n6\nسعيد\n168\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'ns'}", "tests": ["assert char_counts('an table table river') == {'n': 1, 's': 0}", "assert char_counts('go banana') == {'n': 2, 's': 0}", "assert char_counts('in we signal') == {'n': 2, 's': 1}", "assert char_counts('go banana engine at coffee') == {'n': 4, 's': 0}", "assert char_counts('an stone orange a up vector') == {'n': 3, 's': 1}", "assert char_counts('planet') == {'n': 1, 's': 0}", "assert char_counts('') == {'n': 0, 's': 0}"], "test_code": "assert char_counts('an table table river') == {'n': 1, 's': 0}\nassert char_counts('go banana') == {'n': 2, 's': 0}\nassert char_counts('in we signal') == {'n': 2, 's': 1}\nassert char_counts('go banana engine at coffee') == {'n': 4, 's': 0}\nassert char_counts('an stone orange a up vector') == {'n': 3, 's': 1}\nassert char_counts('planet') == {'n': 1, 's': 0}\nassert char_counts('') == {'n': 0, 's': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'ns'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'ns'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'n'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('an table table river')` يُرجع `{'n': 1, 's': 0}`.\nالجواب:", "qhash": "5d768f2a846d53fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 15\nfor i in range(10, 21, 2):\n acc += i * 1\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 15\nfor i in range(10, 21, 2):\n acc += i * 1\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "8000793e14e036d5", "answer": "105\n20", "completion": " الناتج:\n```text\n105\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('light banana !') == 'jgefr zylyly !'", "assert caesar('code camel table is 2024') == 'ambc aykcj ryzjc gq 2024'", "assert caesar('camel is !') == 'aykcj gq !'", "assert caesar('winter a data') == 'uglrcp y byry'", "assert caesar('music a Hello') == 'ksqga y Hcjjm'", "assert caesar('pixel orange summer banana') == 'ngvcj mpylec qskkcp zylyly'", "assert caesar('') == ''"], "test_code": "assert caesar('light banana !') == 'jgefr zylyly !'\nassert caesar('code camel table is 2024') == 'ambc aykcj ryzjc gq 2024'\nassert caesar('camel is !') == 'aykcj gq !'\nassert caesar('winter a data') == 'uglrcp y byry'\nassert caesar('music a Hello') == 'ksqga y Hcjjm'\nassert caesar('pixel orange summer banana') == 'ngvcj mpylec qskkcp zylyly'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('light banana !')` يجب أن تُرجع `'jgefr zylyly !'`.\nالجواب:", "qhash": "ecfe1c362f83bf40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'dr'}", "tests": ["assert count_chars('we') == {'d': 0, 'r': 0}", "assert count_chars('engine window rocket coffee') == {'d': 1, 'r': 1}", "assert count_chars('river a light music') == {'d': 0, 'r': 2}", "assert count_chars('vector planet coffee winter') == {'d': 0, 'r': 2}", "assert count_chars('pixel cloud code planet window matrix') == {'d': 3, 'r': 1}", "assert count_chars('it coffee data a coffee') == {'d': 1, 'r': 0}", "assert count_chars('') == {'d': 0, 'r': 0}"], "test_code": "assert count_chars('we') == {'d': 0, 'r': 0}\nassert count_chars('engine window rocket coffee') == {'d': 1, 'r': 1}\nassert count_chars('river a light music') == {'d': 0, 'r': 2}\nassert count_chars('vector planet coffee winter') == {'d': 0, 'r': 2}\nassert count_chars('pixel cloud code planet window matrix') == {'d': 3, 'r': 1}\nassert count_chars('it coffee data a coffee') == {'d': 1, 'r': 0}\nassert count_chars('') == {'d': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'dr'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'dr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('we')` يجب أن تُرجع `{'d': 0, 'r': 0}`.\nالجواب:", "qhash": "e64ca7d9af906d26"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -2)", "tests": ["assert clip_scale([5, -17, 0, -14, 6, 4, -17, -7, -15]) == [-35]", "assert clip_scale([33, 7, 21, 35, 47, -8, 24, 42, 50]) == [-40]", "assert clip_scale([]) == []", "assert clip_scale([]) == []", "assert clip_scale([52, 4, 44, 24, 30, 9, 18, 12, 38]) == []", "assert clip_scale([39]) == []", "assert clip_scale([13, 19, 6, 12, 16, 36, -4, -29, -22, -17]) == [-20]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([5, -17, 0, -14, 6, 4, -17, -7, -15]) == [-35]\nassert clip_scale([33, 7, 21, 35, 47, -8, 24, 42, 50]) == [-40]\nassert clip_scale([]) == []\nassert clip_scale([]) == []\nassert clip_scale([52, 4, 44, 24, 30, 9, 18, 12, 38]) == []\nassert clip_scale([39]) == []\nassert clip_scale([13, 19, 6, 12, 16, 36, -4, -29, -22, -17]) == [-20]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -2)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق -10 ≤ x ≤ -2، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([5, -17, 0, -14, 6, 4, -17, -7, -15])` يُرجع `[-35]`.\nالجواب:", "qhash": "3736df631927a6ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "tests": ["assert series(3) == 1176", "assert series(13) == 1071252", "assert series(3) == 1176", "assert series(4) == 4248", "assert series(10) == 303996", "assert series(1) == 12", "assert series(0) == 0"], "test_code": "assert series(3) == 1176\nassert series(13) == 1071252\nassert series(3) == 1176\nassert series(4) == 4248\nassert series(10) == 303996\nassert series(1) == 12\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `series(3)` يُرجع `1176`.\nالجواب:", "qhash": "4d7ca60734b7a957"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-9, 36, 20, -5, 50, -13, -20, 47]) == 36", "assert best_multiple([-20, -12, -16]) == -12", "assert best_multiple([1]) == None", "assert best_multiple([36, 4, -30, -38, 27, -21, -15, -25, -26]) == 36", "assert best_multiple([-48, 26, -22, 16]) == 16", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-9, 36, 20, -5, 50, -13, -20, 47]) == 36\nassert best_multiple([-20, -12, -16]) == -12\nassert best_multiple([1]) == None\nassert best_multiple([36, 4, -30, -38, 27, -21, -15, -25, -26]) == 36\nassert best_multiple([-48, 26, -22, 16]) == 16\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([-9, 36, 20, -5, 50, -13, -20, 47])` يجب أن تُرجع `36`.\nالجواب:", "qhash": "099cb15b649c56d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'برتقال'\nprint(w.find('ل'))\nprint(w[0])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'برتقال'\nprint(w.find('ل'))\nprint(w[0])\nprint(w.split())\n```\nالجواب:", "qhash": "03ae991ef5267467", "answer": "5\nب\n['برتقال']", "completion": " الناتج:\n```text\n5\nب\n['برتقال']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-27, 23, 38, 27, -14]) == None", "assert biggest_mult([-22, -11, -55]) == -11", "assert biggest_mult([1, 12]) == None", "assert biggest_mult([-5]) == None", "assert biggest_mult([-34, -20, 9]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-27, 23, 38, 27, -14]) == None\nassert biggest_mult([-22, -11, -55]) == -11\nassert biggest_mult([1, 12]) == None\nassert biggest_mult([-5]) == None\nassert biggest_mult([-34, -20, 9]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([-27, 23, 38, 27, -14])` يُرجع `None`.\nالجواب:", "qhash": "80b83c66d9c9f59d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([45, 60, 8, 40, 14, 47, 70]) == [45, 105, 113, 0, 14, 61, 131]", "assert rolling_total([16, 81, 46, 4, 2, 83]) == [16, 97, 0, 4, 6, 89]", "assert rolling_total([20, 94, 72, 118, 61, 10, 66, 40]) == [20, 114, 0, 118, 0, 10, 76, 116]", "assert rolling_total([88, 105, 0]) == [88, 0, 0]", "assert rolling_total([0]) == [0]", "assert rolling_total([30, 5, 61, -9]) == [30, 35, 96, 87]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([45, 60, 8, 40, 14, 47, 70]) == [45, 105, 113, 0, 14, 61, 131]\nassert rolling_total([16, 81, 46, 4, 2, 83]) == [16, 97, 0, 4, 6, 89]\nassert rolling_total([20, 94, 72, 118, 61, 10, 66, 40]) == [20, 114, 0, 118, 0, 10, 76, 116]\nassert rolling_total([88, 105, 0]) == [88, 0, 0]\nassert rolling_total([0]) == [0]\nassert rolling_total([30, 5, 61, -9]) == [30, 35, 96, 87]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\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 > 133:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 133 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([45, 60, 8, 40, 14, 47, 70])` يُرجع `[45, 105, 113, 0, 14, 61, 131]`.\nالجواب:", "qhash": "cf513420744cb237"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('خالد', 59), ('علي', 27), ('عمر', 60), ('نور', 69)]\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 = [('خالد', 59), ('علي', 27), ('عمر', 60), ('نور', 69)]\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": "3bc760f0bd3db578", "answer": "[('علي', 27), ('خالد', 59), ('عمر', 60), ('نور', 69)]\n['نور', 'عمر']", "completion": " الناتج:\n```text\n[('علي', 27), ('خالد', 59), ('عمر', 60), ('نور', 69)]\n['نور', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [33, 29, 4, 35, 4, 2, 40]\nprint(items[1:3])\nprint(items[::-2])\nprint(len(items[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [33, 29, 4, 35, 4, 2, 40]\nprint(items[1:3])\nprint(items[::-2])\nprint(len(items[1:3]))\n```\nالجواب:", "qhash": "6252d61d5cf5356e", "answer": "[29, 4]\n[40, 4, 4, 33]\n2", "completion": " الناتج:\n```text\n[29, 4]\n[40, 4, 4, 33]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -13 <= x <= 8)", "tests": ["assert in_range_scaled([4, 9, 17, 0, -14, -16, -22, 13, -3]) == [-12, 0, 9]", "assert in_range_scaled([38, -22, 19, 54, 0]) == [0]", "assert in_range_scaled([7, 21, 26, -10, 20, 19]) == [-21, 30]", "assert in_range_scaled([44, 6, -25, -5, -15, 45]) == [-18, 15]", "assert in_range_scaled([49, -13, 22, 33, 15, -6, -29, 47, 13]) == [18, 39]", "assert in_range_scaled([2, 8, 54, 20, -29]) == [-24, -6]", "assert in_range_scaled([55, 42, -18, 21, 34]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([4, 9, 17, 0, -14, -16, -22, 13, -3]) == [-12, 0, 9]\nassert in_range_scaled([38, -22, 19, 54, 0]) == [0]\nassert in_range_scaled([7, 21, 26, -10, 20, 19]) == [-21, 30]\nassert in_range_scaled([44, 6, -25, -5, -15, 45]) == [-18, 15]\nassert in_range_scaled([49, -13, 22, 33, 15, -6, -29, 47, 13]) == [18, 39]\nassert in_range_scaled([2, 8, 54, 20, -29]) == [-24, -6]\nassert in_range_scaled([55, 42, -18, 21, 34]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -13 <= x <= 8)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -3 for x in xs if -13 <= x <= 8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -13 و8 (شاملًا الطرفين) في -3.\nمثال: `in_range_scaled([4, 9, 17, 0, -14, -16, -22, 13, -3])` يجب أن تُرجع `[-12, 0, 9]`.\nالجواب:", "qhash": "a69750410eecf18e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 196\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 = 196\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": "5e2027f3820629da", "answer": "26", "completion": " الناتج:\n```text\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سيارة ماء تفاحة نور') == 0", "assert count_start('حصان رمل نهار مطر رمل') == 2", "assert count_start('معلم سوق') == 0", "assert count_start('حصان عربية قمر عربية') == 0", "assert count_start('مكتبة دفتر') == 0", "assert count_start('تفاحة صحراء برمجة رمل بحر مدينة رمل') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('سيارة ماء تفاحة نور') == 0\nassert count_start('حصان رمل نهار مطر رمل') == 2\nassert count_start('معلم سوق') == 0\nassert count_start('حصان عربية قمر عربية') == 0\nassert count_start('مكتبة دفتر') == 0\nassert count_start('تفاحة صحراء برمجة رمل بحر مدينة رمل') == 2\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('سيارة ماء تفاحة نور')` يُرجع `0`.\nالجواب:", "qhash": "6b49be3e81e8dd00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(230) == 5806", "assert multiples_total(168) == 3082", "assert multiples_total(41) == 205", "assert multiples_total(52) == 346", "assert multiples_total(188) == 3957", "assert multiples_total(45) == 247", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(230) == 5806\nassert multiples_total(168) == 3082\nassert multiples_total(41) == 205\nassert multiples_total(52) == 346\nassert multiples_total(188) == 3957\nassert multiples_total(45) == 247\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 10.\nمثال: `multiples_total(230)` يجب أن تُرجع `5806`.\nالجواب:", "qhash": "2e142bba13ac8ae1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 54046\ncount = 0\nwhile x > 1:\n x = x // 2\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 54046\ncount = 0\nwhile x > 1:\n x = x // 2\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "982f5d9cd9b7dfbf", "answer": "1 15", "completion": " الناتج:\n```text\n1 15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "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 % 3 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([6, 83, 71, 9, 14, 76, 79, 47, 41]) == 0", "assert how_many_div([78, 13, 29]) == 0", "assert how_many_div([-12, 1, -16, 0, -26, -14, 77, 17, -10, -11, 68, 75]) == 0", "assert how_many_div([48]) == 0", "assert how_many_div([19, -17, -8, 38, 33]) == 0", "assert how_many_div([-11, 51, 2, -39, 40, 41, 29, 39, 73]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([6, 83, 71, 9, 14, 76, 79, 47, 41]) == 0\nassert how_many_div([78, 13, 29]) == 0\nassert how_many_div([-12, 1, -16, 0, -26, -14, 77, 17, -10, -11, 68, 75]) == 0\nassert how_many_div([48]) == 0\nassert how_many_div([19, -17, -8, 38, 33]) == 0\nassert how_many_div([-11, 51, 2, -39, 40, 41, 29, 39, 73]) == 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 % 3 != 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 % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([6, 83, 71, 9, 14, 76, 79, 47, 41])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "c9ccc999bf7f6a13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "tests": ["assert series(8) == 204", "assert series(9) == 285", "assert series(15) == 1240", "assert series(5) == 55", "assert series(9) == 285", "assert series(1) == 1", "assert series(0) == 0"], "test_code": "assert series(8) == 204\nassert series(9) == 285\nassert series(15) == 1240\nassert series(5) == 55\nassert series(9) == 285\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 ** 2\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `series(8)` يُرجع `204`.\nالجواب:", "qhash": "716a45af93fa1c78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 32", "tests": ["assert digit_score(34543) == 19", "assert digit_score(426485) == 29", "assert digit_score(704958) == 13", "assert digit_score(897814) == 17", "assert digit_score(164361) == 13", "assert digit_score(700163) == 11", "assert digit_score(480358) == 24", "assert digit_score(0) == 0"], "test_code": "assert digit_score(34543) == 19\nassert digit_score(426485) == 29\nassert digit_score(704958) == 13\nassert digit_score(897814) == 17\nassert digit_score(164361) == 13\nassert digit_score(700163) == 11\nassert digit_score(480358) == 24\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 32", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 32\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 32.\nللتوضيح: الاستدعاء `digit_score(34543)` يُرجع `19`.\nالجواب:", "qhash": "4b3534c42f17b393"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 9", "tests": ["assert digits_mod(69201) == 5", "assert digits_mod(577016) == 7", "assert digits_mod(547457) == 0", "assert digits_mod(747618) == 8", "assert digits_mod(122136) == 1", "assert digits_mod(63290) == 4", "assert digits_mod(183838) == 4", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(69201) == 5\nassert digits_mod(577016) == 7\nassert digits_mod(547457) == 0\nassert digits_mod(747618) == 8\nassert digits_mod(122136) == 1\nassert digits_mod(63290) == 4\nassert digits_mod(183838) == 4\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 9", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 9\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 9.\nمثال: `digits_mod(69201)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "c981c24148c2ceef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 4\nfor x in range(-3, 20, 3):\n s += x * 8\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 4\nfor x in range(-3, 20, 3):\n s += x * 8\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "e14368fb2bcde4f7", "answer": "484\n18", "completion": " الناتج:\n```text\n484\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'hr'}", "tests": ["assert char_freq('go camel is camel') == {'h': 0, 'r': 0}", "assert char_freq('apple summer') == {'h': 0, 'r': 1}", "assert char_freq('river rocket planet winter garden on') == {'h': 0, 'r': 5}", "assert char_freq('matrix pixel falcon code apple desert') == {'h': 0, 'r': 2}", "assert char_freq('rocket we') == {'h': 0, 'r': 1}", "assert char_freq('go vector') == {'h': 0, 'r': 1}", "assert char_freq('') == {'h': 0, 'r': 0}"], "test_code": "assert char_freq('go camel is camel') == {'h': 0, 'r': 0}\nassert char_freq('apple summer') == {'h': 0, 'r': 1}\nassert char_freq('river rocket planet winter garden on') == {'h': 0, 'r': 5}\nassert char_freq('matrix pixel falcon code apple desert') == {'h': 0, 'r': 2}\nassert char_freq('rocket we') == {'h': 0, 'r': 1}\nassert char_freq('go vector') == {'h': 0, 'r': 1}\nassert char_freq('') == {'h': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'hr'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'hr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('go camel is camel')` يجب أن تُرجع `{'h': 0, 'r': 0}`.\nالجواب:", "qhash": "d3657592f69fd0ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total", "tests": ["assert sum_powers(5) == 60", "assert sum_powers(6) == 84", "assert sum_powers(5) == 60", "assert sum_powers(13) == 364", "assert sum_powers(1) == 4", "assert sum_powers(1) == 4", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 60\nassert sum_powers(6) == 84\nassert sum_powers(5) == 60\nassert sum_powers(13) == 364\nassert sum_powers(1) == 4\nassert sum_powers(1) == 4\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 4 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(5)` يُرجع `60`.\nالجواب:", "qhash": "28739c6aa3bc26c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -3 + -2 for x in range(-4, 10) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -3 + -2 for x in range(-4, 10) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ae755839ebf50e7f", "answer": "[7, -2, -11, -20, -29]\n5 -55", "completion": " الناتج:\n```text\n[7, -2, -11, -20, -29]\n5 -55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(173) == 2718", "assert mult_sum(223) == 4479", "assert mult_sum(122) == 1380", "assert mult_sum(252) == 5648", "assert mult_sum(273) == 6965", "assert mult_sum(260) == 6159", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(173) == 2718\nassert mult_sum(223) == 4479\nassert mult_sum(122) == 1380\nassert mult_sum(252) == 5648\nassert mult_sum(273) == 6965\nassert mult_sum(260) == 6159\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 % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `mult_sum(173)` يجب أن تُرجع `2718`.\nالجواب:", "qhash": "453fc208ee2398d1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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_sel([31, 30, 33, 57, 15, 72, 0, 83, 61, 74, 31]) == 3", "assert count_sel([-38]) == 0", "assert count_sel([42, 56, 62, 46, -2, 28, 2, 43]) == 1", "assert count_sel([]) == 0", "assert count_sel([4, 60, 50, 49, 51, 33, 1, -10, 9, -24]) == 4", "assert count_sel([-20, 18, 31, -33, 42, -7, -19]) == 3", "assert count_sel([]) == 0"], "test_code": "assert count_sel([31, 30, 33, 57, 15, 72, 0, 83, 61, 74, 31]) == 3\nassert count_sel([-38]) == 0\nassert count_sel([42, 56, 62, 46, -2, 28, 2, 43]) == 1\nassert count_sel([]) == 0\nassert count_sel([4, 60, 50, 49, 51, 33, 1, -10, 9, -24]) == 4\nassert count_sel([-20, 18, 31, -33, 42, -7, -19]) == 3\nassert count_sel([]) == 0", "answer": "def count_sel(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_sel(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_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_sel([31, 30, 33, 57, 15, 72, 0, 83, 61, 74, 31])` يُرجع `3`.\nالجواب:", "qhash": "e1a003f3fd4d0dcf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([-3, 49, 23, 38, -28]) == None", "assert top_divisible([-36, -60, -36]) == -36", "assert top_divisible([1, 13, 25, 37]) == None", "assert top_divisible([-3, -10, 8, -26, 38, -9, 28, 18, -27]) == None", "assert top_divisible([-10, 13, 31]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-3, 49, 23, 38, -28]) == None\nassert top_divisible([-36, -60, -36]) == -36\nassert top_divisible([1, 13, 25, 37]) == None\nassert top_divisible([-3, -10, 8, -26, 38, -9, 28, 18, -27]) == None\nassert top_divisible([-10, 13, 31]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([-3, 49, 23, 38, -28])` يُرجع `None`.\nالجواب:", "qhash": "9d830ae3f27ed498"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return -5 * x ** 2 + (-5) * x + (6)", "tests": ["assert value_at(5) == -144", "assert value_at(-16) == -1194", "assert value_at(-12) == -654", "assert value_at(-16) == -1194", "assert value_at(-19) == -1704", "assert value_at(-3) == -24", "assert value_at(17) == -1524", "assert value_at(0) == 6"], "test_code": "assert value_at(5) == -144\nassert value_at(-16) == -1194\nassert value_at(-12) == -654\nassert value_at(-16) == -1194\nassert value_at(-19) == -1704\nassert value_at(-3) == -24\nassert value_at(17) == -1524\nassert value_at(0) == 6", "answer": "def value_at(x):\n return -5 * x ** 2 + (-5) * x + (6)", "completion": " ```python\ndef value_at(x):\n return -5 * x ** 2 + (-5) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار -5x² - 5x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(5)` يُرجع `-144`.\nالجواب:", "qhash": "66cfec8f9b0fc3ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 97", "tests": ["assert step_product(7) == 8", "assert step_product(49) == 14", "assert step_product(36) == 68", "assert step_product(33) == 58", "assert step_product(26) == 73", "assert step_product(30) == 16", "assert step_product(0) == 1"], "test_code": "assert step_product(7) == 8\nassert step_product(49) == 14\nassert step_product(36) == 68\nassert step_product(33) == 58\nassert step_product(26) == 73\nassert step_product(30) == 16\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 97", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(7)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "0c859c6d24c600f9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 93", "tests": ["assert digits_mod(43148) == 20", "assert digits_mod(838455) == 33", "assert digits_mod(871138) == 28", "assert digits_mod(266727) == 30", "assert digits_mod(265337) == 26", "assert digits_mod(470204) == 17", "assert digits_mod(233027) == 17", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(43148) == 20\nassert digits_mod(838455) == 33\nassert digits_mod(871138) == 28\nassert digits_mod(266727) == 30\nassert digits_mod(265337) == 26\nassert digits_mod(470204) == 17\nassert digits_mod(233027) == 17\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 93", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 93\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 93.\nمثال: `digits_mod(43148)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "b72311ae26709869"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate([36, 29, 39, 31, 33, 45, 35, 45]) == [31, 33, 45, 35, 45, 36, 29, 39]", "assert rotate([12, 13, 1, 22, 16, 39]) == [13, 1, 22, 16, 39, 12]", "assert rotate([18, -6, 44, -6, 26, 14, -8, 45, 37]) == [26, 14, -8, 45, 37, 18, -6, 44, -6]", "assert rotate([7, 38, 22, 23, 47, -5, 5]) == [22, 23, 47, -5, 5, 7, 38]", "assert rotate([38, 35, 31, 5, 7, 1, 3, 45, 18, 16]) == [1, 3, 45, 18, 16, 38, 35, 31, 5, 7]", "assert rotate([23, 14]) == [14, 23]", "assert rotate([]) == []"], "test_code": "assert rotate([36, 29, 39, 31, 33, 45, 35, 45]) == [31, 33, 45, 35, 45, 36, 29, 39]\nassert rotate([12, 13, 1, 22, 16, 39]) == [13, 1, 22, 16, 39, 12]\nassert rotate([18, -6, 44, -6, 26, 14, -8, 45, 37]) == [26, 14, -8, 45, 37, 18, -6, 44, -6]\nassert rotate([7, 38, 22, 23, 47, -5, 5]) == [22, 23, 47, -5, 5, 7, 38]\nassert rotate([38, 35, 31, 5, 7, 1, 3, 45, 18, 16]) == [1, 3, 45, 18, 16, 38, 35, 31, 5, 7]\nassert rotate([23, 14]) == [14, 23]\nassert rotate([]) == []", "answer": "def rotate(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 rotate(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 rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([36, 29, 39, 31, 33, 45, 35, 45])` يُرجع `[31, 33, 45, 35, 45, 36, 29, 39]`.\nالجواب:", "qhash": "f4a015eb3a7101bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert words_reversed('desert stone table apple apple up table') == 'table apple apple table stone desert'", "assert words_reversed('python') == 'python'", "assert words_reversed('camel banana is to banana music by') == 'music banana banana camel'", "assert words_reversed('by by') == ''", "assert words_reversed('brain planet falcon') == 'falcon planet brain'", "assert words_reversed('code an coffee desert planet') == 'planet desert coffee code'", "assert words_reversed('rocket stone banana music it in rocket') == 'rocket music banana stone rocket'"], "test_code": "assert words_reversed('desert stone table apple apple up table') == 'table apple apple table stone desert'\nassert words_reversed('python') == 'python'\nassert words_reversed('camel banana is to banana music by') == 'music banana banana camel'\nassert words_reversed('by by') == ''\nassert words_reversed('brain planet falcon') == 'falcon planet brain'\nassert words_reversed('code an coffee desert planet') == 'planet desert coffee code'\nassert words_reversed('rocket stone banana music it in rocket') == 'rocket music banana stone rocket'", "answer": "def words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ' '.\nمثال: `words_reversed('desert stone table apple apple up table')` يجب أن تُرجع `'table apple apple table stone desert'`.\nالجواب:", "qhash": "c47b4aa407742e95"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 77) == 1)", "tests": ["assert coprime_count(135) == 105", "assert coprime_count(65) == 51", "assert coprime_count(120) == 94", "assert coprime_count(174) == 137", "assert coprime_count(102) == 80", "assert coprime_count(164) == 129", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(135) == 105\nassert coprime_count(65) == 51\nassert coprime_count(120) == 94\nassert coprime_count(174) == 137\nassert coprime_count(102) == 80\nassert coprime_count(164) == 129\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, 77) == 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, 77) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 77، أي أن القاسم المشترك الأكبر لها مع 77 يساوي 1.\nمثال: `coprime_count(135)` يجب أن تُرجع `105`.\nالجواب:", "qhash": "82403d626f31e310"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([73, 40, 43, 42, 19, 4, 87, 82, 48, 26, 23, 81]) == 2", "assert div_not([69, 38, 61, 59, 66, -36, 40, -23]) == 1", "assert div_not([12, 51]) == 0", "assert div_not([52, 75, 13]) == 0", "assert div_not([51, -35, -3, 7, 44, -31, -8, -33]) == 1", "assert div_not([32]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([73, 40, 43, 42, 19, 4, 87, 82, 48, 26, 23, 81]) == 2\nassert div_not([69, 38, 61, 59, 66, -36, 40, -23]) == 1\nassert div_not([12, 51]) == 0\nassert div_not([52, 75, 13]) == 0\nassert div_not([51, -35, -3, 7, 44, -31, -8, -33]) == 1\nassert div_not([32]) == 1\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([73, 40, 43, 42, 19, 4, 87, 82, 48, 26, 23, 81])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "8f34da8c6681158b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([26, 43, 35, 17, 84, 4, 38, 51, 1, 31, 76]) == 1", "assert how_many_div([54, -12, -25, -17, 54, 81, 83, -21, 33, 66, -23]) == 4", "assert how_many_div([-28, -7, 69, -23, 26]) == 0", "assert how_many_div([63]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([45, 23, 48, 12, 11, 41]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([26, 43, 35, 17, 84, 4, 38, 51, 1, 31, 76]) == 1\nassert how_many_div([54, -12, -25, -17, 54, 81, 83, -21, 33, 66, -23]) == 4\nassert how_many_div([-28, -7, 69, -23, 26]) == 0\nassert how_many_div([63]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([45, 23, 48, 12, 11, 41]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 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 % 6 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([26, 43, 35, 17, 84, 4, 38, 51, 1, 31, 76])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "caab7cf8c1255bca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 19", "tests": ["assert multi_fact(3) == 6", "assert multi_fact(49) == 0", "assert multi_fact(12) == 10", "assert multi_fact(58) == 0", "assert multi_fact(48) == 0", "assert multi_fact(18) == 18", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(3) == 6\nassert multi_fact(49) == 0\nassert multi_fact(12) == 10\nassert multi_fact(58) == 0\nassert multi_fact(48) == 0\nassert multi_fact(18) == 18\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 19", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "dc723cf858b2ade3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 11", "tests": ["assert step_product(4) == 4", "assert step_product(12) == 10", "assert step_product(2) == 2", "assert step_product(50) == 0", "assert step_product(7) == 10", "assert step_product(7) == 10", "assert step_product(0) == 1"], "test_code": "assert step_product(4) == 4\nassert step_product(12) == 10\nassert step_product(2) == 2\nassert step_product(50) == 0\nassert step_product(7) == 10\nassert step_product(7) == 10\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 11", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(4)` يُرجع `4`.\nالجواب:", "qhash": "d4ff3fe38565faa8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 17\nfor i in range(4, 23, 1):\n s += i * 3\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 17\nfor i in range(4, 23, 1):\n s += i * 3\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "15114cde1c9a17d7", "answer": "758\n22", "completion": " الناتج:\n```text\n758\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('apple') == 'kzzvo'", "assert caesar('data Hello') == 'nkdk Hovvy'", "assert caesar('a data camel pixel cloud') == 'k nkdk mkwov zshov mvyen'", "assert caesar('falcon music') == 'pkvmyx wecsm'", "assert caesar('signal table garden data music') == 'csqxkv dklvo qkbnox nkdk wecsm'", "assert caesar('planet we music is') == 'zvkxod go wecsm sc'", "assert caesar('') == ''"], "test_code": "assert caesar('apple') == 'kzzvo'\nassert caesar('data Hello') == 'nkdk Hovvy'\nassert caesar('a data camel pixel cloud') == 'k nkdk mkwov zshov mvyen'\nassert caesar('falcon music') == 'pkvmyx wecsm'\nassert caesar('signal table garden data music') == 'csqxkv dklvo qkbnox nkdk wecsm'\nassert caesar('planet we music is') == 'zvkxod go wecsm sc'\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 + (10)) % 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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('apple')` يُرجع `'kzzvo'`.\nالجواب:", "qhash": "2a5bb8535c6a8a2c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [17, 19, 6, -6, -7, 2, 9]\nprint(a[2:7])\nprint(a[::2])\nprint(len(a[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [17, 19, 6, -6, -7, 2, 9]\nprint(a[2:7])\nprint(a[::2])\nprint(len(a[2:7]))\n```\nالجواب:", "qhash": "037c33f21e6faeec", "answer": "[6, -6, -7, 2, 9]\n[17, 6, -7, 9]\n5", "completion": " الناتج:\n```text\n[6, -6, -7, 2, 9]\n[17, 6, -7, 9]\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([6, 9, 44]) == [9, 44, 6]", "assert rotate_by([33, -5, -9, 12, 17]) == [33, -5, -9, 12, 17]", "assert rotate_by([12, 44, 32, 35, 43, 15, 28]) == [44, 32, 35, 43, 15, 28, 12]", "assert rotate_by([0, 38, 42, -4, 46, 7, 42, 40, 0, 8]) == [0, 38, 42, -4, 46, 7, 42, 40, 0, 8]", "assert rotate_by([3, -2, 34, 21, 40, 48, -5, 36]) == [40, 48, -5, 36, 3, -2, 34, 21]", "assert rotate_by([41, 20, -7, 37, 11, 45]) == [11, 45, 41, 20, -7, 37]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([6, 9, 44]) == [9, 44, 6]\nassert rotate_by([33, -5, -9, 12, 17]) == [33, -5, -9, 12, 17]\nassert rotate_by([12, 44, 32, 35, 43, 15, 28]) == [44, 32, 35, 43, 15, 28, 12]\nassert rotate_by([0, 38, 42, -4, 46, 7, 42, 40, 0, 8]) == [0, 38, 42, -4, 46, 7, 42, 40, 0, 8]\nassert rotate_by([3, -2, 34, 21, 40, 48, -5, 36]) == [40, 48, -5, 36, 3, -2, 34, 21]\nassert rotate_by([41, 20, -7, 37, 11, 45]) == [11, 45, 41, 20, -7, 37]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n if not items:\n return []\n k = 20 % 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 = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(items):\n if not items:\n return []\n k = 20 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([6, 9, 44])` يُرجع `[9, 44, 6]`.\nالجواب:", "qhash": "f6a239126791c7d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [39, 17, 39, 9, 22, 20, 35, 17, 18]\nprint(lst[0:2])\nprint(lst[::3])\nprint(min(lst[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [39, 17, 39, 9, 22, 20, 35, 17, 18]\nprint(lst[0:2])\nprint(lst[::3])\nprint(min(lst[0:2]))\n```\nالجواب:", "qhash": "f4810756ccef7683", "answer": "[39, 17]\n[39, 9, 35]\n17", "completion": " الناتج:\n```text\n[39, 17]\n[39, 9, 35]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -4 * x ** 2 + (8) * x + (-2)", "tests": ["assert p(3) == -14", "assert p(20) == -1442", "assert p(-16) == -1154", "assert p(-12) == -674", "assert p(-11) == -574", "assert p(5) == -62", "assert p(19) == -1294", "assert p(0) == -2"], "test_code": "assert p(3) == -14\nassert p(20) == -1442\nassert p(-16) == -1154\nassert p(-12) == -674\nassert p(-11) == -574\nassert p(5) == -62\nassert p(19) == -1294\nassert p(0) == -2", "answer": "def p(x):\n return -4 * x ** 2 + (8) * x + (-2)", "completion": " ```python\ndef p(x):\n return -4 * x ** 2 + (8) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -4x² + 8x - 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(3)` يُرجع `-14`.\nالجواب:", "qhash": "132da3de1fe5fc4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizzbuzz", "reference": "def fizzbuzz(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 fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21', '22', '23', 'Fizz', '25']", "assert fizzbuzz(22) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21', '22']", "assert fizzbuzz(2) == ['1', '2']", "assert fizzbuzz(20) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20']", "assert fizzbuzz(10) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10']"], "test_code": "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21', '22', '23', 'Fizz', '25']\nassert fizzbuzz(22) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21', '22']\nassert fizzbuzz(2) == ['1', '2']\nassert fizzbuzz(20) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20']\nassert fizzbuzz(10) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10']", "answer": "def fizzbuzz(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 fizzbuzz(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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Fizz'، وعلى 9 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(25)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21', '22', '23', 'Fizz', '25']`.\nالجواب:", "qhash": "6d5b89cb0194200e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'pixel_matrix'\nprint(text.replace('a', '0'))\nprint(text.capitalize())\nprint(text.count('a'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'pixel_matrix'\nprint(text.replace('a', '0'))\nprint(text.capitalize())\nprint(text.count('a'))\n```\nالجواب:", "qhash": "26a07ea8568a8ec3", "answer": "pixel_m0trix\nPixel_matrix\n1", "completion": " الناتج:\n```text\npixel_m0trix\nPixel_matrix\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 1:\n return 3\n return 2 * go(n - 1) + -3\n\nprint(go(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 1:\n return 3\n return 2 * go(n - 1) + -3\n\nprint(go(9))\n```\nالجواب:", "qhash": "4622b6e2eee22e8f", "answer": "3", "completion": " الناتج:\n```text\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert weighted_sum(7) == 3920", "assert weighted_sum(1) == 5", "assert weighted_sum(2) == 45", "assert weighted_sum(6) == 2205", "assert weighted_sum(8) == 6480", "assert weighted_sum(1) == 5", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(7) == 3920\nassert weighted_sum(1) == 5\nassert weighted_sum(2) == 45\nassert weighted_sum(6) == 2205\nassert weighted_sum(8) == 6480\nassert weighted_sum(1) == 5\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total\n```\nمثال: `weighted_sum(7)` يجب أن تُرجع `3920`.\nالجواب:", "qhash": "5b2eca3944295223"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 62:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([27, 32, 35, 32, 31, 22, 14, 19, 6]) == [27, 59, 0, 32, 0, 22, 36, 55, 61]", "assert reset_sum([]) == []", "assert reset_sum([23, 25, 8, 19]) == [23, 48, 56, 0]", "assert reset_sum([41, 5, 30, 54, -2, 57, 14, 36, 27]) == [41, 46, 0, 54, 52, 0, 14, 50, 0]", "assert reset_sum([-4, 47, -9]) == [-4, 43, 34]", "assert reset_sum([32, 1, 19, -1]) == [32, 33, 52, 51]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([27, 32, 35, 32, 31, 22, 14, 19, 6]) == [27, 59, 0, 32, 0, 22, 36, 55, 61]\nassert reset_sum([]) == []\nassert reset_sum([23, 25, 8, 19]) == [23, 48, 56, 0]\nassert reset_sum([41, 5, 30, 54, -2, 57, 14, 36, 27]) == [41, 46, 0, 54, 52, 0, 14, 50, 0]\nassert reset_sum([-4, 47, -9]) == [-4, 43, 34]\nassert reset_sum([32, 1, 19, -1]) == [32, 33, 52, 51]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 62:\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 > 62:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 62 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([27, 32, 35, 32, 31, 22, 14, 19, 6])` يُرجع `[27, 59, 0, 32, 0, 22, 36, 55, 61]`.\nالجواب:", "qhash": "30aac6eaa6f10d6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'table'\nprint(s.upper())\nprint(s.index('b') + len(s))\nprint(s[1:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'table'\nprint(s.upper())\nprint(s.index('b') + len(s))\nprint(s[1:2])\n```\nالجواب:", "qhash": "8bbe7ea423074fd0", "answer": "TABLE\n7\na", "completion": " الناتج:\n```text\nTABLE\n7\na\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [5, 12, 2, 6, 34, 32, 30, 7]\nprint(data[2:7])\nprint(data[::-1])\nprint(sum(data[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [5, 12, 2, 6, 34, 32, 30, 7]\nprint(data[2:7])\nprint(data[::-1])\nprint(sum(data[2:7]))\n```\nالجواب:", "qhash": "64c22a1c28e57059", "answer": "[2, 6, 34, 32, 30]\n[7, 30, 32, 34, 6, 2, 12, 5]\n104", "completion": " الناتج:\n```text\n[2, 6, 34, 32, 30]\n[7, 30, 32, 34, 6, 2, 12, 5]\n104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قلم برمجة دفتر صحراء طالب') == 0", "assert words_starting('مدرسة حصان حديقة شجرة') == 2", "assert words_starting('سلام قهوة حاسوب بحر حديقة') == 2", "assert words_starting('نهار حديقة قلم باب') == 1", "assert words_starting('جبل برتقال مطر حاسوب سلام ميناء') == 1", "assert words_starting('عمل معلم حاسوب') == 1", "assert words_starting('') == 0"], "test_code": "assert words_starting('قلم برمجة دفتر صحراء طالب') == 0\nassert words_starting('مدرسة حصان حديقة شجرة') == 2\nassert words_starting('سلام قهوة حاسوب بحر حديقة') == 2\nassert words_starting('نهار حديقة قلم باب') == 1\nassert words_starting('جبل برتقال مطر حاسوب سلام ميناء') == 1\nassert words_starting('عمل معلم حاسوب') == 1\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('قلم برمجة دفتر صحراء طالب')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "8c91d6519e262d83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71", "tests": ["assert mfact(5) == 5", "assert mfact(0) == 1", "assert mfact(55) == 21", "assert mfact(59) == 32", "assert mfact(55) == 21", "assert mfact(59) == 32", "assert mfact(0) == 1"], "test_code": "assert mfact(5) == 5\nassert mfact(0) == 1\nassert mfact(55) == 21\nassert mfact(59) == 32\nassert mfact(55) == 21\nassert mfact(59) == 32\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(5)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "680ac3dc679765b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['light', 'camel', 'rocket', 'data', 'python']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['light', 'camel', 'rocket', 'data', 'python']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "aa464d83295966ce", "answer": "['data', 'light', 'camel', 'rocket', 'python']\n['rocket', 'python', 'light']", "completion": " الناتج:\n```text\n['data', 'light', 'camel', 'rocket', 'python']\n['rocket', 'python', 'light']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('an table code is coffee vector apple planet') == 'planet-apple-vector-coffee-code-table'", "assert flip_words('on') == ''", "assert flip_words('is orange summer it garden planet') == 'planet-garden-summer-orange'", "assert flip_words('desert') == 'desert'", "assert flip_words('camel') == 'camel'", "assert flip_words('rocket we up code') == 'code-rocket'", "assert flip_words('to rocket brain orange') == 'orange-brain-rocket'"], "test_code": "assert flip_words('an table code is coffee vector apple planet') == 'planet-apple-vector-coffee-code-table'\nassert flip_words('on') == ''\nassert flip_words('is orange summer it garden planet') == 'planet-garden-summer-orange'\nassert flip_words('desert') == 'desert'\nassert flip_words('camel') == 'camel'\nassert flip_words('rocket we up code') == 'code-rocket'\nassert flip_words('to rocket brain orange') == 'orange-brain-rocket'", "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('an table code is coffee vector apple planet')` يجب أن تُرجع `'planet-apple-vector-coffee-code-table'`.\nالجواب:", "qhash": "022334b45e7d2d16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(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_matching([82, 66, 5, 14, 46, 35, 29]) == 0", "assert count_matching([46, 69, 63, -34, -9, 34, 61, 82, 36, 22, -21, -10]) == 0", "assert count_matching([76, -22, -32, 17, -10, 82, -39, 15, 64, 29, -20]) == 4", "assert count_matching([-27, -5, 12, 36, 31, 90, 15, 27, 64, -36]) == 1", "assert count_matching([17, 41, -13, -22, -34, 62]) == 0", "assert count_matching([19, 7, 18, 0, -23, 21, -21, 34, 51]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([82, 66, 5, 14, 46, 35, 29]) == 0\nassert count_matching([46, 69, 63, -34, -9, 34, 61, 82, 36, 22, -21, -10]) == 0\nassert count_matching([76, -22, -32, 17, -10, 82, -39, 15, 64, 29, -20]) == 4\nassert count_matching([-27, -5, 12, 36, 31, 90, 15, 27, 64, -36]) == 1\nassert count_matching([17, 41, -13, -22, -34, 62]) == 0\nassert count_matching([19, 7, 18, 0, -23, 21, -21, 34, 51]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(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_matching(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_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_matching([82, 66, 5, 14, 46, 35, 29])` يُرجع `0`.\nالجواب:", "qhash": "adc7335669fa8bdf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert pow_total(7) == 196", "assert pow_total(14) == 735", "assert pow_total(7) == 196", "assert pow_total(11) == 462", "assert pow_total(10) == 385", "assert pow_total(1) == 7", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 196\nassert pow_total(14) == 735\nassert pow_total(7) == 196\nassert pow_total(11) == 462\nassert pow_total(10) == 385\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 ** 1\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `pow_total(7)` يُرجع `196`.\nالجواب:", "qhash": "41c76df1a3bc26ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 33", "tests": ["assert digit_score(65974) == 9", "assert digit_score(618311) == 13", "assert digit_score(241763) == 16", "assert digit_score(824266) == 28", "assert digit_score(868976) == 0", "assert digit_score(886069) == 17", "assert digit_score(594438) == 13", "assert digit_score(0) == 0"], "test_code": "assert digit_score(65974) == 9\nassert digit_score(618311) == 13\nassert digit_score(241763) == 16\nassert digit_score(824266) == 28\nassert digit_score(868976) == 0\nassert digit_score(886069) == 17\nassert digit_score(594438) == 13\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 33", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 33.\nللتوضيح: الاستدعاء `digit_score(65974)` يُرجع `9`.\nالجواب:", "qhash": "d5ecdc8bd868305b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('cloud a engine') == 'qzcir o sbuwbs'", "assert rotate_letters('we stone table') == 'ks ghcbs hopzs'", "assert rotate_letters('engine orange camel python') == 'sbuwbs cfobus qoasz dmhvcb'", "assert rotate_letters('light window 2024') == 'zwuvh kwbrck 2024'", "assert rotate_letters('up falcon of matrix on OK') == 'id tozqcb ct aohfwl cb OK'", "assert rotate_letters('vector at brain river an') == 'jsqhcf oh pfowb fwjsf ob'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('cloud a engine') == 'qzcir o sbuwbs'\nassert rotate_letters('we stone table') == 'ks ghcbs hopzs'\nassert rotate_letters('engine orange camel python') == 'sbuwbs cfobus qoasz dmhvcb'\nassert rotate_letters('light window 2024') == 'zwuvh kwbrck 2024'\nassert rotate_letters('up falcon of matrix on OK') == 'id tozqcb ct aohfwl cb OK'\nassert rotate_letters('vector at brain river an') == 'jsqhcf oh pfowb fwjsf ob'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('cloud a engine')` يُرجع `'qzcir o sbuwbs'`.\nالجواب:", "qhash": "1e377ccd6511293a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'نور': 17, 'ليلى': 2, 'أحمد': 32, 'منى': 22, 'هدى': 45}\npoints['هدى'] += 7\npoints['عمر'] = 0\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('نور', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'نور': 17, 'ليلى': 2, 'أحمد': 32, 'منى': 22, 'هدى': 45}\npoints['هدى'] += 7\npoints['عمر'] = 0\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('نور', -1))\n```\nالجواب:", "qhash": "78d591a162a9dcdf", "answer": "6\nهدى\n125\n17", "completion": " الناتج:\n```text\n6\nهدى\n125\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [8, 13, 22, 5, -10, -7, 15, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [8, 13, 22, 5, -10, -7, 15, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "e7e9ba1436517130", "answer": "[22, 18, 15, 13, 8, 5, -7, -10]\n[22, 18, 15]", "completion": " الناتج:\n```text\n[22, 18, 15, 13, 8, 5, -7, -10]\n[22, 18, 15]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(-2))\nprint(g(-2, -8))\nprint(g(g(-8), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(-2))\nprint(g(-2, -8))\nprint(g(g(-8), -2))\n```\nالجواب:", "qhash": "d416967105ebe8e7", "answer": "25\n2\n59", "completion": " الناتج:\n```text\n25\n2\n59\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 4 <= x <= 17)", "tests": ["assert filter_range([7, 16, 15, 4, 15, 2, 27, 22]) == [12, 21, 45, 45, 48]", "assert filter_range([-11, 17, 26, 15, -22, -16]) == [45, 51]", "assert filter_range([54]) == []", "assert filter_range([-24, -27, 45, -16, 3]) == []", "assert filter_range([]) == []", "assert filter_range([-26, -24, 35, 57, 22, -29]) == []", "assert filter_range([2, -13, -26, 21, 58, 49, -30, 6, 51, -28]) == [18]", "assert filter_range([]) == []"], "test_code": "assert filter_range([7, 16, 15, 4, 15, 2, 27, 22]) == [12, 21, 45, 45, 48]\nassert filter_range([-11, 17, 26, 15, -22, -16]) == [45, 51]\nassert filter_range([54]) == []\nassert filter_range([-24, -27, 45, -16, 3]) == []\nassert filter_range([]) == []\nassert filter_range([-26, -24, 35, 57, 22, -29]) == []\nassert filter_range([2, -13, -26, 21, 58, 49, -30, 6, 51, -28]) == [18]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 4 <= x <= 17)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if 4 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 17، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([7, 16, 15, 4, 15, 2, 27, 22])` يُرجع `[12, 21, 45, 45, 48]`.\nالجواب:", "qhash": "b813627f837d0ce8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [21, 0, 24, 37, 24, 34]\nprint(items[3:5])\nprint(items[::-1])\nprint(sum(items[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [21, 0, 24, 37, 24, 34]\nprint(items[3:5])\nprint(items[::-1])\nprint(sum(items[3:5]))\n```\nالجواب:", "qhash": "cbd81a76c1419212", "answer": "[37, 24]\n[34, 24, 37, 24, 0, 21]\n61", "completion": " الناتج:\n```text\n[37, 24]\n[34, 24, 37, 24, 0, 21]\n61\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'سعيد': 45, 'حسن': 42, 'فيصل': 2, 'خالد': 1}\npoints['حسن'] += 19\npoints['علي'] = 13\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 = {'سعيد': 45, 'حسن': 42, 'فيصل': 2, 'خالد': 1}\npoints['حسن'] += 19\npoints['علي'] = 13\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": "98a5b99fd3e12de4", "answer": "5\nحسن\n122\n[('خالد', 1), ('فيصل', 2)]", "completion": " الناتج:\n```text\n5\nحسن\n122\n[('خالد', 1), ('فيصل', 2)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('علم سلام طائرة سوق حصان') == 1", "assert prefix_hits('وردة قهوة برمجة نهر مطر قهوة') == 0", "assert prefix_hits('حديقة بحر حديقة حديقة علم جبل برمجة') == 3", "assert prefix_hits('قلم سفينة طائرة حصان سوق') == 1", "assert prefix_hits('علم قلم جبل') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صديق سفينة بيت سيارة قمر') == 0\nassert prefix_hits('علم سلام طائرة سوق حصان') == 1\nassert prefix_hits('وردة قهوة برمجة نهر مطر قهوة') == 0\nassert prefix_hits('حديقة بحر حديقة حديقة علم جبل برمجة') == 3\nassert prefix_hits('قلم سفينة طائرة حصان سوق') == 1\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": "4f364fa7281a5192"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عربية حصان علم باب سيارة باب') == 2", "assert starts_count('قمر بيت باب برمجة') == 3", "assert starts_count('ميناء فجر صحراء برتقال علم نور برمجة جمل') == 2", "assert starts_count('دفتر ليل بيت بيت سيارة سوق نور') == 2", "assert starts_count('برمجة سفينة صحراء بيت مدرسة باب جبل وردة') == 3", "assert starts_count('مدرسة باب برتقال بحر ميناء باب') == 4", "assert starts_count('') == 0"], "test_code": "assert starts_count('عربية حصان علم باب سيارة باب') == 2\nassert starts_count('قمر بيت باب برمجة') == 3\nassert starts_count('ميناء فجر صحراء برتقال علم نور برمجة جمل') == 2\nassert starts_count('دفتر ليل بيت بيت سيارة سوق نور') == 2\nassert starts_count('برمجة سفينة صحراء بيت مدرسة باب جبل وردة') == 3\nassert starts_count('مدرسة باب برتقال بحر ميناء باب') == 4\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 'ب' in w:\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 'ب' in w:\n count += 1\n return count\n```\nمثال: `starts_count('عربية حصان علم باب سيارة باب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "033fffa357572ab6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('code stone table') == 'wixy mnihy nuvfy'", "assert shift_text('at Hello') == 'un Hyffi'", "assert shift_text('desert coffee in it') == 'xymyln wizzyy ch cn'", "assert shift_text('falcon we desert') == 'zufwih qy xymyln'", "assert shift_text('is table code banana') == 'cm nuvfy wixy vuhuhu'", "assert shift_text('river matrix A1') == 'lcpyl gunlcr A1'", "assert shift_text('') == ''"], "test_code": "assert shift_text('code stone table') == 'wixy mnihy nuvfy'\nassert shift_text('at Hello') == 'un Hyffi'\nassert shift_text('desert coffee in it') == 'xymyln wizzyy ch cn'\nassert shift_text('falcon we desert') == 'zufwih qy xymyln'\nassert shift_text('is table code banana') == 'cm nuvfy wixy vuhuhu'\nassert shift_text('river matrix A1') == 'lcpyl gunlcr A1'\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 + (20)) % 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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('code stone table')` يُرجع `'wixy mnihy nuvfy'`.\nالجواب:", "qhash": "b7af19b16d88dfe7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 53", "tests": ["assert rec_prod(5) == 5", "assert rec_prod(11) == 19", "assert rec_prod(37) == 51", "assert rec_prod(44) == 16", "assert rec_prod(40) == 10", "assert rec_prod(44) == 16", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(5) == 5\nassert rec_prod(11) == 19\nassert rec_prod(37) == 51\nassert rec_prod(44) == 16\nassert rec_prod(40) == 10\nassert rec_prod(44) == 16\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 53", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(5)` يُرجع `5`.\nالجواب:", "qhash": "031fa2f93f8219ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_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 largest_div([2, 34, 37, 54, 55, 11, -21, 58, 59]) == 54", "assert largest_div([-3, -3, -6]) == -3", "assert largest_div([1, 4, 7]) == None", "assert largest_div([-21, -26]) == -21", "assert largest_div([20, -32, -21, -39, -27, -20, -12]) == -12", "assert largest_div([]) == None"], "test_code": "assert largest_div([2, 34, 37, 54, 55, 11, -21, 58, 59]) == 54\nassert largest_div([-3, -3, -6]) == -3\nassert largest_div([1, 4, 7]) == None\nassert largest_div([-21, -26]) == -21\nassert largest_div([20, -32, -21, -39, -27, -20, -12]) == -12\nassert largest_div([]) == None", "answer": "def largest_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 largest_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 largest_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_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مثال: `largest_div([2, 34, 37, 54, 55, 11, -21, 58, 59])` يجب أن تُرجع `54`.\nالجواب:", "qhash": "a0bb2d70881d1520"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([27, 24, 12, 20, 27, 27, 2]) == [27, 51, 0, 20, 47, 0, 2]", "assert capped_cumsum([25, 9, 13, 28, 43, 15, -8]) == [25, 34, 47, 0, 43, 0, -8]", "assert capped_cumsum([-8, 31, 17, -2, -8]) == [-8, 23, 40, 38, 30]", "assert capped_cumsum([15, 18, 16, 43, 11, 29]) == [15, 33, 49, 0, 11, 40]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([27, 24, 12, 20, 27, 27, 2]) == [27, 51, 0, 20, 47, 0, 2]\nassert capped_cumsum([25, 9, 13, 28, 43, 15, -8]) == [25, 34, 47, 0, 43, 0, -8]\nassert capped_cumsum([-8, 31, 17, -2, -8]) == [-8, 23, 40, 38, 30]\nassert capped_cumsum([15, 18, 16, 43, 11, 29]) == [15, 33, 49, 0, 11, 40]\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 > 54:\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 > 54:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 54 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([27, 24, 12, 20, 27, 27, 2])` يجب أن تُرجع `[27, 51, 0, 20, 47, 0, 2]`.\nالجواب:", "qhash": "9b3c099e997c1352"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 46", "tests": ["assert dig_pow_mod(31308) == 15", "assert dig_pow_mod(120575) == 20", "assert dig_pow_mod(171924) == 24", "assert dig_pow_mod(753868) == 37", "assert dig_pow_mod(728511) == 24", "assert dig_pow_mod(10387) == 19", "assert dig_pow_mod(279824) == 32", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(31308) == 15\nassert dig_pow_mod(120575) == 20\nassert dig_pow_mod(171924) == 24\nassert dig_pow_mod(753868) == 37\nassert dig_pow_mod(728511) == 24\nassert dig_pow_mod(10387) == 19\nassert dig_pow_mod(279824) == 32\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 46", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 46\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 46.\nمثال: `dig_pow_mod(31308)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "140027c409cce57b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-7))\nprint(calc(-7, 20))\nprint(calc(calc(20), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-7))\nprint(calc(-7, 20))\nprint(calc(calc(20), -7))\n```\nالجواب:", "qhash": "2ce4e4007e8902e5", "answer": "-5\n13\n25", "completion": " الناتج:\n```text\n-5\n13\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 99:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([37, 44, 41, 52, 26, 42, 44, 37]) == [37, 81, 0, 52, 78, 0, 44, 81]", "assert reset_sum([80, 77, 11, 94, 91, 60, -3, 93, 75, 19]) == [80, 0, 11, 0, 91, 0, -3, 90, 0, 19]", "assert reset_sum([46, 25, 64]) == [46, 71, 0]", "assert reset_sum([16, -1, 72, -10, 51, 49]) == [16, 15, 87, 77, 0, 49]", "assert reset_sum([37]) == [37]", "assert reset_sum([11, 32, 85, 76, 98, 14, 67, -4, 65, 79]) == [11, 43, 0, 76, 0, 14, 81, 77, 0, 79]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([37, 44, 41, 52, 26, 42, 44, 37]) == [37, 81, 0, 52, 78, 0, 44, 81]\nassert reset_sum([80, 77, 11, 94, 91, 60, -3, 93, 75, 19]) == [80, 0, 11, 0, 91, 0, -3, 90, 0, 19]\nassert reset_sum([46, 25, 64]) == [46, 71, 0]\nassert reset_sum([16, -1, 72, -10, 51, 49]) == [16, 15, 87, 77, 0, 49]\nassert reset_sum([37]) == [37]\nassert reset_sum([11, 32, 85, 76, 98, 14, 67, -4, 65, 79]) == [11, 43, 0, 76, 0, 14, 81, 77, 0, 79]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 99:\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 > 99:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 99 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([37, 44, 41, 52, 26, 42, 44, 37])` يجب أن تُرجع `[37, 81, 0, 52, 78, 0, 44, 81]`.\nالجواب:", "qhash": "3a072c7327b4f9d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'ماء نهر'\nprint(s.count('ر'))\nprint(s.replace(' ', '-'))\nprint('ر' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'ماء نهر'\nprint(s.count('ر'))\nprint(s.replace(' ', '-'))\nprint('ر' in s)\n```\nالجواب:", "qhash": "649dec08d35d6a9d", "answer": "1\nماء-نهر\nTrue", "completion": " الناتج:\n```text\n1\nماء-نهر\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([57, -15, 41, 9, 40]) == 40", "assert biggest_mult([-4, -4, -10]) == -4", "assert biggest_mult([1, 3, 5, 7]) == None", "assert biggest_mult([]) == None", "assert biggest_mult([40, -10, 43, 33, -35, -41, -7, 8]) == 40", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([57, -15, 41, 9, 40]) == 40\nassert biggest_mult([-4, -4, -10]) == -4\nassert biggest_mult([1, 3, 5, 7]) == None\nassert biggest_mult([]) == None\nassert biggest_mult([40, -10, 43, 33, -35, -41, -7, 8]) == 40\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 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 % 2 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([57, -15, 41, 9, 40])` يُرجع `40`.\nالجواب:", "qhash": "377ac037631b55ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 8\nfor x in range(-4, 20, 4):\n acc += x * 2\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 8\nfor x in range(-4, 20, 4):\n acc += x * 2\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "e42dee5cea7a549b", "answer": "80\n16", "completion": " الناتج:\n```text\n80\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(29) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar', '25', '26', '27', '28', '29']", "assert play(0) == []", "assert play(25) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar', '25']", "assert play(5) == ['1', '2', '3', '4', '5']", "assert play(21) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21']"], "test_code": "assert play(29) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar', '25', '26', '27', '28', '29']\nassert play(0) == []\nassert play(25) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar', '25']\nassert play(5) == ['1', '2', '3', '4', '5']\nassert play(21) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Foo'، وإن قَبِلها على 8 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(29)` يُرجع `['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar', '25', '26', '27', '28', '29']`.\nالجواب:", "qhash": "39d672d857e8afcf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([17, 7, 28]) == [7, 28, 17]", "assert rotate_by([12]) == [12]", "assert rotate_by([37, 35, 50, 25, 12]) == [35, 50, 25, 12, 37]", "assert rotate_by([-8, 48, 23, 5, 43]) == [48, 23, 5, 43, -8]", "assert rotate_by([7, 32]) == [32, 7]", "assert rotate_by([9, 27]) == [27, 9]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([17, 7, 28]) == [7, 28, 17]\nassert rotate_by([12]) == [12]\nassert rotate_by([37, 35, 50, 25, 12]) == [35, 50, 25, 12, 37]\nassert rotate_by([-8, 48, 23, 5, 43]) == [48, 23, 5, 43, -8]\nassert rotate_by([7, 32]) == [32, 7]\nassert rotate_by([9, 27]) == [27, 9]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return ____\n```\nمثال: `rotate_by([17, 7, 28])` يجب أن تُرجع `[7, 28, 17]`.\nالجواب:", "qhash": "bce7678d06acf38a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert cycle([30, 38, 7, 35, 44, 17, 3]) == [7, 35, 44, 17, 3, 30, 38]", "assert cycle([10, 30, -2, 34, 39, 18, 32, 33, 48, 13, 49]) == [34, 39, 18, 32, 33, 48, 13, 49, 10, 30, -2]", "assert cycle([32, 9, 22, 34, 7, 0]) == [0, 32, 9, 22, 34, 7]", "assert cycle([25, 9, 20, 1, 17, 29, 5, 41]) == [29, 5, 41, 25, 9, 20, 1, 17]", "assert cycle([-2, 25, 4, 33, -3, 8, 27]) == [4, 33, -3, 8, 27, -2, 25]", "assert cycle([23]) == [23]", "assert cycle([]) == []"], "test_code": "assert cycle([30, 38, 7, 35, 44, 17, 3]) == [7, 35, 44, 17, 3, 30, 38]\nassert cycle([10, 30, -2, 34, 39, 18, 32, 33, 48, 13, 49]) == [34, 39, 18, 32, 33, 48, 13, 49, 10, 30, -2]\nassert cycle([32, 9, 22, 34, 7, 0]) == [0, 32, 9, 22, 34, 7]\nassert cycle([25, 9, 20, 1, 17, 29, 5, 41]) == [29, 5, 41, 25, 9, 20, 1, 17]\nassert cycle([-2, 25, 4, 33, -3, 8, 27]) == [4, 33, -3, 8, 27, -2, 25]\nassert cycle([23]) == [23]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([30, 38, 7, 35, 44, 17, 3])` يُرجع `[7, 35, 44, 17, 3, 30, 38]`.\nالجواب:", "qhash": "206c64b25f0e5065"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل قهوة ليل فجر قلم كتاب برتقال مطر') == 2", "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('جبل قهوة ليل فجر قلم كتاب برتقال مطر') == 2\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('جبل قهوة ليل فجر قلم كتاب برتقال مطر')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d67d52c558385ffb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 5 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(7) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7']", "assert fizzbuzz(21) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi', '19', 'HiYo', '21']", "assert fizzbuzz(16) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi']", "assert fizzbuzz(18) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi']", "assert fizzbuzz(20) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi', '19', 'HiYo']"], "test_code": "assert fizzbuzz(7) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7']\nassert fizzbuzz(21) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi', '19', 'HiYo', '21']\nassert fizzbuzz(16) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi']\nassert fizzbuzz(18) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi']\nassert fizzbuzz(20) == ['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7', 'Hi', '9', 'HiYo', '11', 'Hi', '13', 'Hi', 'Yo', 'Hi', '17', 'Hi', '19', 'HiYo']", "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 % 5 == 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 % 5 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Hi'، وعلى 5 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(7)` يجب أن تُرجع `['1', 'Hi', '3', 'Hi', 'Yo', 'Hi', '7']`.\nالجواب:", "qhash": "ad6b3db04f4f3285"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz', '17', 'Fizz', '19', '20', 'Fizz']", "assert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10']", "assert fizzbuzz(16) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz']", "assert fizzbuzz(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz', '17', 'Fizz', '19', '20', 'Fizz']", "assert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10']"], "test_code": "assert fizzbuzz(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz', '17', 'Fizz', '19', '20', 'Fizz']\nassert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10']\nassert fizzbuzz(16) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz']\nassert fizzbuzz(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz', '17', 'Fizz', '19', '20', 'Fizz']\nassert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 3 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(21)` يُرجع `['1', '2', 'Fizz', '4', '5', 'Fizz', '7', 'Buzz', 'Fizz', '10', '11', 'Fizz', '13', '14', 'Fizz', 'Buzz', '17', 'Fizz', '19', '20', 'Fizz']`.\nالجواب:", "qhash": "a938069ca360ca91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['stone', 'coffee', 'music', 'matrix', 'light']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['stone', 'coffee', 'music', 'matrix', 'light']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "1ab08138586bcb1b", "answer": "['stone', 'music', 'light', 'coffee', 'matrix']\n['matrix', 'coffee', 'stone']", "completion": " الناتج:\n```text\n['stone', 'music', 'light', 'coffee', 'matrix']\n['matrix', 'coffee', 'stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('by on vector') == 'vector'", "assert invert_words('in') == ''", "assert invert_words('code rocket light of code by go matrix') == 'matrix_code_light_rocket_code'", "assert invert_words('on go light') == 'light'", "assert invert_words('') == ''", "assert invert_words('planet a stone to banana rocket a') == 'rocket_banana_stone_planet'", "assert invert_words('engine orange') == 'orange_engine'"], "test_code": "assert invert_words('by on vector') == 'vector'\nassert invert_words('in') == ''\nassert invert_words('code rocket light of code by go matrix') == 'matrix_code_light_rocket_code'\nassert invert_words('on go light') == 'light'\nassert invert_words('') == ''\nassert invert_words('planet a stone to banana rocket a') == 'rocket_banana_stone_planet'\nassert invert_words('engine orange') == 'orange_engine'", "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('by on vector')` يجب أن تُرجع `'vector'`.\nالجواب:", "qhash": "0c428af46eab02fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 3) == 1)", "tests": ["assert phi_upto(44) == 30", "assert phi_upto(38) == 26", "assert phi_upto(64) == 43", "assert phi_upto(82) == 55", "assert phi_upto(126) == 84", "assert phi_upto(133) == 89", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(44) == 30\nassert phi_upto(38) == 26\nassert phi_upto(64) == 43\nassert phi_upto(82) == 55\nassert phi_upto(126) == 84\nassert phi_upto(133) == 89\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, 3) == 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, 3) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 3) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(44)` يُرجع `30`.\nالجواب:", "qhash": "4d5b46ab7b5a3291"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert game(6) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi']", "assert game(7) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7']", "assert game(13) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13']", "assert game(0) == []", "assert game(16) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'HiYo']"], "test_code": "assert game(6) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi']\nassert game(7) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7']\nassert game(13) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13']\nassert game(0) == []\nassert game(16) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'HiYo']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Hi'، وإن قَبِلها على 4 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(6)` يُرجع `['1', 'Hi', '3', 'HiYo', '5', 'Hi']`.\nالجواب:", "qhash": "440287415a1f2667"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 5 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']", "assert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']", "assert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']", "assert fizz(12) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo']", "assert fizz(19) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17', '18', '19']"], "test_code": "assert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']\nassert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']\nassert fizz(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']\nassert fizz(12) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo']\nassert fizz(19) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17', '18', '19']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Foo'، وإن قَبِلها على 5 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(14)` يُرجع `['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']`.\nالجواب:", "qhash": "9e174e9173413471"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=5):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(-9))\nprint(h(-9, 12))\nprint(h(h(12), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=5):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(-9))\nprint(h(-9, 12))\nprint(h(h(12), -9))\n```\nالجواب:", "qhash": "fd068205119a4b35", "answer": "36\n99\n936", "completion": " الناتج:\n```text\n36\n99\n936\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'يوسف': 36, 'نور': 29, 'أحمد': 21}\nscores['أحمد'] += 10\nscores['عمر'] = 57\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 = {'يوسف': 36, 'نور': 29, 'أحمد': 21}\nscores['أحمد'] += 10\nscores['عمر'] = 57\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": "fe1c1dc7409edd2b", "answer": "4\nعمر\n153\n['يوسف', 'نور', 'أحمد', 'عمر']", "completion": " الناتج:\n```text\n4\nعمر\n153\n['يوسف', 'نور', 'أحمد', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(9) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9']", "assert fizzbuzz(3) == ['1', 'Fizz', '3']", "assert fizzbuzz(3) == ['1', 'Fizz', '3']", "assert fizzbuzz(4) == ['1', 'Fizz', '3', 'Fizz']", "assert fizzbuzz(7) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7']"], "test_code": "assert fizzbuzz(9) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9']\nassert fizzbuzz(3) == ['1', 'Fizz', '3']\nassert fizzbuzz(3) == ['1', 'Fizz', '3']\nassert fizzbuzz(4) == ['1', 'Fizz', '3', 'Fizz']\nassert fizzbuzz(7) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 2 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Fizz'، وعلى 8 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(9)` يجب أن تُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9']`.\nالجواب:", "qhash": "95e1501906cbca47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 1) // 4 for x in range(-2, 3) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 1) // 4 for x in range(-2, 3) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "5f676718ff5d1123", "answer": "[0]\n1 0", "completion": " الناتج:\n```text\n[0]\n1 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'منى': 26, 'سعيد': 24, 'رنا': 7, 'حسن': 35, 'ليلى': 4}\npoints['منى'] += 4\npoints['يوسف'] = 41\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'منى': 26, 'سعيد': 24, 'رنا': 7, 'حسن': 35, 'ليلى': 4}\npoints['منى'] += 4\npoints['يوسف'] = 41\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('عمر', -1))\n```\nالجواب:", "qhash": "62a8ee2d47d415b9", "answer": "6\nيوسف\n141\n-1", "completion": " الناتج:\n```text\n6\nيوسف\n141\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [-8, 14, 14, -8, -3, 13]\nprint(data[3:6])\nprint(data[::-1])\nprint(len(data[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [-8, 14, 14, -8, -3, 13]\nprint(data[3:6])\nprint(data[::-1])\nprint(len(data[3:6]))\n```\nالجواب:", "qhash": "e71ac031bca462a7", "answer": "[-8, -3, 13]\n[13, -3, -8, 14, 14, -8]\n3", "completion": " الناتج:\n```text\n[-8, -3, 13]\n[13, -3, -8, 14, 14, -8]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(-7))\nprint(compute(-7, 14))\nprint(compute(compute(14), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(-7))\nprint(compute(-7, 14))\nprint(compute(compute(14), -7))\n```\nالجواب:", "qhash": "782a67d8c1152344", "answer": "-37\n-77\n-41", "completion": " الناتج:\n```text\n-37\n-77\n-41\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 286\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 = 286\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": "bd3163d787078e7d", "answer": "104", "completion": " الناتج:\n```text\n104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('vector') == 'mvtkfi'", "assert cipher('planet') == 'gcrevk'", "assert cipher('cloud coffee a summer A1') == 'tcflu tfwwvv r jlddvi A1'", "assert cipher('cloud of orange') == 'tcflu fw firexv'", "assert cipher('stone garden an matrix') == 'jkfev xriuve re drkizo'", "assert cipher('music summer window rocket light') == 'dljzt jlddvi nzeufn iftbvk czxyk'", "assert cipher('') == ''"], "test_code": "assert cipher('vector') == 'mvtkfi'\nassert cipher('planet') == 'gcrevk'\nassert cipher('cloud coffee a summer A1') == 'tcflu tfwwvv r jlddvi A1'\nassert cipher('cloud of orange') == 'tcflu fw firexv'\nassert cipher('stone garden an matrix') == 'jkfev xriuve re drkizo'\nassert cipher('music summer window rocket light') == 'dljzt jlddvi nzeufn iftbvk czxyk'\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 + (17)) % 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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('vector')` يُرجع `'mvtkfi'`.\nالجواب:", "qhash": "d1553a2cd0926918"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 31) == 1)", "tests": ["assert coprime_count(44) == 43", "assert coprime_count(170) == 165", "assert coprime_count(181) == 176", "assert coprime_count(80) == 78", "assert coprime_count(113) == 110", "assert coprime_count(99) == 96", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(44) == 43\nassert coprime_count(170) == 165\nassert coprime_count(181) == 176\nassert coprime_count(80) == 78\nassert coprime_count(113) == 110\nassert coprime_count(99) == 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, 31) == 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, 31) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 31) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(44)` يُرجع `43`.\nالجواب:", "qhash": "bda9b7100cf78198"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'coffee'\nprint(text.upper())\nprint(text.replace('o', '0'))\nprint(text[2:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'coffee'\nprint(text.upper())\nprint(text.replace('o', '0'))\nprint(text[2:4])\n```\nالجواب:", "qhash": "987a5c6212839a32", "answer": "COFFEE\nc0ffee\nff", "completion": " الناتج:\n```text\nCOFFEE\nc0ffee\nff\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [23, 16, -6, 21, 35, -3]\nprint(data[1:6])\nprint(data[::3])\nprint(min(data[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [23, 16, -6, 21, 35, -3]\nprint(data[1:6])\nprint(data[::3])\nprint(min(data[1:6]))\n```\nالجواب:", "qhash": "889940838592b712", "answer": "[16, -6, 21, 35, -3]\n[23, 21]\n-6", "completion": " الناتج:\n```text\n[16, -6, 21, 35, -3]\n[23, 21]\n-6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 78", "tests": ["assert dig_pow_mod(48308) == 23", "assert dig_pow_mod(166464) == 27", "assert dig_pow_mod(775563) == 33", "assert dig_pow_mod(348933) == 30", "assert dig_pow_mod(590967) == 36", "assert dig_pow_mod(96970) == 31", "assert dig_pow_mod(275730) == 24", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(48308) == 23\nassert dig_pow_mod(166464) == 27\nassert dig_pow_mod(775563) == 33\nassert dig_pow_mod(348933) == 30\nassert dig_pow_mod(590967) == 36\nassert dig_pow_mod(96970) == 31\nassert dig_pow_mod(275730) == 24\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 78", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 78\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 78.\nللتوضيح: الاستدعاء `dig_pow_mod(48308)` يُرجع `23`.\nالجواب:", "qhash": "ee8db3d93bad8db5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'bcnt'}", "tests": ["assert char_counts('signal') == {'b': 0, 'c': 0, 'n': 1, 't': 0}", "assert char_counts('desert table to stone data music') == {'b': 1, 'c': 1, 'n': 1, 't': 5}", "assert char_counts('it by brain rocket of') == {'b': 2, 'c': 1, 'n': 1, 't': 2}", "assert char_counts('python cloud at') == {'b': 0, 'c': 1, 'n': 1, 't': 2}", "assert char_counts('table in is orange brain') == {'b': 2, 'c': 0, 'n': 3, 't': 1}", "assert char_counts('in pixel coffee') == {'b': 0, 'c': 1, 'n': 1, 't': 0}", "assert char_counts('') == {'b': 0, 'c': 0, 'n': 0, 't': 0}"], "test_code": "assert char_counts('signal') == {'b': 0, 'c': 0, 'n': 1, 't': 0}\nassert char_counts('desert table to stone data music') == {'b': 1, 'c': 1, 'n': 1, 't': 5}\nassert char_counts('it by brain rocket of') == {'b': 2, 'c': 1, 'n': 1, 't': 2}\nassert char_counts('python cloud at') == {'b': 0, 'c': 1, 'n': 1, 't': 2}\nassert char_counts('table in is orange brain') == {'b': 2, 'c': 0, 'n': 3, 't': 1}\nassert char_counts('in pixel coffee') == {'b': 0, 'c': 1, 'n': 1, 't': 0}\nassert char_counts('') == {'b': 0, 'c': 0, 'n': 0, 't': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'bcnt'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'bcnt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'n'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('signal')` يُرجع `{'b': 0, 'c': 0, 'n': 1, 't': 0}`.\nالجواب:", "qhash": "f0b4aa192fa30002"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']", "assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19']", "assert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']"], "test_code": "assert fizz(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']\nassert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19']\nassert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']", "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 % 11 == 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 % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 11 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(13)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13']`.\nالجواب:", "qhash": "4c594ad557751111"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([48, 41, 18, 5, -24, -11, 28, -10]) == 48", "assert max_of_div([-24, -6, -18]) == -6", "assert max_of_div([1, 7, 13, 19]) == None", "assert max_of_div([26, -37, 29, -19]) == None", "assert max_of_div([-9, 4, -20, -40, -17]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([48, 41, 18, 5, -24, -11, 28, -10]) == 48\nassert max_of_div([-24, -6, -18]) == -6\nassert max_of_div([1, 7, 13, 19]) == None\nassert max_of_div([26, -37, 29, -19]) == None\nassert max_of_div([-9, 4, -20, -40, -17]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 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 % 6 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(values):\n best = None\n for x in values:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_of_div([48, 41, 18, 5, -24, -11, 28, -10])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "ed3313ec69b6432b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-8))\nprint(calc(-8, 5))\nprint(calc(calc(5), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-8))\nprint(calc(-8, 5))\nprint(calc(calc(5), -8))\n```\nالجواب:", "qhash": "b1cd37a702da52d3", "answer": "-6\n-3\n11", "completion": " الناتج:\n```text\n-6\n-3\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('حديقة قلم جبل برتقال مدينة') == 1", "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('عمل سماء سماء سلام عربية نهار بحر قلم') == 0\nassert count_ar('شمس نهر') == 0\nassert count_ar('حديقة قلم جبل برتقال مدينة') == 1\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 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": "56985088497a8a87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(18))\nprint(calc(18, -3))\nprint(calc(calc(-3), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(18))\nprint(calc(18, -3))\nprint(calc(calc(-3), 18))\n```\nالجواب:", "qhash": "16ff8116902aa032", "answer": "100\n111\n252", "completion": " الناتج:\n```text\n100\n111\n252\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return text.count('ب')", "tests": ["assert letter_count('مطر بيت ماء شجرة لغة صحراء وردة جبل') == 2", "assert letter_count('برمجة قهوة جمل فجر طالب مدينة') == 2", "assert letter_count('نهار') == 0", "assert letter_count('مكتبة علم صحراء علم برتقال') == 2", "assert letter_count('صحراء نهار باب طالب وردة وردة سماء') == 3", "assert letter_count('بيت ميناء سلام بحر جمل مكتبة خبز ماء') == 4", "assert letter_count('برمجة تفاحة مطر رمل مطر تفاحة بيت') == 2", "assert letter_count('') == 0"], "test_code": "assert letter_count('مطر بيت ماء شجرة لغة صحراء وردة جبل') == 2\nassert letter_count('برمجة قهوة جمل فجر طالب مدينة') == 2\nassert letter_count('نهار') == 0\nassert letter_count('مكتبة علم صحراء علم برتقال') == 2\nassert letter_count('صحراء نهار باب طالب وردة وردة سماء') == 3\nassert letter_count('بيت ميناء سلام بحر جمل مكتبة خبز ماء') == 4\nassert letter_count('برمجة تفاحة مطر رمل مطر تفاحة بيت') == 2\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('مطر بيت ماء شجرة لغة صحراء وردة جبل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d26fd1ac79742491"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(285) == 7731", "assert multiples_total(24) == 37", "assert multiples_total(80) == 633", "assert multiples_total(93) == 892", "assert multiples_total(99) == 988", "assert multiples_total(38) == 119", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(285) == 7731\nassert multiples_total(24) == 37\nassert multiples_total(80) == 633\nassert multiples_total(93) == 892\nassert multiples_total(99) == 988\nassert multiples_total(38) == 119\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 % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(285)` يُرجع `7731`.\nالجواب:", "qhash": "0eca04d9a283a028"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'mors'}", "tests": ["assert letter_stats('music winter') == {'m': 1, 'o': 0, 'r': 1, 's': 1}", "assert letter_stats('summer apple pixel signal') == {'m': 2, 'o': 0, 'r': 1, 's': 2}", "assert letter_stats('it coffee python banana code') == {'m': 0, 'o': 3, 'r': 0, 's': 0}", "assert letter_stats('by orange') == {'m': 0, 'o': 1, 'r': 1, 's': 0}", "assert letter_stats('vector on light') == {'m': 0, 'o': 2, 'r': 1, 's': 0}", "assert letter_stats('go desert banana summer at a') == {'m': 2, 'o': 1, 'r': 2, 's': 2}", "assert letter_stats('') == {'m': 0, 'o': 0, 'r': 0, 's': 0}"], "test_code": "assert letter_stats('music winter') == {'m': 1, 'o': 0, 'r': 1, 's': 1}\nassert letter_stats('summer apple pixel signal') == {'m': 2, 'o': 0, 'r': 1, 's': 2}\nassert letter_stats('it coffee python banana code') == {'m': 0, 'o': 3, 'r': 0, 's': 0}\nassert letter_stats('by orange') == {'m': 0, 'o': 1, 'r': 1, 's': 0}\nassert letter_stats('vector on light') == {'m': 0, 'o': 2, 'r': 1, 's': 0}\nassert letter_stats('go desert banana summer at a') == {'m': 2, 'o': 1, 'r': 2, 's': 2}\nassert letter_stats('') == {'m': 0, 'o': 0, 'r': 0, 's': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'mors'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'mors'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'm'، 'o'، 'r'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('music winter')` يجب أن تُرجع `{'m': 1, 'o': 0, 'r': 1, 's': 1}`.\nالجواب:", "qhash": "ddcc7ba896044a7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "tests": ["assert weighted_sum(8) == 408", "assert weighted_sum(6) == 182", "assert weighted_sum(10) == 770", "assert weighted_sum(3) == 28", "assert weighted_sum(15) == 2480", "assert weighted_sum(1) == 2", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 408\nassert weighted_sum(6) == 182\nassert weighted_sum(10) == 770\nassert weighted_sum(3) == 28\nassert weighted_sum(15) == 2480\nassert weighted_sum(1) == 2\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 2 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 2\n return total\n```\nمثال: `weighted_sum(8)` يجب أن تُرجع `408`.\nالجواب:", "qhash": "504d95d4bf6d697b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 99204\nsteps = 0\nwhile x > 5:\n x = x // 6\n steps += 1\nprint(x, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 99204\nsteps = 0\nwhile x > 5:\n x = x // 6\n steps += 1\nprint(x, steps)\n```\nالجواب:", "qhash": "08fb82cb1fbaeff6", "answer": "2 6", "completion": " الناتج:\n```text\n2 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 62", "tests": ["assert digit_power(6966) == 33", "assert digit_power(646275) == 0", "assert digit_power(525613) == 40", "assert digit_power(175371) == 54", "assert digit_power(57090) == 39", "assert digit_power(269179) == 34", "assert digit_power(506654) == 6", "assert digit_power(0) == 0"], "test_code": "assert digit_power(6966) == 33\nassert digit_power(646275) == 0\nassert digit_power(525613) == 40\nassert digit_power(175371) == 54\nassert digit_power(57090) == 39\nassert digit_power(269179) == 34\nassert digit_power(506654) == 6\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 62", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 62\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 62.\nللتوضيح: الاستدعاء `digit_power(6966)` يُرجع `33`.\nالجواب:", "qhash": "c544cbc65aa32b16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('it') == 'vg'", "assert rotate_letters('is') == 'vf'", "assert rotate_letters('garden winter vector') == 'tneqra jvagre irpgbe'", "assert rotate_letters('data') == 'qngn'", "assert rotate_letters('by winter signal an pixel !') == 'ol jvagre fvtany na cvkry !'", "assert rotate_letters('data in it') == 'qngn va vg'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('it') == 'vg'\nassert rotate_letters('is') == 'vf'\nassert rotate_letters('garden winter vector') == 'tneqra jvagre irpgbe'\nassert rotate_letters('data') == 'qngn'\nassert rotate_letters('by winter signal an pixel !') == 'ol jvagre fvtany na cvkry !'\nassert rotate_letters('data in it') == 'qngn va vg'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('it')` يجب أن تُرجع `'vg'`.\nالجواب:", "qhash": "167b5207a8e76c5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 171:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([35, 52, 67, 15, 35, 43, 30, 18]) == [35, 87, 154, 169, 0, 43, 73, 91]", "assert capped_cumsum([71, 121]) == [71, 0]", "assert capped_cumsum([18, 99, 25, 121, 163, 10, 11, 29]) == [18, 117, 142, 0, 163, 0, 11, 40]", "assert capped_cumsum([76, 99, 119, 118, 163, 26, 53, 130, 128, 98]) == [76, 0, 119, 0, 163, 0, 53, 0, 128, 0]", "assert capped_cumsum([61, 61, 97]) == [61, 122, 0]", "assert capped_cumsum([1]) == [1]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([35, 52, 67, 15, 35, 43, 30, 18]) == [35, 87, 154, 169, 0, 43, 73, 91]\nassert capped_cumsum([71, 121]) == [71, 0]\nassert capped_cumsum([18, 99, 25, 121, 163, 10, 11, 29]) == [18, 117, 142, 0, 163, 0, 11, 40]\nassert capped_cumsum([76, 99, 119, 118, 163, 26, 53, 130, 128, 98]) == [76, 0, 119, 0, 163, 0, 53, 0, 128, 0]\nassert capped_cumsum([61, 61, 97]) == [61, 122, 0]\nassert capped_cumsum([1]) == [1]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 171:\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 > 171:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 171 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([35, 52, 67, 15, 35, 43, 30, 18])` يُرجع `[35, 87, 154, 169, 0, 43, 73, 91]`.\nالجواب:", "qhash": "7a65b1fa9dd69815"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 2 for x in range(2, 15) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 2 for x in range(2, 15) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "085057a1418dd354", "answer": "[14, 79, 194]\n3 287", "completion": " الناتج:\n```text\n[14, 79, 194]\n3 287\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('of by camel at coffee orange summer') == 'summer/orange/coffee'", "assert rev_long_words('camel signal banana code brain up signal matrix') == 'matrix/signal/banana/signal'", "assert rev_long_words('python banana cloud at cloud desert') == 'desert/banana/python'", "assert rev_long_words('desert by at in') == 'desert'", "assert rev_long_words('camel up falcon falcon go music brain by') == 'falcon/falcon'", "assert rev_long_words('') == ''", "assert rev_long_words('') == ''"], "test_code": "assert rev_long_words('of by camel at coffee orange summer') == 'summer/orange/coffee'\nassert rev_long_words('camel signal banana code brain up signal matrix') == 'matrix/signal/banana/signal'\nassert rev_long_words('python banana cloud at cloud desert') == 'desert/banana/python'\nassert rev_long_words('desert by at in') == 'desert'\nassert rev_long_words('camel up falcon falcon go music brain by') == 'falcon/falcon'\nassert rev_long_words('') == ''\nassert rev_long_words('') == ''", "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('of by camel at coffee orange summer')` يجب أن تُرجع `'summer/orange/coffee'`.\nالجواب:", "qhash": "ceadadf770617118"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'سعيد': 27, 'منى': 19, 'حسن': 8, 'هدى': 48}\nscores['حسن'] += 8\nscores['زينب'] = 36\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 = {'سعيد': 27, 'منى': 19, 'حسن': 8, 'هدى': 48}\nscores['حسن'] += 8\nscores['زينب'] = 36\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": "d229f73d3915b12d", "answer": "5\nهدى\n146\n[('حسن', 16), ('منى', 19)]", "completion": " الناتج:\n```text\n5\nهدى\n146\n[('حسن', 16), ('منى', 19)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "tests": ["assert sum_div(106) == 1406", "assert sum_div(299) == 11102", "assert sum_div(122) == 1860", "assert sum_div(163) == 3444", "assert sum_div(194) == 4704", "assert sum_div(274) == 9386", "assert sum_div(1) == 0"], "test_code": "assert sum_div(106) == 1406\nassert sum_div(299) == 11102\nassert sum_div(122) == 1860\nassert sum_div(163) == 3444\nassert sum_div(194) == 4704\nassert sum_div(274) == 9386\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(106)` يُرجع `1406`.\nالجواب:", "qhash": "3ed736b2a2417440"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 97", "tests": ["assert fact_mod(8) == 32", "assert fact_mod(33) == 58", "assert fact_mod(45) == 24", "assert fact_mod(51) == 11", "assert fact_mod(31) == 1", "assert fact_mod(17) == 51", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(8) == 32\nassert fact_mod(33) == 58\nassert fact_mod(45) == 24\nassert fact_mod(51) == 11\nassert fact_mod(31) == 1\nassert fact_mod(17) == 51\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 97", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(8)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "79e1a15b3d9b2f7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'أحمد': 9, 'هدى': 27, 'رنا': 17, 'زينب': 18, 'مريم': 0}\nmarks['أحمد'] += 10\nmarks['ليلى'] = 1\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'أحمد': 9, 'هدى': 27, 'رنا': 17, 'زينب': 18, 'مريم': 0}\nmarks['أحمد'] += 10\nmarks['ليلى'] = 1\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))\n```\nالجواب:", "qhash": "20c1d8a240200476", "answer": "6\nهدى\n82\n-1", "completion": " الناتج:\n```text\n6\nهدى\n82\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'جمل'\nprint(s.replace(' ', '-'))\nprint(s.split())\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'جمل'\nprint(s.replace(' ', '-'))\nprint(s.split())\nprint(len(s))\n```\nالجواب:", "qhash": "da2e6c022ad74ecd", "answer": "جمل\n['جمل']\n3", "completion": " الناتج:\n```text\nجمل\n['جمل']\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'نور': 42, 'فيصل': 37, 'رنا': 11, 'هدى': 26, 'عمر': 42}\npoints['عمر'] += 19\npoints['ليلى'] = 55\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'نور': 42, 'فيصل': 37, 'رنا': 11, 'هدى': 26, 'عمر': 42}\npoints['عمر'] += 19\npoints['ليلى'] = 55\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))\n```\nالجواب:", "qhash": "1db91dbb2d9dedf9", "answer": "6\nعمر\n232\n-1", "completion": " الناتج:\n```text\n6\nعمر\n232\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 47:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([9, 10, 4, 15, 1]) == [9, 19, 23, 38, 39]", "assert running_sum([36, 43, 19, 18, 32, 15, 7, 3]) == [36, 0, 19, 37, 0, 15, 22, 25]", "assert running_sum([-8, 9, 26, 44, 23, 17, 42, 10, 9, 22]) == [-8, 1, 27, 0, 23, 40, 0, 10, 19, 41]", "assert running_sum([22, 16, 3, 9, 34, 19, 30, 24, 47, 44]) == [22, 38, 41, 0, 34, 0, 30, 0, 47, 0]", "assert running_sum([12, 11]) == [12, 23]", "assert running_sum([35, 30]) == [35, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([9, 10, 4, 15, 1]) == [9, 19, 23, 38, 39]\nassert running_sum([36, 43, 19, 18, 32, 15, 7, 3]) == [36, 0, 19, 37, 0, 15, 22, 25]\nassert running_sum([-8, 9, 26, 44, 23, 17, 42, 10, 9, 22]) == [-8, 1, 27, 0, 23, 40, 0, 10, 19, 41]\nassert running_sum([22, 16, 3, 9, 34, 19, 30, 24, 47, 44]) == [22, 38, 41, 0, 34, 0, 30, 0, 47, 0]\nassert running_sum([12, 11]) == [12, 23]\nassert running_sum([35, 30]) == [35, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 47:\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 > 47:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 47 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([9, 10, 4, 15, 1])` يجب أن تُرجع `[9, 19, 23, 38, 39]`.\nالجواب:", "qhash": "382050f14f651cb7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([17, -11, -27, -13, 47, 28]) == -11", "assert best_multiple([-33, -55, -44]) == -33", "assert best_multiple([1, 12]) == None", "assert best_multiple([-6]) == None", "assert best_multiple([7, -16, 9, -23, 23, 24, -45]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([17, -11, -27, -13, 47, 28]) == -11\nassert best_multiple([-33, -55, -44]) == -33\nassert best_multiple([1, 12]) == None\nassert best_multiple([-6]) == None\nassert best_multiple([7, -16, 9, -23, 23, 24, -45]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `best_multiple([17, -11, -27, -13, 47, 28])` يُرجع `-11`.\nالجواب:", "qhash": "d320213409c9fe24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('عربية مطر معلم طالب ميناء سيارة صحراء') == 3", "assert starts_count('ميناء مدرسة بحر حصان سيارة') == 2", "assert starts_count('شجرة شمس حاسوب برمجة') == 0", "assert starts_count('معلم مكتبة سوق تفاحة حاسوب عربية مطر فجر') == 3", "assert starts_count('علم سفينة نهر سلام كتاب عمل') == 0", "assert starts_count('فجر ماء معلم جمل باب') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('عربية مطر معلم طالب ميناء سيارة صحراء') == 3\nassert starts_count('ميناء مدرسة بحر حصان سيارة') == 2\nassert starts_count('شجرة شمس حاسوب برمجة') == 0\nassert starts_count('معلم مكتبة سوق تفاحة حاسوب عربية مطر فجر') == 3\nassert starts_count('علم سفينة نهر سلام كتاب عمل') == 0\nassert starts_count('فجر ماء معلم جمل باب') == 2\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 'م' in w:\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 'م' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('عربية مطر معلم طالب ميناء سيارة صحراء')` يُرجع `3`.\nالجواب:", "qhash": "722cd4fbfa488a1a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'egs'}", "tests": ["assert freq_of('camel a matrix at to it') == {'e': 1, 'g': 0, 's': 0}", "assert freq_of('by at engine') == {'e': 2, 'g': 1, 's': 0}", "assert freq_of('an code planet') == {'e': 2, 'g': 0, 's': 0}", "assert freq_of('planet table falcon') == {'e': 2, 'g': 0, 's': 0}", "assert freq_of('is a') == {'e': 0, 'g': 0, 's': 1}", "assert freq_of('stone rocket matrix to orange') == {'e': 3, 'g': 1, 's': 1}", "assert freq_of('') == {'e': 0, 'g': 0, 's': 0}"], "test_code": "assert freq_of('camel a matrix at to it') == {'e': 1, 'g': 0, 's': 0}\nassert freq_of('by at engine') == {'e': 2, 'g': 1, 's': 0}\nassert freq_of('an code planet') == {'e': 2, 'g': 0, 's': 0}\nassert freq_of('planet table falcon') == {'e': 2, 'g': 0, 's': 0}\nassert freq_of('is a') == {'e': 0, 'g': 0, 's': 1}\nassert freq_of('stone rocket matrix to orange') == {'e': 3, 'g': 1, 's': 1}\nassert freq_of('') == {'e': 0, 'g': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'egs'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'egs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'g'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('camel a matrix at to it')` يجب أن تُرجع `{'e': 1, 'g': 0, 's': 0}`.\nالجواب:", "qhash": "6c7703ca405a5895"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([51, -24, -7, 7, 47, -5, -22, 16, -28]) == 7", "assert top_divisible([-14, -21, -7]) == -7", "assert top_divisible([1, 8, 15]) == None", "assert top_divisible([-8, 26, 4, -34]) == None", "assert top_divisible([37, -50, 48, 8, 9, -48, -17]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([51, -24, -7, 7, 47, -5, -22, 16, -28]) == 7\nassert top_divisible([-14, -21, -7]) == -7\nassert top_divisible([1, 8, 15]) == None\nassert top_divisible([-8, 26, 4, -34]) == None\nassert top_divisible([37, -50, 48, 8, 9, -48, -17]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(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للتوضيح: الاستدعاء `top_divisible([51, -24, -7, 7, 47, -5, -22, 16, -28])` يُرجع `7`.\nالجواب:", "qhash": "a0229152e3336b57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'aiou'}", "tests": ["assert char_counts('orange river vector') == {'a': 1, 'i': 1, 'o': 2, 'u': 0}", "assert char_counts('coffee stone brain apple window table') == {'a': 3, 'i': 2, 'o': 3, 'u': 0}", "assert char_counts('in') == {'a': 0, 'i': 1, 'o': 0, 'u': 0}", "assert char_counts('signal matrix signal garden pixel light') == {'a': 4, 'i': 5, 'o': 0, 'u': 0}", "assert char_counts('up code coffee music') == {'a': 0, 'i': 1, 'o': 2, 'u': 2}", "assert char_counts('on camel of code') == {'a': 1, 'i': 0, 'o': 3, 'u': 0}", "assert char_counts('') == {'a': 0, 'i': 0, 'o': 0, 'u': 0}"], "test_code": "assert char_counts('orange river vector') == {'a': 1, 'i': 1, 'o': 2, 'u': 0}\nassert char_counts('coffee stone brain apple window table') == {'a': 3, 'i': 2, 'o': 3, 'u': 0}\nassert char_counts('in') == {'a': 0, 'i': 1, 'o': 0, 'u': 0}\nassert char_counts('signal matrix signal garden pixel light') == {'a': 4, 'i': 5, 'o': 0, 'u': 0}\nassert char_counts('up code coffee music') == {'a': 0, 'i': 1, 'o': 2, 'u': 2}\nassert char_counts('on camel of code') == {'a': 1, 'i': 0, 'o': 3, 'u': 0}\nassert char_counts('') == {'a': 0, 'i': 0, 'o': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'aiou'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'aiou'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'i'، 'o'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('orange river vector')` يُرجع `{'a': 1, 'i': 1, 'o': 2, 'u': 0}`.\nالجواب:", "qhash": "5eeb71b860c9ac01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 67", "tests": ["assert fact_mod(12) == 51", "assert fact_mod(14) == 44", "assert fact_mod(28) == 29", "assert fact_mod(5) == 15", "assert fact_mod(53) == 21", "assert fact_mod(25) == 13", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(12) == 51\nassert fact_mod(14) == 44\nassert fact_mod(28) == 29\nassert fact_mod(5) == 15\nassert fact_mod(53) == 21\nassert fact_mod(25) == 13\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 67", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(12)` يجب أن تُرجع `51`.\nالجواب:", "qhash": "ad8d5454182bce0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'ليلى': 4, 'نور': 26, 'هشام': 47}\nd['هشام'] += 10\nd['باسل'] = 6\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 = {'ليلى': 4, 'نور': 26, 'هشام': 47}\nd['هشام'] += 10\nd['باسل'] = 6\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": "43a23d0346c9bbf3", "answer": "4\nهشام\n93\n[('ليلى', 4), ('باسل', 6)]", "completion": " الناتج:\n```text\n4\nهشام\n93\n[('ليلى', 4), ('باسل', 6)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 76) == 1)", "tests": ["assert coprimes(108) == 51", "assert coprimes(74) == 35", "assert coprimes(147) == 70", "assert coprimes(137) == 65", "assert coprimes(23) == 11", "assert coprimes(135) == 64", "assert coprimes(1) == 1"], "test_code": "assert coprimes(108) == 51\nassert coprimes(74) == 35\nassert coprimes(147) == 70\nassert coprimes(137) == 65\nassert coprimes(23) == 11\nassert coprimes(135) == 64\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, 76) == 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, 76) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 76، أي أن القاسم المشترك الأكبر لها مع 76 يساوي 1.\nمثال: `coprimes(108)` يجب أن تُرجع `51`.\nالجواب:", "qhash": "be592a05c300de5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['summer', 'light', 'winter', 'cloud', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['summer', 'light', 'winter', 'cloud', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "632800b5b6509bea", "answer": "['light', 'cloud', 'brain', 'summer', 'winter']\n['winter', 'summer', 'light']", "completion": " الناتج:\n```text\n['light', 'cloud', 'brain', 'summer', 'winter']\n['winter', 'summer', 'light']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 45", "tests": ["assert digit_score(26570) == 17", "assert digit_score(573685) == 43", "assert digit_score(361178) == 20", "assert digit_score(119881) == 1", "assert digit_score(88409) == 17", "assert digit_score(428356) == 7", "assert digit_score(352083) == 24", "assert digit_score(0) == 0"], "test_code": "assert digit_score(26570) == 17\nassert digit_score(573685) == 43\nassert digit_score(361178) == 20\nassert digit_score(119881) == 1\nassert digit_score(88409) == 17\nassert digit_score(428356) == 7\nassert digit_score(352083) == 24\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 45", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 45\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 45.\nللتوضيح: الاستدعاء `digit_score(26570)` يُرجع `17`.\nالجواب:", "qhash": "3b9513deee4a4022"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Tic'\n if i % 4 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(7) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7']", "assert fizz(13) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13']", "assert fizz(12) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac']", "assert fizz(19) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13', 'Tic', '15', 'TicTac', '17', 'Tic', '19']", "assert fizz(14) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13', 'Tic']"], "test_code": "assert fizz(7) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7']\nassert fizz(13) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13']\nassert fizz(12) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac']\nassert fizz(19) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13', 'Tic', '15', 'TicTac', '17', 'Tic', '19']\nassert fizz(14) == ['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7', 'TicTac', '9', 'Tic', '11', 'TicTac', '13', 'Tic']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Tic'، وعلى 4 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(7)` يجب أن تُرجع `['1', 'Tic', '3', 'TicTac', '5', 'Tic', '7']`.\nالجواب:", "qhash": "6aa8f3a354a388a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'مريم': 47, 'وليد': 36, 'نور': 13}\nscores['نور'] += 7\nscores['رنا'] = 21\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 23])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'مريم': 47, 'وليد': 36, 'نور': 13}\nscores['نور'] += 7\nscores['رنا'] = 21\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 23])\n```\nالجواب:", "qhash": "ea92fa01a4e9f749", "answer": "4\nمريم\n124\n['مريم', 'وليد']", "completion": " الناتج:\n```text\n4\nمريم\n124\n['مريم', 'وليد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('حسن', 21), ('مريم', 93), ('زينب', 25), ('هدى', 7)]\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 = [('حسن', 21), ('مريم', 93), ('زينب', 25), ('هدى', 7)]\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": "b0173ac3598ba1e4", "answer": "[('هدى', 7), ('حسن', 21), ('زينب', 25), ('مريم', 93)]\n['مريم', 'زينب']", "completion": " الناتج:\n```text\n[('هدى', 7), ('حسن', 21), ('زينب', 25), ('مريم', 93)]\n['مريم', 'زينب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)", "tests": ["assert sum_multiples(200) == 4900", "assert sum_multiples(203) == 5100", "assert sum_multiples(240) == 7080", "assert sum_multiples(65) == 544", "assert sum_multiples(169) == 3612", "assert sum_multiples(194) == 4704", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(200) == 4900\nassert sum_multiples(203) == 5100\nassert sum_multiples(240) == 7080\nassert sum_multiples(65) == 544\nassert sum_multiples(169) == 3612\nassert sum_multiples(194) == 4704\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 % 12 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(200)` يُرجع `4900`.\nالجواب:", "qhash": "0936f45680b5e1cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('desert we') == 'yznzmo rz'", "assert caesar('at orange light') == 'vo jmvibz gdbco'", "assert caesar('it on engine') == 'do ji zibdiz'", "assert caesar('window brain signal apple table') == 'rdiyjr wmvdi ndbivg vkkgz ovwgz'", "assert caesar('falcon in music A1') == 'avgxji di hpndx A1'", "assert caesar('table light on !') == 'ovwgz gdbco ji !'", "assert caesar('') == ''"], "test_code": "assert caesar('desert we') == 'yznzmo rz'\nassert caesar('at orange light') == 'vo jmvibz gdbco'\nassert caesar('it on engine') == 'do ji zibdiz'\nassert caesar('window brain signal apple table') == 'rdiyjr wmvdi ndbivg vkkgz ovwgz'\nassert caesar('falcon in music A1') == 'avgxji di hpndx A1'\nassert caesar('table light on !') == 'ovwgz gdbco ji !'\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 + (21)) % 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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('desert we')` يُرجع `'yznzmo rz'`.\nالجواب:", "qhash": "9250b91f6649ae01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 26", "tests": ["assert sum_digit_pow(40074) == 5", "assert sum_digit_pow(321495) == 8", "assert sum_digit_pow(634516) == 3", "assert sum_digit_pow(631929) == 24", "assert sum_digit_pow(16970) == 17", "assert sum_digit_pow(457277) == 2", "assert sum_digit_pow(246410) == 3", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(40074) == 5\nassert sum_digit_pow(321495) == 8\nassert sum_digit_pow(634516) == 3\nassert sum_digit_pow(631929) == 24\nassert sum_digit_pow(16970) == 17\nassert sum_digit_pow(457277) == 2\nassert sum_digit_pow(246410) == 3\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 26", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 26\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 26.\nللتوضيح: الاستدعاء `sum_digit_pow(40074)` يُرجع `5`.\nالجواب:", "qhash": "8c202e10282be939"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total", "tests": ["assert series(6) == 126", "assert series(13) == 546", "assert series(2) == 18", "assert series(14) == 630", "assert series(2) == 18", "assert series(1) == 6", "assert series(0) == 0"], "test_code": "assert series(6) == 126\nassert series(13) == 546\nassert series(2) == 18\nassert series(14) == 630\nassert series(2) == 18\nassert series(1) == 6\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 1\n return total\n```\nمثال: `series(6)` يجب أن تُرجع `126`.\nالجواب:", "qhash": "5f69e7aa733930e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)", "tests": ["assert in_range_scaled([23, 24, 55, 34, 35, 32, 45, 48, 26, 34]) == [-90, -70, -68, -68, -64, -52, -48, -46]", "assert in_range_scaled([-29, 18, -28, 34, -7]) == [-68, -36]", "assert in_range_scaled([32, 1]) == [-64]", "assert in_range_scaled([30, 3, 43, -9, -17, 58]) == [-86, -60]", "assert in_range_scaled([31, 2, -14, 1, -8, 5]) == [-62]", "assert in_range_scaled([-5, 43, 41]) == [-86, -82]", "assert in_range_scaled([20, 56, -13, 7, 49, -21, 15]) == [-40, -30]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([23, 24, 55, 34, 35, 32, 45, 48, 26, 34]) == [-90, -70, -68, -68, -64, -52, -48, -46]\nassert in_range_scaled([-29, 18, -28, 34, -7]) == [-68, -36]\nassert in_range_scaled([32, 1]) == [-64]\nassert in_range_scaled([30, 3, 43, -9, -17, 58]) == [-86, -60]\nassert in_range_scaled([31, 2, -14, 1, -8, 5]) == [-62]\nassert in_range_scaled([-5, 43, 41]) == [-86, -82]\nassert in_range_scaled([20, 56, -13, 7, 49, -21, 15]) == [-40, -30]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 9 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 9 و46 (شاملًا الطرفين) في -2.\nمثال: `in_range_scaled([23, 24, 55, 34, 35, 32, 45, 48, 26, 34])` يجب أن تُرجع `[-90, -70, -68, -68, -64, -52, -48, -46]`.\nالجواب:", "qhash": "856a7191dbb1848d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 3 <= x <= 26)", "tests": ["assert in_range_scaled([34, 1, 11, 1, -1, -1, 9, 3]) == [9, 27, 33]", "assert in_range_scaled([23, -13]) == [69]", "assert in_range_scaled([]) == []", "assert in_range_scaled([7, -30, 35, -15, 60, 32, 31, -22, 14]) == [21, 42]", "assert in_range_scaled([-4]) == []", "assert in_range_scaled([42, -19, 9, -9, 54, 9, 27]) == [27, 27]", "assert in_range_scaled([52, 15, 0, 15]) == [45, 45]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([34, 1, 11, 1, -1, -1, 9, 3]) == [9, 27, 33]\nassert in_range_scaled([23, -13]) == [69]\nassert in_range_scaled([]) == []\nassert in_range_scaled([7, -30, 35, -15, 60, 32, 31, -22, 14]) == [21, 42]\nassert in_range_scaled([-4]) == []\nassert in_range_scaled([42, -19, 9, -9, 54, 9, 27]) == [27, 27]\nassert in_range_scaled([52, 15, 0, 15]) == [45, 45]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 3 <= x <= 26)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 3 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 3 و26 (شاملًا الطرفين) في 3.\nمثال: `in_range_scaled([34, 1, 11, 1, -1, -1, 9, 3])` يجب أن تُرجع `[9, 27, 33]`.\nالجواب:", "qhash": "e38dfea10d629231"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('مدينة نور قهوة قمر شجرة عربية طائرة نور') == 2", "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('قمر سوق برتقال صديق نور') == 1\nassert count_letter('مدينة نور قهوة قمر شجرة عربية طائرة نور') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('قمر سوق برتقال صديق نور')` يُرجع `1`.\nالجواب:", "qhash": "22e5d9da4709f7dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'شجرة فجر'\nprint('ر' in w)\nprint(w.find('ر'))\nprint(w.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'شجرة فجر'\nprint('ر' in w)\nprint(w.find('ر'))\nprint(w.replace(' ', '-'))\n```\nالجواب:", "qhash": "f2576727474fb335", "answer": "True\n2\nشجرة-فجر", "completion": " الناتج:\n```text\nTrue\n2\nشجرة-فجر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('ماء وردة ليل حديقة') == 1", "assert count_prefix('قهوة طالب ميناء رمل ليل برمجة') == 1", "assert count_prefix('حديقة لغة رمل') == 1", "assert count_prefix('ليل ليل جبل جبل') == 2", "assert count_prefix('لغة لغة صحراء نهار نهار') == 2", "assert count_prefix('لغة نور بحر لغة حديقة') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('ماء وردة ليل حديقة') == 1\nassert count_prefix('قهوة طالب ميناء رمل ليل برمجة') == 1\nassert count_prefix('حديقة لغة رمل') == 1\nassert count_prefix('ليل ليل جبل جبل') == 2\nassert count_prefix('لغة لغة صحراء نهار نهار') == 2\nassert count_prefix('لغة نور بحر لغة حديقة') == 2\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 'ل' in w:\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 'ل' in w:\n count += 1\n return count\n```\nمثال: `count_prefix('ماء وردة ليل حديقة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "46b4ec770e6496a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'cloud'\nprint(name.find('c'))\nprint(name.replace('c', '0'))\nprint(name.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'cloud'\nprint(name.find('c'))\nprint(name.replace('c', '0'))\nprint(name.upper())\n```\nالجواب:", "qhash": "7ab3ab8e4aeb7427", "answer": "0\n0loud\nCLOUD", "completion": " الناتج:\n```text\n0\n0loud\nCLOUD\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 19) == 1)", "tests": ["assert count_coprime(21) == 20", "assert count_coprime(148) == 141", "assert count_coprime(49) == 47", "assert count_coprime(148) == 141", "assert count_coprime(174) == 165", "assert count_coprime(161) == 153", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(21) == 20\nassert count_coprime(148) == 141\nassert count_coprime(49) == 47\nassert count_coprime(148) == 141\nassert count_coprime(174) == 165\nassert count_coprime(161) == 153\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, 19) == 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, 19) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 19) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(21)` يُرجع `20`.\nالجواب:", "qhash": "5158eb1932389624"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'eo'}", "tests": ["assert freq_of('on window') == {'e': 0, 'o': 2}", "assert freq_of('apple of brain apple we') == {'e': 3, 'o': 1}", "assert freq_of('in of camel rocket banana music') == {'e': 2, 'o': 2}", "assert freq_of('by in') == {'e': 0, 'o': 0}", "assert freq_of('winter') == {'e': 1, 'o': 0}", "assert freq_of('in up') == {'e': 0, 'o': 0}", "assert freq_of('') == {'e': 0, 'o': 0}"], "test_code": "assert freq_of('on window') == {'e': 0, 'o': 2}\nassert freq_of('apple of brain apple we') == {'e': 3, 'o': 1}\nassert freq_of('in of camel rocket banana music') == {'e': 2, 'o': 2}\nassert freq_of('by in') == {'e': 0, 'o': 0}\nassert freq_of('winter') == {'e': 1, 'o': 0}\nassert freq_of('in up') == {'e': 0, 'o': 0}\nassert freq_of('') == {'e': 0, 'o': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'eo'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'eo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('on window')` يُرجع `{'e': 0, 'o': 2}`.\nالجواب:", "qhash": "f361d99117880699"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('window it light light data') == 'sejzks ep hecdp hecdp zwpw'", "assert rotate_letters('to signal at banana desert') == 'pk oecjwh wp xwjwjw zaoanp'", "assert rotate_letters('is') == 'eo'", "assert rotate_letters('data rocket') == 'zwpw nkygap'", "assert rotate_letters('is falcon') == 'eo bwhykj'", "assert rotate_letters('banana cloud engine') == 'xwjwjw yhkqz ajceja'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('window it light light data') == 'sejzks ep hecdp hecdp zwpw'\nassert rotate_letters('to signal at banana desert') == 'pk oecjwh wp xwjwjw zaoanp'\nassert rotate_letters('is') == 'eo'\nassert rotate_letters('data rocket') == 'zwpw nkygap'\nassert rotate_letters('is falcon') == 'eo bwhykj'\nassert rotate_letters('banana cloud engine') == 'xwjwjw yhkqz ajceja'\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 + (-4)) % 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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('window it light light data')` يجب أن تُرجع `'sejzks ep hecdp hecdp zwpw'`.\nالجواب:", "qhash": "71b0b8b2515ef1fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'light'\nprint(name[-2:])\nprint(name.replace('h', 'X'))\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'light'\nprint(name[-2:])\nprint(name.replace('h', 'X'))\nprint(len(name))\n```\nالجواب:", "qhash": "d4bed92ff341ca52", "answer": "ht\nligXt\n5", "completion": " الناتج:\n```text\nht\nligXt\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert starts_count('بيت وردة بيت') == 1", "assert starts_count('طائرة نهر نهار بحر مدينة طائرة') == 0", "assert starts_count('وردة وردة قمر كتاب وردة سوق بحر') == 3", "assert starts_count('جمل وردة قمر جمل سيارة قمر طالب') == 1", "assert starts_count('قمر وردة ماء عمل حديقة وردة') == 2", "assert starts_count('نهر وردة سيارة شجرة وردة') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('بيت وردة بيت') == 1\nassert starts_count('طائرة نهر نهار بحر مدينة طائرة') == 0\nassert starts_count('وردة وردة قمر كتاب وردة سوق بحر') == 3\nassert starts_count('جمل وردة قمر جمل سيارة قمر طالب') == 1\nassert starts_count('قمر وردة ماء عمل حديقة وردة') == 2\nassert starts_count('نهر وردة سيارة شجرة وردة') == 2\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(line):\n count = 0\n for w in line.split():\n if w.endswith('و'):\n count += 1\n return count\n```\nمثال: `starts_count('بيت وردة بيت')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "2b06e5d59d9260ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(6, 6))", "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, 6))\n```\nالجواب:", "qhash": "b0508ac3d7b38367", "answer": "46656", "completion": " الناتج:\n```text\n46656\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'planet_light'\nprint(text.find('a'))\nprint(text[-4:])\nprint(text.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'planet_light'\nprint(text.find('a'))\nprint(text[-4:])\nprint(text.upper())\n```\nالجواب:", "qhash": "dbee909166d5519b", "answer": "2\night\nPLANET_LIGHT", "completion": " الناتج:\n```text\n2\night\nPLANET_LIGHT\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi']", "assert play(17) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17']", "assert play(1) == ['1']", "assert play(17) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17']", "assert play(22) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17', 'Hi', '19', '20', 'Hi', 'Yo']"], "test_code": "assert play(12) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi']\nassert play(17) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17']\nassert play(1) == ['1']\nassert play(17) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17']\nassert play(22) == ['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi', '13', '14', 'Hi', '16', '17', 'Hi', '19', '20', 'Hi', 'Yo']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Hi'، وعلى 11 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(12)` يجب أن تُرجع `['1', '2', 'Hi', '4', '5', 'Hi', '7', '8', 'Hi', '10', 'Yo', 'Hi']`.\nالجواب:", "qhash": "84e8630841564496"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 37:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([13, 20, 19, 2, 9]) == [13, 33, 0, 2, 11]", "assert capped_cumsum([30, 23]) == [30, 0]", "assert capped_cumsum([1, 25, 23, 7, 27]) == [1, 26, 0, 7, 34]", "assert capped_cumsum([3, 7, 5, 13, 28, 28, 31, -4, 24, 31]) == [3, 10, 15, 28, 0, 28, 0, -4, 20, 0]", "assert capped_cumsum([30, 17, 29]) == [30, 0, 29]", "assert capped_cumsum([31, 13, 24, 34, 13, -6, 7, 6]) == [31, 0, 24, 0, 13, 7, 14, 20]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([13, 20, 19, 2, 9]) == [13, 33, 0, 2, 11]\nassert capped_cumsum([30, 23]) == [30, 0]\nassert capped_cumsum([1, 25, 23, 7, 27]) == [1, 26, 0, 7, 34]\nassert capped_cumsum([3, 7, 5, 13, 28, 28, 31, -4, 24, 31]) == [3, 10, 15, 28, 0, 28, 0, -4, 20, 0]\nassert capped_cumsum([30, 17, 29]) == [30, 0, 29]\nassert capped_cumsum([31, 13, 24, 34, 13, -6, 7, 6]) == [31, 0, 24, 0, 13, 7, 14, 20]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 37:\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 > 37:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 37 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([13, 20, 19, 2, 9])` يجب أن تُرجع `[13, 33, 0, 2, 11]`.\nالجواب:", "qhash": "69f32ac7292793b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 93476\nsteps = 0\nwhile n > 3:\n n = n // 9\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 93476\nsteps = 0\nwhile n > 3:\n n = n // 9\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "e958e7041539198b", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'summer_pixel'\nprint(name[3:7])\nprint(name[-1:])\nprint(name.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'summer_pixel'\nprint(name[3:7])\nprint(name[-1:])\nprint(name.upper())\n```\nالجواب:", "qhash": "351c93ab6f5091cd", "answer": "mer_\nl\nSUMMER_PIXEL", "completion": " الناتج:\n```text\nmer_\nl\nSUMMER_PIXEL\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 7", "tests": ["assert rec_prod(11) == 5", "assert rec_prod(53) == 0", "assert rec_prod(45) == 0", "assert rec_prod(57) == 0", "assert rec_prod(47) == 0", "assert rec_prod(21) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 5\nassert rec_prod(53) == 0\nassert rec_prod(45) == 0\nassert rec_prod(57) == 0\nassert rec_prod(47) == 0\nassert rec_prod(21) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 7", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `5`.\nالجواب:", "qhash": "6b89d8e80e8b9a1f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 84", "tests": ["assert digit_score(27018) == 24", "assert digit_score(520934) == 29", "assert digit_score(950263) == 13", "assert digit_score(66998) == 50", "assert digit_score(137679) == 63", "assert digit_score(26526) == 69", "assert digit_score(869586) == 42", "assert digit_score(0) == 0"], "test_code": "assert digit_score(27018) == 24\nassert digit_score(520934) == 29\nassert digit_score(950263) == 13\nassert digit_score(66998) == 50\nassert digit_score(137679) == 63\nassert digit_score(26526) == 69\nassert digit_score(869586) == 42\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 84", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 84\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 84.\nللتوضيح: الاستدعاء `digit_score(27018)` يُرجع `24`.\nالجواب:", "qhash": "0723f08f96f2a116"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'ليل'\nprint('س' in s)\nprint(s[-1])\nprint(s.find('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'ليل'\nprint('س' in s)\nprint(s[-1])\nprint(s.find('س'))\n```\nالجواب:", "qhash": "50a50a7b41daad5f", "answer": "False\nل\n-1", "completion": " الناتج:\n```text\nFalse\nل\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "tests": ["assert sum_terms(4) == 11700", "assert sum_terms(14) == 13858425", "assert sum_terms(6) == 109809", "assert sum_terms(10) == 1987425", "assert sum_terms(2) == 297", "assert sum_terms(1) == 9", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 11700\nassert sum_terms(14) == 13858425\nassert sum_terms(6) == 109809\nassert sum_terms(10) == 1987425\nassert sum_terms(2) == 297\nassert sum_terms(1) == 9\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `11700`.\nالجواب:", "qhash": "46e551a714658b90"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 23, 'مريم': 32, 'علي': 18, 'هدى': 14, 'عمر': 40}\npoints['علي'] += 11\npoints['هشام'] = 52\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 32])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 23, 'مريم': 32, 'علي': 18, 'هدى': 14, 'عمر': 40}\npoints['علي'] += 11\npoints['هشام'] = 52\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 32])\n```\nالجواب:", "qhash": "ab6c4ff9ac8f6c26", "answer": "6\nهشام\n190\n['عمر', 'هشام']", "completion": " الناتج:\n```text\n6\nهشام\n190\n['عمر', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'stone'\nprint(text.find('t'))\nprint(text.capitalize())\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'stone'\nprint(text.find('t'))\nprint(text.capitalize())\nprint(text[::-1])\n```\nالجواب:", "qhash": "1fe17cb2a0b89acb", "answer": "1\nStone\nenots", "completion": " الناتج:\n```text\n1\nStone\nenots\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 6 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([38, 21, 38, 13, 36]) == [36, 38, 21, 38, 13]", "assert roll([3, 9, -6, 14, 9, 50, 35, 21]) == [-6, 14, 9, 50, 35, 21, 3, 9]", "assert roll([9, 2, 50, -8, 7, 35, -3]) == [2, 50, -8, 7, 35, -3, 9]", "assert roll([17, 31, 13, -3, -7, 46, 7, 40, 12]) == [-3, -7, 46, 7, 40, 12, 17, 31, 13]", "assert roll([45]) == [45]", "assert roll([48, 17, 23, -2, 26, 25, 34]) == [17, 23, -2, 26, 25, 34, 48]", "assert roll([]) == []"], "test_code": "assert roll([38, 21, 38, 13, 36]) == [36, 38, 21, 38, 13]\nassert roll([3, 9, -6, 14, 9, 50, 35, 21]) == [-6, 14, 9, 50, 35, 21, 3, 9]\nassert roll([9, 2, 50, -8, 7, 35, -3]) == [2, 50, -8, 7, 35, -3, 9]\nassert roll([17, 31, 13, -3, -7, 46, 7, 40, 12]) == [-3, -7, 46, 7, 40, 12, 17, 31, 13]\nassert roll([45]) == [45]\nassert roll([48, 17, 23, -2, 26, 25, 34]) == [17, 23, -2, 26, 25, 34, 48]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 6 % 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 = 6 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 6 % len(arr)\n return ____\n```\nمثال: `roll([38, 21, 38, 13, 36])` يجب أن تُرجع `[36, 38, 21, 38, 13]`.\nالجواب:", "qhash": "be2ce11a42dc0dea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سماء نهر') == 0", "assert prefix_hits('صحراء لغة لغة امل سفينة علم امل') == 2", "assert prefix_hits('امل سوق ميناء دفتر امل عمل صديق') == 2", "assert prefix_hits('قمر سيارة مدرسة بيت طائرة دفتر') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صحراء باب') == 0\nassert prefix_hits('رمل سماء ماء معلم قمر') == 0\nassert prefix_hits('سماء نهر') == 0\nassert prefix_hits('صحراء لغة لغة امل سفينة علم امل') == 2\nassert prefix_hits('امل سوق ميناء دفتر امل عمل صديق') == 2\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:\n if w.startswith('ا'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ا». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef prefix_hits(line):\n count = 0\n for w in line:\n if w.startswith('ا'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('صحراء باب')` يُرجع `0`.\nالجواب:", "qhash": "251966f856e43b36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if 'م' in w)", "tests": ["assert tally_letter('سلام نهار برتقال مدينة بحر شجرة طالب نهار') == 2", "assert tally_letter('سوق برتقال برمجة مدينة بيت') == 2", "assert tally_letter('سلام كتاب برتقال عمل خبز برتقال') == 2", "assert tally_letter('مطر مطر علم قلم سفينة مدينة نهر جمل') == 6", "assert tally_letter('سفينة لغة سيارة مكتبة تفاحة ميناء صحراء بحر') == 2", "assert tally_letter('نهار نهر سوق حاسوب ليل تفاحة تفاحة نهر') == 0", "assert tally_letter('دفتر صديق بيت') == 0", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('سلام نهار برتقال مدينة بحر شجرة طالب نهار') == 2\nassert tally_letter('سوق برتقال برمجة مدينة بيت') == 2\nassert tally_letter('سلام كتاب برتقال عمل خبز برتقال') == 2\nassert tally_letter('مطر مطر علم قلم سفينة مدينة نهر جمل') == 6\nassert tally_letter('سفينة لغة سيارة مكتبة تفاحة ميناء صحراء بحر') == 2\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 'م' 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «م» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('سلام نهار برتقال مدينة بحر شجرة طالب نهار')` يُرجع `2`.\nالجواب:", "qhash": "7d9c4df91df61514"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59", "tests": ["assert multi_fact(9) == 1", "assert multi_fact(31) == 16", "assert multi_fact(16) == 47", "assert multi_fact(4) == 8", "assert multi_fact(27) == 18", "assert multi_fact(50) == 50", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(9) == 1\nassert multi_fact(31) == 16\nassert multi_fact(16) == 47\nassert multi_fact(4) == 8\nassert multi_fact(27) == 18\nassert multi_fact(50) == 50\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(9)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "eedd90532774412b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 26)", "tests": ["assert in_range_scaled([-12, -17, -13, -8, 2]) == [8]", "assert in_range_scaled([]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([56, 5, 54, -8, 45, 11, 46, 46, 18]) == [20, 44, 72]", "assert in_range_scaled([51, 25, 23, -11, 22, 8, 41, -27]) == [32, 88, 92, 100]", "assert in_range_scaled([-14, -20, 0, 1, -4]) == [-16, 0, 4]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-12, -17, -13, -8, 2]) == [8]\nassert in_range_scaled([]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([56, 5, 54, -8, 45, 11, 46, 46, 18]) == [20, 44, 72]\nassert in_range_scaled([51, 25, 23, -11, 22, 8, 41, -27]) == [32, 88, 92, 100]\nassert in_range_scaled([-14, -20, 0, 1, -4]) == [-16, 0, 4]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 26)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و26 (شاملًا الطرفين) في 4.\nمثال: `in_range_scaled([-12, -17, -13, -8, 2])` يجب أن تُرجع `[8]`.\nالجواب:", "qhash": "d8d35f5b75e879fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'دفتر سفينة'\nprint(s.split())\nprint(s[0])\nprint(s.find('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'دفتر سفينة'\nprint(s.split())\nprint(s[0])\nprint(s.find('ت'))\n```\nالجواب:", "qhash": "1b0916c031d3f630", "answer": "['دفتر', 'سفينة']\nد\n2", "completion": " الناتج:\n```text\n['دفتر', 'سفينة']\nد\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['data', 'garden', 'pixel', 'music', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['data', 'garden', 'pixel', 'music', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "ed5de538da2f0247", "answer": "['data', 'pixel', 'music', 'garden', 'planet']\n['planet', 'garden', 'pixel']", "completion": " الناتج:\n```text\n['data', 'pixel', 'music', 'garden', 'planet']\n['planet', 'garden', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([8, 24, 15, 3, 2, 23, 9]) == [8, 32, 0, 3, 5, 28, 37]", "assert rolling_total([18, -9, -1, 17, 34, 14]) == [18, 9, 8, 25, 0, 14]", "assert rolling_total([]) == []", "assert rolling_total([39, 11, 36, 17, 37, 26]) == [39, 0, 36, 0, 37, 0]", "assert rolling_total([16, 4, 35, 26, 4, 33, -6, 8]) == [16, 20, 0, 26, 30, 0, -6, 2]", "assert rolling_total([]) == []", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([8, 24, 15, 3, 2, 23, 9]) == [8, 32, 0, 3, 5, 28, 37]\nassert rolling_total([18, -9, -1, 17, 34, 14]) == [18, 9, 8, 25, 0, 14]\nassert rolling_total([]) == []\nassert rolling_total([39, 11, 36, 17, 37, 26]) == [39, 0, 36, 0, 37, 0]\nassert rolling_total([16, 4, 35, 26, 4, 33, -6, 8]) == [16, 20, 0, 26, 30, 0, -6, 2]\nassert rolling_total([]) == []\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\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 > 39:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 39 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([8, 24, 15, 3, 2, 23, 9])` يجب أن تُرجع `[8, 32, 0, 3, 5, 28, 37]`.\nالجواب:", "qhash": "ef97315279569689"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert div_not([38, 62, 31, 66, 28, 50, 56, 57, 5]) == 2", "assert div_not([39, 40, 7, 51, 60, -26, -6, 84, 38]) == 1", "assert div_not([-29, 69, 31, 28, 2, 74, -2, 86, 3, -33, 42, 81]) == 0", "assert div_not([-25]) == 1", "assert div_not([49]) == 0", "assert div_not([57, 84, 39, 69, 27, 33, 52, 35, 57, 81, 79]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([38, 62, 31, 66, 28, 50, 56, 57, 5]) == 2\nassert div_not([39, 40, 7, 51, 60, -26, -6, 84, 38]) == 1\nassert div_not([-29, 69, 31, 28, 2, 74, -2, 86, 3, -33, 42, 81]) == 0\nassert div_not([-25]) == 1\nassert div_not([49]) == 0\nassert div_not([57, 84, 39, 69, 27, 33, 52, 35, 57, 81, 79]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef div_not(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([38, 62, 31, 66, 28, 50, 56, 57, 5])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "f092f1639916d0f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "tests": ["assert sum_div(256) == 5274", "assert sum_div(32) == 99", "assert sum_div(196) == 2994", "assert sum_div(189) == 2610", "assert sum_div(194) == 2799", "assert sum_div(213) == 3609", "assert sum_div(1) == 0"], "test_code": "assert sum_div(256) == 5274\nassert sum_div(32) == 99\nassert sum_div(196) == 2994\nassert sum_div(189) == 2610\nassert sum_div(194) == 2799\nassert sum_div(213) == 3609\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 15.\nمثال: `sum_div(256)` يجب أن تُرجع `5274`.\nالجواب:", "qhash": "9b8dfbdad66d9932"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'تفاحة سماء'\nprint(kalima[0])\nprint(kalima.find('ة'))\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'تفاحة سماء'\nprint(kalima[0])\nprint(kalima.find('ة'))\nprint(kalima[-1])\n```\nالجواب:", "qhash": "1205bcd61af40d20", "answer": "ت\n4\nء", "completion": " الناتج:\n```text\nت\n4\nء\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'river_table'\nprint(name[0:11])\nprint(name[-3:])\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'river_table'\nprint(name[0:11])\nprint(name[-3:])\nprint(name.capitalize())\n```\nالجواب:", "qhash": "9232cd696492c7e9", "answer": "river_table\nble\nRiver_table", "completion": " الناتج:\n```text\nriver_table\nble\nRiver_table\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_by([14, 50, 25, 20, 45]) == [14, 50, 25, 20, 45]", "assert rotate_by([27, 5, 33]) == [5, 33, 27]", "assert rotate_by([50, 46, 22, 0]) == [50, 46, 22, 0]", "assert rotate_by([2, 33, -3]) == [33, -3, 2]", "assert rotate_by([28, 36, 36, 23, 17, 34, 31, 0, 30, 31, 1]) == [36, 23, 17, 34, 31, 0, 30, 31, 1, 28, 36]", "assert rotate_by([47, 5]) == [47, 5]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([14, 50, 25, 20, 45]) == [14, 50, 25, 20, 45]\nassert rotate_by([27, 5, 33]) == [5, 33, 27]\nassert rotate_by([50, 46, 22, 0]) == [50, 46, 22, 0]\nassert rotate_by([2, 33, -3]) == [33, -3, 2]\nassert rotate_by([28, 36, 36, 23, 17, 34, 31, 0, 30, 31, 1]) == [36, 23, 17, 34, 31, 0, 30, 31, 1, 28, 36]\nassert rotate_by([47, 5]) == [47, 5]\nassert rotate_by([]) == []", "answer": "def rotate_by(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 rotate_by(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 rotate_by(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([14, 50, 25, 20, 45])` يُرجع `[14, 50, 25, 20, 45]`.\nالجواب:", "qhash": "bf993568748a7dfe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44", "tests": ["assert digits_mod(53869) == 31", "assert digits_mod(751503) == 37", "assert digits_mod(404361) == 42", "assert digits_mod(114129) == 16", "assert digits_mod(652027) == 42", "assert digits_mod(565863) == 11", "assert digits_mod(449148) == 30", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(53869) == 31\nassert digits_mod(751503) == 37\nassert digits_mod(404361) == 42\nassert digits_mod(114129) == 16\nassert digits_mod(652027) == 42\nassert digits_mod(565863) == 11\nassert digits_mod(449148) == 30\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 44.\nللتوضيح: الاستدعاء `digits_mod(53869)` يُرجع `31`.\nالجواب:", "qhash": "c1a29e7d3b374d5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('علي', 23), ('يوسف', 10), ('فيصل', 29), ('راشد', 56)]\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 = [('علي', 23), ('يوسف', 10), ('فيصل', 29), ('راشد', 56)]\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": "29a7d5e44c4926b2", "answer": "[('يوسف', 10), ('علي', 23), ('فيصل', 29), ('راشد', 56)]\n['راشد', 'فيصل']", "completion": " الناتج:\n```text\n[('يوسف', 10), ('علي', 23), ('فيصل', 29), ('راشد', 56)]\n['راشد', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'hr'}", "tests": ["assert count_chars('by') == {'h': 0, 'r': 0}", "assert count_chars('light') == {'h': 1, 'r': 0}", "assert count_chars('it') == {'h': 0, 'r': 0}", "assert count_chars('light window an is apple desert') == {'h': 1, 'r': 1}", "assert count_chars('winter') == {'h': 0, 'r': 1}", "assert count_chars('music we python by matrix') == {'h': 1, 'r': 1}", "assert count_chars('') == {'h': 0, 'r': 0}"], "test_code": "assert count_chars('by') == {'h': 0, 'r': 0}\nassert count_chars('light') == {'h': 1, 'r': 0}\nassert count_chars('it') == {'h': 0, 'r': 0}\nassert count_chars('light window an is apple desert') == {'h': 1, 'r': 1}\nassert count_chars('winter') == {'h': 0, 'r': 1}\nassert count_chars('music we python by matrix') == {'h': 1, 'r': 1}\nassert count_chars('') == {'h': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'hr'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'hr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'h'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('by')` يُرجع `{'h': 0, 'r': 0}`.\nالجواب:", "qhash": "38fe44e6093ef35f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 210\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 = 210\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": "6d99e243eefdde4f", "answer": "39", "completion": " الناتج:\n```text\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "tests": ["assert total_pow(6) == 2646", "assert total_pow(6) == 2646", "assert total_pow(0) == 0", "assert total_pow(5) == 1350", "assert total_pow(5) == 1350", "assert total_pow(1) == 6", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 2646\nassert total_pow(6) == 2646\nassert total_pow(0) == 0\nassert total_pow(5) == 1350\nassert total_pow(5) == 1350\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 ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 3\n return total\n```\nمثال: `total_pow(6)` يجب أن تُرجع `2646`.\nالجواب:", "qhash": "727e3939b42e7627"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('راشد', 63), ('خالد', 81), ('عمر', 70), ('أحمد', 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 = [('راشد', 63), ('خالد', 81), ('عمر', 70), ('أحمد', 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": "594ac60288adc674", "answer": "[('راشد', 63), ('عمر', 70), ('خالد', 81), ('أحمد', 91)]\n['أحمد', 'خالد']", "completion": " الناتج:\n```text\n[('راشد', 63), ('عمر', 70), ('خالد', 81), ('أحمد', 91)]\n['أحمد', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('coffee vector in stone signal') == 'xjaazz qzxojm di nojiz ndbivg'", "assert decode('music is cloud table') == 'hpndx dn xgjpy ovwgz'", "assert decode('it cloud !') == 'do xgjpy !'", "assert decode('matrix river orange apple up 2024') == 'hvomds mdqzm jmvibz vkkgz pk 2024'", "assert decode('by') == 'wt'", "assert decode('matrix brain') == 'hvomds wmvdi'", "assert decode('') == ''"], "test_code": "assert decode('coffee vector in stone signal') == 'xjaazz qzxojm di nojiz ndbivg'\nassert decode('music is cloud table') == 'hpndx dn xgjpy ovwgz'\nassert decode('it cloud !') == 'do xgjpy !'\nassert decode('matrix river orange apple up 2024') == 'hvomds mdqzm jmvibz vkkgz pk 2024'\nassert decode('by') == 'wt'\nassert decode('matrix brain') == 'hvomds wmvdi'\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 + (-5)) % 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 + (-5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('coffee vector in stone signal')` يُرجع `'xjaazz qzxojm di nojiz ndbivg'`.\nالجواب:", "qhash": "347a6e7f6120e8e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('table by to up garden') == 'jqrbu ro je kf wqhtud'", "assert rotate_letters('light engine apple signal') == 'bywxj udwydu qffbu iywdqb'", "assert rotate_letters('cloud desert a at banana') == 'sbekt tuiuhj q qj rqdqdq'", "assert rotate_letters('brain matrix on planet') == 'rhqyd cqjhyn ed fbqduj'", "assert rotate_letters('python music at signal apple') == 'fojxed ckiys qj iywdqb qffbu'", "assert rotate_letters('code falcon') == 'setu vqbsed'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('table by to up garden') == 'jqrbu ro je kf wqhtud'\nassert rotate_letters('light engine apple signal') == 'bywxj udwydu qffbu iywdqb'\nassert rotate_letters('cloud desert a at banana') == 'sbekt tuiuhj q qj rqdqdq'\nassert rotate_letters('brain matrix on planet') == 'rhqyd cqjhyn ed fbqduj'\nassert rotate_letters('python music at signal apple') == 'fojxed ckiys qj iywdqb qffbu'\nassert rotate_letters('code falcon') == 'setu vqbsed'\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 + (-10)) % 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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('table by to up garden')` يُرجع `'jqrbu ro je kf wqhtud'`.\nالجواب:", "qhash": "bf308d98ef8b8acd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('apple pixel python by') == 'python'", "assert invert_words('rocket we camel code winter falcon desert river') == 'desert|falcon|winter|rocket'", "assert invert_words('up brain apple vector') == 'vector'", "assert invert_words('signal garden on garden') == 'garden|garden|signal'", "assert invert_words('river music') == ''", "assert invert_words('banana rocket summer engine code on cloud banana') == 'banana|engine|summer|rocket|banana'", "assert invert_words('a') == ''"], "test_code": "assert invert_words('apple pixel python by') == 'python'\nassert invert_words('rocket we camel code winter falcon desert river') == 'desert|falcon|winter|rocket'\nassert invert_words('up brain apple vector') == 'vector'\nassert invert_words('signal garden on garden') == 'garden|garden|signal'\nassert invert_words('river music') == ''\nassert invert_words('banana rocket summer engine code on cloud banana') == 'banana|engine|summer|rocket|banana'\nassert invert_words('a') == ''", "answer": "def invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `invert_words('apple pixel python by')` يُرجع `'python'`.\nالجواب:", "qhash": "610834061da4f38e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([4, -25, 45, -11, 29, 28, 26, 60, 39]) == -11", "assert max_div([-22, -33, -11]) == -11", "assert max_div([1, 12, 23]) == None", "assert max_div([4, 4, -40, 8, 10, 34]) == None", "assert max_div([-24, 24, -23, -36, 31, -22, 9, -32, 49]) == -22", "assert max_div([]) == None"], "test_code": "assert max_div([4, -25, 45, -11, 29, 28, 26, 60, 39]) == -11\nassert max_div([-22, -33, -11]) == -11\nassert max_div([1, 12, 23]) == None\nassert max_div([4, 4, -40, 8, 10, 34]) == None\nassert max_div([-24, 24, -23, -36, 31, -22, 9, -32, 49]) == -22\nassert max_div([]) == None", "answer": "def max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_div([4, -25, 45, -11, 29, 28, 26, 60, 39])` يجب أن تُرجع `-11`.\nالجواب:", "qhash": "ad63bf001efc428e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(5, 4))", "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(5, 4))\n```\nالجواب:", "qhash": "734384c288f0121f", "answer": "625", "completion": " الناتج:\n```text\n625\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 5) == 1)", "tests": ["assert coprimes(85) == 68", "assert coprimes(46) == 37", "assert coprimes(17) == 14", "assert coprimes(46) == 37", "assert coprimes(20) == 16", "assert coprimes(101) == 81", "assert coprimes(1) == 1"], "test_code": "assert coprimes(85) == 68\nassert coprimes(46) == 37\nassert coprimes(17) == 14\nassert coprimes(46) == 37\nassert coprimes(20) == 16\nassert coprimes(101) == 81\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, 5) == 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, 5) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 5) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(85)` يُرجع `68`.\nالجواب:", "qhash": "4e583894e0869276"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "d1418ac17ba21e17"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 45\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 = 45\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": "c0fe3edab82a6496", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(-8))\nprint(g(-8, 19))\nprint(g(g(19), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(-8))\nprint(g(-8, 19))\nprint(g(g(19), -8))\n```\nالجواب:", "qhash": "7f12669696587341", "answer": "-11\n-65\n-34", "completion": " الناتج:\n```text\n-11\n-65\n-34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(14))\n```\nالجواب:", "qhash": "5ac8d82d3a5257fe", "answer": "377", "completion": " الناتج:\n```text\n377\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 53", "tests": ["assert multi_fact(4) == 24", "assert multi_fact(32) == 5", "assert multi_fact(50) == 26", "assert multi_fact(3) == 6", "assert multi_fact(43) == 24", "assert multi_fact(57) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(4) == 24\nassert multi_fact(32) == 5\nassert multi_fact(50) == 26\nassert multi_fact(3) == 6\nassert multi_fact(43) == 24\nassert multi_fact(57) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 53", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(4)` يُرجع `24`.\nالجواب:", "qhash": "9723defd848351b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 30", "tests": ["assert digit_power(34380) == 18", "assert digit_power(966981) == 9", "assert digit_power(338134) == 22", "assert digit_power(848203) == 25", "assert digit_power(744560) == 26", "assert digit_power(881452) == 28", "assert digit_power(317632) == 22", "assert digit_power(0) == 0"], "test_code": "assert digit_power(34380) == 18\nassert digit_power(966981) == 9\nassert digit_power(338134) == 22\nassert digit_power(848203) == 25\nassert digit_power(744560) == 26\nassert digit_power(881452) == 28\nassert digit_power(317632) == 22\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 30", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 30\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 30.\nمثال: `digit_power(34380)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "db69494aeede142b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([25, 11, 52, 6, -2, 30, 1]) == 30", "assert max_of_div([-18, -6, -6]) == -6", "assert max_of_div([1, 7]) == None", "assert max_of_div([-34, -15, -33, -36, -6, -16, 36]) == 36", "assert max_of_div([-7, -9, -25, -31, -24]) == -24", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([25, 11, 52, 6, -2, 30, 1]) == 30\nassert max_of_div([-18, -6, -6]) == -6\nassert max_of_div([1, 7]) == None\nassert max_of_div([-34, -15, -33, -36, -6, -16, 36]) == 36\nassert max_of_div([-7, -9, -25, -31, -24]) == -24\nassert max_of_div([]) == None", "answer": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([25, 11, 52, 6, -2, 30, 1])` يُرجع `30`.\nالجواب:", "qhash": "ac88a11aae76b75f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 4515\nc = 0\nwhile m > 16:\n m = m // 6\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 4515\nc = 0\nwhile m > 16:\n m = m // 6\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "3a5f8af500533d3a", "answer": "3 4", "completion": " الناتج:\n```text\n3 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'garden'\nprint(text.find('r'))\nprint(text.capitalize())\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'garden'\nprint(text.find('r'))\nprint(text.capitalize())\nprint(len(text))\n```\nالجواب:", "qhash": "5a444a02ff118830", "answer": "2\nGarden\n6", "completion": " الناتج:\n```text\n2\nGarden\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'tu'}", "tests": ["assert tally('engine rocket light window code brain') == {'t': 2, 'u': 0}", "assert tally('falcon planet camel python an') == {'t': 2, 'u': 0}", "assert tally('a') == {'t': 0, 'u': 0}", "assert tally('cloud code') == {'t': 0, 'u': 1}", "assert tally('stone summer matrix') == {'t': 2, 'u': 1}", "assert tally('an window rocket') == {'t': 1, 'u': 0}", "assert tally('') == {'t': 0, 'u': 0}"], "test_code": "assert tally('engine rocket light window code brain') == {'t': 2, 'u': 0}\nassert tally('falcon planet camel python an') == {'t': 2, 'u': 0}\nassert tally('a') == {'t': 0, 'u': 0}\nassert tally('cloud code') == {'t': 0, 'u': 1}\nassert tally('stone summer matrix') == {'t': 2, 'u': 1}\nassert tally('an window rocket') == {'t': 1, 'u': 0}\nassert tally('') == {'t': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'tu'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'tu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 't'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('engine rocket light window code brain')` يجب أن تُرجع `{'t': 2, 'u': 0}`.\nالجواب:", "qhash": "5d7f3819fdd33161"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'برمجة'\nprint(kalima[-1])\nprint(kalima.count('ج'))\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'برمجة'\nprint(kalima[-1])\nprint(kalima.count('ج'))\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "6e12e06cb2dbb535", "answer": "ة\n1\nبرمجة", "completion": " الناتج:\n```text\nة\n1\nبرمجة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 11) == 1)", "tests": ["assert count_gcd1(15) == 14", "assert count_gcd1(186) == 170", "assert count_gcd1(20) == 19", "assert count_gcd1(194) == 177", "assert count_gcd1(188) == 171", "assert count_gcd1(92) == 84", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(15) == 14\nassert count_gcd1(186) == 170\nassert count_gcd1(20) == 19\nassert count_gcd1(194) == 177\nassert count_gcd1(188) == 171\nassert count_gcd1(92) == 84\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, 11) == 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, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 11، أي أن القاسم المشترك الأكبر لها مع 11 يساوي 1.\nمثال: `count_gcd1(15)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "1525213ba6171246"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'صحراء رمل'\nprint(w[-1])\nprint(w[0])\nprint(w[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'صحراء رمل'\nprint(w[-1])\nprint(w[0])\nprint(w[::-1])\n```\nالجواب:", "qhash": "df60828568023ccf", "answer": "ل\nص\nلمر ءارحص", "completion": " الناتج:\n```text\nل\nص\nلمر ءارحص\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('فيصل', 7), ('راشد', 40), ('باسل', 58), ('سعيد', 73)]\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 = [('فيصل', 7), ('راشد', 40), ('باسل', 58), ('سعيد', 73)]\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": "2063afe494cc2695", "answer": "[('فيصل', 7), ('راشد', 40), ('باسل', 58), ('سعيد', 73)]\n['سعيد', 'باسل']", "completion": " الناتج:\n```text\n[('فيصل', 7), ('راشد', 40), ('باسل', 58), ('سعيد', 73)]\n['سعيد', 'باسل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['brain', 'music', 'apple', 'matrix', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['brain', 'music', 'apple', 'matrix', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "1ae2487010d07c0e", "answer": "['brain', 'music', 'apple', 'river', 'matrix']\n['matrix', 'river', 'music']", "completion": " الناتج:\n```text\n['brain', 'music', 'apple', 'river', 'matrix']\n['matrix', 'river', 'music']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -1 + -9 for x in range(6, 12) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -1 + -9 for x in range(6, 12) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f9a1330bfb0d8fd3", "answer": "[-15, -19]\n2 -34", "completion": " الناتج:\n```text\n[-15, -19]\n2 -34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 9 == 0)", "tests": ["assert total_multiples(101) == 2874", "assert total_multiples(274) == 20657", "assert total_multiples(53) == 783", "assert total_multiples(290) == 23184", "assert total_multiples(189) == 9830", "assert total_multiples(108) == 3186", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(101) == 2874\nassert total_multiples(274) == 20657\nassert total_multiples(53) == 783\nassert total_multiples(290) == 23184\nassert total_multiples(189) == 9830\nassert total_multiples(108) == 3186\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 % 9 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(101)` يُرجع `2874`.\nالجواب:", "qhash": "826ccb18360e2a4d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 59", "tests": ["assert rec_prod(11) == 55", "assert rec_prod(3) == 6", "assert rec_prod(30) == 30", "assert rec_prod(24) == 27", "assert rec_prod(0) == 1", "assert rec_prod(16) == 43", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 55\nassert rec_prod(3) == 6\nassert rec_prod(30) == 30\nassert rec_prod(24) == 27\nassert rec_prod(0) == 1\nassert rec_prod(16) == 43\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 59", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `55`.\nالجواب:", "qhash": "51e2ab4f9c4dd6d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert rev_join('desert garden vector') == 'vector-garden-desert'", "assert rev_join('matrix at') == 'matrix'", "assert rev_join('on falcon engine light signal orange stone') == 'stone-orange-signal-light-engine-falcon'", "assert rev_join('banana') == 'banana'", "assert rev_join('orange is') == 'orange'", "assert rev_join('window pixel up') == 'pixel-window'", "assert rev_join('signal falcon data planet') == 'planet-falcon-signal'"], "test_code": "assert rev_join('desert garden vector') == 'vector-garden-desert'\nassert rev_join('matrix at') == 'matrix'\nassert rev_join('on falcon engine light signal orange stone') == 'stone-orange-signal-light-engine-falcon'\nassert rev_join('banana') == 'banana'\nassert rev_join('orange is') == 'orange'\nassert rev_join('window pixel up') == 'pixel-window'\nassert rev_join('signal falcon data planet') == 'planet-falcon-signal'", "answer": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `rev_join('desert garden vector')` يُرجع `'vector-garden-desert'`.\nالجواب:", "qhash": "eef74b0e705a8028"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 67", "tests": ["assert mfact(10) == 21", "assert mfact(25) == 13", "assert mfact(60) == 58", "assert mfact(35) == 66", "assert mfact(30) == 66", "assert mfact(17) == 52", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 21\nassert mfact(25) == 13\nassert mfact(60) == 58\nassert mfact(35) == 66\nassert mfact(30) == 66\nassert mfact(17) == 52\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 67", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(10)` يُرجع `21`.\nالجواب:", "qhash": "f56bba615c3a65b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 40", "tests": ["assert digit_score(91720) == 9", "assert digit_score(207164) == 0", "assert digit_score(11436) == 5", "assert digit_score(687404) == 39", "assert digit_score(33629) == 23", "assert digit_score(988593) == 2", "assert digit_score(467181) == 17", "assert digit_score(0) == 0"], "test_code": "assert digit_score(91720) == 9\nassert digit_score(207164) == 0\nassert digit_score(11436) == 5\nassert digit_score(687404) == 39\nassert digit_score(33629) == 23\nassert digit_score(988593) == 2\nassert digit_score(467181) == 17\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 40", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 40\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 40.\nللتوضيح: الاستدعاء `digit_score(91720)` يُرجع `9`.\nالجواب:", "qhash": "ddc397900608560f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('vector table') == 'irpgbe gnoyr'", "assert encode('code') == 'pbqr'", "assert encode('orange a') == 'benatr n'", "assert encode('cloud signal OK') == 'pybhq fvtany OK'", "assert encode('planet on falcon by to Hello') == 'cynarg ba snypba ol gb Hryyb'", "assert encode('coffee pixel 2024') == 'pbssrr cvkry 2024'", "assert encode('') == ''"], "test_code": "assert encode('vector table') == 'irpgbe gnoyr'\nassert encode('code') == 'pbqr'\nassert encode('orange a') == 'benatr n'\nassert encode('cloud signal OK') == 'pybhq fvtany OK'\nassert encode('planet on falcon by to Hello') == 'cynarg ba snypba ol gb Hryyb'\nassert encode('coffee pixel 2024') == 'pbssrr cvkry 2024'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('vector table')` يُرجع `'irpgbe gnoyr'`.\nالجواب:", "qhash": "82ca6341623f2471"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "tests": ["assert multiples_total(179) == 3963", "assert multiples_total(61) == 420", "assert multiples_total(73) == 689", "assert multiples_total(116) == 1624", "assert multiples_total(66) == 547", "assert multiples_total(200) == 4906", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(179) == 3963\nassert multiples_total(61) == 420\nassert multiples_total(73) == 689\nassert multiples_total(116) == 1624\nassert multiples_total(66) == 547\nassert multiples_total(200) == 4906\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(179)` يُرجع `3963`.\nالجواب:", "qhash": "0118a274f82182e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([24, 58, 73, 34, 31, 28, 71, 64, 0, 26, 28, 11]) == 0", "assert count_special([8, 82, 86, 24, -9, 33, -11, 32, 58]) == 0", "assert count_special([41, 64, 33, 46, -40, 12, 57, 47, 10, 1, 57]) == 0", "assert count_special([-30, -19, 70, 78, 67, 79, 71, -15, 68, 42]) == 0", "assert count_special([-27, 45]) == 0", "assert count_special([88, 57, 27, -8, -7, 9]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([24, 58, 73, 34, 31, 28, 71, 64, 0, 26, 28, 11]) == 0\nassert count_special([8, 82, 86, 24, -9, 33, -11, 32, 58]) == 0\nassert count_special([41, 64, 33, 46, -40, 12, 57, 47, 10, 1, 57]) == 0\nassert count_special([-30, -19, 70, 78, 67, 79, 71, -15, 68, 42]) == 0\nassert count_special([-27, 45]) == 0\nassert count_special([88, 57, 27, -8, -7, 9]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([24, 58, 73, 34, 31, 28, 71, 64, 0, 26, 28, 11])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "c7486530ba963e2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 2:\n return 4\n return 3 * rec(n - 1) + -1\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 2:\n return 4\n return 3 * rec(n - 1) + -1\n\nprint(rec(5))\n```\nالجواب:", "qhash": "7357f25ecec625e2", "answer": "95", "completion": " الناتج:\n```text\n95\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('data cloud signal banana OK') == 'pmfm oxagp euszmx nmzmzm OK'", "assert encode('python by we summer OK') == 'bkftaz nk iq egyyqd OK'", "assert encode('signal coffee') == 'euszmx oarrqq'", "assert encode('it at vector go') == 'uf mf hqofad sa'", "assert encode('apple orange signal') == 'mbbxq admzsq euszmx'", "assert encode('music desert code') == 'ygeuo pqeqdf oapq'", "assert encode('') == ''"], "test_code": "assert encode('data cloud signal banana OK') == 'pmfm oxagp euszmx nmzmzm OK'\nassert encode('python by we summer OK') == 'bkftaz nk iq egyyqd OK'\nassert encode('signal coffee') == 'euszmx oarrqq'\nassert encode('it at vector go') == 'uf mf hqofad sa'\nassert encode('apple orange signal') == 'mbbxq admzsq euszmx'\nassert encode('music desert code') == 'ygeuo pqeqdf oapq'\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 + (-14)) % 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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('data cloud signal banana OK')` يجب أن تُرجع `'pmfm oxagp euszmx nmzmzm OK'`.\nالجواب:", "qhash": "ae5a163fb38c084c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 37) == 1)", "tests": ["assert coprimes(102) == 100", "assert coprimes(188) == 183", "assert coprimes(127) == 124", "assert coprimes(53) == 52", "assert coprimes(181) == 177", "assert coprimes(195) == 190", "assert coprimes(1) == 1"], "test_code": "assert coprimes(102) == 100\nassert coprimes(188) == 183\nassert coprimes(127) == 124\nassert coprimes(53) == 52\nassert coprimes(181) == 177\nassert coprimes(195) == 190\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, 37) == 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, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 37) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(102)` يُرجع `100`.\nالجواب:", "qhash": "452eed6d4452c9df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=0):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-2))\nprint(calc(-2, 10))\nprint(calc(calc(10), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=0):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-2))\nprint(calc(-2, 10))\nprint(calc(calc(10), -2))\n```\nالجواب:", "qhash": "b5c5be5bad479b4c", "answer": "-2\n28\n92", "completion": " الناتج:\n```text\n-2\n28\n92\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 5\nfor i in range(-4, 16, 4):\n acc -= i * 2\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 5\nfor i in range(-4, 16, 4):\n acc -= i * 2\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "43638749a91d4d6e", "answer": "-35\n12", "completion": " الناتج:\n```text\n-35\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "tests": ["assert multiples_total(162) == 2652", "assert multiples_total(141) == 2040", "assert multiples_total(292) == 8562", "assert multiples_total(30) == 85", "assert multiples_total(6) == 0", "assert multiples_total(15) == 21", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(162) == 2652\nassert multiples_total(141) == 2040\nassert multiples_total(292) == 8562\nassert multiples_total(30) == 85\nassert multiples_total(6) == 0\nassert multiples_total(15) == 21\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 15.\nمثال: `multiples_total(162)` يجب أن تُرجع `2652`.\nالجواب:", "qhash": "289a41426ed9bd5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_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 only_div([34, 1, 17, 34, 84, 26, 84, 61]) == 2", "assert only_div([-5, 9, 85, 83]) == 0", "assert only_div([]) == 0", "assert only_div([-35, 0, 9, 37, 60]) == 1", "assert only_div([-8, 60, 27, -13, 79, 23, 35, 38, -3, 65, 18]) == 1", "assert only_div([-39, 7, 36]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([34, 1, 17, 34, 84, 26, 84, 61]) == 2\nassert only_div([-5, 9, 85, 83]) == 0\nassert only_div([]) == 0\nassert only_div([-35, 0, 9, 37, 60]) == 1\nassert only_div([-8, 60, 27, -13, 79, 23, 35, 38, -3, 65, 18]) == 1\nassert only_div([-39, 7, 36]) == 1\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([34, 1, 17, 34, 84, 26, 84, 61])` يُرجع `2`.\nالجواب:", "qhash": "3006d78736c0f691"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [16, 33, 23, 8, 13, -15, 21]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [16, 33, 23, 8, 13, -15, 21]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "11f357c74750d2c2", "answer": "[-15, 8, 13, 16, 21, 23, 33]\n[33, 23, 21]", "completion": " الناتج:\n```text\n[-15, 8, 13, 16, 21, 23, 33]\n[33, 23, 21]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 17268\nc = 0\nwhile x > 2:\n x = x // 4\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 17268\nc = 0\nwhile x > 2:\n x = x // 4\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "22276124df5e60fc", "answer": "1 7", "completion": " الناتج:\n```text\n1 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 89) == 1)", "tests": ["assert count_coprime(109) == 108", "assert count_coprime(74) == 74", "assert count_coprime(22) == 22", "assert count_coprime(20) == 20", "assert count_coprime(12) == 12", "assert count_coprime(85) == 85", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(109) == 108\nassert count_coprime(74) == 74\nassert count_coprime(22) == 22\nassert count_coprime(20) == 20\nassert count_coprime(12) == 12\nassert count_coprime(85) == 85\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, 89) == 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, 89) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 89) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(109)` يُرجع `108`.\nالجواب:", "qhash": "0fe4eba8e74df283"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert spin([50, 38, 36]) == [36, 50, 38]", "assert spin([44, -9, 21, -7, 11, 47, 10, 38, 7, -1]) == [10, 38, 7, -1, 44, -9, 21, -7, 11, 47]", "assert spin([42, 9, 15, -3, 45, 42, 10, 25, 38]) == [42, 10, 25, 38, 42, 9, 15, -3, 45]", "assert spin([5, 47, 34, 50, 50, 15, 31]) == [50, 50, 15, 31, 5, 47, 34]", "assert spin([-7, 23, 25]) == [25, -7, 23]", "assert spin([18, 43, 11]) == [11, 18, 43]", "assert spin([]) == []"], "test_code": "assert spin([50, 38, 36]) == [36, 50, 38]\nassert spin([44, -9, 21, -7, 11, 47, 10, 38, 7, -1]) == [10, 38, 7, -1, 44, -9, 21, -7, 11, 47]\nassert spin([42, 9, 15, -3, 45, 42, 10, 25, 38]) == [42, 10, 25, 38, 42, 9, 15, -3, 45]\nassert spin([5, 47, 34, 50, 50, 15, 31]) == [50, 50, 15, 31, 5, 47, 34]\nassert spin([-7, 23, 25]) == [25, -7, 23]\nassert spin([18, 43, 11]) == [11, 18, 43]\nassert spin([]) == []", "answer": "def spin(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 spin(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 spin(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return ____\n```\nمثال: `spin([50, 38, 36])` يجب أن تُرجع `[36, 50, 38]`.\nالجواب:", "qhash": "d107f34c00e0e126"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "tests": ["assert cycle([30, 36, 41, 25, 28, 24]) == [28, 24, 30, 36, 41, 25]", "assert cycle([47, -6, 50]) == [-6, 50, 47]", "assert cycle([23, 41, 47, -2, -4, 30, -3, 27, 41, -2, 22, 30]) == [-4, 30, -3, 27, 41, -2, 22, 30, 23, 41, 47, -2]", "assert cycle([7, -7, 28, 2, 40, 25, 31, 36, 50, 9]) == [31, 36, 50, 9, 7, -7, 28, 2, 40, 25]", "assert cycle([24, 39, 35, 40]) == [24, 39, 35, 40]", "assert cycle([-8, 42]) == [-8, 42]", "assert cycle([]) == []"], "test_code": "assert cycle([30, 36, 41, 25, 28, 24]) == [28, 24, 30, 36, 41, 25]\nassert cycle([47, -6, 50]) == [-6, 50, 47]\nassert cycle([23, 41, 47, -2, -4, 30, -3, 27, 41, -2, 22, 30]) == [-4, 30, -3, 27, 41, -2, 22, 30, 23, 41, 47, -2]\nassert cycle([7, -7, 28, 2, 40, 25, 31, 36, 50, 9]) == [31, 36, 50, 9, 7, -7, 28, 2, 40, 25]\nassert cycle([24, 39, 35, 40]) == [24, 39, 35, 40]\nassert cycle([-8, 42]) == [-8, 42]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 16 % len(items)\n return ____\n```\nمثال: `cycle([30, 36, 41, 25, 28, 24])` يجب أن تُرجع `[28, 24, 30, 36, 41, 25]`.\nالجواب:", "qhash": "2ab1507d9d01729f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('ه')", "tests": ["assert count_in_text('فجر طالب لغة رمل جمل قمر نهار') == 1", "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", "assert count_in_text('ميناء كتاب صديق صحراء طائرة صحراء') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('فجر طالب لغة رمل جمل قمر نهار') == 1\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\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)` بحيث تُعيد عدد مرات ظهور الحرف «ه» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('فجر طالب لغة رمل جمل قمر نهار')` يُرجع `1`.\nالجواب:", "qhash": "d42128af008d7139"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 14", "tests": ["assert digit_score(91772) == 12", "assert digit_score(649383) == 9", "assert digit_score(152314) == 0", "assert digit_score(652382) == 12", "assert digit_score(714453) == 8", "assert digit_score(435381) == 2", "assert digit_score(510519) == 1", "assert digit_score(0) == 0"], "test_code": "assert digit_score(91772) == 12\nassert digit_score(649383) == 9\nassert digit_score(152314) == 0\nassert digit_score(652382) == 12\nassert digit_score(714453) == 8\nassert digit_score(435381) == 2\nassert digit_score(510519) == 1\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 14", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 14\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 14.\nمثال: `digit_score(91772)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "42fed68fae3330ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101", "tests": ["assert multi_fact(5) == 15", "assert multi_fact(43) == 10", "assert multi_fact(12) == 24", "assert multi_fact(17) == 43", "assert multi_fact(40) == 7", "assert multi_fact(2) == 2", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(5) == 15\nassert multi_fact(43) == 10\nassert multi_fact(12) == 24\nassert multi_fact(17) == 43\nassert multi_fact(40) == 7\nassert multi_fact(2) == 2\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(5)` يُرجع `15`.\nالجواب:", "qhash": "2bf29add2f3c37cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([85, 24, 71, 72, 34, 80, 19, 11, 17, 80, 24]) == 3", "assert how_many_div([-5, -3, 66, -36]) == 2", "assert how_many_div([90, -30, -38, -2]) == 2", "assert how_many_div([67, 12, -35, 84, -37, 24, 47, -9, 18]) == 3", "assert how_many_div([44, 28, 20, -19, 9]) == 0", "assert how_many_div([29, -23, 7, -12, 22, 78, 57]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([85, 24, 71, 72, 34, 80, 19, 11, 17, 80, 24]) == 3\nassert how_many_div([-5, -3, 66, -36]) == 2\nassert how_many_div([90, -30, -38, -2]) == 2\nassert how_many_div([67, 12, -35, 84, -37, 24, 47, -9, 18]) == 3\nassert how_many_div([44, 28, 20, -19, 9]) == 0\nassert how_many_div([29, -23, 7, -12, 22, 78, 57]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 7، ثم اكتب الدالة كاملة.\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([85, 24, 71, 72, 34, 80, 19, 11, 17, 80, 24])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "24305c945f113b78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(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 tally_div([1, 75, 69, 85, 86, 68]) == 2", "assert tally_div([-11, 27, -25, -22, -10, -14, 20]) == 3", "assert tally_div([41, -37, -11, 68, -26, 41, 74]) == 3", "assert tally_div([3]) == 0", "assert tally_div([31, 56, 67, 14, 15, 14, 68, 82, 39, 32]) == 3", "assert tally_div([-7, 33, 12, 29, 83]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([1, 75, 69, 85, 86, 68]) == 2\nassert tally_div([-11, 27, -25, -22, -10, -14, 20]) == 3\nassert tally_div([41, -37, -11, 68, -26, 41, 74]) == 3\nassert tally_div([3]) == 0\nassert tally_div([31, 56, 67, 14, 15, 14, 68, 82, 39, 32]) == 3\nassert tally_div([-7, 33, 12, 29, 83]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `tally_div([1, 75, 69, 85, 86, 68])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "e8de880ee02d8a84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert pow_total(5) == 120", "assert pow_total(1) == 8", "assert pow_total(9) == 360", "assert pow_total(4) == 80", "assert pow_total(11) == 528", "assert pow_total(1) == 8", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 120\nassert pow_total(1) == 8\nassert pow_total(9) == 360\nassert pow_total(4) == 80\nassert pow_total(11) == 528\nassert pow_total(1) == 8\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `pow_total(5)` يُرجع `120`.\nالجواب:", "qhash": "b549e4bee58733ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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 at light go planet vector') == 'vector-planet-go-light-at-winter'", "assert reverse_words('') == ''", "assert reverse_words('to camel to to python by summer vector') == 'vector-summer-by-python-to-to-camel-to'", "assert reverse_words('of garden window') == 'window-garden-of'", "assert reverse_words('on light we python in coffee') == 'coffee-in-python-we-light-on'", "assert reverse_words('') == ''", "assert reverse_words('desert rocket at signal apple brain we') == 'we-brain-apple-signal-at-rocket-desert'"], "test_code": "assert reverse_words('winter at light go planet vector') == 'vector-planet-go-light-at-winter'\nassert reverse_words('') == ''\nassert reverse_words('to camel to to python by summer vector') == 'vector-summer-by-python-to-to-camel-to'\nassert reverse_words('of garden window') == 'window-garden-of'\nassert reverse_words('on light we python in coffee') == 'coffee-in-python-we-light-on'\nassert reverse_words('') == ''\nassert reverse_words('desert rocket at signal apple brain we') == 'we-brain-apple-signal-at-rocket-desert'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `reverse_words('winter at light go planet vector')` يُرجع `'vector-planet-go-light-at-winter'`.\nالجواب:", "qhash": "c5d579982f4000df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 16\nfor n in range(-4, 18, 4):\n total -= n * 3\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 16\nfor n in range(-4, 18, 4):\n total -= n * 3\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "5b7f4ded867ef40e", "answer": "-92\n16", "completion": " الناتج:\n```text\n-92\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_sel([82, 41, 14, 86, 74, 6, 33, 1]) == 1", "assert count_sel([1, 69, 63, 89, 53, -7, 29, 69, 90]) == 3", "assert count_sel([-2, 31, 89, 68, 35, -33, 28, 40]) == 1", "assert count_sel([66, 32, -4]) == 0", "assert count_sel([78, -12, 3, 68]) == 1", "assert count_sel([11, -31, 89, -9, 48, 6, -9, -8, 22, 42, -39, 6]) == 3", "assert count_sel([]) == 0"], "test_code": "assert count_sel([82, 41, 14, 86, 74, 6, 33, 1]) == 1\nassert count_sel([1, 69, 63, 89, 53, -7, 29, 69, 90]) == 3\nassert count_sel([-2, 31, 89, 68, 35, -33, 28, 40]) == 1\nassert count_sel([66, 32, -4]) == 0\nassert count_sel([78, -12, 3, 68]) == 1\nassert count_sel([11, -31, 89, -9, 48, 6, -9, -8, 22, 42, -39, 6]) == 3\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([82, 41, 14, 86, 74, 6, 33, 1])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "89439ee048be338d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 33)", "tests": ["assert between_times([16, 13, 11, 27, 28, 22, 32, 12]) == [-160, -140, -135, -110, -80, -65, -60, -55]", "assert between_times([-26, -24, 5, -17, 27, 16, 14, -3, 4]) == [-135, -80, -70, -25]", "assert between_times([43, 0, 9, -16, 58, 59, 25, 56]) == [-125, -45]", "assert between_times([8, 40, -22, 14, 7, 34]) == [-70, -40, -35]", "assert between_times([30]) == [-150]", "assert between_times([27, -27]) == [-135]", "assert between_times([-26, -11, 38, 31, 53, 19]) == [-155, -95]", "assert between_times([]) == []"], "test_code": "assert between_times([16, 13, 11, 27, 28, 22, 32, 12]) == [-160, -140, -135, -110, -80, -65, -60, -55]\nassert between_times([-26, -24, 5, -17, 27, 16, 14, -3, 4]) == [-135, -80, -70, -25]\nassert between_times([43, 0, 9, -16, 58, 59, 25, 56]) == [-125, -45]\nassert between_times([8, 40, -22, 14, 7, 34]) == [-70, -40, -35]\nassert between_times([30]) == [-150]\nassert between_times([27, -27]) == [-135]\nassert between_times([-26, -11, 38, 31, 53, 19]) == [-155, -95]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 33)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 33)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 5 ≤ x ≤ 33، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([16, 13, 11, 27, 28, 22, 32, 12])` يُرجع `[-160, -140, -135, -110, -80, -65, -60, -55]`.\nالجواب:", "qhash": "25be5d865af21699"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79", "tests": ["assert prod_mod(3) == 3", "assert prod_mod(45) == 33", "assert prod_mod(39) == 34", "assert prod_mod(11) == 11", "assert prod_mod(41) == 33", "assert prod_mod(2) == 2", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(3) == 3\nassert prod_mod(45) == 33\nassert prod_mod(39) == 34\nassert prod_mod(11) == 11\nassert prod_mod(41) == 33\nassert prod_mod(2) == 2\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 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": "ed06cd36f265bb8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 22) == 1)", "tests": ["assert coprime_count(12) == 5", "assert coprime_count(66) == 30", "assert coprime_count(10) == 5", "assert coprime_count(93) == 43", "assert coprime_count(130) == 59", "assert coprime_count(10) == 5", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(12) == 5\nassert coprime_count(66) == 30\nassert coprime_count(10) == 5\nassert coprime_count(93) == 43\nassert coprime_count(130) == 59\nassert coprime_count(10) == 5\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, 22) == 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, 22) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 22) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(12)` يُرجع `5`.\nالجواب:", "qhash": "1a464c81f3cb7cfd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 73", "tests": ["assert sum_digit_pow(24928) == 25", "assert sum_digit_pow(228994) == 34", "assert sum_digit_pow(482012) == 17", "assert sum_digit_pow(529351) == 25", "assert sum_digit_pow(429981) == 33", "assert sum_digit_pow(104915) == 20", "assert sum_digit_pow(986180) == 32", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(24928) == 25\nassert sum_digit_pow(228994) == 34\nassert sum_digit_pow(482012) == 17\nassert sum_digit_pow(529351) == 25\nassert sum_digit_pow(429981) == 33\nassert sum_digit_pow(104915) == 20\nassert sum_digit_pow(986180) == 32\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 73", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 73.\nللتوضيح: الاستدعاء `sum_digit_pow(24928)` يُرجع `25`.\nالجواب:", "qhash": "9cb42a3ddc6605a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 30) == 1)", "tests": ["assert coprime_count(124) == 33", "assert coprime_count(179) == 48", "assert coprime_count(186) == 49", "assert coprime_count(8) == 2", "assert coprime_count(113) == 31", "assert coprime_count(127) == 34", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(124) == 33\nassert coprime_count(179) == 48\nassert coprime_count(186) == 49\nassert coprime_count(8) == 2\nassert coprime_count(113) == 31\nassert coprime_count(127) == 34\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, 30) == 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, 30) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 30، أي أن القاسم المشترك الأكبر لها مع 30 يساوي 1.\nمثال: `coprime_count(124)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "5be842d8c925984f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'زينب': 23, 'منى': 10, 'حسن': 14}\nscores['منى'] += 12\nscores['وليد'] = 50\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 = {'زينب': 23, 'منى': 10, 'حسن': 14}\nscores['منى'] += 12\nscores['وليد'] = 50\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": "e8b39d2d2ccfb5d7", "answer": "4\nوليد\n109\n[('حسن', 14), ('منى', 22)]", "completion": " الناتج:\n```text\n4\nوليد\n109\n[('حسن', 14), ('منى', 22)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(959900705))\nprint(go(go(959900705)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(959900705))\nprint(go(go(959900705)))\n```\nالجواب:", "qhash": "5877da7ba2173885", "answer": "44\n8", "completion": " الناتج:\n```text\n44\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ل'))", "tests": ["assert letter_hits('علم نهر ميناء حصان مدينة نهر حديقة') == 0", "assert letter_hits('عمل نور عربية دفتر نهار') == 0", "assert letter_hits('علم معلم رمل مدرسة نهر نهر برمجة') == 0", "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('علم نهر ميناء حصان مدينة نهر حديقة') == 0\nassert letter_hits('عمل نور عربية دفتر نهار') == 0\nassert letter_hits('علم معلم رمل مدرسة نهر نهر برمجة') == 0\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 sum(1 for w in text.split() if w.startswith('ل'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ل'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_hits(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ل»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('علم نهر ميناء حصان مدينة نهر حديقة')` يُرجع `0`.\nالجواب:", "qhash": "f55a88ae3ab24600"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'mn'}", "tests": ["assert char_counts('light to an data garden pixel') == {'m': 0, 'n': 2}", "assert char_counts('go') == {'m': 0, 'n': 0}", "assert char_counts('engine') == {'m': 0, 'n': 2}", "assert char_counts('an matrix in orange we') == {'m': 1, 'n': 3}", "assert char_counts('summer of') == {'m': 2, 'n': 0}", "assert char_counts('python pixel by apple light') == {'m': 0, 'n': 1}", "assert char_counts('') == {'m': 0, 'n': 0}"], "test_code": "assert char_counts('light to an data garden pixel') == {'m': 0, 'n': 2}\nassert char_counts('go') == {'m': 0, 'n': 0}\nassert char_counts('engine') == {'m': 0, 'n': 2}\nassert char_counts('an matrix in orange we') == {'m': 1, 'n': 3}\nassert char_counts('summer of') == {'m': 2, 'n': 0}\nassert char_counts('python pixel by apple light') == {'m': 0, 'n': 1}\nassert char_counts('') == {'m': 0, 'n': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'mn'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'mn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'm'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('light to an data garden pixel')` يجب أن تُرجع `{'m': 0, 'n': 2}`.\nالجواب:", "qhash": "5bd71c11d19813f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "tests": ["assert scaled_powers(3) == 1078", "assert scaled_powers(14) == 1404557", "assert scaled_powers(2) == 187", "assert scaled_powers(3) == 1078", "assert scaled_powers(2) == 187", "assert scaled_powers(1) == 11", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(3) == 1078\nassert scaled_powers(14) == 1404557\nassert scaled_powers(2) == 187\nassert scaled_powers(3) == 1078\nassert scaled_powers(2) == 187\nassert scaled_powers(1) == 11\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total\n```\nمثال: `scaled_powers(3)` يجب أن تُرجع `1078`.\nالجواب:", "qhash": "5fcd1a3e512c752f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 17\nfor n in range(9, 34, 3):\n result += n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 17\nfor n in range(9, 34, 3):\n result += n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "40c1d0cd39b9a0fe", "answer": "1529\n33", "completion": " الناتج:\n```text\n1529\n33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 79:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([4, 9, 29, 27, 40, 27]) == [4, 13, 42, 69, 0, 27]", "assert reset_sum([19, 32]) == [19, 51]", "assert reset_sum([5, 79, 23, 68, 23, 35]) == [5, 0, 23, 0, 23, 58]", "assert reset_sum([19, 31, 32, 48, 65, 20]) == [19, 50, 0, 48, 0, 20]", "assert reset_sum([-4, 51, 34, 3]) == [-4, 47, 0, 3]", "assert reset_sum([]) == []", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([4, 9, 29, 27, 40, 27]) == [4, 13, 42, 69, 0, 27]\nassert reset_sum([19, 32]) == [19, 51]\nassert reset_sum([5, 79, 23, 68, 23, 35]) == [5, 0, 23, 0, 23, 58]\nassert reset_sum([19, 31, 32, 48, 65, 20]) == [19, 50, 0, 48, 0, 20]\nassert reset_sum([-4, 51, 34, 3]) == [-4, 47, 0, 3]\nassert reset_sum([]) == []\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 79:\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 > 79:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 79 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([4, 9, 29, 27, 40, 27])` يُرجع `[4, 13, 42, 69, 0, 27]`.\nالجواب:", "qhash": "3c81cac4cb5c5e31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([27, 28, 37, 17, 12, 38, 30]) == [28, 37, 17, 12, 38, 30, 27]", "assert rotate_by([19, 8, 27]) == [8, 27, 19]", "assert rotate_by([-2]) == [-2]", "assert rotate_by([13, 42, 36, 26, -6, 34, 12, 7, 38, 47]) == [13, 42, 36, 26, -6, 34, 12, 7, 38, 47]", "assert rotate_by([46, 45, 16, 25, 5, 3, -9, 14, 21, 37, 35]) == [16, 25, 5, 3, -9, 14, 21, 37, 35, 46, 45]", "assert rotate_by([7, 24, 20, 11, 33, 16, 26]) == [24, 20, 11, 33, 16, 26, 7]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([27, 28, 37, 17, 12, 38, 30]) == [28, 37, 17, 12, 38, 30, 27]\nassert rotate_by([19, 8, 27]) == [8, 27, 19]\nassert rotate_by([-2]) == [-2]\nassert rotate_by([13, 42, 36, 26, -6, 34, 12, 7, 38, 47]) == [13, 42, 36, 26, -6, 34, 12, 7, 38, 47]\nassert rotate_by([46, 45, 16, 25, 5, 3, -9, 14, 21, 37, 35]) == [16, 25, 5, 3, -9, 14, 21, 37, 35, 46, 45]\nassert rotate_by([7, 24, 20, 11, 33, 16, 26]) == [24, 20, 11, 33, 16, 26, 7]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n if not items:\n return []\n k = 20 % 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 = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(items):\n if not items:\n return []\n k = 20 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([27, 28, 37, 17, 12, 38, 30])` يُرجع `[28, 37, 17, 12, 38, 30, 27]`.\nالجواب:", "qhash": "9280f26597fd3d37"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [28, -2, 27, 30, -11, 29, -4, -13]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [28, -2, 27, 30, -11, 29, -4, -13]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "c43156f953cdc151", "answer": "[-4, -11, -2, -13, 27, 28, 29, 30]\n[30, 29, 28]", "completion": " الناتج:\n```text\n[-4, -11, -2, -13, 27, 28, 29, 30]\n[30, 29, 28]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "tests": ["assert scaled_powers(8) == 105264", "assert scaled_powers(13) == 1071252", "assert scaled_powers(4) == 4248", "assert scaled_powers(12) == 728520", "assert scaled_powers(10) == 303996", "assert scaled_powers(1) == 12", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 105264\nassert scaled_powers(13) == 1071252\nassert scaled_powers(4) == 4248\nassert scaled_powers(12) == 728520\nassert scaled_powers(10) == 303996\nassert scaled_powers(1) == 12\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(8)` يُرجع `105264`.\nالجواب:", "qhash": "0485d3198a59c0a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 5\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 = 5\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": "b24b906709d14e91", "answer": "5", "completion": " الناتج:\n```text\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 8) // 2 for x in range(-5, 10) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 8) // 2 for x in range(-5, 10) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "41ca7e116bf0c7c2", "answer": "[1, 2, 3, 4, 5, 6, 7, 8]\n8 36", "completion": " الناتج:\n```text\n[1, 2, 3, 4, 5, 6, 7, 8]\n8 36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('نور', 64), ('زينب', 83), ('باسل', 57), ('فيصل', 7)]\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 = [('نور', 64), ('زينب', 83), ('باسل', 57), ('فيصل', 7)]\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": "42fceb8c55ec4d79", "answer": "[('فيصل', 7), ('باسل', 57), ('نور', 64), ('زينب', 83)]\n['زينب', 'نور']", "completion": " الناتج:\n```text\n[('فيصل', 7), ('باسل', 57), ('نور', 64), ('زينب', 83)]\n['زينب', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [20, 32, 8, 17, 26]\nprint(a[0:3])\nprint(a[::3])\nprint(sum(a[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [20, 32, 8, 17, 26]\nprint(a[0:3])\nprint(a[::3])\nprint(sum(a[0:3]))\n```\nالجواب:", "qhash": "ce2f08cb92c78bfa", "answer": "[20, 32, 8]\n[20, 17]\n60", "completion": " الناتج:\n```text\n[20, 32, 8]\n[20, 17]\n60\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -9 <= x <= 30)", "tests": ["assert filter_range([-14, 15, 39, 17, 11, -4, -16, -19, 27, 27]) == [-108, -108, -68, -60, -44, 16]", "assert filter_range([57, 40]) == []", "assert filter_range([18]) == [-72]", "assert filter_range([15, 23, -21]) == [-92, -60]", "assert filter_range([0, -10, 0, 54, 47]) == [0, 0]", "assert filter_range([30, -10, 57, 1, -26, -4, 60]) == [-120, -4, 16]", "assert filter_range([26, 29, 26, 30, 3, 9, 34, 13]) == [-120, -116, -104, -104, -52, -36, -12]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-14, 15, 39, 17, 11, -4, -16, -19, 27, 27]) == [-108, -108, -68, -60, -44, 16]\nassert filter_range([57, 40]) == []\nassert filter_range([18]) == [-72]\nassert filter_range([15, 23, -21]) == [-92, -60]\nassert filter_range([0, -10, 0, 54, 47]) == [0, 0]\nassert filter_range([30, -10, 57, 1, -26, -4, 60]) == [-120, -4, 16]\nassert filter_range([26, 29, 26, 30, 3, 9, 34, 13]) == [-120, -116, -104, -104, -52, -36, -12]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -9 <= x <= 30)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -4 for x in xs if -9 <= x <= 30)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و30 (شاملًا الطرفين) في -4.\nمثال: `filter_range([-14, 15, 39, 17, 11, -4, -16, -19, 27, 27])` يجب أن تُرجع `[-108, -108, -68, -60, -44, 16]`.\nالجواب:", "qhash": "ded0e45631dd42e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'ج' in w)", "tests": ["assert letter_count('تفاحة سيارة حصان طالب قمر نهار عربية') == 0", "assert letter_count('مدرسة مطر سماء عربية') == 0", "assert letter_count('فجر برتقال مطر نهار') == 1", "assert letter_count('سماء جمل ليل لغة تفاحة علم نهار') == 1", "assert letter_count('تفاحة صديق حاسوب لغة فجر') == 1", "assert letter_count('جمل قلم سلام شمس فجر معلم') == 2", "assert letter_count('باب حاسوب نهر لغة') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('تفاحة سيارة حصان طالب قمر نهار عربية') == 0\nassert letter_count('مدرسة مطر سماء عربية') == 0\nassert letter_count('فجر برتقال مطر نهار') == 1\nassert letter_count('سماء جمل ليل لغة تفاحة علم نهار') == 1\nassert letter_count('تفاحة صديق حاسوب لغة فجر') == 1\nassert letter_count('جمل قلم سلام شمس فجر معلم') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ج» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('تفاحة سيارة حصان طالب قمر نهار عربية')` يُرجع `0`.\nالجواب:", "qhash": "3e14d147e1fe1971"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -2 for x in xs if 17 <= x <= 26)", "tests": ["assert pick_between([21, 20, 19, 15, 19, 20, 12, 23, 9]) == [-46, -42, -40, -40, -38, -38]", "assert pick_between([]) == []", "assert pick_between([57]) == []", "assert pick_between([26, 60, 1, -13, -19, -23]) == [-52]", "assert pick_between([-15, -29, 38, -19]) == []", "assert pick_between([]) == []", "assert pick_between([39, 16, 44, -6]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([21, 20, 19, 15, 19, 20, 12, 23, 9]) == [-46, -42, -40, -40, -38, -38]\nassert pick_between([]) == []\nassert pick_between([57]) == []\nassert pick_between([26, 60, 1, -13, -19, -23]) == [-52]\nassert pick_between([-15, -29, 38, -19]) == []\nassert pick_between([]) == []\nassert pick_between([39, 16, 44, -6]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -2 for x in xs if 17 <= x <= 26)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -2 for x in xs if 17 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 17 ≤ x ≤ 26، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([21, 20, 19, 15, 19, 20, 12, 23, 9])` يُرجع `[-46, -42, -40, -40, -38, -38]`.\nالجواب:", "qhash": "0cb457b8ff72e189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([34, 27, 41, 42, 9]) == [34, 61, 0, 42, 51]", "assert reset_sum([40, -9]) == [40, 31]", "assert reset_sum([80, 17]) == [80, 0]", "assert reset_sum([5, 80, 38, 42, 58, 79]) == [5, 85, 0, 42, 0, 79]", "assert reset_sum([73, 45, 35, 77, 77, 25, -4, 57, 61, 26]) == [73, 0, 35, 0, 77, 0, -4, 53, 0, 26]", "assert reset_sum([]) == []", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([34, 27, 41, 42, 9]) == [34, 61, 0, 42, 51]\nassert reset_sum([40, -9]) == [40, 31]\nassert reset_sum([80, 17]) == [80, 0]\nassert reset_sum([5, 80, 38, 42, 58, 79]) == [5, 85, 0, 42, 0, 79]\nassert reset_sum([73, 45, 35, 77, 77, 25, -4, 57, 61, 26]) == [73, 0, 35, 0, 77, 0, -4, 53, 0, 26]\nassert reset_sum([]) == []\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\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 > 85:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 85 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([34, 27, 41, 42, 9])` يُرجع `[34, 61, 0, 42, 51]`.\nالجواب:", "qhash": "7c9fc386cf6d7a7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'نور': 49, 'منى': 1, 'باسل': 3}\nmarks['منى'] += 9\nmarks['هشام'] = 3\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 = {'نور': 49, 'منى': 1, 'باسل': 3}\nmarks['منى'] += 9\nmarks['هشام'] = 3\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": "cb3990b2614118ec", "answer": "4\nنور\n65\n[('باسل', 3), ('هشام', 3)]", "completion": " الناتج:\n```text\n4\nنور\n65\n[('باسل', 3), ('هشام', 3)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return -8 * x ** 2 + (1) * x + (-6)", "tests": ["assert poly(10) == -796", "assert poly(11) == -963", "assert poly(-1) == -15", "assert poly(9) == -645", "assert poly(16) == -2038", "assert poly(-17) == -2335", "assert poly(-10) == -816", "assert poly(0) == -6"], "test_code": "assert poly(10) == -796\nassert poly(11) == -963\nassert poly(-1) == -15\nassert poly(9) == -645\nassert poly(16) == -2038\nassert poly(-17) == -2335\nassert poly(-10) == -816\nassert poly(0) == -6", "answer": "def poly(x):\n return -8 * x ** 2 + (1) * x + (-6)", "completion": " ```python\ndef poly(x):\n return -8 * x ** 2 + (1) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار -8x² + 1x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(10)` يُرجع `-796`.\nالجواب:", "qhash": "8c6a01eda1ca4f3f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('summer apple orange desert winter stone at code') == 'stone winter desert orange apple summer'", "assert rev_long_words('up by a desert a camel') == 'camel desert'", "assert rev_long_words('light summer summer garden') == 'garden summer summer light'", "assert rev_long_words('rocket window') == 'window rocket'", "assert rev_long_words('summer on it') == 'summer'", "assert rev_long_words('at an a') == ''", "assert rev_long_words('it brain stone is pixel go rocket') == 'rocket pixel stone brain'"], "test_code": "assert rev_long_words('summer apple orange desert winter stone at code') == 'stone winter desert orange apple summer'\nassert rev_long_words('up by a desert a camel') == 'camel desert'\nassert rev_long_words('light summer summer garden') == 'garden summer summer light'\nassert rev_long_words('rocket window') == 'window rocket'\nassert rev_long_words('summer on it') == 'summer'\nassert rev_long_words('at an a') == ''\nassert rev_long_words('it brain stone is pixel go rocket') == 'rocket pixel stone 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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_long_words('summer apple orange desert winter stone at code')` يُرجع `'stone winter desert orange apple summer'`.\nالجواب:", "qhash": "60a685508a33ae59"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('by planet river of coffee engine in') == 'in/engine/coffee/of/river/planet/by'", "assert backwards('at on winter brain') == 'brain/winter/on/at'", "assert backwards('river banana') == 'banana/river'", "assert backwards('') == ''", "assert backwards('an orange river data cloud up engine') == 'engine/up/cloud/data/river/orange/an'", "assert backwards('matrix winter we camel desert') == 'desert/camel/we/winter/matrix'", "assert backwards('banana brain') == 'brain/banana'"], "test_code": "assert backwards('by planet river of coffee engine in') == 'in/engine/coffee/of/river/planet/by'\nassert backwards('at on winter brain') == 'brain/winter/on/at'\nassert backwards('river banana') == 'banana/river'\nassert backwards('') == ''\nassert backwards('an orange river data cloud up engine') == 'engine/up/cloud/data/river/orange/an'\nassert backwards('matrix winter we camel desert') == 'desert/camel/we/winter/matrix'\nassert backwards('banana brain') == 'brain/banana'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('by planet river of coffee engine in')` يُرجع `'in/engine/coffee/of/river/planet/by'`.\nالجواب:", "qhash": "b4125f4d51717605"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'عمر': 7, 'سلمى': 15, 'يوسف': 2}\nd['عمر'] += 7\nd['هشام'] = 52\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, 'سلمى': 15, 'يوسف': 2}\nd['عمر'] += 7\nd['هشام'] = 52\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": "88c9e0a1b8742426", "answer": "4\nهشام\n83\n[('يوسف', 2), ('عمر', 14)]", "completion": " الناتج:\n```text\n4\nهشام\n83\n[('يوسف', 2), ('عمر', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 19:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([8, 14, 5, 14, 2, 5, 2, 6, 9]) == [8, 0, 5, 19, 0, 5, 7, 13, 0]", "assert rolling_total([9, 2, 8, -5, 8, 15, -8, 18]) == [9, 11, 19, 14, 0, 15, 7, 0]", "assert rolling_total([18, 9, -3, 6, -5, 10, 17]) == [18, 0, -3, 3, -2, 8, 0]", "assert rolling_total([14, -4, -8, 10, -5, -6, -2, 9, 14, -1]) == [14, 10, 2, 12, 7, 1, -1, 8, 0, -1]", "assert rolling_total([6, 4]) == [6, 10]", "assert rolling_total([10, 1, 4, -5]) == [10, 11, 15, 10]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([8, 14, 5, 14, 2, 5, 2, 6, 9]) == [8, 0, 5, 19, 0, 5, 7, 13, 0]\nassert rolling_total([9, 2, 8, -5, 8, 15, -8, 18]) == [9, 11, 19, 14, 0, 15, 7, 0]\nassert rolling_total([18, 9, -3, 6, -5, 10, 17]) == [18, 0, -3, 3, -2, 8, 0]\nassert rolling_total([14, -4, -8, 10, -5, -6, -2, 9, 14, -1]) == [14, 10, 2, 12, 7, 1, -1, 8, 0, -1]\nassert rolling_total([6, 4]) == [6, 10]\nassert rolling_total([10, 1, 4, -5]) == [10, 11, 15, 10]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 19:\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 > 19:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 19 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([8, 14, 5, 14, 2, 5, 2, 6, 9])` يُرجع `[8, 0, 5, 19, 0, 5, 7, 13, 0]`.\nالجواب:", "qhash": "0571a903326248e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 19", "tests": ["assert step_product(11) == 6", "assert step_product(52) == 0", "assert step_product(22) == 0", "assert step_product(9) == 10", "assert step_product(59) == 0", "assert step_product(60) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 6\nassert step_product(52) == 0\nassert step_product(22) == 0\nassert step_product(9) == 10\nassert step_product(59) == 0\nassert step_product(60) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 19", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(11)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "1c15ad310de7cf12"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'دفتر سيارة'\nprint(len(s.replace(' ', '')))\nprint(s[0])\nprint(s.find('ف'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'دفتر سيارة'\nprint(len(s.replace(' ', '')))\nprint(s[0])\nprint(s.find('ف'))\n```\nالجواب:", "qhash": "c444daf1203b7961", "answer": "9\nد\n1", "completion": " الناتج:\n```text\n9\nد\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 27", "tests": ["assert sum_digit_pow(61981) == 25", "assert sum_digit_pow(606587) == 5", "assert sum_digit_pow(30309) == 15", "assert sum_digit_pow(556368) == 6", "assert sum_digit_pow(497884) == 13", "assert sum_digit_pow(171395) == 26", "assert sum_digit_pow(873603) == 0", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(61981) == 25\nassert sum_digit_pow(606587) == 5\nassert sum_digit_pow(30309) == 15\nassert sum_digit_pow(556368) == 6\nassert sum_digit_pow(497884) == 13\nassert sum_digit_pow(171395) == 26\nassert sum_digit_pow(873603) == 0\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 27", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 27\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 27.\nللتوضيح: الاستدعاء `sum_digit_pow(61981)` يُرجع `25`.\nالجواب:", "qhash": "2e99bccb9076cfeb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -5 * x ** 2 + (5) * x + (-7)", "tests": ["assert eval_poly(4) == -67", "assert eval_poly(-11) == -667", "assert eval_poly(-5) == -157", "assert eval_poly(11) == -557", "assert eval_poly(-17) == -1537", "assert eval_poly(-6) == -217", "assert eval_poly(-13) == -917", "assert eval_poly(0) == -7"], "test_code": "assert eval_poly(4) == -67\nassert eval_poly(-11) == -667\nassert eval_poly(-5) == -157\nassert eval_poly(11) == -557\nassert eval_poly(-17) == -1537\nassert eval_poly(-6) == -217\nassert eval_poly(-13) == -917\nassert eval_poly(0) == -7", "answer": "def eval_poly(x):\n return -5 * x ** 2 + (5) * x + (-7)", "completion": " ```python\ndef eval_poly(x):\n return -5 * x ** 2 + (5) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -5x² + 5x - 7 عند العدد الصحيح x.\nمثال: `eval_poly(4)` يجب أن تُرجع `-67`.\nالجواب:", "qhash": "df1b27c044d17328"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(-2, 8))", "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, 8))\n```\nالجواب:", "qhash": "be23444e1cecabda", "answer": "256", "completion": " الناتج:\n```text\n256\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert series(5) == 2475", "assert series(1) == 11", "assert series(3) == 396", "assert series(11) == 47916", "assert series(9) == 22275", "assert series(1) == 11", "assert series(0) == 0"], "test_code": "assert series(5) == 2475\nassert series(1) == 11\nassert series(3) == 396\nassert series(11) == 47916\nassert series(9) == 22275\nassert series(1) == 11\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total\n```\nمثال: `series(5)` يجب أن تُرجع `2475`.\nالجواب:", "qhash": "feac80f6534f6b5f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=5):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(11))\nprint(g(11, 18))\nprint(g(g(18), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=5):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(11))\nprint(g(11, 18))\nprint(g(g(18), 11))\n```\nالجواب:", "qhash": "efed82af18539f52", "answer": "-60\n-79\n-150", "completion": " الناتج:\n```text\n-60\n-79\n-150\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(16) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16']", "assert label_numbers(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'Ping', '19']", "assert label_numbers(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong']", "assert label_numbers(16) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16']", "assert label_numbers(7) == ['1', '2', 'Ping', '4', '5', 'Ping', '7']"], "test_code": "assert label_numbers(16) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16']\nassert label_numbers(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'Ping', '19']\nassert label_numbers(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong']\nassert label_numbers(16) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16']\nassert label_numbers(7) == ['1', '2', 'Ping', '4', '5', 'Ping', '7']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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 % 3 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Ping'، وعلى 10 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(16)` يجب أن تُرجع `['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'Ping', '16']`.\nالجواب:", "qhash": "92bf4d732bd4bd69"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 45) == 1)", "tests": ["assert count_coprime(130) == 69", "assert count_coprime(15) == 8", "assert count_coprime(148) == 79", "assert count_coprime(116) == 62", "assert count_coprime(129) == 69", "assert count_coprime(90) == 48", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(130) == 69\nassert count_coprime(15) == 8\nassert count_coprime(148) == 79\nassert count_coprime(116) == 62\nassert count_coprime(129) == 69\nassert count_coprime(90) == 48\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, 45) == 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, 45) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 45، أي أن القاسم المشترك الأكبر لها مع 45 يساوي 1.\nمثال: `count_coprime(130)` يجب أن تُرجع `69`.\nالجواب:", "qhash": "29b46b13655beb78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(6) == ['1', '2', 'Foo', '4', '5', 'FooBar']", "assert fizzbuzz(11) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10', '11']", "assert fizzbuzz(2) == ['1', '2']", "assert fizzbuzz(10) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10']", "assert fizzbuzz(17) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10', '11', 'FooBar', '13', '14', 'Foo', '16', '17']"], "test_code": "assert fizzbuzz(6) == ['1', '2', 'Foo', '4', '5', 'FooBar']\nassert fizzbuzz(11) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10', '11']\nassert fizzbuzz(2) == ['1', '2']\nassert fizzbuzz(10) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10']\nassert fizzbuzz(17) == ['1', '2', 'Foo', '4', '5', 'FooBar', '7', '8', 'Foo', '10', '11', 'FooBar', '13', '14', 'Foo', '16', '17']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 6 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Foo'، وإن قَبِلها على 6 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(6)` يُرجع `['1', '2', 'Foo', '4', '5', 'FooBar']`.\nالجواب:", "qhash": "b6709b5ea5043e98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'adg'}", "tests": ["assert count_chars('window pixel of winter') == {'a': 0, 'd': 1, 'g': 0}", "assert count_chars('table it summer code table') == {'a': 2, 'd': 1, 'g': 0}", "assert count_chars('pixel') == {'a': 0, 'd': 0, 'g': 0}", "assert count_chars('engine') == {'a': 0, 'd': 0, 'g': 1}", "assert count_chars('of to light') == {'a': 0, 'd': 0, 'g': 1}", "assert count_chars('engine music stone brain by') == {'a': 1, 'd': 0, 'g': 1}", "assert count_chars('') == {'a': 0, 'd': 0, 'g': 0}"], "test_code": "assert count_chars('window pixel of winter') == {'a': 0, 'd': 1, 'g': 0}\nassert count_chars('table it summer code table') == {'a': 2, 'd': 1, 'g': 0}\nassert count_chars('pixel') == {'a': 0, 'd': 0, 'g': 0}\nassert count_chars('engine') == {'a': 0, 'd': 0, 'g': 1}\nassert count_chars('of to light') == {'a': 0, 'd': 0, 'g': 1}\nassert count_chars('engine music stone brain by') == {'a': 1, 'd': 0, 'g': 1}\nassert count_chars('') == {'a': 0, 'd': 0, 'g': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'adg'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'adg'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'd'، 'g' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('window pixel of winter')` يجب أن تُرجع `{'a': 0, 'd': 1, 'g': 0}`.\nالجواب:", "qhash": "37e51cd07be5e1a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'agru'}", "tests": ["assert char_freq('on') == {'a': 0, 'g': 0, 'r': 0, 'u': 0}", "assert char_freq('to garden at') == {'a': 2, 'g': 1, 'r': 1, 'u': 0}", "assert char_freq('a matrix it') == {'a': 2, 'g': 0, 'r': 1, 'u': 0}", "assert char_freq('river python desert data') == {'a': 2, 'g': 0, 'r': 3, 'u': 0}", "assert char_freq('stone on signal') == {'a': 1, 'g': 1, 'r': 0, 'u': 0}", "assert char_freq('falcon signal of summer') == {'a': 2, 'g': 1, 'r': 1, 'u': 1}", "assert char_freq('') == {'a': 0, 'g': 0, 'r': 0, 'u': 0}"], "test_code": "assert char_freq('on') == {'a': 0, 'g': 0, 'r': 0, 'u': 0}\nassert char_freq('to garden at') == {'a': 2, 'g': 1, 'r': 1, 'u': 0}\nassert char_freq('a matrix it') == {'a': 2, 'g': 0, 'r': 1, 'u': 0}\nassert char_freq('river python desert data') == {'a': 2, 'g': 0, 'r': 3, 'u': 0}\nassert char_freq('stone on signal') == {'a': 1, 'g': 1, 'r': 0, 'u': 0}\nassert char_freq('falcon signal of summer') == {'a': 2, 'g': 1, 'r': 1, 'u': 1}\nassert char_freq('') == {'a': 0, 'g': 0, 'r': 0, 'u': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'agru'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'agru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'g'، 'r'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('on')` يجب أن تُرجع `{'a': 0, 'g': 0, 'r': 0, 'u': 0}`.\nالجواب:", "qhash": "4215fc5c56c588ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'شمس علم'\nprint(w.replace(' ', '-'))\nprint(w.split())\nprint(w[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'شمس علم'\nprint(w.replace(' ', '-'))\nprint(w.split())\nprint(w[::-1])\n```\nالجواب:", "qhash": "35603eedd107ffd6", "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_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 84", "tests": ["assert sum_digit_pow(72668) == 33", "assert sum_digit_pow(24910) == 30", "assert sum_digit_pow(961903) == 52", "assert sum_digit_pow(780482) == 29", "assert sum_digit_pow(847060) == 69", "assert sum_digit_pow(696299) == 31", "assert sum_digit_pow(637641) == 39", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(72668) == 33\nassert sum_digit_pow(24910) == 30\nassert sum_digit_pow(961903) == 52\nassert sum_digit_pow(780482) == 29\nassert sum_digit_pow(847060) == 69\nassert sum_digit_pow(696299) == 31\nassert sum_digit_pow(637641) == 39\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 84", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 84\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 84.\nللتوضيح: الاستدعاء `sum_digit_pow(72668)` يُرجع `33`.\nالجواب:", "qhash": "78595884de0496e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(21) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']", "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9']", "assert fizzbuzz(22) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22']"], "test_code": "assert fizzbuzz(21) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']\nassert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9']\nassert fizzbuzz(22) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\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 % 6 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Tic'، وإن قَبِلها على 7 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(21)` يُرجع `['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac']`.\nالجواب:", "qhash": "15fb530b2dc1360e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(9))\n```\nالجواب:", "qhash": "960c61deea7caf05", "answer": "89", "completion": " الناتج:\n```text\n89\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 17\nfor x in range(0, 21, 1):\n acc -= x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 17\nfor x in range(0, 21, 1):\n acc -= x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "5d377cd4aaba71fa", "answer": "-1663\n20", "completion": " الناتج:\n```text\n-1663\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 11)", "tests": ["assert in_range_scaled([20, 9, 2, 21, -8, 9, 0, 5]) == [-18, -18, -10, -4]", "assert in_range_scaled([59, 0, -17]) == []", "assert in_range_scaled([-23, 41, 39, 22, 25, -1, 18, 22, 58]) == []", "assert in_range_scaled([55, 55, -29, 18, -18, 44, -5, 20, -1, -1]) == []", "assert in_range_scaled([-12, 47, -20, 20, -21]) == []", "assert in_range_scaled([14, 35, 45]) == []", "assert in_range_scaled([52, 26, 12, 18, -7, 58, 28, 3]) == [-6]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([20, 9, 2, 21, -8, 9, 0, 5]) == [-18, -18, -10, -4]\nassert in_range_scaled([59, 0, -17]) == []\nassert in_range_scaled([-23, 41, 39, 22, 25, -1, 18, 22, 58]) == []\nassert in_range_scaled([55, 55, -29, 18, -18, 44, -5, 20, -1, -1]) == []\nassert in_range_scaled([-12, 47, -20, 20, -21]) == []\nassert in_range_scaled([14, 35, 45]) == []\nassert in_range_scaled([52, 26, 12, 18, -7, 58, 28, 3]) == [-6]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 11)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 2 ≤ x ≤ 11، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([20, 9, 2, 21, -8, 9, 0, 5])` يُرجع `[-18, -18, -10, -4]`.\nالجواب:", "qhash": "5acfcfd96e3103cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 10 for x in range(0, 5) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 10 for x in range(0, 5) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "1e8f1d5a4e3ecf4c", "answer": "[-9, 6]\n2 -3", "completion": " الناتج:\n```text\n[-9, 6]\n2 -3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert turn_list([28, 17, 33, 41, 21]) == [21, 28, 17, 33, 41]", "assert turn_list([8, 3, 21, -6, 43]) == [43, 8, 3, 21, -6]", "assert turn_list([10, -8, 22, -5, 49, 8, 34, 42, 6]) == [6, 10, -8, 22, -5, 49, 8, 34, 42]", "assert turn_list([-1, -6, 21]) == [21, -1, -6]", "assert turn_list([38, 13, -3, 34, 8, 27, -7, 27, 22, 6]) == [6, 38, 13, -3, 34, 8, 27, -7, 27, 22]", "assert turn_list([45, 33, 0, 47, 40, 22]) == [22, 45, 33, 0, 47, 40]", "assert turn_list([]) == []"], "test_code": "assert turn_list([28, 17, 33, 41, 21]) == [21, 28, 17, 33, 41]\nassert turn_list([8, 3, 21, -6, 43]) == [43, 8, 3, 21, -6]\nassert turn_list([10, -8, 22, -5, 49, 8, 34, 42, 6]) == [6, 10, -8, 22, -5, 49, 8, 34, 42]\nassert turn_list([-1, -6, 21]) == [21, -1, -6]\nassert turn_list([38, 13, -3, 34, 8, 27, -7, 27, 22, 6]) == [6, 38, 13, -3, 34, 8, 27, -7, 27, 22]\nassert turn_list([45, 33, 0, 47, 40, 22]) == [22, 45, 33, 0, 47, 40]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return ____\n```\nمثال: `turn_list([28, 17, 33, 41, 21])` يجب أن تُرجع `[21, 28, 17, 33, 41]`.\nالجواب:", "qhash": "a417a34a50984786"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('of banana code an banana pixel') == 'pixel-banana-an-code-banana-of'", "assert rev_long_words('engine we python pixel matrix apple a') == 'a-apple-matrix-pixel-python-we-engine'", "assert rev_long_words('table') == 'table'", "assert rev_long_words('it a') == 'a-it'", "assert rev_long_words('desert code rocket') == 'rocket-code-desert'", "assert rev_long_words('code matrix matrix winter coffee up') == 'up-coffee-winter-matrix-matrix-code'", "assert rev_long_words('') == ''"], "test_code": "assert rev_long_words('of banana code an banana pixel') == 'pixel-banana-an-code-banana-of'\nassert rev_long_words('engine we python pixel matrix apple a') == 'a-apple-matrix-pixel-python-we-engine'\nassert rev_long_words('table') == 'table'\nassert rev_long_words('it a') == 'a-it'\nassert rev_long_words('desert code rocket') == 'rocket-code-desert'\nassert rev_long_words('code matrix matrix winter coffee up') == 'up-coffee-winter-matrix-matrix-code'\nassert rev_long_words('') == ''", "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('of banana code an banana pixel')` يجب أن تُرجع `'pixel-banana-an-code-banana-of'`.\nالجواب:", "qhash": "64b1450ee452aec7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 29", "tests": ["assert pow_digits(10190) == 7", "assert pow_digits(691666) == 22", "assert pow_digits(609080) == 7", "assert pow_digits(162138) == 18", "assert pow_digits(202295) == 7", "assert pow_digits(566902) == 9", "assert pow_digits(972476) == 24", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(10190) == 7\nassert pow_digits(691666) == 22\nassert pow_digits(609080) == 7\nassert pow_digits(162138) == 18\nassert pow_digits(202295) == 7\nassert pow_digits(566902) == 9\nassert pow_digits(972476) == 24\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 29", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 29.\nمثال: `pow_digits(10190)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "2c6456bbd97c843d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * 2 + 4 for x in range(4, 14) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * 2 + 4 for x in range(4, 14) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "99b48169a05a6140", "answer": "[16, 24]\n2 40", "completion": " الناتج:\n```text\n[16, 24]\n2 40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "how_many", "reference": "def how_many(text):\n return text.count('ه')", "tests": ["assert how_many('قلم ميناء عربية قلم مكتبة ليل') == 0", "assert how_many('نهار صحراء قلم') == 1", "assert how_many('مطر بحر سوق ليل بيت برتقال مكتبة جمل') == 0", "assert how_many('خبز طائرة برتقال نهر عمل وردة شجرة') == 1", "assert how_many('قمر ليل حصان قهوة') == 1", "assert how_many('سيارة مكتبة شمس شجرة حاسوب عربية') == 0", "assert how_many('حصان قمر وردة مدينة') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('قلم ميناء عربية قلم مكتبة ليل') == 0\nassert how_many('نهار صحراء قلم') == 1\nassert how_many('مطر بحر سوق ليل بيت برتقال مكتبة جمل') == 0\nassert how_many('خبز طائرة برتقال نهر عمل وردة شجرة') == 1\nassert how_many('قمر ليل حصان قهوة') == 1\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('قلم ميناء عربية قلم مكتبة ليل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "cc4b534426713351"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'light_window'\nprint(word[::-1])\nprint(word[2:7])\nprint(word.index('g') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'light_window'\nprint(word[::-1])\nprint(word[2:7])\nprint(word.index('g') + len(word))\n```\nالجواب:", "qhash": "c928dfa45ef3356e", "answer": "wodniw_thgil\nght_w\n14", "completion": " الناتج:\n```text\nwodniw_thgil\nght_w\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 32)", "tests": ["assert select_range([10, 32, 16, 28]) == [-128, -112, -64, -40]", "assert select_range([35, 53, 22, -23, 24, -5, -15, -24, 45, -13]) == [-96, -88]", "assert select_range([-6, 24, 51, 31, 33, 5]) == [-124, -96]", "assert select_range([]) == []", "assert select_range([49, -21, 55]) == []", "assert select_range([32, 48, 19, 21, 55, 17, 58, -13]) == [-128, -84, -76, -68]", "assert select_range([-6, 24]) == [-96]", "assert select_range([]) == []"], "test_code": "assert select_range([10, 32, 16, 28]) == [-128, -112, -64, -40]\nassert select_range([35, 53, 22, -23, 24, -5, -15, -24, 45, -13]) == [-96, -88]\nassert select_range([-6, 24, 51, 31, 33, 5]) == [-124, -96]\nassert select_range([]) == []\nassert select_range([49, -21, 55]) == []\nassert select_range([32, 48, 19, 21, 55, 17, 58, -13]) == [-128, -84, -76, -68]\nassert select_range([-6, 24]) == [-96]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 32)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if 6 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 6 و32 (شاملًا الطرفين) في -4.\nمثال: `select_range([10, 32, 16, 28])` يجب أن تُرجع `[-128, -112, -64, -40]`.\nالجواب:", "qhash": "21d90a3ed60011f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'summer'\nprint(name.count('m'))\nprint(name[-2:])\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'summer'\nprint(name.count('m'))\nprint(name[-2:])\nprint(name.split('_'))\n```\nالجواب:", "qhash": "ba23c03f126574fe", "answer": "2\ner\n['summer']", "completion": " الناتج:\n```text\n2\ner\n['summer']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 8", "tests": ["assert digits_mod(14174) == 1", "assert digits_mod(572143) == 0", "assert digits_mod(183965) == 2", "assert digits_mod(533158) == 1", "assert digits_mod(645501) == 3", "assert digits_mod(364874) == 2", "assert digits_mod(820616) == 1", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(14174) == 1\nassert digits_mod(572143) == 0\nassert digits_mod(183965) == 2\nassert digits_mod(533158) == 1\nassert digits_mod(645501) == 3\nassert digits_mod(364874) == 2\nassert digits_mod(820616) == 1\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 8", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 8\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 8.\nللتوضيح: الاستدعاء `digits_mod(14174)` يُرجع `1`.\nالجواب:", "qhash": "87954b3b600a03e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 5\nfor x in range(2, 26, 1):\n total -= x * 4\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 5\nfor x in range(2, 26, 1):\n total -= x * 4\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "22510288c753d1bd", "answer": "-1291\n25", "completion": " الناتج:\n```text\n-1291\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 169:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([42, 76, 42, 29, 6, 83, 9, 37, 88]) == [42, 118, 160, 0, 6, 89, 98, 135, 0]", "assert cumulative([110]) == [110]", "assert cumulative([105, 42, 164, 92]) == [105, 147, 0, 92]", "assert cumulative([38, 162, 120, 118, 45, 2, 17, -9, 104, 57]) == [38, 0, 120, 0, 45, 47, 64, 55, 159, 0]", "assert cumulative([]) == []", "assert cumulative([165, 14, 31, 102, 147, 2]) == [165, 0, 31, 133, 0, 2]", "assert cumulative([]) == []"], "test_code": "assert cumulative([42, 76, 42, 29, 6, 83, 9, 37, 88]) == [42, 118, 160, 0, 6, 89, 98, 135, 0]\nassert cumulative([110]) == [110]\nassert cumulative([105, 42, 164, 92]) == [105, 147, 0, 92]\nassert cumulative([38, 162, 120, 118, 45, 2, 17, -9, 104, 57]) == [38, 0, 120, 0, 45, 47, 64, 55, 159, 0]\nassert cumulative([]) == []\nassert cumulative([165, 14, 31, 102, 147, 2]) == [165, 0, 31, 133, 0, 2]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 169:\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 > 169:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 169 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([42, 76, 42, 29, 6, 83, 9, 37, 88])` يجب أن تُرجع `[42, 118, 160, 0, 6, 89, 98, 135, 0]`.\nالجواب:", "qhash": "2349f8db537a1612"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'rocket'\nprint(text.capitalize())\nprint(text[-1:])\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'rocket'\nprint(text.capitalize())\nprint(text[-1:])\nprint(len(text))\n```\nالجواب:", "qhash": "af159f726ca9bd42", "answer": "Rocket\nt\n6", "completion": " الناتج:\n```text\nRocket\nt\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n <= 3:\n return 3\n return 3 * calc(n - 1) + -1\n\nprint(calc(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n <= 3:\n return 3\n return 3 * calc(n - 1) + -1\n\nprint(calc(12))\n```\nالجواب:", "qhash": "8b350bfaae35119a", "answer": "49208", "completion": " الناتج:\n```text\n49208\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('river matrix go') == 'go/matrix/river'", "assert backwards('python falcon of up of') == 'of/up/of/falcon/python'", "assert backwards('to orange brain go desert winter light') == 'light/winter/desert/go/brain/orange/to'", "assert backwards('river brain') == 'brain/river'", "assert backwards('desert music engine falcon camel table brain engine') == 'engine/brain/table/camel/falcon/engine/music/desert'", "assert backwards('is') == 'is'", "assert backwards('music an') == 'an/music'"], "test_code": "assert backwards('river matrix go') == 'go/matrix/river'\nassert backwards('python falcon of up of') == 'of/up/of/falcon/python'\nassert backwards('to orange brain go desert winter light') == 'light/winter/desert/go/brain/orange/to'\nassert backwards('river brain') == 'brain/river'\nassert backwards('desert music engine falcon camel table brain engine') == 'engine/brain/table/camel/falcon/engine/music/desert'\nassert backwards('is') == 'is'\nassert backwards('music an') == 'an/music'", "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('river matrix go')` يجب أن تُرجع `'go/matrix/river'`.\nالجواب:", "qhash": "115ac19904da15a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'ليلى': 6, 'منى': 24, 'زينب': 22, 'يوسف': 4, 'مريم': 23}\nd['منى'] += 7\nd['هشام'] = 24\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 = {'ليلى': 6, 'منى': 24, 'زينب': 22, 'يوسف': 4, 'مريم': 23}\nd['منى'] += 7\nd['هشام'] = 24\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": "fcabbf6d19c48d8a", "answer": "6\nمنى\n110\n[('يوسف', 4), ('ليلى', 6)]", "completion": " الناتج:\n```text\n6\nمنى\n110\n[('يوسف', 4), ('ليلى', 6)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'زينب': 20, 'وليد': 35, 'حسن': 7}\nmarks['زينب'] += 16\nmarks['هدى'] = 31\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 17])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'زينب': 20, 'وليد': 35, 'حسن': 7}\nmarks['زينب'] += 16\nmarks['هدى'] = 31\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 17])\n```\nالجواب:", "qhash": "97379374cd7427ac", "answer": "4\nزينب\n109\n['زينب', 'وليد', 'هدى']", "completion": " الناتج:\n```text\n4\nزينب\n109\n['زينب', 'وليد', 'هدى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "tests": ["assert pow_total(8) == 408", "assert pow_total(2) == 10", "assert pow_total(13) == 1638", "assert pow_total(8) == 408", "assert pow_total(14) == 2030", "assert pow_total(1) == 2", "assert pow_total(0) == 0"], "test_code": "assert pow_total(8) == 408\nassert pow_total(2) == 10\nassert pow_total(13) == 1638\nassert pow_total(8) == 408\nassert pow_total(14) == 2030\nassert pow_total(1) == 2\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `pow_total(8)` يُرجع `408`.\nالجواب:", "qhash": "915d7c49aa658c43"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(-10))\nprint(compute(-10, 8))\nprint(compute(compute(8), -10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(-10))\nprint(compute(-10, 8))\nprint(compute(compute(8), -10))\n```\nالجواب:", "qhash": "1c9efd845613911e", "answer": "26\n22\n186", "completion": " الناتج:\n```text\n26\n22\n186\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'matrix'\nprint(s.find('r'))\nprint(s.capitalize())\nprint(s.replace('r', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'matrix'\nprint(s.find('r'))\nprint(s.capitalize())\nprint(s.replace('r', '#'))\n```\nالجواب:", "qhash": "be99e65142fcfa02", "answer": "3\nMatrix\nmat#ix", "completion": " الناتج:\n```text\n3\nMatrix\nmat#ix\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 3:\n return 3\n return 3 * calc(n - 1) + 2\n\nprint(calc(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 3:\n return 3\n return 3 * calc(n - 1) + 2\n\nprint(calc(6))\n```\nالجواب:", "qhash": "ded58a08c60a912e", "answer": "107", "completion": " الناتج:\n```text\n107\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bci'}", "tests": ["assert letter_stats('data music window of on stone') == {'b': 0, 'c': 1, 'i': 2}", "assert letter_stats('coffee up') == {'b': 0, 'c': 1, 'i': 0}", "assert letter_stats('orange banana') == {'b': 1, 'c': 0, 'i': 0}", "assert letter_stats('engine camel summer desert cloud') == {'b': 0, 'c': 2, 'i': 1}", "assert letter_stats('garden orange engine') == {'b': 0, 'c': 0, 'i': 1}", "assert letter_stats('python') == {'b': 0, 'c': 0, 'i': 0}", "assert letter_stats('') == {'b': 0, 'c': 0, 'i': 0}"], "test_code": "assert letter_stats('data music window of on stone') == {'b': 0, 'c': 1, 'i': 2}\nassert letter_stats('coffee up') == {'b': 0, 'c': 1, 'i': 0}\nassert letter_stats('orange banana') == {'b': 1, 'c': 0, 'i': 0}\nassert letter_stats('engine camel summer desert cloud') == {'b': 0, 'c': 2, 'i': 1}\nassert letter_stats('garden orange engine') == {'b': 0, 'c': 0, 'i': 1}\nassert letter_stats('python') == {'b': 0, 'c': 0, 'i': 0}\nassert letter_stats('') == {'b': 0, 'c': 0, 'i': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bci'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bci'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'c'، 'i' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('data music window of on stone')` يجب أن تُرجع `{'b': 0, 'c': 1, 'i': 2}`.\nالجواب:", "qhash": "ee0caacdefe186ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 131:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([4, 26, 58, 50, 22, 58, 18]) == [4, 30, 88, 0, 22, 80, 98]", "assert acc_reset([65, 33, 13, -2, 8, 68, 20, 124, 17]) == [65, 98, 111, 109, 117, 0, 20, 0, 17]", "assert acc_reset([]) == []", "assert acc_reset([84, 61, 53, 14, 115, 32, 116, 104]) == [84, 0, 53, 67, 0, 32, 0, 104]", "assert acc_reset([28, 125, 107]) == [28, 0, 107]", "assert acc_reset([113, 99]) == [113, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([4, 26, 58, 50, 22, 58, 18]) == [4, 30, 88, 0, 22, 80, 98]\nassert acc_reset([65, 33, 13, -2, 8, 68, 20, 124, 17]) == [65, 98, 111, 109, 117, 0, 20, 0, 17]\nassert acc_reset([]) == []\nassert acc_reset([84, 61, 53, 14, 115, 32, 116, 104]) == [84, 0, 53, 67, 0, 32, 0, 104]\nassert acc_reset([28, 125, 107]) == [28, 0, 107]\nassert acc_reset([113, 99]) == [113, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 131:\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 > 131:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 131 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([4, 26, 58, 50, 22, 58, 18])` يجب أن تُرجع `[4, 30, 88, 0, 22, 80, 98]`.\nالجواب:", "qhash": "fb30a3c83662843b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['data', 'stone', 'engine', 'garden', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['data', 'stone', 'engine', 'garden', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "a94c5844936fc623", "answer": "['data', 'stone', 'engine', 'garden', 'signal']\n['signal', 'garden', 'engine']", "completion": " الناتج:\n```text\n['data', 'stone', 'engine', 'garden', 'signal']\n['signal', 'garden', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(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_matching([65, 69, 12, 4, 79, 11, 10, 0, 51]) == 2", "assert count_matching([-39, 82, 11]) == 0", "assert count_matching([14, 73, 47, 6, 84, -36, 59, 44, 50]) == 1", "assert count_matching([6, -21, 78, 30, 90, 90]) == 3", "assert count_matching([43, 27]) == 0", "assert count_matching([21, -14, -15, 65, 73, 76, 42, 61]) == 2", "assert count_matching([]) == 0"], "test_code": "assert count_matching([65, 69, 12, 4, 79, 11, 10, 0, 51]) == 2\nassert count_matching([-39, 82, 11]) == 0\nassert count_matching([14, 73, 47, 6, 84, -36, 59, 44, 50]) == 1\nassert count_matching([6, -21, 78, 30, 90, 90]) == 3\nassert count_matching([43, 27]) == 0\nassert count_matching([21, -14, -15, 65, 73, 76, 42, 61]) == 2\nassert count_matching([]) == 0", "answer": "def count_matching(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_matching(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_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_matching([65, 69, 12, 4, 79, 11, 10, 0, 51])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "10ff994d955a8f5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([37, 2, 31, 29, 56, 12, 57]) == [37, 39, 70, 99, 0, 12, 69]", "assert capped_cumsum([64, 21, 82, 82, 41]) == [64, 85, 0, 82, 0]", "assert capped_cumsum([88, 76, 37, 57, 91, 63, 14, 37, 69, 32]) == [88, 0, 37, 94, 0, 63, 77, 114, 0, 32]", "assert capped_cumsum([92]) == [92]", "assert capped_cumsum([44, 94, 49, 79, -6, 48, -2]) == [44, 0, 49, 0, -6, 42, 40]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([37, 2, 31, 29, 56, 12, 57]) == [37, 39, 70, 99, 0, 12, 69]\nassert capped_cumsum([64, 21, 82, 82, 41]) == [64, 85, 0, 82, 0]\nassert capped_cumsum([88, 76, 37, 57, 91, 63, 14, 37, 69, 32]) == [88, 0, 37, 94, 0, 63, 77, 114, 0, 32]\nassert capped_cumsum([92]) == [92]\nassert capped_cumsum([44, 94, 49, 79, -6, 48, -2]) == [44, 0, 49, 0, -6, 42, 40]\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 > 115:\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 > 115:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 115 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([37, 2, 31, 29, 56, 12, 57])` يُرجع `[37, 39, 70, 99, 0, 12, 69]`.\nالجواب:", "qhash": "a07bd4f0c5b994e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 57937\ncount = 0\nwhile n > 5:\n n = n // 8\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 57937\ncount = 0\nwhile n > 5:\n n = n // 8\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "ca9440f567ce0554", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_matching([50, 73, 7, 80, 62, 47, 58, 11, 45, 21, 33]) == 2", "assert count_matching([73, 22, -15, 66, 40, 41, 54, 18, 10]) == 0", "assert count_matching([]) == 0", "assert count_matching([-26, 77, 50]) == 1", "assert count_matching([]) == 0", "assert count_matching([38, -20, -16, -28, 44, -23]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([50, 73, 7, 80, 62, 47, 58, 11, 45, 21, 33]) == 2\nassert count_matching([73, 22, -15, 66, 40, 41, 54, 18, 10]) == 0\nassert count_matching([]) == 0\nassert count_matching([-26, 77, 50]) == 1\nassert count_matching([]) == 0\nassert count_matching([38, -20, -16, -28, 44, -23]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 2، واكتب الدالة بعد إكمالها.\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([50, 73, 7, 80, 62, 47, 58, 11, 45, 21, 33])` يُرجع `2`.\nالجواب:", "qhash": "c86a15f887b9e6af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 0:\n return 3\n return 1 * rec(n - 1) + -1\n\nprint(rec(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 0:\n return 3\n return 1 * rec(n - 1) + -1\n\nprint(rec(8))\n```\nالجواب:", "qhash": "dc2b93a27e509706", "answer": "-5", "completion": " الناتج:\n```text\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 7 == 0)", "tests": ["assert mult_sum(247) == 17520", "assert mult_sum(126) == 4473", "assert mult_sum(87) == 2144", "assert mult_sum(211) == 12705", "assert mult_sum(256) == 18524", "assert mult_sum(212) == 12705", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(247) == 17520\nassert mult_sum(126) == 4473\nassert mult_sum(87) == 2144\nassert mult_sum(211) == 12705\nassert mult_sum(256) == 18524\nassert mult_sum(212) == 12705\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 7 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 7.\nمثال: `mult_sum(247)` يجب أن تُرجع `17520`.\nالجواب:", "qhash": "659dab0cff4a70f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'جبل دفتر'\nprint(s.find('ب'))\nprint(s[::-1])\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'جبل دفتر'\nprint(s.find('ب'))\nprint(s[::-1])\nprint(s[-1])\n```\nالجواب:", "qhash": "bb58066899a7777f", "answer": "1\nرتفد لبج\nر", "completion": " الناتج:\n```text\n1\nرتفد لبج\nر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 15\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 = 15\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": "7b69f9aad9d2e30b", "answer": "17", "completion": " الناتج:\n```text\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'acgt'}", "tests": ["assert tally('is music pixel summer camel summer') == {'a': 1, 'c': 2, 'g': 0, 't': 0}", "assert tally('up falcon summer data') == {'a': 3, 'c': 1, 'g': 0, 't': 1}", "assert tally('python') == {'a': 0, 'c': 0, 'g': 0, 't': 1}", "assert tally('it banana go python vector') == {'a': 3, 'c': 1, 'g': 1, 't': 3}", "assert tally('planet desert winter') == {'a': 1, 'c': 0, 'g': 0, 't': 3}", "assert tally('winter camel summer') == {'a': 1, 'c': 1, 'g': 0, 't': 1}", "assert tally('') == {'a': 0, 'c': 0, 'g': 0, 't': 0}"], "test_code": "assert tally('is music pixel summer camel summer') == {'a': 1, 'c': 2, 'g': 0, 't': 0}\nassert tally('up falcon summer data') == {'a': 3, 'c': 1, 'g': 0, 't': 1}\nassert tally('python') == {'a': 0, 'c': 0, 'g': 0, 't': 1}\nassert tally('it banana go python vector') == {'a': 3, 'c': 1, 'g': 1, 't': 3}\nassert tally('planet desert winter') == {'a': 1, 'c': 0, 'g': 0, 't': 3}\nassert tally('winter camel summer') == {'a': 1, 'c': 1, 'g': 0, 't': 1}\nassert tally('') == {'a': 0, 'c': 0, 'g': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'acgt'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'acgt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'c'، 'g'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('is music pixel summer camel summer')` يجب أن تُرجع `{'a': 1, 'c': 2, 'g': 0, 't': 0}`.\nالجواب:", "qhash": "e68af64976f0dd56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[k:] + items[:k]", "tests": ["assert cycle([40, 2, 45, 24]) == [40, 2, 45, 24]", "assert cycle([-9, 0, 44, 9, 35, 25, 19, 11]) == [35, 25, 19, 11, -9, 0, 44, 9]", "assert cycle([-3, 4, 37, 27, 6, 25, -2]) == [-2, -3, 4, 37, 27, 6, 25]", "assert cycle([2, 29, 50, 44, -5, 20]) == [50, 44, -5, 20, 2, 29]", "assert cycle([-7, 35, 36, 20, 0]) == [-7, 35, 36, 20, 0]", "assert cycle([17, 40, 3, -4, 9]) == [17, 40, 3, -4, 9]", "assert cycle([]) == []"], "test_code": "assert cycle([40, 2, 45, 24]) == [40, 2, 45, 24]\nassert cycle([-9, 0, 44, 9, 35, 25, 19, 11]) == [35, 25, 19, 11, -9, 0, 44, 9]\nassert cycle([-3, 4, 37, 27, 6, 25, -2]) == [-2, -3, 4, 37, 27, 6, 25]\nassert cycle([2, 29, 50, 44, -5, 20]) == [50, 44, -5, 20, 2, 29]\nassert cycle([-7, 35, 36, 20, 0]) == [-7, 35, 36, 20, 0]\nassert cycle([17, 40, 3, -4, 9]) == [17, 40, 3, -4, 9]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef cycle(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 cycle(items):\n if not items:\n return []\n k = 20 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([40, 2, 45, 24])` يُرجع `[40, 2, 45, 24]`.\nالجواب:", "qhash": "126376e0c68c5f27"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('صحراء طائرة كتاب تفاحة نهار سفينة تفاحة تفاحة') == 3", "assert count_prefix('معلم ميناء بحر باب علم تفاحة تفاحة ماء') == 2", "assert count_prefix('تفاحة ميناء طالب ليل جبل') == 1", "assert count_prefix('حديقة تفاحة جمل تفاحة') == 2", "assert count_prefix('تفاحة علم تفاحة برمجة باب') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('مطر بيت شمس') == 0\nassert count_prefix('صحراء طائرة كتاب تفاحة نهار سفينة تفاحة تفاحة') == 3\nassert count_prefix('معلم ميناء بحر باب علم تفاحة تفاحة ماء') == 2\nassert count_prefix('تفاحة ميناء طالب ليل جبل') == 1\nassert count_prefix('حديقة تفاحة جمل تفاحة') == 2\nassert count_prefix('تفاحة علم تفاحة برمجة باب') == 2\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": "3dd1b3c420d45049"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'clms'}", "tests": ["assert count_chars('of coffee desert cloud code brain') == {'c': 3, 'l': 1, 'm': 0, 's': 1}", "assert count_chars('garden garden') == {'c': 0, 'l': 0, 'm': 0, 's': 0}", "assert count_chars('summer rocket orange banana to summer') == {'c': 1, 'l': 0, 'm': 4, 's': 2}", "assert count_chars('in summer light orange python apple') == {'c': 0, 'l': 2, 'm': 2, 's': 1}", "assert count_chars('light music at') == {'c': 1, 'l': 1, 'm': 1, 's': 1}", "assert count_chars('pixel brain engine music') == {'c': 1, 'l': 1, 'm': 1, 's': 1}", "assert count_chars('') == {'c': 0, 'l': 0, 'm': 0, 's': 0}"], "test_code": "assert count_chars('of coffee desert cloud code brain') == {'c': 3, 'l': 1, 'm': 0, 's': 1}\nassert count_chars('garden garden') == {'c': 0, 'l': 0, 'm': 0, 's': 0}\nassert count_chars('summer rocket orange banana to summer') == {'c': 1, 'l': 0, 'm': 4, 's': 2}\nassert count_chars('in summer light orange python apple') == {'c': 0, 'l': 2, 'm': 2, 's': 1}\nassert count_chars('light music at') == {'c': 1, 'l': 1, 'm': 1, 's': 1}\nassert count_chars('pixel brain engine music') == {'c': 1, 'l': 1, 'm': 1, 's': 1}\nassert count_chars('') == {'c': 0, 'l': 0, 'm': 0, 's': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'clms'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'clms'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'l'، 'm'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('of coffee desert cloud code brain')` يجب أن تُرجع `{'c': 3, 'l': 1, 'm': 0, 's': 1}`.\nالجواب:", "qhash": "315bab966db9e5e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 48:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([9, 2, 6, 28, 29, 19, 28]) == [9, 11, 17, 45, 0, 19, 47]", "assert rolling_total([29]) == [29]", "assert rolling_total([38, -8, -7, 41, 15, 14, 38]) == [38, 30, 23, 0, 15, 29, 0]", "assert rolling_total([43, -4, 24, -7, 9]) == [43, 39, 0, -7, 2]", "assert rolling_total([36, 22, 0, 18]) == [36, 0, 0, 18]", "assert rolling_total([48, 7, -2, 3, -2, 14]) == [48, 0, -2, 1, -1, 13]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([9, 2, 6, 28, 29, 19, 28]) == [9, 11, 17, 45, 0, 19, 47]\nassert rolling_total([29]) == [29]\nassert rolling_total([38, -8, -7, 41, 15, 14, 38]) == [38, 30, 23, 0, 15, 29, 0]\nassert rolling_total([43, -4, 24, -7, 9]) == [43, 39, 0, -7, 2]\nassert rolling_total([36, 22, 0, 18]) == [36, 0, 0, 18]\nassert rolling_total([48, 7, -2, 3, -2, 14]) == [48, 0, -2, 1, -1, 13]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 48:\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 > 48:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 48 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([9, 2, 6, 28, 29, 19, 28])` يجب أن تُرجع `[9, 11, 17, 45, 0, 19, 47]`.\nالجواب:", "qhash": "b44003842975fb23"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11']", "assert fizz(9) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9']", "assert fizz(24) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23', 'Fizz']", "assert fizz(10) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz']", "assert fizz(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21']"], "test_code": "assert fizz(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11']\nassert fizz(9) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9']\nassert fizz(24) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23', 'Fizz']\nassert fizz(10) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz']\nassert fizz(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Fizz'، وعلى 10 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(11)` يجب أن تُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11']`.\nالجواب:", "qhash": "091e90a281e4f797"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 38)", "tests": ["assert between_times([39, 15, 29, 9, 39, 26, 37, 43, 6, 24]) == [-74, -58, -52, -48, -30]", "assert between_times([54, 59]) == []", "assert between_times([32]) == [-64]", "assert between_times([3, 8, 54, 16, 52, 16, 37, -29]) == [-74, -32, -32]", "assert between_times([-20]) == []", "assert between_times([-2, 19, 45, 51, 41, 45]) == [-38]", "assert between_times([43]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([39, 15, 29, 9, 39, 26, 37, 43, 6, 24]) == [-74, -58, -52, -48, -30]\nassert between_times([54, 59]) == []\nassert between_times([32]) == [-64]\nassert between_times([3, 8, 54, 16, 52, 16, 37, -29]) == [-74, -32, -32]\nassert between_times([-20]) == []\nassert between_times([-2, 19, 45, 51, 41, 45]) == [-38]\nassert between_times([43]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 38)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 38)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 11 و38 (شاملًا الطرفين) في -2.\nمثال: `between_times([39, 15, 29, 9, 39, 26, 37, 43, 6, 24])` يجب أن تُرجع `[-74, -58, -52, -48, -30]`.\nالجواب:", "qhash": "9d41f231b2cffee2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 52", "tests": ["assert sum_digit_pow(79568) == 3", "assert sum_digit_pow(56794) == 11", "assert sum_digit_pow(524230) == 6", "assert sum_digit_pow(598320) == 43", "assert sum_digit_pow(38474) == 18", "assert sum_digit_pow(703989) == 44", "assert sum_digit_pow(988974) == 51", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(79568) == 3\nassert sum_digit_pow(56794) == 11\nassert sum_digit_pow(524230) == 6\nassert sum_digit_pow(598320) == 43\nassert sum_digit_pow(38474) == 18\nassert sum_digit_pow(703989) == 44\nassert sum_digit_pow(988974) == 51\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 52", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 52\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 52.\nللتوضيح: الاستدعاء `sum_digit_pow(79568)` يُرجع `3`.\nالجواب:", "qhash": "86fcf9f4a7193d12"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * -2 + -9 for x in range(1, 8) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * -2 + -9 for x in range(1, 8) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "601256f72b6404ce", "answer": "[-11, -15, -19, -23]\n4 -68", "completion": " الناتج:\n```text\n[-11, -15, -19, -23]\n4 -68\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 96", "tests": ["assert digit_power(60624) == 80", "assert digit_power(607427) == 34", "assert digit_power(416043) == 66", "assert digit_power(932824) == 82", "assert digit_power(268058) == 49", "assert digit_power(110437) == 52", "assert digit_power(529676) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(60624) == 80\nassert digit_power(607427) == 34\nassert digit_power(416043) == 66\nassert digit_power(932824) == 82\nassert digit_power(268058) == 49\nassert digit_power(110437) == 52\nassert digit_power(529676) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 96", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 96\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 96.\nمثال: `digit_power(60624)` يجب أن تُرجع `80`.\nالجواب:", "qhash": "b668ebd6a96466f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'عمر': 39, 'منى': 32, 'زينب': 36}\npoints['زينب'] += 15\npoints['علي'] = 13\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 = {'عمر': 39, 'منى': 32, 'زينب': 36}\npoints['زينب'] += 15\npoints['علي'] = 13\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": "09ab56cc47d92b67", "answer": "4\nزينب\n135\n[('علي', 13), ('منى', 32)]", "completion": " الناتج:\n```text\n4\nزينب\n135\n[('علي', 13), ('منى', 32)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 2 + -2 for x in range(-6, 5) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 2 + -2 for x in range(-6, 5) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "491b5e92bde1cbf2", "answer": "[-14, -8, -2, 4]\n4 -20", "completion": " الناتج:\n```text\n[-14, -8, -2, 4]\n4 -20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -3 <= x <= 12)", "tests": ["assert pick_between([21, -1, 21, 1, 5, 22, 10, -4]) == [-1, 1, 5, 10]", "assert pick_between([-23, 54, -4, 0, 3, 56, 3, -15]) == [0, 3, 3]", "assert pick_between([45, -10, -7, 42, 16, 56, 21, 20, 24, 25]) == []", "assert pick_between([-19, -22, 23]) == []", "assert pick_between([58, 59, 34, 37, 52, -15, 12, -18, 27, -27]) == [12]", "assert pick_between([43, 3, 36, -30, 52, 57, 4, -29]) == [3, 4]", "assert pick_between([]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([21, -1, 21, 1, 5, 22, 10, -4]) == [-1, 1, 5, 10]\nassert pick_between([-23, 54, -4, 0, 3, 56, 3, -15]) == [0, 3, 3]\nassert pick_between([45, -10, -7, 42, 16, 56, 21, 20, 24, 25]) == []\nassert pick_between([-19, -22, 23]) == []\nassert pick_between([58, 59, 34, 37, 52, -15, 12, -18, 27, -27]) == [12]\nassert pick_between([43, 3, 36, -30, 52, 57, 4, -29]) == [3, 4]\nassert pick_between([]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -3 <= x <= 12)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 1 for x in xs if -3 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -3 ≤ x ≤ 12، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([21, -1, 21, 1, 5, 22, 10, -4])` يُرجع `[-1, 1, 5, 10]`.\nالجواب:", "qhash": "2f5d86504f1db362"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['camel', 'vector', 'summer', 'rocket', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['camel', 'vector', 'summer', 'rocket', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "2a62e13135d07481", "answer": "['camel', 'cloud', 'vector', 'summer', 'rocket']\n['vector', 'summer', 'rocket']", "completion": " الناتج:\n```text\n['camel', 'cloud', 'vector', 'summer', 'rocket']\n['vector', 'summer', 'rocket']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 5 for x in range(-4, 4) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 5 for x in range(-4, 4) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "508d9a970aead3ae", "answer": "[-1, -4]\n2 -5", "completion": " الناتج:\n```text\n[-1, -4]\n2 -5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (9) * x + (7)", "tests": ["assert poly(2) == 13", "assert poly(-11) == -455", "assert poly(14) == -455", "assert poly(-4) == -77", "assert poly(-1) == -5", "assert poly(8) == -113", "assert poly(3) == 7", "assert poly(0) == 7"], "test_code": "assert poly(2) == 13\nassert poly(-11) == -455\nassert poly(14) == -455\nassert poly(-4) == -77\nassert poly(-1) == -5\nassert poly(8) == -113\nassert poly(3) == 7\nassert poly(0) == 7", "answer": "def poly(x):\n return -3 * x ** 2 + (9) * x + (7)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (9) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار -3x² + 9x + 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(2)` يُرجع `13`.\nالجواب:", "qhash": "ad4ff3034ab4b453"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['river', 'garden', 'stone', 'desert', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['river', 'garden', 'stone', 'desert', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "5ccb3b0b7a5cd1d9", "answer": "['river', 'stone', 'garden', 'desert', 'engine']\n['garden', 'engine', 'desert']", "completion": " الناتج:\n```text\n['river', 'stone', 'garden', 'desert', 'engine']\n['garden', 'engine', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 49", "tests": ["assert pow_digits(61072) == 18", "assert pow_digits(577887) == 12", "assert pow_digits(324119) == 31", "assert pow_digits(990118) == 46", "assert pow_digits(141953) == 37", "assert pow_digits(748112) == 16", "assert pow_digits(359845) == 11", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(61072) == 18\nassert pow_digits(577887) == 12\nassert pow_digits(324119) == 31\nassert pow_digits(990118) == 46\nassert pow_digits(141953) == 37\nassert pow_digits(748112) == 16\nassert pow_digits(359845) == 11\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 49", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 49\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 49.\nمثال: `pow_digits(61072)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "741c9224336e0221"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 97", "tests": ["assert step_product(11) == 7", "assert step_product(55) == 20", "assert step_product(6) == 18", "assert step_product(25) == 27", "assert step_product(52) == 18", "assert step_product(38) == 96", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 7\nassert step_product(55) == 20\nassert step_product(6) == 18\nassert step_product(25) == 27\nassert step_product(52) == 18\nassert step_product(38) == 96\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 97", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(11)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "6b4f84d1d7fb40df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 154\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 = 154\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": "f7721365e8872fa9", "answer": "23", "completion": " الناتج:\n```text\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 57457\ncount = 0\nwhile m > 17:\n m = m // 4\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 57457\ncount = 0\nwhile m > 17:\n m = m // 4\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "e41849babf900db7", "answer": "14 6", "completion": " الناتج:\n```text\n14 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(896240832))\nprint(rec(rec(896240832)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(896240832))\nprint(rec(rec(896240832)))\n```\nالجواب:", "qhash": "74025253089ff9cb", "answer": "42\n6", "completion": " الناتج:\n```text\n42\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [3, 2, 17, 20, 14]\nprint(items[2:4])\nprint(items[::2])\nprint(sum(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [3, 2, 17, 20, 14]\nprint(items[2:4])\nprint(items[::2])\nprint(sum(items[2:4]))\n```\nالجواب:", "qhash": "03badf8754dfc8bb", "answer": "[17, 20]\n[3, 17, 14]\n37", "completion": " الناتج:\n```text\n[17, 20]\n[3, 17, 14]\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 12 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert turn_list([33, 0, 23, 25, 28, 14, 26, 44]) == [28, 14, 26, 44, 33, 0, 23, 25]", "assert turn_list([0, 5, 27, 42, 28, 43, 31, 43, 43, -5]) == [27, 42, 28, 43, 31, 43, 43, -5, 0, 5]", "assert turn_list([26, 1, -7, -5, 39, 2, 32, 32, 39, 18, 11, -5]) == [26, 1, -7, -5, 39, 2, 32, 32, 39, 18, 11, -5]", "assert turn_list([16, 14, 2, 25, 16, 39, 14, 7, 13, -9]) == [2, 25, 16, 39, 14, 7, 13, -9, 16, 14]", "assert turn_list([5, -2, 47, 9, -2, 9, 25, 24, 19, 2, 44]) == [-2, 47, 9, -2, 9, 25, 24, 19, 2, 44, 5]", "assert turn_list([9, 27, 13, 11, 49, 2, 43, 0, 23, 50, -2]) == [27, 13, 11, 49, 2, 43, 0, 23, 50, -2, 9]", "assert turn_list([]) == []"], "test_code": "assert turn_list([33, 0, 23, 25, 28, 14, 26, 44]) == [28, 14, 26, 44, 33, 0, 23, 25]\nassert turn_list([0, 5, 27, 42, 28, 43, 31, 43, 43, -5]) == [27, 42, 28, 43, 31, 43, 43, -5, 0, 5]\nassert turn_list([26, 1, -7, -5, 39, 2, 32, 32, 39, 18, 11, -5]) == [26, 1, -7, -5, 39, 2, 32, 32, 39, 18, 11, -5]\nassert turn_list([16, 14, 2, 25, 16, 39, 14, 7, 13, -9]) == [2, 25, 16, 39, 14, 7, 13, -9, 16, 14]\nassert turn_list([5, -2, 47, 9, -2, 9, 25, 24, 19, 2, 44]) == [-2, 47, 9, -2, 9, 25, 24, 19, 2, 44, 5]\nassert turn_list([9, 27, 13, 11, 49, 2, 43, 0, 23, 50, -2]) == [27, 13, 11, 49, 2, 43, 0, 23, 50, -2, 9]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 12 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 12 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 12 % len(arr)\n return ____\n```\nمثال: `turn_list([33, 0, 23, 25, 28, 14, 26, 44])` يجب أن تُرجع `[28, 14, 26, 44, 33, 0, 23, 25]`.\nالجواب:", "qhash": "3fcd9665230ddc01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 6 * x ** 2 + (-9) * x + (-9)", "tests": ["assert evaluate(10) == 501", "assert evaluate(5) == 96", "assert evaluate(-18) == 2097", "assert evaluate(-1) == 6", "assert evaluate(14) == 1041", "assert evaluate(-2) == 33", "assert evaluate(12) == 747", "assert evaluate(0) == -9"], "test_code": "assert evaluate(10) == 501\nassert evaluate(5) == 96\nassert evaluate(-18) == 2097\nassert evaluate(-1) == 6\nassert evaluate(14) == 1041\nassert evaluate(-2) == 33\nassert evaluate(12) == 747\nassert evaluate(0) == -9", "answer": "def evaluate(x):\n return 6 * x ** 2 + (-9) * x + (-9)", "completion": " ```python\ndef evaluate(x):\n return 6 * x ** 2 + (-9) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 6x² - 9x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(10)` يُرجع `501`.\nالجواب:", "qhash": "4e139749092e8ea1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "tests": ["assert pow_total(5) == 55", "assert pow_total(5) == 55", "assert pow_total(13) == 819", "assert pow_total(2) == 5", "assert pow_total(0) == 0", "assert pow_total(1) == 1", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 55\nassert pow_total(5) == 55\nassert pow_total(13) == 819\nassert pow_total(2) == 5\nassert pow_total(0) == 0\nassert pow_total(1) == 1\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `pow_total(5)` يُرجع `55`.\nالجواب:", "qhash": "59dd4ecb7d3fbcbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [1, 9, 39, 3, 6]\nprint(lst[1:4])\nprint(lst[::-1])\nprint(sum(lst[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [1, 9, 39, 3, 6]\nprint(lst[1:4])\nprint(lst[::-1])\nprint(sum(lst[1:4]))\n```\nالجواب:", "qhash": "fcd82a7d73395923", "answer": "[9, 39, 3]\n[6, 3, 39, 9, 1]\n51", "completion": " الناتج:\n```text\n[9, 39, 3]\n[6, 3, 39, 9, 1]\n51\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [2, 3, 16, -7, 20, 28]\nprint(items[0:1])\nprint(items[::2])\nprint(len(items[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [2, 3, 16, -7, 20, 28]\nprint(items[0:1])\nprint(items[::2])\nprint(len(items[0:1]))\n```\nالجواب:", "qhash": "0bf74975f718ed44", "answer": "[2]\n[2, 16, 20]\n1", "completion": " الناتج:\n```text\n[2]\n[2, 16, 20]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('window it brain data we A1') == 'uglbmu gr zpygl byry uc A1'", "assert rotate_letters('window is engine light Hello') == 'uglbmu gq cleglc jgefr Hcjjm'", "assert rotate_letters('on planet') == 'ml njylcr'", "assert rotate_letters('to OK') == 'rm OK'", "assert rotate_letters('banana planet OK') == 'zylyly njylcr OK'", "assert rotate_letters('at of OK') == 'yr md OK'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('window it brain data we A1') == 'uglbmu gr zpygl byry uc A1'\nassert rotate_letters('window is engine light Hello') == 'uglbmu gq cleglc jgefr Hcjjm'\nassert rotate_letters('on planet') == 'ml njylcr'\nassert rotate_letters('to OK') == 'rm OK'\nassert rotate_letters('banana planet OK') == 'zylyly njylcr OK'\nassert rotate_letters('at of OK') == 'yr md 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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('window it brain data we A1')` يُرجع `'uglbmu gr zpygl byry uc A1'`.\nالجواب:", "qhash": "b7f3333cf27d3bf6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [-6, 1, 24, 15, 26, 11, 16, 5, 34]\nprint(xs[0:6])\nprint(xs[::-1])\nprint(max(xs[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [-6, 1, 24, 15, 26, 11, 16, 5, 34]\nprint(xs[0:6])\nprint(xs[::-1])\nprint(max(xs[0:6]))\n```\nالجواب:", "qhash": "414fdcb549c9066f", "answer": "[-6, 1, 24, 15, 26, 11]\n[34, 5, 16, 11, 26, 15, 24, 1, -6]\n26", "completion": " الناتج:\n```text\n[-6, 1, 24, 15, 26, 11]\n[34, 5, 16, 11, 26, 15, 24, 1, -6]\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'قلم سوق'\nprint(text.replace(' ', '-'))\nprint(text.find('و'))\nprint(text.count('و'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'قلم سوق'\nprint(text.replace(' ', '-'))\nprint(text.find('و'))\nprint(text.count('و'))\n```\nالجواب:", "qhash": "1a97c93755ffd57e", "answer": "قلم-سوق\n5\n1", "completion": " الناتج:\n```text\nقلم-سوق\n5\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 196:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([45, 51, 23, 55, 57, 1, 52, 52, 51]) == [45, 96, 119, 174, 0, 1, 53, 105, 156]", "assert cumulative([165, 61, 67]) == [165, 0, 67]", "assert cumulative([98, 187, 86]) == [98, 0, 86]", "assert cumulative([181, 113, 22, 71, 189, 82, 5, 101]) == [181, 0, 22, 93, 0, 82, 87, 188]", "assert cumulative([142, 64, 113, 111, 132, 15, 106]) == [142, 0, 113, 0, 132, 147, 0]", "assert cumulative([54, 62, 173]) == [54, 116, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([45, 51, 23, 55, 57, 1, 52, 52, 51]) == [45, 96, 119, 174, 0, 1, 53, 105, 156]\nassert cumulative([165, 61, 67]) == [165, 0, 67]\nassert cumulative([98, 187, 86]) == [98, 0, 86]\nassert cumulative([181, 113, 22, 71, 189, 82, 5, 101]) == [181, 0, 22, 93, 0, 82, 87, 188]\nassert cumulative([142, 64, 113, 111, 132, 15, 106]) == [142, 0, 113, 0, 132, 147, 0]\nassert cumulative([54, 62, 173]) == [54, 116, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 196:\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 > 196:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 196 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([45, 51, 23, 55, 57, 1, 52, 52, 51])` يُرجع `[45, 96, 119, 174, 0, 1, 53, 105, 156]`.\nالجواب:", "qhash": "7b620a0f9ce1c29f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [38, -4, -2, -2, 36, 22, 40, 39]\nprint(sorted(nums, key=lambda x: (abs(x - 18), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [38, -4, -2, -2, 36, 22, 40, 39]\nprint(sorted(nums, key=lambda x: (abs(x - 18), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "7277f4e4784d2791", "answer": "[22, 36, -2, -2, 38, 39, -4, 40]\n[40, 39, 38]", "completion": " الناتج:\n```text\n[22, 36, -2, -2, 38, 39, -4, 40]\n[40, 39, 38]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total", "tests": ["assert scaled_powers(7) == 56", "assert scaled_powers(9) == 90", "assert scaled_powers(12) == 156", "assert scaled_powers(5) == 30", "assert scaled_powers(1) == 2", "assert scaled_powers(1) == 2", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 56\nassert scaled_powers(9) == 90\nassert scaled_powers(12) == 156\nassert scaled_powers(5) == 30\nassert scaled_powers(1) == 2\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 ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(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 scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 1\n return total\n```\nمثال: `scaled_powers(7)` يجب أن تُرجع `56`.\nالجواب:", "qhash": "61ffd6b26402d0cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [-5, 18, 1, 0, -5, 4, 1, 22]\nprint(a[1:4])\nprint(a[::3])\nprint(sum(a[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [-5, 18, 1, 0, -5, 4, 1, 22]\nprint(a[1:4])\nprint(a[::3])\nprint(sum(a[1:4]))\n```\nالجواب:", "qhash": "b4b1f1836e458fd5", "answer": "[18, 1, 0]\n[-5, 0, 1]\n19", "completion": " الناتج:\n```text\n[18, 1, 0]\n[-5, 0, 1]\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_list([28, 19, 16, 10]) == [10, 28, 19, 16]", "assert rotate_list([22, 22, 8, 25, 28, 36, -8]) == [22, 22, 8, 25, 28, 36, -8]", "assert rotate_list([13]) == [13]", "assert rotate_list([38, 23, 33, 20, 1, 5, 48, 48, 43, 45]) == [48, 43, 45, 38, 23, 33, 20, 1, 5, 48]", "assert rotate_list([8, 12]) == [12, 8]", "assert rotate_list([34, 49, 0]) == [49, 0, 34]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([28, 19, 16, 10]) == [10, 28, 19, 16]\nassert rotate_list([22, 22, 8, 25, 28, 36, -8]) == [22, 22, 8, 25, 28, 36, -8]\nassert rotate_list([13]) == [13]\nassert rotate_list([38, 23, 33, 20, 1, 5, 48, 48, 43, 45]) == [48, 43, 45, 38, 23, 33, 20, 1, 5, 48]\nassert rotate_list([8, 12]) == [12, 8]\nassert rotate_list([34, 49, 0]) == [49, 0, 34]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return ____\n```\nمثال: `rotate_list([28, 19, 16, 10])` يجب أن تُرجع `[10, 28, 19, 16]`.\nالجواب:", "qhash": "dcb2f871a7db7a3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(-6))\nprint(compute(-6, 7))\nprint(compute(compute(7), -6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(-6))\nprint(compute(-6, 7))\nprint(compute(compute(7), -6))\n```\nالجواب:", "qhash": "3834befbf162552d", "answer": "57\n43\n496", "completion": " الناتج:\n```text\n57\n43\n496\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('window music we A1') == 'lxcsdl bjhxr lt A1'", "assert decode('banana A1') == 'qpcpcp A1'", "assert decode('cloud of apple at planet') == 'radjs du peeat pi eapcti'", "assert decode('light falcon to') == 'axvwi upardc id'", "assert decode('go') == 'vd'", "assert decode('code stone on garden an') == 'rdst hidct dc vpgstc pc'", "assert decode('') == ''"], "test_code": "assert decode('window music we A1') == 'lxcsdl bjhxr lt A1'\nassert decode('banana A1') == 'qpcpcp A1'\nassert decode('cloud of apple at planet') == 'radjs du peeat pi eapcti'\nassert decode('light falcon to') == 'axvwi upardc id'\nassert decode('go') == 'vd'\nassert decode('code stone on garden an') == 'rdst hidct dc vpgstc pc'\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 + (-11)) % 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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('window music we A1')` يُرجع `'lxcsdl bjhxr lt A1'`.\nالجواب:", "qhash": "463ad672e3e2cb34"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "tests": ["assert sum_powers(4) == 180", "assert sum_powers(13) == 4914", "assert sum_powers(10) == 2310", "assert sum_powers(10) == 2310", "assert sum_powers(4) == 180", "assert sum_powers(1) == 6", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(4) == 180\nassert sum_powers(13) == 4914\nassert sum_powers(10) == 2310\nassert sum_powers(10) == 2310\nassert sum_powers(4) == 180\nassert sum_powers(1) == 6\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 2\n return total\n```\nمثال: `sum_powers(4)` يجب أن تُرجع `180`.\nالجواب:", "qhash": "c0e2ac3489403491"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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 rocket vector at') == 'vector,rocket'", "assert invert_words('') == ''", "assert invert_words('vector') == 'vector'", "assert invert_words('at window coffee') == 'coffee,window'", "assert invert_words('desert orange to engine summer rocket') == 'rocket,summer,engine,orange,desert'", "assert invert_words('it falcon planet camel winter light') == 'light,winter,camel,planet,falcon'", "assert invert_words('') == ''"], "test_code": "assert invert_words('up rocket vector at') == 'vector,rocket'\nassert invert_words('') == ''\nassert invert_words('vector') == 'vector'\nassert invert_words('at window coffee') == 'coffee,window'\nassert invert_words('desert orange to engine summer rocket') == 'rocket,summer,engine,orange,desert'\nassert invert_words('it falcon planet camel winter light') == 'light,winter,camel,planet,falcon'\nassert invert_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `invert_words('up rocket vector at')` يُرجع `'vector,rocket'`.\nالجواب:", "qhash": "795ac2bb640a5cb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'engine'\nprint(s.count('i'))\nprint(s.find('i'))\nprint(s[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'engine'\nprint(s.count('i'))\nprint(s.find('i'))\nprint(s[-1:])\n```\nالجواب:", "qhash": "08f23ac425bd6045", "answer": "1\n3\ne", "completion": " الناتج:\n```text\n1\n3\ne\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(262) == 8011", "assert multiples_total(42) == 205", "assert multiples_total(235) == 6267", "assert multiples_total(240) == 6505", "assert multiples_total(23) == 72", "assert multiples_total(83) == 752", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(262) == 8011\nassert multiples_total(42) == 205\nassert multiples_total(235) == 6267\nassert multiples_total(240) == 6505\nassert multiples_total(23) == 72\nassert multiples_total(83) == 752\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 10.\nمثال: `multiples_total(262)` يجب أن تُرجع `8011`.\nالجواب:", "qhash": "6df25c0c0e325196"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'قلم طالب'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint(s.count('ق'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'قلم طالب'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint(s.count('ق'))\n```\nالجواب:", "qhash": "c670e5e7d55431b4", "answer": "8\nقلم-طالب\n1", "completion": " الناتج:\n```text\n8\nقلم-طالب\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 47", "tests": ["assert step_product(10) == 45", "assert step_product(55) == 5", "assert step_product(0) == 1", "assert step_product(59) == 0", "assert step_product(22) == 12", "assert step_product(0) == 1", "assert step_product(0) == 1"], "test_code": "assert step_product(10) == 45\nassert step_product(55) == 5\nassert step_product(0) == 1\nassert step_product(59) == 0\nassert step_product(22) == 12\nassert step_product(0) == 1\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 47", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(10)` يُرجع `45`.\nالجواب:", "qhash": "7e48b7cc873132c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 20)", "tests": ["assert pick_between([27, 13, 30, 18]) == [26, 36]", "assert pick_between([37, 4, 0, 35, 34]) == []", "assert pick_between([45, 28, 0, -11]) == []", "assert pick_between([54, -7, 25, -14, 4]) == []", "assert pick_between([56, 11, 10, 59, -7, 12, -11, 23, 60]) == []", "assert pick_between([-18, 16, 1, 57]) == [32]", "assert pick_between([16]) == [32]", "assert pick_between([]) == []"], "test_code": "assert pick_between([27, 13, 30, 18]) == [26, 36]\nassert pick_between([37, 4, 0, 35, 34]) == []\nassert pick_between([45, 28, 0, -11]) == []\nassert pick_between([54, -7, 25, -14, 4]) == []\nassert pick_between([56, 11, 10, 59, -7, 12, -11, 23, 60]) == []\nassert pick_between([-18, 16, 1, 57]) == [32]\nassert pick_between([16]) == [32]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 20)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 13 و20 (شاملًا الطرفين) في 2.\nمثال: `pick_between([27, 13, 30, 18])` يجب أن تُرجع `[26, 36]`.\nالجواب:", "qhash": "3eb2103693414637"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert mirror_words('music it window apple go to') == 'window'", "assert mirror_words('pixel orange winter pixel vector is') == 'vector_winter_orange'", "assert mirror_words('table orange rocket signal') == 'signal_rocket_orange'", "assert mirror_words('rocket code apple falcon an') == 'falcon_rocket'", "assert mirror_words('vector engine go') == 'engine_vector'", "assert mirror_words('it orange music engine window') == 'window_engine_orange'", "assert mirror_words('code banana we rocket') == 'rocket_banana'"], "test_code": "assert mirror_words('music it window apple go to') == 'window'\nassert mirror_words('pixel orange winter pixel vector is') == 'vector_winter_orange'\nassert mirror_words('table orange rocket signal') == 'signal_rocket_orange'\nassert mirror_words('rocket code apple falcon an') == 'falcon_rocket'\nassert mirror_words('vector engine go') == 'engine_vector'\nassert mirror_words('it orange music engine window') == 'window_engine_orange'\nassert mirror_words('code banana we rocket') == 'rocket_banana'", "answer": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `mirror_words('music it window apple go to')` يجب أن تُرجع `'window'`.\nالجواب:", "qhash": "af64b30d0f9fc993"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'coffee'\nprint(text[-4:])\nprint(len(text))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'coffee'\nprint(text[-4:])\nprint(len(text))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "2a57b8196ae612ac", "answer": "ffee\n6\nCoffee", "completion": " الناتج:\n```text\nffee\n6\nCoffee\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009", "tests": ["assert step_product(4) == 4", "assert step_product(4) == 4", "assert step_product(32) == 951", "assert step_product(37) == 78", "assert step_product(39) == 496", "assert step_product(58) == 255", "assert step_product(0) == 1"], "test_code": "assert step_product(4) == 4\nassert step_product(4) == 4\nassert step_product(32) == 951\nassert step_product(37) == 78\nassert step_product(39) == 496\nassert step_product(58) == 255\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(4)` يُرجع `4`.\nالجواب:", "qhash": "6ed8083eee8d6b1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 3 * x ** 2 + (-9) * x + (-5)", "tests": ["assert quad(3) == -5", "assert quad(2) == -11", "assert quad(-6) == 157", "assert quad(-8) == 259", "assert quad(12) == 319", "assert quad(-10) == 385", "assert quad(-14) == 709", "assert quad(0) == -5"], "test_code": "assert quad(3) == -5\nassert quad(2) == -11\nassert quad(-6) == 157\nassert quad(-8) == 259\nassert quad(12) == 319\nassert quad(-10) == 385\nassert quad(-14) == 709\nassert quad(0) == -5", "answer": "def quad(x):\n return 3 * x ** 2 + (-9) * x + (-5)", "completion": " ```python\ndef quad(x):\n return 3 * x ** 2 + (-9) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 3x² - 9x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(3)` يُرجع `-5`.\nالجواب:", "qhash": "1f5f5c28582a8627"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('stone of brain music Hello') == 'vwrqh ri eudlq pxvlf Hhoor'", "assert rotate_letters('banana banana vector') == 'edqdqd edqdqd yhfwru'", "assert rotate_letters('of OK') == 'ri OK'", "assert rotate_letters('vector window cloud on 2024') == 'yhfwru zlqgrz forxg rq 2024'", "assert rotate_letters('at by music orange rocket') == 'dw eb pxvlf rudqjh urfnhw'", "assert rotate_letters('it by') == 'lw eb'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('stone of brain music Hello') == 'vwrqh ri eudlq pxvlf Hhoor'\nassert rotate_letters('banana banana vector') == 'edqdqd edqdqd yhfwru'\nassert rotate_letters('of OK') == 'ri OK'\nassert rotate_letters('vector window cloud on 2024') == 'yhfwru zlqgrz forxg rq 2024'\nassert rotate_letters('at by music orange rocket') == 'dw eb pxvlf rudqjh urfnhw'\nassert rotate_letters('it by') == 'lw eb'\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 + (3)) % 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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('stone of brain music Hello')` يُرجع `'vwrqh ri eudlq pxvlf Hhoor'`.\nالجواب:", "qhash": "d30e01d99782b6de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'مريم': 43, 'هدى': 16, 'راشد': 48, 'باسل': 34}\nscores['باسل'] += 16\nscores['سلمى'] = 47\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هدى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'مريم': 43, 'هدى': 16, 'راشد': 48, 'باسل': 34}\nscores['باسل'] += 16\nscores['سلمى'] = 47\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هدى', -1))\n```\nالجواب:", "qhash": "43ea00f3c759efce", "answer": "5\nباسل\n204\n16", "completion": " الناتج:\n```text\n5\nباسل\n204\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 4 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(8) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar']", "assert label_numbers(25) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo', '23', 'FooBar', '25']", "assert label_numbers(15) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15']", "assert label_numbers(12) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar']", "assert label_numbers(22) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo']"], "test_code": "assert label_numbers(8) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar']\nassert label_numbers(25) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo', '23', 'FooBar', '25']\nassert label_numbers(15) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15']\nassert label_numbers(12) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar']\nassert label_numbers(22) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', '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 % 4 == 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 % 4 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Foo'، وعلى 4 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(8)` يجب أن تُرجع `['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar']`.\nالجواب:", "qhash": "655ab9ea06dcc969"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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 table desert') == 'desert,table,stone'", "assert invert_words('apple is') == 'is,apple'", "assert invert_words('') == ''", "assert invert_words('to is desert banana a') == 'a,banana,desert,is,to'", "assert invert_words('of on brain') == 'brain,on,of'", "assert invert_words('of an') == 'an,of'", "assert invert_words('garden go stone by code') == 'code,by,stone,go,garden'"], "test_code": "assert invert_words('stone table desert') == 'desert,table,stone'\nassert invert_words('apple is') == 'is,apple'\nassert invert_words('') == ''\nassert invert_words('to is desert banana a') == 'a,banana,desert,is,to'\nassert invert_words('of on brain') == 'brain,on,of'\nassert invert_words('of an') == 'an,of'\nassert invert_words('garden go stone by code') == 'code,by,stone,go,garden'", "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 table desert')` يجب أن تُرجع `'desert,table,stone'`.\nالجواب:", "qhash": "3f87f81d66084dbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 8 for x in range(6, 12) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 8 for x in range(6, 12) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "0b69fc94c38264e2", "answer": "[56]\n1 56", "completion": " الناتج:\n```text\n[56]\n1 56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [14, -8, 27, 36, 4, 40, -5]\nprint(lst[0:5])\nprint(lst[::-2])\nprint(min(lst[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [14, -8, 27, 36, 4, 40, -5]\nprint(lst[0:5])\nprint(lst[::-2])\nprint(min(lst[0:5]))\n```\nالجواب:", "qhash": "f10cd88842e00040", "answer": "[14, -8, 27, 36, 4]\n[-5, 4, 27, 14]\n-8", "completion": " الناتج:\n```text\n[14, -8, 27, 36, 4]\n[-5, 4, 27, 14]\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(21) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21']", "assert fizzbuzz(21) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(19) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19']", "assert fizzbuzz(14) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14']"], "test_code": "assert fizzbuzz(21) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21']\nassert fizzbuzz(21) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(19) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19']\nassert fizzbuzz(14) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14']", "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 % 11 == 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 % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Sun'، وإن قَبِلها على 11 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(21)` يُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', '10', 'Moon', 'Sun', '13', '14', '15', 'Sun', '17', '18', '19', 'Sun', '21']`.\nالجواب:", "qhash": "56d9c53ef34a94cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 23:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([7, 16, 10, 12, 1, 15, 12]) == [7, 23, 0, 12, 13, 0, 12]", "assert capped_cumsum([5, -10, -9, -9, 10, 8, 8, 21, 18, 14]) == [5, -5, -14, -23, -13, -5, 3, 0, 18, 0]", "assert capped_cumsum([23, 5, 13, -2, 19, 23, 13]) == [23, 0, 13, 11, 0, 23, 0]", "assert capped_cumsum([20]) == [20]", "assert capped_cumsum([15, 8]) == [15, 23]", "assert capped_cumsum([-1, 7, 21, 17]) == [-1, 6, 0, 17]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([7, 16, 10, 12, 1, 15, 12]) == [7, 23, 0, 12, 13, 0, 12]\nassert capped_cumsum([5, -10, -9, -9, 10, 8, 8, 21, 18, 14]) == [5, -5, -14, -23, -13, -5, 3, 0, 18, 0]\nassert capped_cumsum([23, 5, 13, -2, 19, 23, 13]) == [23, 0, 13, 11, 0, 23, 0]\nassert capped_cumsum([20]) == [20]\nassert capped_cumsum([15, 8]) == [15, 23]\nassert capped_cumsum([-1, 7, 21, 17]) == [-1, 6, 0, 17]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 23:\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 > 23:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 23 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([7, 16, 10, 12, 1, 15, 12])` يجب أن تُرجع `[7, 23, 0, 12, 13, 0, 12]`.\nالجواب:", "qhash": "f76b2dea4e344726"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert game(18) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo']", "assert game(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17']", "assert game(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16']", "assert game(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17']", "assert game(10) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10']"], "test_code": "assert game(18) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo']\nassert game(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17']\nassert game(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16']\nassert game(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17']\nassert game(10) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Hi'، وإن قَبِلها على 9 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(18)` يُرجع `['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo']`.\nالجواب:", "qhash": "4dec7f53a2dec201"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 17", "tests": ["assert rec_prod(12) == 12", "assert rec_prod(28) == 0", "assert rec_prod(7) == 8", "assert rec_prod(9) == 15", "assert rec_prod(42) == 0", "assert rec_prod(38) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 12\nassert rec_prod(28) == 0\nassert rec_prod(7) == 8\nassert rec_prod(9) == 15\nassert rec_prod(42) == 0\nassert rec_prod(38) == 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)) % 17", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(12)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "ed55ba805acdc2a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 2 for x in range(-5, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 2 for x in range(-5, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "380d4472907b0848", "answer": "[7, -2, 7, 34]\n4 46", "completion": " الناتج:\n```text\n[7, -2, 7, 34]\n4 46\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -2 * x ** 2 + (9) * x + (-7)", "tests": ["assert evaluate(1) == 0", "assert evaluate(-11) == -348", "assert evaluate(-15) == -592", "assert evaluate(2) == 3", "assert evaluate(-16) == -663", "assert evaluate(4) == -3", "assert evaluate(19) == -558", "assert evaluate(0) == -7"], "test_code": "assert evaluate(1) == 0\nassert evaluate(-11) == -348\nassert evaluate(-15) == -592\nassert evaluate(2) == 3\nassert evaluate(-16) == -663\nassert evaluate(4) == -3\nassert evaluate(19) == -558\nassert evaluate(0) == -7", "answer": "def evaluate(x):\n return -2 * x ** 2 + (9) * x + (-7)", "completion": " ```python\ndef evaluate(x):\n return -2 * x ** 2 + (9) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -2x² + 9x - 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(1)` يُرجع `0`.\nالجواب:", "qhash": "9b0d95a25c52e734"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert div_not([36, 25, 12, 17, 37, 88, 35, 24]) == 3", "assert div_not([6, -11, 2, 8, -12, -24]) == 3", "assert div_not([-13, 81, -11, -10, 20, -19, 87, 3, 18, 80, 31]) == 4", "assert div_not([35, 38, 71, 23, 44, -1, -33, 17, -5]) == 1", "assert div_not([-4, 55, -6, 58, 84, 16, 59]) == 1", "assert div_not([25, -32, -24, -23, 16, 22, 10]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([36, 25, 12, 17, 37, 88, 35, 24]) == 3\nassert div_not([6, -11, 2, 8, -12, -24]) == 3\nassert div_not([-13, 81, -11, -10, 20, -19, 87, 3, 18, 80, 31]) == 4\nassert div_not([35, 38, 71, 23, 44, -1, -33, 17, -5]) == 1\nassert div_not([-4, 55, -6, 58, 84, 16, 59]) == 1\nassert div_not([25, -32, -24, -23, 16, 22, 10]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([36, 25, 12, 17, 37, 88, 35, 24])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "169388f523e2ba53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -6 * x ** 2 + (0) * x + (-7)", "tests": ["assert evaluate(9) == -493", "assert evaluate(-13) == -1021", "assert evaluate(5) == -157", "assert evaluate(16) == -1543", "assert evaluate(14) == -1183", "assert evaluate(-4) == -103", "assert evaluate(10) == -607", "assert evaluate(0) == -7"], "test_code": "assert evaluate(9) == -493\nassert evaluate(-13) == -1021\nassert evaluate(5) == -157\nassert evaluate(16) == -1543\nassert evaluate(14) == -1183\nassert evaluate(-4) == -103\nassert evaluate(10) == -607\nassert evaluate(0) == -7", "answer": "def evaluate(x):\n return -6 * x ** 2 + (0) * x + (-7)", "completion": " ```python\ndef evaluate(x):\n return -6 * x ** 2 + (0) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -6x² + 0x - 7 عند العدد الصحيح x.\nمثال: `evaluate(9)` يجب أن تُرجع `-493`.\nالجواب:", "qhash": "5206c468c01865b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 23", "tests": ["assert digits_mod(64689) == 3", "assert digits_mod(9592) == 7", "assert digits_mod(246589) == 19", "assert digits_mod(125060) == 20", "assert digits_mod(180106) == 10", "assert digits_mod(875083) == 4", "assert digits_mod(182287) == 2", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(64689) == 3\nassert digits_mod(9592) == 7\nassert digits_mod(246589) == 19\nassert digits_mod(125060) == 20\nassert digits_mod(180106) == 10\nassert digits_mod(875083) == 4\nassert digits_mod(182287) == 2\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 23", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 23.\nللتوضيح: الاستدعاء `digits_mod(64689)` يُرجع `3`.\nالجواب:", "qhash": "539dc53bd59387db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 0:\n return 5\n return 2 * rec(n - 1) + 0\n\nprint(rec(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 0:\n return 5\n return 2 * rec(n - 1) + 0\n\nprint(rec(10))\n```\nالجواب:", "qhash": "e58ed9cec3842803", "answer": "5120", "completion": " الناتج:\n```text\n5120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 4 <= x <= 44)", "tests": ["assert pick_between([9, 19, 39, 42, 28, 3, 45, 39, 45, 51]) == [36, 76, 112, 156, 156, 168]", "assert pick_between([13, -9, -20, 37]) == [52, 148]", "assert pick_between([-9, -9, -3]) == []", "assert pick_between([-17, 47, -4, 31, 0]) == [124]", "assert pick_between([-6, -1, 38, 17, 7]) == [28, 68, 152]", "assert pick_between([18, 27]) == [72, 108]", "assert pick_between([29]) == [116]", "assert pick_between([]) == []"], "test_code": "assert pick_between([9, 19, 39, 42, 28, 3, 45, 39, 45, 51]) == [36, 76, 112, 156, 156, 168]\nassert pick_between([13, -9, -20, 37]) == [52, 148]\nassert pick_between([-9, -9, -3]) == []\nassert pick_between([-17, 47, -4, 31, 0]) == [124]\nassert pick_between([-6, -1, 38, 17, 7]) == [28, 68, 152]\nassert pick_between([18, 27]) == [72, 108]\nassert pick_between([29]) == [116]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 4 <= x <= 44)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if 4 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 44، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([9, 19, 39, 42, 28, 3, 45, 39, 45, 51])` يُرجع `[36, 76, 112, 156, 156, 168]`.\nالجواب:", "qhash": "5a180d2e14903ff7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [8, 3, -13, 38, 4, -4, -14]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [8, 3, -13, 38, 4, -4, -14]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "050649f4541a6e48", "answer": "[-4, 3, 4, 8, -13, -14, 38]\n[38, 8, 4]", "completion": " الناتج:\n```text\n[-4, 3, 4, 8, -13, -14, 38]\n[38, 8, 4]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [9, 20, -15, -8, 32, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [9, 20, -15, -8, 32, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "83ab788d6f06bbf2", "answer": "[20, 32, 9, -8, -10, -15]\n[32, 20, 9]", "completion": " الناتج:\n```text\n[20, 32, 9, -8, -10, -15]\n[32, 20, 9]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 41) == 1)", "tests": ["assert phi_upto(138) == 135", "assert phi_upto(193) == 189", "assert phi_upto(176) == 172", "assert phi_upto(105) == 103", "assert phi_upto(94) == 92", "assert phi_upto(195) == 191", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(138) == 135\nassert phi_upto(193) == 189\nassert phi_upto(176) == 172\nassert phi_upto(105) == 103\nassert phi_upto(94) == 92\nassert phi_upto(195) == 191\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, 41) == 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, 41) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 41) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(138)` يُرجع `135`.\nالجواب:", "qhash": "26d0f25945a6248d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_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 max_of_div([54, 9, 22, 10, -8]) == -8", "assert max_of_div([-24, -24, -32]) == -24", "assert max_of_div([1, 9, 17]) == None", "assert max_of_div([15, 3, 11, -19, 21, -23, -27, 20]) == None", "assert max_of_div([-35, -32, 30, 30]) == -32", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([54, 9, 22, 10, -8]) == -8\nassert max_of_div([-24, -24, -32]) == -24\nassert max_of_div([1, 9, 17]) == None\nassert max_of_div([15, 3, 11, -19, 21, -23, -27, 20]) == None\nassert max_of_div([-35, -32, 30, 30]) == -32\nassert max_of_div([]) == None", "answer": "def max_of_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 max_of_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 max_of_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_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مثال: `max_of_div([54, 9, 22, 10, -8])` يجب أن تُرجع `-8`.\nالجواب:", "qhash": "8c9fbe4bfa236d5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ف»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('ميناء ليل مدرسة برتقال قهوة سيارة نهر')` يُرجع `0`.\nالجواب:", "qhash": "b0f0c5df53ddbc87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [-7, 0, 24, 15, -2, 27, 16, 2]\nprint(data[2:7])\nprint(data[::2])\nprint(max(data[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [-7, 0, 24, 15, -2, 27, 16, 2]\nprint(data[2:7])\nprint(data[::2])\nprint(max(data[2:7]))\n```\nالجواب:", "qhash": "0ad06a9b41cd8e94", "answer": "[24, 15, -2, 27, 16]\n[-7, 24, -2, 16]\n27", "completion": " الناتج:\n```text\n[24, 15, -2, 27, 16]\n[-7, 24, -2, 16]\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([-3, 30, -19, 44, 30, -6, -25, -2]) == 30", "assert best_multiple([-9, -15, -3]) == -3", "assert best_multiple([1, 4, 7]) == None", "assert best_multiple([-1, 30, 4, 11, 18, 28]) == 30", "assert best_multiple([-8, 41, -5, -42, 37, 10, 17, 30, 4]) == 30", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-3, 30, -19, 44, 30, -6, -25, -2]) == 30\nassert best_multiple([-9, -15, -3]) == -3\nassert best_multiple([1, 4, 7]) == None\nassert best_multiple([-1, 30, 4, 11, 18, 28]) == 30\nassert best_multiple([-8, 41, -5, -42, 37, 10, 17, 30, 4]) == 30\nassert best_multiple([]) == None", "answer": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 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 % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def best_multiple(arr):\n best = 0\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(arr):\n best = 0\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `best_multiple([-3, 30, -19, 44, 30, -6, -25, -2])` يجب أن تُرجع `30`.\nالجواب:", "qhash": "7073caecbc0bfd4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert tally_div([61, 89, 43, 52, 13, 22, 51, 26, 23, 81]) == 0", "assert tally_div([86, 59, -19, 90, 37, 68, 50, 60, 73, -26]) == 1", "assert tally_div([15, 24, -16, -22, 70, -10, 29, -10, -40, -33, -25, 68]) == 1", "assert tally_div([19, 34]) == 0", "assert tally_div([46, 63, 50, 85, -26, -21, -13, -28, -30]) == 1", "assert tally_div([-31, 60, 76, 70, -39, -9]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([61, 89, 43, 52, 13, 22, 51, 26, 23, 81]) == 0\nassert tally_div([86, 59, -19, 90, 37, 68, 50, 60, 73, -26]) == 1\nassert tally_div([15, 24, -16, -22, 70, -10, 29, -10, -40, -33, -25, 68]) == 1\nassert tally_div([19, 34]) == 0\nassert tally_div([46, 63, 50, 85, -26, -21, -13, -28, -30]) == 1\nassert tally_div([-31, 60, 76, 70, -39, -9]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 9، ثم اكتب الدالة كاملة.\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([61, 89, 43, 52, 13, 22, 51, 26, 23, 81])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f78287c8766c4563"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([-16, -19, 29, 34, 10, 13, 31]) == None", "assert max_div([-12, -48, -60]) == -12", "assert max_div([1]) == None", "assert max_div([-35, -28, 13, -35, -36, -4, -20, -19, -17]) == -36", "assert max_div([9, 0, -22, 40, 36, 0, 42]) == 36", "assert max_div([]) == None"], "test_code": "assert max_div([-16, -19, 29, 34, 10, 13, 31]) == None\nassert max_div([-12, -48, -60]) == -12\nassert max_div([1]) == None\nassert max_div([-35, -28, 13, -35, -36, -4, -20, -19, -17]) == -36\nassert max_div([9, 0, -22, 40, 36, 0, 42]) == 36\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([-16, -19, 29, 34, 10, 13, 31])` يُرجع `None`.\nالجواب:", "qhash": "e2fe9c09317c6a94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert rotate_list([45, 29, 5, 26]) == [29, 5, 26, 45]", "assert rotate_list([18, 44, 42, -6, 6]) == [6, 18, 44, 42, -6]", "assert rotate_list([21, 13, -8, 40, 11, 45, 15, -1]) == [13, -8, 40, 11, 45, 15, -1, 21]", "assert rotate_list([29, 4, 43]) == [29, 4, 43]", "assert rotate_list([-3, 10, 3, 27, -6, 5, 23, 13]) == [10, 3, 27, -6, 5, 23, 13, -3]", "assert rotate_list([12, 27, 27, -8, 13, -1, 46, 3, -9]) == [12, 27, 27, -8, 13, -1, 46, 3, -9]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([45, 29, 5, 26]) == [29, 5, 26, 45]\nassert rotate_list([18, 44, 42, -6, 6]) == [6, 18, 44, 42, -6]\nassert rotate_list([21, 13, -8, 40, 11, 45, 15, -1]) == [13, -8, 40, 11, 45, 15, -1, 21]\nassert rotate_list([29, 4, 43]) == [29, 4, 43]\nassert rotate_list([-3, 10, 3, 27, -6, 5, 23, 13]) == [10, 3, 27, -6, 5, 23, 13, -3]\nassert rotate_list([12, 27, 27, -8, 13, -1, 46, 3, -9]) == [12, 27, 27, -8, 13, -1, 46, 3, -9]\nassert rotate_list([]) == []", "answer": "def rotate_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nمثال: `rotate_list([45, 29, 5, 26])` يجب أن تُرجع `[29, 5, 26, 45]`.\nالجواب:", "qhash": "0f7270e435a7fbb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 76:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([32, 35, 32, 18, 31, 14]) == [32, 67, 0, 18, 49, 63]", "assert acc_reset([6, 40, -6]) == [6, 46, 40]", "assert acc_reset([32, 20]) == [32, 52]", "assert acc_reset([73, 33, 51, 37, 50, 20, 24]) == [73, 0, 51, 0, 50, 70, 0]", "assert acc_reset([]) == []", "assert acc_reset([]) == []", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([32, 35, 32, 18, 31, 14]) == [32, 67, 0, 18, 49, 63]\nassert acc_reset([6, 40, -6]) == [6, 46, 40]\nassert acc_reset([32, 20]) == [32, 52]\nassert acc_reset([73, 33, 51, 37, 50, 20, 24]) == [73, 0, 51, 0, 50, 70, 0]\nassert acc_reset([]) == []\nassert acc_reset([]) == []\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 76:\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 > 76:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 76 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([32, 35, 32, 18, 31, 14])` يُرجع `[32, 67, 0, 18, 49, 63]`.\nالجواب:", "qhash": "e793c60c4a44450e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(23) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23']", "assert fizzbuzz(13) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13']", "assert fizzbuzz(22) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22']", "assert fizzbuzz(25) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23', 'Fizz', '25']", "assert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10']"], "test_code": "assert fizzbuzz(23) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23']\nassert fizzbuzz(13) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13']\nassert fizzbuzz(22) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22']\nassert fizzbuzz(25) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23', 'Fizz', '25']\nassert fizzbuzz(10) == ['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Fizz'\n if i % 7 == 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 % 3 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Fizz'، وإن قَبِلها على 7 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(23)` يُرجع `['1', '2', 'Fizz', '4', '5', 'Fizz', 'Buzz', '8', 'Fizz', '10', '11', 'Fizz', '13', 'Buzz', 'Fizz', '16', '17', 'Fizz', '19', '20', 'FizzBuzz', '22', '23']`.\nالجواب:", "qhash": "37ff77ed038296c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(27) == ['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', 'Buzz']", "assert label_numbers(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15']", "assert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23']", "assert label_numbers(6) == ['1', '2', '3', '4', '5', '6']", "assert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13']"], "test_code": "assert label_numbers(27) == ['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', 'Buzz']\nassert label_numbers(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15']\nassert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23']\nassert label_numbers(6) == ['1', '2', '3', '4', '5', '6']\nassert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13']", "answer": "def label_numbers(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 label_numbers(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سؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 9 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(27)` يجب أن تُرجع `['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', 'Buzz']`.\nالجواب:", "qhash": "1b3b7bb61be2e065"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "tests": ["assert sum_terms(3) == 294", "assert sum_terms(2) == 51", "assert sum_terms(7) == 14028", "assert sum_terms(13) == 267813", "assert sum_terms(12) == 182130", "assert sum_terms(1) == 3", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 294\nassert sum_terms(2) == 51\nassert sum_terms(7) == 14028\nassert sum_terms(13) == 267813\nassert sum_terms(12) == 182130\nassert sum_terms(1) == 3\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(3)` يُرجع `294`.\nالجواب:", "qhash": "b1074696231b1250"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(24) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11', '12', '13', '14', 'Fizz', 'Buzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'Buzz']", "assert play(7) == ['1', '2', '3', '4', 'Fizz', '6', '7']", "assert play(24) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11', '12', '13', '14', 'Fizz', 'Buzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'Buzz']", "assert play(11) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11']", "assert play(2) == ['1', '2']"], "test_code": "assert play(24) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11', '12', '13', '14', 'Fizz', 'Buzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'Buzz']\nassert play(7) == ['1', '2', '3', '4', 'Fizz', '6', '7']\nassert play(24) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11', '12', '13', '14', 'Fizz', 'Buzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'Buzz']\nassert play(11) == ['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11']\nassert play(2) == ['1', '2']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 5 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(24)` يُرجع `['1', '2', '3', '4', 'Fizz', '6', '7', 'Buzz', '9', 'Fizz', '11', '12', '13', '14', 'Fizz', 'Buzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'Buzz']`.\nالجواب:", "qhash": "2c0a43f6a76a0e27"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= 2)", "tests": ["assert between_times([-6, -12, 0, -10, 10]) == [0, 30, 50, 60]", "assert between_times([]) == []", "assert between_times([27, -16, -27, 59, 34, 1, -26, -3, -14, 5]) == [-5, 15]", "assert between_times([]) == []", "assert between_times([59, -21, 53, 45, 31, 32, -22]) == []", "assert between_times([]) == []", "assert between_times([50, 14, -1, 4, 36, 9, -20, -8, 27, -20]) == [5, 40]", "assert between_times([]) == []"], "test_code": "assert between_times([-6, -12, 0, -10, 10]) == [0, 30, 50, 60]\nassert between_times([]) == []\nassert between_times([27, -16, -27, 59, 34, 1, -26, -3, -14, 5]) == [-5, 15]\nassert between_times([]) == []\nassert between_times([59, -21, 53, 45, 31, 32, -22]) == []\nassert between_times([]) == []\nassert between_times([50, 14, -1, 4, 36, 9, -20, -8, 27, -20]) == [5, 40]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= 2)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= 2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق -12 ≤ x ≤ 2، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([-6, -12, 0, -10, 10])` يُرجع `[0, 30, 50, 60]`.\nالجواب:", "qhash": "9cd83969b25a6122"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([20, 15, 41, 25, 52, 32]) == 0", "assert count_special([-29, 62, -11, 32, 28, -34]) == 0", "assert count_special([9, 63, 55, 6, -31, 9]) == 0", "assert count_special([82]) == 0", "assert count_special([50, -31, -9, 6]) == 0", "assert count_special([-37, -6, 48, 1, 8, 22, 10, 41, 2, 19, 19, -37]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([20, 15, 41, 25, 52, 32]) == 0\nassert count_special([-29, 62, -11, 32, 28, -34]) == 0\nassert count_special([9, 63, 55, 6, -31, 9]) == 0\nassert count_special([82]) == 0\nassert count_special([50, -31, -9, 6]) == 0\nassert count_special([-37, -6, 48, 1, 8, 22, 10, 41, 2, 19, 19, -37]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([20, 15, 41, 25, 52, 32])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "6b32a7e7903eb468"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([-24, 23, 55, 15]) == None", "assert max_multiple([-28, -14, -28]) == -14", "assert max_multiple([1, 8]) == None", "assert max_multiple([21, 30]) == 21", "assert max_multiple([5, -12, 16, -35, 9, 50, -19, -13]) == -35", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-24, 23, 55, 15]) == None\nassert max_multiple([-28, -14, -28]) == -14\nassert max_multiple([1, 8]) == None\nassert max_multiple([21, 30]) == 21\nassert max_multiple([5, -12, 16, -35, 9, 50, -19, -13]) == -35\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_multiple([-24, 23, 55, 15])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "cbc5a09cdbcb486f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 47", "tests": ["assert digit_score(13217) == 4", "assert digit_score(77055) == 43", "assert digit_score(168497) == 32", "assert digit_score(4210) == 26", "assert digit_score(493110) == 23", "assert digit_score(617920) == 28", "assert digit_score(439199) == 23", "assert digit_score(0) == 0"], "test_code": "assert digit_score(13217) == 4\nassert digit_score(77055) == 43\nassert digit_score(168497) == 32\nassert digit_score(4210) == 26\nassert digit_score(493110) == 23\nassert digit_score(617920) == 28\nassert digit_score(439199) == 23\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 47", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 47.\nللتوضيح: الاستدعاء `digit_score(13217)` يُرجع `4`.\nالجواب:", "qhash": "48370747a0c4f1cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_list([11, 26, 18, 14]) == [14, 11, 26, 18]", "assert rotate_list([33, 24, 42, 3, 20]) == [42, 3, 20, 33, 24]", "assert rotate_list([36, 34, 9, 38, 17, 47, -6, 49, 36, 45]) == [49, 36, 45, 36, 34, 9, 38, 17, 47, -6]", "assert rotate_list([24, 32]) == [32, 24]", "assert rotate_list([-9, 10, 1, 40, 41, -6, -4, 22, 50, 4]) == [22, 50, 4, -9, 10, 1, 40, 41, -6, -4]", "assert rotate_list([41, 26, 4, 31, 50, 28, 1, 12, 37]) == [12, 37, 41, 26, 4, 31, 50, 28, 1]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([11, 26, 18, 14]) == [14, 11, 26, 18]\nassert rotate_list([33, 24, 42, 3, 20]) == [42, 3, 20, 33, 24]\nassert rotate_list([36, 34, 9, 38, 17, 47, -6, 49, 36, 45]) == [49, 36, 45, 36, 34, 9, 38, 17, 47, -6]\nassert rotate_list([24, 32]) == [32, 24]\nassert rotate_list([-9, 10, 1, 40, 41, -6, -4, 22, 50, 4]) == [22, 50, 4, -9, 10, 1, 40, 41, -6, -4]\nassert rotate_list([41, 26, 4, 31, 50, 28, 1, 12, 37]) == [12, 37, 41, 26, 4, 31, 50, 28, 1]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([11, 26, 18, 14])` يُرجع `[14, 11, 26, 18]`.\nالجواب:", "qhash": "c4b311c7745fc31a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حصان رمل سفينة حديقة') == 0", "assert words_starting('تفاحة باب مدرسة') == 1", "assert words_starting('عمل سلام قهوة تفاحة حديقة حصان') == 1", "assert words_starting('تفاحة فجر طالب تفاحة') == 2", "assert words_starting('قلم رمل سماء تفاحة عربية برمجة طالب') == 1", "assert words_starting('عربية تفاحة حاسوب تفاحة') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('حصان رمل سفينة حديقة') == 0\nassert words_starting('تفاحة باب مدرسة') == 1\nassert words_starting('عمل سلام قهوة تفاحة حديقة حصان') == 1\nassert words_starting('تفاحة فجر طالب تفاحة') == 2\nassert words_starting('قلم رمل سماء تفاحة عربية برمجة طالب') == 1\nassert words_starting('عربية تفاحة حاسوب تفاحة') == 2\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.split():\n if w.endswith('ت'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ت»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef words_starting(text):\n count = 0\n for w in text.split():\n if w.endswith('ت'):\n count += 1\n return count\n```\nمثال: `words_starting('حصان رمل سفينة حديقة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f185e806764d57cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 95707\nsteps = 0\nwhile m > 15:\n m = m // 6\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 95707\nsteps = 0\nwhile m > 15:\n m = m // 6\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "53a0fce0fdf702c2", "answer": "12 5", "completion": " الناتج:\n```text\n12 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل برمجة حديقة سماء عربية علم جبل') == 2", "assert count_prefix('جبل ليل ليل جبل سيارة طالب') == 2", "assert count_prefix('سماء جمل جمل قلم') == 2", "assert count_prefix('جبل طالب ميناء معلم ميناء') == 1", "assert count_prefix('جمل معلم جبل عمل قلم') == 2", "assert count_prefix('خبز فجر نهر معلم ليل جبل وردة') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('جبل برمجة حديقة سماء عربية علم جبل') == 2\nassert count_prefix('جبل ليل ليل جبل سيارة طالب') == 2\nassert count_prefix('سماء جمل جمل قلم') == 2\nassert count_prefix('جبل طالب ميناء معلم ميناء') == 1\nassert count_prefix('جمل معلم جبل عمل قلم') == 2\nassert count_prefix('خبز فجر نهر معلم ليل جبل وردة') == 1\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:\n if w.startswith('ج'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ج»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_prefix(line):\n count = 0\n for w in line:\n if w.startswith('ج'):\n count += 1\n return count\n```\nمثال: `count_prefix('جبل برمجة حديقة سماء عربية علم جبل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "fabf1184e202de67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert game(20) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19', 'Buzz']", "assert game(19) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19']", "assert game(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19', 'Buzz', 'Fizz']", "assert game(3) == ['1', '2', 'Fizz']", "assert game(16) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16']"], "test_code": "assert game(20) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19', 'Buzz']\nassert game(19) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19']\nassert game(21) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19', 'Buzz', 'Fizz']\nassert game(3) == ['1', '2', 'Fizz']\nassert game(16) == ['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Fizz'، وعلى 10 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(20)` يجب أن تُرجع `['1', '2', 'Fizz', '4', '5', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'Fizz', '16', '17', 'Fizz', '19', 'Buzz']`.\nالجواب:", "qhash": "6827ac78210d9ba8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 12\nfor x in range(5, 23, 1):\n result += x * 5\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 12\nfor x in range(5, 23, 1):\n result += x * 5\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "727eba39c25f2840", "answer": "1227\n22", "completion": " الناتج:\n```text\n1227\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(26) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', '24', 'Hi', '26']", "assert fizzbuzz(10) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi']", "assert fizzbuzz(4) == ['1', '2', '3', '4']", "assert fizzbuzz(25) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', '24', 'Hi']", "assert fizzbuzz(20) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi']"], "test_code": "assert fizzbuzz(26) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', '24', 'Hi', '26']\nassert fizzbuzz(10) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi']\nassert fizzbuzz(4) == ['1', '2', '3', '4']\nassert fizzbuzz(25) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', '24', 'Hi']\nassert fizzbuzz(20) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 9 == 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 % 5 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Hi'، وعلى 9 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(26)` يجب أن تُرجع `['1', '2', '3', '4', 'Hi', '6', '7', '8', 'Yo', 'Hi', '11', '12', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', '24', 'Hi', '26']`.\nالجواب:", "qhash": "e7c3fff5b3335099"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 997", "tests": ["assert step_product(9) == 162", "assert step_product(41) == 667", "assert step_product(50) == 325", "assert step_product(7) == 28", "assert step_product(3) == 3", "assert step_product(14) == 356", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 162\nassert step_product(41) == 667\nassert step_product(50) == 325\nassert step_product(7) == 28\nassert step_product(3) == 3\nassert step_product(14) == 356\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 997", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(9)` يُرجع `162`.\nالجواب:", "qhash": "a2686afa4b8363bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'راشد': 41, 'خالد': 47, 'هشام': 7, 'أحمد': 29, 'علي': 29}\npoints['أحمد'] += 3\npoints['عمر'] = 22\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 = {'راشد': 41, 'خالد': 47, 'هشام': 7, 'أحمد': 29, 'علي': 29}\npoints['أحمد'] += 3\npoints['عمر'] = 22\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": "eb9c698a3206dabd", "answer": "6\nخالد\n178\n[('هشام', 7), ('عمر', 22)]", "completion": " الناتج:\n```text\n6\nخالد\n178\n[('هشام', 7), ('عمر', 22)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -4)", "tests": ["assert pick_between([-7, -6, -1, -12, -16, -10]) == [-50, -35, -30]", "assert pick_between([13, 51, 16, 33, -19, 16]) == []", "assert pick_between([-25, -27, 24, 22, 21, 16, 44]) == []", "assert pick_between([15, 56, -14, 26, -11, -6, -6, 45, -1]) == [-30, -30]", "assert pick_between([-8]) == [-40]", "assert pick_between([-11, 16, -1, 23, 23]) == []", "assert pick_between([26]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-7, -6, -1, -12, -16, -10]) == [-50, -35, -30]\nassert pick_between([13, 51, 16, 33, -19, 16]) == []\nassert pick_between([-25, -27, 24, 22, 21, 16, 44]) == []\nassert pick_between([15, 56, -14, 26, -11, -6, -6, 45, -1]) == [-30, -30]\nassert pick_between([-8]) == [-40]\nassert pick_between([-11, 16, -1, 23, 23]) == []\nassert pick_between([26]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -4)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 5 for x in xs if -10 <= x <= -4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -10 و-4 (شاملًا الطرفين) في 5.\nمثال: `pick_between([-7, -6, -1, -12, -16, -10])` يجب أن تُرجع `[-50, -35, -30]`.\nالجواب:", "qhash": "a0b1d152fb3adacf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 92959\ncount = 0\nwhile n > 18:\n n = n // 5\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 92959\ncount = 0\nwhile n > 18:\n n = n // 5\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "209e63488a621199", "answer": "5 6", "completion": " الناتج:\n```text\n5 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "tests": ["assert sum_powers(5) == 660", "assert sum_powers(0) == 0", "assert sum_powers(15) == 14880", "assert sum_powers(4) == 360", "assert sum_powers(6) == 1092", "assert sum_powers(1) == 12", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 660\nassert sum_powers(0) == 0\nassert sum_powers(15) == 14880\nassert sum_powers(4) == 360\nassert sum_powers(6) == 1092\nassert sum_powers(1) == 12\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(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_powers(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_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 2\n return total\n```\nمثال: `sum_powers(5)` يجب أن تُرجع `660`.\nالجواب:", "qhash": "ae51ddb12e210fb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('summer an an orange') == 'orange_an_an_summer'", "assert mirror_words('cloud') == 'cloud'", "assert mirror_words('winter falcon camel') == 'camel_falcon_winter'", "assert mirror_words('it a coffee data signal by a vector') == 'vector_by_signal_data_coffee_it'", "assert mirror_words('river code on') == 'on_code_river'", "assert mirror_words('light up river banana by up coffee light') == 'light_coffee_up_by_banana_river_up_light'", "assert mirror_words('') == ''"], "test_code": "assert mirror_words('summer an an orange') == 'orange_an_an_summer'\nassert mirror_words('cloud') == 'cloud'\nassert mirror_words('winter falcon camel') == 'camel_falcon_winter'\nassert mirror_words('it a coffee data signal by a vector') == 'vector_by_signal_data_coffee_it'\nassert mirror_words('river code on') == 'on_code_river'\nassert mirror_words('light up river banana by up coffee light') == 'light_coffee_up_by_banana_river_up_light'\nassert mirror_words('') == ''", "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('summer an an orange')` يجب أن تُرجع `'orange_an_an_summer'`.\nالجواب:", "qhash": "6d52d8fcfe74d9e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 27) == 1)", "tests": ["assert count_gcd1(150) == 100", "assert count_gcd1(141) == 94", "assert count_gcd1(107) == 72", "assert count_gcd1(95) == 64", "assert count_gcd1(45) == 30", "assert count_gcd1(164) == 110", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(150) == 100\nassert count_gcd1(141) == 94\nassert count_gcd1(107) == 72\nassert count_gcd1(95) == 64\nassert count_gcd1(45) == 30\nassert count_gcd1(164) == 110\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, 27) == 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, 27) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 27، أي أن القاسم المشترك الأكبر لها مع 27 يساوي 1.\nمثال: `count_gcd1(150)` يجب أن تُرجع `100`.\nالجواب:", "qhash": "3a3d04741b075c42"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 1 for x in xs if -1 <= x <= 32)", "tests": ["assert filter_range([0, 37, 23, 16, 15, 2, 28]) == [0, 2, 15, 16, 23, 28]", "assert filter_range([29, -18]) == [29]", "assert filter_range([14, 3, 13, -20, -4, -20, 57, 26]) == [3, 13, 14, 26]", "assert filter_range([]) == []", "assert filter_range([-29, -23, 42]) == []", "assert filter_range([9, 29, 28, -25, 37]) == [9, 28, 29]", "assert filter_range([40, 10, 42, 31, -2, 24]) == [10, 24, 31]", "assert filter_range([]) == []"], "test_code": "assert filter_range([0, 37, 23, 16, 15, 2, 28]) == [0, 2, 15, 16, 23, 28]\nassert filter_range([29, -18]) == [29]\nassert filter_range([14, 3, 13, -20, -4, -20, 57, 26]) == [3, 13, 14, 26]\nassert filter_range([]) == []\nassert filter_range([-29, -23, 42]) == []\nassert filter_range([9, 29, 28, -25, 37]) == [9, 28, 29]\nassert filter_range([40, 10, 42, 31, -2, 24]) == [10, 24, 31]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 1 for x in xs if -1 <= x <= 32)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 1 for x in xs if -1 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -1 و32 (شاملًا الطرفين) في 1.\nمثال: `filter_range([0, 37, 23, 16, 15, 2, 28])` يجب أن تُرجع `[0, 2, 15, 16, 23, 28]`.\nالجواب:", "qhash": "1c182ba3d3eb00f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 10) // 3 for x in range(3, 12) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 10) // 3 for x in range(3, 12) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "6fed1b14cde54957", "answer": "[5, 6, 7]\n3 18", "completion": " الناتج:\n```text\n[5, 6, 7]\n3 18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [17, 13, 12, 5, 13, 16]\nprint(data[0:2])\nprint(data[::3])\nprint(len(data[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [17, 13, 12, 5, 13, 16]\nprint(data[0:2])\nprint(data[::3])\nprint(len(data[0:2]))\n```\nالجواب:", "qhash": "274f7221fca4bdd3", "answer": "[17, 13]\n[17, 5]\n2", "completion": " الناتج:\n```text\n[17, 13]\n[17, 5]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=4):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(-1))\nprint(g(-1, 17))\nprint(g(g(17), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=4):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(-1))\nprint(g(-1, 17))\nprint(g(g(17), -1))\n```\nالجواب:", "qhash": "5ce4028ef46ff31e", "answer": "31\n135\n1057", "completion": " الناتج:\n```text\n31\n135\n1057\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(-4, 2))", "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(-4, 2))\n```\nالجواب:", "qhash": "87ef1729682cc8d3", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 8 for x in range(-1, 11) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 8 for x in range(-1, 11) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "1307882948bcc813", "answer": "[-8, -4, 8, 28, 56, 92]\n6 172", "completion": " الناتج:\n```text\n[-8, -4, 8, 28, 56, 92]\n6 172\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 67", "tests": ["assert digits_mod(5947) == 55", "assert digits_mod(803227) == 27", "assert digits_mod(868097) == 34", "assert digits_mod(362024) == 55", "assert digits_mod(340692) == 39", "assert digits_mod(753230) == 61", "assert digits_mod(12872) == 1", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(5947) == 55\nassert digits_mod(803227) == 27\nassert digits_mod(868097) == 34\nassert digits_mod(362024) == 55\nassert digits_mod(340692) == 39\nassert digits_mod(753230) == 61\nassert digits_mod(12872) == 1\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 67", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 67.\nمثال: `digits_mod(5947)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "baa334eecc94876d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 19", "tests": ["assert mfact(4) == 5", "assert mfact(33) == 0", "assert mfact(52) == 0", "assert mfact(42) == 0", "assert mfact(21) == 0", "assert mfact(3) == 6", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 5\nassert mfact(33) == 0\nassert mfact(52) == 0\nassert mfact(42) == 0\nassert mfact(21) == 0\nassert mfact(3) == 6\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 19", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(4)` يُرجع `5`.\nالجواب:", "qhash": "fe2c468e1a050e21"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [4, -17, -12, 18, 24, 28, 27]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [4, -17, -12, 18, 24, 28, 27]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ee6a2dfb4c70268c", "answer": "[4, -12, -17, 18, 24, 27, 28]\n[28, 27, 24]", "completion": " الناتج:\n```text\n[4, -12, -17, 18, 24, 27, 28]\n[28, 27, 24]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'أحمد': 24, 'مريم': 26, 'زينب': 1, 'هدى': 16}\nd['مريم'] += 16\nd['منى'] = 49\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 11])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'أحمد': 24, 'مريم': 26, 'زينب': 1, 'هدى': 16}\nd['مريم'] += 16\nd['منى'] = 49\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 11])\n```\nالجواب:", "qhash": "3f2dd64824db86dd", "answer": "5\nمنى\n132\n['أحمد', 'مريم', 'هدى', 'منى']", "completion": " الناتج:\n```text\n5\nمنى\n132\n['أحمد', 'مريم', 'هدى', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([9, 56, 67, 46, 45, 19, 37, 73]) == [9, 65, 132, 0, 45, 64, 101, 0]", "assert capped_cumsum([58, 16, 76, 122, 128]) == [58, 74, 0, 122, 0]", "assert capped_cumsum([57, 81, 130, 95, 105, 125, 59, 125]) == [57, 138, 0, 95, 0, 125, 0, 125]", "assert capped_cumsum([6, 66, 60, -7, 62, 88, 136]) == [6, 72, 132, 125, 0, 88, 0]", "assert capped_cumsum([129, 38, 119, 80, 105, -7, 49, 104, 112]) == [129, 0, 119, 0, 105, 98, 0, 104, 0]", "assert capped_cumsum([62, 32]) == [62, 94]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([9, 56, 67, 46, 45, 19, 37, 73]) == [9, 65, 132, 0, 45, 64, 101, 0]\nassert capped_cumsum([58, 16, 76, 122, 128]) == [58, 74, 0, 122, 0]\nassert capped_cumsum([57, 81, 130, 95, 105, 125, 59, 125]) == [57, 138, 0, 95, 0, 125, 0, 125]\nassert capped_cumsum([6, 66, 60, -7, 62, 88, 136]) == [6, 72, 132, 125, 0, 88, 0]\nassert capped_cumsum([129, 38, 119, 80, 105, -7, 49, 104, 112]) == [129, 0, 119, 0, 105, 98, 0, 104, 0]\nassert capped_cumsum([62, 32]) == [62, 94]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(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 capped_cumsum(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سؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 138 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([9, 56, 67, 46, 45, 19, 37, 73])` يُرجع `[9, 65, 132, 0, 45, 64, 101, 0]`.\nالجواب:", "qhash": "f2218d41e0e67d7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'حسن': 5, 'وليد': 48, 'مريم': 24}\npoints['حسن'] += 7\npoints['راشد'] = 4\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'حسن': 5, 'وليد': 48, 'مريم': 24}\npoints['حسن'] += 7\npoints['راشد'] = 4\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('ليلى', -1))\n```\nالجواب:", "qhash": "67e426edd9c7dcd4", "answer": "4\nوليد\n88\n-1", "completion": " الناتج:\n```text\n4\nوليد\n88\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 89", "tests": ["assert fact_mod(11) == 79", "assert fact_mod(17) == 23", "assert fact_mod(24) == 14", "assert fact_mod(49) == 16", "assert fact_mod(31) == 3", "assert fact_mod(39) == 55", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 79\nassert fact_mod(17) == 23\nassert fact_mod(24) == 14\nassert fact_mod(49) == 16\nassert fact_mod(31) == 3\nassert fact_mod(39) == 55\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 89", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(11)` يُرجع `79`.\nالجواب:", "qhash": "206345fd4e7a91bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 247\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 = 247\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": "5375ede2987b689e", "answer": "47", "completion": " الناتج:\n```text\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(77) == 604", "assert add_multiples(150) == 2184", "assert add_multiples(65) == 462", "assert add_multiples(261) == 6894", "assert add_multiples(189) == 3330", "assert add_multiples(98) == 855", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(77) == 604\nassert add_multiples(150) == 2184\nassert add_multiples(65) == 462\nassert add_multiples(261) == 6894\nassert add_multiples(189) == 3330\nassert add_multiples(98) == 855\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 % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 10.\nمثال: `add_multiples(77)` يجب أن تُرجع `604`.\nالجواب:", "qhash": "02769003bbdba094"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 13:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([4, 2, 1, 9, 6]) == [4, 6, 7, 0, 6]", "assert running_sum([-8, 10, 0, -9, 11, 4, 7, 2, -9]) == [-8, 2, 2, -7, 4, 8, 0, 2, -7]", "assert running_sum([-1]) == [-1]", "assert running_sum([2, -2, 11, -8, -3, -10, 12]) == [2, 0, 11, 3, 0, -10, 2]", "assert running_sum([]) == []", "assert running_sum([-9, 10, 7, -10, -5, 13, -6, 1, -4]) == [-9, 1, 8, -2, -7, 6, 0, 1, -3]", "assert running_sum([]) == []"], "test_code": "assert running_sum([4, 2, 1, 9, 6]) == [4, 6, 7, 0, 6]\nassert running_sum([-8, 10, 0, -9, 11, 4, 7, 2, -9]) == [-8, 2, 2, -7, 4, 8, 0, 2, -7]\nassert running_sum([-1]) == [-1]\nassert running_sum([2, -2, 11, -8, -3, -10, 12]) == [2, 0, 11, 3, 0, -10, 2]\nassert running_sum([]) == []\nassert running_sum([-9, 10, 7, -10, -5, 13, -6, 1, -4]) == [-9, 1, 8, -2, -7, 6, 0, 1, -3]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 13:\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 > 13:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 13 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([4, 2, 1, 9, 6])` يُرجع `[4, 6, 7, 0, 6]`.\nالجواب:", "qhash": "edf3495fdc7caace"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert total_pow(3) == 396", "assert total_pow(0) == 0", "assert total_pow(7) == 8624", "assert total_pow(13) == 91091", "assert total_pow(4) == 1100", "assert total_pow(1) == 11", "assert total_pow(0) == 0"], "test_code": "assert total_pow(3) == 396\nassert total_pow(0) == 0\nassert total_pow(7) == 8624\nassert total_pow(13) == 91091\nassert total_pow(4) == 1100\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 ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `total_pow(3)` يُرجع `396`.\nالجواب:", "qhash": "9c3e20b8ed4cb8ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [14, 13, 40, -10, 18, -20]\nprint(sorted(nums, key=lambda x: (abs(x - 20), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [14, 13, 40, -10, 18, -20]\nprint(sorted(nums, key=lambda x: (abs(x - 20), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "2258e295db2afde4", "answer": "[18, 14, 13, 40, -10, -20]\n[40, 18, 14]", "completion": " الناتج:\n```text\n[18, 14, 13, 40, -10, -20]\n[40, 18, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "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 % 7 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([67, 86, 5, 63, 44, 31, 76, 49, 5, 26, 8]) == 0", "assert how_many_div([77, -15]) == 0", "assert how_many_div([59, 80, 16, 66, 75, 37, -8, -22, 36, 35, 68, 79]) == 1", "assert how_many_div([17, -3, 55, 24, 44, 66]) == 0", "assert how_many_div([22, 63, -10, 36, -32, 20, 84, 38, 25, -16, -31, 75]) == 1", "assert how_many_div([77, -38, 19, 60, 87, -21, -11, -17]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([67, 86, 5, 63, 44, 31, 76, 49, 5, 26, 8]) == 0\nassert how_many_div([77, -15]) == 0\nassert how_many_div([59, 80, 16, 66, 75, 37, -8, -22, 36, 35, 68, 79]) == 1\nassert how_many_div([17, -3, 55, 24, 44, 66]) == 0\nassert how_many_div([22, 63, -10, 36, -32, 20, 84, 38, 25, -16, -31, 75]) == 1\nassert how_many_div([77, -38, 19, 60, 87, -21, -11, -17]) == 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 % 7 != 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 % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 7، ثم اكتب الدالة كاملة.\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, 86, 5, 63, 44, 31, 76, 49, 5, 26, 8])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "36738a2ffcc32f36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سلام نهر وردة تفاحة') == 1", "assert count_start('بحر قلم صحراء سيارة سلام') == 2", "assert count_start('سماء بيت نور مطر شجرة جبل برمجة') == 1", "assert count_start('برتقال مكتبة قهوة صحراء سفينة قلم') == 1", "assert count_start('عمل نهر نور مدرسة') == 0", "assert count_start('مدينة نهر سماء سلام صحراء سيارة') == 3", "assert count_start('') == 0"], "test_code": "assert count_start('سلام نهر وردة تفاحة') == 1\nassert count_start('بحر قلم صحراء سيارة سلام') == 2\nassert count_start('سماء بيت نور مطر شجرة جبل برمجة') == 1\nassert count_start('برتقال مكتبة قهوة صحراء سفينة قلم') == 1\nassert count_start('عمل نهر نور مدرسة') == 0\nassert count_start('مدينة نهر سماء سلام صحراء سيارة') == 3\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('سلام نهر وردة تفاحة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "a9bebe1d6906f167"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([19, 54, 32, 56, 58, 9, -10, -23]) == 54", "assert best_multiple([-18, -36, -45]) == -18", "assert best_multiple([1]) == None", "assert best_multiple([-14, 0, -38, 7, -36, 22, 33, 30, 9]) == 9", "assert best_multiple([1, 3, 1, 34, 38, -41]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([19, 54, 32, 56, 58, 9, -10, -23]) == 54\nassert best_multiple([-18, -36, -45]) == -18\nassert best_multiple([1]) == None\nassert best_multiple([-14, 0, -38, 7, -36, 22, 33, 30, 9]) == 9\nassert best_multiple([1, 3, 1, 34, 38, -41]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([19, 54, 32, 56, 58, 9, -10, -23])` يجب أن تُرجع `54`.\nالجواب:", "qhash": "dc436e952a910e1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 14", "tests": ["assert digit_power(58178) == 9", "assert digit_power(618265) == 0", "assert digit_power(295099) == 10", "assert digit_power(145862) == 2", "assert digit_power(603093) == 5", "assert digit_power(430915) == 8", "assert digit_power(194870) == 11", "assert digit_power(0) == 0"], "test_code": "assert digit_power(58178) == 9\nassert digit_power(618265) == 0\nassert digit_power(295099) == 10\nassert digit_power(145862) == 2\nassert digit_power(603093) == 5\nassert digit_power(430915) == 8\nassert digit_power(194870) == 11\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 14", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 14\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 14.\nللتوضيح: الاستدعاء `digit_power(58178)` يُرجع `9`.\nالجواب:", "qhash": "a4c41457fbb4aa4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def 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 max_div([-17, 25, 53, 57, -20, 24, 37, 14, 41]) == None", "assert max_div([-45, -9, -9]) == -9", "assert max_div([1]) == None", "assert max_div([-1, 22, 21, -34]) == None", "assert max_div([7, -5, -22, -23, 0, -29, 30, 23, 49]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([-17, 25, 53, 57, -20, 24, 37, 14, 41]) == None\nassert max_div([-45, -9, -9]) == -9\nassert max_div([1]) == None\nassert max_div([-1, 22, 21, -34]) == None\nassert max_div([7, -5, -22, -23, 0, -29, 30, 23, 49]) == 0\nassert max_div([]) == None", "answer": "def 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 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 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 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مثال: `max_div([-17, 25, 53, 57, -20, 24, 37, 14, 41])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "6e48081243d6ad87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)", "tests": ["assert total_multiples(190) == 4595", "assert total_multiples(115) == 1745", "assert total_multiples(121) == 1980", "assert total_multiples(90) == 1041", "assert total_multiples(84) == 872", "assert total_multiples(48) == 297", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(190) == 4595\nassert total_multiples(115) == 1745\nassert total_multiples(121) == 1980\nassert total_multiples(90) == 1041\nassert total_multiples(84) == 872\nassert total_multiples(48) == 297\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 % 12 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(190)` يُرجع `4595`.\nالجواب:", "qhash": "eae7544a4093d246"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 21) == 1)", "tests": ["assert coprime_count(35) == 20", "assert coprime_count(155) == 89", "assert coprime_count(66) == 38", "assert coprime_count(162) == 92", "assert coprime_count(129) == 74", "assert coprime_count(32) == 19", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(35) == 20\nassert coprime_count(155) == 89\nassert coprime_count(66) == 38\nassert coprime_count(162) == 92\nassert coprime_count(129) == 74\nassert coprime_count(32) == 19\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, 21) == 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, 21) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 21) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(35)` يُرجع `20`.\nالجواب:", "qhash": "be35b7b5fc5cdc6b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'سلام ميناء'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.find('ل'))\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'سلام ميناء'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.find('ل'))\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "0b3124482b5310fd", "answer": "9\n1\nسلام-ميناء", "completion": " الناتج:\n```text\n9\n1\nسلام-ميناء\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [25, -4, 18, 27, 27]\nprint(xs[3:5])\nprint(xs[::3])\nprint(len(xs[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [25, -4, 18, 27, 27]\nprint(xs[3:5])\nprint(xs[::3])\nprint(len(xs[3:5]))\n```\nالجواب:", "qhash": "10272f67d694e3df", "answer": "[27, 27]\n[25, 27]\n2", "completion": " الناتج:\n```text\n[27, 27]\n[25, 27]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('music we orange river') == 'qywmg ai sverki vmziv'", "assert shift_letters('signal matrix of to !') == 'wmkrep qexvmb sj xs !'", "assert shift_letters('summer river light python') == 'wyqqiv vmziv pmklx tcxlsr'", "assert shift_letters('in in apple') == 'mr mr ettpi'", "assert shift_letters('rocket brain garden A1') == 'vsgoix fvemr kevhir A1'", "assert shift_letters('a winter') == 'e amrxiv'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('music we orange river') == 'qywmg ai sverki vmziv'\nassert shift_letters('signal matrix of to !') == 'wmkrep qexvmb sj xs !'\nassert shift_letters('summer river light python') == 'wyqqiv vmziv pmklx tcxlsr'\nassert shift_letters('in in apple') == 'mr mr ettpi'\nassert shift_letters('rocket brain garden A1') == 'vsgoix fvemr kevhir A1'\nassert shift_letters('a winter') == 'e amrxiv'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('music we orange river')` يُرجع `'qywmg ai sverki vmziv'`.\nالجواب:", "qhash": "da3073ebfb964eeb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_sel([53, 35, 56, 75, 6, 29, 49, 74, 21, 86, 85]) == 3", "assert count_sel([11, 31, 35, -26, -36, 20, 68, 62, -9]) == 0", "assert count_sel([75]) == 0", "assert count_sel([63, 26, 67, 2, 81, -30, -14, -9, 24, 32]) == 2", "assert count_sel([]) == 0", "assert count_sel([-38, -40, 0, -16, -24, 85, -36, 41, -38, -5]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([53, 35, 56, 75, 6, 29, 49, 74, 21, 86, 85]) == 3\nassert count_sel([11, 31, 35, -26, -36, 20, 68, 62, -9]) == 0\nassert count_sel([75]) == 0\nassert count_sel([63, 26, 67, 2, 81, -30, -14, -9, 24, 32]) == 2\nassert count_sel([]) == 0\nassert count_sel([-38, -40, 0, -16, -24, 85, -36, 41, -38, -5]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([53, 35, 56, 75, 6, 29, 49, 74, 21, 86, 85])` يُرجع `3`.\nالجواب:", "qhash": "f8ec206967e00c47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert shift_list([20, 50, 13, 0, 38, 1]) == [13, 0, 38, 1, 20, 50]", "assert shift_list([22, 37, -5, 50, 21, 36, 5, 1, 48]) == [36, 5, 1, 48, 22, 37, -5, 50, 21]", "assert shift_list([18, 35, 6, 39, -7, 33, 15, 4]) == [15, 4, 18, 35, 6, 39, -7, 33]", "assert shift_list([37, 44, -2, -7, 30, 40, 10, 49, 3, 34, 14, 30]) == [-2, -7, 30, 40, 10, 49, 3, 34, 14, 30, 37, 44]", "assert shift_list([-1, 20, 2, 12, 50, 22, 6, -6, 18, 12, 28, -9]) == [2, 12, 50, 22, 6, -6, 18, 12, 28, -9, -1, 20]", "assert shift_list([42, 47, 6, 43, 7, 31, 41, -7, 9, 46, -5, 18]) == [6, 43, 7, 31, 41, -7, 9, 46, -5, 18, 42, 47]", "assert shift_list([]) == []"], "test_code": "assert shift_list([20, 50, 13, 0, 38, 1]) == [13, 0, 38, 1, 20, 50]\nassert shift_list([22, 37, -5, 50, 21, 36, 5, 1, 48]) == [36, 5, 1, 48, 22, 37, -5, 50, 21]\nassert shift_list([18, 35, 6, 39, -7, 33, 15, 4]) == [15, 4, 18, 35, 6, 39, -7, 33]\nassert shift_list([37, 44, -2, -7, 30, 40, 10, 49, 3, 34, 14, 30]) == [-2, -7, 30, 40, 10, 49, 3, 34, 14, 30, 37, 44]\nassert shift_list([-1, 20, 2, 12, 50, 22, 6, -6, 18, 12, 28, -9]) == [2, 12, 50, 22, 6, -6, 18, 12, 28, -9, -1, 20]\nassert shift_list([42, 47, 6, 43, 7, 31, 41, -7, 9, 46, -5, 18]) == [6, 43, 7, 31, 41, -7, 9, 46, -5, 18, 42, 47]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nمثال: `shift_list([20, 50, 13, 0, 38, 1])` يجب أن تُرجع `[13, 0, 38, 1, 20, 50]`.\nالجواب:", "qhash": "43ffc208a03919d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 22\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 = 22\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": "36849bbbd2aa0a13", "answer": "15", "completion": " الناتج:\n```text\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(g(20))\nprint(g(20, 13))\nprint(g(g(13), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(g(20))\nprint(g(20, 13))\nprint(g(g(13), 20))\n```\nالجواب:", "qhash": "6c8110afd7d8242d", "answer": "140\n127\n617", "completion": " الناتج:\n```text\n140\n127\n617\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 6)", "tests": ["assert filter_range([15, 8, 11, -10, 5]) == [20]", "assert filter_range([9, -7, 37, 26, -6]) == [-28, -24]", "assert filter_range([39, 0, 17, 11]) == [0]", "assert filter_range([24, 21, -13, 3, -24, 32, 56, 15, 59, -16]) == [12]", "assert filter_range([45, 44, 45]) == []", "assert filter_range([33, 52, -4, -29, -21, 55]) == [-16]", "assert filter_range([-3, 59, 16, 9, 60, 33, -12, 34, -5]) == [-20, -12]", "assert filter_range([]) == []"], "test_code": "assert filter_range([15, 8, 11, -10, 5]) == [20]\nassert filter_range([9, -7, 37, 26, -6]) == [-28, -24]\nassert filter_range([39, 0, 17, 11]) == [0]\nassert filter_range([24, 21, -13, 3, -24, 32, 56, 15, 59, -16]) == [12]\nassert filter_range([45, 44, 45]) == []\nassert filter_range([33, 52, -4, -29, -21, 55]) == [-16]\nassert filter_range([-3, 59, 16, 9, 60, 33, -12, 34, -5]) == [-20, -12]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 6)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 4 for x in xs if -7 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و6 (شاملًا الطرفين) في 4.\nمثال: `filter_range([15, 8, 11, -10, 5])` يجب أن تُرجع `[20]`.\nالجواب:", "qhash": "6e5998d05097351c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('برمجة مدينة') == 0", "assert lead_count('دفتر طائرة') == 0", "assert lead_count('نهر صحراء رمل حديقة وردة') == 1", "assert lead_count('نهار علم قمر نور') == 2", "assert lead_count('حصان صديق نور') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('نور حصان بيت نهار مدرسة تفاحة') == 2\nassert lead_count('برمجة مدينة') == 0\nassert lead_count('دفتر طائرة') == 0\nassert lead_count('نهر صحراء رمل حديقة وردة') == 1\nassert lead_count('نهار علم قمر نور') == 2\nassert lead_count('حصان صديق نور') == 1\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.split():\n if 'ن' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ن»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef lead_count(line):\n count = 0\n for w in line.split():\n if 'ن' in w:\n count += 1\n return count\n```\nمثال: `lead_count('نور حصان بيت نهار مدرسة تفاحة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "e602cbc5b4ef4ca0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(9))\nprint(h(9, -1))\nprint(h(h(-1), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(9))\nprint(h(9, -1))\nprint(h(h(-1), 9))\n```\nالجواب:", "qhash": "33b729f52203ba68", "answer": "70\n73\n111", "completion": " الناتج:\n```text\n70\n73\n111\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 71", "tests": ["assert digit_score(24086) == 20", "assert digit_score(71615) == 20", "assert digit_score(493785) == 36", "assert digit_score(267834) == 30", "assert digit_score(584423) == 26", "assert digit_score(541543) == 22", "assert digit_score(306260) == 17", "assert digit_score(0) == 0"], "test_code": "assert digit_score(24086) == 20\nassert digit_score(71615) == 20\nassert digit_score(493785) == 36\nassert digit_score(267834) == 30\nassert digit_score(584423) == 26\nassert digit_score(541543) == 22\nassert digit_score(306260) == 17\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 71", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 71.\nللتوضيح: الاستدعاء `digit_score(24086)` يُرجع `20`.\nالجواب:", "qhash": "ff4c3247c05e43c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 11", "tests": ["assert fact_mod(4) == 8", "assert fact_mod(8) == 10", "assert fact_mod(7) == 6", "assert fact_mod(24) == 0", "assert fact_mod(7) == 6", "assert fact_mod(35) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 8\nassert fact_mod(8) == 10\nassert fact_mod(7) == 6\nassert fact_mod(24) == 0\nassert fact_mod(7) == 6\nassert fact_mod(35) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 11", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(4)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "a99e3cc1ea69baba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 95", "tests": ["assert pow_digits(21758) == 14", "assert pow_digits(317612) == 91", "assert pow_digits(296043) == 40", "assert pow_digits(650677) == 39", "assert pow_digits(559437) == 4", "assert pow_digits(879837) == 66", "assert pow_digits(339766) == 31", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(21758) == 14\nassert pow_digits(317612) == 91\nassert pow_digits(296043) == 40\nassert pow_digits(650677) == 39\nassert pow_digits(559437) == 4\nassert pow_digits(879837) == 66\nassert pow_digits(339766) == 31\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 95", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 95.\nمثال: `pow_digits(21758)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "88dc34aa40269143"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('light music banana light winter') == 'ebzam fnlbv utgtgt ebzam pbgmxk'", "assert encode('table data rocket rocket') == 'mtuex wtmt khvdxm khvdxm'", "assert encode('vector brain coffee of') == 'oxvmhk uktbg vhyyxx hy'", "assert encode('in desert rocket to') == 'bg wxlxkm khvdxm mh'", "assert encode('table rocket garden to a') == 'mtuex khvdxm ztkwxg mh t'", "assert encode('light light to apple camel A1') == 'ebzam ebzam mh tiiex vtfxe A1'", "assert encode('') == ''"], "test_code": "assert encode('light music banana light winter') == 'ebzam fnlbv utgtgt ebzam pbgmxk'\nassert encode('table data rocket rocket') == 'mtuex wtmt khvdxm khvdxm'\nassert encode('vector brain coffee of') == 'oxvmhk uktbg vhyyxx hy'\nassert encode('in desert rocket to') == 'bg wxlxkm khvdxm mh'\nassert encode('table rocket garden to a') == 'mtuex khvdxm ztkwxg mh t'\nassert encode('light light to apple camel A1') == 'ebzam ebzam mh tiiex vtfxe A1'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('light music banana light winter')` يُرجع `'ebzam fnlbv utgtgt ebzam pbgmxk'`.\nالجواب:", "qhash": "4a5f48ea001ba41f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 187:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([58, 88, 78, 2, 81, 92]) == [58, 146, 0, 2, 83, 175]", "assert capped_cumsum([-7, 175, 98, 123, 120, 76, 63, 128, 63]) == [-7, 168, 0, 123, 0, 76, 139, 0, 63]", "assert capped_cumsum([51, 2, 185]) == [51, 53, 0]", "assert capped_cumsum([104]) == [104]", "assert capped_cumsum([135, 108, 113]) == [135, 0, 113]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([58, 88, 78, 2, 81, 92]) == [58, 146, 0, 2, 83, 175]\nassert capped_cumsum([-7, 175, 98, 123, 120, 76, 63, 128, 63]) == [-7, 168, 0, 123, 0, 76, 139, 0, 63]\nassert capped_cumsum([51, 2, 185]) == [51, 53, 0]\nassert capped_cumsum([104]) == [104]\nassert capped_cumsum([135, 108, 113]) == [135, 0, 113]\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 > 187:\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 > 187:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 187 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([58, 88, 78, 2, 81, 92])` يُرجع `[58, 146, 0, 2, 83, 175]`.\nالجواب:", "qhash": "6c6b9cef1152e5d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'cd'}", "tests": ["assert tally('desert banana matrix of of an') == {'c': 0, 'd': 1}", "assert tally('a a') == {'c': 0, 'd': 0}", "assert tally('we to go') == {'c': 0, 'd': 0}", "assert tally('on light coffee table at of') == {'c': 1, 'd': 0}", "assert tally('a') == {'c': 0, 'd': 0}", "assert tally('brain coffee by summer') == {'c': 1, 'd': 0}", "assert tally('') == {'c': 0, 'd': 0}"], "test_code": "assert tally('desert banana matrix of of an') == {'c': 0, 'd': 1}\nassert tally('a a') == {'c': 0, 'd': 0}\nassert tally('we to go') == {'c': 0, 'd': 0}\nassert tally('on light coffee table at of') == {'c': 1, 'd': 0}\nassert tally('a') == {'c': 0, 'd': 0}\nassert tally('brain coffee by summer') == {'c': 1, 'd': 0}\nassert tally('') == {'c': 0, 'd': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'cd'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'cd'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'd' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('desert banana matrix of of an')` يجب أن تُرجع `{'c': 0, 'd': 1}`.\nالجواب:", "qhash": "5d4c2d643865abb8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'brain_vector'\nprint(s.upper())\nprint(len(s))\nprint(s.index('e') + len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'brain_vector'\nprint(s.upper())\nprint(len(s))\nprint(s.index('e') + len(s))\n```\nالجواب:", "qhash": "166c68baf4f22bd8", "answer": "BRAIN_VECTOR\n12\n19", "completion": " الناتج:\n```text\nBRAIN_VECTOR\n12\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'عمل حصان'\nprint(w[0])\nprint(w.split())\nprint(w.count('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'عمل حصان'\nprint(w[0])\nprint(w.split())\nprint(w.count('ر'))\n```\nالجواب:", "qhash": "42f7712d031d8783", "answer": "ع\n['عمل', 'حصان']\n0", "completion": " الناتج:\n```text\nع\n['عمل', 'حصان']\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('winter planet orange apple garden we') == 'we/garden/apple/orange/planet/winter'", "assert backwards('an an') == 'an/an'", "assert backwards('') == ''", "assert backwards('go to vector cloud brain on') == 'on/brain/cloud/vector/to/go'", "assert backwards('at matrix') == 'matrix/at'", "assert backwards('matrix light orange') == 'orange/light/matrix'", "assert backwards('apple signal') == 'signal/apple'"], "test_code": "assert backwards('winter planet orange apple garden we') == 'we/garden/apple/orange/planet/winter'\nassert backwards('an an') == 'an/an'\nassert backwards('') == ''\nassert backwards('go to vector cloud brain on') == 'on/brain/cloud/vector/to/go'\nassert backwards('at matrix') == 'matrix/at'\nassert backwards('matrix light orange') == 'orange/light/matrix'\nassert backwards('apple signal') == 'signal/apple'", "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('winter planet orange apple garden we')` يجب أن تُرجع `'we/garden/apple/orange/planet/winter'`.\nالجواب:", "qhash": "20042f574a11e3fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_special([71, 32, 60, 74, 80, 29, 63, 63, 86, 71, 4]) == 6", "assert count_special([8, 61, 48, 85, 90, -40, -25, 10, -21, 66, 36, 46]) == 6", "assert count_special([-2, 12, 54, 89, -16, 8]) == 4", "assert count_special([2, 27, 33, 76, 34, 67, 79]) == 3", "assert count_special([36]) == 0", "assert count_special([86, 6]) == 2", "assert count_special([]) == 0"], "test_code": "assert count_special([71, 32, 60, 74, 80, 29, 63, 63, 86, 71, 4]) == 6\nassert count_special([8, 61, 48, 85, 90, -40, -25, 10, -21, 66, 36, 46]) == 6\nassert count_special([-2, 12, 54, 89, -16, 8]) == 4\nassert count_special([2, 27, 33, 76, 34, 67, 79]) == 3\nassert count_special([36]) == 0\nassert count_special([86, 6]) == 2\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([71, 32, 60, 74, 80, 29, 63, 63, 86, 71, 4])` يُرجع `6`.\nالجواب:", "qhash": "b903cb70bc93aaf3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 18", "tests": ["assert digit_power(29551) == 4", "assert digit_power(888261) == 15", "assert digit_power(91592) == 8", "assert digit_power(595167) == 15", "assert digit_power(316605) == 3", "assert digit_power(581952) == 12", "assert digit_power(438522) == 6", "assert digit_power(0) == 0"], "test_code": "assert digit_power(29551) == 4\nassert digit_power(888261) == 15\nassert digit_power(91592) == 8\nassert digit_power(595167) == 15\nassert digit_power(316605) == 3\nassert digit_power(581952) == 12\nassert digit_power(438522) == 6\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 18", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 18\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 18.\nللتوضيح: الاستدعاء `digit_power(29551)` يُرجع `4`.\nالجواب:", "qhash": "268011a7b9f1fd19"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 3 * x ** 2 + (1) * x + (5)", "tests": ["assert poly(6) == 119", "assert poly(-1) == 7", "assert poly(-5) == 75", "assert poly(-4) == 49", "assert poly(-7) == 145", "assert poly(-8) == 189", "assert poly(-7) == 145", "assert poly(0) == 5"], "test_code": "assert poly(6) == 119\nassert poly(-1) == 7\nassert poly(-5) == 75\nassert poly(-4) == 49\nassert poly(-7) == 145\nassert poly(-8) == 189\nassert poly(-7) == 145\nassert poly(0) == 5", "answer": "def poly(x):\n return 3 * x ** 2 + (1) * x + (5)", "completion": " ```python\ndef poly(x):\n return 3 * x ** 2 + (1) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 3x² + 1x + 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(6)` يُرجع `119`.\nالجواب:", "qhash": "cb32e22db2bafcf2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'music'\nprint(name[-1:])\nprint(name.count('u'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'music'\nprint(name[-1:])\nprint(name.count('u'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "a0883a15bd29dfd4", "answer": "c\n1\ncisum", "completion": " الناتج:\n```text\nc\n1\ncisum\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('to desert garden') == 'garden/desert'", "assert reverse_words('a in music orange code') == 'code/orange/music'", "assert reverse_words('stone cloud signal banana') == 'banana/signal/cloud/stone'", "assert reverse_words('') == ''", "assert reverse_words('brain desert banana falcon stone') == 'stone/falcon/banana/desert/brain'", "assert reverse_words('vector go rocket data at light we') == 'light/data/rocket/vector'", "assert reverse_words('table apple') == 'apple/table'"], "test_code": "assert reverse_words('to desert garden') == 'garden/desert'\nassert reverse_words('a in music orange code') == 'code/orange/music'\nassert reverse_words('stone cloud signal banana') == 'banana/signal/cloud/stone'\nassert reverse_words('') == ''\nassert reverse_words('brain desert banana falcon stone') == 'stone/falcon/banana/desert/brain'\nassert reverse_words('vector go rocket data at light we') == 'light/data/rocket/vector'\nassert reverse_words('table apple') == 'apple/table'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `reverse_words('to desert garden')` يُرجع `'garden/desert'`.\nالجواب:", "qhash": "54d0e08ff015686d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 3\nfor i in range(-3, 20, 4):\n total += i * 2\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 3\nfor i in range(-3, 20, 4):\n total += i * 2\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "b54e04dbb5888278", "answer": "87\n17", "completion": " الناتج:\n```text\n87\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'خالد': 25, 'باسل': 47, 'نور': 1, 'هشام': 43, 'سعيد': 27}\nd['سعيد'] += 13\nd['راشد'] = 22\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 = {'خالد': 25, 'باسل': 47, 'نور': 1, 'هشام': 43, 'سعيد': 27}\nd['سعيد'] += 13\nd['راشد'] = 22\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": "ffad7ebfe0ab1321", "answer": "6\nباسل\n178\n['باسل', 'هشام', 'سعيد']", "completion": " الناتج:\n```text\n6\nباسل\n178\n['باسل', 'هشام', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(f(9))\nprint(f(9, 6))\nprint(f(f(6), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(f(9))\nprint(f(9, 6))\nprint(f(f(6), 9))\n```\nالجواب:", "qhash": "1cbae938edd25dbe", "answer": "-5\n-6\n-5", "completion": " الناتج:\n```text\n-5\n-6\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "tests": ["assert weighted_sum(3) == 828", "assert weighted_sum(1) == 3", "assert weighted_sum(12) == 1892124", "assert weighted_sum(4) == 3900", "assert weighted_sum(11) == 1145628", "assert weighted_sum(1) == 3", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 828\nassert weighted_sum(1) == 3\nassert weighted_sum(12) == 1892124\nassert weighted_sum(4) == 3900\nassert weighted_sum(11) == 1145628\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 ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(3)` يُرجع `828`.\nالجواب:", "qhash": "fba370a3822b4df3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 16\nfor n in range(3, 22, 3):\n s += n * 3\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 16\nfor n in range(3, 22, 3):\n s += n * 3\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "b5014a22708cf87d", "answer": "268\n21", "completion": " الناتج:\n```text\n268\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(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 largest_div([34, 23, -14, 47, -7, -17]) == None", "assert largest_div([-60, -12, -24]) == -12", "assert largest_div([1, 13, 25, 37]) == None", "assert largest_div([-37, -8, 12, -34, -5, 39, -27, -25, -5]) == 12", "assert largest_div([-48, 4, 11, -13, -6]) == -48", "assert largest_div([]) == None"], "test_code": "assert largest_div([34, 23, -14, 47, -7, -17]) == None\nassert largest_div([-60, -12, -24]) == -12\nassert largest_div([1, 13, 25, 37]) == None\nassert largest_div([-37, -8, 12, -34, -5, 39, -27, -25, -5]) == 12\nassert largest_div([-48, 4, 11, -13, -6]) == -48\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(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مثال: `largest_div([34, 23, -14, 47, -7, -17])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "38d536ca20cdadc4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "tests": ["assert sum_digit_pow(35683) == 19", "assert sum_digit_pow(127772) == 10", "assert sum_digit_pow(231581) == 8", "assert sum_digit_pow(148254) == 34", "assert sum_digit_pow(712208) == 58", "assert sum_digit_pow(578033) == 72", "assert sum_digit_pow(864389) == 62", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(35683) == 19\nassert sum_digit_pow(127772) == 10\nassert sum_digit_pow(231581) == 8\nassert sum_digit_pow(148254) == 34\nassert sum_digit_pow(712208) == 58\nassert sum_digit_pow(578033) == 72\nassert sum_digit_pow(864389) == 62\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 74\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 74.\nللتوضيح: الاستدعاء `sum_digit_pow(35683)` يُرجع `19`.\nالجواب:", "qhash": "33780d6664c2c40a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 19\nfor x in range(10, 28, 2):\n result += x * 1\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 19\nfor x in range(10, 28, 2):\n result += x * 1\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "7a0ae68d0aaef87a", "answer": "181\n26", "completion": " الناتج:\n```text\n181\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-13, -7, 2, 1, 14, 7, -1, 4, 20]) == None", "assert best_multiple([-9, -18, -9]) == -9", "assert best_multiple([1, 10]) == None", "assert best_multiple([15, 25, 29, 16, 24, 4, 31, -12]) == None", "assert best_multiple([19, -11, 32, 17, 14]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-13, -7, 2, 1, 14, 7, -1, 4, 20]) == None\nassert best_multiple([-9, -18, -9]) == -9\nassert best_multiple([1, 10]) == None\nassert best_multiple([15, 25, 29, 16, 24, 4, 31, -12]) == None\nassert best_multiple([19, -11, 32, 17, 14]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(arr):\n best = 0\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 best_multiple(arr):\n best = 0\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للتوضيح: الاستدعاء `best_multiple([-13, -7, 2, 1, 14, 7, -1, 4, 20])` يُرجع `None`.\nالجواب:", "qhash": "769b5fe9c770d12f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 9 * x ** 2 + (-3) * x + (-4)", "tests": ["assert eval_poly(6) == 302", "assert eval_poly(-11) == 1118", "assert eval_poly(-14) == 1802", "assert eval_poly(0) == -4", "assert eval_poly(10) == 866", "assert eval_poly(0) == -4", "assert eval_poly(15) == 1976", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(6) == 302\nassert eval_poly(-11) == 1118\nassert eval_poly(-14) == 1802\nassert eval_poly(0) == -4\nassert eval_poly(10) == 866\nassert eval_poly(0) == -4\nassert eval_poly(15) == 1976\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return 9 * x ** 2 + (-3) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return 9 * x ** 2 + (-3) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 9x² - 3x - 4 عند العدد الصحيح x.\nمثال: `eval_poly(6)` يجب أن تُرجع `302`.\nالجواب:", "qhash": "d241e1ed78f617b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert backwards('window code window matrix brain rocket falcon by') == 'falcon-rocket-brain-matrix-window-code-window'", "assert backwards('') == ''", "assert backwards('garden brain signal') == 'signal-brain-garden'", "assert backwards('we by') == ''", "assert backwards('') == ''", "assert backwards('table engine in') == 'engine-table'", "assert backwards('banana signal orange signal') == 'signal-orange-signal-banana'"], "test_code": "assert backwards('window code window matrix brain rocket falcon by') == 'falcon-rocket-brain-matrix-window-code-window'\nassert backwards('') == ''\nassert backwards('garden brain signal') == 'signal-brain-garden'\nassert backwards('we by') == ''\nassert backwards('') == ''\nassert backwards('table engine in') == 'engine-table'\nassert backwards('banana signal orange signal') == 'signal-orange-signal-banana'", "answer": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `backwards(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `backwards('window code window matrix brain rocket falcon by')` يجب أن تُرجع `'falcon-rocket-brain-matrix-window-code-window'`.\nالجواب:", "qhash": "22da79d79d30becf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-27, 59, 33, 13, 32, 1, 2]) == None", "assert biggest_mult([-30, -10, -10]) == -10", "assert biggest_mult([1, 11, 21]) == None", "assert biggest_mult([-26, 11, 24, 20, 38, 24, 36, -29]) == 20", "assert biggest_mult([33, -23, 39, 26]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-27, 59, 33, 13, 32, 1, 2]) == None\nassert biggest_mult([-30, -10, -10]) == -10\nassert biggest_mult([1, 11, 21]) == None\nassert biggest_mult([-26, 11, 24, 20, 38, 24, 36, -29]) == 20\nassert biggest_mult([33, -23, 39, 26]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 == 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 % 10 == 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 % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([-27, 59, 33, 13, 32, 1, 2])` يُرجع `None`.\nالجواب:", "qhash": "ed6d5937c0edecda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ع»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('لغة نهر حديقة')` يُرجع `0`.\nالجواب:", "qhash": "4c4c0b628f654850"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 344\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 = 344\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": "bdcf3a3c92d26b9a", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=8):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(-10))\nprint(g(-10, -1))\nprint(g(g(-1), -10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=8):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(-10))\nprint(g(-10, -1))\nprint(g(g(-1), -10))\n```\nالجواب:", "qhash": "fe7182c0e69f67d4", "answer": "30\n-15\n205", "completion": " الناتج:\n```text\n30\n-15\n205\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 10\nfor i in range(-2, 6, 3):\n acc += i * 7\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 10\nfor i in range(-2, 6, 3):\n acc += i * 7\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "9663469709e7f782", "answer": "31\n4", "completion": " الناتج:\n```text\n31\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 3:\n return 2\n return 2 * rec(n - 1) + -1\n\nprint(rec(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 3:\n return 2\n return 2 * rec(n - 1) + -1\n\nprint(rec(6))\n```\nالجواب:", "qhash": "12fc5b0c29f1f658", "answer": "9", "completion": " الناتج:\n```text\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([31, 66, 11, 10, 69, 23, 26]) == 0", "assert div_not([38, -4, 34]) == 0", "assert div_not([]) == 0", "assert div_not([67]) == 0", "assert div_not([-1, -11, -23, -31, 80, 11, -14]) == 0", "assert div_not([]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([31, 66, 11, 10, 69, 23, 26]) == 0\nassert div_not([38, -4, 34]) == 0\nassert div_not([]) == 0\nassert div_not([67]) == 0\nassert div_not([-1, -11, -23, -31, 80, 11, -14]) == 0\nassert div_not([]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `div_not([31, 66, 11, 10, 69, 23, 26])` يُرجع `0`.\nالجواب:", "qhash": "5088a84ecc1356e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 0 for x in range(-5, 3) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 0 for x in range(-5, 3) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "9ee9bfaf6c58f083", "answer": "[16, 4, 0, 4]\n4 24", "completion": " الناتج:\n```text\n[16, 4, 0, 4]\n4 24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 273\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 = 273\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": "eaba9f20e0ca5572", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'engine'\nprint(s[::-1])\nprint(s.count('g'))\nprint(s[2:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'engine'\nprint(s[::-1])\nprint(s.count('g'))\nprint(s[2:4])\n```\nالجواب:", "qhash": "68ced5cc4055d4c7", "answer": "enigne\n1\ngi", "completion": " الناتج:\n```text\nenigne\n1\ngi\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 51", "tests": ["assert digit_power(84400) == 34", "assert digit_power(981819) == 36", "assert digit_power(653307) == 42", "assert digit_power(976912) == 16", "assert digit_power(671791) == 22", "assert digit_power(547399) == 16", "assert digit_power(245339) == 17", "assert digit_power(0) == 0"], "test_code": "assert digit_power(84400) == 34\nassert digit_power(981819) == 36\nassert digit_power(653307) == 42\nassert digit_power(976912) == 16\nassert digit_power(671791) == 22\nassert digit_power(547399) == 16\nassert digit_power(245339) == 17\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 51", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 51\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 51.\nللتوضيح: الاستدعاء `digit_power(84400)` يُرجع `34`.\nالجواب:", "qhash": "fe334cefafbac89d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([2, 12, 23, 25, 13, 22, 18, 9]) == [2, 14, 37, 0, 13, 35, 0, 9]", "assert reset_sum([28, 30, -8, 14, 25, -7, 26]) == [28, 0, -8, 6, 31, 24, 0]", "assert reset_sum([24, 20, -10, 33, 9, 3]) == [24, 0, -10, 23, 32, 35]", "assert reset_sum([]) == []", "assert reset_sum([-5, 19]) == [-5, 14]", "assert reset_sum([23, 5, 10, 4, 30, 39, 0]) == [23, 28, 38, 0, 30, 0, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([2, 12, 23, 25, 13, 22, 18, 9]) == [2, 14, 37, 0, 13, 35, 0, 9]\nassert reset_sum([28, 30, -8, 14, 25, -7, 26]) == [28, 0, -8, 6, 31, 24, 0]\nassert reset_sum([24, 20, -10, 33, 9, 3]) == [24, 0, -10, 23, 32, 35]\nassert reset_sum([]) == []\nassert reset_sum([-5, 19]) == [-5, 14]\nassert reset_sum([23, 5, 10, 4, 30, 39, 0]) == [23, 28, 38, 0, 30, 0, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 41:\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 > 41:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 41 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([2, 12, 23, 25, 13, 22, 18, 9])` يُرجع `[2, 14, 37, 0, 13, 35, 0, 9]`.\nالجواب:", "qhash": "fd570ee1efe87e5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'agr'}", "tests": ["assert tally('go vector') == {'a': 0, 'g': 1, 'r': 1}", "assert tally('a matrix') == {'a': 2, 'g': 0, 'r': 1}", "assert tally('winter banana in brain rocket summer') == {'a': 4, 'g': 0, 'r': 4}", "assert tally('in of summer python window') == {'a': 0, 'g': 0, 'r': 1}", "assert tally('pixel coffee camel apple of') == {'a': 2, 'g': 0, 'r': 0}", "assert tally('orange go orange') == {'a': 2, 'g': 3, 'r': 2}", "assert tally('') == {'a': 0, 'g': 0, 'r': 0}"], "test_code": "assert tally('go vector') == {'a': 0, 'g': 1, 'r': 1}\nassert tally('a matrix') == {'a': 2, 'g': 0, 'r': 1}\nassert tally('winter banana in brain rocket summer') == {'a': 4, 'g': 0, 'r': 4}\nassert tally('in of summer python window') == {'a': 0, 'g': 0, 'r': 1}\nassert tally('pixel coffee camel apple of') == {'a': 2, 'g': 0, 'r': 0}\nassert tally('orange go orange') == {'a': 2, 'g': 3, 'r': 2}\nassert tally('') == {'a': 0, 'g': 0, 'r': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'agr'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'agr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'g'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('go vector')` يجب أن تُرجع `{'a': 0, 'g': 1, 'r': 1}`.\nالجواب:", "qhash": "100fd2fabe8f6842"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [-9, 30, 33, 15, 15, 28, -9, 29, -5]\nprint(data[0:2])\nprint(data[::-1])\nprint(max(data[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [-9, 30, 33, 15, 15, 28, -9, 29, -5]\nprint(data[0:2])\nprint(data[::-1])\nprint(max(data[0:2]))\n```\nالجواب:", "qhash": "db755385c8394209", "answer": "[-9, 30]\n[-5, 29, -9, 28, 15, 15, 33, 30, -9]\n30", "completion": " الناتج:\n```text\n[-9, 30]\n[-5, 29, -9, 28, 15, 15, 33, 30, -9]\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 6 for x in range(6, 14) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 6 for x in range(6, 14) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "72a8b7f7b21dac24", "answer": "[43, 138]\n2 181", "completion": " الناتج:\n```text\n[43, 138]\n2 181\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 18\nfor i in range(4, 19, 1):\n s -= i * 2\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 18\nfor i in range(4, 19, 1):\n s -= i * 2\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "5627f76a64433414", "answer": "-312\n18", "completion": " الناتج:\n```text\n-312\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'at'}", "tests": ["assert tally('banana matrix window') == {'a': 4, 't': 1}", "assert tally('coffee desert stone in up camel') == {'a': 1, 't': 2}", "assert tally('in engine coffee code') == {'a': 0, 't': 0}", "assert tally('we') == {'a': 0, 't': 0}", "assert tally('cloud in vector summer data python') == {'a': 2, 't': 3}", "assert tally('rocket vector vector falcon go') == {'a': 1, 't': 3}", "assert tally('') == {'a': 0, 't': 0}"], "test_code": "assert tally('banana matrix window') == {'a': 4, 't': 1}\nassert tally('coffee desert stone in up camel') == {'a': 1, 't': 2}\nassert tally('in engine coffee code') == {'a': 0, 't': 0}\nassert tally('we') == {'a': 0, 't': 0}\nassert tally('cloud in vector summer data python') == {'a': 2, 't': 3}\nassert tally('rocket vector vector falcon go') == {'a': 1, 't': 3}\nassert tally('') == {'a': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'at'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'at'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('banana matrix window')` يجب أن تُرجع `{'a': 4, 't': 1}`.\nالجواب:", "qhash": "9de798fe13f84918"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 6) // 5 for x in range(5, 20) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 6) // 5 for x in range(5, 20) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "f5bf500deef049e3", "answer": "[2, 3, 4]\n3 9", "completion": " الناتج:\n```text\n[2, 3, 4]\n3 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('banana code') == 'ferere gshi'", "assert rotate_letters('cloud') == 'gpsyh'", "assert rotate_letters('summer is table planet table') == 'wyqqiv mw xefpi tperix xefpi'", "assert rotate_letters('matrix pixel is falcon in') == 'qexvmb tmbip mw jepgsr mr'", "assert rotate_letters('code garden it OK') == 'gshi kevhir mx OK'", "assert rotate_letters('matrix Hello') == 'qexvmb Hipps'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('banana code') == 'ferere gshi'\nassert rotate_letters('cloud') == 'gpsyh'\nassert rotate_letters('summer is table planet table') == 'wyqqiv mw xefpi tperix xefpi'\nassert rotate_letters('matrix pixel is falcon in') == 'qexvmb tmbip mw jepgsr mr'\nassert rotate_letters('code garden it OK') == 'gshi kevhir mx OK'\nassert rotate_letters('matrix Hello') == 'qexvmb Hipps'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('banana code')` يُرجع `'ferere gshi'`.\nالجواب:", "qhash": "e50bfc618271d1fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('python table an coffee river') == 'river coffee an table python'", "assert flip_words('falcon in by coffee') == 'coffee by in falcon'", "assert flip_words('it in planet go') == 'go planet in it'", "assert flip_words('orange') == 'orange'", "assert flip_words('rocket apple') == 'apple rocket'", "assert flip_words('pixel code planet') == 'planet code pixel'", "assert flip_words('') == ''"], "test_code": "assert flip_words('python table an coffee river') == 'river coffee an table python'\nassert flip_words('falcon in by coffee') == 'coffee by in falcon'\nassert flip_words('it in planet go') == 'go planet in it'\nassert flip_words('orange') == 'orange'\nassert flip_words('rocket apple') == 'apple rocket'\nassert flip_words('pixel code planet') == 'planet code pixel'\nassert flip_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `flip_words('python table an coffee river')` يُرجع `'river coffee an table python'`.\nالجواب:", "qhash": "91166db1a948ff93"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17']", "assert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17', 'Yo', '19', '20', 'Hi', '22', '23']", "assert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo']", "assert label_numbers(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17']", "assert label_numbers(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16']"], "test_code": "assert label_numbers(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17']\nassert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17', 'Yo', '19', '20', 'Hi', '22', '23']\nassert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo']\nassert label_numbers(17) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17']\nassert label_numbers(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Hi'، وإن قَبِلها على 9 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(17)` يُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', 'Yo', '10', '11', '12', '13', 'Hi', '15', '16', '17']`.\nالجواب:", "qhash": "75d08843f1678509"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('is at music 2024') == 'vf ng zhfvp 2024'", "assert shift_text('vector code') == 'irpgbe pbqr'", "assert shift_text('apple at') == 'nccyr ng'", "assert shift_text('it to river a') == 'vg gb evire n'", "assert shift_text('it brain pixel camel cloud A1') == 'vg oenva cvkry pnzry pybhq A1'", "assert shift_text('table') == 'gnoyr'", "assert shift_text('') == ''"], "test_code": "assert shift_text('is at music 2024') == 'vf ng zhfvp 2024'\nassert shift_text('vector code') == 'irpgbe pbqr'\nassert shift_text('apple at') == 'nccyr ng'\nassert shift_text('it to river a') == 'vg gb evire n'\nassert shift_text('it brain pixel camel cloud A1') == 'vg oenva cvkry pnzry pybhq A1'\nassert shift_text('table') == 'gnoyr'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('is at music 2024')` يُرجع `'vf ng zhfvp 2024'`.\nالجواب:", "qhash": "a9123d756cd26d9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([28, 45, -29, 21, 47, 9, 12]) == 12", "assert find_max_div([-18, -6, -18]) == -6", "assert find_max_div([1, 7, 13, 19]) == None", "assert find_max_div([]) == None", "assert find_max_div([5, 15, -12, 9, 12, 9, -3, -31, 10]) == 12", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([28, 45, -29, 21, 47, 9, 12]) == 12\nassert find_max_div([-18, -6, -18]) == -6\nassert find_max_div([1, 7, 13, 19]) == None\nassert find_max_div([]) == None\nassert find_max_div([5, 15, -12, 9, 12, 9, -3, -31, 10]) == 12\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `find_max_div([28, 45, -29, 21, 47, 9, 12])` يجب أن تُرجع `12`.\nالجواب:", "qhash": "9aedd77a30986f5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [-8, 14, -8, 37, 28, 33, 35]\nprint(a[2:3])\nprint(a[::2])\nprint(min(a[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [-8, 14, -8, 37, 28, 33, 35]\nprint(a[2:3])\nprint(a[::2])\nprint(min(a[2:3]))\n```\nالجواب:", "qhash": "62b25d02797a554f", "answer": "[-8]\n[-8, -8, 28, 35]\n-8", "completion": " الناتج:\n```text\n[-8]\n[-8, -8, 28, 35]\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(g(5))\nprint(g(5, 15))\nprint(g(g(15), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(g(5))\nprint(g(5, 15))\nprint(g(g(15), 5))\n```\nالجواب:", "qhash": "0b4b010e43bdd7d6", "answer": "41\n65\n199", "completion": " الناتج:\n```text\n41\n65\n199\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59", "tests": ["assert mfact(4) == 4", "assert mfact(34) == 57", "assert mfact(58) == 48", "assert mfact(7) == 28", "assert mfact(48) == 56", "assert mfact(58) == 48", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 4\nassert mfact(34) == 57\nassert mfact(58) == 48\nassert mfact(7) == 28\nassert mfact(48) == 56\nassert mfact(58) == 48\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(4)` يُرجع `4`.\nالجواب:", "qhash": "54b4b0251f960135"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'زينب': 17, 'هشام': 33, 'نور': 15}\nd['زينب'] += 8\nd['عمر'] = 34\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('زينب', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'زينب': 17, 'هشام': 33, 'نور': 15}\nd['زينب'] += 8\nd['عمر'] = 34\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('زينب', -1))\n```\nالجواب:", "qhash": "9c2c45632fddca6a", "answer": "4\nعمر\n107\n25", "completion": " الناتج:\n```text\n4\nعمر\n107\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 35) == 1)", "tests": ["assert coprimes(46) == 32", "assert coprimes(98) == 67", "assert coprimes(180) == 124", "assert coprimes(5) == 4", "assert coprimes(128) == 88", "assert coprimes(86) == 59", "assert coprimes(1) == 1"], "test_code": "assert coprimes(46) == 32\nassert coprimes(98) == 67\nassert coprimes(180) == 124\nassert coprimes(5) == 4\nassert coprimes(128) == 88\nassert coprimes(86) == 59\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, 35) == 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, 35) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 35، أي أن القاسم المشترك الأكبر لها مع 35 يساوي 1.\nمثال: `coprimes(46)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "a04378fdece8236c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "label_numbers", "reference": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Tic'\n if i % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(28) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15', 'Tic', '17', '18', '19', 'TicTac', '21', '22', '23', 'Tic', '25', '26', '27', 'Tic']", "assert label_numbers(9) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9']", "assert label_numbers(9) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9']", "assert label_numbers(17) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15', 'Tic', '17']", "assert label_numbers(15) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15']"], "test_code": "assert label_numbers(28) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15', 'Tic', '17', '18', '19', 'TicTac', '21', '22', '23', 'Tic', '25', '26', '27', 'Tic']\nassert label_numbers(9) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9']\nassert label_numbers(9) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9']\nassert label_numbers(17) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15', 'Tic', '17']\nassert label_numbers(15) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(28)` يُرجع `['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', '9', 'Tac', '11', 'Tic', '13', '14', '15', 'Tic', '17', '18', '19', 'TicTac', '21', '22', '23', 'Tic', '25', '26', '27', 'Tic']`.\nالجواب:", "qhash": "291e56d17d93e60f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 5", "tests": ["assert digits_mod(36931) == 0", "assert digits_mod(425385) == 1", "assert digits_mod(402512) == 1", "assert digits_mod(288843) == 0", "assert digits_mod(592298) == 1", "assert digits_mod(199938) == 2", "assert digits_mod(278342) == 2", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(36931) == 0\nassert digits_mod(425385) == 1\nassert digits_mod(402512) == 1\nassert digits_mod(288843) == 0\nassert digits_mod(592298) == 1\nassert digits_mod(199938) == 2\nassert digits_mod(278342) == 2\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 5", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 5.\nللتوضيح: الاستدعاء `digits_mod(36931)` يُرجع `0`.\nالجواب:", "qhash": "beb6c19ac6fcc4be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 2 for x in range(3, 18) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 2 for x in range(3, 18) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d18a052c6d505d80", "answer": "[7, 34, 79, 142, 223]\n5 485", "completion": " الناتج:\n```text\n[7, 34, 79, 142, 223]\n5 485\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(12))\nprint(compute(12, -4))\nprint(compute(compute(-4), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(12))\nprint(compute(12, -4))\nprint(compute(compute(-4), 12))\n```\nالجواب:", "qhash": "354d19fcff65ec85", "answer": "-51\n-44\n-64", "completion": " الناتج:\n```text\n-51\n-44\n-64\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([-10, 43, -9, -6, 28]) == 28", "assert find_max_div([-35, -14, -14]) == -14", "assert find_max_div([1, 8, 15]) == None", "assert find_max_div([17, 13, -1, 30]) == None", "assert find_max_div([44, -19, -13, -39, 8]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-10, 43, -9, -6, 28]) == 28\nassert find_max_div([-35, -14, -14]) == -14\nassert find_max_div([1, 8, 15]) == None\nassert find_max_div([17, 13, -1, 30]) == None\nassert find_max_div([44, -19, -13, -39, 8]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(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 find_max_div(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مثال: `find_max_div([-10, 43, -9, -6, 28])` يجب أن تُرجع `28`.\nالجواب:", "qhash": "76cab2112220a8e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [1, 15, 7, 6, 1, 22, 35, 33, 29]\nprint(items[3:4])\nprint(items[::3])\nprint(min(items[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [1, 15, 7, 6, 1, 22, 35, 33, 29]\nprint(items[3:4])\nprint(items[::3])\nprint(min(items[3:4]))\n```\nالجواب:", "qhash": "24d5c01c466b2d4c", "answer": "[6]\n[1, 6, 35]\n6", "completion": " الناتج:\n```text\n[6]\n[1, 6, 35]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 5 for x in range(5, 15) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 5 for x in range(5, 15) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "122ac9aff13aa26a", "answer": "[44, 139]\n2 183", "completion": " الناتج:\n```text\n[44, 139]\n2 183\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(863294779))\nprint(rec(rec(863294779)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(863294779))\nprint(rec(rec(863294779)))\n```\nالجواب:", "qhash": "d42e0f1932e7edc4", "answer": "55\n10", "completion": " الناتج:\n```text\n55\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('river it') == 'tkxgt kv'", "assert caesar('river orange go table a') == 'tkxgt qtcpig iq vcdng c'", "assert caesar('light at') == 'nkijv cv'", "assert caesar('window') == 'ykpfqy'", "assert caesar('winter we 2024') == 'ykpvgt yg 2024'", "assert caesar('is stone we Hello') == 'ku uvqpg yg Hgnnq'", "assert caesar('') == ''"], "test_code": "assert caesar('river it') == 'tkxgt kv'\nassert caesar('river orange go table a') == 'tkxgt qtcpig iq vcdng c'\nassert caesar('light at') == 'nkijv cv'\nassert caesar('window') == 'ykpfqy'\nassert caesar('winter we 2024') == 'ykpvgt yg 2024'\nassert caesar('is stone we Hello') == 'ku uvqpg yg Hgnnq'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('river it')` يجب أن تُرجع `'tkxgt kv'`.\nالجواب:", "qhash": "7ae5085b888d0b46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 150:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([63, 68, 47, 29, 8]) == [63, 131, 0, 29, 37]", "assert capped_cumsum([20, 79, 100, 48, 108, 99, 103]) == [20, 99, 0, 48, 0, 99, 0]", "assert capped_cumsum([37, 27, -1]) == [37, 64, 63]", "assert capped_cumsum([78]) == [78]", "assert capped_cumsum([103, 58, 103, -6, 135]) == [103, 0, 103, 97, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([63, 68, 47, 29, 8]) == [63, 131, 0, 29, 37]\nassert capped_cumsum([20, 79, 100, 48, 108, 99, 103]) == [20, 99, 0, 48, 0, 99, 0]\nassert capped_cumsum([37, 27, -1]) == [37, 64, 63]\nassert capped_cumsum([78]) == [78]\nassert capped_cumsum([103, 58, 103, -6, 135]) == [103, 0, 103, 97, 0]\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 > 150:\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 > 150:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 150 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([63, 68, 47, 29, 8])` يُرجع `[63, 131, 0, 29, 37]`.\nالجواب:", "qhash": "2f83fc82b4323b36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('هشام', 5), ('ليلى', 20), ('يوسف', 98), ('خالد', 49)]\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 = [('هشام', 5), ('ليلى', 20), ('يوسف', 98), ('خالد', 49)]\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": "87589464afd9a0b9", "answer": "[('هشام', 5), ('ليلى', 20), ('خالد', 49), ('يوسف', 98)]\n['يوسف', 'خالد']", "completion": " الناتج:\n```text\n[('هشام', 5), ('ليلى', 20), ('خالد', 49), ('يوسف', 98)]\n['يوسف', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 7\nfor j in range(-1, 15, 4):\n s -= j * 4\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 7\nfor j in range(-1, 15, 4):\n s -= j * 4\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "f0755befc927643a", "answer": "-73\n11", "completion": " الناتج:\n```text\n-73\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_special([43, 65, 47, 50, 21, 90, 43, 73]) == 1", "assert count_special([83, -19, -10, 88, 23, 79, -40]) == 0", "assert count_special([-32, 68, 49, -22, 73, 2]) == 1", "assert count_special([-12, 35, 39, 87, 0, 53, 41, 33, 85, 40, -33]) == 1", "assert count_special([-40, -28, 13, -3, 27, -3, 53, 39, 30, 59]) == 0", "assert count_special([19, -32, 43, 21, 76, 35, 30, 2, 85]) == 2", "assert count_special([]) == 0"], "test_code": "assert count_special([43, 65, 47, 50, 21, 90, 43, 73]) == 1\nassert count_special([83, -19, -10, 88, 23, 79, -40]) == 0\nassert count_special([-32, 68, 49, -22, 73, 2]) == 1\nassert count_special([-12, 35, 39, 87, 0, 53, 41, 33, 85, 40, -33]) == 1\nassert count_special([-40, -28, 13, -3, 27, -3, 53, 39, 30, 59]) == 0\nassert count_special([19, -32, 43, 21, 76, 35, 30, 2, 85]) == 2\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 7 == 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 % 7 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 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([43, 65, 47, 50, 21, 90, 43, 73])` يُرجع `1`.\nالجواب:", "qhash": "eaa2b792c8b76b01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'سفينة'\nprint(w.count('ت'))\nprint(w[-1])\nprint('ت' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'سفينة'\nprint(w.count('ت'))\nprint(w[-1])\nprint('ت' in w)\n```\nالجواب:", "qhash": "972069d625ea00ea", "answer": "0\nة\nFalse", "completion": " الناتج:\n```text\n0\nة\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([4, 20, 40, 39, 46, 0, 27, 25]) == [46, 0, 27, 25, 4, 20, 40, 39]", "assert shift_list([38]) == [38]", "assert shift_list([38, 45, -5, 2, 27, -5, 19, 5]) == [27, -5, 19, 5, 38, 45, -5, 2]", "assert shift_list([50, 25, 8, 1, 26, 40, -4, 6, 23, 41, 42, 5]) == [23, 41, 42, 5, 50, 25, 8, 1, 26, 40, -4, 6]", "assert shift_list([16, 12, -9, 21, -3, 8, 44, 13]) == [-3, 8, 44, 13, 16, 12, -9, 21]", "assert shift_list([19, 19, 28, 14, -8, 46]) == [28, 14, -8, 46, 19, 19]", "assert shift_list([]) == []"], "test_code": "assert shift_list([4, 20, 40, 39, 46, 0, 27, 25]) == [46, 0, 27, 25, 4, 20, 40, 39]\nassert shift_list([38]) == [38]\nassert shift_list([38, 45, -5, 2, 27, -5, 19, 5]) == [27, -5, 19, 5, 38, 45, -5, 2]\nassert shift_list([50, 25, 8, 1, 26, 40, -4, 6, 23, 41, 42, 5]) == [23, 41, 42, 5, 50, 25, 8, 1, 26, 40, -4, 6]\nassert shift_list([16, 12, -9, 21, -3, 8, 44, 13]) == [-3, 8, 44, 13, 16, 12, -9, 21]\nassert shift_list([19, 19, 28, 14, -8, 46]) == [28, 14, -8, 46, 19, 19]\nassert shift_list([]) == []", "answer": "def shift_list(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 shift_list(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 shift_list(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return ____\n```\nمثال: `shift_list([4, 20, 40, 39, 46, 0, 27, 25])` يجب أن تُرجع `[46, 0, 27, 25, 4, 20, 40, 39]`.\nالجواب:", "qhash": "ccc3424e3490800b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'cloud'\nprint(name[0:2])\nprint(name.find('o'))\nprint(name.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'cloud'\nprint(name[0:2])\nprint(name.find('o'))\nprint(name.upper())\n```\nالجواب:", "qhash": "ab4fa189bffff703", "answer": "cl\n2\nCLOUD", "completion": " الناتج:\n```text\ncl\n2\nCLOUD\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('بحر حصان ماء مكتبة حاسوب') == 2", "assert prefix_hits('كتاب بحر دفتر حديقة سلام نهر') == 1", "assert prefix_hits('حصان سوق حاسوب') == 2", "assert prefix_hits('ميناء جبل صحراء صحراء طالب ماء حصان') == 1", "assert prefix_hits('قمر عربية لغة ماء') == 0", "assert prefix_hits('شجرة قهوة قمر دفتر') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('بحر حصان ماء مكتبة حاسوب') == 2\nassert prefix_hits('كتاب بحر دفتر حديقة سلام نهر') == 1\nassert prefix_hits('حصان سوق حاسوب') == 2\nassert prefix_hits('ميناء جبل صحراء صحراء طالب ماء حصان') == 1\nassert prefix_hits('قمر عربية لغة ماء') == 0\nassert prefix_hits('شجرة قهوة قمر دفتر') == 0\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('بحر حصان ماء مكتبة حاسوب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "a014f98d0188b935"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([28, 27, 4, 4, 8, 15, 40, 31]) == [4, 8, 15, 40, 31, 28, 27, 4]", "assert shift_list([-2, 6, 7, 25, -3]) == [6, 7, 25, -3, -2]", "assert shift_list([6]) == [6]", "assert shift_list([3, 14, 14, 15]) == [15, 3, 14, 14]", "assert shift_list([37, 6, 42, 31, 38, 40, 26, 17, 50, 33, 20, -8]) == [-8, 37, 6, 42, 31, 38, 40, 26, 17, 50, 33, 20]", "assert shift_list([36, 34, 48, 16, 9, 4, 32, -7]) == [16, 9, 4, 32, -7, 36, 34, 48]", "assert shift_list([]) == []"], "test_code": "assert shift_list([28, 27, 4, 4, 8, 15, 40, 31]) == [4, 8, 15, 40, 31, 28, 27, 4]\nassert shift_list([-2, 6, 7, 25, -3]) == [6, 7, 25, -3, -2]\nassert shift_list([6]) == [6]\nassert shift_list([3, 14, 14, 15]) == [15, 3, 14, 14]\nassert shift_list([37, 6, 42, 31, 38, 40, 26, 17, 50, 33, 20, -8]) == [-8, 37, 6, 42, 31, 38, 40, 26, 17, 50, 33, 20]\nassert shift_list([36, 34, 48, 16, 9, 4, 32, -7]) == [16, 9, 4, 32, -7, 36, 34, 48]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([28, 27, 4, 4, 8, 15, 40, 31])` يُرجع `[4, 8, 15, 40, 31, 28, 27, 4]`.\nالجواب:", "qhash": "adff9e2027b001eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(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 running_sum([58, 28, 79, 44, 80]) == [58, 86, 165, 0, 80]", "assert running_sum([196, 36, 61, 25]) == [196, 0, 61, 86]", "assert running_sum([7]) == [7]", "assert running_sum([123, 2, 139, 166]) == [123, 125, 0, 166]", "assert running_sum([175, 36, 163, 56, 115]) == [175, 0, 163, 0, 115]", "assert running_sum([145, 197]) == [145, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([58, 28, 79, 44, 80]) == [58, 86, 165, 0, 80]\nassert running_sum([196, 36, 61, 25]) == [196, 0, 61, 86]\nassert running_sum([7]) == [7]\nassert running_sum([123, 2, 139, 166]) == [123, 125, 0, 166]\nassert running_sum([175, 36, 163, 56, 115]) == [175, 0, 163, 0, 115]\nassert running_sum([145, 197]) == [145, 0]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 200 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([58, 28, 79, 44, 80])` يجب أن تُرجع `[58, 86, 165, 0, 80]`.\nالجواب:", "qhash": "918a254451badb3c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('we Hello') == 'rz Hzggj'", "assert caesar('window light orange') == 'rdiyjr gdbco jmvibz'", "assert caesar('signal') == 'ndbivg'", "assert caesar('matrix river an garden camel A1') == 'hvomds mdqzm vi bvmyzi xvhzg A1'", "assert caesar('camel !') == 'xvhzg !'", "assert caesar('of we coffee camel planet 2024') == 'ja rz xjaazz xvhzg kgvizo 2024'", "assert caesar('') == ''"], "test_code": "assert caesar('we Hello') == 'rz Hzggj'\nassert caesar('window light orange') == 'rdiyjr gdbco jmvibz'\nassert caesar('signal') == 'ndbivg'\nassert caesar('matrix river an garden camel A1') == 'hvomds mdqzm vi bvmyzi xvhzg A1'\nassert caesar('camel !') == 'xvhzg !'\nassert caesar('of we coffee camel planet 2024') == 'ja rz xjaazz xvhzg kgvizo 2024'\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 + (21)) % 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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('we Hello')` يُرجع `'rz Hzggj'`.\nالجواب:", "qhash": "b7ebbe582e210996"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'وليد': 3, 'حسن': 17, 'خالد': 1}\npoints['وليد'] += 15\npoints['سعيد'] = 26\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 19])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'وليد': 3, 'حسن': 17, 'خالد': 1}\npoints['وليد'] += 15\npoints['سعيد'] = 26\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 19])\n```\nالجواب:", "qhash": "0382eecc80f8c520", "answer": "4\nسعيد\n62\n['سعيد']", "completion": " الناتج:\n```text\n4\nسعيد\n62\n['سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([-17, -12, 3, 38, 32, 50, 35, 51, 37]) == 50", "assert biggest_mult([-15, -20, -5]) == -5", "assert biggest_mult([1, 6]) == None", "assert biggest_mult([-4, 8, -4, 24, -20, -1]) == -20", "assert biggest_mult([-12, -32, -26, -8, 10, -41, -46, -48]) == 10", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-17, -12, 3, 38, 32, 50, 35, 51, 37]) == 50\nassert biggest_mult([-15, -20, -5]) == -5\nassert biggest_mult([1, 6]) == None\nassert biggest_mult([-4, 8, -4, 24, -20, -1]) == -20\nassert biggest_mult([-12, -32, -26, -8, 10, -41, -46, -48]) == 10\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(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مثال: `biggest_mult([-17, -12, 3, 38, 32, 50, 35, 51, 37])` يجب أن تُرجع `50`.\nالجواب:", "qhash": "f1978eef072ddd12"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('pixel data signal river cloud rocket') == 'rocket_cloud_river_signal_data_pixel'", "assert rev_long_words('brain desert light on cloud in') == 'cloud_light_desert_brain'", "assert rev_long_words('we up river vector planet') == 'planet_vector_river'", "assert rev_long_words('') == ''", "assert rev_long_words('apple is to river in window brain') == 'brain_window_river_apple'", "assert rev_long_words('of we vector go stone') == 'stone_vector'", "assert rev_long_words('it') == ''"], "test_code": "assert rev_long_words('pixel data signal river cloud rocket') == 'rocket_cloud_river_signal_data_pixel'\nassert rev_long_words('brain desert light on cloud in') == 'cloud_light_desert_brain'\nassert rev_long_words('we up river vector planet') == 'planet_vector_river'\nassert rev_long_words('') == ''\nassert rev_long_words('apple is to river in window brain') == 'brain_window_river_apple'\nassert rev_long_words('of we vector go stone') == 'stone_vector'\nassert rev_long_words('it') == ''", "answer": "def rev_long_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_long_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `rev_long_words('pixel data signal river cloud rocket')` يجب أن تُرجع `'rocket_cloud_river_signal_data_pixel'`.\nالجواب:", "qhash": "a980012723e86025"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cho'}", "tests": ["assert freq_of('of summer') == {'c': 0, 'h': 0, 'o': 1}", "assert freq_of('banana code garden') == {'c': 1, 'h': 0, 'o': 1}", "assert freq_of('a') == {'c': 0, 'h': 0, 'o': 0}", "assert freq_of('desert in camel an') == {'c': 1, 'h': 0, 'o': 0}", "assert freq_of('falcon up') == {'c': 1, 'h': 0, 'o': 1}", "assert freq_of('coffee table') == {'c': 1, 'h': 0, 'o': 1}", "assert freq_of('') == {'c': 0, 'h': 0, 'o': 0}"], "test_code": "assert freq_of('of summer') == {'c': 0, 'h': 0, 'o': 1}\nassert freq_of('banana code garden') == {'c': 1, 'h': 0, 'o': 1}\nassert freq_of('a') == {'c': 0, 'h': 0, 'o': 0}\nassert freq_of('desert in camel an') == {'c': 1, 'h': 0, 'o': 0}\nassert freq_of('falcon up') == {'c': 1, 'h': 0, 'o': 1}\nassert freq_of('coffee table') == {'c': 1, 'h': 0, 'o': 1}\nassert freq_of('') == {'c': 0, 'h': 0, 'o': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cho'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cho'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'h'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('of summer')` يُرجع `{'c': 0, 'h': 0, 'o': 1}`.\nالجواب:", "qhash": "c49b3530dd075cf1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ad'}", "tests": ["assert freq_of('camel table falcon code') == {'a': 3, 'd': 1}", "assert freq_of('signal at data falcon python') == {'a': 5, 'd': 1}", "assert freq_of('is') == {'a': 0, 'd': 0}", "assert freq_of('stone to') == {'a': 0, 'd': 0}", "assert freq_of('garden at an up planet') == {'a': 4, 'd': 1}", "assert freq_of('data cloud matrix signal') == {'a': 4, 'd': 2}", "assert freq_of('') == {'a': 0, 'd': 0}"], "test_code": "assert freq_of('camel table falcon code') == {'a': 3, 'd': 1}\nassert freq_of('signal at data falcon python') == {'a': 5, 'd': 1}\nassert freq_of('is') == {'a': 0, 'd': 0}\nassert freq_of('stone to') == {'a': 0, 'd': 0}\nassert freq_of('garden at an up planet') == {'a': 4, 'd': 1}\nassert freq_of('data cloud matrix signal') == {'a': 4, 'd': 2}\nassert freq_of('') == {'a': 0, 'd': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ad'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ad'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'd' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('camel table falcon code')` يجب أن تُرجع `{'a': 3, 'd': 1}`.\nالجواب:", "qhash": "95e9658ad6e6b457"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([39, 15, 16, -23, 32, -21, -25, -2, 39]) == 15", "assert top_divisible([-10, -5, -20]) == -5", "assert top_divisible([1, 6, 11]) == None", "assert top_divisible([-16, -14, 19, 19, 5, 19, -12]) == 5", "assert top_divisible([-43, -21, 12]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([39, 15, 16, -23, 32, -21, -25, -2, 39]) == 15\nassert top_divisible([-10, -5, -20]) == -5\nassert top_divisible([1, 6, 11]) == None\nassert top_divisible([-16, -14, 19, 19, 5, 19, -12]) == 5\nassert top_divisible([-43, -21, 12]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 5 == 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 % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(arr):\n best = 0\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(arr):\n best = 0\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `top_divisible([39, 15, 16, -23, 32, -21, -25, -2, 39])` يجب أن تُرجع `15`.\nالجواب:", "qhash": "d4698dca5178b4c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['desert', 'falcon', 'rocket', 'orange', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['desert', 'falcon', 'rocket', 'orange', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "c9d9bf384b96a878", "answer": "['cloud', 'desert', 'falcon', 'rocket', 'orange']\n['rocket', 'orange', 'falcon']", "completion": " الناتج:\n```text\n['cloud', 'desert', 'falcon', 'rocket', 'orange']\n['rocket', 'orange', 'falcon']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('سيارة كتاب سيارة') == 0", "assert letter_hits('طالب') == 0", "assert letter_hits('') == 0", "assert letter_hits('صديق حاسوب') == 1", "assert letter_hits('ميناء نهار برمجة سوق قلم دفتر شجرة معلم') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('شجرة قهوة شجرة سيارة نور علم قلم بحر') == 0\nassert letter_hits('') == 0\nassert letter_hits('سيارة كتاب سيارة') == 0\nassert letter_hits('طالب') == 0\nassert letter_hits('') == 0\nassert letter_hits('صديق حاسوب') == 1\nassert letter_hits('ميناء نهار برمجة سوق قلم دفتر شجرة معلم') == 1\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": "67594118500f1b55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -3 * x ** 2 + (2) * x + (-8)", "tests": ["assert quad(6) == -104", "assert quad(17) == -841", "assert quad(20) == -1168", "assert quad(9) == -233", "assert quad(3) == -29", "assert quad(19) == -1053", "assert quad(9) == -233", "assert quad(0) == -8"], "test_code": "assert quad(6) == -104\nassert quad(17) == -841\nassert quad(20) == -1168\nassert quad(9) == -233\nassert quad(3) == -29\nassert quad(19) == -1053\nassert quad(9) == -233\nassert quad(0) == -8", "answer": "def quad(x):\n return -3 * x ** 2 + (2) * x + (-8)", "completion": " ```python\ndef quad(x):\n return -3 * x ** 2 + (2) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -3x² + 2x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(6)` يُرجع `-104`.\nالجواب:", "qhash": "914e60a912cf6fa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'أحمد': 38, 'نور': 6, 'هشام': 17}\nmarks['هشام'] += 10\nmarks['مريم'] = 4\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 = {'أحمد': 38, 'نور': 6, 'هشام': 17}\nmarks['هشام'] += 10\nmarks['مريم'] = 4\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": "640e3e1f3eca3966", "answer": "4\nأحمد\n75\n[('مريم', 4), ('نور', 6)]", "completion": " الناتج:\n```text\n4\nأحمد\n75\n[('مريم', 4), ('نور', 6)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert turn_list([8, 22, 12, 35, 35]) == [8, 22, 12, 35, 35]", "assert turn_list([9, 27, 28, 41, 23, 33, 31, 47, 4, -5, 38]) == [28, 41, 23, 33, 31, 47, 4, -5, 38, 9, 27]", "assert turn_list([31, 33, 31, -9]) == [31, 33, 31, -9]", "assert turn_list([45, 15, 48, 47, 20, 8, 2, 36, 6, 37, 25, 20]) == [20, 8, 2, 36, 6, 37, 25, 20, 45, 15, 48, 47]", "assert turn_list([32, 32, 6, 16, 20, 48, 8, 2, 19, 35]) == [32, 32, 6, 16, 20, 48, 8, 2, 19, 35]", "assert turn_list([37, -1, 15, -7, 7, 14, 19, 17, 45]) == [17, 45, 37, -1, 15, -7, 7, 14, 19]", "assert turn_list([]) == []"], "test_code": "assert turn_list([8, 22, 12, 35, 35]) == [8, 22, 12, 35, 35]\nassert turn_list([9, 27, 28, 41, 23, 33, 31, 47, 4, -5, 38]) == [28, 41, 23, 33, 31, 47, 4, -5, 38, 9, 27]\nassert turn_list([31, 33, 31, -9]) == [31, 33, 31, -9]\nassert turn_list([45, 15, 48, 47, 20, 8, 2, 36, 6, 37, 25, 20]) == [20, 8, 2, 36, 6, 37, 25, 20, 45, 15, 48, 47]\nassert turn_list([32, 32, 6, 16, 20, 48, 8, 2, 19, 35]) == [32, 32, 6, 16, 20, 48, 8, 2, 19, 35]\nassert turn_list([37, -1, 15, -7, 7, 14, 19, 17, 45]) == [17, 45, 37, -1, 15, -7, 7, 14, 19]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 20 % len(items)\n return items[len(items) - k:] + items[:len(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([8, 22, 12, 35, 35])` يجب أن تُرجع `[8, 22, 12, 35, 35]`.\nالجواب:", "qhash": "ccead12e3e78f8ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(21) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21']", "assert play(7) == ['1', '2', '3', 'Hi', '5', '6', '7']", "assert play(21) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21']", "assert play(23) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']", "assert play(2) == ['1', '2']"], "test_code": "assert play(21) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21']\nassert play(7) == ['1', '2', '3', 'Hi', '5', '6', '7']\nassert play(21) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21']\nassert play(23) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21', '22', '23']\nassert play(2) == ['1', '2']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 % 4 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Hi'، وعلى 10 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(21)` يجب أن تُرجع `['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', 'Yo', '11', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'HiYo', '21']`.\nالجواب:", "qhash": "1cb9cf41dadf5e1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([4, 51, 35, -26, 7, 59, 0, -9]) == 4", "assert top_divisible([-8, -12, -12]) == -8", "assert top_divisible([1, 5]) == None", "assert top_divisible([10, -4]) == -4", "assert top_divisible([-37, -42, 10, -11, -28]) == -28", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([4, 51, 35, -26, 7, 59, 0, -9]) == 4\nassert top_divisible([-8, -12, -12]) == -8\nassert top_divisible([1, 5]) == None\nassert top_divisible([10, -4]) == -4\nassert top_divisible([-37, -42, 10, -11, -28]) == -28\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([4, 51, 35, -26, 7, 59, 0, -9])` يُرجع `4`.\nالجواب:", "qhash": "f96c39095c10d689"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 137:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([32, 18, 7, 2, 47, 16, 53, 36]) == [32, 50, 57, 59, 106, 122, 0, 36]", "assert cumulative([5, 41, 58, 78, 23, 51, 114, 46, 133, 93]) == [5, 46, 104, 0, 23, 74, 0, 46, 0, 93]", "assert cumulative([117, 108, 28, 21, 13, 72, 26, 24, 121]) == [117, 0, 28, 49, 62, 134, 0, 24, 0]", "assert cumulative([31, 62, 120, 49, 98, 48, 112]) == [31, 93, 0, 49, 0, 48, 0]", "assert cumulative([85]) == [85]", "assert cumulative([75, 19]) == [75, 94]", "assert cumulative([]) == []"], "test_code": "assert cumulative([32, 18, 7, 2, 47, 16, 53, 36]) == [32, 50, 57, 59, 106, 122, 0, 36]\nassert cumulative([5, 41, 58, 78, 23, 51, 114, 46, 133, 93]) == [5, 46, 104, 0, 23, 74, 0, 46, 0, 93]\nassert cumulative([117, 108, 28, 21, 13, 72, 26, 24, 121]) == [117, 0, 28, 49, 62, 134, 0, 24, 0]\nassert cumulative([31, 62, 120, 49, 98, 48, 112]) == [31, 93, 0, 49, 0, 48, 0]\nassert cumulative([85]) == [85]\nassert cumulative([75, 19]) == [75, 94]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 137:\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 > 137:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 137 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([32, 18, 7, 2, 47, 16, 53, 36])` يجب أن تُرجع `[32, 50, 57, 59, 106, 122, 0, 36]`.\nالجواب:", "qhash": "2140a55141db1d7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(5))\nprint(compute(5, 15))\nprint(compute(compute(15), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(5))\nprint(compute(5, 15))\nprint(compute(compute(15), 5))\n```\nالجواب:", "qhash": "22f1a835d331fdb1", "answer": "-19\n-40\n-68", "completion": " الناتج:\n```text\n-19\n-40\n-68\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 2 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_list([7, 9, 22, 42, 35, 39, 22, 23]) == [22, 23, 7, 9, 22, 42, 35, 39]", "assert rotate_list([-7, 18, 9, -3, 36, 48, 13, 48, 33]) == [48, 33, -7, 18, 9, -3, 36, 48, 13]", "assert rotate_list([14, 40, 46, 25, 20, 8, -6, 10, 35]) == [10, 35, 14, 40, 46, 25, 20, 8, -6]", "assert rotate_list([1, 6, 34, 4, 16, 32, -5, 4]) == [-5, 4, 1, 6, 34, 4, 16, 32]", "assert rotate_list([13, -5, -6, 35, 7, 1, -6, 7, 9, 3, 32, 34]) == [32, 34, 13, -5, -6, 35, 7, 1, -6, 7, 9, 3]", "assert rotate_list([10, 37, 26, -6, 24, 16, -5, 35, 47, 21]) == [47, 21, 10, 37, 26, -6, 24, 16, -5, 35]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([7, 9, 22, 42, 35, 39, 22, 23]) == [22, 23, 7, 9, 22, 42, 35, 39]\nassert rotate_list([-7, 18, 9, -3, 36, 48, 13, 48, 33]) == [48, 33, -7, 18, 9, -3, 36, 48, 13]\nassert rotate_list([14, 40, 46, 25, 20, 8, -6, 10, 35]) == [10, 35, 14, 40, 46, 25, 20, 8, -6]\nassert rotate_list([1, 6, 34, 4, 16, 32, -5, 4]) == [-5, 4, 1, 6, 34, 4, 16, 32]\nassert rotate_list([13, -5, -6, 35, 7, 1, -6, 7, 9, 3, 32, 34]) == [32, 34, 13, -5, -6, 35, 7, 1, -6, 7, 9, 3]\nassert rotate_list([10, 37, 26, -6, 24, 16, -5, 35, 47, 21]) == [47, 21, 10, 37, 26, -6, 24, 16, -5, 35]\nassert rotate_list([]) == []", "answer": "def rotate_list(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 rotate_list(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 rotate_list(xs):\n if not xs:\n return []\n k = 2 % len(xs)\n return ____\n```\nمثال: `rotate_list([7, 9, 22, 42, 35, 39, 22, 23])` يجب أن تُرجع `[22, 23, 7, 9, 22, 42, 35, 39]`.\nالجواب:", "qhash": "727aaade8feff149"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 68", "tests": ["assert pow_digits(54084) == 65", "assert pow_digits(814234) == 14", "assert pow_digits(677906) == 15", "assert pow_digits(788661) == 62", "assert pow_digits(4302) == 13", "assert pow_digits(426585) == 46", "assert pow_digits(36344) == 66", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(54084) == 65\nassert pow_digits(814234) == 14\nassert pow_digits(677906) == 15\nassert pow_digits(788661) == 62\nassert pow_digits(4302) == 13\nassert pow_digits(426585) == 46\nassert pow_digits(36344) == 66\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 68", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 68\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 68.\nمثال: `pow_digits(54084)` يجب أن تُرجع `65`.\nالجواب:", "qhash": "0fd97a38d57b7497"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'blo'}", "tests": ["assert letter_stats('at python a cloud') == {'b': 0, 'l': 1, 'o': 2}", "assert letter_stats('at banana of we data') == {'b': 1, 'l': 0, 'o': 1}", "assert letter_stats('go an to') == {'b': 0, 'l': 0, 'o': 2}", "assert letter_stats('code camel in pixel') == {'b': 0, 'l': 2, 'o': 1}", "assert letter_stats('cloud music winter planet') == {'b': 0, 'l': 2, 'o': 1}", "assert letter_stats('code in up') == {'b': 0, 'l': 0, 'o': 1}", "assert letter_stats('') == {'b': 0, 'l': 0, 'o': 0}"], "test_code": "assert letter_stats('at python a cloud') == {'b': 0, 'l': 1, 'o': 2}\nassert letter_stats('at banana of we data') == {'b': 1, 'l': 0, 'o': 1}\nassert letter_stats('go an to') == {'b': 0, 'l': 0, 'o': 2}\nassert letter_stats('code camel in pixel') == {'b': 0, 'l': 2, 'o': 1}\nassert letter_stats('cloud music winter planet') == {'b': 0, 'l': 2, 'o': 1}\nassert letter_stats('code in up') == {'b': 0, 'l': 0, 'o': 1}\nassert letter_stats('') == {'b': 0, 'l': 0, 'o': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'blo'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'blo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'l'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('at python a cloud')` يُرجع `{'b': 0, 'l': 1, 'o': 2}`.\nالجواب:", "qhash": "9ff92aaae2368d05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 2 for x in range(-1, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 2 for x in range(-1, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d5908e5708ec45cd", "answer": "[-2, 7, 34]\n3 39", "completion": " الناتج:\n```text\n[-2, 7, 34]\n3 39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 146:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([22, 75, 42, 18, 5]) == [22, 97, 139, 0, 5]", "assert acc_reset([65, 80, 133]) == [65, 145, 0]", "assert acc_reset([55, 50, 85, 3, -8]) == [55, 105, 0, 3, -5]", "assert acc_reset([34, 60]) == [34, 94]", "assert acc_reset([59, 135, 61, 58, 23, 79, 58, 65, 126, 96]) == [59, 0, 61, 119, 142, 0, 58, 123, 0, 96]", "assert acc_reset([65, 74]) == [65, 139]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([22, 75, 42, 18, 5]) == [22, 97, 139, 0, 5]\nassert acc_reset([65, 80, 133]) == [65, 145, 0]\nassert acc_reset([55, 50, 85, 3, -8]) == [55, 105, 0, 3, -5]\nassert acc_reset([34, 60]) == [34, 94]\nassert acc_reset([59, 135, 61, 58, 23, 79, 58, 65, 126, 96]) == [59, 0, 61, 119, 142, 0, 58, 123, 0, 96]\nassert acc_reset([65, 74]) == [65, 139]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 146:\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 > 146:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 146 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([22, 75, 42, 18, 5])` يجب أن تُرجع `[22, 97, 139, 0, 5]`.\nالجواب:", "qhash": "6160b23937db6842"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'راشد': 23, 'منى': 27, 'نور': 40}\nd['نور'] += 8\nd['زينب'] = 58\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 = {'راشد': 23, 'منى': 27, 'نور': 40}\nd['نور'] += 8\nd['زينب'] = 58\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": "53fd1b4b686d0102", "answer": "4\nزينب\n156\n[('راشد', 23), ('منى', 27)]", "completion": " الناتج:\n```text\n4\nزينب\n156\n[('راشد', 23), ('منى', 27)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 56) == 1)", "tests": ["assert coprimes(141) == 61", "assert coprimes(137) == 59", "assert coprimes(55) == 24", "assert coprimes(118) == 51", "assert coprimes(185) == 80", "assert coprimes(158) == 68", "assert coprimes(1) == 1"], "test_code": "assert coprimes(141) == 61\nassert coprimes(137) == 59\nassert coprimes(55) == 24\nassert coprimes(118) == 51\nassert coprimes(185) == 80\nassert coprimes(158) == 68\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, 56) == 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, 56) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 56، أي أن القاسم المشترك الأكبر لها مع 56 يساوي 1.\nمثال: `coprimes(141)` يجب أن تُرجع `61`.\nالجواب:", "qhash": "0c898797cbd98947"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 53)", "tests": ["assert select_range([23, 37, 25, 18, 50, 44, 51]) == [-204, -200, -176, -148, -100, -92]", "assert select_range([-7, -6]) == []", "assert select_range([6, 32, -10, 42, 58]) == [-168, -128]", "assert select_range([44, -19, 13, 52, -12, 35, -1]) == [-208, -176, -140]", "assert select_range([-30, -20, -4, 35, 10, 13, 5, 28, 34]) == [-140, -136, -112]", "assert select_range([2, 44, -19, -13, 50]) == [-200, -176]", "assert select_range([25, 49, 42, 42, 13, 11, 50, 56, 4]) == [-200, -196, -168, -168, -100]", "assert select_range([]) == []"], "test_code": "assert select_range([23, 37, 25, 18, 50, 44, 51]) == [-204, -200, -176, -148, -100, -92]\nassert select_range([-7, -6]) == []\nassert select_range([6, 32, -10, 42, 58]) == [-168, -128]\nassert select_range([44, -19, 13, 52, -12, 35, -1]) == [-208, -176, -140]\nassert select_range([-30, -20, -4, 35, 10, 13, 5, 28, 34]) == [-140, -136, -112]\nassert select_range([2, 44, -19, -13, 50]) == [-200, -176]\nassert select_range([25, 49, 42, 42, 13, 11, 50, 56, 4]) == [-200, -196, -168, -168, -100]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 53)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 53)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 53، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([23, 37, 25, 18, 50, 44, 51])` يُرجع `[-204, -200, -176, -148, -100, -92]`.\nالجواب:", "qhash": "e1f5f22fd045f88a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 11\nfor n in range(1, 5, 4):\n result -= n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 11\nfor n in range(1, 5, 4):\n result -= n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "9eeea67c86525fc6", "answer": "3\n1", "completion": " الناتج:\n```text\n3\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 73", "tests": ["assert dig_pow_mod(89375) == 9", "assert dig_pow_mod(937029) == 5", "assert dig_pow_mod(432712) == 10", "assert dig_pow_mod(10736) == 22", "assert dig_pow_mod(167437) == 14", "assert dig_pow_mod(547685) == 69", "assert dig_pow_mod(979112) == 71", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(89375) == 9\nassert dig_pow_mod(937029) == 5\nassert dig_pow_mod(432712) == 10\nassert dig_pow_mod(10736) == 22\nassert dig_pow_mod(167437) == 14\nassert dig_pow_mod(547685) == 69\nassert dig_pow_mod(979112) == 71\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 73", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 73.\nمثال: `dig_pow_mod(89375)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "9728f0a8428fa99c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(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_by([39, 8, 12, 10]) == [39, 8, 12, 10]", "assert rotate_by([31, -9, 2, 9]) == [31, -9, 2, 9]", "assert rotate_by([30, 20, 0, 16, 9, 12, 30]) == [16, 9, 12, 30, 30, 20, 0]", "assert rotate_by([24]) == [24]", "assert rotate_by([12, 28, 4, 38, 14, 25]) == [4, 38, 14, 25, 12, 28]", "assert rotate_by([36, 28, 41, 28, 33, 48]) == [41, 28, 33, 48, 36, 28]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([39, 8, 12, 10]) == [39, 8, 12, 10]\nassert rotate_by([31, -9, 2, 9]) == [31, -9, 2, 9]\nassert rotate_by([30, 20, 0, 16, 9, 12, 30]) == [16, 9, 12, 30, 30, 20, 0]\nassert rotate_by([24]) == [24]\nassert rotate_by([12, 28, 4, 38, 14, 25]) == [4, 38, 14, 25, 12, 28]\nassert rotate_by([36, 28, 41, 28, 33, 48]) == [41, 28, 33, 48, 36, 28]\nassert rotate_by([]) == []", "answer": "def rotate_by(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_by(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_by(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return ____\n```\nمثال: `rotate_by([39, 8, 12, 10])` يجب أن تُرجع `[39, 8, 12, 10]`.\nالجواب:", "qhash": "df510bbb27555b14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_sel([41, 9, 40, 8, 0, 34, 88, 72, 37, 3]) == 1", "assert count_sel([]) == 0", "assert count_sel([]) == 0", "assert count_sel([12, 38]) == 2", "assert count_sel([85]) == 0", "assert count_sel([]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([41, 9, 40, 8, 0, 34, 88, 72, 37, 3]) == 1\nassert count_sel([]) == 0\nassert count_sel([]) == 0\nassert count_sel([12, 38]) == 2\nassert count_sel([85]) == 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 % 2 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([41, 9, 40, 8, 0, 34, 88, 72, 37, 3])` يُرجع `1`.\nالجواب:", "qhash": "0a9643a35061f7ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 77", "tests": ["assert dig_pow_mod(1028) == 32", "assert dig_pow_mod(986774) == 71", "assert dig_pow_mod(670003) == 5", "assert dig_pow_mod(358334) == 61", "assert dig_pow_mod(268095) == 43", "assert dig_pow_mod(272662) == 36", "assert dig_pow_mod(453941) == 3", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(1028) == 32\nassert dig_pow_mod(986774) == 71\nassert dig_pow_mod(670003) == 5\nassert dig_pow_mod(358334) == 61\nassert dig_pow_mod(268095) == 43\nassert dig_pow_mod(272662) == 36\nassert dig_pow_mod(453941) == 3\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 77", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 77.\nمثال: `dig_pow_mod(1028)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "3e237403364fcae6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-3, -6, 10, 8, 17, 8, -9, 13]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-3, -6, 10, 8, 17, 8, -9, 13]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "a3c94a9716b26485", "answer": "[8, 8, 10, 13, 17, -3, -6, -9]\n[17, 13, 10]", "completion": " الناتج:\n```text\n[8, 8, 10, 13, 17, -3, -6, -9]\n[17, 13, 10]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('علم صحراء خبز') == 0", "assert begin_count('قهوة نهر سوق قلم سوق') == 1", "assert begin_count('بيت سماء سفينة علم نهر سوق نهار سماء') == 2", "assert begin_count('شمس كتاب جبل') == 0", "assert begin_count('كتاب نور علم') == 1", "assert begin_count('قهوة قلم حاسوب نهر نور') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('علم صحراء خبز') == 0\nassert begin_count('قهوة نهر سوق قلم سوق') == 1\nassert begin_count('بيت سماء سفينة علم نهر سوق نهار سماء') == 2\nassert begin_count('شمس كتاب جبل') == 0\nassert begin_count('كتاب نور علم') == 1\nassert begin_count('قهوة قلم حاسوب نهر نور') == 2\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:\n if w.startswith('ن'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ن»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef begin_count(sentence):\n count = 0\n for w in sentence:\n if w.startswith('ن'):\n count += 1\n return count\n```\nمثال: `begin_count('علم صحراء خبز')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f3a4ebea5b8c5687"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 36) == 1)", "tests": ["assert rel_prime_count(85) == 29", "assert rel_prime_count(96) == 32", "assert rel_prime_count(150) == 50", "assert rel_prime_count(161) == 54", "assert rel_prime_count(112) == 37", "assert rel_prime_count(62) == 21", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(85) == 29\nassert rel_prime_count(96) == 32\nassert rel_prime_count(150) == 50\nassert rel_prime_count(161) == 54\nassert rel_prime_count(112) == 37\nassert rel_prime_count(62) == 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, 36) == 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, 36) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 36) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(85)` يُرجع `29`.\nالجواب:", "qhash": "4c0b04212d38799b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert sum_multiples(88) == 665", "assert sum_multiples(256) == 5903", "assert sum_multiples(223) == 4479", "assert sum_multiples(61) == 374", "assert sum_multiples(140) == 1779", "assert sum_multiples(294) == 7818", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(88) == 665\nassert sum_multiples(256) == 5903\nassert sum_multiples(223) == 4479\nassert sum_multiples(61) == 374\nassert sum_multiples(140) == 1779\nassert sum_multiples(294) == 7818\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `sum_multiples(88)` يجب أن تُرجع `665`.\nالجواب:", "qhash": "db04d39f5d73d9e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'هشام': 26, 'هدى': 29, 'سلمى': 29, 'رنا': 11, 'راشد': 8}\nmarks['راشد'] += 10\nmarks['حسن'] = 17\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 = {'هشام': 26, 'هدى': 29, 'سلمى': 29, 'رنا': 11, 'راشد': 8}\nmarks['راشد'] += 10\nmarks['حسن'] = 17\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": "aba59aa7f48cd6f7", "answer": "6\nهدى\n130\n[('رنا', 11), ('حسن', 17)]", "completion": " الناتج:\n```text\n6\nهدى\n130\n[('رنا', 11), ('حسن', 17)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([34, 31, 9, 0, 10, 50, 0, 50]) == [0, 50, 34, 31, 9, 0, 10, 50]", "assert rotate_list([0, 35, 47, 31, 35, 46, -3, -3, -9, 49]) == [47, 31, 35, 46, -3, -3, -9, 49, 0, 35]", "assert rotate_list([11, 22, 34, 7, 1, 19, 46, 26, 26, 6, 37, 20]) == [46, 26, 26, 6, 37, 20, 11, 22, 34, 7, 1, 19]", "assert rotate_list([-6]) == [-6]", "assert rotate_list([37, 40, 8, -9, 19, 7, 21]) == [-9, 19, 7, 21, 37, 40, 8]", "assert rotate_list([33, 34, 14, 50, 3, 11]) == [33, 34, 14, 50, 3, 11]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([34, 31, 9, 0, 10, 50, 0, 50]) == [0, 50, 34, 31, 9, 0, 10, 50]\nassert rotate_list([0, 35, 47, 31, 35, 46, -3, -3, -9, 49]) == [47, 31, 35, 46, -3, -3, -9, 49, 0, 35]\nassert rotate_list([11, 22, 34, 7, 1, 19, 46, 26, 26, 6, 37, 20]) == [46, 26, 26, 6, 37, 20, 11, 22, 34, 7, 1, 19]\nassert rotate_list([-6]) == [-6]\nassert rotate_list([37, 40, 8, -9, 19, 7, 21]) == [-9, 19, 7, 21, 37, 40, 8]\nassert rotate_list([33, 34, 14, 50, 3, 11]) == [33, 34, 14, 50, 3, 11]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 18 % 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 = 18 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return ____\n```\nمثال: `rotate_list([34, 31, 9, 0, 10, 50, 0, 50])` يجب أن تُرجع `[0, 50, 34, 31, 9, 0, 10, 50]`.\nالجواب:", "qhash": "e278c41f143290fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ع'))", "tests": ["assert letter_count('مكتبة لغة مدينة خبز مكتبة صديق تفاحة') == 0", "assert letter_count('جمل تفاحة') == 0", "assert letter_count('جمل طالب سلام قمر قمر عربية صحراء') == 1", "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('مكتبة لغة مدينة خبز مكتبة صديق تفاحة') == 0\nassert letter_count('جمل تفاحة') == 0\nassert letter_count('جمل طالب سلام قمر قمر عربية صحراء') == 1\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 w.startswith('ع'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ع'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_count(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ع»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('مكتبة لغة مدينة خبز مكتبة صديق تفاحة')` يُرجع `0`.\nالجواب:", "qhash": "f019d79f3132cdcf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([10, -19, -8, 50]) == -8", "assert find_max_div([-20, -16, -20]) == -16", "assert find_max_div([1, 5, 9]) == None", "assert find_max_div([-39, -40, 31, 24, -31, 12, 24, 22]) == 24", "assert find_max_div([29, -48, 5, -7, 12]) == 12", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([10, -19, -8, 50]) == -8\nassert find_max_div([-20, -16, -20]) == -16\nassert find_max_div([1, 5, 9]) == None\nassert find_max_div([-39, -40, 31, 24, -31, 12, 24, 22]) == 24\nassert find_max_div([29, -48, 5, -7, 12]) == 12\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(values):\n best = 0\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 find_max_div(values):\n best = 0\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للتوضيح: الاستدعاء `find_max_div([10, -19, -8, 50])` يُرجع `-8`.\nالجواب:", "qhash": "370e2a830533950c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 187:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([33, 94, 34, 78, 47, 96]) == [33, 127, 161, 0, 47, 143]", "assert capped_cumsum([42, 32, 117, 186, 23, 130, 91, 22, 92, 31]) == [42, 74, 0, 186, 0, 130, 0, 22, 114, 145]", "assert capped_cumsum([110, 53, 24, 61]) == [110, 163, 187, 0]", "assert capped_cumsum([61, 143, 159]) == [61, 0, 159]", "assert capped_cumsum([24, 97, 123, 18]) == [24, 121, 0, 18]", "assert capped_cumsum([51, 55, 125, 18, 52, 181]) == [51, 106, 0, 18, 70, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([33, 94, 34, 78, 47, 96]) == [33, 127, 161, 0, 47, 143]\nassert capped_cumsum([42, 32, 117, 186, 23, 130, 91, 22, 92, 31]) == [42, 74, 0, 186, 0, 130, 0, 22, 114, 145]\nassert capped_cumsum([110, 53, 24, 61]) == [110, 163, 187, 0]\nassert capped_cumsum([61, 143, 159]) == [61, 0, 159]\nassert capped_cumsum([24, 97, 123, 18]) == [24, 121, 0, 18]\nassert capped_cumsum([51, 55, 125, 18, 52, 181]) == [51, 106, 0, 18, 70, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 187:\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 > 187:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 187 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([33, 94, 34, 78, 47, 96])` يجب أن تُرجع `[33, 127, 161, 0, 47, 143]`.\nالجواب:", "qhash": "d157e050cb6d53a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('music matrix engine apple go garden banana planet') == 'planet_banana_garden_go_apple_engine_matrix_music'", "assert mirror_words('planet brain summer light brain rocket planet apple') == 'apple_planet_rocket_brain_light_summer_brain_planet'", "assert mirror_words('camel cloud brain rocket river') == 'river_rocket_brain_cloud_camel'", "assert mirror_words('of table table up') == 'up_table_table_of'", "assert mirror_words('on is code matrix') == 'matrix_code_is_on'", "assert mirror_words('table') == 'table'", "assert mirror_words('cloud in banana banana') == 'banana_banana_in_cloud'"], "test_code": "assert mirror_words('music matrix engine apple go garden banana planet') == 'planet_banana_garden_go_apple_engine_matrix_music'\nassert mirror_words('planet brain summer light brain rocket planet apple') == 'apple_planet_rocket_brain_light_summer_brain_planet'\nassert mirror_words('camel cloud brain rocket river') == 'river_rocket_brain_cloud_camel'\nassert mirror_words('of table table up') == 'up_table_table_of'\nassert mirror_words('on is code matrix') == 'matrix_code_is_on'\nassert mirror_words('table') == 'table'\nassert mirror_words('cloud in banana banana') == 'banana_banana_in_cloud'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `mirror_words('music matrix engine apple go garden banana planet')` يُرجع `'planet_banana_garden_go_apple_engine_matrix_music'`.\nالجواب:", "qhash": "150138d0fd695c3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سوق حاسوب'\nprint(text.find('ا'))\nprint(len(text.replace(' ', '')))\nprint(text.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سوق حاسوب'\nprint(text.find('ا'))\nprint(len(text.replace(' ', '')))\nprint(text.split())\n```\nالجواب:", "qhash": "33c1fddff58f3750", "answer": "5\n8\n['سوق', 'حاسوب']", "completion": " الناتج:\n```text\n5\n8\n['سوق', 'حاسوب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 28:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([4, 3, 6, 8, 16, 5, 19, 12]) == [4, 7, 13, 21, 0, 5, 24, 0]", "assert rolling_total([25, 27, 28, 9]) == [25, 0, 28, 0]", "assert rolling_total([]) == []", "assert rolling_total([-9, 24, -4, 16, 2, 8]) == [-9, 15, 11, 27, 0, 8]", "assert rolling_total([17, 5, -1, 25, 5, 22]) == [17, 22, 21, 0, 5, 27]", "assert rolling_total([7, 13, 8, -7, -1, 8]) == [7, 20, 28, 21, 20, 28]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([4, 3, 6, 8, 16, 5, 19, 12]) == [4, 7, 13, 21, 0, 5, 24, 0]\nassert rolling_total([25, 27, 28, 9]) == [25, 0, 28, 0]\nassert rolling_total([]) == []\nassert rolling_total([-9, 24, -4, 16, 2, 8]) == [-9, 15, 11, 27, 0, 8]\nassert rolling_total([17, 5, -1, 25, 5, 22]) == [17, 22, 21, 0, 5, 27]\nassert rolling_total([7, 13, 8, -7, -1, 8]) == [7, 20, 28, 21, 20, 28]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 28:\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 > 28:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 28 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([4, 3, 6, 8, 16, 5, 19, 12])` يُرجع `[4, 7, 13, 21, 0, 5, 24, 0]`.\nالجواب:", "qhash": "26fe529d9de77a98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 19", "tests": ["assert sum_digit_pow(26833) == 8", "assert sum_digit_pow(768428) == 5", "assert sum_digit_pow(678063) == 4", "assert sum_digit_pow(427278) == 15", "assert sum_digit_pow(485803) == 7", "assert sum_digit_pow(344661) == 0", "assert sum_digit_pow(306540) == 10", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(26833) == 8\nassert sum_digit_pow(768428) == 5\nassert sum_digit_pow(678063) == 4\nassert sum_digit_pow(427278) == 15\nassert sum_digit_pow(485803) == 7\nassert sum_digit_pow(344661) == 0\nassert sum_digit_pow(306540) == 10\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 19", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 19.\nللتوضيح: الاستدعاء `sum_digit_pow(26833)` يُرجع `8`.\nالجواب:", "qhash": "41b3071b42f48ca6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 59", "tests": ["assert step_product(7) == 21", "assert step_product(13) == 54", "assert step_product(57) == 30", "assert step_product(32) == 55", "assert step_product(40) == 22", "assert step_product(35) == 14", "assert step_product(0) == 1"], "test_code": "assert step_product(7) == 21\nassert step_product(13) == 54\nassert step_product(57) == 30\nassert step_product(32) == 55\nassert step_product(40) == 22\nassert step_product(35) == 14\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 59", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(7)` يُرجع `21`.\nالجواب:", "qhash": "a639817dc2735e41"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -9 * x ** 2 + (7) * x + (6)", "tests": ["assert evaluate(3) == -54", "assert evaluate(-17) == -2714", "assert evaluate(-20) == -3734", "assert evaluate(-9) == -786", "assert evaluate(12) == -1206", "assert evaluate(-19) == -3376", "assert evaluate(16) == -2186", "assert evaluate(0) == 6"], "test_code": "assert evaluate(3) == -54\nassert evaluate(-17) == -2714\nassert evaluate(-20) == -3734\nassert evaluate(-9) == -786\nassert evaluate(12) == -1206\nassert evaluate(-19) == -3376\nassert evaluate(16) == -2186\nassert evaluate(0) == 6", "answer": "def evaluate(x):\n return -9 * x ** 2 + (7) * x + (6)", "completion": " ```python\ndef evaluate(x):\n return -9 * x ** 2 + (7) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -9x² + 7x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(3)` يُرجع `-54`.\nالجواب:", "qhash": "275af7cb0bdf0652"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 41", "tests": ["assert rec_prod(5) == 5", "assert rec_prod(60) == 21", "assert rec_prod(29) == 35", "assert rec_prod(52) == 10", "assert rec_prod(31) == 4", "assert rec_prod(40) == 13", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(5) == 5\nassert rec_prod(60) == 21\nassert rec_prod(29) == 35\nassert rec_prod(52) == 10\nassert rec_prod(31) == 4\nassert rec_prod(40) == 13\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 41", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(5)` يُرجع `5`.\nالجواب:", "qhash": "d392be8411d29d0c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 2 for x in range(4, 10) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 2 for x in range(4, 10) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "06c0475a46717266", "answer": "[23, 62]\n2 85", "completion": " الناتج:\n```text\n[23, 62]\n2 85\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 128\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 = 128\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": "d404c3d09367b6a6", "answer": "7", "completion": " الناتج:\n```text\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert sum_div(130) == 1569", "assert sum_div(141) == 1835", "assert sum_div(76) == 555", "assert sum_div(254) == 6126", "assert sum_div(36) == 119", "assert sum_div(219) == 4480", "assert sum_div(1) == 0"], "test_code": "assert sum_div(130) == 1569\nassert sum_div(141) == 1835\nassert sum_div(76) == 555\nassert sum_div(254) == 6126\nassert sum_div(36) == 119\nassert sum_div(219) == 4480\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 13.\nمثال: `sum_div(130)` يجب أن تُرجع `1569`.\nالجواب:", "qhash": "2a0b282122a69765"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(-9))\nprint(calc(-9, 6))\nprint(calc(calc(6), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(-9))\nprint(calc(-9, 6))\nprint(calc(calc(6), -9))\n```\nالجواب:", "qhash": "fb3906710d4425dc", "answer": "-9\n27\n225", "completion": " الناتج:\n```text\n-9\n27\n225\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "tests": ["assert pow_total(3) == 42", "assert pow_total(9) == 855", "assert pow_total(1) == 3", "assert pow_total(13) == 2457", "assert pow_total(12) == 1950", "assert pow_total(1) == 3", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 42\nassert pow_total(9) == 855\nassert pow_total(1) == 3\nassert pow_total(13) == 2457\nassert pow_total(12) == 1950\nassert pow_total(1) == 3\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 2\n return total\n```\nمثال: `pow_total(3)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "b0240027da58b958"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -13 <= x <= 13)", "tests": ["assert pick_between([7, -16, 13, -1, 22]) == [-26, -14, 2]", "assert pick_between([-8, -21, -30, -19]) == [16]", "assert pick_between([4, 54, 42, 24, 32]) == [-8]", "assert pick_between([42]) == []", "assert pick_between([48, -3, 27, 13, -23, 38, 46, 25, 32]) == [-26, 6]", "assert pick_between([-18, 37, -21, 14, 2, -5, -11, 38]) == [-4, 10, 22]", "assert pick_between([32, -16, -23, 42, 9, 42, -25, -26]) == [-18]", "assert pick_between([]) == []"], "test_code": "assert pick_between([7, -16, 13, -1, 22]) == [-26, -14, 2]\nassert pick_between([-8, -21, -30, -19]) == [16]\nassert pick_between([4, 54, 42, 24, 32]) == [-8]\nassert pick_between([42]) == []\nassert pick_between([48, -3, 27, 13, -23, 38, 46, 25, 32]) == [-26, 6]\nassert pick_between([-18, 37, -21, 14, 2, -5, -11, 38]) == [-4, 10, 22]\nassert pick_between([32, -16, -23, 42, 9, 42, -25, -26]) == [-18]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -13 <= x <= 13)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -2 for x in xs if -13 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -13 و13 (شاملًا الطرفين) في -2.\nمثال: `pick_between([7, -16, 13, -1, 22])` يجب أن تُرجع `[-26, -14, 2]`.\nالجواب:", "qhash": "40ebd0ca2cfcf39d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert add_multiples(188) == 3474", "assert add_multiples(121) == 1325", "assert add_multiples(5) == 0", "assert add_multiples(238) == 5403", "assert add_multiples(132) == 1572", "assert add_multiples(238) == 5403", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(188) == 3474\nassert add_multiples(121) == 1325\nassert add_multiples(5) == 0\nassert add_multiples(238) == 5403\nassert add_multiples(132) == 1572\nassert add_multiples(238) == 5403\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 % 11 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(188)` يُرجع `3474`.\nالجواب:", "qhash": "0c4824bac8c88b86"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(426489937))\nprint(rec(rec(426489937)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(426489937))\nprint(rec(rec(426489937)))\n```\nالجواب:", "qhash": "8c3f88dce380a169", "answer": "52\n7", "completion": " الناتج:\n```text\n52\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun']", "assert game(17) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun', '17']", "assert game(16) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun']", "assert game(17) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun', '17']", "assert game(2) == ['1', 'Sun']"], "test_code": "assert game(12) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun']\nassert game(17) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun', '17']\nassert game(16) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun']\nassert game(17) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun', '13', 'Sun', '15', 'Sun', '17']\nassert game(2) == ['1', 'Sun']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Sun'\n if i % 11 == 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 % 2 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(12)` يجب أن تُرجع `['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'Sun', '9', 'Sun', 'Moon', 'Sun']`.\nالجواب:", "qhash": "afacd832fa328b94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "tests": ["assert weighted_sum(3) == 324", "assert weighted_sum(11) == 39204", "assert weighted_sum(5) == 2025", "assert weighted_sum(0) == 0", "assert weighted_sum(6) == 3969", "assert weighted_sum(1) == 9", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 324\nassert weighted_sum(11) == 39204\nassert weighted_sum(5) == 2025\nassert weighted_sum(0) == 0\nassert weighted_sum(6) == 3969\nassert weighted_sum(1) == 9\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 3\n return total\n```\nمثال: `weighted_sum(3)` يجب أن تُرجع `324`.\nالجواب:", "qhash": "87080930bfd8b5c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 41172\nc = 0\nwhile n > 16:\n n = n // 5\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 41172\nc = 0\nwhile n > 16:\n n = n // 5\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "3394dc02be39b963", "answer": "13 5", "completion": " الناتج:\n```text\n13 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -7 * x ** 2 + (6) * x + (7)", "tests": ["assert eval_poly(8) == -393", "assert eval_poly(19) == -2406", "assert eval_poly(-13) == -1254", "assert eval_poly(-10) == -753", "assert eval_poly(-11) == -906", "assert eval_poly(8) == -393", "assert eval_poly(4) == -81", "assert eval_poly(0) == 7"], "test_code": "assert eval_poly(8) == -393\nassert eval_poly(19) == -2406\nassert eval_poly(-13) == -1254\nassert eval_poly(-10) == -753\nassert eval_poly(-11) == -906\nassert eval_poly(8) == -393\nassert eval_poly(4) == -81\nassert eval_poly(0) == 7", "answer": "def eval_poly(x):\n return -7 * x ** 2 + (6) * x + (7)", "completion": " ```python\ndef eval_poly(x):\n return -7 * x ** 2 + (6) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -7x² + 6x + 7 عند العدد الصحيح x.\nمثال: `eval_poly(8)` يجب أن تُرجع `-393`.\nالجواب:", "qhash": "0873f08e9dfde1d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'summer_summer'\nprint(s.split('_'))\nprint(s.upper())\nprint(s.find('r'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'summer_summer'\nprint(s.split('_'))\nprint(s.upper())\nprint(s.find('r'))\n```\nالجواب:", "qhash": "43b84abec5f276f5", "answer": "['summer', 'summer']\nSUMMER_SUMMER\n5", "completion": " الناتج:\n```text\n['summer', 'summer']\nSUMMER_SUMMER\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [31, 28, 34, 17, 14, 40, 38]\nprint(lst[1:4])\nprint(lst[::2])\nprint(sum(lst[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [31, 28, 34, 17, 14, 40, 38]\nprint(lst[1:4])\nprint(lst[::2])\nprint(sum(lst[1:4]))\n```\nالجواب:", "qhash": "0afed5481f2210ac", "answer": "[28, 34, 17]\n[31, 34, 14, 38]\n79", "completion": " الناتج:\n```text\n[28, 34, 17]\n[31, 34, 14, 38]\n79\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [33, 1, 20, 23, 26, 9, 39, 1, 37]\nprint(items[2:4])\nprint(items[::-2])\nprint(sum(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [33, 1, 20, 23, 26, 9, 39, 1, 37]\nprint(items[2:4])\nprint(items[::-2])\nprint(sum(items[2:4]))\n```\nالجواب:", "qhash": "efad06f1cc939ff9", "answer": "[20, 23]\n[37, 39, 26, 20, 33]\n43", "completion": " الناتج:\n```text\n[20, 23]\n[37, 39, 26, 20, 33]\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 1\nfor i in range(10, 27, 4):\n s -= i * 1\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 1\nfor i in range(10, 27, 4):\n s -= i * 1\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "a8a60047927fa75e", "answer": "-89\n26", "completion": " الناتج:\n```text\n-89\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'خالد': 43, 'راشد': 9, 'هدى': 48, 'أحمد': 41, 'فيصل': 12}\nd['هدى'] += 15\nd['يوسف'] = 21\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 = {'خالد': 43, 'راشد': 9, 'هدى': 48, 'أحمد': 41, 'فيصل': 12}\nd['هدى'] += 15\nd['يوسف'] = 21\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": "8106607992b23fbb", "answer": "6\nهدى\n189\n[('راشد', 9), ('فيصل', 12)]", "completion": " الناتج:\n```text\n6\nهدى\n189\n[('راشد', 9), ('فيصل', 12)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 7\nfor x in range(0, 18, 3):\n result -= x * 9\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 7\nfor x in range(0, 18, 3):\n result -= x * 9\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "a643ed8cb4e9d810", "answer": "-398\n15", "completion": " الناتج:\n```text\n-398\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'ce'}", "tests": ["assert letter_stats('banana window signal camel music we') == {'c': 2, 'e': 2}", "assert letter_stats('rocket on up vector desert a') == {'c': 2, 'e': 4}", "assert letter_stats('we matrix summer falcon') == {'c': 1, 'e': 2}", "assert letter_stats('brain summer it banana by to') == {'c': 0, 'e': 1}", "assert letter_stats('pixel music coffee it') == {'c': 2, 'e': 3}", "assert letter_stats('banana at we') == {'c': 0, 'e': 1}", "assert letter_stats('') == {'c': 0, 'e': 0}"], "test_code": "assert letter_stats('banana window signal camel music we') == {'c': 2, 'e': 2}\nassert letter_stats('rocket on up vector desert a') == {'c': 2, 'e': 4}\nassert letter_stats('we matrix summer falcon') == {'c': 1, 'e': 2}\nassert letter_stats('brain summer it banana by to') == {'c': 0, 'e': 1}\nassert letter_stats('pixel music coffee it') == {'c': 2, 'e': 3}\nassert letter_stats('banana at we') == {'c': 0, 'e': 1}\nassert letter_stats('') == {'c': 0, 'e': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'ce'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'ce'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'e' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('banana window signal camel music we')` يُرجع `{'c': 2, 'e': 2}`.\nالجواب:", "qhash": "cfa31aac4bbca871"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([45, 42, 21, 40, 83]) == [45, 87, 108, 148, 0]", "assert running_sum([23, 150]) == [23, 0]", "assert running_sum([]) == []", "assert running_sum([112, 112, 22, 24, 154, 85, 49]) == [112, 0, 22, 46, 0, 85, 134]", "assert running_sum([]) == []", "assert running_sum([148, 13, 80, 106, 93, 48, 14, 25]) == [148, 161, 0, 106, 0, 48, 62, 87]", "assert running_sum([]) == []"], "test_code": "assert running_sum([45, 42, 21, 40, 83]) == [45, 87, 108, 148, 0]\nassert running_sum([23, 150]) == [23, 0]\nassert running_sum([]) == []\nassert running_sum([112, 112, 22, 24, 154, 85, 49]) == [112, 0, 22, 46, 0, 85, 134]\nassert running_sum([]) == []\nassert running_sum([148, 13, 80, 106, 93, 48, 14, 25]) == [148, 161, 0, 106, 0, 48, 62, 87]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\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 > 165:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 165 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([45, 42, 21, 40, 83])` يُرجع `[45, 87, 108, 148, 0]`.\nالجواب:", "qhash": "ae5165b27a9ae2d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "tests": ["assert shift_list([49, 16, 14, 28, 19, 2]) == [19, 2, 49, 16, 14, 28]", "assert shift_list([41, 2, 43, 32, 31, 50, 39, 13, 43, 10]) == [39, 13, 43, 10, 41, 2, 43, 32, 31, 50]", "assert shift_list([14, 49, -8, 7, 50, 28, 19, 30, 46, 11, 20, 41]) == [50, 28, 19, 30, 46, 11, 20, 41, 14, 49, -8, 7]", "assert shift_list([27, 35, 32, -1, 27, 39, 2, 11, 4, 3, 28, -6]) == [27, 39, 2, 11, 4, 3, 28, -6, 27, 35, 32, -1]", "assert shift_list([12, 35, 9, 32, 8, 8, 44, 8, 16]) == [8, 16, 12, 35, 9, 32, 8, 8, 44]", "assert shift_list([10, -7, -3, 12, 35, 38, 31, 50, 1, 50, 27, 31]) == [35, 38, 31, 50, 1, 50, 27, 31, 10, -7, -3, 12]", "assert shift_list([]) == []"], "test_code": "assert shift_list([49, 16, 14, 28, 19, 2]) == [19, 2, 49, 16, 14, 28]\nassert shift_list([41, 2, 43, 32, 31, 50, 39, 13, 43, 10]) == [39, 13, 43, 10, 41, 2, 43, 32, 31, 50]\nassert shift_list([14, 49, -8, 7, 50, 28, 19, 30, 46, 11, 20, 41]) == [50, 28, 19, 30, 46, 11, 20, 41, 14, 49, -8, 7]\nassert shift_list([27, 35, 32, -1, 27, 39, 2, 11, 4, 3, 28, -6]) == [27, 39, 2, 11, 4, 3, 28, -6, 27, 35, 32, -1]\nassert shift_list([12, 35, 9, 32, 8, 8, 44, 8, 16]) == [8, 16, 12, 35, 9, 32, 8, 8, 44]\nassert shift_list([10, -7, -3, 12, 35, 38, 31, 50, 1, 50, 27, 31]) == [35, 38, 31, 50, 1, 50, 27, 31, 10, -7, -3, 12]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return ____\n```\nمثال: `shift_list([49, 16, 14, 28, 19, 2])` يجب أن تُرجع `[19, 2, 49, 16, 14, 28]`.\nالجواب:", "qhash": "c6132e6430bccf5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 8 for x in range(5, 14) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 8 for x in range(5, 14) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "543e4db1ba392d5b", "answer": "[17, 73, 161]\n3 251", "completion": " الناتج:\n```text\n[17, 73, 161]\n3 251\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "tests": ["assert total_multiples(76) == 879", "assert total_multiples(188) == 4955", "assert total_multiples(136) == 2700", "assert total_multiples(218) == 6980", "assert total_multiples(170) == 4074", "assert total_multiples(280) == 11219", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(76) == 879\nassert total_multiples(188) == 4955\nassert total_multiples(136) == 2700\nassert total_multiples(218) == 6980\nassert total_multiples(170) == 4074\nassert total_multiples(280) == 11219\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 % 9 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(76)` يُرجع `879`.\nالجواب:", "qhash": "80a6af4a9260c629"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 6) // 3 for x in range(-5, 8) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 6) // 3 for x in range(-5, 8) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "cf68be774abf954b", "answer": "[0, 1, 2, 3]\n4 6", "completion": " الناتج:\n```text\n[0, 1, 2, 3]\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'مكتبة'\nprint(text.find('ب'))\nprint(text[-1])\nprint('ب' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'مكتبة'\nprint(text.find('ب'))\nprint(text[-1])\nprint('ب' in text)\n```\nالجواب:", "qhash": "77203fad0ebed018", "answer": "3\nة\nTrue", "completion": " الناتج:\n```text\n3\nة\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'باسل': 46, 'فيصل': 1, 'خالد': 6}\nmarks['خالد'] += 13\nmarks['أحمد'] = 9\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 34])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'باسل': 46, 'فيصل': 1, 'خالد': 6}\nmarks['خالد'] += 13\nmarks['أحمد'] = 9\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 34])\n```\nالجواب:", "qhash": "1e05efa07826c138", "answer": "4\nباسل\n75\n['باسل']", "completion": " الناتج:\n```text\n4\nباسل\n75\n['باسل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 76", "tests": ["assert dig_pow_mod(66976) == 4", "assert dig_pow_mod(988990) == 15", "assert dig_pow_mod(624636) == 3", "assert dig_pow_mod(832276) == 50", "assert dig_pow_mod(569553) == 63", "assert dig_pow_mod(865752) == 21", "assert dig_pow_mod(538562) == 25", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(66976) == 4\nassert dig_pow_mod(988990) == 15\nassert dig_pow_mod(624636) == 3\nassert dig_pow_mod(832276) == 50\nassert dig_pow_mod(569553) == 63\nassert dig_pow_mod(865752) == 21\nassert dig_pow_mod(538562) == 25\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 76", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 76\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 76.\nللتوضيح: الاستدعاء `dig_pow_mod(66976)` يُرجع `4`.\nالجواب:", "qhash": "ceba4c02968f5cb0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 2:\n return n + 0\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(10))\n```\nالجواب:", "qhash": "c13f01306488d006", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 16\nfor i in range(6, 11, 1):\n result += i * 1\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 16\nfor i in range(6, 11, 1):\n result += i * 1\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "d2e44e2383853778", "answer": "56\n10", "completion": " الناتج:\n```text\n56\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('by') == 'ur'", "assert cipher('cloud') == 'vehnw'", "assert cipher('light matrix python') == 'ebzam ftmkbq irmahg'", "assert cipher('code desert at stone OK') == 'vhwx wxlxkm tm lmhgx OK'", "assert cipher('on matrix go') == 'hg ftmkbq zh'", "assert cipher('code matrix engine python light OK') == 'vhwx ftmkbq xgzbgx irmahg ebzam OK'", "assert cipher('') == ''"], "test_code": "assert cipher('by') == 'ur'\nassert cipher('cloud') == 'vehnw'\nassert cipher('light matrix python') == 'ebzam ftmkbq irmahg'\nassert cipher('code desert at stone OK') == 'vhwx wxlxkm tm lmhgx OK'\nassert cipher('on matrix go') == 'hg ftmkbq zh'\nassert cipher('code matrix engine python light OK') == 'vhwx ftmkbq xgzbgx irmahg ebzam OK'\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 + (19)) % 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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('by')` يجب أن تُرجع `'ur'`.\nالجواب:", "qhash": "72fa4305b701763f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('مكتبة حصان نهار حاسوب بحر طالب حديقة نهر') == 1", "assert count_hits('قلم حاسوب ليل نهار قمر مدينة برمجة برتقال') == 1", "assert count_hits('عربية') == 0", "assert count_hits('سيارة قلم وردة لغة') == 0", "assert count_hits('كتاب سيارة قمر') == 1", "assert count_hits('فجر شمس علم طائرة ميناء') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('رمل طالب برتقال لغة علم') == 1\nassert count_hits('مكتبة حصان نهار حاسوب بحر طالب حديقة نهر') == 1\nassert count_hits('قلم حاسوب ليل نهار قمر مدينة برمجة برتقال') == 1\nassert count_hits('عربية') == 0\nassert count_hits('سيارة قلم وردة لغة') == 0\nassert count_hits('كتاب سيارة قمر') == 1\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": "8cfd59c32b0ce467"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 260\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 = 260\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": "29334fdf04a8b0b6", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 73) == 1)", "tests": ["assert coprime_count(62) == 62", "assert coprime_count(175) == 173", "assert coprime_count(35) == 35", "assert coprime_count(139) == 138", "assert coprime_count(132) == 131", "assert coprime_count(143) == 142", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(62) == 62\nassert coprime_count(175) == 173\nassert coprime_count(35) == 35\nassert coprime_count(139) == 138\nassert coprime_count(132) == 131\nassert coprime_count(143) == 142\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, 73) == 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, 73) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 73، أي أن القاسم المشترك الأكبر لها مع 73 يساوي 1.\nمثال: `coprime_count(62)` يجب أن تُرجع `62`.\nالجواب:", "qhash": "bf89871ba1e607e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'خالد': 15, 'نور': 47, 'فيصل': 47}\nd['نور'] += 1\nd['هشام'] = 34\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 = {'خالد': 15, 'نور': 47, 'فيصل': 47}\nd['نور'] += 1\nd['هشام'] = 34\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": "43bf36455f4bd6fd", "answer": "4\nنور\n144\n[('خالد', 15), ('هشام', 34)]", "completion": " الناتج:\n```text\n4\nنور\n144\n[('خالد', 15), ('هشام', 34)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'عمر': 13, 'زينب': 27, 'باسل': 13, 'منى': 38}\nd['منى'] += 5\nd['حسن'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'عمر': 13, 'زينب': 27, 'باسل': 13, 'منى': 38}\nd['منى'] += 5\nd['حسن'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])\n```\nالجواب:", "qhash": "b616f20c8eca9d1a", "answer": "5\nمنى\n114\n['زينب', 'منى']", "completion": " الناتج:\n```text\n5\nمنى\n114\n['زينب', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 337\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 = 337\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": "849aa56234bb051e", "answer": "112", "completion": " الناتج:\n```text\n112\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [14, 14, 30, 20, -1, 28, 21, 27, -1]\nprint(a[3:5])\nprint(a[::2])\nprint(max(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [14, 14, 30, 20, -1, 28, 21, 27, -1]\nprint(a[3:5])\nprint(a[::2])\nprint(max(a[3:5]))\n```\nالجواب:", "qhash": "1e1c7b8c8acf1e24", "answer": "[20, -1]\n[14, 30, -1, 21, -1]\n20", "completion": " الناتج:\n```text\n[20, -1]\n[14, 30, -1, 21, -1]\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert mirror_words('python go falcon') == 'falcon/python'", "assert mirror_words('apple orange') == 'orange'", "assert mirror_words('falcon banana light is') == 'banana/falcon'", "assert mirror_words('an signal matrix pixel signal matrix stone') == 'matrix/signal/matrix/signal'", "assert mirror_words('a stone summer window music') == 'window/summer'", "assert mirror_words('vector up window engine code banana') == 'banana/engine/window/vector'", "assert mirror_words('stone winter we music') == 'winter'"], "test_code": "assert mirror_words('python go falcon') == 'falcon/python'\nassert mirror_words('apple orange') == 'orange'\nassert mirror_words('falcon banana light is') == 'banana/falcon'\nassert mirror_words('an signal matrix pixel signal matrix stone') == 'matrix/signal/matrix/signal'\nassert mirror_words('a stone summer window music') == 'window/summer'\nassert mirror_words('vector up window engine code banana') == 'banana/engine/window/vector'\nassert mirror_words('stone winter we music') == 'winter'", "answer": "def mirror_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `mirror_words('python go falcon')` يجب أن تُرجع `'falcon/python'`.\nالجواب:", "qhash": "72be4943a50f3799"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 9 * x ** 2 + (3) * x + (-7)", "tests": ["assert evaluate(4) == 149", "assert evaluate(-6) == 299", "assert evaluate(-19) == 3185", "assert evaluate(15) == 2063", "assert evaluate(-14) == 1715", "assert evaluate(-18) == 2855", "assert evaluate(-12) == 1253", "assert evaluate(0) == -7"], "test_code": "assert evaluate(4) == 149\nassert evaluate(-6) == 299\nassert evaluate(-19) == 3185\nassert evaluate(15) == 2063\nassert evaluate(-14) == 1715\nassert evaluate(-18) == 2855\nassert evaluate(-12) == 1253\nassert evaluate(0) == -7", "answer": "def evaluate(x):\n return 9 * x ** 2 + (3) * x + (-7)", "completion": " ```python\ndef evaluate(x):\n return 9 * x ** 2 + (3) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 9x² + 3x - 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(4)` يُرجع `149`.\nالجواب:", "qhash": "01ba0d557a9dedac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 10 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12']", "assert play(7) == ['1', '2', '3', '4', 'Foo', '6', '7']", "assert play(22) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22']", "assert play(8) == ['1', '2', '3', '4', 'Foo', '6', '7', '8']", "assert play(3) == ['1', '2', '3']"], "test_code": "assert play(12) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12']\nassert play(7) == ['1', '2', '3', '4', 'Foo', '6', '7']\nassert play(22) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12', '13', '14', 'Foo', '16', '17', '18', '19', 'FooBar', '21', '22']\nassert play(8) == ['1', '2', '3', '4', 'Foo', '6', '7', '8']\nassert play(3) == ['1', '2', '3']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Foo'، وعلى 10 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(12)` يجب أن تُرجع `['1', '2', '3', '4', 'Foo', '6', '7', '8', '9', 'FooBar', '11', '12']`.\nالجواب:", "qhash": "413c17e041f0a2b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سلام') == 0", "assert letter_hits('حصان ماء') == 0", "assert letter_hits('علم كتاب نهار جبل قهوة') == 1", "assert letter_hits('مدينة سفينة مكتبة سيارة تفاحة ميناء قلم سلام') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('حاسوب معلم معلم') == 0\nassert letter_hits('باب') == 0\nassert letter_hits('حديقة مكتبة طائرة بحر سماء نهر فجر') == 1\nassert letter_hits('سلام') == 0\nassert letter_hits('حصان ماء') == 0\nassert letter_hits('علم كتاب نهار جبل قهوة') == 1\nassert letter_hits('مدينة سفينة مكتبة سيارة تفاحة ميناء قلم سلام') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ك» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('حاسوب معلم معلم')` يُرجع `0`.\nالجواب:", "qhash": "585a8bf33558fa53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ص' in w)", "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('حصان طائرة صديق فجر مكتبة نور لغة جمل') == 2", "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('حصان طائرة صديق فجر مكتبة نور لغة جمل') == 2\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('ماء برتقال تفاحة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ec7a86924394b2ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor i in range(5, 16, 2):\n total += i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor i in range(5, 16, 2):\n total += i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "b7050cd475236fba", "answer": "375\n15", "completion": " الناتج:\n```text\n375\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 5 == 0)", "tests": ["assert multiples_total(197) == 11702", "assert multiples_total(142) == 5950", "assert multiples_total(268) == 21467", "assert multiples_total(101) == 3050", "assert multiples_total(279) == 23380", "assert multiples_total(137) == 5672", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(197) == 11702\nassert multiples_total(142) == 5950\nassert multiples_total(268) == 21467\nassert multiples_total(101) == 3050\nassert multiples_total(279) == 23380\nassert multiples_total(137) == 5672\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 % 5 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 5، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(197)` يُرجع `11702`.\nالجواب:", "qhash": "f1fc5dd901f2a86b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 17\nfor j in range(-4, -1, 3):\n result -= j * 2\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 17\nfor j in range(-4, -1, 3):\n result -= j * 2\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "b14ca4252f704c3e", "answer": "25\n-4", "completion": " الناتج:\n```text\n25\n-4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 19)", "tests": ["assert pick_between([9, -16, -14, 26, 11, 10, 14, 3, 16, 28]) == [-80, -70, -55, -50, -45, -15]", "assert pick_between([-1, 28, 6, 30, 10, -28, 36, -26, 58, -29]) == [-50, -30, 5]", "assert pick_between([54, -14, 28, 50]) == []", "assert pick_between([28, 39, 30, 19]) == [-95]", "assert pick_between([-3]) == [15]", "assert pick_between([-25, 38, -25, -9, 32]) == []", "assert pick_between([-28, 49, 10, 33, 40]) == [-50]", "assert pick_between([]) == []"], "test_code": "assert pick_between([9, -16, -14, 26, 11, 10, 14, 3, 16, 28]) == [-80, -70, -55, -50, -45, -15]\nassert pick_between([-1, 28, 6, 30, 10, -28, 36, -26, 58, -29]) == [-50, -30, 5]\nassert pick_between([54, -14, 28, 50]) == []\nassert pick_between([28, 39, 30, 19]) == [-95]\nassert pick_between([-3]) == [15]\nassert pick_between([-25, 38, -25, -9, 32]) == []\nassert pick_between([-28, 49, 10, 33, 40]) == [-50]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 19)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 19)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -6 ≤ x ≤ 19، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([9, -16, -14, 26, 11, 10, 14, 3, 16, 28])` يُرجع `[-80, -70, -55, -50, -45, -15]`.\nالجواب:", "qhash": "494b164f7a5d4ae4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [5, 35, -2, 22, 40]\nprint(data[3:5])\nprint(data[::-1])\nprint(max(data[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [5, 35, -2, 22, 40]\nprint(data[3:5])\nprint(data[::-1])\nprint(max(data[3:5]))\n```\nالجواب:", "qhash": "165b736e368ae9df", "answer": "[22, 40]\n[40, 22, -2, 35, 5]\n40", "completion": " الناتج:\n```text\n[22, 40]\n[40, 22, -2, 35, 5]\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 53) == 1)", "tests": ["assert coprime_count(53) == 52", "assert coprime_count(134) == 132", "assert coprime_count(82) == 81", "assert coprime_count(191) == 188", "assert coprime_count(176) == 173", "assert coprime_count(3) == 3", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(53) == 52\nassert coprime_count(134) == 132\nassert coprime_count(82) == 81\nassert coprime_count(191) == 188\nassert coprime_count(176) == 173\nassert coprime_count(3) == 3\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, 53) == 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, 53) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 53، أي أن القاسم المشترك الأكبر لها مع 53 يساوي 1.\nمثال: `coprime_count(53)` يجب أن تُرجع `52`.\nالجواب:", "qhash": "e5c4f1619696b0db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(86) == 1050", "assert total_multiples(30) == 126", "assert total_multiples(206) == 5990", "assert total_multiples(249) == 8946", "assert total_multiples(101) == 1524", "assert total_multiples(285) == 11624", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(86) == 1050\nassert total_multiples(30) == 126\nassert total_multiples(206) == 5990\nassert total_multiples(249) == 8946\nassert total_multiples(101) == 1524\nassert total_multiples(285) == 11624\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 14.\nمثال: `total_multiples(86)` يجب أن تُرجع `1050`.\nالجواب:", "qhash": "3486aa561bba313d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 14\nfor x in range(0, 11, 1):\n s += x * 1\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 14\nfor x in range(0, 11, 1):\n s += x * 1\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "36bdebd67c36e7fa", "answer": "69\n10", "completion": " الناتج:\n```text\n69\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert rev_join('stone coffee we cloud engine garden falcon') == 'falcon,garden,engine,cloud,coffee,stone'", "assert rev_join('rocket summer garden brain river') == 'river,brain,garden,summer,rocket'", "assert rev_join('data winter table vector up of river') == 'river,vector,table,winter'", "assert rev_join('summer brain rocket music') == 'music,rocket,brain,summer'", "assert rev_join('signal python engine python a') == 'python,engine,python,signal'", "assert rev_join('of at table music rocket') == 'rocket,music,table'", "assert rev_join('summer we garden pixel coffee on engine') == 'engine,coffee,pixel,garden,summer'"], "test_code": "assert rev_join('stone coffee we cloud engine garden falcon') == 'falcon,garden,engine,cloud,coffee,stone'\nassert rev_join('rocket summer garden brain river') == 'river,brain,garden,summer,rocket'\nassert rev_join('data winter table vector up of river') == 'river,vector,table,winter'\nassert rev_join('summer brain rocket music') == 'music,rocket,brain,summer'\nassert rev_join('signal python engine python a') == 'python,engine,python,signal'\nassert rev_join('of at table music rocket') == 'rocket,music,table'\nassert rev_join('summer we garden pixel coffee on engine') == 'engine,coffee,pixel,garden,summer'", "answer": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_join('stone coffee we cloud engine garden falcon')` يُرجع `'falcon,garden,engine,cloud,coffee,stone'`.\nالجواب:", "qhash": "133edfb883a229b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(796672075))\nprint(rec(rec(796672075)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(796672075))\nprint(rec(rec(796672075)))\n```\nالجواب:", "qhash": "19ae5599e1493b23", "answer": "49\n13", "completion": " الناتج:\n```text\n49\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('banana is cloud signal camel cloud summer planet') == 'planet summer signal banana'", "assert flip_words('python data planet summer an coffee data') == 'coffee summer planet python'", "assert flip_words('') == ''", "assert flip_words('') == ''", "assert flip_words('go in of to cloud window of brain') == 'window'", "assert flip_words('planet by up river is') == 'planet'", "assert flip_words('go garden to garden code table') == 'garden garden'"], "test_code": "assert flip_words('banana is cloud signal camel cloud summer planet') == 'planet summer signal banana'\nassert flip_words('python data planet summer an coffee data') == 'coffee summer planet python'\nassert flip_words('') == ''\nassert flip_words('') == ''\nassert flip_words('go in of to cloud window of brain') == 'window'\nassert flip_words('planet by up river is') == 'planet'\nassert flip_words('go garden to garden code table') == 'garden garden'", "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('banana is cloud signal camel cloud summer planet')` يجب أن تُرجع `'planet summer signal banana'`.\nالجواب:", "qhash": "74ff0f4604d62498"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 28) == 1)", "tests": ["assert coprime_count(18) == 8", "assert coprime_count(91) == 39", "assert coprime_count(128) == 55", "assert coprime_count(34) == 15", "assert coprime_count(74) == 32", "assert coprime_count(97) == 42", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(18) == 8\nassert coprime_count(91) == 39\nassert coprime_count(128) == 55\nassert coprime_count(34) == 15\nassert coprime_count(74) == 32\nassert coprime_count(97) == 42\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, 28) == 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, 28) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 28، أي أن القاسم المشترك الأكبر لها مع 28 يساوي 1.\nمثال: `coprime_count(18)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "87c063001fa8b72c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 4 * x ** 2 + (-2) * x + (-1)", "tests": ["assert value_at(9) == 305", "assert value_at(17) == 1121", "assert value_at(-18) == 1331", "assert value_at(-14) == 811", "assert value_at(8) == 239", "assert value_at(0) == -1", "assert value_at(-16) == 1055", "assert value_at(0) == -1"], "test_code": "assert value_at(9) == 305\nassert value_at(17) == 1121\nassert value_at(-18) == 1331\nassert value_at(-14) == 811\nassert value_at(8) == 239\nassert value_at(0) == -1\nassert value_at(-16) == 1055\nassert value_at(0) == -1", "answer": "def value_at(x):\n return 4 * x ** 2 + (-2) * x + (-1)", "completion": " ```python\ndef value_at(x):\n return 4 * x ** 2 + (-2) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 4x² - 2x - 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(9)` يُرجع `305`.\nالجواب:", "qhash": "d820beb13ae0aea7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 30", "tests": ["assert digit_power(77326) == 15", "assert digit_power(140647) == 10", "assert digit_power(519448) == 5", "assert digit_power(273984) == 1", "assert digit_power(858402) == 29", "assert digit_power(351272) == 20", "assert digit_power(582455) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(77326) == 15\nassert digit_power(140647) == 10\nassert digit_power(519448) == 5\nassert digit_power(273984) == 1\nassert digit_power(858402) == 29\nassert digit_power(351272) == 20\nassert digit_power(582455) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 30", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 30\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 30.\nمثال: `digit_power(77326)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "17365b405b34e37d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'ميناء'\nprint(s.split())\nprint(s.replace(' ', '-'))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'ميناء'\nprint(s.split())\nprint(s.replace(' ', '-'))\nprint(s[-1])\n```\nالجواب:", "qhash": "620110c11340ce6a", "answer": "['ميناء']\nميناء\nء", "completion": " الناتج:\n```text\n['ميناء']\nميناء\nء\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-10, -9, 2, 18, 24]\nprint(sorted(nums, key=lambda x: (abs(x - 29), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-10, -9, 2, 18, 24]\nprint(sorted(nums, key=lambda x: (abs(x - 29), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "1afb6d76c90f8fab", "answer": "[24, 18, 2, -9, -10]\n[24, 18, 2]", "completion": " الناتج:\n```text\n[24, 18, 2, -9, -10]\n[24, 18, 2]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 1 + 2 for x in range(1, 8) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 1 + 2 for x in range(1, 8) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "e6ff07f3cc4dfa90", "answer": "[4, 8]\n2 12", "completion": " الناتج:\n```text\n[4, 8]\n2 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ق')", "tests": ["assert count_hits('تفاحة حاسوب تفاحة نهار جمل طائرة') == 0", "assert count_hits('ليل ليل قلم') == 1", "assert count_hits('') == 0", "assert count_hits('قهوة نهر مدرسة') == 1", "assert count_hits('نور مكتبة حصان طالب سلام معلم سيارة رمل') == 0", "assert count_hits('طالب برمجة صديق وردة كتاب حاسوب طالب') == 1", "assert count_hits('صحراء سيارة ماء سيارة وردة قمر كتاب') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('تفاحة حاسوب تفاحة نهار جمل طائرة') == 0\nassert count_hits('ليل ليل قلم') == 1\nassert count_hits('') == 0\nassert count_hits('قهوة نهر مدرسة') == 1\nassert count_hits('نور مكتبة حصان طالب سلام معلم سيارة رمل') == 0\nassert count_hits('طالب برمجة صديق وردة كتاب حاسوب طالب') == 1\nassert count_hits('صحراء سيارة ماء سيارة وردة قمر كتاب') == 1\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": "49f40edf8d09b71d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [20, -6, 4, 28, 19, 1, 26, -3]\nprint(lst[3:5])\nprint(lst[::-1])\nprint(sum(lst[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [20, -6, 4, 28, 19, 1, 26, -3]\nprint(lst[3:5])\nprint(lst[::-1])\nprint(sum(lst[3:5]))\n```\nالجواب:", "qhash": "38a3f42a088a9e4f", "answer": "[28, 19]\n[-3, 26, 1, 19, 28, 4, -6, 20]\n47", "completion": " الناتج:\n```text\n[28, 19]\n[-3, 26, 1, 19, 28, 4, -6, 20]\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'هدى': 22, 'علي': 48, 'عمر': 14, 'سعيد': 27}\nmarks['سعيد'] += 8\nmarks['يوسف'] = 35\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'هدى': 22, 'علي': 48, 'عمر': 14, 'سعيد': 27}\nmarks['سعيد'] += 8\nmarks['يوسف'] = 35\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))\n```\nالجواب:", "qhash": "bd17b742c2ea4f89", "answer": "5\nعلي\n154\n-1", "completion": " الناتج:\n```text\n5\nعلي\n154\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 1 for x in range(4, 18) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 1 for x in range(4, 18) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "3695082d2a5770b3", "answer": "[63, 168]\n2 231", "completion": " الناتج:\n```text\n[63, 168]\n2 231\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_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 count_div([59, 61, 44, 90, 57, 81, 74, 21, 38, 79]) == 1", "assert count_div([79]) == 0", "assert count_div([-26, 3, 0, 28, 11, 25, 37, -4, -9]) == 2", "assert count_div([82, -30, -36, 55, -25, -36, 21, 72, 30]) == 0", "assert count_div([26, 82, -23, 38, 32, -38, 65, 78, 32, -3]) == 2", "assert count_div([74, 66, -12, 11, 41, 9]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([59, 61, 44, 90, 57, 81, 74, 21, 38, 79]) == 1\nassert count_div([79]) == 0\nassert count_div([-26, 3, 0, 28, 11, 25, 37, -4, -9]) == 2\nassert count_div([82, -30, -36, 55, -25, -36, 21, 72, 30]) == 0\nassert count_div([26, 82, -23, 38, 32, -38, 65, 78, 32, -3]) == 2\nassert count_div([74, 66, -12, 11, 41, 9]) == 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 % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 6، ثم اكتب الدالة كاملة.\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([59, 61, 44, 90, 57, 81, 74, 21, 38, 79])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "ea5e3f69e9dc7a69"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [38, 39, -15, 36, 13, 9, 13, -17]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [38, 39, -15, 36, 13, 9, 13, -17]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "abd9c8bd796dcd13", "answer": "[13, 13, 36, 9, 38, 39, -15, -17]\n[39, 38, 36]", "completion": " الناتج:\n```text\n[13, 13, 36, 9, 38, 39, -15, -17]\n[39, 38, 36]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (-2) * x + (5)", "tests": ["assert poly(6) == -115", "assert poly(12) == -451", "assert poly(-4) == -35", "assert poly(-12) == -403", "assert poly(13) == -528", "assert poly(9) == -256", "assert poly(-6) == -91", "assert poly(0) == 5"], "test_code": "assert poly(6) == -115\nassert poly(12) == -451\nassert poly(-4) == -35\nassert poly(-12) == -403\nassert poly(13) == -528\nassert poly(9) == -256\nassert poly(-6) == -91\nassert poly(0) == 5", "answer": "def poly(x):\n return -3 * x ** 2 + (-2) * x + (5)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (-2) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -3x² - 2x + 5 عند العدد الصحيح x.\nمثال: `poly(6)` يجب أن تُرجع `-115`.\nالجواب:", "qhash": "7dc831398a351b00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "tests": ["assert total_pow(7) == 84", "assert total_pow(3) == 18", "assert total_pow(0) == 0", "assert total_pow(4) == 30", "assert total_pow(6) == 63", "assert total_pow(1) == 3", "assert total_pow(0) == 0"], "test_code": "assert total_pow(7) == 84\nassert total_pow(3) == 18\nassert total_pow(0) == 0\nassert total_pow(4) == 30\nassert total_pow(6) == 63\nassert total_pow(1) == 3\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 1\n return total\n```\nمثال: `total_pow(7)` يجب أن تُرجع `84`.\nالجواب:", "qhash": "317ddf31ee8ff9ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(10))\nprint(calc(10, -6))\nprint(calc(calc(-6), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(10))\nprint(calc(10, -6))\nprint(calc(calc(-6), 10))\n```\nالجواب:", "qhash": "e34d759ddbf2f9fa", "answer": "43\n56\n135", "completion": " الناتج:\n```text\n43\n56\n135\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 8 * x ** 2 + (2) * x + (-9)", "tests": ["assert eval_poly(6) == 291", "assert eval_poly(6) == 291", "assert eval_poly(0) == -9", "assert eval_poly(0) == -9", "assert eval_poly(17) == 2337", "assert eval_poly(10) == 811", "assert eval_poly(-19) == 2841", "assert eval_poly(0) == -9"], "test_code": "assert eval_poly(6) == 291\nassert eval_poly(6) == 291\nassert eval_poly(0) == -9\nassert eval_poly(0) == -9\nassert eval_poly(17) == 2337\nassert eval_poly(10) == 811\nassert eval_poly(-19) == 2841\nassert eval_poly(0) == -9", "answer": "def eval_poly(x):\n return 8 * x ** 2 + (2) * x + (-9)", "completion": " ```python\ndef eval_poly(x):\n return 8 * x ** 2 + (2) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 8x² + 2x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(6)` يُرجع `291`.\nالجواب:", "qhash": "738d940f1bffd81d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 67", "tests": ["assert rec_prod(11) == 9", "assert rec_prod(36) == 11", "assert rec_prod(28) == 53", "assert rec_prod(52) == 47", "assert rec_prod(51) == 7", "assert rec_prod(27) == 14", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 9\nassert rec_prod(36) == 11\nassert rec_prod(28) == 53\nassert rec_prod(52) == 47\nassert rec_prod(51) == 7\nassert rec_prod(27) == 14\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 67", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(11)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "958184ed6ed0699a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert roll([6, 9, 39, 13, 5]) == [13, 5, 6, 9, 39]", "assert roll([3, 41, 20, -9, 48, 13, 50, 36]) == [41, 20, -9, 48, 13, 50, 36, 3]", "assert roll([13, 4, 2, 33, 27, 5, 32, 8, 25, 41]) == [33, 27, 5, 32, 8, 25, 41, 13, 4, 2]", "assert roll([31, 7, 13, 9, 18, 20]) == [20, 31, 7, 13, 9, 18]", "assert roll([45, 20, 6, 5]) == [20, 6, 5, 45]", "assert roll([7, -4, 2, 23, -6, 15, 50]) == [7, -4, 2, 23, -6, 15, 50]", "assert roll([]) == []"], "test_code": "assert roll([6, 9, 39, 13, 5]) == [13, 5, 6, 9, 39]\nassert roll([3, 41, 20, -9, 48, 13, 50, 36]) == [41, 20, -9, 48, 13, 50, 36, 3]\nassert roll([13, 4, 2, 33, 27, 5, 32, 8, 25, 41]) == [33, 27, 5, 32, 8, 25, 41, 13, 4, 2]\nassert roll([31, 7, 13, 9, 18, 20]) == [20, 31, 7, 13, 9, 18]\nassert roll([45, 20, 6, 5]) == [20, 6, 5, 45]\nassert roll([7, -4, 2, 23, -6, 15, 50]) == [7, -4, 2, 23, -6, 15, 50]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef roll(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(items):\n if not items:\n return []\n k = 7 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `roll([6, 9, 39, 13, 5])` يُرجع `[13, 5, 6, 9, 39]`.\nالجواب:", "qhash": "2df9c935eebd62f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'باسل': 15, 'زينب': 4, 'أحمد': 15}\nd['زينب'] += 17\nd['سلمى'] = 14\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 = {'باسل': 15, 'زينب': 4, 'أحمد': 15}\nd['زينب'] += 17\nd['سلمى'] = 14\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": "8dbf9ddf80310511", "answer": "4\nزينب\n65\n[('سلمى', 14), ('أحمد', 15)]", "completion": " الناتج:\n```text\n4\nزينب\n65\n[('سلمى', 14), ('أحمد', 15)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_div([56, 32, 39, 73, 65, 39, 10, 47]) == 3", "assert count_div([89, 53, -33, 27, -10]) == 1", "assert count_div([-25, 17, 52, -18, 3, 7]) == 1", "assert count_div([23, 59, 73, 55, 27]) == 0", "assert count_div([41, 72, 80, 8, 81, 46, 82, 47, 47, 79]) == 4", "assert count_div([48, -17, 15, -7, -28, 70, 50, -6, 89, 34, 16]) == 7", "assert count_div([]) == 0"], "test_code": "assert count_div([56, 32, 39, 73, 65, 39, 10, 47]) == 3\nassert count_div([89, 53, -33, 27, -10]) == 1\nassert count_div([-25, 17, 52, -18, 3, 7]) == 1\nassert count_div([23, 59, 73, 55, 27]) == 0\nassert count_div([41, 72, 80, 8, 81, 46, 82, 47, 47, 79]) == 4\nassert count_div([48, -17, 15, -7, -28, 70, 50, -6, 89, 34, 16]) == 7\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 9، ثم اكتب الدالة كاملة.\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([56, 32, 39, 73, 65, 39, 10, 47])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "727a0f99b0c0838b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'نور': 21, 'عمر': 16, 'سعيد': 22}\nscores['عمر'] += 16\nscores['راشد'] = 39\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 = {'نور': 21, 'عمر': 16, 'سعيد': 22}\nscores['عمر'] += 16\nscores['راشد'] = 39\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": "675acfd00b46e59b", "answer": "4\nراشد\n114\n[('نور', 21), ('سعيد', 22)]", "completion": " الناتج:\n```text\n4\nراشد\n114\n[('نور', 21), ('سعيد', 22)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 10007", "tests": ["assert fact_mod(4) == 8", "assert fact_mod(3) == 3", "assert fact_mod(22) == 1706", "assert fact_mod(12) == 6052", "assert fact_mod(48) == 917", "assert fact_mod(37) == 6584", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 8\nassert fact_mod(3) == 3\nassert fact_mod(22) == 1706\nassert fact_mod(12) == 6052\nassert fact_mod(48) == 917\nassert fact_mod(37) == 6584\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 10007", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(4)` يُرجع `8`.\nالجواب:", "qhash": "7c2c422bbfaee4cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 61", "tests": ["assert mfact(8) == 18", "assert mfact(55) == 52", "assert mfact(43) == 6", "assert mfact(51) == 57", "assert mfact(49) == 37", "assert mfact(35) == 32", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 18\nassert mfact(55) == 52\nassert mfact(43) == 6\nassert mfact(51) == 57\nassert mfact(49) == 37\nassert mfact(35) == 32\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 61", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(8)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "536acf9d0959d28e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('data music rocket in garden to') == 'garden,rocket,music'", "assert reverse_words('desert coffee table orange winter we coffee') == 'coffee,winter,orange,table,coffee,desert'", "assert reverse_words('by engine summer summer cloud in orange camel') == 'camel,orange,cloud,summer,summer,engine'", "assert reverse_words('we camel') == 'camel'", "assert reverse_words('at river stone coffee banana') == 'banana,coffee,stone,river'", "assert reverse_words('up an') == ''", "assert reverse_words('code') == ''"], "test_code": "assert reverse_words('data music rocket in garden to') == 'garden,rocket,music'\nassert reverse_words('desert coffee table orange winter we coffee') == 'coffee,winter,orange,table,coffee,desert'\nassert reverse_words('by engine summer summer cloud in orange camel') == 'camel,orange,cloud,summer,summer,engine'\nassert reverse_words('we camel') == 'camel'\nassert reverse_words('at river stone coffee banana') == 'banana,coffee,stone,river'\nassert reverse_words('up an') == ''\nassert reverse_words('code') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `reverse_words('data music rocket in garden to')` يُرجع `'garden,rocket,music'`.\nالجواب:", "qhash": "5c86d32f76724b67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 358\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 = 358\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": "ea064cce9191e469", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 2804\ncount = 0\nwhile m > 2:\n m = m // 7\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 2804\ncount = 0\nwhile m > 2:\n m = m // 7\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "16eaf9fd62d26013", "answer": "1 4", "completion": " الناتج:\n```text\n1 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('علم بحر قمر نهار برتقال') == 1", "assert prefix_hits('سيارة ميناء') == 0", "assert prefix_hits('باب ماء وردة نهر') == 0", "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('سيارة ميناء') == 0\nassert prefix_hits('باب ماء وردة نهر') == 0\nassert prefix_hits('علم قهوة مدرسة علم دفتر قلم برتقال سلام') == 2\nassert prefix_hits('نهار باب طالب نهر دفتر') == 0\nassert prefix_hits('جبل علم جبل') == 0\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 w.endswith('ق'):\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 w.endswith('ق'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('علم بحر قمر نهار برتقال')` يُرجع `1`.\nالجواب:", "qhash": "8ab403144eae6b66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return -8 * x ** 2 + (-2) * x + (7)", "tests": ["assert value_at(9) == -659", "assert value_at(9) == -659", "assert value_at(17) == -2339", "assert value_at(13) == -1371", "assert value_at(-16) == -2009", "assert value_at(6) == -293", "assert value_at(-15) == -1763", "assert value_at(0) == 7"], "test_code": "assert value_at(9) == -659\nassert value_at(9) == -659\nassert value_at(17) == -2339\nassert value_at(13) == -1371\nassert value_at(-16) == -2009\nassert value_at(6) == -293\nassert value_at(-15) == -1763\nassert value_at(0) == 7", "answer": "def value_at(x):\n return -8 * x ** 2 + (-2) * x + (7)", "completion": " ```python\ndef value_at(x):\n return -8 * x ** 2 + (-2) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار -8x² - 2x + 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(9)` يُرجع `-659`.\nالجواب:", "qhash": "53d46a0529678e67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 17) == 1)", "tests": ["assert phi_upto(120) == 113", "assert phi_upto(93) == 88", "assert phi_upto(57) == 54", "assert phi_upto(17) == 16", "assert phi_upto(31) == 30", "assert phi_upto(88) == 83", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(120) == 113\nassert phi_upto(93) == 88\nassert phi_upto(57) == 54\nassert phi_upto(17) == 16\nassert phi_upto(31) == 30\nassert phi_upto(88) == 83\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, 17) == 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, 17) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 17) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(120)` يُرجع `113`.\nالجواب:", "qhash": "0593efdfd6dfb496"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 3 + 7 for x in range(2, 16) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 3 + 7 for x in range(2, 16) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "66861c7b9eece7e0", "answer": "[13, 19, 25, 31, 37, 43, 49]\n7 217", "completion": " الناتج:\n```text\n[13, 19, 25, 31, 37, 43, 49]\n7 217\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate([9, 2, 44, 44]) == [9, 2, 44, 44]", "assert rotate([31, 47, 22, 1, 44, 29, -3, 36, -2]) == [47, 22, 1, 44, 29, -3, 36, -2, 31]", "assert rotate([4, 30, 45, 40, 50, 11, 46, 28, 5, 44, 40]) == [40, 50, 11, 46, 28, 5, 44, 40, 4, 30, 45]", "assert rotate([18, 43, 33, 20, 4, 4, 48]) == [48, 18, 43, 33, 20, 4, 4]", "assert rotate([47, -7, -4, 6, 22, 37, 38, -1, 25, 16]) == [-4, 6, 22, 37, 38, -1, 25, 16, 47, -7]", "assert rotate([34, 39, 3, 44, 38, 12, 12, 30]) == [34, 39, 3, 44, 38, 12, 12, 30]", "assert rotate([]) == []"], "test_code": "assert rotate([9, 2, 44, 44]) == [9, 2, 44, 44]\nassert rotate([31, 47, 22, 1, 44, 29, -3, 36, -2]) == [47, 22, 1, 44, 29, -3, 36, -2, 31]\nassert rotate([4, 30, 45, 40, 50, 11, 46, 28, 5, 44, 40]) == [40, 50, 11, 46, 28, 5, 44, 40, 4, 30, 45]\nassert rotate([18, 43, 33, 20, 4, 4, 48]) == [48, 18, 43, 33, 20, 4, 4]\nassert rotate([47, -7, -4, 6, 22, 37, 38, -1, 25, 16]) == [-4, 6, 22, 37, 38, -1, 25, 16, 47, -7]\nassert rotate([34, 39, 3, 44, 38, 12, 12, 30]) == [34, 39, 3, 44, 38, 12, 12, 30]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return ____\n```\nمثال: `rotate([9, 2, 44, 44])` يجب أن تُرجع `[9, 2, 44, 44]`.\nالجواب:", "qhash": "ce6a84fc4f68f102"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'كتاب دفتر'\nprint(w.split())\nprint('س' in w)\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'كتاب دفتر'\nprint(w.split())\nprint('س' in w)\nprint(w[0])\n```\nالجواب:", "qhash": "51bfe7f52c817d7f", "answer": "['كتاب', 'دفتر']\nFalse\nك", "completion": " الناتج:\n```text\n['كتاب', 'دفتر']\nFalse\nك\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([29, 26, 58, 47, 92, 74, 97]) == [29, 55, 113, 160, 0, 74, 171]", "assert capped_cumsum([98, 155, 153]) == [98, 0, 153]", "assert capped_cumsum([156, 25, 163, 125, 93, 2, 69, 139]) == [156, 181, 0, 125, 0, 2, 71, 0]", "assert capped_cumsum([-5, 86, 17, 102]) == [-5, 81, 98, 0]", "assert capped_cumsum([179, 18, 189, 7, 152, 111, 158, 59, 148, 118]) == [179, 0, 189, 0, 152, 0, 158, 0, 148, 0]", "assert capped_cumsum([6]) == [6]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([29, 26, 58, 47, 92, 74, 97]) == [29, 55, 113, 160, 0, 74, 171]\nassert capped_cumsum([98, 155, 153]) == [98, 0, 153]\nassert capped_cumsum([156, 25, 163, 125, 93, 2, 69, 139]) == [156, 181, 0, 125, 0, 2, 71, 0]\nassert capped_cumsum([-5, 86, 17, 102]) == [-5, 81, 98, 0]\nassert capped_cumsum([179, 18, 189, 7, 152, 111, 158, 59, 148, 118]) == [179, 0, 189, 0, 152, 0, 158, 0, 148, 0]\nassert capped_cumsum([6]) == [6]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(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 capped_cumsum(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سؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 191 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([29, 26, 58, 47, 92, 74, 97])` يُرجع `[29, 55, 113, 160, 0, 74, 171]`.\nالجواب:", "qhash": "421e6a4ba96ae18e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 5) // 3 for x in range(-6, 8) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 5) // 3 for x in range(-6, 8) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "fd9831e8cc4cec6f", "answer": "[0, 1, 2, 3]\n4 6", "completion": " الناتج:\n```text\n[0, 1, 2, 3]\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']", "assert play(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz', '19', 'Fizz', '21']", "assert play(5) == ['1', 'Fizz', '3', 'Fizz', '5']", "assert play(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']", "assert play(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11']"], "test_code": "assert play(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']\nassert play(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz', '19', 'Fizz', '21']\nassert play(5) == ['1', 'Fizz', '3', 'Fizz', '5']\nassert play(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']\nassert play(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 % 2 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Fizz'، وإن قَبِلها على 9 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(18)` يُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']`.\nالجواب:", "qhash": "c9283d1e137e6563"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert starts_count('ماء سيارة معلم مطر ماء باب') == 4", "assert starts_count('برتقال ماء باب ماء حاسوب مكتبة قمر') == 3", "assert starts_count('حديقة معلم برمجة') == 1", "assert starts_count('معلم مدينة مدرسة شمس') == 3", "assert starts_count('تفاحة سوق تفاحة وردة ميناء مكتبة') == 2", "assert starts_count('معلم لغة مدينة صديق معلم مكتبة عربية') == 4", "assert starts_count('') == 0"], "test_code": "assert starts_count('ماء سيارة معلم مطر ماء باب') == 4\nassert starts_count('برتقال ماء باب ماء حاسوب مكتبة قمر') == 3\nassert starts_count('حديقة معلم برمجة') == 1\nassert starts_count('معلم مدينة مدرسة شمس') == 3\nassert starts_count('تفاحة سوق تفاحة وردة ميناء مكتبة') == 2\nassert starts_count('معلم لغة مدينة صديق معلم مكتبة عربية') == 4\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(line):\n count = 0\n for w in line:\n if w.startswith('م'):\n count += 1\n return count\n```\nمثال: `starts_count('ماء سيارة معلم مطر ماء باب')` يجب أن تُرجع `4`.\nالجواب:", "qhash": "350c83598d64b1b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -7 * x ** 2 + (-6) * x + (5)", "tests": ["assert eval_poly(9) == -616", "assert eval_poly(-14) == -1283", "assert eval_poly(-7) == -296", "assert eval_poly(-15) == -1480", "assert eval_poly(9) == -616", "assert eval_poly(1) == -8", "assert eval_poly(-6) == -211", "assert eval_poly(0) == 5"], "test_code": "assert eval_poly(9) == -616\nassert eval_poly(-14) == -1283\nassert eval_poly(-7) == -296\nassert eval_poly(-15) == -1480\nassert eval_poly(9) == -616\nassert eval_poly(1) == -8\nassert eval_poly(-6) == -211\nassert eval_poly(0) == 5", "answer": "def eval_poly(x):\n return -7 * x ** 2 + (-6) * x + (5)", "completion": " ```python\ndef eval_poly(x):\n return -7 * x ** 2 + (-6) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -7x² - 6x + 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(9)` يُرجع `-616`.\nالجواب:", "qhash": "72e8b26ddb4b9517"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('is matrix pixel by stone OK') == 'jt nbusjy qjyfm cz tupof OK'", "assert cipher('matrix light on') == 'nbusjy mjhiu po'", "assert cipher('banana brain code garden') == 'cbobob csbjo dpef hbsefo'", "assert cipher('winter music camel desert') == 'xjoufs nvtjd dbnfm eftfsu'", "assert cipher('rocket desert planet data') == 'spdlfu eftfsu qmbofu ebub'", "assert cipher('engine summer up vector apple OK') == 'fohjof tvnnfs vq wfdups bqqmf OK'", "assert cipher('') == ''"], "test_code": "assert cipher('is matrix pixel by stone OK') == 'jt nbusjy qjyfm cz tupof OK'\nassert cipher('matrix light on') == 'nbusjy mjhiu po'\nassert cipher('banana brain code garden') == 'cbobob csbjo dpef hbsefo'\nassert cipher('winter music camel desert') == 'xjoufs nvtjd dbnfm eftfsu'\nassert cipher('rocket desert planet data') == 'spdlfu eftfsu qmbofu ebub'\nassert cipher('engine summer up vector apple OK') == 'fohjof tvnnfs vq wfdups bqqmf OK'\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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('is matrix pixel by stone OK')` يجب أن تُرجع `'jt nbusjy qjyfm cz tupof OK'`.\nالجواب:", "qhash": "3c2489d4f543d340"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_div([13, 21, 41, 36, 31, 15]) == 0", "assert count_div([-28, 63, -39, 61, 53, -13, 34, 52, 34, 86, 55]) == 5", "assert count_div([51, 51, 18, -8, 39, 40, 58, 75]) == 3", "assert count_div([84, -5, 34, -7, -25, 57, 41, 35, 4, 36]) == 2", "assert count_div([64, -19, 44, -5, 7, 61]) == 2", "assert count_div([-5, -27, 77, -36, -19, -21, -39]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([13, 21, 41, 36, 31, 15]) == 0\nassert count_div([-28, 63, -39, 61, 53, -13, 34, 52, 34, 86, 55]) == 5\nassert count_div([51, 51, 18, -8, 39, 40, 58, 75]) == 3\nassert count_div([84, -5, 34, -7, -25, 57, 41, 35, 4, 36]) == 2\nassert count_div([64, -19, 44, -5, 7, 61]) == 2\nassert count_div([-5, -27, 77, -36, -19, -21, -39]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 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 % 2 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 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([13, 21, 41, 36, 31, 15])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f0f14db3ebdec10b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if 'ب' in w)", "tests": ["assert tally_letter('قهوة ميناء مكتبة مكتبة') == 2", "assert tally_letter('قمر') == 0", "assert tally_letter('سوق علم جبل') == 1", "assert tally_letter('نور مكتبة مطر علم قمر طالب نور') == 2", "assert tally_letter('قمر ميناء لغة') == 0", "assert tally_letter('رمل شمس نور ماء') == 0", "assert tally_letter('سوق مكتبة نهار') == 1", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('قهوة ميناء مكتبة مكتبة') == 2\nassert tally_letter('قمر') == 0\nassert tally_letter('سوق علم جبل') == 1\nassert tally_letter('نور مكتبة مطر علم قمر طالب نور') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ب» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('قهوة ميناء مكتبة مكتبة')` يُرجع `2`.\nالجواب:", "qhash": "2e5bd8107f028bb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'هشام': 19, 'خالد': 13, 'هدى': 23}\nscores['خالد'] += 16\nscores['أحمد'] = 2\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 = {'هشام': 19, 'خالد': 13, 'هدى': 23}\nscores['خالد'] += 16\nscores['أحمد'] = 2\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": "dec08c9dec7aa43b", "answer": "4\nخالد\n73\n[('أحمد', 2), ('هشام', 19)]", "completion": " الناتج:\n```text\n4\nخالد\n73\n[('أحمد', 2), ('هشام', 19)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('سلمى', 51), ('سعيد', 52), ('مريم', 77), ('يوسف', 58)]\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 = [('سلمى', 51), ('سعيد', 52), ('مريم', 77), ('يوسف', 58)]\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": "1265bc257ec73424", "answer": "[('سلمى', 51), ('سعيد', 52), ('يوسف', 58), ('مريم', 77)]\n['مريم', 'يوسف']", "completion": " الناتج:\n```text\n[('سلمى', 51), ('سعيد', 52), ('يوسف', 58), ('مريم', 77)]\n['مريم', 'يوسف']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 2\nfor n in range(3, 25, 1):\n s -= n * 1\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 2\nfor n in range(3, 25, 1):\n s -= n * 1\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "220d691c321a185e", "answer": "-295\n24", "completion": " الناتج:\n```text\n-295\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([15, -29, 32, -22, 37, 44, -25, 27]) == None", "assert best_multiple([-35, -14, -35]) == -14", "assert best_multiple([1, 8]) == None", "assert best_multiple([29, -15]) == None", "assert best_multiple([38, -38, -23, -4, 18, -15, 39, 47]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([15, -29, 32, -22, 37, 44, -25, 27]) == None\nassert best_multiple([-35, -14, -35]) == -14\nassert best_multiple([1, 8]) == None\nassert best_multiple([29, -15]) == None\nassert best_multiple([38, -38, -23, -4, 18, -15, 39, 47]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(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للتوضيح: الاستدعاء `best_multiple([15, -29, 32, -22, 37, 44, -25, 27])` يُرجع `None`.\nالجواب:", "qhash": "1d2730344f6e3fe5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert game(13) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13']", "assert game(19) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19']", "assert game(12) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12']", "assert game(7) == ['1', '2', '3', '4', '5', '6', 'Hi']", "assert game(3) == ['1', '2', '3']"], "test_code": "assert game(13) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13']\nassert game(19) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19']\nassert game(12) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12']\nassert game(7) == ['1', '2', '3', '4', '5', '6', 'Hi']\nassert game(3) == ['1', '2', '3']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Hi'، وعلى 10 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(13)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13']`.\nالجواب:", "qhash": "ea755aa96f12185c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 199\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 = 199\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": "3f6d52999ed6f0f1", "answer": "119", "completion": " الناتج:\n```text\n119\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 45) == 1)", "tests": ["assert rel_prime_count(54) == 29", "assert rel_prime_count(86) == 46", "assert rel_prime_count(178) == 95", "assert rel_prime_count(134) == 72", "assert rel_prime_count(43) == 23", "assert rel_prime_count(132) == 70", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(54) == 29\nassert rel_prime_count(86) == 46\nassert rel_prime_count(178) == 95\nassert rel_prime_count(134) == 72\nassert rel_prime_count(43) == 23\nassert rel_prime_count(132) == 70\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, 45) == 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, 45) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 45) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(54)` يُرجع `29`.\nالجواب:", "qhash": "3c42aaacb8ffd969"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'ليلى': 8, 'حسن': 4, 'خالد': 41}\nd['ليلى'] += 15\nd['أحمد'] = 50\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'ليلى': 8, 'حسن': 4, 'خالد': 41}\nd['ليلى'] += 15\nd['أحمد'] = 50\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('علي', -1))\n```\nالجواب:", "qhash": "a0c3944e2e616948", "answer": "4\nأحمد\n118\n-1", "completion": " الناتج:\n```text\n4\nأحمد\n118\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 4 + 6 for x in range(-2, 7) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 4 + 6 for x in range(-2, 7) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "6b65d3bd72c83983", "answer": "[2, 10, 18, 26]\n4 56", "completion": " الناتج:\n```text\n[2, 10, 18, 26]\n4 56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 53", "tests": ["assert rec_prod(4) == 4", "assert rec_prod(53) == 0", "assert rec_prod(31) == 12", "assert rec_prod(53) == 0", "assert rec_prod(46) == 28", "assert rec_prod(26) == 23", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(4) == 4\nassert rec_prod(53) == 0\nassert rec_prod(31) == 12\nassert rec_prod(53) == 0\nassert rec_prod(46) == 28\nassert rec_prod(26) == 23\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 53", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(4)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "6a57e9a5cd847b3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [3, 9, 35, -6, 3, 11]\nprint(data[2:6])\nprint(data[::-1])\nprint(sum(data[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [3, 9, 35, -6, 3, 11]\nprint(data[2:6])\nprint(data[::-1])\nprint(sum(data[2:6]))\n```\nالجواب:", "qhash": "a8383c64a707548e", "answer": "[35, -6, 3, 11]\n[11, 3, -6, 35, 9, 3]\n43", "completion": " الناتج:\n```text\n[35, -6, 3, 11]\n[11, 3, -6, 35, 9, 3]\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ق' in w)", "tests": ["assert count_ar('حصان شمس بيت قلم') == 1", "assert count_ar('باب حاسوب') == 0", "assert count_ar('سفينة ماء باب ليل عمل سيارة جبل') == 0", "assert count_ar('سلام صديق تفاحة بحر لغة') == 1", "assert count_ar('لغة ميناء بحر ماء شمس تفاحة شمس') == 0", "assert count_ar('نهار طالب مدينة مطر جبل نهار طائرة طالب') == 0", "assert count_ar('صحراء فجر ليل') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('حصان شمس بيت قلم') == 1\nassert count_ar('باب حاسوب') == 0\nassert count_ar('سفينة ماء باب ليل عمل سيارة جبل') == 0\nassert count_ar('سلام صديق تفاحة بحر لغة') == 1\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 'ق' 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('حصان شمس بيت قلم')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "58e90e57a446b9f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert reverse_words('summer planet up') == 'up/planet/summer'", "assert reverse_words('garden it pixel brain') == 'brain/pixel/it/garden'", "assert reverse_words('stone') == 'stone'", "assert reverse_words('a is in is go by') == 'by/go/is/in/is/a'", "assert reverse_words('go light engine is code camel brain camel') == 'camel/brain/camel/code/is/engine/light/go'", "assert reverse_words('python stone go signal window music falcon apple') == 'apple/falcon/music/window/signal/go/stone/python'", "assert reverse_words('') == ''"], "test_code": "assert reverse_words('summer planet up') == 'up/planet/summer'\nassert reverse_words('garden it pixel brain') == 'brain/pixel/it/garden'\nassert reverse_words('stone') == 'stone'\nassert reverse_words('a is in is go by') == 'by/go/is/in/is/a'\nassert reverse_words('go light engine is code camel brain camel') == 'camel/brain/camel/code/is/engine/light/go'\nassert reverse_words('python stone go signal window music falcon apple') == 'apple/falcon/music/window/signal/go/stone/python'\nassert reverse_words('') == ''", "answer": "def reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `reverse_words('summer planet up')` يُرجع `'up/planet/summer'`.\nالجواب:", "qhash": "371fb232cdb733d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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_div([26, 12, -13, -14]) == 26", "assert max_div([-4, -8, -8]) == -4", "assert max_div([1, 3, 5]) == None", "assert max_div([-38, -7, -27]) == -38", "assert max_div([26, 24, -23, 39, 9, 32, -16, 26, -14]) == 32", "assert max_div([]) == None"], "test_code": "assert max_div([26, 12, -13, -14]) == 26\nassert max_div([-4, -8, -8]) == -4\nassert max_div([1, 3, 5]) == None\nassert max_div([-38, -7, -27]) == -38\nassert max_div([26, 24, -23, 39, 9, 32, -16, 26, -14]) == 32\nassert max_div([]) == None", "answer": "def max_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_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_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_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_div([26, 12, -13, -14])` يُرجع `26`.\nالجواب:", "qhash": "ecefe289b903e63c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=5):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(7))\nprint(compute(7, 17))\nprint(compute(compute(17), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=5):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(7))\nprint(compute(7, 17))\nprint(compute(compute(17), 7))\n```\nالجواب:", "qhash": "4b0490fe5f87c834", "answer": "30\n92\n393", "completion": " الناتج:\n```text\n30\n92\n393\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([20, 52, 53, 0, -14, 15, 26, 36]) == 36", "assert top_divisible([-6, -3, -3]) == -3", "assert top_divisible([1]) == None", "assert top_divisible([-20, -23, 12, -30, -29, -6, 29, 36, 11]) == 36", "assert top_divisible([1, -22, 48, -33, -32, 35, -13, 26, 3]) == 48", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([20, 52, 53, 0, -14, 15, 26, 36]) == 36\nassert top_divisible([-6, -3, -3]) == -3\nassert top_divisible([1]) == None\nassert top_divisible([-20, -23, 12, -30, -29, -6, 29, 36, 11]) == 36\nassert top_divisible([1, -22, 48, -33, -32, 35, -13, 26, 3]) == 48\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(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مثال: `top_divisible([20, 52, 53, 0, -14, 15, 26, 36])` يجب أن تُرجع `36`.\nالجواب:", "qhash": "e9b85f1f736ca3f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '_'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('python garden winter it orange at brain summer') == 'summer_brain_at_orange_it_winter_garden_python'", "assert backwards('') == ''", "assert backwards('in is falcon winter orange planet') == 'planet_orange_winter_falcon_is_in'", "assert backwards('') == ''", "assert backwards('') == ''", "assert backwards('') == ''", "assert backwards('it to of up') == 'up_of_to_it'"], "test_code": "assert backwards('python garden winter it orange at brain summer') == 'summer_brain_at_orange_it_winter_garden_python'\nassert backwards('') == ''\nassert backwards('in is falcon winter orange planet') == 'planet_orange_winter_falcon_is_in'\nassert backwards('') == ''\nassert backwards('') == ''\nassert backwards('') == ''\nassert backwards('it to of up') == 'up_of_to_it'", "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('python garden winter it orange at brain summer')` يجب أن تُرجع `'summer_brain_at_orange_it_winter_garden_python'`.\nالجواب:", "qhash": "6ec5e4de7563021b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 43", "tests": ["assert dig_pow_mod(71820) == 18", "assert dig_pow_mod(446903) == 26", "assert dig_pow_mod(469926) == 36", "assert dig_pow_mod(213579) == 27", "assert dig_pow_mod(308920) == 22", "assert dig_pow_mod(240495) == 24", "assert dig_pow_mod(206348) == 23", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(71820) == 18\nassert dig_pow_mod(446903) == 26\nassert dig_pow_mod(469926) == 36\nassert dig_pow_mod(213579) == 27\nassert dig_pow_mod(308920) == 22\nassert dig_pow_mod(240495) == 24\nassert dig_pow_mod(206348) == 23\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 43", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 43.\nمثال: `dig_pow_mod(71820)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "998b59cde9f4c232"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('سماء قمر رمل فجر') == 1", "assert count_letter('عمل دفتر نور حاسوب قمر سلام') == 1", "assert count_letter('جمل برتقال حديقة طائرة') == 0", "assert count_letter('صحراء سلام بحر') == 1", "assert count_letter('صديق بحر جبل علم نور مكتبة') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('صحراء مدينة معلم مطر نور مكتبة مطر') == 0\nassert count_letter('برتقال علم رمل علم رمل') == 0\nassert count_letter('سماء قمر رمل فجر') == 1\nassert count_letter('عمل دفتر نور حاسوب قمر سلام') == 1\nassert count_letter('جمل برتقال حديقة طائرة') == 0\nassert count_letter('صحراء سلام بحر') == 1\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": "61d414d07a84bb8f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('river table signal of river OK') == 'duhqd fmnxq euszmx ar duhqd OK'", "assert rot('code an in data Hello') == 'oapq mz uz pmfm Hqxxa'", "assert rot('garden brain signal') == 'smdpqz ndmuz euszmx'", "assert rot('vector') == 'hqofad'", "assert rot('table an coffee OK') == 'fmnxq mz oarrqq OK'", "assert rot('camel stone A1') == 'omyqx efazq A1'", "assert rot('') == ''"], "test_code": "assert rot('river table signal of river OK') == 'duhqd fmnxq euszmx ar duhqd OK'\nassert rot('code an in data Hello') == 'oapq mz uz pmfm Hqxxa'\nassert rot('garden brain signal') == 'smdpqz ndmuz euszmx'\nassert rot('vector') == 'hqofad'\nassert rot('table an coffee OK') == 'fmnxq mz oarrqq OK'\nassert rot('camel stone A1') == 'omyqx efazq 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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('river table signal of river OK')` يجب أن تُرجع `'duhqd fmnxq euszmx ar duhqd OK'`.\nالجواب:", "qhash": "44f0e9ed098e4cb0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 46415\ncount = 0\nwhile n > 16:\n n = n // 8\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 46415\ncount = 0\nwhile n > 16:\n n = n // 8\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "13aefd8bf194fde3", "answer": "11 4", "completion": " الناتج:\n```text\n11 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= 10)", "tests": ["assert between_times([-9, -6, -12, 10, 8, -1]) == [-24, -18, -12, -2, 16, 20]", "assert between_times([32, 31, 8, 7]) == [14, 16]", "assert between_times([58, 19, 15, -16, 22, -25, -27, 60, -13]) == [-32, -26]", "assert between_times([-18, -26, 46, 36]) == [-36]", "assert between_times([59, 60, 7]) == [14]", "assert between_times([47, 23, 58]) == []", "assert between_times([34, 26, 23, 7, -26, 5, 3, 54, 26]) == [6, 10, 14]", "assert between_times([]) == []"], "test_code": "assert between_times([-9, -6, -12, 10, 8, -1]) == [-24, -18, -12, -2, 16, 20]\nassert between_times([32, 31, 8, 7]) == [14, 16]\nassert between_times([58, 19, 15, -16, 22, -25, -27, 60, -13]) == [-32, -26]\nassert between_times([-18, -26, 46, 36]) == [-36]\nassert between_times([59, 60, 7]) == [14]\nassert between_times([47, 23, 58]) == []\nassert between_times([34, 26, 23, 7, -26, 5, 3, 54, 26]) == [6, 10, 14]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= 10)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= 10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -19 و10 (شاملًا الطرفين) في 2.\nمثال: `between_times([-9, -6, -12, 10, 8, -1])` يجب أن تُرجع `[-24, -18, -12, -2, 16, 20]`.\nالجواب:", "qhash": "928e45bed7519cf3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(7, 0))", "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(7, 0))\n```\nالجواب:", "qhash": "a2d7326371cf80a1", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(947895434))\nprint(rec(rec(947895434)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(947895434))\nprint(rec(rec(947895434)))\n```\nالجواب:", "qhash": "e9f49f7f0de0c60c", "answer": "53\n8", "completion": " الناتج:\n```text\n53\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -5 for x in xs if 15 <= x <= 27)", "tests": ["assert select_range([16, 14, 25, 13, 30]) == [-125, -80]", "assert select_range([]) == []", "assert select_range([26, -12, 11]) == [-130]", "assert select_range([19, 17, 22, 24, 54, -26]) == [-120, -110, -95, -85]", "assert select_range([41, 5, 5]) == []", "assert select_range([56, 51, -15, 27, 51, 47, 1]) == [-135]", "assert select_range([59, 14, 24, 59, 60, 29, 32, 10, 28]) == [-120]", "assert select_range([]) == []"], "test_code": "assert select_range([16, 14, 25, 13, 30]) == [-125, -80]\nassert select_range([]) == []\nassert select_range([26, -12, 11]) == [-130]\nassert select_range([19, 17, 22, 24, 54, -26]) == [-120, -110, -95, -85]\nassert select_range([41, 5, 5]) == []\nassert select_range([56, 51, -15, 27, 51, 47, 1]) == [-135]\nassert select_range([59, 14, 24, 59, 60, 29, 32, 10, 28]) == [-120]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -5 for x in xs if 15 <= x <= 27)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -5 for x in xs if 15 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 15 ≤ x ≤ 27، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([16, 14, 25, 13, 30])` يُرجع `[-125, -80]`.\nالجواب:", "qhash": "a76f5f24d8f87cbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('camel winter python cloud') == 'cloud|python|winter|camel'", "assert reverse_words('winter of brain at data is') == 'brain|winter'", "assert reverse_words('on on apple') == 'apple'", "assert reverse_words('banana orange stone python engine in is code') == 'engine|python|stone|orange|banana'", "assert reverse_words('stone engine data light') == 'light|engine|stone'", "assert reverse_words('stone vector desert a we light') == 'light|desert|vector|stone'", "assert reverse_words('is data orange planet') == 'planet|orange'"], "test_code": "assert reverse_words('camel winter python cloud') == 'cloud|python|winter|camel'\nassert reverse_words('winter of brain at data is') == 'brain|winter'\nassert reverse_words('on on apple') == 'apple'\nassert reverse_words('banana orange stone python engine in is code') == 'engine|python|stone|orange|banana'\nassert reverse_words('stone engine data light') == 'light|engine|stone'\nassert reverse_words('stone vector desert a we light') == 'light|desert|vector|stone'\nassert reverse_words('is data orange planet') == 'planet|orange'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `reverse_words('camel winter python cloud')` يُرجع `'cloud|python|winter|camel'`.\nالجواب:", "qhash": "6882323aa1c29181"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('كتاب رمل صديق تفاحة كتاب نهر دفتر كتاب') == 3", "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('كتاب رمل صديق تفاحة كتاب نهر دفتر كتاب') == 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:\n if w.startswith('ك'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ك». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef prefix_hits(line):\n count = 0\n for w in line:\n if w.startswith('ك'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('دفتر ميناء خبز ليل كتاب برتقال')` يُرجع `1`.\nالجواب:", "qhash": "0bcfc3194fae5809"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 4 <= x <= 18)", "tests": ["assert pick_between([1, 9, -2, -3, 18, 3, 26, 27, 13]) == [18, 26, 36]", "assert pick_between([16, 18, -25, -5]) == [32, 36]", "assert pick_between([33]) == []", "assert pick_between([]) == []", "assert pick_between([-15]) == []", "assert pick_between([60, 54, 8, 33, 9, 27, -3, 47, 27]) == [16, 18]", "assert pick_between([-13, 34, 34, -1]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([1, 9, -2, -3, 18, 3, 26, 27, 13]) == [18, 26, 36]\nassert pick_between([16, 18, -25, -5]) == [32, 36]\nassert pick_between([33]) == []\nassert pick_between([]) == []\nassert pick_between([-15]) == []\nassert pick_between([60, 54, 8, 33, 9, 27, -3, 47, 27]) == [16, 18]\nassert pick_between([-13, 34, 34, -1]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 4 <= x <= 18)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if 4 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 18، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([1, 9, -2, -3, 18, 3, 26, 27, 13])` يُرجع `[18, 26, 36]`.\nالجواب:", "qhash": "e8025898a1b7e5f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "label_numbers", "reference": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(15) == ['1', '2', '3', 'Fizz', 'Buzz', '6', '7', 'Fizz', '9', 'Buzz', '11', 'Fizz', '13', '14', 'Buzz']", "assert label_numbers(2) == ['1', '2']", "assert label_numbers(4) == ['1', '2', '3', 'Fizz']", "assert label_numbers(16) == ['1', '2', '3', 'Fizz', 'Buzz', '6', '7', 'Fizz', '9', 'Buzz', '11', 'Fizz', '13', '14', 'Buzz', 'Fizz']", "assert label_numbers(5) == ['1', '2', '3', 'Fizz', 'Buzz']"], "test_code": "assert label_numbers(15) == ['1', '2', '3', 'Fizz', 'Buzz', '6', '7', 'Fizz', '9', 'Buzz', '11', 'Fizz', '13', '14', 'Buzz']\nassert label_numbers(2) == ['1', '2']\nassert label_numbers(4) == ['1', '2', '3', 'Fizz']\nassert label_numbers(16) == ['1', '2', '3', 'Fizz', 'Buzz', '6', '7', 'Fizz', '9', 'Buzz', '11', 'Fizz', '13', '14', 'Buzz', 'Fizz']\nassert label_numbers(5) == ['1', '2', '3', 'Fizz', 'Buzz']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 5 == 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 % 4 == 0:\n s += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Fizz'، وإن قَبِلها على 5 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(15)` يُرجع `['1', '2', '3', 'Fizz', 'Buzz', '6', '7', 'Fizz', '9', 'Buzz', '11', 'Fizz', '13', '14', 'Buzz']`.\nالجواب:", "qhash": "56c75f602efc606e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 8\nfor i in range(0, 5, 4):\n total -= i * 2\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 8\nfor i in range(0, 5, 4):\n total -= i * 2\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "847e54cf6f189403", "answer": "0\n4", "completion": " الناتج:\n```text\n0\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert pow_total(3) == 180", "assert pow_total(1) == 5", "assert pow_total(6) == 2205", "assert pow_total(4) == 500", "assert pow_total(8) == 6480", "assert pow_total(1) == 5", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 180\nassert pow_total(1) == 5\nassert pow_total(6) == 2205\nassert pow_total(4) == 500\nassert pow_total(8) == 6480\nassert pow_total(1) == 5\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 3\n return total\n```\nمثال: `pow_total(3)` يجب أن تُرجع `180`.\nالجواب:", "qhash": "5152bb2fe0d9e073"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('برتقال طالب علم سلام برتقال جمل') == 2", "assert begin_count('باب جبل مكتبة بحر مطر') == 2", "assert begin_count('علم نهر حصان نور باب ماء') == 1", "assert begin_count('صديق مطر') == 0", "assert begin_count('بيت نهار بحر وردة قمر باب') == 3", "assert begin_count('صديق نور جمل بيت برتقال باب') == 3", "assert begin_count('') == 0"], "test_code": "assert begin_count('برتقال طالب علم سلام برتقال جمل') == 2\nassert begin_count('باب جبل مكتبة بحر مطر') == 2\nassert begin_count('علم نهر حصان نور باب ماء') == 1\nassert begin_count('صديق مطر') == 0\nassert begin_count('بيت نهار بحر وردة قمر باب') == 3\nassert begin_count('صديق نور جمل بيت برتقال باب') == 3\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 w.endswith('ب'):\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 w.endswith('ب'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('برتقال طالب علم سلام برتقال جمل')` يُرجع `2`.\nالجواب:", "qhash": "94642af6fe359b18"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'خبز مدينة'\nprint(kalima.replace(' ', '-'))\nprint(kalima[0])\nprint(kalima.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'خبز مدينة'\nprint(kalima.replace(' ', '-'))\nprint(kalima[0])\nprint(kalima.split())\n```\nالجواب:", "qhash": "37a0c8f7be5540da", "answer": "خبز-مدينة\nخ\n['خبز', 'مدينة']", "completion": " الناتج:\n```text\nخبز-مدينة\nخ\n['خبز', 'مدينة']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 3 for x in range(1, 11) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 3 for x in range(1, 11) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "48cab21415fac124", "answer": "[-2, 22, 78]\n3 98", "completion": " الناتج:\n```text\n[-2, 22, 78]\n3 98\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [36, -7, -1, 22, 39, 39]\nprint(xs[1:3])\nprint(xs[::-2])\nprint(len(xs[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [36, -7, -1, 22, 39, 39]\nprint(xs[1:3])\nprint(xs[::-2])\nprint(len(xs[1:3]))\n```\nالجواب:", "qhash": "c725fc8eab5ae1a1", "answer": "[-7, -1]\n[39, 22, -7]\n2", "completion": " الناتج:\n```text\n[-7, -1]\n[39, 22, -7]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-3))\nprint(h(-3, -5))\nprint(h(h(-5), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-3))\nprint(h(-3, -5))\nprint(h(h(-5), -3))\n```\nالجواب:", "qhash": "e5209e5e6032e4d9", "answer": "60\n-16\n409", "completion": " الناتج:\n```text\n60\n-16\n409\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert tally_div([43, 54, 9, 80, 46, 16]) == 3", "assert tally_div([-2, -21, 53, 9, 66, -31]) == 2", "assert tally_div([-1, 36, 54, 30, 7, 9, 77, -36]) == 1", "assert tally_div([50, 43]) == 1", "assert tally_div([83, -12, 57, 51, -13, -4, -31, 75, 88, 10, -7, 76]) == 5", "assert tally_div([72, 50, -31, -36, 57]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([43, 54, 9, 80, 46, 16]) == 3\nassert tally_div([-2, -21, 53, 9, 66, -31]) == 2\nassert tally_div([-1, 36, 54, 30, 7, 9, 77, -36]) == 1\nassert tally_div([50, 43]) == 1\nassert tally_div([83, -12, 57, 51, -13, -4, -31, 75, 88, 10, -7, 76]) == 5\nassert tally_div([72, 50, -31, -36, 57]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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, 54, 9, 80, 46, 16])` يُرجع `3`.\nالجواب:", "qhash": "9783476bb8305d8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('مطر حصان ليل شمس حديقة') == 2", "assert prefix_hits('بحر فجر صحراء') == 0", "assert prefix_hits('حديقة جبل حديقة دفتر') == 2", "assert prefix_hits('بحر حديقة برمجة وردة علم شمس حديقة قمر') == 2", "assert prefix_hits('حصان حديقة مكتبة حديقة ماء') == 3", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('برمجة سلام جمل حاسوب حديقة سماء') == 2\nassert prefix_hits('مطر حصان ليل شمس حديقة') == 2\nassert prefix_hits('بحر فجر صحراء') == 0\nassert prefix_hits('حديقة جبل حديقة دفتر') == 2\nassert prefix_hits('بحر حديقة برمجة وردة علم شمس حديقة قمر') == 2\nassert prefix_hits('حصان حديقة مكتبة حديقة ماء') == 3\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 w.endswith('ح'):\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 w.endswith('ح'):\n count += 1\n return count\n```\nمثال: `prefix_hits('برمجة سلام جمل حاسوب حديقة سماء')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d27af8ccab0f03dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 50) == 1)", "tests": ["assert coprime_count(68) == 27", "assert coprime_count(4) == 2", "assert coprime_count(42) == 17", "assert coprime_count(22) == 9", "assert coprime_count(145) == 58", "assert coprime_count(11) == 5", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(68) == 27\nassert coprime_count(4) == 2\nassert coprime_count(42) == 17\nassert coprime_count(22) == 9\nassert coprime_count(145) == 58\nassert coprime_count(11) == 5\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, 50) == 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, 50) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 50) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(68)` يُرجع `27`.\nالجواب:", "qhash": "00739ad89a0b0665"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 13\nfor j in range(7, 21, 3):\n acc -= j * 8\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 13\nfor j in range(7, 21, 3):\n acc -= j * 8\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "2e0e363a9dd090f5", "answer": "-507\n19", "completion": " الناتج:\n```text\n-507\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('س')", "tests": ["assert count_ar('بحر برتقال دفتر عربية شجرة باب لغة') == 0", "assert count_ar('نور ميناء سلام صحراء بحر مكتبة سفينة') == 2", "assert count_ar('') == 0", "assert count_ar('برمجة جمل قمر') == 0", "assert count_ar('سماء سماء مطر') == 2", "assert count_ar('نهر فجر') == 0", "assert count_ar('قلم') == 0", "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('سماء سماء مطر') == 2\nassert count_ar('نهر فجر') == 0\nassert count_ar('قلم') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('س')", "completion": " ```python\ndef count_ar(text):\n return text.count('س')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `count_ar(text)` بحيث تُعيد عدد مرات ظهور الحرف «س» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('بحر برتقال دفتر عربية شجرة باب لغة')` يُرجع `0`.\nالجواب:", "qhash": "1077981b61af0a2e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 7 * x ** 2 + (-9) * x + (-7)", "tests": ["assert poly(8) == 369", "assert poly(4) == 69", "assert poly(-16) == 1929", "assert poly(-3) == 83", "assert poly(-10) == 783", "assert poly(14) == 1239", "assert poly(-5) == 213", "assert poly(0) == -7"], "test_code": "assert poly(8) == 369\nassert poly(4) == 69\nassert poly(-16) == 1929\nassert poly(-3) == 83\nassert poly(-10) == 783\nassert poly(14) == 1239\nassert poly(-5) == 213\nassert poly(0) == -7", "answer": "def poly(x):\n return 7 * x ** 2 + (-9) * x + (-7)", "completion": " ```python\ndef poly(x):\n return 7 * x ** 2 + (-9) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 7x² - 9x - 7 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `369`.\nالجواب:", "qhash": "88f8420ea759e96d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 98087\nsteps = 0\nwhile x > 10:\n x = x // 3\n steps += 1\nprint(x, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 98087\nsteps = 0\nwhile x > 10:\n x = x // 3\n steps += 1\nprint(x, steps)\n```\nالجواب:", "qhash": "1dd0c24f70c7d9ae", "answer": "4 9", "completion": " الناتج:\n```text\n4 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert shift_list([39, 47, 0, 11, 44, 13, 45, 16]) == [44, 13, 45, 16, 39, 47, 0, 11]", "assert shift_list([1, 40, 1, 3, -8, 32, -6, 18, 8, 42, 11]) == [11, 1, 40, 1, 3, -8, 32, -6, 18, 8, 42]", "assert shift_list([19, 48, -3, 46, 25, 12, 30, 12, 3, -2, -9]) == [-9, 19, 48, -3, 46, 25, 12, 30, 12, 3, -2]", "assert shift_list([40, -9, 33, 40, 48, -6, 4, 35, 28]) == [4, 35, 28, 40, -9, 33, 40, 48, -6]", "assert shift_list([-9, 40, 9, 13]) == [-9, 40, 9, 13]", "assert shift_list([-8, -9]) == [-8, -9]", "assert shift_list([]) == []"], "test_code": "assert shift_list([39, 47, 0, 11, 44, 13, 45, 16]) == [44, 13, 45, 16, 39, 47, 0, 11]\nassert shift_list([1, 40, 1, 3, -8, 32, -6, 18, 8, 42, 11]) == [11, 1, 40, 1, 3, -8, 32, -6, 18, 8, 42]\nassert shift_list([19, 48, -3, 46, 25, 12, 30, 12, 3, -2, -9]) == [-9, 19, 48, -3, 46, 25, 12, 30, 12, 3, -2]\nassert shift_list([40, -9, 33, 40, 48, -6, 4, 35, 28]) == [4, 35, 28, 40, -9, 33, 40, 48, -6]\nassert shift_list([-9, 40, 9, 13]) == [-9, 40, 9, 13]\nassert shift_list([-8, -9]) == [-8, -9]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return ____\n```\nمثال: `shift_list([39, 47, 0, 11, 44, 13, 45, 16])` يجب أن تُرجع `[44, 13, 45, 16, 39, 47, 0, 11]`.\nالجواب:", "qhash": "5a9a16b3bf385726"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "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 % 4 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([18, 52, 34, 88, 33, 39, 8, 58, 39, 46, 36, 2]) == 0", "assert how_many_div([-20, 50, -19, 59, -13, 12]) == 0", "assert how_many_div([55, -24, 17, 10, 68, -22, 43, -28, -15, -17, 78]) == 0", "assert how_many_div([47, 34]) == 0", "assert how_many_div([-5, 45, 59]) == 0", "assert how_many_div([10, 36, -38, 49, 27, -27, 16, -19, 70]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([18, 52, 34, 88, 33, 39, 8, 58, 39, 46, 36, 2]) == 0\nassert how_many_div([-20, 50, -19, 59, -13, 12]) == 0\nassert how_many_div([55, -24, 17, 10, 68, -22, 43, -28, -15, -17, 78]) == 0\nassert how_many_div([47, 34]) == 0\nassert how_many_div([-5, 45, 59]) == 0\nassert how_many_div([10, 36, -38, 49, 27, -27, 16, -19, 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 % 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 % 8 == 0 and x % 4 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([18, 52, 34, 88, 33, 39, 8, 58, 39, 46, 36, 2])` يُرجع `0`.\nالجواب:", "qhash": "b809ff0aecd27199"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "tests": ["assert weighted_sum(3) == 490", "assert weighted_sum(8) == 43860", "assert weighted_sum(5) == 4895", "assert weighted_sum(8) == 43860", "assert weighted_sum(4) == 1770", "assert weighted_sum(1) == 5", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 490\nassert weighted_sum(8) == 43860\nassert weighted_sum(5) == 4895\nassert weighted_sum(8) == 43860\nassert weighted_sum(4) == 1770\nassert weighted_sum(1) == 5\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total\n```\n", "buggy": "def weighted_sum(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 weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(3)` يُرجع `490`.\nالجواب:", "qhash": "08044a39d02263d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 97", "tests": ["assert fact_mod(3) == 6", "assert fact_mod(57) == 42", "assert fact_mod(40) == 61", "assert fact_mod(51) == 17", "assert fact_mod(52) == 11", "assert fact_mod(4) == 24", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(3) == 6\nassert fact_mod(57) == 42\nassert fact_mod(40) == 61\nassert fact_mod(51) == 17\nassert fact_mod(52) == 11\nassert fact_mod(4) == 24\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 97", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(3)` يُرجع `6`.\nالجواب:", "qhash": "f11fba37276bd446"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['rocket', 'pixel', 'apple', 'garden', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['rocket', 'pixel', 'apple', 'garden', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "2235bcef493654c5", "answer": "['data', 'pixel', 'apple', 'rocket', 'garden']\n['rocket', 'garden', 'pixel']", "completion": " الناتج:\n```text\n['data', 'pixel', 'apple', 'rocket', 'garden']\n['rocket', 'garden', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'أحمد': 2, 'باسل': 37, 'سلمى': 32}\npoints['أحمد'] += 12\npoints['مريم'] = 36\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'أحمد': 2, 'باسل': 37, 'سلمى': 32}\npoints['أحمد'] += 12\npoints['مريم'] = 36\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('سعيد', -1))\n```\nالجواب:", "qhash": "06bab55508129ec6", "answer": "4\nباسل\n119\n-1", "completion": " الناتج:\n```text\n4\nباسل\n119\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'زينب': 31, 'مريم': 30, 'سلمى': 32, 'نور': 42, 'هدى': 5}\nmarks['زينب'] += 20\nmarks['أحمد'] = 22\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'زينب': 31, 'مريم': 30, 'سلمى': 32, 'نور': 42, 'هدى': 5}\nmarks['زينب'] += 20\nmarks['أحمد'] = 22\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))\n```\nالجواب:", "qhash": "03726237059cff85", "answer": "6\nزينب\n182\n-1", "completion": " الناتج:\n```text\n6\nزينب\n182\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'مريم': 11, 'سلمى': 31, 'علي': 46}\npoints['مريم'] += 15\npoints['هدى'] = 26\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 = {'مريم': 11, 'سلمى': 31, 'علي': 46}\npoints['مريم'] += 15\npoints['هدى'] = 26\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": "0ba36d19b847d61b", "answer": "4\nعلي\n129\n[('مريم', 26), ('هدى', 26)]", "completion": " الناتج:\n```text\n4\nعلي\n129\n[('مريم', 26), ('هدى', 26)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('planet planet engine light at orange music') == 'music/orange/at/light/engine/planet/planet'", "assert mirror_words('desert orange of rocket on engine') == 'engine/on/rocket/of/orange/desert'", "assert mirror_words('planet matrix') == 'matrix/planet'", "assert mirror_words('engine a orange pixel river go') == 'go/river/pixel/orange/engine'", "assert mirror_words('vector desert cloud desert planet to signal it') == 'it/signal/to/planet/desert/cloud/desert/vector'", "assert mirror_words('falcon table') == 'table/falcon'", "assert mirror_words('brain is light code banana go in up') == 'up/in/go/banana/code/light/is/brain'"], "test_code": "assert mirror_words('planet planet engine light at orange music') == 'music/orange/at/light/engine/planet/planet'\nassert mirror_words('desert orange of rocket on engine') == 'engine/on/rocket/of/orange/desert'\nassert mirror_words('planet matrix') == 'matrix/planet'\nassert mirror_words('engine a orange pixel river go') == 'go/river/pixel/orange/engine'\nassert mirror_words('vector desert cloud desert planet to signal it') == 'it/signal/to/planet/desert/cloud/desert/vector'\nassert mirror_words('falcon table') == 'table/falcon'\nassert mirror_words('brain is light code banana go in up') == 'up/in/go/banana/code/light/is/brain'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `mirror_words('planet planet engine light at orange music')` يُرجع `'music/orange/at/light/engine/planet/planet'`.\nالجواب:", "qhash": "9709cec02f615515"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 9 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']", "assert fizzbuzz(1) == ['1']", "assert fizzbuzz(0) == []", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15']", "assert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']"], "test_code": "assert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']\nassert fizzbuzz(1) == ['1']\nassert fizzbuzz(0) == []\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15']\nassert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Tic'، وعلى 9 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(10)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']`.\nالجواب:", "qhash": "d62aba3b1dd47ed6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "tests": ["assert scaled_powers(8) == 105264", "assert scaled_powers(13) == 1071252", "assert scaled_powers(10) == 303996", "assert scaled_powers(8) == 105264", "assert scaled_powers(11) == 479688", "assert scaled_powers(1) == 12", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 105264\nassert scaled_powers(13) == 1071252\nassert scaled_powers(10) == 303996\nassert scaled_powers(8) == 105264\nassert scaled_powers(11) == 479688\nassert scaled_powers(1) == 12\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total\n```\nمثال: `scaled_powers(8)` يجب أن تُرجع `105264`.\nالجواب:", "qhash": "89df7da8a0c1f563"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_special([80, 81, 64, 50, 15, 43, 56, 37, 58]) == 5", "assert count_special([-2, 2, -18, 80, 20, 76]) == 5", "assert count_special([69, 10, 49, -5, -9]) == 1", "assert count_special([87, 70, 26, 89, 87, -19, 30, 84, 19]) == 4", "assert count_special([3, 22, 16, -31, 81, -23]) == 2", "assert count_special([4, -17, -31, 0, -2, 85, 80]) == 3", "assert count_special([]) == 0"], "test_code": "assert count_special([80, 81, 64, 50, 15, 43, 56, 37, 58]) == 5\nassert count_special([-2, 2, -18, 80, 20, 76]) == 5\nassert count_special([69, 10, 49, -5, -9]) == 1\nassert count_special([87, 70, 26, 89, 87, -19, 30, 84, 19]) == 4\nassert count_special([3, 22, 16, -31, 81, -23]) == 2\nassert count_special([4, -17, -31, 0, -2, 85, 80]) == 3\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 9، ثم اكتب الدالة كاملة.\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([80, 81, 64, 50, 15, 43, 56, 37, 58])` يجب أن تُرجع `5`.\nالجواب:", "qhash": "274911216f7fe9a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert reverse_words('pixel falcon we stone in') == 'stone,falcon,pixel'", "assert reverse_words('apple summer stone signal engine') == 'engine,signal,stone,summer,apple'", "assert reverse_words('signal camel cloud python') == 'python,cloud,camel,signal'", "assert reverse_words('is an apple table orange') == 'orange,table,apple'", "assert reverse_words('go to matrix stone river at up planet') == 'planet,river,stone,matrix'", "assert reverse_words('banana brain apple') == 'apple,brain,banana'", "assert reverse_words('to window planet data camel code') == 'code,camel,data,planet,window'"], "test_code": "assert reverse_words('pixel falcon we stone in') == 'stone,falcon,pixel'\nassert reverse_words('apple summer stone signal engine') == 'engine,signal,stone,summer,apple'\nassert reverse_words('signal camel cloud python') == 'python,cloud,camel,signal'\nassert reverse_words('is an apple table orange') == 'orange,table,apple'\nassert reverse_words('go to matrix stone river at up planet') == 'planet,river,stone,matrix'\nassert reverse_words('banana brain apple') == 'apple,brain,banana'\nassert reverse_words('to window planet data camel code') == 'code,camel,data,planet,window'", "answer": "def reverse_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef reverse_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `reverse_words('pixel falcon we stone in')` يُرجع `'stone,falcon,pixel'`.\nالجواب:", "qhash": "2200d92fd7a2aafe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([87, 49, 79, 63, 69, 45, 23, 57, 37, 79, 89, 7]) == 1", "assert how_many_div([-18, 40, 44]) == 1", "assert how_many_div([30, 9, 32, 75, 56, 7, 47, 14, 17]) == 1", "assert how_many_div([-15, -25, 84, 68, 70, -1]) == 3", "assert how_many_div([-8, 13, -8, 75, 40, 7, 64, 8, -28]) == 2", "assert how_many_div([-38, 50, -24, 40, 76, 66, 89, -14]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([87, 49, 79, 63, 69, 45, 23, 57, 37, 79, 89, 7]) == 1\nassert how_many_div([-18, 40, 44]) == 1\nassert how_many_div([30, 9, 32, 75, 56, 7, 47, 14, 17]) == 1\nassert how_many_div([-15, -25, 84, 68, 70, -1]) == 3\nassert how_many_div([-8, 13, -8, 75, 40, 7, 64, 8, -28]) == 2\nassert how_many_div([-38, 50, -24, 40, 76, 66, 89, -14]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 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 % 5 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، ثم اكتب الدالة كاملة.\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([87, 49, 79, 63, 69, 45, 23, 57, 37, 79, 89, 7])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "2d8b6418449e551b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "tests": ["assert cycle([15, 17, 19, 12]) == [19, 12, 15, 17]", "assert cycle([19, 24, -3, -6, 16, 32, 8, 33]) == [-3, -6, 16, 32, 8, 33, 19, 24]", "assert cycle([45]) == [45]", "assert cycle([10, 31, 31, 21]) == [31, 21, 10, 31]", "assert cycle([38, 43, 5, 20]) == [5, 20, 38, 43]", "assert cycle([37, 50, 42, -4, 0, 47]) == [0, 47, 37, 50, 42, -4]", "assert cycle([]) == []"], "test_code": "assert cycle([15, 17, 19, 12]) == [19, 12, 15, 17]\nassert cycle([19, 24, -3, -6, 16, 32, 8, 33]) == [-3, -6, 16, 32, 8, 33, 19, 24]\nassert cycle([45]) == [45]\nassert cycle([10, 31, 31, 21]) == [31, 21, 10, 31]\nassert cycle([38, 43, 5, 20]) == [5, 20, 38, 43]\nassert cycle([37, 50, 42, -4, 0, 47]) == [0, 47, 37, 50, 42, -4]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([15, 17, 19, 12])` يُرجع `[19, 12, 15, 17]`.\nالجواب:", "qhash": "5e40498092a067a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'river'\nprint(word.index('r') + len(word))\nprint(word.split('_'))\nprint(word[0:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'river'\nprint(word.index('r') + len(word))\nprint(word.split('_'))\nprint(word[0:2])\n```\nالجواب:", "qhash": "dde1c85d145000a5", "answer": "5\n['river']\nri", "completion": " الناتج:\n```text\n5\n['river']\nri\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "lead_count", "reference": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ر'):\n count += 1\n return count", "tests": ["assert lead_count('مكتبة فجر رمل مدرسة تفاحة رمل لغة') == 2", "assert lead_count('حاسوب عربية') == 0", "assert lead_count('معلم ميناء طالب حصان') == 0", "assert lead_count('قهوة نهر سماء') == 0", "assert lead_count('ليل قمر لغة قلم') == 0", "assert lead_count('جمل رمل خبز رمل باب جبل') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('مكتبة فجر رمل مدرسة تفاحة رمل لغة') == 2\nassert lead_count('حاسوب عربية') == 0\nassert lead_count('معلم ميناء طالب حصان') == 0\nassert lead_count('قهوة نهر سماء') == 0\nassert lead_count('ليل قمر لغة قلم') == 0\nassert lead_count('جمل رمل خبز رمل باب جبل') == 2\nassert lead_count('') == 0", "answer": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ر'):\n count += 1\n return count", "completion": " ```python\ndef lead_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 lead_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 lead_count(s):\n count = 0\n for w in s:\n if w.startswith('ر'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('مكتبة فجر رمل مدرسة تفاحة رمل لغة')` يُرجع `2`.\nالجواب:", "qhash": "8d880eb77b694970"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'stone'\nprint(name.find('t'))\nprint(name.index('t') + len(name))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'stone'\nprint(name.find('t'))\nprint(name.index('t') + len(name))\nprint(name[::-1])\n```\nالجواب:", "qhash": "1f8695977044f1a0", "answer": "1\n6\nenots", "completion": " الناتج:\n```text\n1\n6\nenots\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 47", "tests": ["assert mfact(11) == 29", "assert mfact(15) == 29", "assert mfact(39) == 30", "assert mfact(54) == 0", "assert mfact(30) == 8", "assert mfact(27) == 14", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 29\nassert mfact(15) == 29\nassert mfact(39) == 30\nassert mfact(54) == 0\nassert mfact(30) == 8\nassert mfact(27) == 14\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 47", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(11)` يُرجع `29`.\nالجواب:", "qhash": "c0c44f69538b17b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'ls'}", "tests": ["assert tally('apple an summer rocket code') == {'l': 1, 's': 1}", "assert tally('go') == {'l': 0, 's': 0}", "assert tally('music camel desert') == {'l': 1, 's': 2}", "assert tally('up camel') == {'l': 1, 's': 0}", "assert tally('table to table winter') == {'l': 2, 's': 0}", "assert tally('pixel stone') == {'l': 1, 's': 1}", "assert tally('') == {'l': 0, 's': 0}"], "test_code": "assert tally('apple an summer rocket code') == {'l': 1, 's': 1}\nassert tally('go') == {'l': 0, 's': 0}\nassert tally('music camel desert') == {'l': 1, 's': 2}\nassert tally('up camel') == {'l': 1, 's': 0}\nassert tally('table to table winter') == {'l': 2, 's': 0}\nassert tally('pixel stone') == {'l': 1, 's': 1}\nassert tally('') == {'l': 0, 's': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'ls'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'ls'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'l'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('apple an summer rocket code')` يُرجع `{'l': 1, 's': 1}`.\nالجواب:", "qhash": "d6a5ef827b8afde9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 28) == 1)", "tests": ["assert count_gcd1(27) == 12", "assert count_gcd1(0) == 0", "assert count_gcd1(71) == 31", "assert count_gcd1(85) == 37", "assert count_gcd1(199) == 86", "assert count_gcd1(19) == 9", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(27) == 12\nassert count_gcd1(0) == 0\nassert count_gcd1(71) == 31\nassert count_gcd1(85) == 37\nassert count_gcd1(199) == 86\nassert count_gcd1(19) == 9\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, 28) == 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, 28) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 28، أي أن القاسم المشترك الأكبر لها مع 28 يساوي 1.\nمثال: `count_gcd1(27)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "b5828755582d1af2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_special([11, 46, 80, 61, 24, 53, 54, 52, 24, 50, 28]) == 6", "assert count_special([-2, 18, 17]) == 2", "assert count_special([-5]) == 0", "assert count_special([8, 52, 48, -21, 74, 7, 48, 5, 72, 64, -22, 17]) == 8", "assert count_special([-29, 9, -12, 45, 60, -29, 27, 0, 86]) == 2", "assert count_special([]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([11, 46, 80, 61, 24, 53, 54, 52, 24, 50, 28]) == 6\nassert count_special([-2, 18, 17]) == 2\nassert count_special([-5]) == 0\nassert count_special([8, 52, 48, -21, 74, 7, 48, 5, 72, 64, -22, 17]) == 8\nassert count_special([-29, 9, -12, 45, 60, -29, 27, 0, 86]) == 2\nassert count_special([]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([11, 46, 80, 61, 24, 53, 54, 52, 24, 50, 28])` يجب أن تُرجع `6`.\nالجواب:", "qhash": "dcee837b4818a189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))\n```\nالجواب:", "qhash": "4fd57598dff10759", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 193:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([64, 66, 62, 80, 63, 67]) == [64, 130, 192, 0, 63, 130]", "assert running_sum([88]) == [88]", "assert running_sum([191, 62, -9, 49, 170, 129, 173, 185, 3]) == [191, 0, -9, 40, 0, 129, 0, 185, 188]", "assert running_sum([193, 67, 20, 152, 11, 91, 158, 47]) == [193, 0, 20, 172, 183, 0, 158, 0]", "assert running_sum([184, 162, 186]) == [184, 0, 186]", "assert running_sum([68, 95, 177, 55, 1, 128, 174, 85, 159, 136]) == [68, 163, 0, 55, 56, 184, 0, 85, 0, 136]", "assert running_sum([]) == []"], "test_code": "assert running_sum([64, 66, 62, 80, 63, 67]) == [64, 130, 192, 0, 63, 130]\nassert running_sum([88]) == [88]\nassert running_sum([191, 62, -9, 49, 170, 129, 173, 185, 3]) == [191, 0, -9, 40, 0, 129, 0, 185, 188]\nassert running_sum([193, 67, 20, 152, 11, 91, 158, 47]) == [193, 0, 20, 172, 183, 0, 158, 0]\nassert running_sum([184, 162, 186]) == [184, 0, 186]\nassert running_sum([68, 95, 177, 55, 1, 128, 174, 85, 159, 136]) == [68, 163, 0, 55, 56, 184, 0, 85, 0, 136]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 193:\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 > 193:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 193 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([64, 66, 62, 80, 63, 67])` يجب أن تُرجع `[64, 130, 192, 0, 63, 130]`.\nالجواب:", "qhash": "e9b34a181013c6a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'بيت'\nprint(s.split())\nprint(s[0])\nprint(s.find('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'بيت'\nprint(s.split())\nprint(s[0])\nprint(s.find('ر'))\n```\nالجواب:", "qhash": "51d6823dfbbbc9b4", "answer": "['بيت']\nب\n-1", "completion": " الناتج:\n```text\n['بيت']\nب\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('garden signal desert planet') == 'planet desert signal garden'", "assert reverse_words('we') == ''", "assert reverse_words('code summer') == 'summer'", "assert reverse_words('brain we of an in window') == 'window brain'", "assert reverse_words('it orange cloud garden to music on banana') == 'banana music garden cloud orange'", "assert reverse_words('rocket matrix') == 'matrix rocket'", "assert reverse_words('go light signal light apple') == 'apple light signal light'"], "test_code": "assert reverse_words('garden signal desert planet') == 'planet desert signal garden'\nassert reverse_words('we') == ''\nassert reverse_words('code summer') == 'summer'\nassert reverse_words('brain we of an in window') == 'window brain'\nassert reverse_words('it orange cloud garden to music on banana') == 'banana music garden cloud orange'\nassert reverse_words('rocket matrix') == 'matrix rocket'\nassert reverse_words('go light signal light apple') == 'apple light signal light'", "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('garden signal desert planet')` يجب أن تُرجع `'planet desert signal garden'`.\nالجواب:", "qhash": "0c02070d11f5f245"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 81248\nc = 0\nwhile n > 17:\n n = n // 5\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 81248\nc = 0\nwhile n > 17:\n n = n // 5\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "68862d88fcaa969b", "answer": "5 6", "completion": " الناتج:\n```text\n5 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "tests": ["assert sum_div(184) == 8372", "assert sum_div(156) == 6006", "assert sum_div(261) == 17030", "assert sum_div(210) == 10920", "assert sum_div(91) == 2070", "assert sum_div(3) == 2", "assert sum_div(1) == 0"], "test_code": "assert sum_div(184) == 8372\nassert sum_div(156) == 6006\nassert sum_div(261) == 17030\nassert sum_div(210) == 10920\nassert sum_div(91) == 2070\nassert sum_div(3) == 2\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(184)` يُرجع `8372`.\nالجواب:", "qhash": "74bf11c3c0b428da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 17\nfor n in range(8, 14, 4):\n total -= n * 1\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 17\nfor n in range(8, 14, 4):\n total -= n * 1\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "0c91b24d372a31ad", "answer": "-3\n12", "completion": " الناتج:\n```text\n-3\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 3\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))\n```\nالجواب:", "qhash": "e0c09a1c2184e42c", "answer": "18", "completion": " الناتج:\n```text\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 84", "tests": ["assert digit_power(92209) == 58", "assert digit_power(361740) == 63", "assert digit_power(161575) == 7", "assert digit_power(119667) == 18", "assert digit_power(602505) == 30", "assert digit_power(542005) == 82", "assert digit_power(894712) == 61", "assert digit_power(0) == 0"], "test_code": "assert digit_power(92209) == 58\nassert digit_power(361740) == 63\nassert digit_power(161575) == 7\nassert digit_power(119667) == 18\nassert digit_power(602505) == 30\nassert digit_power(542005) == 82\nassert digit_power(894712) == 61\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 84", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 84\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 84.\nللتوضيح: الاستدعاء `digit_power(92209)` يُرجع `58`.\nالجواب:", "qhash": "0b134ff5ba24c70f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 9", "tests": ["assert sum_digit_pow(7624) == 7", "assert sum_digit_pow(706760) == 8", "assert sum_digit_pow(678897) == 6", "assert sum_digit_pow(755034) == 6", "assert sum_digit_pow(833456) == 8", "assert sum_digit_pow(345515) == 5", "assert sum_digit_pow(797505) == 3", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(7624) == 7\nassert sum_digit_pow(706760) == 8\nassert sum_digit_pow(678897) == 6\nassert sum_digit_pow(755034) == 6\nassert sum_digit_pow(833456) == 8\nassert sum_digit_pow(345515) == 5\nassert sum_digit_pow(797505) == 3\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 9", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 9\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 9.\nمثال: `sum_digit_pow(7624)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "e412b9161150ba77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)", "tests": ["assert sum_div(76) == 1164", "assert sum_div(177) == 6390", "assert sum_div(182) == 6570", "assert sum_div(274) == 14989", "assert sum_div(43) == 340", "assert sum_div(71) == 1017", "assert sum_div(1) == 0"], "test_code": "assert sum_div(76) == 1164\nassert sum_div(177) == 6390\nassert sum_div(182) == 6570\nassert sum_div(274) == 14989\nassert sum_div(43) == 340\nassert sum_div(71) == 1017\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 % 5 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 5.\nمثال: `sum_div(76)` يجب أن تُرجع `1164`.\nالجواب:", "qhash": "6222f4687c5ef84a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ق'))", "tests": ["assert letter_count('فجر نور برتقال سفينة معلم ماء باب') == 0", "assert letter_count('صحراء قلم خبز شجرة شجرة قمر ميناء') == 2", "assert letter_count('شمس تفاحة مطر باب دفتر شمس') == 0", "assert letter_count('طالب نهر سلام سماء قهوة رمل') == 1", "assert letter_count('علم فجر برتقال دفتر') == 0", "assert letter_count('برتقال ماء شجرة برمجة نهار قلم عمل سوق') == 1", "assert letter_count('وردة سفينة طالب مطر ميناء خبز باب تفاحة') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('فجر نور برتقال سفينة معلم ماء باب') == 0\nassert letter_count('صحراء قلم خبز شجرة شجرة قمر ميناء') == 2\nassert letter_count('شمس تفاحة مطر باب دفتر شمس') == 0\nassert letter_count('طالب نهر سلام سماء قهوة رمل') == 1\nassert letter_count('علم فجر برتقال دفتر') == 0\nassert letter_count('برتقال ماء شجرة برمجة نهار قلم عمل سوق') == 1\nassert letter_count('وردة سفينة طالب مطر ميناء خبز باب تفاحة') == 0\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ق'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ق'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق».\nمثال: `letter_count('فجر نور برتقال سفينة معلم ماء باب')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f964893b6184f3c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'data_pixel'\nprint(word[::-1])\nprint(len(word))\nprint(word[-2:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'data_pixel'\nprint(word[::-1])\nprint(len(word))\nprint(word[-2:])\n```\nالجواب:", "qhash": "08d1687a4699e99f", "answer": "lexip_atad\n10\nel", "completion": " الناتج:\n```text\nlexip_atad\n10\nel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['desert', 'window', 'pixel', 'light', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['desert', 'window', 'pixel', 'light', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "23bd54114832c9ab", "answer": "['data', 'pixel', 'light', 'desert', 'window']\n['window', 'desert', 'pixel']", "completion": " الناتج:\n```text\n['data', 'pixel', 'light', 'desert', 'window']\n['window', 'desert', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(259271610))\nprint(rec(rec(259271610)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(259271610))\nprint(rec(rec(259271610)))\n```\nالجواب:", "qhash": "bf9d1caec3de127f", "answer": "33\n6", "completion": " الناتج:\n```text\n33\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'عمل'\nprint(s[-1])\nprint(s.find('ر'))\nprint('ر' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'عمل'\nprint(s[-1])\nprint(s.find('ر'))\nprint('ر' in s)\n```\nالجواب:", "qhash": "746fe454ce0fb561", "answer": "ل\n-1\nFalse", "completion": " الناتج:\n```text\nل\n-1\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('امل حصان مدرسة') == 1", "assert begin_count('بيت قهوة خبز امل بحر قمر امل') == 2", "assert begin_count('سوق حصان وردة برتقال شجرة نهار') == 0", "assert begin_count('برتقال امل جبل سيارة') == 1", "assert begin_count('عربية باب كتاب شجرة دفتر') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('صديق باب جبل') == 0\nassert begin_count('امل حصان مدرسة') == 1\nassert begin_count('بيت قهوة خبز امل بحر قمر امل') == 2\nassert begin_count('سوق حصان وردة برتقال شجرة نهار') == 0\nassert begin_count('برتقال امل جبل سيارة') == 1\nassert begin_count('عربية باب كتاب شجرة دفتر') == 0\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 'ا' in w:\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 'ا' in w:\n count += 1\n return count\n```\nمثال: `begin_count('صديق باب جبل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "fca4cd373b364db8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(-1, 0))", "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, 0))\n```\nالجواب:", "qhash": "0156521565766518", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 47", "tests": ["assert multi_fact(10) == 33", "assert multi_fact(26) == 27", "assert multi_fact(51) == 0", "assert multi_fact(38) == 17", "assert multi_fact(17) == 12", "assert multi_fact(35) == 37", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(10) == 33\nassert multi_fact(26) == 27\nassert multi_fact(51) == 0\nassert multi_fact(38) == 17\nassert multi_fact(17) == 12\nassert multi_fact(35) == 37\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 47", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(10)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "3d114d7394d84e49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "label_numbers", "reference": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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(9) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9']", "assert label_numbers(16) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo']", "assert label_numbers(17) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17']", "assert label_numbers(1) == ['1']", "assert label_numbers(24) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17', '18', '19', 'FooBar', '21', '22', '23', 'Foo']"], "test_code": "assert label_numbers(9) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9']\nassert label_numbers(16) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo']\nassert label_numbers(17) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17']\nassert label_numbers(1) == ['1']\nassert label_numbers(24) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17', '18', '19', 'FooBar', '21', '22', '23', 'Foo']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 % 4 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Foo'، وإن قَبِلها على 5 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(9)` يُرجع `['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9']`.\nالجواب:", "qhash": "316e4d99c4cee649"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'alo'}", "tests": ["assert char_freq('light') == {'a': 0, 'l': 1, 'o': 0}", "assert char_freq('window of desert river go at') == {'a': 1, 'l': 0, 'o': 3}", "assert char_freq('coffee cloud an it falcon') == {'a': 2, 'l': 2, 'o': 3}", "assert char_freq('is python') == {'a': 0, 'l': 0, 'o': 1}", "assert char_freq('music orange apple') == {'a': 2, 'l': 1, 'o': 1}", "assert char_freq('engine we garden winter python code') == {'a': 1, 'l': 0, 'o': 2}", "assert char_freq('') == {'a': 0, 'l': 0, 'o': 0}"], "test_code": "assert char_freq('light') == {'a': 0, 'l': 1, 'o': 0}\nassert char_freq('window of desert river go at') == {'a': 1, 'l': 0, 'o': 3}\nassert char_freq('coffee cloud an it falcon') == {'a': 2, 'l': 2, 'o': 3}\nassert char_freq('is python') == {'a': 0, 'l': 0, 'o': 1}\nassert char_freq('music orange apple') == {'a': 2, 'l': 1, 'o': 1}\nassert char_freq('engine we garden winter python code') == {'a': 1, 'l': 0, 'o': 2}\nassert char_freq('') == {'a': 0, 'l': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'alo'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'alo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'l'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('light')` يُرجع `{'a': 0, 'l': 1, 'o': 0}`.\nالجواب:", "qhash": "901822af36809116"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'adh'}", "tests": ["assert letter_stats('of signal') == {'a': 1, 'd': 0, 'h': 0}", "assert letter_stats('desert summer') == {'a': 0, 'd': 1, 'h': 0}", "assert letter_stats('go by pixel window go') == {'a': 0, 'd': 1, 'h': 0}", "assert letter_stats('by winter to pixel apple') == {'a': 1, 'd': 0, 'h': 0}", "assert letter_stats('window falcon code desert rocket') == {'a': 1, 'd': 3, 'h': 0}", "assert letter_stats('music of apple on by engine') == {'a': 1, 'd': 0, 'h': 0}", "assert letter_stats('') == {'a': 0, 'd': 0, 'h': 0}"], "test_code": "assert letter_stats('of signal') == {'a': 1, 'd': 0, 'h': 0}\nassert letter_stats('desert summer') == {'a': 0, 'd': 1, 'h': 0}\nassert letter_stats('go by pixel window go') == {'a': 0, 'd': 1, 'h': 0}\nassert letter_stats('by winter to pixel apple') == {'a': 1, 'd': 0, 'h': 0}\nassert letter_stats('window falcon code desert rocket') == {'a': 1, 'd': 3, 'h': 0}\nassert letter_stats('music of apple on by engine') == {'a': 1, 'd': 0, 'h': 0}\nassert letter_stats('') == {'a': 0, 'd': 0, 'h': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'adh'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'adh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'd'، 'h' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('of signal')` يُرجع `{'a': 1, 'd': 0, 'h': 0}`.\nالجواب:", "qhash": "de287b900424ae0d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('data stone we') == 'wtmt lmhgx px'", "assert shift_text('on cloud') == 'hg vehnw'", "assert shift_text('camel at by at data') == 'vtfxe tm ur tm wtmt'", "assert shift_text('light signal signal') == 'ebzam lbzgte lbzgte'", "assert shift_text('light planet summer is A1') == 'ebzam ietgxm lnffxk bl A1'", "assert shift_text('vector Hello') == 'oxvmhk Hxeeh'", "assert shift_text('') == ''"], "test_code": "assert shift_text('data stone we') == 'wtmt lmhgx px'\nassert shift_text('on cloud') == 'hg vehnw'\nassert shift_text('camel at by at data') == 'vtfxe tm ur tm wtmt'\nassert shift_text('light signal signal') == 'ebzam lbzgte lbzgte'\nassert shift_text('light planet summer is A1') == 'ebzam ietgxm lnffxk bl A1'\nassert shift_text('vector Hello') == 'oxvmhk Hxeeh'\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 + (19)) % 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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('data stone we')` يُرجع `'wtmt lmhgx px'`.\nالجواب:", "qhash": "6182cbba4863b8cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['code', 'rocket', 'data', 'signal', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['code', 'rocket', 'data', 'signal', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "6901268dc08a9fec", "answer": "['code', 'data', 'brain', 'rocket', 'signal']\n['signal', 'rocket', 'brain']", "completion": " الناتج:\n```text\n['code', 'data', 'brain', 'rocket', 'signal']\n['signal', 'rocket', 'brain']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([40, 25, 30, 34, 31]) == [40, 65, 0, 34, 65]", "assert reset_sum([48, 2, 82, -1, 76, 68, 71, 76, 23, 18]) == [48, 50, 0, -1, 75, 0, 71, 0, 23, 41]", "assert reset_sum([32, -8, 79, 33, 21, 10, 83, 52, 86]) == [32, 24, 0, 33, 54, 64, 0, 52, 0]", "assert reset_sum([71]) == [71]", "assert reset_sum([0, 44, 43, 84, 10, 32, 47, 63, 31, 55]) == [0, 44, 87, 0, 10, 42, 89, 0, 31, 86]", "assert reset_sum([11, 19, 72, 51, 78]) == [11, 30, 0, 51, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([40, 25, 30, 34, 31]) == [40, 65, 0, 34, 65]\nassert reset_sum([48, 2, 82, -1, 76, 68, 71, 76, 23, 18]) == [48, 50, 0, -1, 75, 0, 71, 0, 23, 41]\nassert reset_sum([32, -8, 79, 33, 21, 10, 83, 52, 86]) == [32, 24, 0, 33, 54, 64, 0, 52, 0]\nassert reset_sum([71]) == [71]\nassert reset_sum([0, 44, 43, 84, 10, 32, 47, 63, 31, 55]) == [0, 44, 87, 0, 10, 42, 89, 0, 31, 86]\nassert reset_sum([11, 19, 72, 51, 78]) == [11, 30, 0, 51, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 92 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([40, 25, 30, 34, 31])` يُرجع `[40, 65, 0, 34, 65]`.\nالجواب:", "qhash": "2dcc1dfe2b003c76"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 39208\nc = 0\nwhile x > 14:\n x = x // 6\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 39208\nc = 0\nwhile x > 14:\n x = x // 6\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "c184757521014ddf", "answer": "5 5", "completion": " الناتج:\n```text\n5 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 37) == 1)", "tests": ["assert coprime_count(12) == 12", "assert coprime_count(133) == 130", "assert coprime_count(71) == 70", "assert coprime_count(116) == 113", "assert coprime_count(44) == 43", "assert coprime_count(58) == 57", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(12) == 12\nassert coprime_count(133) == 130\nassert coprime_count(71) == 70\nassert coprime_count(116) == 113\nassert coprime_count(44) == 43\nassert coprime_count(58) == 57\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, 37) == 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, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 37) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(12)` يُرجع `12`.\nالجواب:", "qhash": "cfb87fc046ae4287"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('we signal window cloud at signal pixel desert') == 'desert pixel signal cloud window signal'", "assert rev_long_words('') == ''", "assert rev_long_words('at') == ''", "assert rev_long_words('we on') == ''", "assert rev_long_words('a garden') == 'garden'", "assert rev_long_words('') == ''", "assert rev_long_words('cloud code an at rocket') == 'rocket code cloud'"], "test_code": "assert rev_long_words('we signal window cloud at signal pixel desert') == 'desert pixel signal cloud window signal'\nassert rev_long_words('') == ''\nassert rev_long_words('at') == ''\nassert rev_long_words('we on') == ''\nassert rev_long_words('a garden') == 'garden'\nassert rev_long_words('') == ''\nassert rev_long_words('cloud code an at rocket') == 'rocket code cloud'", "answer": "def rev_long_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_long_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_long_words('we signal window cloud at signal pixel desert')` يُرجع `'desert pixel signal cloud window signal'`.\nالجواب:", "qhash": "1eec0a6eb0e99aa2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 3:\n return 2\n return 2 * rec(n - 1) + 4\n\nprint(rec(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 3:\n return 2\n return 2 * rec(n - 1) + 4\n\nprint(rec(11))\n```\nالجواب:", "qhash": "dd0b2906d9101b0c", "answer": "1532", "completion": " الناتج:\n```text\n1532\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('تفاحة تفاحة طائرة تفاحة') == 3", "assert lead_count('تفاحة تفاحة بحر فجر') == 2", "assert lead_count('قلم سلام') == 0", "assert lead_count('تفاحة مكتبة عمل تفاحة برمجة شمس') == 2", "assert lead_count('طالب قمر سيارة قمر مطر تفاحة عربية تفاحة') == 2", "assert lead_count('وردة جمل كتاب عربية جبل') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('تفاحة تفاحة طائرة تفاحة') == 3\nassert lead_count('تفاحة تفاحة بحر فجر') == 2\nassert lead_count('قلم سلام') == 0\nassert lead_count('تفاحة مكتبة عمل تفاحة برمجة شمس') == 2\nassert lead_count('طالب قمر سيارة قمر مطر تفاحة عربية تفاحة') == 2\nassert lead_count('وردة جمل كتاب عربية جبل') == 0\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.split():\n if 'ت' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ت». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if 'ت' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('تفاحة تفاحة طائرة تفاحة')` يُرجع `3`.\nالجواب:", "qhash": "a5bd5705457a1341"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 20\nfor x in range(2, 20, 3):\n acc -= x * 5\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 20\nfor x in range(2, 20, 3):\n acc -= x * 5\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "1a99929d389ce1c1", "answer": "-265\n17", "completion": " الناتج:\n```text\n-265\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'acl'}", "tests": ["assert count_chars('we apple engine data light') == {'a': 3, 'c': 0, 'l': 2}", "assert count_chars('falcon') == {'a': 1, 'c': 1, 'l': 1}", "assert count_chars('it') == {'a': 0, 'c': 0, 'l': 0}", "assert count_chars('summer') == {'a': 0, 'c': 0, 'l': 0}", "assert count_chars('on garden garden engine') == {'a': 2, 'c': 0, 'l': 0}", "assert count_chars('by') == {'a': 0, 'c': 0, 'l': 0}", "assert count_chars('') == {'a': 0, 'c': 0, 'l': 0}"], "test_code": "assert count_chars('we apple engine data light') == {'a': 3, 'c': 0, 'l': 2}\nassert count_chars('falcon') == {'a': 1, 'c': 1, 'l': 1}\nassert count_chars('it') == {'a': 0, 'c': 0, 'l': 0}\nassert count_chars('summer') == {'a': 0, 'c': 0, 'l': 0}\nassert count_chars('on garden garden engine') == {'a': 2, 'c': 0, 'l': 0}\nassert count_chars('by') == {'a': 0, 'c': 0, 'l': 0}\nassert count_chars('') == {'a': 0, 'c': 0, 'l': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'acl'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'acl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'c'، 'l' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('we apple engine data light')` يجب أن تُرجع `{'a': 3, 'c': 0, 'l': 2}`.\nالجواب:", "qhash": "48cadfae8ee9e768"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 29, 'منى': 36, 'راشد': 31, 'ليلى': 17, 'زينب': 50}\npoints['زينب'] += 8\npoints['خالد'] = 42\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 29, 'منى': 36, 'راشد': 31, 'ليلى': 17, 'زينب': 50}\npoints['زينب'] += 8\npoints['خالد'] = 42\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('عمر', -1))\n```\nالجواب:", "qhash": "af60c1bd3564c1ae", "answer": "6\nزينب\n213\n-1", "completion": " الناتج:\n```text\n6\nزينب\n213\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('by a river') == 'tq s janwj'", "assert cipher('banana light') == 'tsfsfs dayzl'", "assert cipher('planet we up up 2024') == 'hdsfwl ow mh mh 2024'", "assert cipher('stone pixel !') == 'klgfw hapwd !'", "assert cipher('python OK') == 'hqlzgf OK'", "assert cipher('data') == 'vsls'", "assert cipher('') == ''"], "test_code": "assert cipher('by a river') == 'tq s janwj'\nassert cipher('banana light') == 'tsfsfs dayzl'\nassert cipher('planet we up up 2024') == 'hdsfwl ow mh mh 2024'\nassert cipher('stone pixel !') == 'klgfw hapwd !'\nassert cipher('python OK') == 'hqlzgf OK'\nassert cipher('data') == 'vsls'\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 + (18)) % 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 + (18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('by a river')` يُرجع `'tq s janwj'`.\nالجواب:", "qhash": "a4bddcb172dda9a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=6):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(18))\nprint(g(18, -3))\nprint(g(g(-3), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=6):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(18))\nprint(g(18, -3))\nprint(g(g(-3), 18))\n```\nالجواب:", "qhash": "9c8f6564fc57ce9e", "answer": "48\n57\n69", "completion": " الناتج:\n```text\n48\n57\n69\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('نور', 57), ('هشام', 13), ('سعيد', 48), ('ليلى', 61)]\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 = [('نور', 57), ('هشام', 13), ('سعيد', 48), ('ليلى', 61)]\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": "5e9586bdb46d40c5", "answer": "[('هشام', 13), ('سعيد', 48), ('نور', 57), ('ليلى', 61)]\n['ليلى', 'نور']", "completion": " الناتج:\n```text\n[('هشام', 13), ('سعيد', 48), ('نور', 57), ('ليلى', 61)]\n['ليلى', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('منى', 79), ('سلمى', 3), ('مريم', 84), ('وليد', 71)]\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 = [('منى', 79), ('سلمى', 3), ('مريم', 84), ('وليد', 71)]\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": "8e7b7386dbd627ff", "answer": "[('سلمى', 3), ('وليد', 71), ('منى', 79), ('مريم', 84)]\n['مريم', 'منى']", "completion": " الناتج:\n```text\n[('سلمى', 3), ('وليد', 71), ('منى', 79), ('مريم', 84)]\n['مريم', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 7", "tests": ["assert mfact(7) == 0", "assert mfact(10) == 4", "assert mfact(15) == 0", "assert mfact(12) == 6", "assert mfact(46) == 0", "assert mfact(21) == 0", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 0\nassert mfact(10) == 4\nassert mfact(15) == 0\nassert mfact(12) == 6\nassert mfact(46) == 0\nassert mfact(21) == 0\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 7", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(7)` يُرجع `0`.\nالجواب:", "qhash": "db421e04f7bb4ae7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(-8))\nprint(g(-8, 12))\nprint(g(g(12), -8))", "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(-8))\nprint(g(-8, 12))\nprint(g(g(12), -8))\n```\nالجواب:", "qhash": "636fb3b1838db4e1", "answer": "8\n88\n760", "completion": " الناتج:\n```text\n8\n88\n760\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -7 * x ** 2 + (3) * x + (-8)", "tests": ["assert poly(4) == -108", "assert poly(-2) == -42", "assert poly(-20) == -2868", "assert poly(16) == -1752", "assert poly(-4) == -132", "assert poly(-5) == -198", "assert poly(19) == -2478", "assert poly(0) == -8"], "test_code": "assert poly(4) == -108\nassert poly(-2) == -42\nassert poly(-20) == -2868\nassert poly(16) == -1752\nassert poly(-4) == -132\nassert poly(-5) == -198\nassert poly(19) == -2478\nassert poly(0) == -8", "answer": "def poly(x):\n return -7 * x ** 2 + (3) * x + (-8)", "completion": " ```python\ndef poly(x):\n return -7 * x ** 2 + (3) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -7x² + 3x - 8 عند العدد الصحيح x.\nمثال: `poly(4)` يجب أن تُرجع `-108`.\nالجواب:", "qhash": "f6edbc67e2c01d07"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 10) == 1)", "tests": ["assert coprime_count(40) == 16", "assert coprime_count(197) == 79", "assert coprime_count(70) == 28", "assert coprime_count(13) == 6", "assert coprime_count(56) == 22", "assert coprime_count(27) == 11", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(40) == 16\nassert coprime_count(197) == 79\nassert coprime_count(70) == 28\nassert coprime_count(13) == 6\nassert coprime_count(56) == 22\nassert coprime_count(27) == 11\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, 10) == 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, 10) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 10، أي أن القاسم المشترك الأكبر لها مع 10 يساوي 1.\nمثال: `coprime_count(40)` يجب أن تُرجع `16`.\nالجواب:", "qhash": "40ea2ce58b6357bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "tests": ["assert mfact(9) == 162", "assert mfact(38) == 212", "assert mfact(58) == 43", "assert mfact(58) == 43", "assert mfact(4) == 4", "assert mfact(51) == 623", "assert mfact(0) == 1"], "test_code": "assert mfact(9) == 162\nassert mfact(38) == 212\nassert mfact(58) == 43\nassert mfact(58) == 43\nassert mfact(4) == 4\nassert mfact(51) == 623\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(9)` يجب أن تُرجع `162`.\nالجواب:", "qhash": "541c3351d4c87f4d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert rotate_by([25, 7, 1, 48, 17, 44, 45]) == [25, 7, 1, 48, 17, 44, 45]", "assert rotate_by([38]) == [38]", "assert rotate_by([38, 31, 38, 23, 48, 39, 7, 23, -4, 50, -1, -9]) == [23, -4, 50, -1, -9, 38, 31, 38, 23, 48, 39, 7]", "assert rotate_by([42, 39, 46, -8]) == [-8, 42, 39, 46]", "assert rotate_by([19, 1, 40, -6, -5, 3, 2, 17, 33, 43, 50, -2]) == [17, 33, 43, 50, -2, 19, 1, 40, -6, -5, 3, 2]", "assert rotate_by([28]) == [28]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([25, 7, 1, 48, 17, 44, 45]) == [25, 7, 1, 48, 17, 44, 45]\nassert rotate_by([38]) == [38]\nassert rotate_by([38, 31, 38, 23, 48, 39, 7, 23, -4, 50, -1, -9]) == [23, -4, 50, -1, -9, 38, 31, 38, 23, 48, 39, 7]\nassert rotate_by([42, 39, 46, -8]) == [-8, 42, 39, 46]\nassert rotate_by([19, 1, 40, -6, -5, 3, 2, 17, 33, 43, 50, -2]) == [17, 33, 43, 50, -2, 19, 1, 40, -6, -5, 3, 2]\nassert rotate_by([28]) == [28]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([25, 7, 1, 48, 17, 44, 45])` يُرجع `[25, 7, 1, 48, 17, 44, 45]`.\nالجواب:", "qhash": "ca1fc048f72e5b53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 9\nfor i in range(8, 27, 3):\n total -= i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 9\nfor i in range(8, 27, 3):\n total -= i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "21556c35c3fe2e57", "answer": "-705\n26", "completion": " الناتج:\n```text\n-705\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('data river banana a window apple light up') == 'light_apple_window_banana_river_data'", "assert rev_long_words('is') == ''", "assert rev_long_words('at python of') == 'python'", "assert rev_long_words('signal') == 'signal'", "assert rev_long_words('') == ''", "assert rev_long_words('camel winter at river we camel summer') == 'summer_camel_river_winter_camel'", "assert rev_long_words('to music data banana code') == 'code_banana_data_music'"], "test_code": "assert rev_long_words('data river banana a window apple light up') == 'light_apple_window_banana_river_data'\nassert rev_long_words('is') == ''\nassert rev_long_words('at python of') == 'python'\nassert rev_long_words('signal') == 'signal'\nassert rev_long_words('') == ''\nassert rev_long_words('camel winter at river we camel summer') == 'summer_camel_river_winter_camel'\nassert rev_long_words('to music data banana code') == 'code_banana_data_music'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_long_words('data river banana a window apple light up')` يُرجع `'light_apple_window_banana_river_data'`.\nالجواب:", "qhash": "30f40e8f9aa52bb7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "words_starting", "reference": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert words_starting('قمر مدرسة فجر') == 0", "assert words_starting('عمل وردة وردة طالب قهوة ميناء') == 2", "assert words_starting('سوق قهوة وردة وردة سوق جمل') == 2", "assert words_starting('وردة تفاحة بحر مدرسة قهوة ميناء') == 1", "assert words_starting('شجرة ماء سيارة ميناء جبل سيارة') == 0", "assert words_starting('ماء قهوة') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('قمر مدرسة فجر') == 0\nassert words_starting('عمل وردة وردة طالب قهوة ميناء') == 2\nassert words_starting('سوق قهوة وردة وردة سوق جمل') == 2\nassert words_starting('وردة تفاحة بحر مدرسة قهوة ميناء') == 1\nassert words_starting('شجرة ماء سيارة ميناء جبل سيارة') == 0\nassert words_starting('ماء قهوة') == 0\nassert words_starting('') == 0", "answer": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('و'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(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 words_starting(s):\n count = 0\n for w in s.split():\n if w.endswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `words_starting('قمر مدرسة فجر')` يُرجع `0`.\nالجواب:", "qhash": "9e3fbf3c4ad930d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [39, 10, 31, 26, 26, 21]\nprint(data[2:6])\nprint(data[::-2])\nprint(max(data[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [39, 10, 31, 26, 26, 21]\nprint(data[2:6])\nprint(data[::-2])\nprint(max(data[2:6]))\n```\nالجواب:", "qhash": "bafdb39c41e39a6f", "answer": "[31, 26, 26, 21]\n[21, 26, 10]\n31", "completion": " الناتج:\n```text\n[31, 26, 26, 21]\n[21, 26, 10]\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 2524\nc = 0\nwhile m > 7:\n m = m // 4\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 2524\nc = 0\nwhile m > 7:\n m = m // 4\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "e481d12c603cec62", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['data', 'planet', 'garden', 'light', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['data', 'planet', 'garden', 'light', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "1def1a97a234f97c", "answer": "['data', 'light', 'planet', 'garden', 'coffee']\n['planet', 'garden', 'coffee']", "completion": " الناتج:\n```text\n['data', 'light', 'planet', 'garden', 'coffee']\n['planet', 'garden', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [0, 19, 39, 13, 10, -3, 6, 0]\nprint(xs[1:3])\nprint(xs[::3])\nprint(len(xs[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [0, 19, 39, 13, 10, -3, 6, 0]\nprint(xs[1:3])\nprint(xs[::3])\nprint(len(xs[1:3]))\n```\nالجواب:", "qhash": "2fc9d86f0483233b", "answer": "[19, 39]\n[0, 13, 6]\n2", "completion": " الناتج:\n```text\n[19, 39]\n[0, 13, 6]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['pixel', 'matrix', 'data', 'summer', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['pixel', 'matrix', 'data', 'summer', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "e598d9926678ddcf", "answer": "['data', 'pixel', 'river', 'matrix', 'summer']\n['summer', 'matrix', 'river']", "completion": " الناتج:\n```text\n['data', 'pixel', 'river', 'matrix', 'summer']\n['summer', 'matrix', 'river']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([1, 33, 46, 11, 54, -1, 27, -3, 48]) == 48", "assert max_multiple([-4, -4, -12]) == -4", "assert max_multiple([1, 5, 9, 13]) == None", "assert max_multiple([]) == None", "assert max_multiple([-29, -27, 9, 3, -39, 38, 34, 46]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([1, 33, 46, 11, 54, -1, 27, -3, 48]) == 48\nassert max_multiple([-4, -4, -12]) == -4\nassert max_multiple([1, 5, 9, 13]) == None\nassert max_multiple([]) == None\nassert max_multiple([-29, -27, 9, 3, -39, 38, 34, 46]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 4 == 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 % 4 == 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 % 4 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(xs):\n best = None\n for x in xs:\n if x % 4 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_multiple([1, 33, 46, 11, 54, -1, 27, -3, 48])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "0ed8d76e815d561e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(calc(6))\nprint(calc(6, 5))\nprint(calc(calc(5), 6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(calc(6))\nprint(calc(6, 5))\nprint(calc(calc(5), 6))\n```\nالجواب:", "qhash": "1033e4defa2038b1", "answer": "-19\n-23\n-34", "completion": " الناتج:\n```text\n-19\n-23\n-34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "tests": ["assert count_initial('مطر صديق بيت جمل جبل كتاب') == 2", "assert count_initial('بيت برمجة بحر') == 0", "assert count_initial('جبل علم باب بحر دفتر') == 1", "assert count_initial('سوق برتقال') == 0", "assert count_initial('ماء باب سيارة قمر طالب بحر') == 0", "assert count_initial('مطر شمس جبل جبل طائرة') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('مطر صديق بيت جمل جبل كتاب') == 2\nassert count_initial('بيت برمجة بحر') == 0\nassert count_initial('جبل علم باب بحر دفتر') == 1\nassert count_initial('سوق برتقال') == 0\nassert count_initial('ماء باب سيارة قمر طالب بحر') == 0\nassert count_initial('مطر شمس جبل جبل طائرة') == 2\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text.split():\n if w.endswith('ج'):\n count += 1\n return count\n```\nمثال: `count_initial('مطر صديق بيت جمل جبل كتاب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "8c93269340609444"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 32)", "tests": ["assert clip_scale([40, 6, 19, 13, 40, 4, 36, 21]) == [8, 12, 26, 38, 42]", "assert clip_scale([41, -28, 20, -24, -29, 17, -24]) == [34, 40]", "assert clip_scale([30]) == [60]", "assert clip_scale([-5, -12, 55, -9, 40, 54, -12, 29]) == [58]", "assert clip_scale([50, 37, 20, 56, 25, 58, 57, -10]) == [40, 50]", "assert clip_scale([39, 22, 35, 0, -27, 0, 4]) == [0, 0, 8, 44]", "assert clip_scale([29, 14, 4, 39, 51, -16, 37, 56, 45, 3]) == [6, 8, 28, 58]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([40, 6, 19, 13, 40, 4, 36, 21]) == [8, 12, 26, 38, 42]\nassert clip_scale([41, -28, 20, -24, -29, 17, -24]) == [34, 40]\nassert clip_scale([30]) == [60]\nassert clip_scale([-5, -12, 55, -9, 40, 54, -12, 29]) == [58]\nassert clip_scale([50, 37, 20, 56, 25, 58, 57, -10]) == [40, 50]\nassert clip_scale([39, 22, 35, 0, -27, 0, 4]) == [0, 0, 8, 44]\nassert clip_scale([29, 14, 4, 39, 51, -16, 37, 56, 45, 3]) == [6, 8, 28, 58]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 32)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 0 ≤ x ≤ 32، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([40, 6, 19, 13, 40, 4, 36, 21])` يُرجع `[8, 12, 26, 38, 42]`.\nالجواب:", "qhash": "1d5740fb8ea10a63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6", "tests": ["assert sum_digit_pow(1925) == 5", "assert sum_digit_pow(542645) == 2", "assert sum_digit_pow(948973) == 4", "assert sum_digit_pow(374899) == 4", "assert sum_digit_pow(438786) == 0", "assert sum_digit_pow(373097) == 5", "assert sum_digit_pow(538004) == 2", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(1925) == 5\nassert sum_digit_pow(542645) == 2\nassert sum_digit_pow(948973) == 4\nassert sum_digit_pow(374899) == 4\nassert sum_digit_pow(438786) == 0\nassert sum_digit_pow(373097) == 5\nassert sum_digit_pow(538004) == 2\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 6.\nللتوضيح: الاستدعاء `sum_digit_pow(1925)` يُرجع `5`.\nالجواب:", "qhash": "55e6b0f2525add77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'table'\nprint(text[-1:])\nprint(text.split('_'))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'table'\nprint(text[-1:])\nprint(text.split('_'))\nprint(text[::-1])\n```\nالجواب:", "qhash": "29e3017a58256a50", "answer": "e\n['table']\nelbat", "completion": " الناتج:\n```text\ne\n['table']\nelbat\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('summer brain apple data') == 'tvnnfs csbjo bqqmf ebub'", "assert shift_letters('a pixel is') == 'b qjyfm jt'", "assert shift_letters('river an code A1') == 'sjwfs bo dpef A1'", "assert shift_letters('to brain table summer vector') == 'up csbjo ubcmf tvnnfs wfdups'", "assert shift_letters('summer planet rocket orange up') == 'tvnnfs qmbofu spdlfu psbohf vq'", "assert shift_letters('desert apple') == 'eftfsu bqqmf'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('summer brain apple data') == 'tvnnfs csbjo bqqmf ebub'\nassert shift_letters('a pixel is') == 'b qjyfm jt'\nassert shift_letters('river an code A1') == 'sjwfs bo dpef A1'\nassert shift_letters('to brain table summer vector') == 'up csbjo ubcmf tvnnfs wfdups'\nassert shift_letters('summer planet rocket orange up') == 'tvnnfs qmbofu spdlfu psbohf vq'\nassert shift_letters('desert apple') == 'eftfsu bqqmf'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('summer brain apple data')` يُرجع `'tvnnfs csbjo bqqmf ebub'`.\nالجواب:", "qhash": "f325d43e25d094f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(17))\nprint(f(17, -7))\nprint(f(f(-7), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(17))\nprint(f(17, -7))\nprint(f(f(-7), 17))\n```\nالجواب:", "qhash": "6ededf80aacf6373", "answer": "102\n109\n95", "completion": " الناتج:\n```text\n102\n109\n95\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert turn_list([15, 5, 2, 20, 6]) == [6, 15, 5, 2, 20]", "assert turn_list([3, 27, 37, -6, 32, 10, 20, 50]) == [3, 27, 37, -6, 32, 10, 20, 50]", "assert turn_list([35, 17, 0, 19, 40, 0, 31, 23, 0, 5]) == [40, 0, 31, 23, 0, 5, 35, 17, 0, 19]", "assert turn_list([7, 39, 18, 24, -4, 38, 6, 34, 35, 22, 38]) == [6, 34, 35, 22, 38, 7, 39, 18, 24, -4, 38]", "assert turn_list([4, 46, 0, -6, 32, 16, 18, -3, 42]) == [0, -6, 32, 16, 18, -3, 42, 4, 46]", "assert turn_list([19, -6, -9, 3, -5, 23, -7, -5, -9, 28, 24]) == [-7, -5, -9, 28, 24, 19, -6, -9, 3, -5, 23]", "assert turn_list([]) == []"], "test_code": "assert turn_list([15, 5, 2, 20, 6]) == [6, 15, 5, 2, 20]\nassert turn_list([3, 27, 37, -6, 32, 10, 20, 50]) == [3, 27, 37, -6, 32, 10, 20, 50]\nassert turn_list([35, 17, 0, 19, 40, 0, 31, 23, 0, 5]) == [40, 0, 31, 23, 0, 5, 35, 17, 0, 19]\nassert turn_list([7, 39, 18, 24, -4, 38, 6, 34, 35, 22, 38]) == [6, 34, 35, 22, 38, 7, 39, 18, 24, -4, 38]\nassert turn_list([4, 46, 0, -6, 32, 16, 18, -3, 42]) == [0, -6, 32, 16, 18, -3, 42, 4, 46]\nassert turn_list([19, -6, -9, 3, -5, 23, -7, -5, -9, 28, 24]) == [-7, -5, -9, 28, 24, 19, -6, -9, 3, -5, 23]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 16 % 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 = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nمثال: `turn_list([15, 5, 2, 20, 6])` يجب أن تُرجع `[6, 15, 5, 2, 20]`.\nالجواب:", "qhash": "8dfff2b7b47ed576"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate([15, 42, 25, 11, 30]) == [25, 11, 30, 15, 42]", "assert rotate([10, 16, 20, 32, 22]) == [20, 32, 22, 10, 16]", "assert rotate([4, 34]) == [4, 34]", "assert rotate([23, -3, 37, 28, 29, 1, -3]) == [-3, 23, -3, 37, 28, 29, 1]", "assert rotate([15, 42]) == [15, 42]", "assert rotate([5, -1, 48, 46, 45]) == [48, 46, 45, 5, -1]", "assert rotate([]) == []"], "test_code": "assert rotate([15, 42, 25, 11, 30]) == [25, 11, 30, 15, 42]\nassert rotate([10, 16, 20, 32, 22]) == [20, 32, 22, 10, 16]\nassert rotate([4, 34]) == [4, 34]\nassert rotate([23, -3, 37, 28, 29, 1, -3]) == [-3, 23, -3, 37, 28, 29, 1]\nassert rotate([15, 42]) == [15, 42]\nassert rotate([5, -1, 48, 46, 45]) == [48, 46, 45, 5, -1]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return ____\n```\nمثال: `rotate([15, 42, 25, 11, 30])` يجب أن تُرجع `[25, 11, 30, 15, 42]`.\nالجواب:", "qhash": "3c9a92c232f23200"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['brain', 'apple', 'table', 'camel', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['brain', 'apple', 'table', 'camel', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "58eb920569cee4fc", "answer": "['code', 'brain', 'apple', 'table', 'camel']\n['table', 'camel', 'brain']", "completion": " الناتج:\n```text\n['code', 'brain', 'apple', 'table', 'camel']\n['table', 'camel', 'brain']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 38) == 1)", "tests": ["assert rel_prime_count(65) == 31", "assert rel_prime_count(126) == 60", "assert rel_prime_count(179) == 85", "assert rel_prime_count(135) == 64", "assert rel_prime_count(200) == 95", "assert rel_prime_count(177) == 84", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(65) == 31\nassert rel_prime_count(126) == 60\nassert rel_prime_count(179) == 85\nassert rel_prime_count(135) == 64\nassert rel_prime_count(200) == 95\nassert rel_prime_count(177) == 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, 38) == 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, 38) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 38) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(65)` يُرجع `31`.\nالجواب:", "qhash": "a105344d276df31f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([10, 3, 6, 11, 2, 22, 19, 15, 5, 22]) == [10, 13, 19, 30, 32, 0, 19, 34, 0, 22]", "assert acc_reset([26, 32, 30, 17, 34]) == [26, 0, 30, 0, 34]", "assert acc_reset([24, 4, -6, -7, 25, 33, 1, 22, -9]) == [24, 28, 22, 15, 0, 33, 34, 0, -9]", "assert acc_reset([30, 1, -7]) == [30, 31, 24]", "assert acc_reset([5, 12]) == [5, 17]", "assert acc_reset([-10, 3, -6, 1]) == [-10, -7, -13, -12]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([10, 3, 6, 11, 2, 22, 19, 15, 5, 22]) == [10, 13, 19, 30, 32, 0, 19, 34, 0, 22]\nassert acc_reset([26, 32, 30, 17, 34]) == [26, 0, 30, 0, 34]\nassert acc_reset([24, 4, -6, -7, 25, 33, 1, 22, -9]) == [24, 28, 22, 15, 0, 33, 34, 0, -9]\nassert acc_reset([30, 1, -7]) == [30, 31, 24]\nassert acc_reset([5, 12]) == [5, 17]\nassert acc_reset([-10, 3, -6, 1]) == [-10, -7, -13, -12]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\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 > 34:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 34 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([10, 3, 6, 11, 2, 22, 19, 15, 5, 22])` يُرجع `[10, 13, 19, 30, 32, 0, 19, 34, 0, 22]`.\nالجواب:", "qhash": "8c856961568b53cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 14 <= x <= 27)", "tests": ["assert in_range_scaled([12, 20, 5, 28, 21, 10]) == [100, 105]", "assert in_range_scaled([8]) == []", "assert in_range_scaled([11, 2, 19]) == [95]", "assert in_range_scaled([]) == []", "assert in_range_scaled([58, 37, 13, 23, 11, 30]) == [115]", "assert in_range_scaled([15, -23, -9, -8, 58, 11, 53]) == [75]", "assert in_range_scaled([22, -1, -14, 45, 38, -2, 24, -17]) == [110, 120]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([12, 20, 5, 28, 21, 10]) == [100, 105]\nassert in_range_scaled([8]) == []\nassert in_range_scaled([11, 2, 19]) == [95]\nassert in_range_scaled([]) == []\nassert in_range_scaled([58, 37, 13, 23, 11, 30]) == [115]\nassert in_range_scaled([15, -23, -9, -8, 58, 11, 53]) == [75]\nassert in_range_scaled([22, -1, -14, 45, 38, -2, 24, -17]) == [110, 120]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 14 <= x <= 27)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 14 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 14 و27 (شاملًا الطرفين) في 5.\nمثال: `in_range_scaled([12, 20, 5, 28, 21, 10])` يجب أن تُرجع `[100, 105]`.\nالجواب:", "qhash": "8de32ca672909e9a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('فجر ميناء مدرسة شجرة صحراء نهار فجر') == 2", "assert starts_count('طالب سلام شمس قمر') == 0", "assert starts_count('مدينة قلم سلام') == 0", "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('طالب سلام شمس قمر') == 0\nassert starts_count('مدينة قلم سلام') == 0\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": "95f722e28d0ae1c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([55, 40, -3, -3, 33, 8, -27]) == 40", "assert max_div([-10, -2, -2]) == -2", "assert max_div([1]) == None", "assert max_div([-38, 36, 7, 28]) == 36", "assert max_div([-27, -13, 31, 10, 50, 37, 50, -28, -39]) == 50", "assert max_div([]) == None"], "test_code": "assert max_div([55, 40, -3, -3, 33, 8, -27]) == 40\nassert max_div([-10, -2, -2]) == -2\nassert max_div([1]) == None\nassert max_div([-38, 36, 7, 28]) == 36\nassert max_div([-27, -13, 31, 10, 50, 37, 50, -28, -39]) == 50\nassert max_div([]) == None", "answer": "def max_div(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(nums):\n best = None\n for x in nums:\n if x % 2 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(nums):\n best = None\n for x in nums:\n if x % 2 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([55, 40, -3, -3, 33, 8, -27])` يُرجع `40`.\nالجواب:", "qhash": "7e43a3a231e670f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 292\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 = 292\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": "d7d6a1839adbe8ff", "answer": "117", "completion": " الناتج:\n```text\n117\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 15) == 1)", "tests": ["assert rel_prime_count(68) == 37", "assert rel_prime_count(46) == 25", "assert rel_prime_count(121) == 65", "assert rel_prime_count(132) == 70", "assert rel_prime_count(66) == 35", "assert rel_prime_count(141) == 75", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(68) == 37\nassert rel_prime_count(46) == 25\nassert rel_prime_count(121) == 65\nassert rel_prime_count(132) == 70\nassert rel_prime_count(66) == 35\nassert rel_prime_count(141) == 75\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, 15) == 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, 15) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 15، أي أن القاسم المشترك الأكبر لها مع 15 يساوي 1.\nمثال: `rel_prime_count(68)` يجب أن تُرجع `37`.\nالجواب:", "qhash": "0d531d2d63530ccd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 11", "tests": ["assert prod_mod(6) == 7", "assert prod_mod(55) == 0", "assert prod_mod(12) == 8", "assert prod_mod(28) == 0", "assert prod_mod(42) == 0", "assert prod_mod(3) == 3", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 7\nassert prod_mod(55) == 0\nassert prod_mod(12) == 8\nassert prod_mod(28) == 0\nassert prod_mod(42) == 0\nassert prod_mod(3) == 3\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 11", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(6)` يُرجع `7`.\nالجواب:", "qhash": "9951cdbb2c98e725"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=0):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(15))\nprint(calc(15, 17))\nprint(calc(calc(17), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=0):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(15))\nprint(calc(15, 17))\nprint(calc(calc(17), 15))\n```\nالجواب:", "qhash": "3deb4ee8e2852266", "answer": "135\n168\n1362", "completion": " الناتج:\n```text\n135\n168\n1362\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('طائرة نهار شمس مطر حاسوب مدرسة')` يُرجع `0`.\nالجواب:", "qhash": "2a71897145f6cffd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [6, 36, 4, 18, 30, -5, 26, 2]\nprint(xs[3:8])\nprint(xs[::-2])\nprint(min(xs[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [6, 36, 4, 18, 30, -5, 26, 2]\nprint(xs[3:8])\nprint(xs[::-2])\nprint(min(xs[3:8]))\n```\nالجواب:", "qhash": "077d209fb5777a1f", "answer": "[18, 30, -5, 26, 2]\n[2, -5, 18, 36]\n-5", "completion": " الناتج:\n```text\n[18, 30, -5, 26, 2]\n[2, -5, 18, 36]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "tests": ["assert multiples_total(243) == 7307", "assert multiples_total(86) == 872", "assert multiples_total(57) == 435", "assert multiples_total(0) == 0", "assert multiples_total(295) == 10551", "assert multiples_total(74) == 633", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(243) == 7307\nassert multiples_total(86) == 872\nassert multiples_total(57) == 435\nassert multiples_total(0) == 0\nassert multiples_total(295) == 10551\nassert multiples_total(74) == 633\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 % 11 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 11.\nمثال: `multiples_total(243)` يجب أن تُرجع `7307`.\nالجواب:", "qhash": "73ec468bea95c397"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('window cloud') == 'eqvlwe ktwcl'", "assert rot('summer in desert OK') == 'acuumz qv lmamzb OK'", "assert rot('table rocket') == 'bijtm zwksmb'", "assert rot('window pixel a stone') == 'eqvlwe xqfmt i abwvm'", "assert rot('banana') == 'jivivi'", "assert rot('table desert is') == 'bijtm lmamzb qa'", "assert rot('') == ''"], "test_code": "assert rot('window cloud') == 'eqvlwe ktwcl'\nassert rot('summer in desert OK') == 'acuumz qv lmamzb OK'\nassert rot('table rocket') == 'bijtm zwksmb'\nassert rot('window pixel a stone') == 'eqvlwe xqfmt i abwvm'\nassert rot('banana') == 'jivivi'\nassert rot('table desert is') == 'bijtm lmamzb qa'\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 + (-18)) % 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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('window cloud')` يجب أن تُرجع `'eqvlwe ktwcl'`.\nالجواب:", "qhash": "9241b6ae42e84a13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(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 tally_div([2, 23, 36, 85, 0, 62, 22, 12, 90, 7, 33, 68]) == 3", "assert tally_div([26, 89]) == 0", "assert tally_div([19, 70, 8, -36, 15, 74, 13]) == 2", "assert tally_div([-15, 54, 40, 66, 38, 39, 10, 15, 90, 76]) == 2", "assert tally_div([-28, 53, -8, 10, 75, 23, 25, -20, 89, 55, 86, -38]) == 2", "assert tally_div([1, 79, -2, -12, -2, 31, 72, 76, 86, 40]) == 4", "assert tally_div([]) == 0"], "test_code": "assert tally_div([2, 23, 36, 85, 0, 62, 22, 12, 90, 7, 33, 68]) == 3\nassert tally_div([26, 89]) == 0\nassert tally_div([19, 70, 8, -36, 15, 74, 13]) == 2\nassert tally_div([-15, 54, 40, 66, 38, 39, 10, 15, 90, 76]) == 2\nassert tally_div([-28, 53, -8, 10, 75, 23, 25, -20, 89, 55, 86, -38]) == 2\nassert tally_div([1, 79, -2, -12, -2, 31, 72, 76, 86, 40]) == 4\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `tally_div([2, 23, 36, 85, 0, 62, 22, 12, 90, 7, 33, 68])` يُرجع `3`.\nالجواب:", "qhash": "4515fc9ce59ddc91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'gh'}", "tests": ["assert char_freq('orange matrix') == {'g': 1, 'h': 0}", "assert char_freq('stone is') == {'g': 0, 'h': 0}", "assert char_freq('to signal') == {'g': 1, 'h': 0}", "assert char_freq('an music') == {'g': 0, 'h': 0}", "assert char_freq('brain falcon') == {'g': 0, 'h': 0}", "assert char_freq('window coffee is') == {'g': 0, 'h': 0}", "assert char_freq('') == {'g': 0, 'h': 0}"], "test_code": "assert char_freq('orange matrix') == {'g': 1, 'h': 0}\nassert char_freq('stone is') == {'g': 0, 'h': 0}\nassert char_freq('to signal') == {'g': 1, 'h': 0}\nassert char_freq('an music') == {'g': 0, 'h': 0}\nassert char_freq('brain falcon') == {'g': 0, 'h': 0}\nassert char_freq('window coffee is') == {'g': 0, 'h': 0}\nassert char_freq('') == {'g': 0, 'h': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'gh'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'gh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'h' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('orange matrix')` يُرجع `{'g': 1, 'h': 0}`.\nالجواب:", "qhash": "29313ec05501a690"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('planet garden engine desert pixel light') == 'light/pixel/desert/engine/garden/planet'", "assert backwards('in winter matrix stone python music it') == 'it/music/python/stone/matrix/winter/in'", "assert backwards('go apple stone') == 'stone/apple/go'", "assert backwards('code banana apple') == 'apple/banana/code'", "assert backwards('a pixel') == 'pixel'", "assert backwards('engine code orange window window rocket') == 'rocket/window/window/orange/code/engine'", "assert backwards('vector an falcon window cloud brain') == 'brain/cloud/window/falcon/an/vector'"], "test_code": "assert backwards('planet garden engine desert pixel light') == 'light/pixel/desert/engine/garden/planet'\nassert backwards('in winter matrix stone python music it') == 'it/music/python/stone/matrix/winter/in'\nassert backwards('go apple stone') == 'stone/apple/go'\nassert backwards('code banana apple') == 'apple/banana/code'\nassert backwards('a pixel') == 'pixel'\nassert backwards('engine code orange window window rocket') == 'rocket/window/window/orange/code/engine'\nassert backwards('vector an falcon window cloud brain') == 'brain/cloud/window/falcon/an/vector'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('planet garden engine desert pixel light')` يُرجع `'light/pixel/desert/engine/garden/planet'`.\nالجواب:", "qhash": "4d11d004db72815d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_join('banana pixel light winter we engine engine by') == 'engine,engine,winter,light,pixel,banana'", "assert rev_join('code code data on pixel summer light engine') == 'engine,light,summer,pixel,data,code,code'", "assert rev_join('cloud') == 'cloud'", "assert rev_join('matrix camel to music') == 'music,camel,matrix'", "assert rev_join('river we desert pixel matrix') == 'matrix,pixel,desert,river'", "assert rev_join('') == ''", "assert rev_join('python engine an cloud code table cloud') == 'cloud,table,code,cloud,engine,python'"], "test_code": "assert rev_join('banana pixel light winter we engine engine by') == 'engine,engine,winter,light,pixel,banana'\nassert rev_join('code code data on pixel summer light engine') == 'engine,light,summer,pixel,data,code,code'\nassert rev_join('cloud') == 'cloud'\nassert rev_join('matrix camel to music') == 'music,camel,matrix'\nassert rev_join('river we desert pixel matrix') == 'matrix,pixel,desert,river'\nassert rev_join('') == ''\nassert rev_join('python engine an cloud code table cloud') == 'cloud,table,code,cloud,engine,python'", "answer": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `rev_join('banana pixel light winter we engine engine by')` يجب أن تُرجع `'engine,engine,winter,light,pixel,banana'`.\nالجواب:", "qhash": "110f329ecdd2800d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'عمر': 40, 'حسن': 27, 'مريم': 35, 'منى': 23, 'راشد': 32}\nscores['مريم'] += 4\nscores['فيصل'] = 40\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 = {'عمر': 40, 'حسن': 27, 'مريم': 35, 'منى': 23, 'راشد': 32}\nscores['مريم'] += 4\nscores['فيصل'] = 40\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": "3498fe68a13a5010", "answer": "6\nعمر\n201\n[('منى', 23), ('حسن', 27)]", "completion": " الناتج:\n```text\n6\nعمر\n201\n[('منى', 23), ('حسن', 27)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[k:] + items[:k]", "tests": ["assert turn_list([35, 33, 23, 50, 19, 23, 27, 41]) == [33, 23, 50, 19, 23, 27, 41, 35]", "assert turn_list([25]) == [25]", "assert turn_list([2, 30, 28, 31, 15, 28, -5, 19, 32, 12, 24]) == [12, 24, 2, 30, 28, 31, 15, 28, -5, 19, 32]", "assert turn_list([40, -7, 33, -1]) == [-7, 33, -1, 40]", "assert turn_list([13, 2, 40, 24, 20, 50, 2, 2, 8]) == [13, 2, 40, 24, 20, 50, 2, 2, 8]", "assert turn_list([-8]) == [-8]", "assert turn_list([]) == []"], "test_code": "assert turn_list([35, 33, 23, 50, 19, 23, 27, 41]) == [33, 23, 50, 19, 23, 27, 41, 35]\nassert turn_list([25]) == [25]\nassert turn_list([2, 30, 28, 31, 15, 28, -5, 19, 32, 12, 24]) == [12, 24, 2, 30, 28, 31, 15, 28, -5, 19, 32]\nassert turn_list([40, -7, 33, -1]) == [-7, 33, -1, 40]\nassert turn_list([13, 2, 40, 24, 20, 50, 2, 2, 8]) == [13, 2, 40, 24, 20, 50, 2, 2, 8]\nassert turn_list([-8]) == [-8]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([35, 33, 23, 50, 19, 23, 27, 41])` يُرجع `[33, 23, 50, 19, 23, 27, 41, 35]`.\nالجواب:", "qhash": "36c12f164b5da5c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([48, 72, 73, 41, 67, 72, 82, 15, 37, 66, 66]) == 0", "assert div_not([10]) == 0", "assert div_not([-10, 57, 12, 76, 40, 33, 25, -20, 2, -11, -31]) == 0", "assert div_not([27, 6, 76, -24, 22, 6, 39, 71]) == 0", "assert div_not([42, -32, 80]) == 1", "assert div_not([28, 75, 1, 27, 27]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([48, 72, 73, 41, 67, 72, 82, 15, 37, 66, 66]) == 0\nassert div_not([10]) == 0\nassert div_not([-10, 57, 12, 76, 40, 33, 25, -20, 2, -11, -31]) == 0\nassert div_not([27, 6, 76, -24, 22, 6, 39, 71]) == 0\nassert div_not([42, -32, 80]) == 1\nassert div_not([28, 75, 1, 27, 27]) == 1\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `div_not([48, 72, 73, 41, 67, 72, 82, 15, 37, 66, 66])` يُرجع `0`.\nالجواب:", "qhash": "262751dcdcbb877a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 6 * x ** 2 + (-9) * x + (3)", "tests": ["assert value_at(8) == 315", "assert value_at(-2) == 45", "assert value_at(-8) == 459", "assert value_at(17) == 1584", "assert value_at(8) == 315", "assert value_at(16) == 1395", "assert value_at(4) == 63", "assert value_at(0) == 3"], "test_code": "assert value_at(8) == 315\nassert value_at(-2) == 45\nassert value_at(-8) == 459\nassert value_at(17) == 1584\nassert value_at(8) == 315\nassert value_at(16) == 1395\nassert value_at(4) == 63\nassert value_at(0) == 3", "answer": "def value_at(x):\n return 6 * x ** 2 + (-9) * x + (3)", "completion": " ```python\ndef value_at(x):\n return 6 * x ** 2 + (-9) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 6x² - 9x + 3 عند العدد الصحيح x.\nمثال: `value_at(8)` يجب أن تُرجع `315`.\nالجواب:", "qhash": "abb2b051db0388c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([50, -27, 26, -28, 38, -2]) == -27", "assert biggest_mult([-3, -9, -6]) == -3", "assert biggest_mult([1, 4, 7]) == None", "assert biggest_mult([6, -15, -5, 20, 33, 23, 34, 4, 24]) == 33", "assert biggest_mult([1, 16, -15, -32, -18]) == -15", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([50, -27, 26, -28, 38, -2]) == -27\nassert biggest_mult([-3, -9, -6]) == -3\nassert biggest_mult([1, 4, 7]) == None\nassert biggest_mult([6, -15, -5, 20, 33, 23, 34, 4, 24]) == 33\nassert biggest_mult([1, 16, -15, -32, -18]) == -15\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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للتوضيح: الاستدعاء `biggest_mult([50, -27, 26, -28, 38, -2])` يُرجع `-27`.\nالجواب:", "qhash": "fad4243cba9b48a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 57) == 1)", "tests": ["assert count_coprime(150) == 95", "assert count_coprime(73) == 47", "assert count_coprime(196) == 124", "assert count_coprime(127) == 81", "assert count_coprime(189) == 120", "assert count_coprime(46) == 29", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(150) == 95\nassert count_coprime(73) == 47\nassert count_coprime(196) == 124\nassert count_coprime(127) == 81\nassert count_coprime(189) == 120\nassert count_coprime(46) == 29\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, 57) == 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, 57) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 57) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(150)` يُرجع `95`.\nالجواب:", "qhash": "ea6d414656aacd22"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "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": "b638b6a3493b80eb", "answer": "8\nر\n2", "completion": " الناتج:\n```text\n8\nر\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([7, 56, -27, 54]) == 56", "assert largest_div([-28, -28, -21]) == -21", "assert largest_div([1, 8, 15, 22]) == None", "assert largest_div([-13, 16, 2, 40, 2, 1, -36, -19, -31]) == None", "assert largest_div([40, -3, -16, 39, 33, -6, 9, 47]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([7, 56, -27, 54]) == 56\nassert largest_div([-28, -28, -21]) == -21\nassert largest_div([1, 8, 15, 22]) == None\nassert largest_div([-13, 16, 2, 40, 2, 1, -36, -19, -31]) == None\nassert largest_div([40, -3, -16, 39, 33, -6, 9, 47]) == None\nassert largest_div([]) == None", "answer": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([7, 56, -27, 54])` يُرجع `56`.\nالجواب:", "qhash": "fe2c2947bd02bf0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [14, 20, -6, -8, 21]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [14, 20, -6, -8, 21]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "3c3682e9bdd656ef", "answer": "[14, 20, 21, -6, -8]\n[21, 20, 14]", "completion": " الناتج:\n```text\n[14, 20, 21, -6, -8]\n[21, 20, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ln'}", "tests": ["assert char_freq('up in code at') == {'l': 0, 'n': 1}", "assert char_freq('camel') == {'l': 1, 'n': 0}", "assert char_freq('we it cloud signal') == {'l': 2, 'n': 1}", "assert char_freq('go banana') == {'l': 0, 'n': 2}", "assert char_freq('camel it on to code') == {'l': 1, 'n': 1}", "assert char_freq('cloud') == {'l': 1, 'n': 0}", "assert char_freq('') == {'l': 0, 'n': 0}"], "test_code": "assert char_freq('up in code at') == {'l': 0, 'n': 1}\nassert char_freq('camel') == {'l': 1, 'n': 0}\nassert char_freq('we it cloud signal') == {'l': 2, 'n': 1}\nassert char_freq('go banana') == {'l': 0, 'n': 2}\nassert char_freq('camel it on to code') == {'l': 1, 'n': 1}\nassert char_freq('cloud') == {'l': 1, 'n': 0}\nassert char_freq('') == {'l': 0, 'n': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ln'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ln'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'l'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('up in code at')` يجب أن تُرجع `{'l': 0, 'n': 1}`.\nالجواب:", "qhash": "c6b0df21123fcb92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 7\nfor n in range(3, 12, 1):\n acc += n * 4\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 7\nfor n in range(3, 12, 1):\n acc += n * 4\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "cc7dd07aa0c69bd0", "answer": "259\n11", "completion": " الناتج:\n```text\n259\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([40, -6, 58, -20]) == 40", "assert top_divisible([-4, -20, -4]) == -4", "assert top_divisible([1]) == None", "assert top_divisible([-26, 8, 1, 25, 5, 20, -18, 24, -4]) == 24", "assert top_divisible([30, 36, 1, 25, -38]) == 36", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([40, -6, 58, -20]) == 40\nassert top_divisible([-4, -20, -4]) == -4\nassert top_divisible([1]) == None\nassert top_divisible([-26, 8, 1, 25, 5, 20, -18, 24, -4]) == 24\nassert top_divisible([30, 36, 1, 25, -38]) == 36\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(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للتوضيح: الاستدعاء `top_divisible([40, -6, 58, -20])` يُرجع `40`.\nالجواب:", "qhash": "d3faa4576234aeb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return -9 * x ** 2 + (9) * x + (-6)", "tests": ["assert value_at(5) == -186", "assert value_at(6) == -276", "assert value_at(16) == -2166", "assert value_at(11) == -996", "assert value_at(6) == -276", "assert value_at(1) == -6", "assert value_at(-15) == -2166", "assert value_at(0) == -6"], "test_code": "assert value_at(5) == -186\nassert value_at(6) == -276\nassert value_at(16) == -2166\nassert value_at(11) == -996\nassert value_at(6) == -276\nassert value_at(1) == -6\nassert value_at(-15) == -2166\nassert value_at(0) == -6", "answer": "def value_at(x):\n return -9 * x ** 2 + (9) * x + (-6)", "completion": " ```python\ndef value_at(x):\n return -9 * x ** 2 + (9) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار -9x² + 9x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(5)` يُرجع `-186`.\nالجواب:", "qhash": "e78480559e22be5f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 4\nfor i in range(7, 10, 2):\n result += i * 5\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 4\nfor i in range(7, 10, 2):\n result += i * 5\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "4c754bae8dc3f41b", "answer": "84\n9", "completion": " الناتج:\n```text\n84\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 57) == 1)", "tests": ["assert phi_upto(60) == 38", "assert phi_upto(176) == 112", "assert phi_upto(75) == 48", "assert phi_upto(15) == 10", "assert phi_upto(182) == 116", "assert phi_upto(34) == 22", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(60) == 38\nassert phi_upto(176) == 112\nassert phi_upto(75) == 48\nassert phi_upto(15) == 10\nassert phi_upto(182) == 116\nassert phi_upto(34) == 22\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, 57) == 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, 57) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 57) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(60)` يُرجع `38`.\nالجواب:", "qhash": "8f55d3974add0862"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72", "tests": ["assert sum_digit_pow(36343) == 19", "assert sum_digit_pow(228405) == 21", "assert sum_digit_pow(796397) == 41", "assert sum_digit_pow(816201) == 18", "assert sum_digit_pow(365181) == 24", "assert sum_digit_pow(898865) == 44", "assert sum_digit_pow(64328) == 23", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(36343) == 19\nassert sum_digit_pow(228405) == 21\nassert sum_digit_pow(796397) == 41\nassert sum_digit_pow(816201) == 18\nassert sum_digit_pow(365181) == 24\nassert sum_digit_pow(898865) == 44\nassert sum_digit_pow(64328) == 23\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 72.\nللتوضيح: الاستدعاء `sum_digit_pow(36343)` يُرجع `19`.\nالجواب:", "qhash": "1ae5e7817b61aa63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert sum_div(174) == 2436", "assert sum_div(194) == 3168", "assert sum_div(39) == 128", "assert sum_div(80) == 468", "assert sum_div(299) == 7352", "assert sum_div(116) == 1140", "assert sum_div(1) == 0"], "test_code": "assert sum_div(174) == 2436\nassert sum_div(194) == 3168\nassert sum_div(39) == 128\nassert sum_div(80) == 468\nassert sum_div(299) == 7352\nassert sum_div(116) == 1140\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 12.\nمثال: `sum_div(174)` يجب أن تُرجع `2436`.\nالجواب:", "qhash": "dec644aae00f7f2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -6 * x ** 2 + (6) * x + (-4)", "tests": ["assert eval_poly(3) == -40", "assert eval_poly(9) == -436", "assert eval_poly(-10) == -664", "assert eval_poly(17) == -1636", "assert eval_poly(17) == -1636", "assert eval_poly(5) == -124", "assert eval_poly(-17) == -1840", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(3) == -40\nassert eval_poly(9) == -436\nassert eval_poly(-10) == -664\nassert eval_poly(17) == -1636\nassert eval_poly(17) == -1636\nassert eval_poly(5) == -124\nassert eval_poly(-17) == -1840\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return -6 * x ** 2 + (6) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return -6 * x ** 2 + (6) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -6x² + 6x - 4 عند العدد الصحيح x.\nمثال: `eval_poly(3)` يجب أن تُرجع `-40`.\nالجواب:", "qhash": "8a510c410ce0dbf3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89", "tests": ["assert multi_fact(3) == 3", "assert multi_fact(3) == 3", "assert multi_fact(56) == 61", "assert multi_fact(17) == 49", "assert multi_fact(7) == 16", "assert multi_fact(17) == 49", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(3) == 3\nassert multi_fact(3) == 3\nassert multi_fact(56) == 61\nassert multi_fact(17) == 49\nassert multi_fact(7) == 16\nassert multi_fact(17) == 49\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(3)` يُرجع `3`.\nالجواب:", "qhash": "f0559a21e80aabb8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 40", "tests": ["assert dig_pow_mod(93718) == 4", "assert dig_pow_mod(697594) == 8", "assert dig_pow_mod(896041) == 38", "assert dig_pow_mod(163135) == 1", "assert dig_pow_mod(312249) == 35", "assert dig_pow_mod(363018) == 39", "assert dig_pow_mod(425511) == 32", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(93718) == 4\nassert dig_pow_mod(697594) == 8\nassert dig_pow_mod(896041) == 38\nassert dig_pow_mod(163135) == 1\nassert dig_pow_mod(312249) == 35\nassert dig_pow_mod(363018) == 39\nassert dig_pow_mod(425511) == 32\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 40", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 40\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 40.\nمثال: `dig_pow_mod(93718)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "a3a680bddd38d91d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert game(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac']", "assert game(4) == ['1', 'Tic', '3', 'Tic']", "assert game(19) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19']", "assert game(4) == ['1', 'Tic', '3', 'Tic']", "assert game(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']"], "test_code": "assert game(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac']\nassert game(4) == ['1', 'Tic', '3', 'Tic']\nassert game(19) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19']\nassert game(4) == ['1', 'Tic', '3', 'Tic']\nassert game(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']", "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 % 10 == 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 % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Tic'، وعلى 10 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(20)` يجب أن تُرجع `['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac']`.\nالجواب:", "qhash": "6a945660e060e22a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'garden'\nprint(text.capitalize())\nprint(text.replace('n', '*'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'garden'\nprint(text.capitalize())\nprint(text.replace('n', '*'))\nprint(len(text))\n```\nالجواب:", "qhash": "5f46656ff4e808cd", "answer": "Garden\ngarde*\n6", "completion": " الناتج:\n```text\nGarden\ngarde*\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 45) == 1)", "tests": ["assert count_gcd1(127) == 68", "assert count_gcd1(81) == 43", "assert count_gcd1(109) == 59", "assert count_gcd1(46) == 25", "assert count_gcd1(117) == 62", "assert count_gcd1(193) == 103", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(127) == 68\nassert count_gcd1(81) == 43\nassert count_gcd1(109) == 59\nassert count_gcd1(46) == 25\nassert count_gcd1(117) == 62\nassert count_gcd1(193) == 103\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, 45) == 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, 45) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 45، أي أن القاسم المشترك الأكبر لها مع 45 يساوي 1.\nمثال: `count_gcd1(127)` يجب أن تُرجع `68`.\nالجواب:", "qhash": "a09a663b59ba3af6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(10))\nprint(calc(10, 10))\nprint(calc(calc(10), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(10))\nprint(calc(10, 10))\nprint(calc(calc(10), 10))\n```\nالجواب:", "qhash": "b6878f2e2d63e99c", "answer": "60\n70\n350", "completion": " الناتج:\n```text\n60\n70\n350\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 61", "tests": ["assert prod_mod(7) == 38", "assert prod_mod(49) == 13", "assert prod_mod(4) == 24", "assert prod_mod(16) == 60", "assert prod_mod(50) == 40", "assert prod_mod(12) == 15", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(7) == 38\nassert prod_mod(49) == 13\nassert prod_mod(4) == 24\nassert prod_mod(16) == 60\nassert prod_mod(50) == 40\nassert prod_mod(12) == 15\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 61", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(7)` يجب أن تُرجع `38`.\nالجواب:", "qhash": "d89beda713b531d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 14)", "tests": ["assert between_times([8, 3, -1, 15, 24, 22, 8, 14]) == [32, 32, 56]", "assert between_times([-11, 45, 24, 11, -29, 14, -23]) == [44, 56]", "assert between_times([-18, 25, 49, -30, 44]) == []", "assert between_times([-19, 29, -5, -27, 60, 54, 40, 24, 41, 6]) == []", "assert between_times([-14, 22, -12, -21, 37, -24, 42]) == []", "assert between_times([-13, -7, 27, 1]) == []", "assert between_times([52, -17]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([8, 3, -1, 15, 24, 22, 8, 14]) == [32, 32, 56]\nassert between_times([-11, 45, 24, 11, -29, 14, -23]) == [44, 56]\nassert between_times([-18, 25, 49, -30, 44]) == []\nassert between_times([-19, 29, -5, -27, 60, 54, 40, 24, 41, 6]) == []\nassert between_times([-14, 22, -12, -21, 37, -24, 42]) == []\nassert between_times([-13, -7, 27, 1]) == []\nassert between_times([52, -17]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 14)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 8 ≤ x ≤ 14، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([8, 3, -1, 15, 24, 22, 8, 14])` يُرجع `[32, 32, 56]`.\nالجواب:", "qhash": "858badfe745ccebd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('تفاحة فجر مكتبة دفتر قهوة نهار سوق سلام') == 0", "assert letter_hits('ميناء كتاب صحراء مطر') == 0", "assert letter_hits('فجر جبل وردة قهوة تفاحة سلام معلم صحراء') == 0", "assert letter_hits('شجرة سلام مطر') == 1", "assert letter_hits('دفتر برمجة فجر قمر شمس') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('مدينة سفينة برتقال') == 0\nassert letter_hits('حديقة سفينة') == 0\nassert letter_hits('تفاحة فجر مكتبة دفتر قهوة نهار سوق سلام') == 0\nassert letter_hits('ميناء كتاب صحراء مطر') == 0\nassert letter_hits('فجر جبل وردة قهوة تفاحة سلام معلم صحراء') == 0\nassert letter_hits('شجرة سلام مطر') == 1\nassert letter_hits('دفتر برمجة فجر قمر شمس') == 1\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": "0ed537962bd475a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 69) == 1)", "tests": ["assert count_gcd1(32) == 21", "assert count_gcd1(70) == 45", "assert count_gcd1(66) == 42", "assert count_gcd1(27) == 17", "assert count_gcd1(54) == 34", "assert count_gcd1(94) == 60", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(32) == 21\nassert count_gcd1(70) == 45\nassert count_gcd1(66) == 42\nassert count_gcd1(27) == 17\nassert count_gcd1(54) == 34\nassert count_gcd1(94) == 60\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, 69) == 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, 69) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 69، أي أن القاسم المشترك الأكبر لها مع 69 يساوي 1.\nمثال: `count_gcd1(32)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "0d41b14ffeb0dbee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "tests": ["assert letter_stats('engine light') == {'m': 0, 'r': 0}", "assert letter_stats('desert window planet desert') == {'m': 0, 'r': 2}", "assert letter_stats('rocket up vector we apple rocket') == {'m': 0, 'r': 3}", "assert letter_stats('falcon python on pixel river') == {'m': 0, 'r': 2}", "assert letter_stats('falcon vector in') == {'m': 0, 'r': 1}", "assert letter_stats('go banana') == {'m': 0, 'r': 0}", "assert letter_stats('') == {'m': 0, 'r': 0}"], "test_code": "assert letter_stats('engine light') == {'m': 0, 'r': 0}\nassert letter_stats('desert window planet desert') == {'m': 0, 'r': 2}\nassert letter_stats('rocket up vector we apple rocket') == {'m': 0, 'r': 3}\nassert letter_stats('falcon python on pixel river') == {'m': 0, 'r': 2}\nassert letter_stats('falcon vector in') == {'m': 0, 'r': 1}\nassert letter_stats('go banana') == {'m': 0, 'r': 0}\nassert letter_stats('') == {'m': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'mr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'm'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('engine light')` يجب أن تُرجع `{'m': 0, 'r': 0}`.\nالجواب:", "qhash": "05f4eb2809a520ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [14, 17, 12, 9, 28]\nprint(items[3:5])\nprint(items[::3])\nprint(len(items[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [14, 17, 12, 9, 28]\nprint(items[3:5])\nprint(items[::3])\nprint(len(items[3:5]))\n```\nالجواب:", "qhash": "41882a50646dc5a0", "answer": "[9, 28]\n[14, 9]\n2", "completion": " الناتج:\n```text\n[9, 28]\n[14, 9]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [3, -6, 32, -3, 10, 37]\nprint(lst[2:5])\nprint(lst[::-2])\nprint(sum(lst[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [3, -6, 32, -3, 10, 37]\nprint(lst[2:5])\nprint(lst[::-2])\nprint(sum(lst[2:5]))\n```\nالجواب:", "qhash": "b949f42d01420d3a", "answer": "[32, -3, 10]\n[37, -3, -6]\n39", "completion": " الناتج:\n```text\n[32, -3, 10]\n[37, -3, -6]\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 87544\nsteps = 0\nwhile n > 18:\n n = n // 6\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 87544\nsteps = 0\nwhile n > 18:\n n = n // 6\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "45adde58977bd588", "answer": "11 5", "completion": " الناتج:\n```text\n11 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 33", "tests": ["assert sum_digit_pow(4315) == 6", "assert sum_digit_pow(185424) == 3", "assert sum_digit_pow(903408) == 5", "assert sum_digit_pow(94509) == 11", "assert sum_digit_pow(585365) == 22", "assert sum_digit_pow(435633) == 11", "assert sum_digit_pow(597336) == 23", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(4315) == 6\nassert sum_digit_pow(185424) == 3\nassert sum_digit_pow(903408) == 5\nassert sum_digit_pow(94509) == 11\nassert sum_digit_pow(585365) == 22\nassert sum_digit_pow(435633) == 11\nassert sum_digit_pow(597336) == 23\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 33", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 33.\nللتوضيح: الاستدعاء `sum_digit_pow(4315)` يُرجع `6`.\nالجواب:", "qhash": "cde6ea76990ca7a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(-1))\nprint(compute(-1, 1))\nprint(compute(compute(1), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(-1))\nprint(compute(-1, 1))\nprint(compute(compute(1), -1))\n```\nالجواب:", "qhash": "948a75359d5a4f15", "answer": "6\n6\n57", "completion": " الناتج:\n```text\n6\n6\n57\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('دفتر مدرسة حصان مطر حديقة حاسوب') == 0", "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('دفتر مدرسة حصان مطر حديقة حاسوب') == 0\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ه» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('سلام ليل جبل قمر برتقال مكتبة سوق صحراء')` يُرجع `0`.\nالجواب:", "qhash": "57a15ae96b4995ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'ميناء تفاحة'\nprint(len(kalima.replace(' ', '')))\nprint(kalima[-1])\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'ميناء تفاحة'\nprint(len(kalima.replace(' ', '')))\nprint(kalima[-1])\nprint(len(kalima))\n```\nالجواب:", "qhash": "72f4e792830cd7b1", "answer": "10\nة\n11", "completion": " الناتج:\n```text\n10\nة\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([5, 10, 13, 2, 8, 13, 13, 3, 8, 5]) == [5, 15, 28, 30, 0, 13, 26, 29, 0, 5]", "assert reset_sum([4, 30, -3, 24]) == [4, 0, -3, 21]", "assert reset_sum([]) == []", "assert reset_sum([-10, 30]) == [-10, 20]", "assert reset_sum([14, 4, -1, 21, 20, 7, -1, 18]) == [14, 18, 17, 0, 20, 27, 26, 0]", "assert reset_sum([6]) == [6]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([5, 10, 13, 2, 8, 13, 13, 3, 8, 5]) == [5, 15, 28, 30, 0, 13, 26, 29, 0, 5]\nassert reset_sum([4, 30, -3, 24]) == [4, 0, -3, 21]\nassert reset_sum([]) == []\nassert reset_sum([-10, 30]) == [-10, 20]\nassert reset_sum([14, 4, -1, 21, 20, 7, -1, 18]) == [14, 18, 17, 0, 20, 27, 26, 0]\nassert reset_sum([6]) == [6]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\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 > 30:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 30 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([5, 10, 13, 2, 8, 13, 13, 3, 8, 5])` يُرجع `[5, 15, 28, 30, 0, 13, 26, 29, 0, 5]`.\nالجواب:", "qhash": "3f86af8e2b5314cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('rocket banana') == 'yvjrla ihuhuh'", "assert decode('falcon') == 'mhsjvu'", "assert decode('code OK') == 'jvkl OK'", "assert decode('vector at brain winter Hello') == 'cljavy ha iyhpu dpualy Hlssv'", "assert decode('it on planet an data OK') == 'pa vu wshula hu khah OK'", "assert decode('river up camel cloud 2024') == 'ypcly bw jhtls jsvbk 2024'", "assert decode('') == ''"], "test_code": "assert decode('rocket banana') == 'yvjrla ihuhuh'\nassert decode('falcon') == 'mhsjvu'\nassert decode('code OK') == 'jvkl OK'\nassert decode('vector at brain winter Hello') == 'cljavy ha iyhpu dpualy Hlssv'\nassert decode('it on planet an data OK') == 'pa vu wshula hu khah OK'\nassert decode('river up camel cloud 2024') == 'ypcly bw jhtls jsvbk 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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('rocket banana')` يجب أن تُرجع `'yvjrla ihuhuh'`.\nالجواب:", "qhash": "d9d27a726576f7ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 69", "tests": ["assert dig_pow_mod(17470) == 61", "assert dig_pow_mod(249116) == 53", "assert dig_pow_mod(661043) == 41", "assert dig_pow_mod(182937) == 33", "assert dig_pow_mod(817649) == 2", "assert dig_pow_mod(107013) == 27", "assert dig_pow_mod(398713) == 52", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(17470) == 61\nassert dig_pow_mod(249116) == 53\nassert dig_pow_mod(661043) == 41\nassert dig_pow_mod(182937) == 33\nassert dig_pow_mod(817649) == 2\nassert dig_pow_mod(107013) == 27\nassert dig_pow_mod(398713) == 52\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 69", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 69\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 69.\nمثال: `dig_pow_mod(17470)` يجب أن تُرجع `61`.\nالجواب:", "qhash": "574d996ef69483a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert weighted_sum(3) == 3312", "assert weighted_sum(1) == 12", "assert weighted_sum(0) == 0", "assert weighted_sum(2) == 396", "assert weighted_sum(4) == 15600", "assert weighted_sum(1) == 12", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 3312\nassert weighted_sum(1) == 12\nassert weighted_sum(0) == 0\nassert weighted_sum(2) == 396\nassert weighted_sum(4) == 15600\nassert weighted_sum(1) == 12\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 5\n return total\n```\nمثال: `weighted_sum(3)` يجب أن تُرجع `3312`.\nالجواب:", "qhash": "d554a2f25b8b8b16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(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 count_matching([51, 76, 68, 33, 80, 1, 49, 68, 43, 67, 21]) == 2", "assert count_matching([82, 19, 10, 50, 89, -17]) == 0", "assert count_matching([20, -4, -6]) == 0", "assert count_matching([48, 64, 78, 78, 32]) == 0", "assert count_matching([51, 68, 23]) == 0", "assert count_matching([17, 71, 13, -1, 19, 52, 48]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([51, 76, 68, 33, 80, 1, 49, 68, 43, 67, 21]) == 2\nassert count_matching([82, 19, 10, 50, 89, -17]) == 0\nassert count_matching([20, -4, -6]) == 0\nassert count_matching([48, 64, 78, 78, 32]) == 0\nassert count_matching([51, 68, 23]) == 0\nassert count_matching([17, 71, 13, -1, 19, 52, 48]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(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 count_matching(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 count_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_matching([51, 76, 68, 33, 80, 1, 49, 68, 43, 67, 21])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "8aa8a4ae3629d04b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 355\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 = 355\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": "b77731aa0a00cb69", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'وردة'\nprint('ة' in w)\nprint(w[-1])\nprint(len(w.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'وردة'\nprint('ة' in w)\nprint(w[-1])\nprint(len(w.replace(' ', '')))\n```\nالجواب:", "qhash": "fe316503ed7cc26a", "answer": "True\nة\n4", "completion": " الناتج:\n```text\nTrue\nة\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('light planet a music we light planet') == 'planet/light/we/music/planet/light'", "assert words_reversed('brain banana data window data') == 'data/window/data/banana/brain'", "assert words_reversed('orange orange matrix garden python rocket an') == 'an/rocket/python/garden/matrix/orange/orange'", "assert words_reversed('up vector brain it engine') == 'engine/it/brain/vector/up'", "assert words_reversed('banana window planet coffee') == 'coffee/planet/window/banana'", "assert words_reversed('coffee vector by apple pixel') == 'pixel/apple/by/vector/coffee'", "assert words_reversed('vector by apple a it in') == 'in/it/apple/by/vector'"], "test_code": "assert words_reversed('light planet a music we light planet') == 'planet/light/we/music/planet/light'\nassert words_reversed('brain banana data window data') == 'data/window/data/banana/brain'\nassert words_reversed('orange orange matrix garden python rocket an') == 'an/rocket/python/garden/matrix/orange/orange'\nassert words_reversed('up vector brain it engine') == 'engine/it/brain/vector/up'\nassert words_reversed('banana window planet coffee') == 'coffee/planet/window/banana'\nassert words_reversed('coffee vector by apple pixel') == 'pixel/apple/by/vector/coffee'\nassert words_reversed('vector by apple a it in') == 'in/it/apple/by/vector'", "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('light planet a music we light planet')` يجب أن تُرجع `'planet/light/we/music/planet/light'`.\nالجواب:", "qhash": "5f547c0451cb1b19"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [35, 16, 34, 1, 3, 1]\nprint(xs[1:4])\nprint(xs[::-2])\nprint(max(xs[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [35, 16, 34, 1, 3, 1]\nprint(xs[1:4])\nprint(xs[::-2])\nprint(max(xs[1:4]))\n```\nالجواب:", "qhash": "9ee43815e011f4e2", "answer": "[16, 34, 1]\n[1, 1, 16]\n34", "completion": " الناتج:\n```text\n[16, 34, 1]\n[1, 1, 16]\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 43", "tests": ["assert multi_fact(12) == 27", "assert multi_fact(26) == 26", "assert multi_fact(57) == 0", "assert multi_fact(20) == 18", "assert multi_fact(8) == 40", "assert multi_fact(2) == 2", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(12) == 27\nassert multi_fact(26) == 26\nassert multi_fact(57) == 0\nassert multi_fact(20) == 18\nassert multi_fact(8) == 40\nassert multi_fact(2) == 2\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 43", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(12)` يُرجع `27`.\nالجواب:", "qhash": "b60227701071cf32"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return text.count('و')", "tests": ["assert letter_count('بحر تفاحة عربية ماء طائرة جبل') == 0", "assert letter_count('بحر فجر ماء مدينة قمر جبل نهر مدرسة') == 0", "assert letter_count('سوق شجرة بحر لغة سلام سلام نور') == 2", "assert letter_count('') == 0", "assert letter_count('رمل كتاب فجر مدينة قهوة بيت') == 1", "assert letter_count('') == 0", "assert letter_count('معلم حديقة') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('بحر تفاحة عربية ماء طائرة جبل') == 0\nassert letter_count('بحر فجر ماء مدينة قمر جبل نهر مدرسة') == 0\nassert letter_count('سوق شجرة بحر لغة سلام سلام نور') == 2\nassert letter_count('') == 0\nassert letter_count('رمل كتاب فجر مدينة قهوة بيت') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «و» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('بحر تفاحة عربية ماء طائرة جبل')` يُرجع `0`.\nالجواب:", "qhash": "57f2d3411679c3fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 10 for x in range(2, 11) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 10 for x in range(2, 11) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d0ad8e8a21ae667e", "answer": "[-1, 39]\n2 38", "completion": " الناتج:\n```text\n[-1, 39]\n2 38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(68) == 879", "assert multiples_total(138) == 3715", "assert multiples_total(298) == 17850", "assert multiples_total(296) == 17553", "assert multiples_total(234) == 10929", "assert multiples_total(140) == 3853", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(68) == 879\nassert multiples_total(138) == 3715\nassert multiples_total(298) == 17850\nassert multiples_total(296) == 17553\nassert multiples_total(234) == 10929\nassert multiples_total(140) == 3853\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 % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `multiples_total(68)` يجب أن تُرجع `879`.\nالجواب:", "qhash": "e8023b6447c94a68"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'كتاب'\nprint(kalima[0])\nprint(kalima.count('س'))\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'كتاب'\nprint(kalima[0])\nprint(kalima.count('س'))\nprint(kalima[-1])\n```\nالجواب:", "qhash": "69209015fe62bb30", "answer": "ك\n0\nب", "completion": " الناتج:\n```text\nك\n0\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حصان قلم خبز') == 0", "assert prefix_hits('كتاب وردة وردة سماء وردة') == 3", "assert prefix_hits('مدرسة تفاحة') == 0", "assert prefix_hits('نور قلم قمر وردة وردة خبز شمس') == 2", "assert prefix_hits('معلم عربية') == 0", "assert prefix_hits('عمل جبل سماء صديق وردة') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حصان قلم خبز') == 0\nassert prefix_hits('كتاب وردة وردة سماء وردة') == 3\nassert prefix_hits('مدرسة تفاحة') == 0\nassert prefix_hits('نور قلم قمر وردة وردة خبز شمس') == 2\nassert prefix_hits('معلم عربية') == 0\nassert prefix_hits('عمل جبل سماء صديق وردة') == 1\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('حصان قلم خبز')` يُرجع `0`.\nالجواب:", "qhash": "2d57b1e897d92e00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('باب علم نور باب قهوة') == 2", "assert starts_count('جمل مدرسة بحر حديقة') == 1", "assert starts_count('حديقة بيت مدرسة علم جبل') == 1", "assert starts_count('باب صديق بيت مدينة') == 2", "assert starts_count('ليل بحر بيت بيت') == 3", "assert starts_count('قمر سماء مدينة تفاحة شجرة مطر') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('باب علم نور باب قهوة') == 2\nassert starts_count('جمل مدرسة بحر حديقة') == 1\nassert starts_count('حديقة بيت مدرسة علم جبل') == 1\nassert starts_count('باب صديق بيت مدينة') == 2\nassert starts_count('ليل بحر بيت بيت') == 3\nassert starts_count('قمر سماء مدينة تفاحة شجرة مطر') == 0\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:\n if w.startswith('ب'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ب»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef starts_count(s):\n count = 0\n for w in s:\n if w.startswith('ب'):\n count += 1\n return count\n```\nمثال: `starts_count('باب علم نور باب قهوة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "5e12be888592ee70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [31, 27, -3, 9, 21, 29, 20]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(min(nums[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [31, 27, -3, 9, 21, 29, 20]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(min(nums[2:7]))\n```\nالجواب:", "qhash": "a5a07ebadf959f23", "answer": "[-3, 9, 21, 29, 20]\n[20, 21, -3, 31]\n-3", "completion": " الناتج:\n```text\n[-3, 9, 21, 29, 20]\n[20, 21, -3, 31]\n-3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'data'\nprint(word.upper())\nprint(word.count('d'))\nprint(word.replace('d', 'X'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'data'\nprint(word.upper())\nprint(word.count('d'))\nprint(word.replace('d', 'X'))\n```\nالجواب:", "qhash": "973b4b99cfe58059", "answer": "DATA\n1\nXata", "completion": " الناتج:\n```text\nDATA\n1\nXata\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_special([68, 34, 88, 85, 46, 46, 25, 16, 90, 66, 14, 59]) == 1", "assert count_special([37, -18, 14, 70, 41, 64, -21, 35, -32, 86, 73, 61]) == 1", "assert count_special([53, 23, -11, 90]) == 0", "assert count_special([14]) == 0", "assert count_special([34, 25, -13, 50, -34, 62, -14, 16, 1]) == 0", "assert count_special([-22, 46, -2, 23]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([68, 34, 88, 85, 46, 46, 25, 16, 90, 66, 14, 59]) == 1\nassert count_special([37, -18, 14, 70, 41, 64, -21, 35, -32, 86, 73, 61]) == 1\nassert count_special([53, 23, -11, 90]) == 0\nassert count_special([14]) == 0\nassert count_special([34, 25, -13, 50, -34, 62, -14, 16, 1]) == 0\nassert count_special([-22, 46, -2, 23]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([68, 34, 88, 85, 46, 46, 25, 16, 90, 66, 14, 59])` يُرجع `1`.\nالجواب:", "qhash": "93d0e884c190bf36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert reverse_words('stone to vector at planet') == 'planet_vector'", "assert reverse_words('vector') == 'vector'", "assert reverse_words('engine code falcon camel light in is') == 'falcon_engine'", "assert reverse_words('to to rocket data python data vector in') == 'vector_python_rocket'", "assert reverse_words('engine signal light camel we at') == 'signal_engine'", "assert reverse_words('apple pixel code light') == ''", "assert reverse_words('garden up') == 'garden'"], "test_code": "assert reverse_words('stone to vector at planet') == 'planet_vector'\nassert reverse_words('vector') == 'vector'\nassert reverse_words('engine code falcon camel light in is') == 'falcon_engine'\nassert reverse_words('to to rocket data python data vector in') == 'vector_python_rocket'\nassert reverse_words('engine signal light camel we at') == 'signal_engine'\nassert reverse_words('apple pixel code light') == ''\nassert reverse_words('garden up') == 'garden'", "answer": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `reverse_words('stone to vector at planet')` يُرجع `'planet_vector'`.\nالجواب:", "qhash": "eb1cb949192f5d50"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(277861142))\nprint(rec(rec(277861142)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(277861142))\nprint(rec(rec(277861142)))\n```\nالجواب:", "qhash": "cee07959622709d3", "answer": "38\n11", "completion": " الناتج:\n```text\n38\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -1 * x ** 2 + (-5) * x + (4)", "tests": ["assert eval_poly(6) == -62", "assert eval_poly(-2) == 10", "assert eval_poly(-8) == -20", "assert eval_poly(-6) == -2", "assert eval_poly(3) == -20", "assert eval_poly(-2) == 10", "assert eval_poly(-15) == -146", "assert eval_poly(0) == 4"], "test_code": "assert eval_poly(6) == -62\nassert eval_poly(-2) == 10\nassert eval_poly(-8) == -20\nassert eval_poly(-6) == -2\nassert eval_poly(3) == -20\nassert eval_poly(-2) == 10\nassert eval_poly(-15) == -146\nassert eval_poly(0) == 4", "answer": "def eval_poly(x):\n return -1 * x ** 2 + (-5) * x + (4)", "completion": " ```python\ndef eval_poly(x):\n return -1 * x ** 2 + (-5) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -1x² - 5x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(6)` يُرجع `-62`.\nالجواب:", "qhash": "4c6c059f4cabb8e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 86679\nc = 0\nwhile x > 20:\n x = x // 8\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 86679\nc = 0\nwhile x > 20:\n x = x // 8\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "98cc15836df101af", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert count_prefix('قمر امل ماء سلام وردة قمر') == 1", "assert count_prefix('ليل برمجة صديق سوق امل امل طائرة') == 2", "assert count_prefix('نور لغة بحر') == 0", "assert count_prefix('تفاحة سماء جبل امل امل') == 2", "assert count_prefix('مطر رمل') == 0", "assert count_prefix('برمجة سفينة') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('قمر امل ماء سلام وردة قمر') == 1\nassert count_prefix('ليل برمجة صديق سوق امل امل طائرة') == 2\nassert count_prefix('نور لغة بحر') == 0\nassert count_prefix('تفاحة سماء جبل امل امل') == 2\nassert count_prefix('مطر رمل') == 0\nassert count_prefix('برمجة سفينة') == 0\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s:\n if w.startswith('ا'):\n count += 1\n return count\n```\nمثال: `count_prefix('قمر امل ماء سلام وردة قمر')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "86ff592b5d3a7cf1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('matrix go falcon winter pixel Hello') == 'iwpnet ck bwhykj sejpan letah Hahhk'", "assert encode('cloud Hello') == 'yhkqz Hahhk'", "assert encode('in vector cloud desert') == 'ej raypkn yhkqz zaoanp'", "assert encode('it table falcon go up OK') == 'ep pwxha bwhykj ck ql OK'", "assert encode('window matrix rocket') == 'sejzks iwpnet nkygap'", "assert encode('engine to apple an Hello') == 'ajceja pk wllha wj Hahhk'", "assert encode('') == ''"], "test_code": "assert encode('matrix go falcon winter pixel Hello') == 'iwpnet ck bwhykj sejpan letah Hahhk'\nassert encode('cloud Hello') == 'yhkqz Hahhk'\nassert encode('in vector cloud desert') == 'ej raypkn yhkqz zaoanp'\nassert encode('it table falcon go up OK') == 'ep pwxha bwhykj ck ql OK'\nassert encode('window matrix rocket') == 'sejzks iwpnet nkygap'\nassert encode('engine to apple an Hello') == 'ajceja pk wllha wj Hahhk'\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 + (-4)) % 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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('matrix go falcon winter pixel Hello')` يُرجع `'iwpnet ck bwhykj sejpan letah Hahhk'`.\nالجواب:", "qhash": "123c27df29a8f9bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 89) == 1)", "tests": ["assert coprime_count(59) == 59", "assert coprime_count(170) == 169", "assert coprime_count(182) == 180", "assert coprime_count(162) == 161", "assert coprime_count(33) == 33", "assert coprime_count(44) == 44", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(59) == 59\nassert coprime_count(170) == 169\nassert coprime_count(182) == 180\nassert coprime_count(162) == 161\nassert coprime_count(33) == 33\nassert coprime_count(44) == 44\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, 89) == 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, 89) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 89، أي أن القاسم المشترك الأكبر لها مع 89 يساوي 1.\nمثال: `coprime_count(59)` يجب أن تُرجع `59`.\nالجواب:", "qhash": "4651edfcda25cab4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(2))\n```\nالجواب:", "qhash": "41810f0885e164ea", "answer": "3", "completion": " الناتج:\n```text\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('pixel winter falcon desert A1') == 'zshov gsxdob pkvmyx nocobd A1'", "assert rotate_letters('we') == 'go'", "assert rotate_letters('cloud cloud up data OK') == 'mvyen mvyen ez nkdk OK'", "assert rotate_letters('table matrix stone cloud stone') == 'dklvo wkdbsh cdyxo mvyen cdyxo'", "assert rotate_letters('planet of') == 'zvkxod yp'", "assert rotate_letters('music matrix an go go') == 'wecsm wkdbsh kx qy qy'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('pixel winter falcon desert A1') == 'zshov gsxdob pkvmyx nocobd A1'\nassert rotate_letters('we') == 'go'\nassert rotate_letters('cloud cloud up data OK') == 'mvyen mvyen ez nkdk OK'\nassert rotate_letters('table matrix stone cloud stone') == 'dklvo wkdbsh cdyxo mvyen cdyxo'\nassert rotate_letters('planet of') == 'zvkxod yp'\nassert rotate_letters('music matrix an go go') == 'wecsm wkdbsh kx qy qy'\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 + (10)) % 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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('pixel winter falcon desert A1')` يُرجع `'zshov gsxdob pkvmyx nocobd A1'`.\nالجواب:", "qhash": "bda3f93903cfc6df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 2\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(6))", "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(6))\n```\nالجواب:", "qhash": "a5defbe7fe639f08", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 5235\ncount = 0\nwhile x > 7:\n x = x // 4\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 5235\ncount = 0\nwhile x > 7:\n x = x // 4\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "644cfde1c3309ca9", "answer": "5 5", "completion": " الناتج:\n```text\n5 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'برمجة فجر'\nprint(kalima.count('م'))\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'برمجة فجر'\nprint(kalima.count('م'))\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "1ee9ccc3ae3857a9", "answer": "1\nر\nبرمجة-فجر", "completion": " الناتج:\n```text\n1\nر\nبرمجة-فجر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سيارة سفينة حديقة نهار مدينة حديقة مطر') == 2", "assert prefix_hits('ليل برتقال مدرسة معلم معلم طائرة') == 3", "assert prefix_hits('مطر علم حاسوب عربية مدينة خبز') == 2", "assert prefix_hits('سفينة سيارة صديق نهار ماء ليل قهوة مدرسة') == 2", "assert prefix_hits('برمجة شجرة شجرة') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('ميناء ميناء طالب وردة شجرة معلم') == 3\nassert prefix_hits('سيارة سفينة حديقة نهار مدينة حديقة مطر') == 2\nassert prefix_hits('ليل برتقال مدرسة معلم معلم طائرة') == 3\nassert prefix_hits('مطر علم حاسوب عربية مدينة خبز') == 2\nassert prefix_hits('سفينة سيارة صديق نهار ماء ليل قهوة مدرسة') == 2\nassert prefix_hits('برمجة شجرة شجرة') == 0\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 'م' in w:\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 'م' in w:\n count += 1\n return count\n```\nمثال: `prefix_hits('ميناء ميناء طالب وردة شجرة معلم')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "0232aaeb0ddee8d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [5, -9, 34, 9, 11, 37]\nprint(nums[2:4])\nprint(nums[::-2])\nprint(len(nums[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [5, -9, 34, 9, 11, 37]\nprint(nums[2:4])\nprint(nums[::-2])\nprint(len(nums[2:4]))\n```\nالجواب:", "qhash": "4afadb79e55a4af2", "answer": "[34, 9]\n[37, 9, -9]\n2", "completion": " الناتج:\n```text\n[34, 9]\n[37, 9, -9]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 12) == 1)", "tests": ["assert rel_prime_count(112) == 37", "assert rel_prime_count(157) == 53", "assert rel_prime_count(117) == 39", "assert rel_prime_count(177) == 59", "assert rel_prime_count(46) == 15", "assert rel_prime_count(19) == 7", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(112) == 37\nassert rel_prime_count(157) == 53\nassert rel_prime_count(117) == 39\nassert rel_prime_count(177) == 59\nassert rel_prime_count(46) == 15\nassert rel_prime_count(19) == 7\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, 12) == 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, 12) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 12) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(112)` يُرجع `37`.\nالجواب:", "qhash": "bea1e89f28f00fda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'شمس رمل'\nprint(w.find('ت'))\nprint(len(w))\nprint(len(w.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'شمس رمل'\nprint(w.find('ت'))\nprint(len(w))\nprint(len(w.replace(' ', '')))\n```\nالجواب:", "qhash": "76f929fa949eca0f", "answer": "-1\n7\n6", "completion": " الناتج:\n```text\n-1\n7\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'حسن': 39, 'علي': 34, 'أحمد': 39}\nscores['أحمد'] += 12\nscores['سلمى'] = 32\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 = {'حسن': 39, 'علي': 34, 'أحمد': 39}\nscores['أحمد'] += 12\nscores['سلمى'] = 32\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": "0e4edd9a0765183b", "answer": "4\nأحمد\n156\n['حسن', 'علي', 'أحمد', 'سلمى']", "completion": " الناتج:\n```text\n4\nأحمد\n156\n['حسن', 'علي', 'أحمد', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'شمس'\nprint(w[::-1])\nprint('س' in w)\nprint(len(w.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'شمس'\nprint(w[::-1])\nprint('س' in w)\nprint(len(w.replace(' ', '')))\n```\nالجواب:", "qhash": "28ba6c8bfab5fb4b", "answer": "سمش\nTrue\n3", "completion": " الناتج:\n```text\nسمش\nTrue\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -2 * x ** 2 + (4) * x + (0)", "tests": ["assert poly(7) == -70", "assert poly(-2) == -16", "assert poly(20) == -720", "assert poly(13) == -286", "assert poly(7) == -70", "assert poly(18) == -576", "assert poly(16) == -448", "assert poly(0) == 0"], "test_code": "assert poly(7) == -70\nassert poly(-2) == -16\nassert poly(20) == -720\nassert poly(13) == -286\nassert poly(7) == -70\nassert poly(18) == -576\nassert poly(16) == -448\nassert poly(0) == 0", "answer": "def poly(x):\n return -2 * x ** 2 + (4) * x + (0)", "completion": " ```python\ndef poly(x):\n return -2 * x ** 2 + (4) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -2x² + 4x + 0 عند العدد الصحيح x.\nمثال: `poly(7)` يجب أن تُرجع `-70`.\nالجواب:", "qhash": "2d29ee29acedbe6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ك')", "tests": ["assert letter_hits('ميناء برتقال خبز عمل نهر سفينة طائرة') == 0", "assert letter_hits('خبز دفتر عربية مطر سفينة مدرسة حاسوب خبز') == 0", "assert letter_hits('صديق سوق نهار شمس بيت كتاب وردة رمل') == 1", "assert letter_hits('') == 0", "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('') == 0\nassert letter_hits('خبز سماء صحراء سيارة ميناء صحراء سوق حاسوب') == 0\nassert letter_hits('طائرة جمل قهوة') == 0\nassert letter_hits('خبز عمل نهر نهار مدرسة مطر') == 0\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)` بحيث تُعيد عدد مرات ظهور الحرف «ك» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('ميناء برتقال خبز عمل نهر سفينة طائرة')` يُرجع `0`.\nالجواب:", "qhash": "cf73eeb2004565df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=7):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(g(0))\nprint(g(0, -1))\nprint(g(g(-1), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=7):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(g(0))\nprint(g(0, -1))\nprint(g(g(-1), 0))\n```\nالجواب:", "qhash": "f647212994d5c6f5", "answer": "0\n1\n-1", "completion": " الناتج:\n```text\n0\n1\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 4\nfor j in range(0, 15, 3):\n s += j * 2\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 4\nfor j in range(0, 15, 3):\n s += j * 2\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "2429cfa9f152ca00", "answer": "64\n12", "completion": " الناتج:\n```text\n64\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قلم شمس دفتر تفاحة تفاحة') == 2", "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('قلم شمس دفتر تفاحة تفاحة') == 2\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 'ت' in w:\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 'ت' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('حديقة برمجة بيت عربية')` يُرجع `0`.\nالجواب:", "qhash": "bb9b0924a830cf84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حاسوب حديقة سيارة رمل دفتر طالب') == 2", "assert count_prefix('باب دفتر حاسوب') == 1", "assert count_prefix('برمجة نهر سماء فجر بحر') == 0", "assert count_prefix('سلام سماء رمل') == 0", "assert count_prefix('كتاب ماء وردة نهر حصان سوق') == 1", "assert count_prefix('مكتبة سوق') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('حاسوب حديقة سيارة رمل دفتر طالب') == 2\nassert count_prefix('باب دفتر حاسوب') == 1\nassert count_prefix('برمجة نهر سماء فجر بحر') == 0\nassert count_prefix('سلام سماء رمل') == 0\nassert count_prefix('كتاب ماء وردة نهر حصان سوق') == 1\nassert count_prefix('مكتبة سوق') == 0\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 'ح' in w:\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 'ح' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('حاسوب حديقة سيارة رمل دفتر طالب')` يُرجع `2`.\nالجواب:", "qhash": "c07fba584ea2f7d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(687840976))\nprint(rec(rec(687840976)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(687840976))\nprint(rec(rec(687840976)))\n```\nالجواب:", "qhash": "d452a0d768b976a4", "answer": "55\n10", "completion": " الناتج:\n```text\n55\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('summer to a') == 'summer'", "assert rev_long_words('banana is light by vector') == 'vector/banana'", "assert rev_long_words('pixel garden a') == 'garden'", "assert rev_long_words('matrix on on go code to') == 'matrix'", "assert rev_long_words('an') == ''", "assert rev_long_words('a') == ''", "assert rev_long_words('summer rocket river desert python matrix winter cloud') == 'winter/matrix/python/desert/rocket/summer'"], "test_code": "assert rev_long_words('summer to a') == 'summer'\nassert rev_long_words('banana is light by vector') == 'vector/banana'\nassert rev_long_words('pixel garden a') == 'garden'\nassert rev_long_words('matrix on on go code to') == 'matrix'\nassert rev_long_words('an') == ''\nassert rev_long_words('a') == ''\nassert rev_long_words('summer rocket river desert python matrix winter cloud') == 'winter/matrix/python/desert/rocket/summer'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `rev_long_words('summer to a')` يُرجع `'summer'`.\nالجواب:", "qhash": "5cec8103f47a069c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 41)", "tests": ["assert select_range([45, 43, 11, 25, 42, 21, 6, 34]) == [42, 50, 68]", "assert select_range([-8]) == []", "assert select_range([-13]) == []", "assert select_range([0, 15, 0, 13, 50, -21, -24, 21]) == [26, 30, 42]", "assert select_range([-19, -13, 35, -9]) == [70]", "assert select_range([35, -19, 56]) == [70]", "assert select_range([-6, 41, 5, -14]) == [82]", "assert select_range([]) == []"], "test_code": "assert select_range([45, 43, 11, 25, 42, 21, 6, 34]) == [42, 50, 68]\nassert select_range([-8]) == []\nassert select_range([-13]) == []\nassert select_range([0, 15, 0, 13, 50, -21, -24, 21]) == [26, 30, 42]\nassert select_range([-19, -13, 35, -9]) == [70]\nassert select_range([35, -19, 56]) == [70]\nassert select_range([-6, 41, 5, -14]) == [82]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 41)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 2 for x in xs if 13 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 13 ≤ x ≤ 41، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([45, 43, 11, 25, 42, 21, 6, 34])` يُرجع `[42, 50, 68]`.\nالجواب:", "qhash": "d9ec138e8129446a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(7))\nprint(f(7, 18))\nprint(f(f(18), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=8):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(f(7))\nprint(f(7, 18))\nprint(f(f(18), 7))\n```\nالجواب:", "qhash": "eb5f9db2a464f6e3", "answer": "55\n115\n593", "completion": " الناتج:\n```text\n55\n115\n593\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 2 * x ** 2 + (2) * x + (1)", "tests": ["assert value_at(1) == 5", "assert value_at(-17) == 545", "assert value_at(-9) == 145", "assert value_at(-20) == 761", "assert value_at(-12) == 265", "assert value_at(7) == 113", "assert value_at(1) == 5", "assert value_at(0) == 1"], "test_code": "assert value_at(1) == 5\nassert value_at(-17) == 545\nassert value_at(-9) == 145\nassert value_at(-20) == 761\nassert value_at(-12) == 265\nassert value_at(7) == 113\nassert value_at(1) == 5\nassert value_at(0) == 1", "answer": "def value_at(x):\n return 2 * x ** 2 + (2) * x + (1)", "completion": " ```python\ndef value_at(x):\n return 2 * x ** 2 + (2) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 2x² + 2x + 1 عند العدد الصحيح x.\nمثال: `value_at(1)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "004a14db187847ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=0):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(8))\nprint(g(8, 1))\nprint(g(g(1), 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=0):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(8))\nprint(g(8, 1))\nprint(g(g(1), 8))\n```\nالجواب:", "qhash": "eb72cfb3dda560c5", "answer": "8\n7\n9", "completion": " الناتج:\n```text\n8\n7\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(278) == 7700", "assert add_multiples(217) == 4730", "assert add_multiples(12) == 15", "assert add_multiples(46) == 225", "assert add_multiples(292) == 8555", "assert add_multiples(284) == 7980", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(278) == 7700\nassert add_multiples(217) == 4730\nassert add_multiples(12) == 15\nassert add_multiples(46) == 225\nassert add_multiples(292) == 8555\nassert add_multiples(284) == 7980\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 10.\nمثال: `add_multiples(278)` يجب أن تُرجع `7700`.\nالجواب:", "qhash": "f7ea8a43bcba6fbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_sel([65, 41, 88, 16, 13, 55, 78]) == 0", "assert count_sel([-16, -28, 33, -18]) == 0", "assert count_sel([13, -5, 79, -36, 77, 36]) == 0", "assert count_sel([33]) == 0", "assert count_sel([-40, -31, 56, 36, -8, 88, 74, 21]) == 0", "assert count_sel([-31]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([65, 41, 88, 16, 13, 55, 78]) == 0\nassert count_sel([-16, -28, 33, -18]) == 0\nassert count_sel([13, -5, 79, -36, 77, 36]) == 0\nassert count_sel([33]) == 0\nassert count_sel([-40, -31, 56, 36, -8, 88, 74, 21]) == 0\nassert count_sel([-31]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([65, 41, 88, 16, 13, 55, 78])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e461492085e4c7a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 10 for x in range(-4, 11) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 10 for x in range(-4, 11) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f63a065fdae446d7", "answer": "[-6, -6, 26, 90]\n4 104", "completion": " الناتج:\n```text\n[-6, -6, 26, 90]\n4 104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)", "tests": ["assert sum_multiples(197) == 5900", "assert sum_multiples(17) == 50", "assert sum_multiples(23) == 70", "assert sum_multiples(233) == 8284", "assert sum_multiples(23) == 70", "assert sum_multiples(188) == 5134", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(197) == 5900\nassert sum_multiples(17) == 50\nassert sum_multiples(23) == 70\nassert sum_multiples(233) == 8284\nassert sum_multiples(23) == 70\nassert sum_multiples(188) == 5134\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 % 10 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(197)` يُرجع `5900`.\nالجواب:", "qhash": "95eb6adbae2a84ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'عربية جبل'\nprint('ب' in kalima)\nprint(kalima[0])\nprint(kalima.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'عربية جبل'\nprint('ب' in kalima)\nprint(kalima[0])\nprint(kalima.count('ب'))\n```\nالجواب:", "qhash": "cf7d24bca3cf5622", "answer": "True\nع\n2", "completion": " الناتج:\n```text\nTrue\nع\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=8):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(0))\nprint(h(0, -2))\nprint(h(h(-2), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=8):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(0))\nprint(h(0, -2))\nprint(h(h(-2), 0))\n```\nالجواب:", "qhash": "46b1e708fdaf69f3", "answer": "32\n2\n120", "completion": " الناتج:\n```text\n32\n2\n120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=9):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-5))\nprint(calc(-5, 0))\nprint(calc(calc(0), -5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=9):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(-5))\nprint(calc(-5, 0))\nprint(calc(calc(0), -5))\n```\nالجواب:", "qhash": "085e135c9d57e88d", "answer": "4\n-5\n14", "completion": " الناتج:\n```text\n4\n-5\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(-1))\nprint(compute(-1, 19))\nprint(compute(compute(19), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(-1))\nprint(compute(-1, 19))\nprint(compute(compute(19), -1))\n```\nالجواب:", "qhash": "e03caff4ec2cab6e", "answer": "-10\n-58\n-57", "completion": " الناتج:\n```text\n-10\n-58\n-57\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=7):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(calc(6))\nprint(calc(6, 5))\nprint(calc(calc(5), 6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=7):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(calc(6))\nprint(calc(6, 5))\nprint(calc(calc(5), 6))\n```\nالجواب:", "qhash": "2430101e7fb8b7dc", "answer": "55\n37\n372", "completion": " الناتج:\n```text\n55\n37\n372\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('matrix coffee by of') == 'pdwula friihh eb ri'", "assert shift_letters('at camel apple in') == 'dw fdpho dssoh lq'", "assert shift_letters('data brain summer') == 'gdwd eudlq vxpphu'", "assert shift_letters('coffee music python on rocket') == 'friihh pxvlf sbwkrq rq urfnhw'", "assert shift_letters('coffee data brain') == 'friihh gdwd eudlq'", "assert shift_letters('planet window planet falcon') == 'sodqhw zlqgrz sodqhw idofrq'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('matrix coffee by of') == 'pdwula friihh eb ri'\nassert shift_letters('at camel apple in') == 'dw fdpho dssoh lq'\nassert shift_letters('data brain summer') == 'gdwd eudlq vxpphu'\nassert shift_letters('coffee music python on rocket') == 'friihh pxvlf sbwkrq rq urfnhw'\nassert shift_letters('coffee data brain') == 'friihh gdwd eudlq'\nassert shift_letters('planet window planet falcon') == 'sodqhw zlqgrz sodqhw idofrq'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('matrix coffee by of')` يجب أن تُرجع `'pdwula friihh eb ri'`.\nالجواب:", "qhash": "7889fb437d75820e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('نهار خبز صديق باب مطر سوق ليل خبز') == 2", "assert count_in_text('باب علم صحراء صديق جبل حاسوب قمر') == 2", "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('نهار خبز صديق باب مطر سوق ليل خبز') == 2\nassert count_in_text('باب علم صحراء صديق جبل حاسوب قمر') == 2\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 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": "f432b43aa9f380d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 4) // 5 for x in range(-6, 1) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 4) // 5 for x in range(-6, 1) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "21b7fbf0e6748446", "answer": "[0]\n1 0", "completion": " الناتج:\n```text\n[0]\n1 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 26610\ncount = 0\nwhile m > 0:\n m = m // 6\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 26610\ncount = 0\nwhile m > 0:\n m = m // 6\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "1fbc788a3722eb6c", "answer": "0 6", "completion": " الناتج:\n```text\n0 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(16) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', '15', 'Sun']", "assert fizz(17) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', '15', 'Sun', '17']", "assert fizz(4) == ['1', '2', '3', 'Sun']", "assert fizz(10) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon']", "assert fizz(4) == ['1', '2', '3', 'Sun']"], "test_code": "assert fizz(16) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', '15', 'Sun']\nassert fizz(17) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', '15', 'Sun', '17']\nassert fizz(4) == ['1', '2', '3', 'Sun']\nassert fizz(10) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon']\nassert fizz(4) == ['1', '2', '3', 'Sun']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\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 % 4 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Sun'، وإن قَبِلها على 10 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(16)` يُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', '15', 'Sun']`.\nالجواب:", "qhash": "b7fe397486c7dc08"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(4, 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(4, 0))\n```\nالجواب:", "qhash": "8c5f76567a9fbb97", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 12\nfor n in range(3, 18, 2):\n total -= n * 7\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 12\nfor n in range(3, 18, 2):\n total -= n * 7\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "7608d53772877df3", "answer": "-548\n17", "completion": " الناتج:\n```text\n-548\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "tests": ["assert sum_div(63) == 495", "assert sum_div(183) == 4088", "assert sum_div(11) == 6", "assert sum_div(16) == 29", "assert sum_div(185) == 4088", "assert sum_div(138) == 2178", "assert sum_div(1) == 0"], "test_code": "assert sum_div(63) == 495\nassert sum_div(183) == 4088\nassert sum_div(11) == 6\nassert sum_div(16) == 29\nassert sum_div(185) == 4088\nassert sum_div(138) == 2178\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 11.\nمثال: `sum_div(63)` يجب أن تُرجع `495`.\nالجواب:", "qhash": "55c29d8fcff12fc4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 33) == 1)", "tests": ["assert count_coprime(53) == 33", "assert count_coprime(16) == 10", "assert count_coprime(170) == 104", "assert count_coprime(135) == 82", "assert count_coprime(10) == 7", "assert count_coprime(192) == 116", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(53) == 33\nassert count_coprime(16) == 10\nassert count_coprime(170) == 104\nassert count_coprime(135) == 82\nassert count_coprime(10) == 7\nassert count_coprime(192) == 116\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 33) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(53)` يُرجع `33`.\nالجواب:", "qhash": "0e51e09911c5569d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_sel([75, 68, 45, 46, 26, 62, 18, 0, 54, 83, 26, 56]) == 2", "assert count_sel([]) == 0", "assert count_sel([-11, 51, 25, 2, -23, -23, 6, -8]) == 1", "assert count_sel([43, -36, 52, 19, 39, 69]) == 2", "assert count_sel([10, 52, 33, -3, 24]) == 2", "assert count_sel([78, -38, 2, 35, 77]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([75, 68, 45, 46, 26, 62, 18, 0, 54, 83, 26, 56]) == 2\nassert count_sel([]) == 0\nassert count_sel([-11, 51, 25, 2, -23, -23, 6, -8]) == 1\nassert count_sel([43, -36, 52, 19, 39, 69]) == 2\nassert count_sel([10, 52, 33, -3, 24]) == 2\nassert count_sel([78, -38, 2, 35, 77]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([75, 68, 45, 46, 26, 62, 18, 0, 54, 83, 26, 56])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "49c698637f37d8b0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'صديق باب'\nprint(s[-1])\nprint(s.count('ص'))\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'صديق باب'\nprint(s[-1])\nprint(s.count('ص'))\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "47660e0f8bf4d05b", "answer": "ب\n1\n7", "completion": " الناتج:\n```text\nب\n1\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= -8)", "tests": ["assert pick_between([-11, 0, -29, -20]) == [-22]", "assert pick_between([-5, 9, 23, 39, 7, -13, 34]) == [-26]", "assert pick_between([35, 60, 15, 54, -15, -26, 44, 59]) == [-30]", "assert pick_between([28, 31]) == []", "assert pick_between([15, 24]) == []", "assert pick_between([-3, -21]) == []", "assert pick_between([39, 57, 41, 58, 46, 15, -17]) == [-34]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-11, 0, -29, -20]) == [-22]\nassert pick_between([-5, 9, 23, 39, 7, -13, 34]) == [-26]\nassert pick_between([35, 60, 15, 54, -15, -26, 44, 59]) == [-30]\nassert pick_between([28, 31]) == []\nassert pick_between([15, 24]) == []\nassert pick_between([-3, -21]) == []\nassert pick_between([39, 57, 41, 58, 46, 15, -17]) == [-34]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= -8)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if -19 <= x <= -8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -19 ≤ x ≤ -8، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-11, 0, -29, -20])` يُرجع `[-22]`.\nالجواب:", "qhash": "26be2bb0735c07e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 17\nfor j in range(3, 28, 2):\n total -= j * 5\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 17\nfor j in range(3, 28, 2):\n total -= j * 5\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "672d7c642534d4f1", "answer": "-958\n27", "completion": " الناتج:\n```text\n-958\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['python', 'summer', 'pixel', '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', 'summer', 'pixel', 'desert', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "7e96dd8e07146903", "answer": "['pixel', 'python', 'summer', 'desert', 'rocket']\n['summer', 'rocket', 'python']", "completion": " الناتج:\n```text\n['pixel', 'python', 'summer', 'desert', 'rocket']\n['summer', 'rocket', 'python']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سوق سماء حديقة برمجة عربية') == 0", "assert count_start('بيت ميناء مدرسة ليل') == 1", "assert count_start('بيت لغة ليل طائرة فجر لغة ماء') == 3", "assert count_start('رمل خبز لغة طالب لغة باب') == 2", "assert count_start('ليل شمس رمل جمل ليل') == 2", "assert count_start('لغة كتاب لغة لغة') == 3", "assert count_start('') == 0"], "test_code": "assert count_start('سوق سماء حديقة برمجة عربية') == 0\nassert count_start('بيت ميناء مدرسة ليل') == 1\nassert count_start('بيت لغة ليل طائرة فجر لغة ماء') == 3\nassert count_start('رمل خبز لغة طالب لغة باب') == 2\nassert count_start('ليل شمس رمل جمل ليل') == 2\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.split():\n if w.endswith('ل'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ل»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(text):\n count = 0\n for w in text.split():\n if w.endswith('ل'):\n count += 1\n return count\n```\nمثال: `count_start('سوق سماء حديقة برمجة عربية')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "b6a41391ac313af3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [27, 2, 25, -5, 15, 23, 22, 32]\nprint(nums[1:7])\nprint(nums[::-1])\nprint(min(nums[1:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [27, 2, 25, -5, 15, 23, 22, 32]\nprint(nums[1:7])\nprint(nums[::-1])\nprint(min(nums[1:7]))\n```\nالجواب:", "qhash": "ec4c46fb584396f5", "answer": "[2, 25, -5, 15, 23, 22]\n[32, 22, 23, 15, -5, 25, 2, 27]\n-5", "completion": " الناتج:\n```text\n[2, 25, -5, 15, 23, 22]\n[32, 22, 23, 15, -5, 25, 2, 27]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 93", "tests": ["assert digit_power(7412) == 8", "assert digit_power(882488) == 68", "assert digit_power(19471) == 64", "assert digit_power(898953) == 72", "assert digit_power(368395) == 67", "assert digit_power(443671) == 91", "assert digit_power(115753) == 52", "assert digit_power(0) == 0"], "test_code": "assert digit_power(7412) == 8\nassert digit_power(882488) == 68\nassert digit_power(19471) == 64\nassert digit_power(898953) == 72\nassert digit_power(368395) == 67\nassert digit_power(443671) == 91\nassert digit_power(115753) == 52\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 93", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 93\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 93.\nمثال: `digit_power(7412)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "f5b664f58152902e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert tally_div([16, 21, 26, 61, 84, 6, 23, 45, 74]) == 1", "assert tally_div([3, -37, 84, -7, 23, 25, -38]) == 1", "assert tally_div([-33, 35, -31, 70, 36, 68, 86, 19, -1]) == 1", "assert tally_div([23]) == 0", "assert tally_div([55]) == 1", "assert tally_div([13, -1, 26, -35, -21, -40, 18, 44, -15, 13, 5]) == 3", "assert tally_div([]) == 0"], "test_code": "assert tally_div([16, 21, 26, 61, 84, 6, 23, 45, 74]) == 1\nassert tally_div([3, -37, 84, -7, 23, 25, -38]) == 1\nassert tally_div([-33, 35, -31, 70, 36, 68, 86, 19, -1]) == 1\nassert tally_div([23]) == 0\nassert tally_div([55]) == 1\nassert tally_div([13, -1, 26, -35, -21, -40, 18, 44, -15, 13, 5]) == 3\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([16, 21, 26, 61, 84, 6, 23, 45, 74])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "c5648733edf67329"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if w.startswith('ج'))", "tests": ["assert tally_letter('جبل ليل مكتبة عمل مدرسة') == 1", "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('') == 0"], "test_code": "assert tally_letter('جبل ليل مكتبة عمل مدرسة') == 1\nassert 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('') == 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('جبل ليل مكتبة عمل مدرسة')` يُرجع `1`.\nالجواب:", "qhash": "e5498d8b4c8d695e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 7) == 1)", "tests": ["assert coprime_count(30) == 26", "assert coprime_count(125) == 108", "assert coprime_count(136) == 117", "assert coprime_count(196) == 168", "assert coprime_count(74) == 64", "assert coprime_count(6) == 6", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(30) == 26\nassert coprime_count(125) == 108\nassert coprime_count(136) == 117\nassert coprime_count(196) == 168\nassert coprime_count(74) == 64\nassert coprime_count(6) == 6\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, 7) == 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, 7) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 7، أي أن القاسم المشترك الأكبر لها مع 7 يساوي 1.\nمثال: `coprime_count(30)` يجب أن تُرجع `26`.\nالجواب:", "qhash": "6201499e2d6cd978"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([49, 8, 27, 56]) == None", "assert top_divisible([-33, -33, -22]) == -22", "assert top_divisible([1, 12]) == None", "assert top_divisible([]) == None", "assert top_divisible([-28, -31, -26, 42, 21, 34]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([49, 8, 27, 56]) == None\nassert top_divisible([-33, -33, -22]) == -22\nassert top_divisible([1, 12]) == None\nassert top_divisible([]) == None\nassert top_divisible([-28, -31, -26, 42, 21, 34]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef top_divisible(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(values):\n best = None\n for x in values:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(values):\n best = None\n for x in values:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([49, 8, 27, 56])` يُرجع `None`.\nالجواب:", "qhash": "bb508d529097211b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('هشام', 64), ('أحمد', 42), ('هدى', 0), ('عمر', 26)]\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 = [('هشام', 64), ('أحمد', 42), ('هدى', 0), ('عمر', 26)]\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": "f1951b5085e9afea", "answer": "[('هدى', 0), ('عمر', 26), ('أحمد', 42), ('هشام', 64)]\n['هشام', 'أحمد']", "completion": " الناتج:\n```text\n[('هدى', 0), ('عمر', 26), ('أحمد', 42), ('هشام', 64)]\n['هشام', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('garden falcon up a rocket garden apple a') == 'garden,rocket,falcon,garden'", "assert flip_words('garden matrix') == 'matrix,garden'", "assert flip_words('') == ''", "assert flip_words('window') == 'window'", "assert flip_words('winter window in of garden python stone of') == 'python,garden,window,winter'", "assert flip_words('banana code') == 'banana'", "assert flip_words('') == ''"], "test_code": "assert flip_words('garden falcon up a rocket garden apple a') == 'garden,rocket,falcon,garden'\nassert flip_words('garden matrix') == 'matrix,garden'\nassert flip_words('') == ''\nassert flip_words('window') == 'window'\nassert flip_words('winter window in of garden python stone of') == 'python,garden,window,winter'\nassert flip_words('banana code') == 'banana'\nassert flip_words('') == ''", "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('garden falcon up a rocket garden apple a')` يجب أن تُرجع `'garden,rocket,falcon,garden'`.\nالجواب:", "qhash": "a4e9d78824251e7b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'vector'\nprint(text[::-1])\nprint(text.find('o'))\nprint(text.index('o') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'vector'\nprint(text[::-1])\nprint(text.find('o'))\nprint(text.index('o') + len(text))\n```\nالجواب:", "qhash": "cac6ecd7f1ea0821", "answer": "rotcev\n4\n10", "completion": " الناتج:\n```text\nrotcev\n4\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ehs'}", "tests": ["assert char_freq('a of to at go') == {'e': 0, 'h': 0, 's': 0}", "assert char_freq('cloud signal summer') == {'e': 1, 'h': 0, 's': 2}", "assert char_freq('rocket window') == {'e': 1, 'h': 0, 's': 0}", "assert char_freq('on cloud python') == {'e': 0, 'h': 1, 's': 0}", "assert char_freq('it pixel in python to') == {'e': 1, 'h': 1, 's': 0}", "assert char_freq('winter to window go go to') == {'e': 1, 'h': 0, 's': 0}", "assert char_freq('') == {'e': 0, 'h': 0, 's': 0}"], "test_code": "assert char_freq('a of to at go') == {'e': 0, 'h': 0, 's': 0}\nassert char_freq('cloud signal summer') == {'e': 1, 'h': 0, 's': 2}\nassert char_freq('rocket window') == {'e': 1, 'h': 0, 's': 0}\nassert char_freq('on cloud python') == {'e': 0, 'h': 1, 's': 0}\nassert char_freq('it pixel in python to') == {'e': 1, 'h': 1, 's': 0}\nassert char_freq('winter to window go go to') == {'e': 1, 'h': 0, 's': 0}\nassert char_freq('') == {'e': 0, 'h': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ehs'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ehs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'h'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('a of to at go')` يجب أن تُرجع `{'e': 0, 'h': 0, 's': 0}`.\nالجواب:", "qhash": "0bd4796d3dac0523"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('stone rocket music') == 'xytsj wthpjy rzxnh'", "assert shift_letters('code go desert banana Hello') == 'htij lt ijxjwy gfsfsf Hjqqt'", "assert shift_letters('summer brain camel at 2024') == 'xzrrjw gwfns hfrjq fy 2024'", "assert shift_letters('coffee stone a camel it') == 'htkkjj xytsj f hfrjq ny'", "assert shift_letters('rocket planet summer up A1') == 'wthpjy uqfsjy xzrrjw zu A1'", "assert shift_letters('on') == 'ts'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('stone rocket music') == 'xytsj wthpjy rzxnh'\nassert shift_letters('code go desert banana Hello') == 'htij lt ijxjwy gfsfsf Hjqqt'\nassert shift_letters('summer brain camel at 2024') == 'xzrrjw gwfns hfrjq fy 2024'\nassert shift_letters('coffee stone a camel it') == 'htkkjj xytsj f hfrjq ny'\nassert shift_letters('rocket planet summer up A1') == 'wthpjy uqfsjy xzrrjw zu A1'\nassert shift_letters('on') == 'ts'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('stone rocket music')` يجب أن تُرجع `'xytsj wthpjy rzxnh'`.\nالجواب:", "qhash": "d4c040bf8cf5f515"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ghs'}", "tests": ["assert char_freq('coffee') == {'g': 0, 'h': 0, 's': 0}", "assert char_freq('by it planet') == {'g': 0, 'h': 0, 's': 0}", "assert char_freq('planet up') == {'g': 0, 'h': 0, 's': 0}", "assert char_freq('garden apple in in river') == {'g': 1, 'h': 0, 's': 0}", "assert char_freq('to garden garden is brain') == {'g': 2, 'h': 0, 's': 1}", "assert char_freq('up winter') == {'g': 0, 'h': 0, 's': 0}", "assert char_freq('') == {'g': 0, 'h': 0, 's': 0}"], "test_code": "assert char_freq('coffee') == {'g': 0, 'h': 0, 's': 0}\nassert char_freq('by it planet') == {'g': 0, 'h': 0, 's': 0}\nassert char_freq('planet up') == {'g': 0, 'h': 0, 's': 0}\nassert char_freq('garden apple in in river') == {'g': 1, 'h': 0, 's': 0}\nassert char_freq('to garden garden is brain') == {'g': 2, 'h': 0, 's': 1}\nassert char_freq('up winter') == {'g': 0, 'h': 0, 's': 0}\nassert char_freq('') == {'g': 0, 'h': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ghs'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ghs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'h'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('coffee')` يُرجع `{'g': 0, 'h': 0, 's': 0}`.\nالجواب:", "qhash": "7f845a154de96ecb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bcgt'}", "tests": ["assert letter_stats('river camel planet') == {'b': 0, 'c': 1, 'g': 0, 't': 1}", "assert letter_stats('data to matrix a it apple') == {'b': 0, 'c': 0, 'g': 0, 't': 4}", "assert letter_stats('signal is go a') == {'b': 0, 'c': 0, 'g': 2, 't': 0}", "assert letter_stats('winter') == {'b': 0, 'c': 0, 'g': 0, 't': 1}", "assert letter_stats('table in on of an of') == {'b': 1, 'c': 0, 'g': 0, 't': 1}", "assert letter_stats('stone music data stone music') == {'b': 0, 'c': 2, 'g': 0, 't': 3}", "assert letter_stats('') == {'b': 0, 'c': 0, 'g': 0, 't': 0}"], "test_code": "assert letter_stats('river camel planet') == {'b': 0, 'c': 1, 'g': 0, 't': 1}\nassert letter_stats('data to matrix a it apple') == {'b': 0, 'c': 0, 'g': 0, 't': 4}\nassert letter_stats('signal is go a') == {'b': 0, 'c': 0, 'g': 2, 't': 0}\nassert letter_stats('winter') == {'b': 0, 'c': 0, 'g': 0, 't': 1}\nassert letter_stats('table in on of an of') == {'b': 1, 'c': 0, 'g': 0, 't': 1}\nassert letter_stats('stone music data stone music') == {'b': 0, 'c': 2, 'g': 0, 't': 3}\nassert letter_stats('') == {'b': 0, 'c': 0, 'g': 0, 't': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bcgt'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bcgt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'g'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('river camel planet')` يُرجع `{'b': 0, 'c': 1, 'g': 0, 't': 1}`.\nالجواب:", "qhash": "80162eafc9f579f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('طائرة طالب عمل تفاحة شمس') == 1", "assert prefix_hits('مطر مدرسة') == 0", "assert prefix_hits('نهر طائرة طائرة حاسوب سماء فجر') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('رمل تفاحة مدينة بحر ليل خبز قلم') == 1\nassert prefix_hits('سلام كتاب نهار') == 0\nassert prefix_hits('برتقال خبز نور طالب معلم وردة') == 0\nassert prefix_hits('طائرة طالب عمل تفاحة شمس') == 1\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": "5753bf8e71f8d2dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'cloud'\nprint(s.index('d') + len(s))\nprint(s[::-1])\nprint(s.replace('d', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'cloud'\nprint(s.index('d') + len(s))\nprint(s[::-1])\nprint(s.replace('d', '#'))\n```\nالجواب:", "qhash": "413e9213624ff3da", "answer": "9\nduolc\nclou#", "completion": " الناتج:\n```text\n9\nduolc\nclou#\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ك'))", "tests": ["assert letter_hits('مطر قهوة نهار كتاب عربية') == 1", "assert letter_hits('رمل طائرة سماء') == 0", "assert letter_hits('برتقال طائرة صديق صحراء سوق سيارة') == 0", "assert letter_hits('') == 0", "assert letter_hits('ليل حديقة سفينة') == 0", "assert letter_hits('طائرة خبز شجرة مكتبة حاسوب بحر') == 0", "assert letter_hits('رمل سيارة سيارة حصان صحراء صحراء') == 0", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('مطر قهوة نهار كتاب عربية') == 1\nassert letter_hits('رمل طائرة سماء') == 0\nassert letter_hits('برتقال طائرة صديق صحراء سوق سيارة') == 0\nassert letter_hits('') == 0\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 w.startswith('ك'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ك'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_hits(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ك»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('مطر قهوة نهار كتاب عربية')` يُرجع `1`.\nالجواب:", "qhash": "1e0c62c4e64a19c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'music'\nprint(s[2:5])\nprint(s.replace('u', '*'))\nprint(s[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'music'\nprint(s[2:5])\nprint(s.replace('u', '*'))\nprint(s[-4:])\n```\nالجواب:", "qhash": "abd01e98f71b3867", "answer": "sic\nm*sic\nusic", "completion": " الناتج:\n```text\nsic\nm*sic\nusic\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(218081538))\nprint(rec(rec(218081538)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(218081538))\nprint(rec(rec(218081538)))\n```\nالجواب:", "qhash": "43afe798692ab102", "answer": "36\n9", "completion": " الناتج:\n```text\n36\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 19\nfor x in range(3, 23, 2):\n s -= x * 5\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 19\nfor x in range(3, 23, 2):\n s -= x * 5\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "d86b9aa5123b1bcb", "answer": "-581\n21", "completion": " الناتج:\n```text\n-581\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [17, 40, -5, 12, 18, 23, -1, 32]\nprint(a[1:8])\nprint(a[::2])\nprint(min(a[1:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [17, 40, -5, 12, 18, 23, -1, 32]\nprint(a[1:8])\nprint(a[::2])\nprint(min(a[1:8]))\n```\nالجواب:", "qhash": "cc98b831fb2e8eec", "answer": "[40, -5, 12, 18, 23, -1, 32]\n[17, -5, 18, -1]\n-5", "completion": " الناتج:\n```text\n[40, -5, 12, 18, 23, -1, 32]\n[17, -5, 18, -1]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'نهر رمل'\nprint(text.replace(' ', '-'))\nprint('ر' in text)\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'نهر رمل'\nprint(text.replace(' ', '-'))\nprint('ر' in text)\nprint(text[::-1])\n```\nالجواب:", "qhash": "67512dd9b1a0060d", "answer": "نهر-رمل\nTrue\nلمر رهن", "completion": " الناتج:\n```text\nنهر-رمل\nTrue\nلمر رهن\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 9 * x ** 2 + (-7) * x + (-5)", "tests": ["assert p(4) == 111", "assert p(14) == 1661", "assert p(-9) == 787", "assert p(6) == 277", "assert p(-5) == 255", "assert p(-17) == 2715", "assert p(5) == 185", "assert p(0) == -5"], "test_code": "assert p(4) == 111\nassert p(14) == 1661\nassert p(-9) == 787\nassert p(6) == 277\nassert p(-5) == 255\nassert p(-17) == 2715\nassert p(5) == 185\nassert p(0) == -5", "answer": "def p(x):\n return 9 * x ** 2 + (-7) * x + (-5)", "completion": " ```python\ndef p(x):\n return 9 * x ** 2 + (-7) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 9x² - 7x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(4)` يُرجع `111`.\nالجواب:", "qhash": "bf77d394c94cf827"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'علم'\nprint(kalima.find('ت'))\nprint('ت' in kalima)\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'علم'\nprint(kalima.find('ت'))\nprint('ت' in kalima)\nprint(kalima[-1])\n```\nالجواب:", "qhash": "21b94f726cc6b85d", "answer": "-1\nFalse\nم", "completion": " الناتج:\n```text\n-1\nFalse\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -2 * x ** 2 + (-4) * x + (-3)", "tests": ["assert evaluate(10) == -243", "assert evaluate(3) == -33", "assert evaluate(5) == -73", "assert evaluate(-1) == -1", "assert evaluate(-7) == -73", "assert evaluate(-5) == -33", "assert evaluate(16) == -579", "assert evaluate(0) == -3"], "test_code": "assert evaluate(10) == -243\nassert evaluate(3) == -33\nassert evaluate(5) == -73\nassert evaluate(-1) == -1\nassert evaluate(-7) == -73\nassert evaluate(-5) == -33\nassert evaluate(16) == -579\nassert evaluate(0) == -3", "answer": "def evaluate(x):\n return -2 * x ** 2 + (-4) * x + (-3)", "completion": " ```python\ndef evaluate(x):\n return -2 * x ** 2 + (-4) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -2x² - 4x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(10)` يُرجع `-243`.\nالجواب:", "qhash": "617e6aadd8edb005"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 20:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([9, 9, 7, 4, 4]) == [9, 18, 0, 4, 8]", "assert reset_sum([-10]) == [-10]", "assert reset_sum([-7, -6, 17, 5, 8, 7, -5]) == [-7, -13, 4, 9, 17, 0, -5]", "assert reset_sum([-6, 16, 6, 9]) == [-6, 10, 16, 0]", "assert reset_sum([14, 6, 3, -7, 0, -10, 4, -1]) == [14, 20, 0, -7, -7, -17, -13, -14]", "assert reset_sum([-3, -2, -8, -2, -8, -3, -10]) == [-3, -5, -13, -15, -23, -26, -36]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([9, 9, 7, 4, 4]) == [9, 18, 0, 4, 8]\nassert reset_sum([-10]) == [-10]\nassert reset_sum([-7, -6, 17, 5, 8, 7, -5]) == [-7, -13, 4, 9, 17, 0, -5]\nassert reset_sum([-6, 16, 6, 9]) == [-6, 10, 16, 0]\nassert reset_sum([14, 6, 3, -7, 0, -10, 4, -1]) == [14, 20, 0, -7, -7, -17, -13, -14]\nassert reset_sum([-3, -2, -8, -2, -8, -3, -10]) == [-3, -5, -13, -15, -23, -26, -36]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 20:\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 > 20:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 20 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([9, 9, 7, 4, 4])` يجب أن تُرجع `[9, 18, 0, 4, 8]`.\nالجواب:", "qhash": "bdffa762280fca1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 10 for x in range(3, 18) if x % 5 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 10 for x in range(3, 18) if x % 5 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "72ee876c07759de1", "answer": "[15, 90, 215]\n3 320", "completion": " الناتج:\n```text\n[15, 90, 215]\n3 320\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 997", "tests": ["assert mfact(11) == 425", "assert mfact(47) == 814", "assert mfact(3) == 3", "assert mfact(15) == 124", "assert mfact(18) == 619", "assert mfact(24) == 308", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 425\nassert mfact(47) == 814\nassert mfact(3) == 3\nassert mfact(15) == 124\nassert mfact(18) == 619\nassert mfact(24) == 308\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 997", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(11)` يُرجع `425`.\nالجواب:", "qhash": "7c8ef695d60e01a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 62) == 1)", "tests": ["assert phi_upto(19) == 10", "assert phi_upto(151) == 74", "assert phi_upto(68) == 33", "assert phi_upto(6) == 3", "assert phi_upto(174) == 84", "assert phi_upto(171) == 83", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(19) == 10\nassert phi_upto(151) == 74\nassert phi_upto(68) == 33\nassert phi_upto(6) == 3\nassert phi_upto(174) == 84\nassert phi_upto(171) == 83\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, 62) == 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, 62) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 62، أي أن القاسم المشترك الأكبر لها مع 62 يساوي 1.\nمثال: `phi_upto(19)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "37a2f510740211a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(92185128))\nprint(calc(calc(92185128)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(92185128))\nprint(calc(calc(92185128)))\n```\nالجواب:", "qhash": "a5d779d635ec6bf0", "answer": "36\n9", "completion": " الناتج:\n```text\n36\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 7 * x ** 2 + (-3) * x + (-6)", "tests": ["assert poly(3) == 48", "assert poly(-6) == 264", "assert poly(8) == 418", "assert poly(2) == 16", "assert poly(-4) == 118", "assert poly(-17) == 2068", "assert poly(11) == 808", "assert poly(0) == -6"], "test_code": "assert poly(3) == 48\nassert poly(-6) == 264\nassert poly(8) == 418\nassert poly(2) == 16\nassert poly(-4) == 118\nassert poly(-17) == 2068\nassert poly(11) == 808\nassert poly(0) == -6", "answer": "def poly(x):\n return 7 * x ** 2 + (-3) * x + (-6)", "completion": " ```python\ndef poly(x):\n return 7 * x ** 2 + (-3) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 7x² - 3x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(3)` يُرجع `48`.\nالجواب:", "qhash": "79fb710a4ace4000"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert mult_sum(227) == 4218", "assert mult_sum(295) == 7350", "assert mult_sum(78) == 468", "assert mult_sum(157) == 2106", "assert mult_sum(237) == 4680", "assert mult_sum(59) == 270", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(227) == 4218\nassert mult_sum(295) == 7350\nassert mult_sum(78) == 468\nassert mult_sum(157) == 2106\nassert mult_sum(237) == 4680\nassert mult_sum(59) == 270\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 % 12 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(227)` يُرجع `4218`.\nالجواب:", "qhash": "bd4b2d051a265350"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('خالد', 38), ('ليلى', 17), ('عمر', 98), ('باسل', 71)]\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 = [('خالد', 38), ('ليلى', 17), ('عمر', 98), ('باسل', 71)]\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": "14a8ac254e973d01", "answer": "[('ليلى', 17), ('خالد', 38), ('باسل', 71), ('عمر', 98)]\n['عمر', 'باسل']", "completion": " الناتج:\n```text\n[('ليلى', 17), ('خالد', 38), ('باسل', 71), ('عمر', 98)]\n['عمر', 'باسل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'glnu'}", "tests": ["assert char_counts('rocket signal desert on garden an') == {'g': 2, 'l': 1, 'n': 4, 'u': 0}", "assert char_counts('it matrix') == {'g': 0, 'l': 0, 'n': 0, 'u': 0}", "assert char_counts('apple table') == {'g': 0, 'l': 2, 'n': 0, 'u': 0}", "assert char_counts('stone coffee banana up') == {'g': 0, 'l': 0, 'n': 3, 'u': 1}", "assert char_counts('window code signal engine') == {'g': 2, 'l': 1, 'n': 4, 'u': 0}", "assert char_counts('light in desert we cloud on') == {'g': 1, 'l': 2, 'n': 2, 'u': 1}", "assert char_counts('') == {'g': 0, 'l': 0, 'n': 0, 'u': 0}"], "test_code": "assert char_counts('rocket signal desert on garden an') == {'g': 2, 'l': 1, 'n': 4, 'u': 0}\nassert char_counts('it matrix') == {'g': 0, 'l': 0, 'n': 0, 'u': 0}\nassert char_counts('apple table') == {'g': 0, 'l': 2, 'n': 0, 'u': 0}\nassert char_counts('stone coffee banana up') == {'g': 0, 'l': 0, 'n': 3, 'u': 1}\nassert char_counts('window code signal engine') == {'g': 2, 'l': 1, 'n': 4, 'u': 0}\nassert char_counts('light in desert we cloud on') == {'g': 1, 'l': 2, 'n': 2, 'u': 1}\nassert char_counts('') == {'g': 0, 'l': 0, 'n': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'glnu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'glnu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'l'، 'n'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('rocket signal desert on garden an')` يُرجع `{'g': 2, 'l': 1, 'n': 4, 'u': 0}`.\nالجواب:", "qhash": "ea91e24977e6bf24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('pixel signal we music signal A1') == 'atipw dtrylw hp xfdtn dtrylw A1'", "assert cipher('music A1') == 'xfdtn A1'", "assert cipher('code 2024') == 'nzop 2024'", "assert cipher('coffee engine') == 'nzqqpp pyrtyp'", "assert cipher('brain desert data orange window !') == 'mclty opdpce olel zclyrp htyozh !'", "assert cipher('on coffee') == 'zy nzqqpp'", "assert cipher('') == ''"], "test_code": "assert cipher('pixel signal we music signal A1') == 'atipw dtrylw hp xfdtn dtrylw A1'\nassert cipher('music A1') == 'xfdtn A1'\nassert cipher('code 2024') == 'nzop 2024'\nassert cipher('coffee engine') == 'nzqqpp pyrtyp'\nassert cipher('brain desert data orange window !') == 'mclty opdpce olel zclyrp htyozh !'\nassert cipher('on coffee') == 'zy nzqqpp'\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 + (11)) % 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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('pixel signal we music signal A1')` يجب أن تُرجع `'atipw dtrylw hp xfdtn dtrylw A1'`.\nالجواب:", "qhash": "922d8f7bcb61561c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert tally_div([30, 33, 31, 42, 5, 59]) == 1", "assert tally_div([-39, 48, 73, 81]) == 1", "assert tally_div([53, -24, 36, 88, 18, 4, 18, 22, 76, 68, -2]) == 10", "assert tally_div([65, 81, 90, 45]) == 0", "assert tally_div([-23, 21, 35, 2, 2, -13, 61, -18, 53, 89, -21, 70]) == 3", "assert tally_div([36, 28, 90, -35, -33, 56, 37, 79, 36, -19, 44]) == 5", "assert tally_div([]) == 0"], "test_code": "assert tally_div([30, 33, 31, 42, 5, 59]) == 1\nassert tally_div([-39, 48, 73, 81]) == 1\nassert tally_div([53, -24, 36, 88, 18, 4, 18, 22, 76, 68, -2]) == 10\nassert tally_div([65, 81, 90, 45]) == 0\nassert tally_div([-23, 21, 35, 2, 2, -13, 61, -18, 53, 89, -21, 70]) == 3\nassert tally_div([36, 28, 90, -35, -33, 56, 37, 79, 36, -19, 44]) == 5\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([30, 33, 31, 42, 5, 59])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "779b1b9279e3523c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [21, 34, -8, 19, 39, 28]\nprint(nums[3:6])\nprint(nums[::-1])\nprint(max(nums[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [21, 34, -8, 19, 39, 28]\nprint(nums[3:6])\nprint(nums[::-1])\nprint(max(nums[3:6]))\n```\nالجواب:", "qhash": "7c81f437b200d458", "answer": "[19, 39, 28]\n[28, 39, 19, -8, 34, 21]\n39", "completion": " الناتج:\n```text\n[19, 39, 28]\n[28, 39, 19, -8, 34, 21]\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'eln'}", "tests": ["assert char_freq('signal data a table camel pixel') == {'e': 3, 'l': 4, 'n': 1}", "assert char_freq('apple window an window') == {'e': 1, 'l': 1, 'n': 3}", "assert char_freq('camel data apple python') == {'e': 2, 'l': 2, 'n': 1}", "assert char_freq('banana planet signal summer') == {'e': 2, 'l': 2, 'n': 4}", "assert char_freq('by') == {'e': 0, 'l': 0, 'n': 0}", "assert char_freq('winter on on desert by') == {'e': 3, 'l': 0, 'n': 3}", "assert char_freq('') == {'e': 0, 'l': 0, 'n': 0}"], "test_code": "assert char_freq('signal data a table camel pixel') == {'e': 3, 'l': 4, 'n': 1}\nassert char_freq('apple window an window') == {'e': 1, 'l': 1, 'n': 3}\nassert char_freq('camel data apple python') == {'e': 2, 'l': 2, 'n': 1}\nassert char_freq('banana planet signal summer') == {'e': 2, 'l': 2, 'n': 4}\nassert char_freq('by') == {'e': 0, 'l': 0, 'n': 0}\nassert char_freq('winter on on desert by') == {'e': 3, 'l': 0, 'n': 3}\nassert char_freq('') == {'e': 0, 'l': 0, 'n': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'eln'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'eln'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'l'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('signal data a table camel pixel')` يجب أن تُرجع `{'e': 3, 'l': 4, 'n': 1}`.\nالجواب:", "qhash": "96a9a987a97e4dd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'pixel'\nprint(s.split('_'))\nprint(s.index('i') + len(s))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'pixel'\nprint(s.split('_'))\nprint(s.index('i') + len(s))\nprint(s[::-1])\n```\nالجواب:", "qhash": "10a55b6a7ba50cf5", "answer": "['pixel']\n6\nlexip", "completion": " الناتج:\n```text\n['pixel']\n6\nlexip\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('river brain table at signal') == 'signal,at,table,brain,river'", "assert rev_join('signal orange summer data orange data an banana') == 'banana,an,data,orange,data,summer,orange,signal'", "assert rev_join('') == ''", "assert rev_join('go pixel') == 'pixel,go'", "assert rev_join('planet summer matrix pixel a pixel river planet') == 'planet,river,pixel,a,pixel,matrix,summer,planet'", "assert rev_join('') == ''", "assert rev_join('music apple camel') == 'camel,apple,music'"], "test_code": "assert rev_join('river brain table at signal') == 'signal,at,table,brain,river'\nassert rev_join('signal orange summer data orange data an banana') == 'banana,an,data,orange,data,summer,orange,signal'\nassert rev_join('') == ''\nassert rev_join('go pixel') == 'pixel,go'\nassert rev_join('planet summer matrix pixel a pixel river planet') == 'planet,river,pixel,a,pixel,matrix,summer,planet'\nassert rev_join('') == ''\nassert rev_join('music apple camel') == 'camel,apple,music'", "answer": "def rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_join('river brain table at signal')` يُرجع `'signal,at,table,brain,river'`.\nالجواب:", "qhash": "20321a5f02a24a04"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 73:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([20, 8, 10, 12, 31]) == [20, 28, 38, 50, 0]", "assert capped_cumsum([63]) == [63]", "assert capped_cumsum([1, -2, 42, 52]) == [1, -1, 41, 0]", "assert capped_cumsum([11, 40, 53, -4, 34, 11, 32, 12]) == [11, 51, 0, -4, 30, 41, 73, 0]", "assert capped_cumsum([7, 66, 56]) == [7, 73, 0]", "assert capped_cumsum([58, 37, 29, 55, 28, -3, 40]) == [58, 0, 29, 0, 28, 25, 65]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([20, 8, 10, 12, 31]) == [20, 28, 38, 50, 0]\nassert capped_cumsum([63]) == [63]\nassert capped_cumsum([1, -2, 42, 52]) == [1, -1, 41, 0]\nassert capped_cumsum([11, 40, 53, -4, 34, 11, 32, 12]) == [11, 51, 0, -4, 30, 41, 73, 0]\nassert capped_cumsum([7, 66, 56]) == [7, 73, 0]\nassert capped_cumsum([58, 37, 29, 55, 28, -3, 40]) == [58, 0, 29, 0, 28, 25, 65]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 73:\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 > 73:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 73 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([20, 8, 10, 12, 31])` يجب أن تُرجع `[20, 28, 38, 50, 0]`.\nالجواب:", "qhash": "712bd93bfb083aac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'ليلى': 22, 'هدى': 32, 'منى': 2, 'علي': 40}\nmarks['منى'] += 18\nmarks['راشد'] = 19\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سلمى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'ليلى': 22, 'هدى': 32, 'منى': 2, 'علي': 40}\nmarks['منى'] += 18\nmarks['راشد'] = 19\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سلمى', -1))\n```\nالجواب:", "qhash": "b4865080189b5c50", "answer": "5\nعلي\n133\n-1", "completion": " الناتج:\n```text\n5\nعلي\n133\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -6 <= x <= 23)", "tests": ["assert filter_range([30, -11, 31, 29]) == []", "assert filter_range([3, -25, 18, 22, 3, -1, 29, -18, -27, 11]) == [-44, -36, -22, -6, -6, 2]", "assert filter_range([14, 17, 54]) == [-34, -28]", "assert filter_range([6, -28, -27, -18, -8, 54, 41, 5, -4]) == [-12, -10, 8]", "assert filter_range([-9, -5, -15, 1, 33, -10, 6, -26]) == [-12, -2, 10]", "assert filter_range([46, -28, -27, -24, 23, 30, 5, -23, -16, 16]) == [-46, -32, -10]", "assert filter_range([-29, 14, -15, 26, 32, 54, 5, 1, -8]) == [-28, -10, -2]", "assert filter_range([]) == []"], "test_code": "assert filter_range([30, -11, 31, 29]) == []\nassert filter_range([3, -25, 18, 22, 3, -1, 29, -18, -27, 11]) == [-44, -36, -22, -6, -6, 2]\nassert filter_range([14, 17, 54]) == [-34, -28]\nassert filter_range([6, -28, -27, -18, -8, 54, 41, 5, -4]) == [-12, -10, 8]\nassert filter_range([-9, -5, -15, 1, 33, -10, 6, -26]) == [-12, -2, 10]\nassert filter_range([46, -28, -27, -24, 23, 30, 5, -23, -16, 16]) == [-46, -32, -10]\nassert filter_range([-29, 14, -15, 26, 32, 54, 5, 1, -8]) == [-28, -10, -2]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -6 <= x <= 23)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -2 for x in xs if -6 <= x <= 23)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و23 (شاملًا الطرفين) في -2.\nمثال: `filter_range([30, -11, 31, 29])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "19c8409b84538659"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'فيصل': 36, 'عمر': 38, 'زينب': 0}\nd['فيصل'] += 4\nd['ليلى'] = 7\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('هشام', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'فيصل': 36, 'عمر': 38, 'زينب': 0}\nd['فيصل'] += 4\nd['ليلى'] = 7\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('هشام', -1))\n```\nالجواب:", "qhash": "0f16b2350432e2be", "answer": "4\nفيصل\n85\n-1", "completion": " الناتج:\n```text\n4\nفيصل\n85\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('engine it brain to stone') == 'stone_brain_engine'", "assert flip_words('signal table') == 'table_signal'", "assert flip_words('winter data banana orange summer by garden vector') == 'vector_garden_summer_orange_banana_data_winter'", "assert flip_words('vector stone data table summer a') == 'summer_table_data_stone_vector'", "assert flip_words('') == ''", "assert flip_words('is by an river stone pixel a summer') == 'summer_pixel_stone_river'", "assert flip_words('garden signal') == 'signal_garden'"], "test_code": "assert flip_words('engine it brain to stone') == 'stone_brain_engine'\nassert flip_words('signal table') == 'table_signal'\nassert flip_words('winter data banana orange summer by garden vector') == 'vector_garden_summer_orange_banana_data_winter'\nassert flip_words('vector stone data table summer a') == 'summer_table_data_stone_vector'\nassert flip_words('') == ''\nassert flip_words('is by an river stone pixel a summer') == 'summer_pixel_stone_river'\nassert flip_words('garden signal') == 'signal_garden'", "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('engine it brain to stone')` يجب أن تُرجع `'stone_brain_engine'`.\nالجواب:", "qhash": "90235f91f8593ca2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 17", "tests": ["assert fact_mod(4) == 8", "assert fact_mod(16) == 13", "assert fact_mod(21) == 0", "assert fact_mod(15) == 13", "assert fact_mod(26) == 11", "assert fact_mod(0) == 1", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 8\nassert fact_mod(16) == 13\nassert fact_mod(21) == 0\nassert fact_mod(15) == 13\nassert fact_mod(26) == 11\nassert fact_mod(0) == 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)) % 17", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(4)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "7b5e98d78ed4cab2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_matching([10, 12, 67, 10, 62, 58, 68, 42]) == 0", "assert count_matching([-30, 62, 60, 80, 51, 41, -16, 36, 85]) == 0", "assert count_matching([71, 61, 80, -20, 1, 84, 26, 2, 39, -21, 1]) == 0", "assert count_matching([56]) == 0", "assert count_matching([59, 38, 29, 29, -19, -27, 39, -13, 60]) == 1", "assert count_matching([33, -29, -29, 21, -39, 32]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([10, 12, 67, 10, 62, 58, 68, 42]) == 0\nassert count_matching([-30, 62, 60, 80, 51, 41, -16, 36, 85]) == 0\nassert count_matching([71, 61, 80, -20, 1, 84, 26, 2, 39, -21, 1]) == 0\nassert count_matching([56]) == 0\nassert count_matching([59, 38, 29, 29, -19, -27, 39, -13, 60]) == 1\nassert count_matching([33, -29, -29, 21, -39, 32]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([10, 12, 67, 10, 62, 58, 68, 42])` يُرجع `0`.\nالجواب:", "qhash": "2b0fdf9736207d36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([12, 25, 82, 3, 25, 40, 46, 30, 35, 54, 50]) == 4", "assert how_many_div([89, -16, -22, 77, 52, 72, 27, -37, 15, 5, 68]) == 4", "assert how_many_div([-38, -11, -13, 32, 67, 73, 57, 12, 55, 39]) == 2", "assert how_many_div([-31]) == 0", "assert how_many_div([-20, 13, 68]) == 2", "assert how_many_div([]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([12, 25, 82, 3, 25, 40, 46, 30, 35, 54, 50]) == 4\nassert how_many_div([89, -16, -22, 77, 52, 72, 27, -37, 15, 5, 68]) == 4\nassert how_many_div([-38, -11, -13, 32, 67, 73, 57, 12, 55, 39]) == 2\nassert how_many_div([-31]) == 0\nassert how_many_div([-20, 13, 68]) == 2\nassert how_many_div([]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 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 % 2 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([12, 25, 82, 3, 25, 40, 46, 30, 35, 54, 50])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "4766bc7f213c1bb3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "tests": ["assert sum_powers(4) == 200", "assert sum_powers(12) == 12168", "assert sum_powers(10) == 6050", "assert sum_powers(2) == 18", "assert sum_powers(10) == 6050", "assert sum_powers(1) == 2", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(4) == 200\nassert sum_powers(12) == 12168\nassert sum_powers(10) == 6050\nassert sum_powers(2) == 18\nassert sum_powers(10) == 6050\nassert sum_powers(1) == 2\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(4)` يُرجع `200`.\nالجواب:", "qhash": "bd0ac3a66ea29997"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17", "tests": ["assert rec_prod(6) == 12", "assert rec_prod(6) == 12", "assert rec_prod(20) == 4", "assert rec_prod(2) == 2", "assert rec_prod(54) == 0", "assert rec_prod(0) == 1", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 12\nassert rec_prod(6) == 12\nassert rec_prod(20) == 4\nassert rec_prod(2) == 2\nassert rec_prod(54) == 0\nassert rec_prod(0) == 1\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(6)` يُرجع `12`.\nالجواب:", "qhash": "005779bb4be99683"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'engine'\nprint(name.split('_'))\nprint(name.capitalize())\nprint(name.count('e'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'engine'\nprint(name.split('_'))\nprint(name.capitalize())\nprint(name.count('e'))\n```\nالجواب:", "qhash": "cc88c3a5e6da07a5", "answer": "['engine']\nEngine\n2", "completion": " الناتج:\n```text\n['engine']\nEngine\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "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 % 5 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([10, 75, 65, 41, 44, 51, 21, 86, 59]) == 0", "assert how_many_div([74, 1, 26, 85, 57, 29, 85, 64, 87, 50, 74, 29]) == 0", "assert how_many_div([66, 84, 68, -32]) == 0", "assert how_many_div([37, 74, 64, -20, 1, 21, 83]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([53]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([10, 75, 65, 41, 44, 51, 21, 86, 59]) == 0\nassert how_many_div([74, 1, 26, 85, 57, 29, 85, 64, 87, 50, 74, 29]) == 0\nassert how_many_div([66, 84, 68, -32]) == 0\nassert how_many_div([37, 74, 64, -20, 1, 21, 83]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([53]) == 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 % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([10, 75, 65, 41, 44, 51, 21, 86, 59])` يُرجع `0`.\nالجواب:", "qhash": "e93b9c10c68238f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('stone apple matrix vector coffee we') == 'coffee/vector/matrix/apple/stone'", "assert invert_words('') == ''", "assert invert_words('') == ''", "assert invert_words('') == ''", "assert invert_words('') == ''", "assert invert_words('summer cloud at') == 'cloud/summer'", "assert invert_words('of pixel a pixel coffee') == 'coffee/pixel/pixel'"], "test_code": "assert invert_words('stone apple matrix vector coffee we') == 'coffee/vector/matrix/apple/stone'\nassert invert_words('') == ''\nassert invert_words('') == ''\nassert invert_words('') == ''\nassert invert_words('') == ''\nassert invert_words('summer cloud at') == 'cloud/summer'\nassert invert_words('of pixel a pixel coffee') == 'coffee/pixel/pixel'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `invert_words('stone apple matrix vector coffee we')` يُرجع `'coffee/vector/matrix/apple/stone'`.\nالجواب:", "qhash": "0076b237041ce844"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 5", "tests": ["assert digit_score(47318) == 2", "assert digit_score(3949) == 4", "assert digit_score(170265) == 3", "assert digit_score(790126) == 2", "assert digit_score(481904) == 0", "assert digit_score(560829) == 0", "assert digit_score(121916) == 1", "assert digit_score(0) == 0"], "test_code": "assert digit_score(47318) == 2\nassert digit_score(3949) == 4\nassert digit_score(170265) == 3\nassert digit_score(790126) == 2\nassert digit_score(481904) == 0\nassert digit_score(560829) == 0\nassert digit_score(121916) == 1\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 5", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 5.\nللتوضيح: الاستدعاء `digit_score(47318)` يُرجع `2`.\nالجواب:", "qhash": "e7b8f5f067f2f77b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'ليلى': 36, 'وليد': 21, 'زينب': 48, 'علي': 46, 'أحمد': 40}\nmarks['ليلى'] += 20\nmarks['فيصل'] = 53\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 = {'ليلى': 36, 'وليد': 21, 'زينب': 48, 'علي': 46, 'أحمد': 40}\nmarks['ليلى'] += 20\nmarks['فيصل'] = 53\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": "a68fa57e6d39f986", "answer": "6\nليلى\n264\n[('وليد', 21), ('أحمد', 40)]", "completion": " الناتج:\n```text\n6\nليلى\n264\n[('وليد', 21), ('أحمد', 40)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('معلم شمس شجرة حاسوب دفتر بيت ليل لغة') == 2", "assert words_starting('سوق طالب ليل سفينة وردة دفتر') == 1", "assert words_starting('شمس لغة برتقال ليل') == 2", "assert words_starting('مطر عمل مدينة طالب صديق لغة') == 1", "assert words_starting('جمل نهر مكتبة') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('بيت ليل برتقال برتقال نور لغة بحر مدرسة') == 2\nassert words_starting('معلم شمس شجرة حاسوب دفتر بيت ليل لغة') == 2\nassert words_starting('سوق طالب ليل سفينة وردة دفتر') == 1\nassert words_starting('شمس لغة برتقال ليل') == 2\nassert words_starting('مطر عمل مدينة طالب صديق لغة') == 1\nassert words_starting('جمل نهر مكتبة') == 0\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:\n if w.startswith('ل'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ل»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef words_starting(line):\n count = 0\n for w in line:\n if w.startswith('ل'):\n count += 1\n return count\n```\nمثال: `words_starting('بيت ليل برتقال برتقال نور لغة بحر مدرسة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "a4e0c20cef4cea03"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([30, 12, 11, 21, 36, 44]) == [30, 42, 53, 74, 0, 44]", "assert cumulative([16, 3, 21, 52]) == [16, 19, 40, 0]", "assert cumulative([7, -2]) == [7, 5]", "assert cumulative([61, 9]) == [61, 70]", "assert cumulative([]) == []", "assert cumulative([-2]) == [-2]", "assert cumulative([]) == []"], "test_code": "assert cumulative([30, 12, 11, 21, 36, 44]) == [30, 42, 53, 74, 0, 44]\nassert cumulative([16, 3, 21, 52]) == [16, 19, 40, 0]\nassert cumulative([7, -2]) == [7, 5]\nassert cumulative([61, 9]) == [61, 70]\nassert cumulative([]) == []\nassert cumulative([-2]) == [-2]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\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 > 82:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 82 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([30, 12, 11, 21, 36, 44])` يجب أن تُرجع `[30, 42, 53, 74, 0, 44]`.\nالجواب:", "qhash": "8cdfcaad63b8b3a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('ليلى', 72), ('حسن', 91), ('نور', 27), ('يوسف', 0)]\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 = [('ليلى', 72), ('حسن', 91), ('نور', 27), ('يوسف', 0)]\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": "408fff2bf463c158", "answer": "[('يوسف', 0), ('نور', 27), ('ليلى', 72), ('حسن', 91)]\n['حسن', 'ليلى']", "completion": " الناتج:\n```text\n[('يوسف', 0), ('نور', 27), ('ليلى', 72), ('حسن', 91)]\n['حسن', 'ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(-3, 1))", "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(-3, 1))\n```\nالجواب:", "qhash": "bc10de883d65fb2d", "answer": "-3", "completion": " الناتج:\n```text\n-3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 8 % len(items)\n return items[k:] + items[:k]", "tests": ["assert turn_list([46, 9, 12, 18, 34, 39, 25, 43]) == [46, 9, 12, 18, 34, 39, 25, 43]", "assert turn_list([29, 22, -9, 30, 16, 31, -5, 11, 0, 12, -4]) == [0, 12, -4, 29, 22, -9, 30, 16, 31, -5, 11]", "assert turn_list([37, 25, 10, 27, 7]) == [27, 7, 37, 25, 10]", "assert turn_list([-2, 26]) == [-2, 26]", "assert turn_list([0]) == [0]", "assert turn_list([44, 18, 2, -5, 46, 21, 43, 17, 48]) == [48, 44, 18, 2, -5, 46, 21, 43, 17]", "assert turn_list([]) == []"], "test_code": "assert turn_list([46, 9, 12, 18, 34, 39, 25, 43]) == [46, 9, 12, 18, 34, 39, 25, 43]\nassert turn_list([29, 22, -9, 30, 16, 31, -5, 11, 0, 12, -4]) == [0, 12, -4, 29, 22, -9, 30, 16, 31, -5, 11]\nassert turn_list([37, 25, 10, 27, 7]) == [27, 7, 37, 25, 10]\nassert turn_list([-2, 26]) == [-2, 26]\nassert turn_list([0]) == [0]\nassert turn_list([44, 18, 2, -5, 46, 21, 43, 17, 48]) == [48, 44, 18, 2, -5, 46, 21, 43, 17]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 8 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef turn_list(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 turn_list(items):\n if not items:\n return []\n k = 8 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([46, 9, 12, 18, 34, 39, 25, 43])` يُرجع `[46, 9, 12, 18, 34, 39, 25, 43]`.\nالجواب:", "qhash": "4ccd66ff7a209efc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)", "tests": ["assert sum_multiples(248) == 6690", "assert sum_multiples(274) == 8513", "assert sum_multiples(181) == 3698", "assert sum_multiples(95) == 951", "assert sum_multiples(92) == 951", "assert sum_multiples(23) == 51", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(248) == 6690\nassert sum_multiples(274) == 8513\nassert sum_multiples(181) == 3698\nassert sum_multiples(95) == 951\nassert sum_multiples(92) == 951\nassert sum_multiples(23) == 51\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 9.\nمثال: `sum_multiples(248)` يجب أن تُرجع `6690`.\nالجواب:", "qhash": "d28f5e75ecf18aa7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'girt'}", "tests": ["assert char_freq('to falcon data banana music') == {'g': 0, 'i': 1, 'r': 0, 't': 2}", "assert char_freq('camel stone vector music data orange') == {'g': 1, 'i': 1, 'r': 2, 't': 3}", "assert char_freq('banana') == {'g': 0, 'i': 0, 'r': 0, 't': 0}", "assert char_freq('by window up is') == {'g': 0, 'i': 2, 'r': 0, 't': 0}", "assert char_freq('pixel engine') == {'g': 1, 'i': 2, 'r': 0, 't': 0}", "assert char_freq('up banana stone') == {'g': 0, 'i': 0, 'r': 0, 't': 1}", "assert char_freq('') == {'g': 0, 'i': 0, 'r': 0, 't': 0}"], "test_code": "assert char_freq('to falcon data banana music') == {'g': 0, 'i': 1, 'r': 0, 't': 2}\nassert char_freq('camel stone vector music data orange') == {'g': 1, 'i': 1, 'r': 2, 't': 3}\nassert char_freq('banana') == {'g': 0, 'i': 0, 'r': 0, 't': 0}\nassert char_freq('by window up is') == {'g': 0, 'i': 2, 'r': 0, 't': 0}\nassert char_freq('pixel engine') == {'g': 1, 'i': 2, 'r': 0, 't': 0}\nassert char_freq('up banana stone') == {'g': 0, 'i': 0, 'r': 0, 't': 1}\nassert char_freq('') == {'g': 0, 'i': 0, 'r': 0, 't': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'girt'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'girt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'i'، 'r'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('to falcon data banana music')` يُرجع `{'g': 0, 'i': 1, 'r': 0, 't': 2}`.\nالجواب:", "qhash": "23fbf0bd20c9204f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('صحراء جبل ميناء مدينة ميناء') == 1", "assert count_letter('تفاحة خبز سيارة برتقال برتقال') == 1", "assert count_letter('صديق فجر حاسوب ليل') == 1", "assert count_letter('برمجة ليل دفتر طالب فجر صديق عمل سفينة') == 0", "assert count_letter('جمل ليل') == 0", "assert count_letter('') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('برتقال مطر سلام عربية مكتبة حديقة مدرسة') == 1\nassert count_letter('صحراء جبل ميناء مدينة ميناء') == 1\nassert count_letter('تفاحة خبز سيارة برتقال برتقال') == 1\nassert count_letter('صديق فجر حاسوب ليل') == 1\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 'ح' 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": "9fa6fe281ca8f1f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'أحمد': 17, 'باسل': 13, 'راشد': 43, 'زينب': 23, 'خالد': 24}\npoints['أحمد'] += 19\npoints['عمر'] = 19\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('سلمى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'أحمد': 17, 'باسل': 13, 'راشد': 43, 'زينب': 23, 'خالد': 24}\npoints['أحمد'] += 19\npoints['عمر'] = 19\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('سلمى', -1))\n```\nالجواب:", "qhash": "86c612415a4f9b26", "answer": "6\nراشد\n158\n-1", "completion": " الناتج:\n```text\n6\nراشد\n158\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bos'}", "tests": ["assert freq_of('go banana on pixel garden brain') == {'b': 2, 'o': 2, 's': 0}", "assert freq_of('orange in go python on engine') == {'b': 0, 'o': 4, 's': 0}", "assert freq_of('banana music') == {'b': 1, 'o': 0, 's': 1}", "assert freq_of('garden engine light') == {'b': 0, 'o': 0, 's': 0}", "assert freq_of('pixel') == {'b': 0, 'o': 0, 's': 0}", "assert freq_of('camel camel pixel engine') == {'b': 0, 'o': 0, 's': 0}", "assert freq_of('') == {'b': 0, 'o': 0, 's': 0}"], "test_code": "assert freq_of('go banana on pixel garden brain') == {'b': 2, 'o': 2, 's': 0}\nassert freq_of('orange in go python on engine') == {'b': 0, 'o': 4, 's': 0}\nassert freq_of('banana music') == {'b': 1, 'o': 0, 's': 1}\nassert freq_of('garden engine light') == {'b': 0, 'o': 0, 's': 0}\nassert freq_of('pixel') == {'b': 0, 'o': 0, 's': 0}\nassert freq_of('camel camel pixel engine') == {'b': 0, 'o': 0, 's': 0}\nassert freq_of('') == {'b': 0, 'o': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bos'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'o'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('go banana on pixel garden brain')` يجب أن تُرجع `{'b': 2, 'o': 2, 's': 0}`.\nالجواب:", "qhash": "0ff131c316930259"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'stone'\nprint(word.replace('n', '*'))\nprint(word.capitalize())\nprint(word[-3:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'stone'\nprint(word.replace('n', '*'))\nprint(word.capitalize())\nprint(word[-3:])\n```\nالجواب:", "qhash": "e6d3d4c9a0e33a53", "answer": "sto*e\nStone\none", "completion": " الناتج:\n```text\nsto*e\nStone\none\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'lo'}", "tests": ["assert char_freq('music window on') == {'l': 0, 'o': 2}", "assert char_freq('code stone on falcon apple up') == {'l': 2, 'o': 4}", "assert char_freq('window signal rocket pixel pixel desert') == {'l': 3, 'o': 2}", "assert char_freq('an on desert') == {'l': 0, 'o': 1}", "assert char_freq('to') == {'l': 0, 'o': 1}", "assert char_freq('stone desert apple falcon camel') == {'l': 3, 'o': 2}", "assert char_freq('') == {'l': 0, 'o': 0}"], "test_code": "assert char_freq('music window on') == {'l': 0, 'o': 2}\nassert char_freq('code stone on falcon apple up') == {'l': 2, 'o': 4}\nassert char_freq('window signal rocket pixel pixel desert') == {'l': 3, 'o': 2}\nassert char_freq('an on desert') == {'l': 0, 'o': 1}\nassert char_freq('to') == {'l': 0, 'o': 1}\nassert char_freq('stone desert apple falcon camel') == {'l': 3, 'o': 2}\nassert char_freq('') == {'l': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'lo'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'lo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'l'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('music window on')` يجب أن تُرجع `{'l': 0, 'o': 2}`.\nالجواب:", "qhash": "798ad4524f8b3f88"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 68", "tests": ["assert dig_pow_mod(88678) == 55", "assert dig_pow_mod(824119) == 23", "assert dig_pow_mod(137403) == 54", "assert dig_pow_mod(935347) == 23", "assert dig_pow_mod(60464) == 16", "assert dig_pow_mod(824444) == 28", "assert dig_pow_mod(96231) == 29", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(88678) == 55\nassert dig_pow_mod(824119) == 23\nassert dig_pow_mod(137403) == 54\nassert dig_pow_mod(935347) == 23\nassert dig_pow_mod(60464) == 16\nassert dig_pow_mod(824444) == 28\nassert dig_pow_mod(96231) == 29\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 68", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 68\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 68.\nللتوضيح: الاستدعاء `dig_pow_mod(88678)` يُرجع `55`.\nالجواب:", "qhash": "51649780388eeff2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 3:\n return 3\n return 2 * go(n - 1) + -1\n\nprint(go(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 3:\n return 3\n return 2 * go(n - 1) + -1\n\nprint(go(12))\n```\nالجواب:", "qhash": "4648b522233a8042", "answer": "1025", "completion": " الناتج:\n```text\n1025\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=9):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(-7))\nprint(g(-7, 9))\nprint(g(g(9), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=9):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(-7))\nprint(g(-7, 9))\nprint(g(g(9), -7))\n```\nالجواب:", "qhash": "2cf75a082d3c61bc", "answer": "-16\n-16\n7", "completion": " الناتج:\n```text\n-16\n-16\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(3))\n```\nالجواب:", "qhash": "3b106cedbd4a2185", "answer": "2", "completion": " الناتج:\n```text\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('camel banana A1') == 'rpbta qpcpcp A1'", "assert rot('camel vector camel camel a') == 'rpbta ktridg rpbta rpbta p'", "assert rot('river OK') == 'gxktg OK'", "assert rot('light to') == 'axvwi id'", "assert rot('banana Hello') == 'qpcpcp Htaad'", "assert rot('coffee music light at light') == 'rduutt bjhxr axvwi pi axvwi'", "assert rot('') == ''"], "test_code": "assert rot('camel banana A1') == 'rpbta qpcpcp A1'\nassert rot('camel vector camel camel a') == 'rpbta ktridg rpbta rpbta p'\nassert rot('river OK') == 'gxktg OK'\nassert rot('light to') == 'axvwi id'\nassert rot('banana Hello') == 'qpcpcp Htaad'\nassert rot('coffee music light at light') == 'rduutt bjhxr axvwi pi axvwi'\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 + (-11)) % 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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('camel banana A1')` يُرجع `'rpbta qpcpcp A1'`.\nالجواب:", "qhash": "a23747e9dcb21dc3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('ل')", "tests": ["assert count_in_text('قمر وردة لغة عربية تفاحة تفاحة برتقال صديق') == 2", "assert count_in_text('حديقة عربية سيارة طالب فجر نهار ماء') == 1", "assert count_in_text('معلم نهر كتاب طائرة معلم نور علم') == 3", "assert count_in_text('خبز بحر') == 0", "assert count_in_text('سفينة شجرة طالب حديقة طالب سماء دفتر') == 2", "assert count_in_text('وردة سفينة شمس') == 0", "assert count_in_text('فجر كتاب وردة جبل') == 1", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('قمر وردة لغة عربية تفاحة تفاحة برتقال صديق') == 2\nassert count_in_text('حديقة عربية سيارة طالب فجر نهار ماء') == 1\nassert count_in_text('معلم نهر كتاب طائرة معلم نور علم') == 3\nassert count_in_text('خبز بحر') == 0\nassert count_in_text('سفينة شجرة طالب حديقة طالب سماء دفتر') == 2\nassert count_in_text('وردة سفينة شمس') == 0\nassert count_in_text('فجر كتاب وردة جبل') == 1\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": "c47496cc5cead2b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'planet'\nprint(word.upper())\nprint(word.split('_'))\nprint(word[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'planet'\nprint(word.upper())\nprint(word.split('_'))\nprint(word[::-1])\n```\nالجواب:", "qhash": "17d86b65f24f9124", "answer": "PLANET\n['planet']\ntenalp", "completion": " الناتج:\n```text\nPLANET\n['planet']\ntenalp\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 14\nfor x in range(-3, 3, 1):\n result += x * 6\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 14\nfor x in range(-3, 3, 1):\n result += x * 6\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "926fbd36d66402de", "answer": "-4\n2", "completion": " الناتج:\n```text\n-4\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ain'}", "tests": ["assert freq_of('vector engine') == {'a': 0, 'i': 1, 'n': 2}", "assert freq_of('on of cloud engine we music') == {'a': 0, 'i': 2, 'n': 3}", "assert freq_of('an to table stone') == {'a': 2, 'i': 0, 'n': 2}", "assert freq_of('cloud a at of falcon is') == {'a': 3, 'i': 1, 'n': 1}", "assert freq_of('data code table stone it summer') == {'a': 3, 'i': 1, 'n': 1}", "assert freq_of('orange window desert table summer') == {'a': 2, 'i': 1, 'n': 2}", "assert freq_of('') == {'a': 0, 'i': 0, 'n': 0}"], "test_code": "assert freq_of('vector engine') == {'a': 0, 'i': 1, 'n': 2}\nassert freq_of('on of cloud engine we music') == {'a': 0, 'i': 2, 'n': 3}\nassert freq_of('an to table stone') == {'a': 2, 'i': 0, 'n': 2}\nassert freq_of('cloud a at of falcon is') == {'a': 3, 'i': 1, 'n': 1}\nassert freq_of('data code table stone it summer') == {'a': 3, 'i': 1, 'n': 1}\nassert freq_of('orange window desert table summer') == {'a': 2, 'i': 1, 'n': 2}\nassert freq_of('') == {'a': 0, 'i': 0, 'n': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ain'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ain'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'i'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('vector engine')` يجب أن تُرجع `{'a': 0, 'i': 1, 'n': 2}`.\nالجواب:", "qhash": "a4e05fb10c9e1fe7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 293\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 = 293\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": "50323d9e4d6d2315", "answer": "117", "completion": " الناتج:\n```text\n117\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('on at signal') == 'wv ib aqovit'", "assert encode('river light up apple window Hello') == 'zqdmz tqopb cx ixxtm eqvlwe Hmttw'", "assert encode('on camel winter A1') == 'wv kiumt eqvbmz A1'", "assert encode('up up vector 2024') == 'cx cx dmkbwz 2024'", "assert encode('coffee of planet A1') == 'kwnnmm wn xtivmb A1'", "assert encode('is apple coffee table engine') == 'qa ixxtm kwnnmm bijtm mvoqvm'", "assert encode('') == ''"], "test_code": "assert encode('on at signal') == 'wv ib aqovit'\nassert encode('river light up apple window Hello') == 'zqdmz tqopb cx ixxtm eqvlwe Hmttw'\nassert encode('on camel winter A1') == 'wv kiumt eqvbmz A1'\nassert encode('up up vector 2024') == 'cx cx dmkbwz 2024'\nassert encode('coffee of planet A1') == 'kwnnmm wn xtivmb A1'\nassert encode('is apple coffee table engine') == 'qa ixxtm kwnnmm bijtm mvoqvm'\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 + (-18)) % 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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('on at signal')` يُرجع `'wv ib aqovit'`.\nالجواب:", "qhash": "2b224348c3a24558"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 5 * x ** 2 + (9) * x + (-4)", "tests": ["assert eval_poly(7) == 304", "assert eval_poly(8) == 388", "assert eval_poly(-14) == 850", "assert eval_poly(-3) == 14", "assert eval_poly(-17) == 1288", "assert eval_poly(-3) == 14", "assert eval_poly(-6) == 122", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(7) == 304\nassert eval_poly(8) == 388\nassert eval_poly(-14) == 850\nassert eval_poly(-3) == 14\nassert eval_poly(-17) == 1288\nassert eval_poly(-3) == 14\nassert eval_poly(-6) == 122\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return 5 * x ** 2 + (9) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return 5 * x ** 2 + (9) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 5x² + 9x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(7)` يُرجع `304`.\nالجواب:", "qhash": "f227747737a32693"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('we light') == 'px ebzam'", "assert encode('coffee is banana light winter') == 'vhyyxx bl utgtgt ebzam pbgmxk'", "assert encode('data on code brain on') == 'wtmt hg vhwx uktbg hg'", "assert encode('light brain OK') == 'ebzam uktbg OK'", "assert encode('on table vector brain') == 'hg mtuex oxvmhk uktbg'", "assert encode('it is Hello') == 'bm bl Hxeeh'", "assert encode('') == ''"], "test_code": "assert encode('we light') == 'px ebzam'\nassert encode('coffee is banana light winter') == 'vhyyxx bl utgtgt ebzam pbgmxk'\nassert encode('data on code brain on') == 'wtmt hg vhwx uktbg hg'\nassert encode('light brain OK') == 'ebzam uktbg OK'\nassert encode('on table vector brain') == 'hg mtuex oxvmhk uktbg'\nassert encode('it is Hello') == 'bm bl Hxeeh'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('we light')` يجب أن تُرجع `'px ebzam'`.\nالجواب:", "qhash": "f027401e186c46c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 201\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 = 201\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": "5b28615c1611f8e4", "answer": "18", "completion": " الناتج:\n```text\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['stone', 'camel', 'rocket', 'planet', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['stone', 'camel', 'rocket', 'planet', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "bad9a64ebda33a47", "answer": "['data', 'stone', 'camel', 'rocket', 'planet']\n['rocket', 'planet', 'stone']", "completion": " الناتج:\n```text\n['data', 'stone', 'camel', 'rocket', 'planet']\n['rocket', 'planet', 'stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'برمجة سوق'\nprint(s.count('ة'))\nprint(s.find('ة'))\nprint(s[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'برمجة سوق'\nprint(s.count('ة'))\nprint(s.find('ة'))\nprint(s[0])\n```\nالجواب:", "qhash": "1528ca6d8fde246b", "answer": "1\n4\nب", "completion": " الناتج:\n```text\n1\n4\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(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 running_sum([51, 83, 47, 66, 67, 54, 58]) == [51, 134, 181, 0, 67, 121, 179]", "assert running_sum([34]) == [34]", "assert running_sum([158, -6, 124]) == [158, 152, 0]", "assert running_sum([-5, 129, 42, 54, 183, 68, 176]) == [-5, 124, 166, 0, 183, 0, 176]", "assert running_sum([179, 18, 30, 67, 37, 28, 169, 175]) == [179, 0, 30, 97, 134, 162, 0, 175]", "assert running_sum([]) == []", "assert running_sum([]) == []"], "test_code": "assert running_sum([51, 83, 47, 66, 67, 54, 58]) == [51, 134, 181, 0, 67, 121, 179]\nassert running_sum([34]) == [34]\nassert running_sum([158, -6, 124]) == [158, 152, 0]\nassert running_sum([-5, 129, 42, 54, 183, 68, 176]) == [-5, 124, 166, 0, 183, 0, 176]\nassert running_sum([179, 18, 30, 67, 37, 28, 169, 175]) == [179, 0, 30, 97, 134, 162, 0, 175]\nassert running_sum([]) == []\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 183 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([51, 83, 47, 66, 67, 54, 58])` يجب أن تُرجع `[51, 134, 181, 0, 67, 121, 179]`.\nالجواب:", "qhash": "520dc7bddbbde7a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(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_of_div([52, -9, 16, 25, -6, 58, 28, 51, 1]) == 51", "assert max_of_div([-15, -6, -12]) == -6", "assert max_of_div([1, 4, 7]) == None", "assert max_of_div([31, 35, 10]) == None", "assert max_of_div([-5, -26, -40, -8, -47, 14]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([52, -9, 16, 25, -6, 58, 28, 51, 1]) == 51\nassert max_of_div([-15, -6, -12]) == -6\nassert max_of_div([1, 4, 7]) == None\nassert max_of_div([31, 35, 10]) == None\nassert max_of_div([-5, -26, -40, -8, -47, 14]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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_of_div(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_of_div(nums):\n best = 0\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_of_div(nums):\n best = 0\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_of_div([52, -9, 16, 25, -6, 58, 28, 51, 1])` يُرجع `51`.\nالجواب:", "qhash": "560c36fe6a541092"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('rocket up up') == 'qnbjds to to'", "assert cipher('orange') == 'nqzmfd'", "assert cipher('orange a planet vector') == 'nqzmfd z okzmds udbsnq'", "assert cipher('coffee light matrix python A1') == 'bneedd khfgs lzsqhw oxsgnm A1'", "assert cipher('garden pixel it A1') == 'fzqcdm ohwdk hs A1'", "assert cipher('signal by engine up A1') == 'rhfmzk ax dmfhmd to A1'", "assert cipher('') == ''"], "test_code": "assert cipher('rocket up up') == 'qnbjds to to'\nassert cipher('orange') == 'nqzmfd'\nassert cipher('orange a planet vector') == 'nqzmfd z okzmds udbsnq'\nassert cipher('coffee light matrix python A1') == 'bneedd khfgs lzsqhw oxsgnm A1'\nassert cipher('garden pixel it A1') == 'fzqcdm ohwdk hs A1'\nassert cipher('signal by engine up A1') == 'rhfmzk ax dmfhmd to 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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('rocket up up')` يجب أن تُرجع `'qnbjds to to'`.\nالجواب:", "qhash": "7259b284b74a1448"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(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 max_of_div([20, 6, 34, 59, 23, 8, 43, -12, 9]) == 34", "assert max_of_div([-6, -10, -6]) == -6", "assert max_of_div([1]) == None", "assert max_of_div([5, -24, 26]) == 26", "assert max_of_div([50, -42, 45, 26, 23]) == 50", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([20, 6, 34, 59, 23, 8, 43, -12, 9]) == 34\nassert max_of_div([-6, -10, -6]) == -6\nassert max_of_div([1]) == None\nassert max_of_div([5, -24, 26]) == 26\nassert max_of_div([50, -42, 45, 26, 23]) == 50\nassert max_of_div([]) == None", "answer": "def max_of_div(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 max_of_div(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 max_of_div(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 max_of_div(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مثال: `max_of_div([20, 6, 34, 59, 23, 8, 43, -12, 9])` يجب أن تُرجع `34`.\nالجواب:", "qhash": "0739f9d058845a6c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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_sel([9, 75, 66, 81, 13, 30, 17]) == 3", "assert count_sel([-14]) == 0", "assert count_sel([34, -6, -40, 9, 29, -19, 50, 27, 88]) == 2", "assert count_sel([7]) == 0", "assert count_sel([25, -38, 69, -9, 23, 49, 20, -31, 46]) == 2", "assert count_sel([-36, 75, -5, 19, 44, -5, 52, -16, 21, 36, 4, -31]) == 2", "assert count_sel([]) == 0"], "test_code": "assert count_sel([9, 75, 66, 81, 13, 30, 17]) == 3\nassert count_sel([-14]) == 0\nassert count_sel([34, -6, -40, 9, 29, -19, 50, 27, 88]) == 2\nassert count_sel([7]) == 0\nassert count_sel([25, -38, 69, -9, 23, 49, 20, -31, 46]) == 2\nassert count_sel([-36, 75, -5, 19, 44, -5, 52, -16, 21, 36, 4, -31]) == 2\nassert count_sel([]) == 0", "answer": "def count_sel(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_sel(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_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_sel([9, 75, 66, 81, 13, 30, 17])` يُرجع `3`.\nالجواب:", "qhash": "b74ae3e5d72cb4f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'هشام': 44, 'سعيد': 12, 'سلمى': 32}\npoints['سلمى'] += 4\npoints['زينب'] = 56\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'هشام': 44, 'سعيد': 12, 'سلمى': 32}\npoints['سلمى'] += 4\npoints['زينب'] = 56\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('يوسف', -1))\n```\nالجواب:", "qhash": "de44714682c63233", "answer": "4\nزينب\n148\n-1", "completion": " الناتج:\n```text\n4\nزينب\n148\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('فجر فجر جمل مدينة معلم مدرسة') == 3", "assert prefix_hits('مدرسة برتقال قمر معلم') == 2", "assert prefix_hits('خبز نهر مدينة') == 1", "assert prefix_hits('باب خبز حديقة مطر سفينة معلم نور') == 2", "assert prefix_hits('برتقال طالب رمل') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('مدرسة شجرة') == 1\nassert prefix_hits('فجر فجر جمل مدينة معلم مدرسة') == 3\nassert prefix_hits('مدرسة برتقال قمر معلم') == 2\nassert prefix_hits('خبز نهر مدينة') == 1\nassert prefix_hits('باب خبز حديقة مطر سفينة معلم نور') == 2\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.split():\n if 'م' in w:\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 'م' in w:\n count += 1\n return count\n```\nمثال: `prefix_hits('مدرسة شجرة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "3f36b0082149de49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert total_pow(6) == 18200", "assert total_pow(0) == 0", "assert total_pow(12) == 485680", "assert total_pow(1) == 8", "assert total_pow(14) == 1021496", "assert total_pow(1) == 8", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 18200\nassert total_pow(0) == 0\nassert total_pow(12) == 485680\nassert total_pow(1) == 8\nassert total_pow(14) == 1021496\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 ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `total_pow(6)` يُرجع `18200`.\nالجواب:", "qhash": "93acc4bdc9b5878c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'code_brain'\nprint(name[-4:])\nprint(name[3:4])\nprint(name.index('b') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'code_brain'\nprint(name[-4:])\nprint(name[3:4])\nprint(name.index('b') + len(name))\n```\nالجواب:", "qhash": "80acad3398793fab", "answer": "rain\ne\n15", "completion": " الناتج:\n```text\nrain\ne\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 25:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([5, 1, 7, 12, 13]) == [5, 6, 13, 25, 0]", "assert rolling_total([25, -10, 17, 14, 15]) == [25, 15, 0, 14, 0]", "assert rolling_total([4, 20, 1, 13, 4, 19, 5]) == [4, 24, 25, 0, 4, 23, 0]", "assert rolling_total([11, -2, -7]) == [11, 9, 2]", "assert rolling_total([]) == []", "assert rolling_total([0, 23, -9, -8, 12, 8, -4, -5, -8]) == [0, 23, 14, 6, 18, 0, -4, -9, -17]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([5, 1, 7, 12, 13]) == [5, 6, 13, 25, 0]\nassert rolling_total([25, -10, 17, 14, 15]) == [25, 15, 0, 14, 0]\nassert rolling_total([4, 20, 1, 13, 4, 19, 5]) == [4, 24, 25, 0, 4, 23, 0]\nassert rolling_total([11, -2, -7]) == [11, 9, 2]\nassert rolling_total([]) == []\nassert rolling_total([0, 23, -9, -8, 12, 8, -4, -5, -8]) == [0, 23, 14, 6, 18, 0, -4, -9, -17]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 25:\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 > 25:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 25 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([5, 1, 7, 12, 13])` يُرجع `[5, 6, 13, 25, 0]`.\nالجواب:", "qhash": "1db007c88dd5c605"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(11) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon']", "assert fizz(15) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon', '12', '13', '14', 'Sun']", "assert fizz(9) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9']", "assert fizz(16) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon', '12', '13', '14', 'Sun', '16']", "assert fizz(0) == []"], "test_code": "assert fizz(11) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon']\nassert fizz(15) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon', '12', '13', '14', 'Sun']\nassert fizz(9) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9']\nassert fizz(16) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon', '12', '13', '14', 'Sun', '16']\nassert fizz(0) == []", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\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 += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(11)` يجب أن تُرجع `['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'Sun', 'Moon']`.\nالجواب:", "qhash": "2268a4ea2270f299"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 6) // 3 for x in range(-5, 0) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 6) // 3 for x in range(-5, 0) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "81a9057627b68f13", "answer": "[0, 1]\n2 1", "completion": " الناتج:\n```text\n[0, 1]\n2 1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert roll([46, 25, 26, 37]) == [26, 37, 46, 25]", "assert roll([41, 21, 22, 20, 2, 38, 49, 5, 43, 27, 23]) == [43, 27, 23, 41, 21, 22, 20, 2, 38, 49, 5]", "assert roll([22, 11, 25, 26, 14, 31, 32, 3, 26, -5, 49]) == [26, -5, 49, 22, 11, 25, 26, 14, 31, 32, 3]", "assert roll([36, -4, -6, 49, 44, 5, -8, 47, 29, 42, 21]) == [29, 42, 21, 36, -4, -6, 49, 44, 5, -8, 47]", "assert roll([47, 31, 30, -5, 25, 8, 4, 30, 37, 38]) == [4, 30, 37, 38, 47, 31, 30, -5, 25, 8]", "assert roll([38, 20, 45, 46, 28, 33, 44, 7, 1]) == [28, 33, 44, 7, 1, 38, 20, 45, 46]", "assert roll([]) == []"], "test_code": "assert roll([46, 25, 26, 37]) == [26, 37, 46, 25]\nassert roll([41, 21, 22, 20, 2, 38, 49, 5, 43, 27, 23]) == [43, 27, 23, 41, 21, 22, 20, 2, 38, 49, 5]\nassert roll([22, 11, 25, 26, 14, 31, 32, 3, 26, -5, 49]) == [26, -5, 49, 22, 11, 25, 26, 14, 31, 32, 3]\nassert roll([36, -4, -6, 49, 44, 5, -8, 47, 29, 42, 21]) == [29, 42, 21, 36, -4, -6, 49, 44, 5, -8, 47]\nassert roll([47, 31, 30, -5, 25, 8, 4, 30, 37, 38]) == [4, 30, 37, 38, 47, 31, 30, -5, 25, 8]\nassert roll([38, 20, 45, 46, 28, 33, 44, 7, 1]) == [28, 33, 44, 7, 1, 38, 20, 45, 46]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 14 % 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 = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nمثال: `roll([46, 25, 26, 37])` يجب أن تُرجع `[26, 37, 46, 25]`.\nالجواب:", "qhash": "0bde8fe85c325c63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 90) == 1)", "tests": ["assert rel_prime_count(104) == 28", "assert rel_prime_count(72) == 19", "assert rel_prime_count(18) == 5", "assert rel_prime_count(144) == 39", "assert rel_prime_count(52) == 14", "assert rel_prime_count(117) == 31", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(104) == 28\nassert rel_prime_count(72) == 19\nassert rel_prime_count(18) == 5\nassert rel_prime_count(144) == 39\nassert rel_prime_count(52) == 14\nassert rel_prime_count(117) == 31\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, 90) == 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, 90) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 90، أي أن القاسم المشترك الأكبر لها مع 90 يساوي 1.\nمثال: `rel_prime_count(104)` يجب أن تُرجع `28`.\nالجواب:", "qhash": "52fb90b187c5f82a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13']", "assert fizzbuzz(1) == ['1']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(0) == []", "assert fizzbuzz(2) == ['1', '2']"], "test_code": "assert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13']\nassert fizzbuzz(1) == ['1']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(0) == []\nassert fizzbuzz(2) == ['1', '2']", "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 % 10 == 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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 10 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(13)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13']`.\nالجواب:", "qhash": "2322072760663535"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'فيصل': 18, 'عمر': 21, 'سلمى': 25}\nd['سلمى'] += 9\nd['هدى'] = 37\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, 'عمر': 21, 'سلمى': 25}\nd['سلمى'] += 9\nd['هدى'] = 37\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": "4e76714945d75f71", "answer": "4\nهدى\n110\n[('فيصل', 18), ('عمر', 21)]", "completion": " الناتج:\n```text\n4\nهدى\n110\n[('فيصل', 18), ('عمر', 21)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 47", "tests": ["assert step_product(5) == 5", "assert step_product(57) == 29", "assert step_product(3) == 3", "assert step_product(17) == 28", "assert step_product(54) == 18", "assert step_product(21) == 24", "assert step_product(0) == 1"], "test_code": "assert step_product(5) == 5\nassert step_product(57) == 29\nassert step_product(3) == 3\nassert step_product(17) == 28\nassert step_product(54) == 18\nassert step_product(21) == 24\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 47", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(5)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "ee43a9949cc56fa1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('vector stone apple rocket by 2024') == 'qzxojm nojiz vkkgz mjxfzo wt 2024'", "assert encode('planet brain we') == 'kgvizo wmvdi rz'", "assert encode('it A1') == 'do A1'", "assert encode('orange banana by') == 'jmvibz wviviv wt'", "assert encode('camel light coffee up OK') == 'xvhzg gdbco xjaazz pk OK'", "assert encode('pixel Hello') == 'kdszg Hzggj'", "assert encode('') == ''"], "test_code": "assert encode('vector stone apple rocket by 2024') == 'qzxojm nojiz vkkgz mjxfzo wt 2024'\nassert encode('planet brain we') == 'kgvizo wmvdi rz'\nassert encode('it A1') == 'do A1'\nassert encode('orange banana by') == 'jmvibz wviviv wt'\nassert encode('camel light coffee up OK') == 'xvhzg gdbco xjaazz pk OK'\nassert encode('pixel Hello') == 'kdszg Hzggj'\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 + (21)) % 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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('vector stone apple rocket by 2024')` يُرجع `'qzxojm nojiz vkkgz mjxfzo wt 2024'`.\nالجواب:", "qhash": "e8f4f53b7c51e71e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 40) == 1)", "tests": ["assert count_gcd1(107) == 43", "assert count_gcd1(139) == 56", "assert count_gcd1(92) == 37", "assert count_gcd1(72) == 29", "assert count_gcd1(6) == 2", "assert count_gcd1(55) == 22", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(107) == 43\nassert count_gcd1(139) == 56\nassert count_gcd1(92) == 37\nassert count_gcd1(72) == 29\nassert count_gcd1(6) == 2\nassert count_gcd1(55) == 22\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, 40) == 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, 40) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 40) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(107)` يُرجع `43`.\nالجواب:", "qhash": "3e6eeebecc839a74"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([-4, 9, 17, -21]) == None", "assert top_divisible([-24, -48, -48]) == -24", "assert top_divisible([1, 13, 25]) == None", "assert top_divisible([-35, 29, -9, 10, -7, 20]) == None", "assert top_divisible([35, 4, 3, -32]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-4, 9, 17, -21]) == None\nassert top_divisible([-24, -48, -48]) == -24\nassert top_divisible([1, 13, 25]) == None\nassert top_divisible([-35, 29, -9, 10, -7, 20]) == None\nassert top_divisible([35, 4, 3, -32]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([-4, 9, 17, -21])` يُرجع `None`.\nالجواب:", "qhash": "327c02c7e49f5091"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 10 for x in range(2, 13) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 10 for x in range(2, 13) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a29ae08b9f16c3e4", "answer": "[-1, 15, 39, 71, 111]\n5 235", "completion": " الناتج:\n```text\n[-1, 15, 39, 71, 111]\n5 235\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(30) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26', '27', '28', '29', 'Fizz']", "assert play(19) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19']", "assert play(22) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz']", "assert play(25) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz']", "assert play(4) == ['1', '2', '3', '4']"], "test_code": "assert play(30) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26', '27', '28', '29', 'Fizz']\nassert play(19) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19']\nassert play(22) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz']\nassert play(25) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz']\nassert play(4) == ['1', '2', '3', '4']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Fizz'، وعلى 11 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(30)` يجب أن تُرجع `['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'Fizz', 'Buzz', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'Fizz', '21', 'Buzz', '23', '24', 'Fizz', '26', '27', '28', '29', 'Fizz']`.\nالجواب:", "qhash": "b78f9c6263b72907"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert only_div([21, 61, 16, 88, 3, 47, 89, 18, 67, 23, 67, 51]) == 1", "assert only_div([70, 74, 2, 56, 61, 22]) == 0", "assert only_div([71, 17, 88, 88, 58, 85]) == 0", "assert only_div([57, -18, 72, -34, 66, -14, 28, 27, -37]) == 3", "assert only_div([-19, 12, -1, -16, -3, 59, -1, -1, -33]) == 1", "assert only_div([81, 49, -25, 89, 1, -39, 85, 84, 72, -38, 37, 39]) == 2", "assert only_div([]) == 0"], "test_code": "assert only_div([21, 61, 16, 88, 3, 47, 89, 18, 67, 23, 67, 51]) == 1\nassert only_div([70, 74, 2, 56, 61, 22]) == 0\nassert only_div([71, 17, 88, 88, 58, 85]) == 0\nassert only_div([57, -18, 72, -34, 66, -14, 28, 27, -37]) == 3\nassert only_div([-19, 12, -1, -16, -3, 59, -1, -1, -33]) == 1\nassert only_div([81, 49, -25, 89, 1, -39, 85, 84, 72, -38, 37, 39]) == 2\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([21, 61, 16, 88, 3, 47, 89, 18, 67, 23, 67, 51])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "6edaab154afb758c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 2\n return total", "tests": ["assert scaled_powers(7) == 1400", "assert scaled_powers(5) == 550", "assert scaled_powers(8) == 2040", "assert scaled_powers(4) == 300", "assert scaled_powers(0) == 0", "assert scaled_powers(1) == 10", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 1400\nassert scaled_powers(5) == 550\nassert scaled_powers(8) == 2040\nassert scaled_powers(4) == 300\nassert scaled_powers(0) == 0\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 ** 2\n return total", "completion": " ```python\ndef scaled_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 scaled_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 scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 10 * i ** 2\n return total\n```\nمثال: `scaled_powers(7)` يجب أن تُرجع `1400`.\nالجواب:", "qhash": "320d3131191f15d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 8 * x ** 2 + (6) * x + (3)", "tests": ["assert value_at(2) == 47", "assert value_at(-3) == 57", "assert value_at(9) == 705", "assert value_at(-19) == 2777", "assert value_at(-6) == 255", "assert value_at(-1) == 5", "assert value_at(-6) == 255", "assert value_at(0) == 3"], "test_code": "assert value_at(2) == 47\nassert value_at(-3) == 57\nassert value_at(9) == 705\nassert value_at(-19) == 2777\nassert value_at(-6) == 255\nassert value_at(-1) == 5\nassert value_at(-6) == 255\nassert value_at(0) == 3", "answer": "def value_at(x):\n return 8 * x ** 2 + (6) * x + (3)", "completion": " ```python\ndef value_at(x):\n return 8 * x ** 2 + (6) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 8x² + 6x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(2)` يُرجع `47`.\nالجواب:", "qhash": "c04fc7fa8119e9ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47", "tests": ["assert fact_mod(8) == 33", "assert fact_mod(54) == 29", "assert fact_mod(31) == 20", "assert fact_mod(41) == 30", "assert fact_mod(12) == 17", "assert fact_mod(52) == 30", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(8) == 33\nassert fact_mod(54) == 29\nassert fact_mod(31) == 20\nassert fact_mod(41) == 30\nassert fact_mod(12) == 17\nassert fact_mod(52) == 30\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(8)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "e0bb32467aa305c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'hnsu'}", "tests": ["assert tally('planet') == {'h': 0, 'n': 1, 's': 0, 'u': 0}", "assert tally('stone matrix at') == {'h': 0, 'n': 1, 's': 1, 'u': 0}", "assert tally('is we in orange light we') == {'h': 1, 'n': 2, 's': 1, 'u': 0}", "assert tally('matrix light') == {'h': 1, 'n': 0, 's': 0, 'u': 0}", "assert tally('summer') == {'h': 0, 'n': 0, 's': 1, 'u': 1}", "assert tally('garden river an') == {'h': 0, 'n': 2, 's': 0, 'u': 0}", "assert tally('') == {'h': 0, 'n': 0, 's': 0, 'u': 0}"], "test_code": "assert tally('planet') == {'h': 0, 'n': 1, 's': 0, 'u': 0}\nassert tally('stone matrix at') == {'h': 0, 'n': 1, 's': 1, 'u': 0}\nassert tally('is we in orange light we') == {'h': 1, 'n': 2, 's': 1, 'u': 0}\nassert tally('matrix light') == {'h': 1, 'n': 0, 's': 0, 'u': 0}\nassert tally('summer') == {'h': 0, 'n': 0, 's': 1, 'u': 1}\nassert tally('garden river an') == {'h': 0, 'n': 2, 's': 0, 'u': 0}\nassert tally('') == {'h': 0, 'n': 0, 's': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'hnsu'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'hnsu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 'n'، 's'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('planet')` يجب أن تُرجع `{'h': 0, 'n': 1, 's': 0, 'u': 0}`.\nالجواب:", "qhash": "2f0f839d5192f754"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'ai'}", "tests": ["assert char_counts('coffee stone python of signal') == {'a': 1, 'i': 1}", "assert char_counts('of python to window table') == {'a': 1, 'i': 1}", "assert char_counts('it signal is go up') == {'a': 1, 'i': 3}", "assert char_counts('brain') == {'a': 1, 'i': 1}", "assert char_counts('music brain data by') == {'a': 3, 'i': 2}", "assert char_counts('vector') == {'a': 0, 'i': 0}", "assert char_counts('') == {'a': 0, 'i': 0}"], "test_code": "assert char_counts('coffee stone python of signal') == {'a': 1, 'i': 1}\nassert char_counts('of python to window table') == {'a': 1, 'i': 1}\nassert char_counts('it signal is go up') == {'a': 1, 'i': 3}\nassert char_counts('brain') == {'a': 1, 'i': 1}\nassert char_counts('music brain data by') == {'a': 3, 'i': 2}\nassert char_counts('vector') == {'a': 0, 'i': 0}\nassert char_counts('') == {'a': 0, 'i': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'ai'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'ai'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'i' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('coffee stone python of signal')` يجب أن تُرجع `{'a': 1, 'i': 1}`.\nالجواب:", "qhash": "a58bb2527f05b3e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('music camel cloud in') == 'cloud_camel_music'", "assert words_reversed('on light a vector pixel') == 'pixel_vector_light'", "assert words_reversed('apple table winter apple') == 'apple_winter_table_apple'", "assert words_reversed('is planet coffee garden by to window garden') == 'garden_window_garden_coffee_planet'", "assert words_reversed('light') == 'light'", "assert words_reversed('up rocket an cloud') == 'cloud_rocket'", "assert words_reversed('in up falcon code') == 'code_falcon'"], "test_code": "assert words_reversed('music camel cloud in') == 'cloud_camel_music'\nassert words_reversed('on light a vector pixel') == 'pixel_vector_light'\nassert words_reversed('apple table winter apple') == 'apple_winter_table_apple'\nassert words_reversed('is planet coffee garden by to window garden') == 'garden_window_garden_coffee_planet'\nassert words_reversed('light') == 'light'\nassert words_reversed('up rocket an cloud') == 'cloud_rocket'\nassert words_reversed('in up falcon code') == 'code_falcon'", "answer": "def words_reversed(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `words_reversed('music camel cloud in')` يُرجع `'cloud_camel_music'`.\nالجواب:", "qhash": "2ae93dd778e112d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(785731237))\nprint(f(f(785731237)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(785731237))\nprint(f(f(785731237)))\n```\nالجواب:", "qhash": "2e8ad6d90636c577", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert multiples_total(141) == 1839", "assert multiples_total(91) == 891", "assert multiples_total(236) == 5403", "assert multiples_total(230) == 4938", "assert multiples_total(249) == 5888", "assert multiples_total(161) == 2433", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(141) == 1839\nassert multiples_total(91) == 891\nassert multiples_total(236) == 5403\nassert multiples_total(230) == 4938\nassert multiples_total(249) == 5888\nassert multiples_total(161) == 2433\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 11.\nمثال: `multiples_total(141)` يجب أن تُرجع `1839`.\nالجواب:", "qhash": "496968254f153a84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.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('تفاحة سماء نهار عربية مكتبة لغة') == 0", "assert count_prefix('جبل سماء علم') == 0", "assert count_prefix('كتاب ليل طائرة كتاب حصان خبز') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('كتاب مكتبة بيت ماء مطر') == 1\nassert count_prefix('كتاب جبل خبز حصان سوق صحراء') == 1\nassert count_prefix('حاسوب قمر شجرة طالب') == 0\nassert count_prefix('تفاحة سماء نهار عربية مكتبة لغة') == 0\nassert count_prefix('جبل سماء علم') == 0\nassert count_prefix('كتاب ليل طائرة كتاب حصان خبز') == 2\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ك'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s.split():\n if w.endswith('ك'):\n count += 1\n return count\n```\nمثال: `count_prefix('كتاب مكتبة بيت ماء مطر')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d0824bc7ebd84d2e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('stone rocket pixel') == 'pixel/rocket/stone'", "assert flip_words('python music pixel it matrix planet a planet') == 'planet/planet/matrix/it/pixel/music/python'", "assert flip_words('table') == 'table'", "assert flip_words('at coffee we planet stone') == 'stone/planet/we/coffee/at'", "assert flip_words('matrix pixel') == 'pixel/matrix'", "assert flip_words('falcon to') == 'to/falcon'", "assert flip_words('engine on python summer orange of') == 'of/orange/summer/python/on/engine'"], "test_code": "assert flip_words('stone rocket pixel') == 'pixel/rocket/stone'\nassert flip_words('python music pixel it matrix planet a planet') == 'planet/planet/matrix/it/pixel/music/python'\nassert flip_words('table') == 'table'\nassert flip_words('at coffee we planet stone') == 'stone/planet/we/coffee/at'\nassert flip_words('matrix pixel') == 'pixel/matrix'\nassert flip_words('falcon to') == 'to/falcon'\nassert flip_words('engine on python summer orange of') == 'of/orange/summer/python/on/engine'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `flip_words('stone rocket pixel')` يُرجع `'pixel/rocket/stone'`.\nالجواب:", "qhash": "63861303cd69bf05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=5):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(-7))\nprint(compute(-7, -9))\nprint(compute(compute(-9), -7))", "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(-7))\nprint(compute(-7, -9))\nprint(compute(compute(-9), -7))\n```\nالجواب:", "qhash": "dce84dc49d9d4ac0", "answer": "8\n-12\n25", "completion": " الناتج:\n```text\n8\n-12\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('code go brain vector window') == 'window|vector'", "assert rev_long_words('camel stone falcon coffee engine garden up an') == 'garden|engine|coffee|falcon'", "assert rev_long_words('go of falcon rocket') == 'rocket|falcon'", "assert rev_long_words('garden garden signal apple') == 'signal|garden|garden'", "assert rev_long_words('in coffee') == 'coffee'", "assert rev_long_words('we cloud of') == ''", "assert rev_long_words('a banana code is apple an light') == 'banana'"], "test_code": "assert rev_long_words('code go brain vector window') == 'window|vector'\nassert rev_long_words('camel stone falcon coffee engine garden up an') == 'garden|engine|coffee|falcon'\nassert rev_long_words('go of falcon rocket') == 'rocket|falcon'\nassert rev_long_words('garden garden signal apple') == 'signal|garden|garden'\nassert rev_long_words('in coffee') == 'coffee'\nassert rev_long_words('we cloud of') == ''\nassert rev_long_words('a banana code is apple an light') == '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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_long_words('code go brain vector window')` يُرجع `'window|vector'`.\nالجواب:", "qhash": "adaa854127131d77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('is go brain to signal on') == 'signal'", "assert rev_join('') == ''", "assert rev_join('go table') == ''", "assert rev_join('in is up') == ''", "assert rev_join('orange we banana rocket engine') == 'engine_rocket_banana_orange'", "assert rev_join('we in is cloud data') == ''", "assert rev_join('camel window data') == 'window'"], "test_code": "assert rev_join('is go brain to signal on') == 'signal'\nassert rev_join('') == ''\nassert rev_join('go table') == ''\nassert rev_join('in is up') == ''\nassert rev_join('orange we banana rocket engine') == 'engine_rocket_banana_orange'\nassert rev_join('we in is cloud data') == ''\nassert rev_join('camel window data') == 'window'", "answer": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `rev_join('is go brain to signal on')` يجب أن تُرجع `'signal'`.\nالجواب:", "qhash": "31333cc0992502af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 11) == 1)", "tests": ["assert rel_prime_count(26) == 24", "assert rel_prime_count(0) == 0", "assert rel_prime_count(64) == 59", "assert rel_prime_count(135) == 123", "assert rel_prime_count(198) == 180", "assert rel_prime_count(117) == 107", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(26) == 24\nassert rel_prime_count(0) == 0\nassert rel_prime_count(64) == 59\nassert rel_prime_count(135) == 123\nassert rel_prime_count(198) == 180\nassert rel_prime_count(117) == 107\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, 11) == 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, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 11، أي أن القاسم المشترك الأكبر لها مع 11 يساوي 1.\nمثال: `rel_prime_count(26)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "5730b9d63655691a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'signal_data'\nprint(word.find('a'))\nprint(word.split('_'))\nprint(word.count('a'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'signal_data'\nprint(word.find('a'))\nprint(word.split('_'))\nprint(word.count('a'))\n```\nالجواب:", "qhash": "350e8f0123867e97", "answer": "4\n['signal', 'data']\n3", "completion": " الناتج:\n```text\n4\n['signal', 'data']\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [5, 9, -2, 17, 2, 30, 15]\nprint(a[0:7])\nprint(a[::-2])\nprint(min(a[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [5, 9, -2, 17, 2, 30, 15]\nprint(a[0:7])\nprint(a[::-2])\nprint(min(a[0:7]))\n```\nالجواب:", "qhash": "20eef98159a2a84a", "answer": "[5, 9, -2, 17, 2, 30, 15]\n[15, 2, -2, 5]\n-2", "completion": " الناتج:\n```text\n[5, 9, -2, 17, 2, 30, 15]\n[15, 2, -2, 5]\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'orange_vector'\nprint(s.replace('r', '*'))\nprint(s.count('r'))\nprint(s.find('r'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'orange_vector'\nprint(s.replace('r', '*'))\nprint(s.count('r'))\nprint(s.find('r'))\n```\nالجواب:", "qhash": "7c9d24823bfefa87", "answer": "o*ange_vecto*\n2\n1", "completion": " الناتج:\n```text\no*ange_vecto*\n2\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'فيصل': 41, 'هشام': 11, 'أحمد': 26}\nscores['فيصل'] += 12\nscores['هدى'] = 16\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, 'هشام': 11, 'أحمد': 26}\nscores['فيصل'] += 12\nscores['هدى'] = 16\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": "0bfdc6ab658e75c1", "answer": "4\nفيصل\n106\n[('هشام', 11), ('هدى', 16)]", "completion": " الناتج:\n```text\n4\nفيصل\n106\n[('هشام', 11), ('هدى', 16)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'ليلى': 2, 'سعيد': 29, 'هدى': 21, 'زينب': 3}\nmarks['ليلى'] += 2\nmarks['رنا'] = 37\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 = {'ليلى': 2, 'سعيد': 29, 'هدى': 21, 'زينب': 3}\nmarks['ليلى'] += 2\nmarks['رنا'] = 37\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": "8497860ba480ae1f", "answer": "5\nرنا\n94\n[('زينب', 3), ('ليلى', 4)]", "completion": " الناتج:\n```text\n5\nرنا\n94\n[('زينب', 3), ('ليلى', 4)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 190:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([17, 76, 3, 47, 25, 32]) == [17, 93, 96, 143, 168, 0]", "assert rolling_total([134]) == [134]", "assert rolling_total([99, 33, 81, 8, 178, 121, 173, 15]) == [99, 132, 0, 8, 186, 0, 173, 188]", "assert rolling_total([10]) == [10]", "assert rolling_total([21, 10, 121, 112]) == [21, 31, 152, 0]", "assert rolling_total([]) == []", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([17, 76, 3, 47, 25, 32]) == [17, 93, 96, 143, 168, 0]\nassert rolling_total([134]) == [134]\nassert rolling_total([99, 33, 81, 8, 178, 121, 173, 15]) == [99, 132, 0, 8, 186, 0, 173, 188]\nassert rolling_total([10]) == [10]\nassert rolling_total([21, 10, 121, 112]) == [21, 31, 152, 0]\nassert rolling_total([]) == []\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 190:\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 > 190:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 190 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([17, 76, 3, 47, 25, 32])` يُرجع `[17, 93, 96, 143, 168, 0]`.\nالجواب:", "qhash": "514448725f35ac5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'علي': 25, 'زينب': 40, 'ليلى': 48, 'فيصل': 26}\nmarks['زينب'] += 7\nmarks['حسن'] = 49\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 23])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'علي': 25, 'زينب': 40, 'ليلى': 48, 'فيصل': 26}\nmarks['زينب'] += 7\nmarks['حسن'] = 49\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 23])\n```\nالجواب:", "qhash": "745852055d0d0957", "answer": "5\nحسن\n195\n['علي', 'زينب', 'ليلى', 'فيصل', 'حسن']", "completion": " الناتج:\n```text\n5\nحسن\n195\n['علي', 'زينب', 'ليلى', 'فيصل', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 35) == 1)", "tests": ["assert rel_prime_count(97) == 67", "assert rel_prime_count(143) == 99", "assert rel_prime_count(8) == 6", "assert rel_prime_count(143) == 99", "assert rel_prime_count(0) == 0", "assert rel_prime_count(60) == 41", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(97) == 67\nassert rel_prime_count(143) == 99\nassert rel_prime_count(8) == 6\nassert rel_prime_count(143) == 99\nassert rel_prime_count(0) == 0\nassert rel_prime_count(60) == 41\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, 35) == 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, 35) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 35، أي أن القاسم المشترك الأكبر لها مع 35 يساوي 1.\nمثال: `rel_prime_count(97)` يجب أن تُرجع `67`.\nالجواب:", "qhash": "e57e68df6cae3970"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'grt'}", "tests": ["assert count_chars('at is it summer in') == {'g': 0, 'r': 1, 't': 2}", "assert count_chars('winter orange music') == {'g': 1, 'r': 2, 't': 1}", "assert count_chars('planet light cloud stone') == {'g': 1, 'r': 0, 't': 3}", "assert count_chars('it music brain orange') == {'g': 1, 'r': 2, 't': 1}", "assert count_chars('orange') == {'g': 1, 'r': 1, 't': 0}", "assert count_chars('music go') == {'g': 1, 'r': 0, 't': 0}", "assert count_chars('') == {'g': 0, 'r': 0, 't': 0}"], "test_code": "assert count_chars('at is it summer in') == {'g': 0, 'r': 1, 't': 2}\nassert count_chars('winter orange music') == {'g': 1, 'r': 2, 't': 1}\nassert count_chars('planet light cloud stone') == {'g': 1, 'r': 0, 't': 3}\nassert count_chars('it music brain orange') == {'g': 1, 'r': 2, 't': 1}\nassert count_chars('orange') == {'g': 1, 'r': 1, 't': 0}\nassert count_chars('music go') == {'g': 1, 'r': 0, 't': 0}\nassert count_chars('') == {'g': 0, 'r': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'grt'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'grt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'r'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('at is it summer in')` يُرجع `{'g': 0, 'r': 1, 't': 2}`.\nالجواب:", "qhash": "0b630ba099abc76b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "tests": ["assert sum_multiples(148) == 2175", "assert sum_multiples(164) == 2640", "assert sum_multiples(186) == 3515", "assert sum_multiples(183) == 3330", "assert sum_multiples(170) == 2805", "assert sum_multiples(220) == 4730", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(148) == 2175\nassert sum_multiples(164) == 2640\nassert sum_multiples(186) == 3515\nassert sum_multiples(183) == 3330\nassert sum_multiples(170) == 2805\nassert sum_multiples(220) == 4730\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 % 10 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 10.\nمثال: `sum_multiples(148)` يجب أن تُرجع `2175`.\nالجواب:", "qhash": "40cef35c1563cae6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'وليد': 1, 'عمر': 17, 'نور': 48, 'باسل': 2, 'زينب': 24}\nscores['عمر'] += 14\nscores['فيصل'] = 39\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 12])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'وليد': 1, 'عمر': 17, 'نور': 48, 'باسل': 2, 'زينب': 24}\nscores['عمر'] += 14\nscores['فيصل'] = 39\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 12])\n```\nالجواب:", "qhash": "da3d675f58bf5841", "answer": "6\nنور\n145\n['عمر', 'نور', 'زينب', 'فيصل']", "completion": " الناتج:\n```text\n6\nنور\n145\n['عمر', 'نور', 'زينب', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(12) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo']", "assert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23']", "assert fizzbuzz(16) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23', 'Foo', '25']", "assert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23']"], "test_code": "assert fizzbuzz(12) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo']\nassert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23']\nassert fizzbuzz(16) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23', 'Foo', '25']\nassert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21', 'Bar', '23']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\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 % 6 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Foo'، وعلى 11 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(12)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo']`.\nالجواب:", "qhash": "7a2da2557d6202d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 34)", "tests": ["assert pick_between([35, 38, 25, 9, 27, 32, 27, 19, 27]) == [76, 100, 108, 108, 108, 128]", "assert pick_between([49, -14]) == []", "assert pick_between([50, -5, 41, 32, -21, 39, 58]) == [128]", "assert pick_between([]) == []", "assert pick_between([7, -19, 59, 22, 58, 8, -16, 11]) == [88]", "assert pick_between([0, -16, 23, -2, -7, 22, 57, 26, 49]) == [88, 92, 104]", "assert pick_between([31, 37, 25, -30, -23, 57, -1, 4]) == [100, 124]", "assert pick_between([]) == []"], "test_code": "assert pick_between([35, 38, 25, 9, 27, 32, 27, 19, 27]) == [76, 100, 108, 108, 108, 128]\nassert pick_between([49, -14]) == []\nassert pick_between([50, -5, 41, 32, -21, 39, 58]) == [128]\nassert pick_between([]) == []\nassert pick_between([7, -19, 59, 22, 58, 8, -16, 11]) == [88]\nassert pick_between([0, -16, 23, -2, -7, 22, 57, 26, 49]) == [88, 92, 104]\nassert pick_between([31, 37, 25, -30, -23, 57, -1, 4]) == [100, 124]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 34)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 34)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 18 و34 (شاملًا الطرفين) في 4.\nمثال: `pick_between([35, 38, 25, 9, 27, 32, 27, 19, 27])` يجب أن تُرجع `[76, 100, 108, 108, 108, 128]`.\nالجواب:", "qhash": "1060929eb9fcc0a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert play(10) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10']", "assert play(15) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15']", "assert play(17) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17']", "assert play(8) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping']", "assert play(12) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong']"], "test_code": "assert play(10) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10']\nassert play(15) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15']\nassert play(17) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong', '13', '14', '15', 'Ping', '17']\nassert play(8) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping']\nassert play(12) == ['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10', '11', 'PingPong']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 6 == 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 % 4 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Ping'، وإن قَبِلها على 6 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(10)` يُرجع `['1', '2', '3', 'Ping', '5', 'Pong', '7', 'Ping', '9', '10']`.\nالجواب:", "qhash": "9a001025affbc30e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['code', 'window', 'banana', 'garden', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['code', 'window', 'banana', 'garden', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "4c1c2d3d6101947b", "answer": "['code', 'window', 'banana', 'garden', 'planet']\n['window', 'planet', 'garden']", "completion": " الناتج:\n```text\n['code', 'window', 'banana', 'garden', 'planet']\n['window', 'planet', 'garden']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'منى': 21, 'نور': 42, 'هشام': 31, 'حسن': 9}\npoints['حسن'] += 18\npoints['راشد'] = 34\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 38])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'منى': 21, 'نور': 42, 'هشام': 31, 'حسن': 9}\npoints['حسن'] += 18\npoints['راشد'] = 34\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 38])\n```\nالجواب:", "qhash": "d8edcee560d3c57e", "answer": "5\nنور\n155\n['نور']", "completion": " الناتج:\n```text\n5\nنور\n155\n['نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "tests": ["assert add_multiples(273) == 11345", "assert add_multiples(280) == 11620", "assert add_multiples(277) == 11620", "assert add_multiples(49) == 353", "assert add_multiples(249) == 9253", "assert add_multiples(258) == 10014", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(273) == 11345\nassert add_multiples(280) == 11620\nassert add_multiples(277) == 11620\nassert add_multiples(49) == 353\nassert add_multiples(249) == 9253\nassert add_multiples(258) == 10014\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 8.\nمثال: `add_multiples(273)` يجب أن تُرجع `11345`.\nالجواب:", "qhash": "d0c3a732929ab695"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('عمر', 6), ('يوسف', 89), ('راشد', 1), ('هدى', 3)]\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 = [('عمر', 6), ('يوسف', 89), ('راشد', 1), ('هدى', 3)]\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": "9741429f1ff132b3", "answer": "[('راشد', 1), ('هدى', 3), ('عمر', 6), ('يوسف', 89)]\n['يوسف', 'عمر']", "completion": " الناتج:\n```text\n[('راشد', 1), ('هدى', 3), ('عمر', 6), ('يوسف', 89)]\n['يوسف', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 15", "tests": ["assert digits_mod(52287) == 11", "assert digits_mod(381573) == 7", "assert digits_mod(419741) == 14", "assert digits_mod(293134) == 0", "assert digits_mod(690927) == 11", "assert digits_mod(718002) == 13", "assert digits_mod(243815) == 14", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(52287) == 11\nassert digits_mod(381573) == 7\nassert digits_mod(419741) == 14\nassert digits_mod(293134) == 0\nassert digits_mod(690927) == 11\nassert digits_mod(718002) == 13\nassert digits_mod(243815) == 14\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 15", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 15\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 15.\nمثال: `digits_mod(52287)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "e3002f0200483ff3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -5 * x ** 2 + (-1) * x + (-6)", "tests": ["assert p(2) == -28", "assert p(-13) == -838", "assert p(2) == -28", "assert p(0) == -6", "assert p(-4) == -82", "assert p(3) == -54", "assert p(14) == -1000", "assert p(0) == -6"], "test_code": "assert p(2) == -28\nassert p(-13) == -838\nassert p(2) == -28\nassert p(0) == -6\nassert p(-4) == -82\nassert p(3) == -54\nassert p(14) == -1000\nassert p(0) == -6", "answer": "def p(x):\n return -5 * x ** 2 + (-1) * x + (-6)", "completion": " ```python\ndef p(x):\n return -5 * x ** 2 + (-1) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -5x² - 1x - 6 عند العدد الصحيح x.\nمثال: `p(2)` يجب أن تُرجع `-28`.\nالجواب:", "qhash": "5354b59cd50d2675"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([37, 60, -1, 60, -6, 22, 10, -17, 23]) == None", "assert top_divisible([-24, -40, -8]) == -8", "assert top_divisible([1, 9, 17]) == None", "assert top_divisible([0, -19, 24, -18, 6, -15, -29]) == 24", "assert top_divisible([26, -44, 1, 45, 34]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([37, 60, -1, 60, -6, 22, 10, -17, 23]) == None\nassert top_divisible([-24, -40, -8]) == -8\nassert top_divisible([1, 9, 17]) == None\nassert top_divisible([0, -19, 24, -18, 6, -15, -29]) == 24\nassert top_divisible([26, -44, 1, 45, 34]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(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مثال: `top_divisible([37, 60, -1, 60, -6, 22, 10, -17, 23])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "150600f38b5334a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['signal', 'code', 'music', 'falcon', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['signal', 'code', 'music', 'falcon', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "d3e6d26e40726e7c", "answer": "['code', 'music', 'signal', 'falcon', 'desert']\n['signal', 'falcon', 'desert']", "completion": " الناتج:\n```text\n['code', 'music', 'signal', 'falcon', 'desert']\n['signal', 'falcon', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(24) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', 'Pong']", "assert game(22) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22']", "assert game(7) == ['1', '2', '3', '4', 'Ping', 'Pong', '7']", "assert game(20) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping']", "assert game(4) == ['1', '2', '3', '4']"], "test_code": "assert game(24) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', 'Pong']\nassert game(22) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22']\nassert game(7) == ['1', '2', '3', '4', 'Ping', 'Pong', '7']\nassert game(20) == ['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping']\nassert game(4) == ['1', '2', '3', '4']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\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 % 5 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Ping'، وعلى 6 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(24)` يجب أن تُرجع `['1', '2', '3', '4', 'Ping', 'Pong', '7', '8', '9', 'Ping', '11', 'Pong', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', 'Pong']`.\nالجواب:", "qhash": "dd686ec3a2695d85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'light'\nprint(s[::-1])\nprint(len(s))\nprint(s.replace('h', 'X'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'light'\nprint(s[::-1])\nprint(len(s))\nprint(s.replace('h', 'X'))\n```\nالجواب:", "qhash": "28b935384ecd067c", "answer": "thgil\n5\nligXt", "completion": " الناتج:\n```text\nthgil\n5\nligXt\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(12))\nprint(g(12, 4))\nprint(g(g(4), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(g(12))\nprint(g(12, 4))\nprint(g(g(4), 12))\n```\nالجواب:", "qhash": "7e44117fe7b9dcb8", "answer": "-37\n-40\n-49", "completion": " الناتج:\n```text\n-37\n-40\n-49\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(6) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz']", "assert play(20) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz']", "assert play(1) == ['1']", "assert play(23) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23']", "assert play(23) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23']"], "test_code": "assert play(6) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz']\nassert play(20) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz']\nassert play(1) == ['1']\nassert play(23) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23']\nassert play(23) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz', '17', 'Fizz', '19', 'FizzBuzz', '21', 'Fizz', '23']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 5 == 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 % 2 == 0:\n s += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Fizz'، وإن قَبِلها على 5 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(6)` يُرجع `['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz']`.\nالجواب:", "qhash": "debc68cf049b3b13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('نهار خبز مدرسة طالب وردة') == 1", "assert count_start('رمل نهار قلم كتاب وردة وردة') == 2", "assert count_start('وردة قهوة برتقال وردة مكتبة وردة') == 3", "assert count_start('شمس سيارة مدرسة سفينة بحر') == 0", "assert count_start('باب جبل مدينة كتاب وردة جبل') == 1", "assert count_start('سماء وردة ليل شجرة ميناء') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('نهار خبز مدرسة طالب وردة') == 1\nassert count_start('رمل نهار قلم كتاب وردة وردة') == 2\nassert count_start('وردة قهوة برتقال وردة مكتبة وردة') == 3\nassert count_start('شمس سيارة مدرسة سفينة بحر') == 0\nassert count_start('باب جبل مدينة كتاب وردة جبل') == 1\nassert count_start('سماء وردة ليل شجرة ميناء') == 1\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.split():\n if 'و' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «و». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_start(text):\n count = 0\n for w in text.split():\n if 'و' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('نهار خبز مدرسة طالب وردة')` يُرجع `1`.\nالجواب:", "qhash": "a0995e75968c3525"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_by([37, 31, 14, 15, 18, 42]) == [37, 31, 14, 15, 18, 42]", "assert rotate_by([43, 35, 17, 14, 5, 22, 23, 46, 15, 1]) == [17, 14, 5, 22, 23, 46, 15, 1, 43, 35]", "assert rotate_by([3, -3]) == [3, -3]", "assert rotate_by([-6, 27, 36, -9, 38, 13, 22]) == [-9, 38, 13, 22, -6, 27, 36]", "assert rotate_by([27, 48, 39, 19, 24, 40, 19, 39, 9]) == [27, 48, 39, 19, 24, 40, 19, 39, 9]", "assert rotate_by([27, 33, -3, -4, 30, -1]) == [27, 33, -3, -4, 30, -1]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([37, 31, 14, 15, 18, 42]) == [37, 31, 14, 15, 18, 42]\nassert rotate_by([43, 35, 17, 14, 5, 22, 23, 46, 15, 1]) == [17, 14, 5, 22, 23, 46, 15, 1, 43, 35]\nassert rotate_by([3, -3]) == [3, -3]\nassert rotate_by([-6, 27, 36, -9, 38, 13, 22]) == [-9, 38, 13, 22, -6, 27, 36]\nassert rotate_by([27, 48, 39, 19, 24, 40, 19, 39, 9]) == [27, 48, 39, 19, 24, 40, 19, 39, 9]\nassert rotate_by([27, 33, -3, -4, 30, -1]) == [27, 33, -3, -4, 30, -1]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([37, 31, 14, 15, 18, 42])` يُرجع `[37, 31, 14, 15, 18, 42]`.\nالجواب:", "qhash": "36ab19907efe6d9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 53", "tests": ["assert rec_prod(9) == 42", "assert rec_prod(11) == 9", "assert rec_prod(4) == 24", "assert rec_prod(15) == 1", "assert rec_prod(11) == 9", "assert rec_prod(18) == 20", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(9) == 42\nassert rec_prod(11) == 9\nassert rec_prod(4) == 24\nassert rec_prod(15) == 1\nassert rec_prod(11) == 9\nassert rec_prod(18) == 20\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 53", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(9)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "20e598d8e5df28a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bd'}", "tests": ["assert freq_of('summer falcon in matrix by winter') == {'b': 1, 'd': 0}", "assert freq_of('rocket garden we rocket planet light') == {'b': 0, 'd': 1}", "assert freq_of('camel') == {'b': 0, 'd': 0}", "assert freq_of('code banana cloud it we') == {'b': 1, 'd': 2}", "assert freq_of('falcon on we banana winter data') == {'b': 1, 'd': 1}", "assert freq_of('code rocket planet to table up') == {'b': 1, 'd': 1}", "assert freq_of('') == {'b': 0, 'd': 0}"], "test_code": "assert freq_of('summer falcon in matrix by winter') == {'b': 1, 'd': 0}\nassert freq_of('rocket garden we rocket planet light') == {'b': 0, 'd': 1}\nassert freq_of('camel') == {'b': 0, 'd': 0}\nassert freq_of('code banana cloud it we') == {'b': 1, 'd': 2}\nassert freq_of('falcon on we banana winter data') == {'b': 1, 'd': 1}\nassert freq_of('code rocket planet to table up') == {'b': 1, 'd': 1}\nassert freq_of('') == {'b': 0, 'd': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bd'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bd'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'd' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('summer falcon in matrix by winter')` يُرجع `{'b': 1, 'd': 0}`.\nالجواب:", "qhash": "24d958db0a39bab1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "invert_words", "reference": "def invert_words(s):\n return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert invert_words('code falcon engine stone banana') == 'banana,stone,engine,falcon,code'", "assert invert_words('up matrix') == 'matrix'", "assert invert_words('to') == ''", "assert invert_words('to banana desert table music we') == 'music,table,desert,banana'", "assert invert_words('pixel camel apple engine vector up signal winter') == 'winter,signal,vector,engine,apple,camel,pixel'", "assert invert_words('an') == ''", "assert invert_words('brain code by garden cloud engine') == 'engine,cloud,garden,code,brain'"], "test_code": "assert invert_words('code falcon engine stone banana') == 'banana,stone,engine,falcon,code'\nassert invert_words('up matrix') == 'matrix'\nassert invert_words('to') == ''\nassert invert_words('to banana desert table music we') == 'music,table,desert,banana'\nassert invert_words('pixel camel apple engine vector up signal winter') == 'winter,signal,vector,engine,apple,camel,pixel'\nassert invert_words('an') == ''\nassert invert_words('brain code by garden cloud engine') == 'engine,cloud,garden,code,brain'", "answer": "def invert_words(s):\n return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef invert_words(s):\n return ','.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `invert_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `invert_words('code falcon engine stone banana')` يجب أن تُرجع `'banana,stone,engine,falcon,code'`.\nالجواب:", "qhash": "09ff1b65db2defc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 5", "tests": ["assert dig_pow_mod(28866) == 0", "assert dig_pow_mod(196537) == 1", "assert dig_pow_mod(571861) == 3", "assert dig_pow_mod(844933) == 1", "assert dig_pow_mod(374631) == 4", "assert dig_pow_mod(578398) == 0", "assert dig_pow_mod(145655) == 1", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(28866) == 0\nassert dig_pow_mod(196537) == 1\nassert dig_pow_mod(571861) == 3\nassert dig_pow_mod(844933) == 1\nassert dig_pow_mod(374631) == 4\nassert dig_pow_mod(578398) == 0\nassert dig_pow_mod(145655) == 1\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 5", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 5.\nمثال: `dig_pow_mod(28866)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e0c45ab962ad2f78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'سلمى': 2, 'حسن': 45, 'خالد': 33}\nscores['خالد'] += 9\nscores['أحمد'] = 43\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 39])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'سلمى': 2, 'حسن': 45, 'خالد': 33}\nscores['خالد'] += 9\nscores['أحمد'] = 43\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 39])\n```\nالجواب:", "qhash": "48ccbeb8f4c64722", "answer": "4\nحسن\n132\n['حسن', 'خالد', 'أحمد']", "completion": " الناتج:\n```text\n4\nحسن\n132\n['حسن', 'خالد', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(4))\nprint(g(4, 19))\nprint(g(g(19), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(4))\nprint(g(4, 19))\nprint(g(g(19), 4))\n```\nالجواب:", "qhash": "72f760eb2fb8918d", "answer": "19\n99\n466", "completion": " الناتج:\n```text\n19\n99\n466\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "tests": ["assert power_sum(4) == 14300", "assert power_sum(2) == 363", "assert power_sum(10) == 2429075", "assert power_sum(2) == 363", "assert power_sum(3) == 3036", "assert power_sum(1) == 11", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 14300\nassert power_sum(2) == 363\nassert power_sum(10) == 2429075\nassert power_sum(2) == 363\nassert power_sum(3) == 3036\nassert power_sum(1) == 11\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 11 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × 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 = 11 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `power_sum(4)` يُرجع `14300`.\nالجواب:", "qhash": "78f53c946758e9a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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 count_sel([5, 58, 16, 62, 10, 13, 63, 17, 38, 46]) == 6", "assert count_sel([-33, -37, 63, 46, 20, 4, -13]) == 3", "assert count_sel([64, 29, 46]) == 2", "assert count_sel([57, 42, 26, 39, 72, 11, 46]) == 3", "assert count_sel([-12, 10, 0, 22, -2, 41]) == 4", "assert count_sel([-38, 83, -34, 4, 22, 66, 60]) == 6", "assert count_sel([]) == 0"], "test_code": "assert count_sel([5, 58, 16, 62, 10, 13, 63, 17, 38, 46]) == 6\nassert count_sel([-33, -37, 63, 46, 20, 4, -13]) == 3\nassert count_sel([64, 29, 46]) == 2\nassert count_sel([57, 42, 26, 39, 72, 11, 46]) == 3\nassert count_sel([-12, 10, 0, 22, -2, 41]) == 4\nassert count_sel([-38, 83, -34, 4, 22, 66, 60]) == 6\nassert count_sel([]) == 0", "answer": "def count_sel(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 count_sel(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 count_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_sel([5, 58, 16, 62, 10, 13, 63, 17, 38, 46])` يُرجع `6`.\nالجواب:", "qhash": "76f1010e7bfee889"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 7\nfor i in range(5, 24, 3):\n result -= i * 6\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 7\nfor i in range(5, 24, 3):\n result -= i * 6\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "1e0671a2b9fa5bb3", "answer": "-581\n23", "completion": " الناتج:\n```text\n-581\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('نهر قهوة يمل يمل') == 2", "assert words_starting('فجر تفاحة طالب يمل طائرة خبز') == 1", "assert words_starting('يمل سلام يمل سماء') == 2", "assert words_starting('كتاب يمل يمل علم عربية تفاحة ميناء سفينة') == 2", "assert words_starting('دفتر صديق وردة يمل سماء سوق') == 1", "assert words_starting('') == 0"], "test_code": "assert words_starting('طالب يمل مكتبة رمل صحراء') == 1\nassert words_starting('نهر قهوة يمل يمل') == 2\nassert words_starting('فجر تفاحة طالب يمل طائرة خبز') == 1\nassert words_starting('يمل سلام يمل سماء') == 2\nassert words_starting('كتاب يمل يمل علم عربية تفاحة ميناء سفينة') == 2\nassert words_starting('دفتر صديق وردة يمل سماء سوق') == 1\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.split():\n if 'ي' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ي»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef words_starting(text):\n count = 0\n for w in text.split():\n if 'ي' in w:\n count += 1\n return count\n```\nمثال: `words_starting('طالب يمل مكتبة رمل صحراء')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "291f4dad906d18e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19', 'Yo', 'Hi', '22', '23']", "assert label_numbers(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']", "assert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']", "assert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']", "assert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']"], "test_code": "assert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19', 'Yo', 'Hi', '22', '23']\nassert label_numbers(16) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16']\nassert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']\nassert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi']\nassert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Hi', '8', '9']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Hi'، وعلى 10 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(23)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Hi', '8', '9', 'Yo', '11', '12', '13', 'Hi', '15', '16', '17', '18', '19', 'Yo', 'Hi', '22', '23']`.\nالجواب:", "qhash": "770358f292f94fef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'table_brain'\nprint(s[3:11])\nprint(s.index('t') + len(s))\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'table_brain'\nprint(s[3:11])\nprint(s.index('t') + len(s))\nprint(s.split('_'))\n```\nالجواب:", "qhash": "97a7b3d24f7cb90f", "answer": "le_brain\n11\n['table', 'brain']", "completion": " الناتج:\n```text\nle_brain\n11\n['table', 'brain']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'aetu'}", "tests": ["assert char_counts('orange data') == {'a': 3, 'e': 1, 't': 1, 'u': 0}", "assert char_counts('matrix pixel on engine') == {'a': 1, 'e': 3, 't': 1, 'u': 0}", "assert char_counts('in cloud') == {'a': 0, 'e': 0, 't': 0, 'u': 1}", "assert char_counts('planet table we a') == {'a': 3, 'e': 3, 't': 2, 'u': 0}", "assert char_counts('desert engine') == {'a': 0, 'e': 4, 't': 1, 'u': 0}", "assert char_counts('desert summer code data') == {'a': 2, 'e': 4, 't': 2, 'u': 1}", "assert char_counts('') == {'a': 0, 'e': 0, 't': 0, 'u': 0}"], "test_code": "assert char_counts('orange data') == {'a': 3, 'e': 1, 't': 1, 'u': 0}\nassert char_counts('matrix pixel on engine') == {'a': 1, 'e': 3, 't': 1, 'u': 0}\nassert char_counts('in cloud') == {'a': 0, 'e': 0, 't': 0, 'u': 1}\nassert char_counts('planet table we a') == {'a': 3, 'e': 3, 't': 2, 'u': 0}\nassert char_counts('desert engine') == {'a': 0, 'e': 4, 't': 1, 'u': 0}\nassert char_counts('desert summer code data') == {'a': 2, 'e': 4, 't': 2, 'u': 1}\nassert char_counts('') == {'a': 0, 'e': 0, 't': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'aetu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'aetu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'e'، 't'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('orange data')` يجب أن تُرجع `{'a': 3, 'e': 1, 't': 1, 'u': 0}`.\nالجواب:", "qhash": "5879bcce98e30219"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'hstu'}", "tests": ["assert count_chars('code table orange of we planet') == {'h': 0, 's': 0, 't': 2, 'u': 0}", "assert count_chars('desert engine at brain is') == {'h': 0, 's': 2, 't': 2, 'u': 0}", "assert count_chars('at') == {'h': 0, 's': 0, 't': 1, 'u': 0}", "assert count_chars('signal music rocket camel code cloud') == {'h': 0, 's': 2, 't': 1, 'u': 2}", "assert count_chars('falcon winter rocket camel') == {'h': 0, 's': 0, 't': 2, 'u': 0}", "assert count_chars('of table planet planet vector coffee') == {'h': 0, 's': 0, 't': 4, 'u': 0}", "assert count_chars('') == {'h': 0, 's': 0, 't': 0, 'u': 0}"], "test_code": "assert count_chars('code table orange of we planet') == {'h': 0, 's': 0, 't': 2, 'u': 0}\nassert count_chars('desert engine at brain is') == {'h': 0, 's': 2, 't': 2, 'u': 0}\nassert count_chars('at') == {'h': 0, 's': 0, 't': 1, 'u': 0}\nassert count_chars('signal music rocket camel code cloud') == {'h': 0, 's': 2, 't': 1, 'u': 2}\nassert count_chars('falcon winter rocket camel') == {'h': 0, 's': 0, 't': 2, 'u': 0}\nassert count_chars('of table planet planet vector coffee') == {'h': 0, 's': 0, 't': 4, 'u': 0}\nassert count_chars('') == {'h': 0, 's': 0, 't': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'hstu'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'hstu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 's'، 't'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('code table orange of we planet')` يجب أن تُرجع `{'h': 0, 's': 0, 't': 2, 'u': 0}`.\nالجواب:", "qhash": "5958d86b9237dd66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 346\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 = 346\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": "d30c9a0a39a3e4cc", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 16\nfor j in range(9, 12, 4):\n acc -= j * 7\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 16\nfor j in range(9, 12, 4):\n acc -= j * 7\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "5bc3ec8064d02bbf", "answer": "-47\n9", "completion": " الناتج:\n```text\n-47\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'ماء فجر'\nprint(len(w))\nprint(w.count('ب'))\nprint(w[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'ماء فجر'\nprint(len(w))\nprint(w.count('ب'))\nprint(w[::-1])\n```\nالجواب:", "qhash": "ea24f533650df7ff", "answer": "7\n0\nرجف ءام", "completion": " الناتج:\n```text\n7\n0\nرجف ءام\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(calc(14))\nprint(calc(14, -3))\nprint(calc(calc(-3), 14))", "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(14))\nprint(calc(14, -3))\nprint(calc(calc(-3), 14))\n```\nالجواب:", "qhash": "0a7cce37ee60dc18", "answer": "-46\n-39\n-57", "completion": " الناتج:\n```text\n-46\n-39\n-57\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('python window Hello') == 'bkftaz iuzpai Hqxxa'", "assert encode('in planet rocket summer window') == 'uz bxmzqf daowqf egyyqd iuzpai'", "assert encode('vector') == 'hqofad'", "assert encode('engine falcon cloud vector') == 'qzsuzq rmxoaz oxagp hqofad'", "assert encode('engine engine go rocket stone') == 'qzsuzq qzsuzq sa daowqf efazq'", "assert encode('apple go at we python 2024') == 'mbbxq sa mf iq bkftaz 2024'", "assert encode('') == ''"], "test_code": "assert encode('python window Hello') == 'bkftaz iuzpai Hqxxa'\nassert encode('in planet rocket summer window') == 'uz bxmzqf daowqf egyyqd iuzpai'\nassert encode('vector') == 'hqofad'\nassert encode('engine falcon cloud vector') == 'qzsuzq rmxoaz oxagp hqofad'\nassert encode('engine engine go rocket stone') == 'qzsuzq qzsuzq sa daowqf efazq'\nassert encode('apple go at we python 2024') == 'mbbxq sa mf iq bkftaz 2024'\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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('python window Hello')` يُرجع `'bkftaz iuzpai Hqxxa'`.\nالجواب:", "qhash": "30755bbe8121e465"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('جبل باب بيت نور قهوة عربية نهر سوق') == 1", "assert count_letter('ليل وردة جبل') == 1", "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('جبل باب بيت نور قهوة عربية نهر سوق') == 1\nassert count_letter('ليل وردة جبل') == 1\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 'ج' 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": "edf0d493c96d32f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 9 == 0)", "tests": ["assert mult_sum(40) == 162", "assert mult_sum(138) == 2094", "assert mult_sum(262) == 7701", "assert mult_sum(283) == 9072", "assert mult_sum(116) == 1464", "assert mult_sum(35) == 126", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(40) == 162\nassert mult_sum(138) == 2094\nassert mult_sum(262) == 7701\nassert mult_sum(283) == 9072\nassert mult_sum(116) == 1464\nassert mult_sum(35) == 126\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 % 9 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(40)` يُرجع `162`.\nالجواب:", "qhash": "731531a0ec8d784c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('راشد', 92), ('وليد', 83), ('سلمى', 59), ('منى', 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 = [('راشد', 92), ('وليد', 83), ('سلمى', 59), ('منى', 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": "237d1b4a03693e48", "answer": "[('منى', 33), ('سلمى', 59), ('وليد', 83), ('راشد', 92)]\n['راشد', 'وليد']", "completion": " الناتج:\n```text\n[('منى', 33), ('سلمى', 59), ('وليد', 83), ('راشد', 92)]\n['راشد', 'وليد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -5 * x ** 2 + (9) * x + (-6)", "tests": ["assert p(1) == -2", "assert p(-9) == -492", "assert p(18) == -1464", "assert p(-12) == -834", "assert p(-16) == -1430", "assert p(-8) == -398", "assert p(15) == -996", "assert p(0) == -6"], "test_code": "assert p(1) == -2\nassert p(-9) == -492\nassert p(18) == -1464\nassert p(-12) == -834\nassert p(-16) == -1430\nassert p(-8) == -398\nassert p(15) == -996\nassert p(0) == -6", "answer": "def p(x):\n return -5 * x ** 2 + (9) * x + (-6)", "completion": " ```python\ndef p(x):\n return -5 * x ** 2 + (9) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -5x² + 9x - 6 عند العدد الصحيح x.\nمثال: `p(1)` يجب أن تُرجع `-2`.\nالجواب:", "qhash": "bba97d2358871d2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('يمل يمل سلام تفاحة ليل كتاب') == 2", "assert prefix_hits('يمل نهر نور قمر يمل') == 2", "assert prefix_hits('تفاحة نهر علم') == 0", "assert prefix_hits('دفتر نهار قلم قمر') == 0", "assert prefix_hits('يمل صحراء يمل برمجة') == 2", "assert prefix_hits('بحر طالب برمجة بيت كتاب') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('يمل يمل سلام تفاحة ليل كتاب') == 2\nassert prefix_hits('يمل نهر نور قمر يمل') == 2\nassert prefix_hits('تفاحة نهر علم') == 0\nassert prefix_hits('دفتر نهار قلم قمر') == 0\nassert prefix_hits('يمل صحراء يمل برمجة') == 2\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('يمل يمل سلام تفاحة ليل كتاب')` يُرجع `2`.\nالجواب:", "qhash": "15b83ee1df6b33cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 8 * x ** 2 + (2) * x + (-2)", "tests": ["assert evaluate(3) == 76", "assert evaluate(-1) == 4", "assert evaluate(-7) == 376", "assert evaluate(-14) == 1538", "assert evaluate(19) == 2924", "assert evaluate(15) == 1828", "assert evaluate(-8) == 494", "assert evaluate(0) == -2"], "test_code": "assert evaluate(3) == 76\nassert evaluate(-1) == 4\nassert evaluate(-7) == 376\nassert evaluate(-14) == 1538\nassert evaluate(19) == 2924\nassert evaluate(15) == 1828\nassert evaluate(-8) == 494\nassert evaluate(0) == -2", "answer": "def evaluate(x):\n return 8 * x ** 2 + (2) * x + (-2)", "completion": " ```python\ndef evaluate(x):\n return 8 * x ** 2 + (2) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 8x² + 2x - 2 عند العدد الصحيح x.\nمثال: `evaluate(3)` يجب أن تُرجع `76`.\nالجواب:", "qhash": "0d42c49a13ad6426"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [23, 0, 27, 36, 3, 24, 36, 36, 3]\nprint(lst[0:4])\nprint(lst[::-1])\nprint(sum(lst[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [23, 0, 27, 36, 3, 24, 36, 36, 3]\nprint(lst[0:4])\nprint(lst[::-1])\nprint(sum(lst[0:4]))\n```\nالجواب:", "qhash": "1b53c2d2f464bda0", "answer": "[23, 0, 27, 36]\n[3, 36, 36, 24, 3, 36, 27, 0, 23]\n86", "completion": " الناتج:\n```text\n[23, 0, 27, 36]\n[3, 36, 36, 24, 3, 36, 27, 0, 23]\n86\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(135) == 2275", "assert multiples_total(200) == 5070", "assert multiples_total(83) == 888", "assert multiples_total(243) == 7713", "assert multiples_total(272) == 9505", "assert multiples_total(36) == 179", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(135) == 2275\nassert multiples_total(200) == 5070\nassert multiples_total(83) == 888\nassert multiples_total(243) == 7713\nassert multiples_total(272) == 9505\nassert multiples_total(36) == 179\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 % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 13.\nمثال: `multiples_total(135)` يجب أن تُرجع `2275`.\nالجواب:", "qhash": "79f261bfa7df9f9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('table') == 'yfgqj'", "assert cipher('falcon') == 'kfqhts'", "assert cipher('falcon a a A1') == 'kfqhts f f A1'", "assert cipher('up') == 'zu'", "assert cipher('brain A1') == 'gwfns A1'", "assert cipher('table data go of OK') == 'yfgqj ifyf lt tk OK'", "assert cipher('') == ''"], "test_code": "assert cipher('table') == 'yfgqj'\nassert cipher('falcon') == 'kfqhts'\nassert cipher('falcon a a A1') == 'kfqhts f f A1'\nassert cipher('up') == 'zu'\nassert cipher('brain A1') == 'gwfns A1'\nassert cipher('table data go of OK') == 'yfgqj ifyf lt tk OK'\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 + (5)) % 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 + (5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('table')` يُرجع `'yfgqj'`.\nالجواب:", "qhash": "088f3b42df3d3baa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return 5 * x ** 2 + (-9) * x + (-9)", "tests": ["assert p(8) == 239", "assert p(15) == 981", "assert p(13) == 719", "assert p(3) == 9", "assert p(-14) == 1097", "assert p(-2) == 29", "assert p(19) == 1625", "assert p(0) == -9"], "test_code": "assert p(8) == 239\nassert p(15) == 981\nassert p(13) == 719\nassert p(3) == 9\nassert p(-14) == 1097\nassert p(-2) == 29\nassert p(19) == 1625\nassert p(0) == -9", "answer": "def p(x):\n return 5 * x ** 2 + (-9) * x + (-9)", "completion": " ```python\ndef p(x):\n return 5 * x ** 2 + (-9) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود 5x² - 9x - 9 عند العدد الصحيح x.\nمثال: `p(8)` يجب أن تُرجع `239`.\nالجواب:", "qhash": "b6b9dafbe55eb3fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 19", "tests": ["assert fact_mod(9) == 14", "assert fact_mod(47) == 0", "assert fact_mod(23) == 0", "assert fact_mod(41) == 0", "assert fact_mod(23) == 0", "assert fact_mod(53) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(9) == 14\nassert fact_mod(47) == 0\nassert fact_mod(23) == 0\nassert fact_mod(41) == 0\nassert fact_mod(23) == 0\nassert fact_mod(53) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 19", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(9)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "74e0648651519526"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([77, 60, 34, 60, 66, 13]) == [77, 137, 0, 60, 126, 139]", "assert running_sum([138, 142, 132, 114]) == [138, 0, 132, 0]", "assert running_sum([152, 96, 30, 165, -8, 66, 146, 23, 87]) == [152, 0, 30, 0, -8, 58, 0, 23, 110]", "assert running_sum([59, 41, 28, 119, 16, 149, 164, 95, 126]) == [59, 100, 128, 0, 16, 165, 0, 95, 0]", "assert running_sum([138, 58, 11]) == [138, 0, 11]", "assert running_sum([20, 101, 143, 62, 135, 116, 110]) == [20, 121, 0, 62, 0, 116, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([77, 60, 34, 60, 66, 13]) == [77, 137, 0, 60, 126, 139]\nassert running_sum([138, 142, 132, 114]) == [138, 0, 132, 0]\nassert running_sum([152, 96, 30, 165, -8, 66, 146, 23, 87]) == [152, 0, 30, 0, -8, 58, 0, 23, 110]\nassert running_sum([59, 41, 28, 119, 16, 149, 164, 95, 126]) == [59, 100, 128, 0, 16, 165, 0, 95, 0]\nassert running_sum([138, 58, 11]) == [138, 0, 11]\nassert running_sum([20, 101, 143, 62, 135, 116, 110]) == [20, 121, 0, 62, 0, 116, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 165:\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 > 165:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 165 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([77, 60, 34, 60, 66, 13])` يُرجع `[77, 137, 0, 60, 126, 139]`.\nالجواب:", "qhash": "91bb58762cf97335"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert roll([26, 29, 49, 32, 44, 2, 3]) == [49, 32, 44, 2, 3, 26, 29]", "assert roll([29, 38, -8, 31, -7, 46, 16, -2]) == [29, 38, -8, 31, -7, 46, 16, -2]", "assert roll([3, 28, 31, 28, 31, 18, -3, -9, 41, 5]) == [-3, -9, 41, 5, 3, 28, 31, 28, 31, 18]", "assert roll([4, 18, 7, 47, 28, 48]) == [28, 48, 4, 18, 7, 47]", "assert roll([37, 12]) == [37, 12]", "assert roll([19, 23, 19, 50, 50, 0, 45, 29, 3, 22]) == [45, 29, 3, 22, 19, 23, 19, 50, 50, 0]", "assert roll([]) == []"], "test_code": "assert roll([26, 29, 49, 32, 44, 2, 3]) == [49, 32, 44, 2, 3, 26, 29]\nassert roll([29, 38, -8, 31, -7, 46, 16, -2]) == [29, 38, -8, 31, -7, 46, 16, -2]\nassert roll([3, 28, 31, 28, 31, 18, -3, -9, 41, 5]) == [-3, -9, 41, 5, 3, 28, 31, 28, 31, 18]\nassert roll([4, 18, 7, 47, 28, 48]) == [28, 48, 4, 18, 7, 47]\nassert roll([37, 12]) == [37, 12]\nassert roll([19, 23, 19, 50, 50, 0, 45, 29, 3, 22]) == [45, 29, 3, 22, 19, 23, 19, 50, 50, 0]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([26, 29, 49, 32, 44, 2, 3])` يُرجع `[49, 32, 44, 2, 3, 26, 29]`.\nالجواب:", "qhash": "d36df19f70632fee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 4\nfor x in range(-3, 8, 2):\n s += x * 1\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 4\nfor x in range(-3, 8, 2):\n s += x * 1\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "79d4767e9962843a", "answer": "16\n7", "completion": " الناتج:\n```text\n16\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 49) == 1)", "tests": ["assert phi_upto(122) == 105", "assert phi_upto(163) == 140", "assert phi_upto(134) == 115", "assert phi_upto(101) == 87", "assert phi_upto(134) == 115", "assert phi_upto(62) == 54", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(122) == 105\nassert phi_upto(163) == 140\nassert phi_upto(134) == 115\nassert phi_upto(101) == 87\nassert phi_upto(134) == 115\nassert phi_upto(62) == 54\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, 49) == 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, 49) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 49) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(122)` يُرجع `105`.\nالجواب:", "qhash": "323fccbe398b8499"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 4 * x ** 2 + (-8) * x + (-7)", "tests": ["assert quad(5) == 53", "assert quad(20) == 1433", "assert quad(2) == -7", "assert quad(11) == 389", "assert quad(-16) == 1145", "assert quad(9) == 245", "assert quad(-13) == 773", "assert quad(0) == -7"], "test_code": "assert quad(5) == 53\nassert quad(20) == 1433\nassert quad(2) == -7\nassert quad(11) == 389\nassert quad(-16) == 1145\nassert quad(9) == 245\nassert quad(-13) == 773\nassert quad(0) == -7", "answer": "def quad(x):\n return 4 * x ** 2 + (-8) * x + (-7)", "completion": " ```python\ndef quad(x):\n return 4 * x ** 2 + (-8) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 4x² - 8x - 7 عند العدد الصحيح x.\nمثال: `quad(5)` يجب أن تُرجع `53`.\nالجواب:", "qhash": "56d49c32c1feab40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([30, 3, 82, 28, 22]) == [30, 33, 115, 143, 165]", "assert running_sum([154, 104, 174, 84, 121, 78]) == [154, 0, 174, 0, 121, 0]", "assert running_sum([21]) == [21]", "assert running_sum([133, 104, 161, 144, -1, 153, 63, 130, 74, 137]) == [133, 0, 161, 0, -1, 152, 0, 130, 0, 137]", "assert running_sum([]) == []", "assert running_sum([173, 184, 70, 85, 8, -8, 132, 123]) == [173, 0, 70, 155, 163, 155, 0, 123]", "assert running_sum([]) == []"], "test_code": "assert running_sum([30, 3, 82, 28, 22]) == [30, 33, 115, 143, 165]\nassert running_sum([154, 104, 174, 84, 121, 78]) == [154, 0, 174, 0, 121, 0]\nassert running_sum([21]) == [21]\nassert running_sum([133, 104, 161, 144, -1, 153, 63, 130, 74, 137]) == [133, 0, 161, 0, -1, 152, 0, 130, 0, 137]\nassert running_sum([]) == []\nassert running_sum([173, 184, 70, 85, 8, -8, 132, 123]) == [173, 0, 70, 155, 163, 155, 0, 123]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\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 > 186:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 186 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([30, 3, 82, 28, 22])` يُرجع `[30, 33, 115, 143, 165]`.\nالجواب:", "qhash": "a260dcdbd25d7601"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 22", "tests": ["assert pow_digits(10967) == 13", "assert pow_digits(95214) == 17", "assert pow_digits(336574) == 12", "assert pow_digits(625871) == 3", "assert pow_digits(862121) == 0", "assert pow_digits(953923) == 11", "assert pow_digits(34535) == 18", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(10967) == 13\nassert pow_digits(95214) == 17\nassert pow_digits(336574) == 12\nassert pow_digits(625871) == 3\nassert pow_digits(862121) == 0\nassert pow_digits(953923) == 11\nassert pow_digits(34535) == 18\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 22", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 22.\nللتوضيح: الاستدعاء `pow_digits(10967)` يُرجع `13`.\nالجواب:", "qhash": "b2af3f749232d680"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 4 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(4) == ['1', '2', 'Sun', 'Moon']", "assert fizz(19) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', 'Moon', '17', 'Sun', '19']", "assert fizz(6) == ['1', '2', 'Sun', 'Moon', '5', 'Sun']", "assert fizz(11) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11']", "assert fizz(13) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11', 'SunMoon', '13']"], "test_code": "assert fizz(4) == ['1', '2', 'Sun', 'Moon']\nassert fizz(19) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', 'Moon', '17', 'Sun', '19']\nassert fizz(6) == ['1', '2', 'Sun', 'Moon', '5', 'Sun']\nassert fizz(11) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11']\nassert fizz(13) == ['1', '2', 'Sun', 'Moon', '5', 'Sun', '7', 'Moon', 'Sun', '10', '11', 'SunMoon', '13']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Sun'\n if i % 4 == 0:\n s += 'Moon'\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 += 'Sun'\n if i % 4 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Sun'، وإن قَبِلها على 4 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(4)` يُرجع `['1', '2', 'Sun', 'Moon']`.\nالجواب:", "qhash": "09a956959c4c4f4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(9) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar']", "assert fizzbuzz(23) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'FooBar', '19', 'Foo', '21', 'Foo', '23']", "assert fizzbuzz(4) == ['1', 'Foo', '3', 'Foo']", "assert fizzbuzz(13) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar', 'Foo', '11', 'Foo', '13']", "assert fizzbuzz(0) == []"], "test_code": "assert fizzbuzz(9) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar']\nassert fizzbuzz(23) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'Foo', '17', 'FooBar', '19', 'Foo', '21', 'Foo', '23']\nassert fizzbuzz(4) == ['1', 'Foo', '3', 'Foo']\nassert fizzbuzz(13) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar', 'Foo', '11', 'Foo', '13']\nassert fizzbuzz(0) == []", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Foo'، وعلى 9 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(9)` يجب أن تُرجع `['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', 'Bar']`.\nالجواب:", "qhash": "5ad7ddd67ad62ba9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'pixel_pixel'\nprint(s[-2:])\nprint(s.upper())\nprint(s[3:11])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'pixel_pixel'\nprint(s[-2:])\nprint(s.upper())\nprint(s[3:11])\n```\nالجواب:", "qhash": "93b1f80f64d73afa", "answer": "el\nPIXEL_PIXEL\nel_pixel", "completion": " الناتج:\n```text\nel\nPIXEL_PIXEL\nel_pixel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 50) == 1)", "tests": ["assert rel_prime_count(90) == 36", "assert rel_prime_count(102) == 41", "assert rel_prime_count(67) == 27", "assert rel_prime_count(82) == 33", "assert rel_prime_count(136) == 54", "assert rel_prime_count(91) == 37", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(90) == 36\nassert rel_prime_count(102) == 41\nassert rel_prime_count(67) == 27\nassert rel_prime_count(82) == 33\nassert rel_prime_count(136) == 54\nassert rel_prime_count(91) == 37\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, 50) == 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, 50) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 50، أي أن القاسم المشترك الأكبر لها مع 50 يساوي 1.\nمثال: `rel_prime_count(90)` يجب أن تُرجع `36`.\nالجواب:", "qhash": "887da64fdfb8095d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('يمل جبل مكتبة') == 1", "assert prefix_hits('يمل طالب كتاب ليل ميناء يمل سفينة سوق') == 2", "assert prefix_hits('مدينة قلم سلام يمل يمل') == 2", "assert prefix_hits('يمل مطر يمل سماء عربية') == 2", "assert prefix_hits('يمل سلام بيت سفينة سوق') == 1", "assert prefix_hits('يمل يمل عمل كتاب رمل خبز') == 2", "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('يمل سلام بيت سفينة سوق') == 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.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('يمل جبل مكتبة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "e66e5dd6a1509d6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert weighted_sum(5) == 22125", "assert weighted_sum(7) == 145040", "assert weighted_sum(1) == 5", "assert weighted_sum(12) == 3153540", "assert weighted_sum(3) == 1380", "assert weighted_sum(1) == 5", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 22125\nassert weighted_sum(7) == 145040\nassert weighted_sum(1) == 5\nassert weighted_sum(12) == 3153540\nassert weighted_sum(3) == 1380\nassert weighted_sum(1) == 5\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `22125`.\nالجواب:", "qhash": "48fa536e403be341"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -3 for x in xs if -17 <= x <= 18)", "tests": ["assert clip_scale([17, -9, -6, 10, 16, -17, -21]) == [-51, -48, -30, 18, 27, 51]", "assert clip_scale([30]) == []", "assert clip_scale([22, -7, 14, 13, -27, 41, -5, 21]) == [-42, -39, 15, 21]", "assert clip_scale([]) == []", "assert clip_scale([42, 38, 56, -25, 25]) == []", "assert clip_scale([]) == []", "assert clip_scale([45, 18, 4, -21]) == [-54, -12]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([17, -9, -6, 10, 16, -17, -21]) == [-51, -48, -30, 18, 27, 51]\nassert clip_scale([30]) == []\nassert clip_scale([22, -7, 14, 13, -27, 41, -5, 21]) == [-42, -39, 15, 21]\nassert clip_scale([]) == []\nassert clip_scale([42, 38, 56, -25, 25]) == []\nassert clip_scale([]) == []\nassert clip_scale([45, 18, 4, -21]) == [-54, -12]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -3 for x in xs if -17 <= x <= 18)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -3 for x in xs if -17 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -17 و18 (شاملًا الطرفين) في -3.\nمثال: `clip_scale([17, -9, -6, 10, 16, -17, -21])` يجب أن تُرجع `[-51, -48, -30, 18, 27, 51]`.\nالجواب:", "qhash": "34a565056de567df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [10, 0, 20, -1, 25, 35, 2]\nprint(sorted(nums, key=lambda x: (abs(x - 14), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [10, 0, 20, -1, 25, 35, 2]\nprint(sorted(nums, key=lambda x: (abs(x - 14), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "b2de1a840713213e", "answer": "[10, 20, 25, 2, 0, -1, 35]\n[35, 25, 20]", "completion": " الناتج:\n```text\n[10, 20, 25, 2, 0, -1, 35]\n[35, 25, 20]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('a by it desert') == 'k li sd nocobd'", "assert shift_letters('on pixel cloud OK') == 'yx zshov mvyen OK'", "assert shift_letters('to up light') == 'dy ez vsqrd'", "assert shift_letters('brain table coffee light of') == 'lbksx dklvo myppoo vsqrd yp'", "assert shift_letters('table signal winter') == 'dklvo csqxkv gsxdob'", "assert shift_letters('light on planet coffee music A1') == 'vsqrd yx zvkxod myppoo wecsm A1'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('a by it desert') == 'k li sd nocobd'\nassert shift_letters('on pixel cloud OK') == 'yx zshov mvyen OK'\nassert shift_letters('to up light') == 'dy ez vsqrd'\nassert shift_letters('brain table coffee light of') == 'lbksx dklvo myppoo vsqrd yp'\nassert shift_letters('table signal winter') == 'dklvo csqxkv gsxdob'\nassert shift_letters('light on planet coffee music A1') == 'vsqrd yx zvkxod myppoo wecsm A1'\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 + (10)) % 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 + (10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('a by it desert')` يُرجع `'k li sd nocobd'`.\nالجواب:", "qhash": "ad665cddd8492a73"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 83", "tests": ["assert mfact(7) == 22", "assert mfact(23) == 31", "assert mfact(39) == 4", "assert mfact(23) == 31", "assert mfact(16) == 40", "assert mfact(18) == 56", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 22\nassert mfact(23) == 31\nassert mfact(39) == 4\nassert mfact(23) == 31\nassert mfact(16) == 40\nassert mfact(18) == 56\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 83", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 83\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 83 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(7)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "d04646a9f1937923"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'data'\nprint(text.find('d'))\nprint(text.index('d') + len(text))\nprint(text.replace('d', '0'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'data'\nprint(text.find('d'))\nprint(text.index('d') + len(text))\nprint(text.replace('d', '0'))\n```\nالجواب:", "qhash": "391e4b8e83dec787", "answer": "0\n4\n0ata", "completion": " الناتج:\n```text\n0\n4\n0ata\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'camel'\nprint(name[0:3])\nprint(name[-2:])\nprint(name.replace('e', 'X'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'camel'\nprint(name[0:3])\nprint(name[-2:])\nprint(name.replace('e', 'X'))\n```\nالجواب:", "qhash": "75d6c2199161c0d7", "answer": "cam\nel\ncamXl", "completion": " الناتج:\n```text\ncam\nel\ncamXl\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 2:\n return n + 2\n return f(n - 1) + f(n - 2)\n\nprint(f(11))", "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(11))\n```\nالجواب:", "qhash": "68f699b767819f83", "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#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "tests": ["assert power_sum(4) == 800", "assert power_sum(4) == 800", "assert power_sum(5) == 1800", "assert power_sum(4) == 800", "assert power_sum(2) == 72", "assert power_sum(1) == 8", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 800\nassert power_sum(4) == 800\nassert power_sum(5) == 1800\nassert power_sum(4) == 800\nassert power_sum(2) == 72\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 ** 3\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total\n```\nمثال: `power_sum(4)` يجب أن تُرجع `800`.\nالجواب:", "qhash": "f3336c43169645f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'جبل'\nprint(text.count('ب'))\nprint(text.replace(' ', '-'))\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'جبل'\nprint(text.count('ب'))\nprint(text.replace(' ', '-'))\nprint(text[-1])\n```\nالجواب:", "qhash": "a9757745860eaa58", "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_comprehension", "template": "p_comp#0", "code": "res = [x * -3 + 3 for x in range(-3, 10) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * -3 + 3 for x in range(-3, 10) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "361b0d69b5d6eb05", "answer": "[12, -3, -18]\n3 -9", "completion": " الناتج:\n```text\n[12, -3, -18]\n3 -9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert rev_join('python light we summer') == 'summer-light-python'", "assert rev_join('desert matrix at stone') == 'stone-matrix-desert'", "assert rev_join('rocket a music pixel') == 'pixel-music-rocket'", "assert rev_join('it river winter banana table') == 'table-banana-winter-river'", "assert rev_join('to music table it a code') == 'table-music'", "assert rev_join('summer planet coffee desert python orange pixel') == 'pixel-orange-python-desert-coffee-planet-summer'", "assert rev_join('window signal pixel') == 'pixel-signal-window'"], "test_code": "assert rev_join('python light we summer') == 'summer-light-python'\nassert rev_join('desert matrix at stone') == 'stone-matrix-desert'\nassert rev_join('rocket a music pixel') == 'pixel-music-rocket'\nassert rev_join('it river winter banana table') == 'table-banana-winter-river'\nassert rev_join('to music table it a code') == 'table-music'\nassert rev_join('summer planet coffee desert python orange pixel') == 'pixel-orange-python-desert-coffee-planet-summer'\nassert rev_join('window signal pixel') == 'pixel-signal-window'", "answer": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 5 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `rev_join('python light we summer')` يجب أن تُرجع `'summer-light-python'`.\nالجواب:", "qhash": "efe993e2a925f660"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(175) == 3150", "assert multiples_total(249) == 6132", "assert multiples_total(269) == 7155", "assert multiples_total(272) == 7425", "assert multiples_total(289) == 8272", "assert multiples_total(47) == 235", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(175) == 3150\nassert multiples_total(249) == 6132\nassert multiples_total(269) == 7155\nassert multiples_total(272) == 7425\nassert multiples_total(289) == 8272\nassert multiples_total(47) == 235\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 10.\nمثال: `multiples_total(175)` يجب أن تُرجع `3150`.\nالجواب:", "qhash": "9be4c21b169b8e0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert spin([19, 27, 36, 12, 6, 23]) == [6, 23, 19, 27, 36, 12]", "assert spin([49, 29, 4, 4, 33, 40, 5, 41, -2, 31]) == [33, 40, 5, 41, -2, 31, 49, 29, 4, 4]", "assert spin([8, 48, 39, 34, 7, 34, -5, 2, 27]) == [7, 34, -5, 2, 27, 8, 48, 39, 34]", "assert spin([38, 26, 40, -8, 23, 23]) == [23, 23, 38, 26, 40, -8]", "assert spin([32, 33, 13, 42, 11, 13, 6, 11, 37]) == [11, 13, 6, 11, 37, 32, 33, 13, 42]", "assert spin([38, 9, 10, 24]) == [38, 9, 10, 24]", "assert spin([]) == []"], "test_code": "assert spin([19, 27, 36, 12, 6, 23]) == [6, 23, 19, 27, 36, 12]\nassert spin([49, 29, 4, 4, 33, 40, 5, 41, -2, 31]) == [33, 40, 5, 41, -2, 31, 49, 29, 4, 4]\nassert spin([8, 48, 39, 34, 7, 34, -5, 2, 27]) == [7, 34, -5, 2, 27, 8, 48, 39, 34]\nassert spin([38, 26, 40, -8, 23, 23]) == [23, 23, 38, 26, 40, -8]\nassert spin([32, 33, 13, 42, 11, 13, 6, 11, 37]) == [11, 13, 6, 11, 37, 32, 33, 13, 42]\nassert spin([38, 9, 10, 24]) == [38, 9, 10, 24]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return ____\n```\nمثال: `spin([19, 27, 36, 12, 6, 23])` يجب أن تُرجع `[6, 23, 19, 27, 36, 12]`.\nالجواب:", "qhash": "8f36b3e2f21eac3f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('قمر صديق فجر')` يُرجع `0`.\nالجواب:", "qhash": "cfdb893fbd150332"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 5 + -9 for x in range(-4, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 5 + -9 for x in range(-4, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ce2272c9f5069e87", "answer": "[-24, -14, -4, 6, 16, 26]\n6 6", "completion": " الناتج:\n```text\n[-24, -14, -4, 6, 16, 26]\n6 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(660437533))\nprint(rec(rec(660437533)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(660437533))\nprint(rec(rec(660437533)))\n```\nالجواب:", "qhash": "8d2538ffe8b38863", "answer": "37\n10", "completion": " الناتج:\n```text\n37\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 4 * x ** 2 + (4) * x + (7)", "tests": ["assert value_at(10) == 447", "assert value_at(-11) == 447", "assert value_at(20) == 1687", "assert value_at(-19) == 1375", "assert value_at(1) == 15", "assert value_at(18) == 1375", "assert value_at(16) == 1095", "assert value_at(0) == 7"], "test_code": "assert value_at(10) == 447\nassert value_at(-11) == 447\nassert value_at(20) == 1687\nassert value_at(-19) == 1375\nassert value_at(1) == 15\nassert value_at(18) == 1375\nassert value_at(16) == 1095\nassert value_at(0) == 7", "answer": "def value_at(x):\n return 4 * x ** 2 + (4) * x + (7)", "completion": " ```python\ndef value_at(x):\n return 4 * x ** 2 + (4) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 4x² + 4x + 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(10)` يُرجع `447`.\nالجواب:", "qhash": "c4362cdb39b444b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'camel'\nprint(len(word))\nprint(word[-4:])\nprint(word.count('c'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'camel'\nprint(len(word))\nprint(word[-4:])\nprint(word.count('c'))\n```\nالجواب:", "qhash": "6c55a6d4d4d3bff5", "answer": "5\namel\n1", "completion": " الناتج:\n```text\n5\namel\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-19, 39, 43, 31, 6, -25, 20]) == 20", "assert best_multiple([-10, -6, -6]) == -6", "assert best_multiple([1]) == None", "assert best_multiple([12, -8]) == 12", "assert best_multiple([10, -3, 35, -2]) == 10", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-19, 39, 43, 31, 6, -25, 20]) == 20\nassert best_multiple([-10, -6, -6]) == -6\nassert best_multiple([1]) == None\nassert best_multiple([12, -8]) == 12\nassert best_multiple([10, -3, 35, -2]) == 10\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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للتوضيح: الاستدعاء `best_multiple([-19, 39, 43, 31, 6, -25, 20])` يُرجع `20`.\nالجواب:", "qhash": "ba1ac658a64a8364"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert backwards('desert table planet stone apple coffee apple data') == 'apple/coffee/apple/stone/planet/table/desert'", "assert backwards('signal light signal an it at brain light') == 'light/brain/signal/light/signal'", "assert backwards('on garden summer go by') == 'summer/garden'", "assert backwards('up a apple of go to') == 'apple'", "assert backwards('on to in we') == ''", "assert backwards('a music on pixel apple pixel code stone') == 'stone/pixel/apple/pixel/music'", "assert backwards('is matrix orange camel engine') == 'engine/camel/orange/matrix'"], "test_code": "assert backwards('desert table planet stone apple coffee apple data') == 'apple/coffee/apple/stone/planet/table/desert'\nassert backwards('signal light signal an it at brain light') == 'light/brain/signal/light/signal'\nassert backwards('on garden summer go by') == 'summer/garden'\nassert backwards('up a apple of go to') == 'apple'\nassert backwards('on to in we') == ''\nassert backwards('a music on pixel apple pixel code stone') == 'stone/pixel/apple/pixel/music'\nassert backwards('is matrix orange camel engine') == 'engine/camel/orange/matrix'", "answer": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('desert table planet stone apple coffee apple data')` يُرجع `'apple/coffee/apple/stone/planet/table/desert'`.\nالجواب:", "qhash": "e653706408dcf2bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'سلمى': 37, 'هدى': 20, 'باسل': 18}\npoints['سلمى'] += 6\npoints['هشام'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 34])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'سلمى': 37, 'هدى': 20, 'باسل': 18}\npoints['سلمى'] += 6\npoints['هشام'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 34])\n```\nالجواب:", "qhash": "bc3fdd91f652925c", "answer": "4\nسلمى\n83\n['سلمى']", "completion": " الناتج:\n```text\n4\nسلمى\n83\n['سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "tests": ["assert power_sum(7) == 1568", "assert power_sum(7) == 1568", "assert power_sum(0) == 0", "assert power_sum(15) == 28800", "assert power_sum(11) == 8712", "assert power_sum(1) == 2", "assert power_sum(0) == 0"], "test_code": "assert power_sum(7) == 1568\nassert power_sum(7) == 1568\nassert power_sum(0) == 0\nassert power_sum(15) == 28800\nassert power_sum(11) == 8712\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 ** 3\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `power_sum(7)` يُرجع `1568`.\nالجواب:", "qhash": "8e1439a10c47070b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 2) // 2 for x in range(5, 17) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 2) // 2 for x in range(5, 17) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "322993c9682cb8e9", "answer": "[3, 4, 5, 6, 7, 8]\n6 33", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7, 8]\n6 33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('desert A1') == 'qrfreg A1'", "assert rot('summer it it') == 'fhzzre vg vg'", "assert rot('garden in A1') == 'tneqra va A1'", "assert rot('we river on') == 'jr evire ba'", "assert rot('falcon cloud stone signal banana A1') == 'snypba pybhq fgbar fvtany onanan A1'", "assert rot('winter !') == 'jvagre !'", "assert rot('') == ''"], "test_code": "assert rot('desert A1') == 'qrfreg A1'\nassert rot('summer it it') == 'fhzzre vg vg'\nassert rot('garden in A1') == 'tneqra va A1'\nassert rot('we river on') == 'jr evire ba'\nassert rot('falcon cloud stone signal banana A1') == 'snypba pybhq fgbar fvtany onanan A1'\nassert rot('winter !') == 'jvagre !'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('desert A1')` يُرجع `'qrfreg A1'`.\nالجواب:", "qhash": "4918f02c46bb7681"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [10, 23, 12, 38, 37]\nprint(nums[1:2])\nprint(nums[::2])\nprint(len(nums[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [10, 23, 12, 38, 37]\nprint(nums[1:2])\nprint(nums[::2])\nprint(len(nums[1:2]))\n```\nالجواب:", "qhash": "f8e5b86f1ad235a6", "answer": "[23]\n[10, 12, 37]\n1", "completion": " الناتج:\n```text\n[23]\n[10, 12, 37]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 12718\nsteps = 0\nwhile m > 9:\n m = m // 7\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 12718\nsteps = 0\nwhile m > 9:\n m = m // 7\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "75d41c8e3541debf", "answer": "5 4", "completion": " الناتج:\n```text\n5 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(f(15))\nprint(f(15, -10))\nprint(f(f(-10), 15))", "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(15))\nprint(f(15, -10))\nprint(f(f(-10), 15))\n```\nالجواب:", "qhash": "73fc4d85e2e05e01", "answer": "51\n70\n89", "completion": " الناتج:\n```text\n51\n70\n89\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [32, 25, 5, 21, 19, 34, 14]\nprint(data[2:4])\nprint(data[::3])\nprint(max(data[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [32, 25, 5, 21, 19, 34, 14]\nprint(data[2:4])\nprint(data[::3])\nprint(max(data[2:4]))\n```\nالجواب:", "qhash": "7ff363ed443498ff", "answer": "[5, 21]\n[32, 21, 14]\n21", "completion": " الناتج:\n```text\n[5, 21]\n[32, 21, 14]\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -8 <= x <= 6)", "tests": ["assert in_range_scaled([-5, -15, -2, -4]) == [-15, -12, -6]", "assert in_range_scaled([23, 36]) == []", "assert in_range_scaled([39]) == []", "assert in_range_scaled([-2, 11, -15, -4, -8, -3, 31, 33, 56, -25]) == [-24, -12, -9, -6]", "assert in_range_scaled([27, 52, 51, -26, -9, -28, -27, 57, 2]) == [6]", "assert in_range_scaled([-8, 23, 42, 36, -9, 46, 18, 15, -12, 60]) == [-24]", "assert in_range_scaled([-18, -11]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-5, -15, -2, -4]) == [-15, -12, -6]\nassert in_range_scaled([23, 36]) == []\nassert in_range_scaled([39]) == []\nassert in_range_scaled([-2, 11, -15, -4, -8, -3, 31, 33, 56, -25]) == [-24, -12, -9, -6]\nassert in_range_scaled([27, 52, 51, -26, -9, -28, -27, 57, 2]) == [6]\nassert in_range_scaled([-8, 23, 42, 36, -9, 46, 18, 15, -12, 60]) == [-24]\nassert in_range_scaled([-18, -11]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -8 <= x <= 6)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 3 for x in xs if -8 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -8 و6 (شاملًا الطرفين) في 3.\nمثال: `in_range_scaled([-5, -15, -2, -4])` يجب أن تُرجع `[-15, -12, -6]`.\nالجواب:", "qhash": "b2b61b4d186ea71b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 59) == 1)", "tests": ["assert count_coprime(134) == 132", "assert count_coprime(174) == 172", "assert count_coprime(29) == 29", "assert count_coprime(174) == 172", "assert count_coprime(76) == 75", "assert count_coprime(104) == 103", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(134) == 132\nassert count_coprime(174) == 172\nassert count_coprime(29) == 29\nassert count_coprime(174) == 172\nassert count_coprime(76) == 75\nassert count_coprime(104) == 103\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, 59) == 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, 59) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 59) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(134)` يُرجع `132`.\nالجواب:", "qhash": "4cd7e00ab1b2618c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'رمل علم'\nprint(s.replace(' ', '-'))\nprint(len(s))\nprint(s.count('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'رمل علم'\nprint(s.replace(' ', '-'))\nprint(len(s))\nprint(s.count('ا'))\n```\nالجواب:", "qhash": "8df83e1f3f7c647d", "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_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -3 for x in xs if 18 <= x <= 32)", "tests": ["assert between_times([38, 9, 31, 39, 37, 16, 16]) == [-93]", "assert between_times([13, 41, 35, -24, 21]) == [-63]", "assert between_times([52, -23, 54, 27, 23, 10, -16]) == [-81, -69]", "assert between_times([53, 19, 26, 30, -11, 0, -7]) == [-90, -78, -57]", "assert between_times([7, -7, 20, 33, 48, 8]) == [-60]", "assert between_times([]) == []", "assert between_times([]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([38, 9, 31, 39, 37, 16, 16]) == [-93]\nassert between_times([13, 41, 35, -24, 21]) == [-63]\nassert between_times([52, -23, 54, 27, 23, 10, -16]) == [-81, -69]\nassert between_times([53, 19, 26, 30, -11, 0, -7]) == [-90, -78, -57]\nassert between_times([7, -7, 20, 33, 48, 8]) == [-60]\nassert between_times([]) == []\nassert between_times([]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -3 for x in xs if 18 <= x <= 32)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -3 for x in xs if 18 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 18 ≤ x ≤ 32، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([38, 9, 31, 39, 37, 16, 16])` يُرجع `[-93]`.\nالجواب:", "qhash": "aa08a56dbad2d3e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 32\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 = 32\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": "d30177ad0feb8450", "answer": "5", "completion": " الناتج:\n```text\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'river'\nprint(name.find('e'))\nprint(name[::-1])\nprint(name.index('e') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'river'\nprint(name.find('e'))\nprint(name[::-1])\nprint(name.index('e') + len(name))\n```\nالجواب:", "qhash": "4e6eb77e6f9f967e", "answer": "3\nrevir\n8", "completion": " الناتج:\n```text\n3\nrevir\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 5 * x ** 2 + (8) * x + (-3)", "tests": ["assert evaluate(3) == 66", "assert evaluate(-14) == 865", "assert evaluate(-12) == 621", "assert evaluate(-1) == -6", "assert evaluate(11) == 690", "assert evaluate(8) == 381", "assert evaluate(1) == 10", "assert evaluate(0) == -3"], "test_code": "assert evaluate(3) == 66\nassert evaluate(-14) == 865\nassert evaluate(-12) == 621\nassert evaluate(-1) == -6\nassert evaluate(11) == 690\nassert evaluate(8) == 381\nassert evaluate(1) == 10\nassert evaluate(0) == -3", "answer": "def evaluate(x):\n return 5 * x ** 2 + (8) * x + (-3)", "completion": " ```python\ndef evaluate(x):\n return 5 * x ** 2 + (8) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 5x² + 8x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(3)` يُرجع `66`.\nالجواب:", "qhash": "6e92463b813e28c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=4):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(5))\nprint(compute(5, 13))\nprint(compute(compute(13), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=4):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(compute(5))\nprint(compute(5, 13))\nprint(compute(compute(13), 5))\n```\nالجواب:", "qhash": "fe0f135ef6ac649e", "answer": "-24\n-47\n-76", "completion": " الناتج:\n```text\n-24\n-47\n-76\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 37", "tests": ["assert dig_pow_mod(48058) == 29", "assert dig_pow_mod(480468) == 36", "assert dig_pow_mod(689455) == 32", "assert dig_pow_mod(69510) == 35", "assert dig_pow_mod(418551) == 14", "assert dig_pow_mod(726952) == 23", "assert dig_pow_mod(499737) == 15", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(48058) == 29\nassert dig_pow_mod(480468) == 36\nassert dig_pow_mod(689455) == 32\nassert dig_pow_mod(69510) == 35\nassert dig_pow_mod(418551) == 14\nassert dig_pow_mod(726952) == 23\nassert dig_pow_mod(499737) == 15\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 37", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 37.\nمثال: `dig_pow_mod(48058)` يجب أن تُرجع `29`.\nالجواب:", "qhash": "29488208057a171e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=6):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(f(17))\nprint(f(17, -9))\nprint(f(f(-9), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=6):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(f(17))\nprint(f(17, -9))\nprint(f(f(-9), 17))\n```\nالجواب:", "qhash": "d8f029d7758a2036", "answer": "147\n162\n388", "completion": " الناتج:\n```text\n147\n162\n388\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'جبل'\nprint(kalima.find('س'))\nprint('س' in kalima)\nprint(kalima[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'جبل'\nprint(kalima.find('س'))\nprint('س' in kalima)\nprint(kalima[::-1])\n```\nالجواب:", "qhash": "d9d5d0e60fa60992", "answer": "-1\nFalse\nلبج", "completion": " الناتج:\n```text\n-1\nFalse\nلبج\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [20, 19, 15, 15, -7]\nprint(xs[1:4])\nprint(xs[::3])\nprint(min(xs[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [20, 19, 15, 15, -7]\nprint(xs[1:4])\nprint(xs[::3])\nprint(min(xs[1:4]))\n```\nالجواب:", "qhash": "4786fd7145fc815a", "answer": "[19, 15, 15]\n[20, 15]\n15", "completion": " الناتج:\n```text\n[19, 15, 15]\n[20, 15]\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(-1, 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(-1, 5))\n```\nالجواب:", "qhash": "0b0ac2ffb2645e6e", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "tests": ["assert scaled_powers(8) == 324", "assert scaled_powers(11) == 594", "assert scaled_powers(14) == 945", "assert scaled_powers(0) == 0", "assert scaled_powers(10) == 495", "assert scaled_powers(1) == 9", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 324\nassert scaled_powers(11) == 594\nassert scaled_powers(14) == 945\nassert scaled_powers(0) == 0\nassert scaled_powers(10) == 495\nassert scaled_powers(1) == 9\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(8)` يُرجع `324`.\nالجواب:", "qhash": "7c429c02c08c7381"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor i in range(-2, 15, 1):\n total -= i * 3\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor i in range(-2, 15, 1):\n total -= i * 3\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "a37f822ebc440998", "answer": "-291\n14", "completion": " الناتج:\n```text\n-291\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 1) // 3 for x in range(-6, 1) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 1) // 3 for x in range(-6, 1) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "3dcc7dcf6ce84cdc", "answer": "[-2, -1, 0]\n3 -3", "completion": " الناتج:\n```text\n[-2, -1, 0]\n3 -3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'سوق'\nprint(s[-1])\nprint(s.split())\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'سوق'\nprint(s[-1])\nprint(s.split())\nprint(s[::-1])\n```\nالجواب:", "qhash": "9a139029cc30eb2f", "answer": "ق\n['سوق']\nقوس", "completion": " الناتج:\n```text\nق\n['سوق']\nقوس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('باب ماء سوق طالب حاسوب دفتر') == 1", "assert prefix_hits('بيت بحر صديق حديقة وردة صديق برمجة باب') == 4", "assert prefix_hits('صحراء برمجة باب برتقال حاسوب') == 3", "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('بيت بحر صديق حديقة وردة صديق برمجة باب') == 4\nassert prefix_hits('صحراء برمجة باب برتقال حاسوب') == 3\nassert prefix_hits('سفينة دفتر عمل') == 0\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": "185277a9389fb0c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 57", "tests": ["assert sum_digit_pow(70085) == 20", "assert sum_digit_pow(829430) == 26", "assert sum_digit_pow(564227) == 26", "assert sum_digit_pow(338039) == 26", "assert sum_digit_pow(370169) == 26", "assert sum_digit_pow(740968) == 34", "assert sum_digit_pow(802380) == 21", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(70085) == 20\nassert sum_digit_pow(829430) == 26\nassert sum_digit_pow(564227) == 26\nassert sum_digit_pow(338039) == 26\nassert sum_digit_pow(370169) == 26\nassert sum_digit_pow(740968) == 34\nassert sum_digit_pow(802380) == 21\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 57", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 57\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 57.\nللتوضيح: الاستدعاء `sum_digit_pow(70085)` يُرجع `20`.\nالجواب:", "qhash": "e68da12627b56c39"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 70) == 1)", "tests": ["assert count_gcd1(65) == 22", "assert count_gcd1(165) == 56", "assert count_gcd1(155) == 53", "assert count_gcd1(137) == 47", "assert count_gcd1(43) == 16", "assert count_gcd1(108) == 37", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(65) == 22\nassert count_gcd1(165) == 56\nassert count_gcd1(155) == 53\nassert count_gcd1(137) == 47\nassert count_gcd1(43) == 16\nassert count_gcd1(108) == 37\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, 70) == 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, 70) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 70) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(65)` يُرجع `22`.\nالجواب:", "qhash": "2670e61614cfae57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 74", "tests": ["assert digit_power(54176) == 53", "assert digit_power(527814) == 11", "assert digit_power(662716) == 14", "assert digit_power(147355) == 51", "assert digit_power(941391) == 41", "assert digit_power(245023) == 58", "assert digit_power(577558) == 15", "assert digit_power(0) == 0"], "test_code": "assert digit_power(54176) == 53\nassert digit_power(527814) == 11\nassert digit_power(662716) == 14\nassert digit_power(147355) == 51\nassert digit_power(941391) == 41\nassert digit_power(245023) == 58\nassert digit_power(577558) == 15\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 74", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 74\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 74.\nمثال: `digit_power(54176)` يجب أن تُرجع `53`.\nالجواب:", "qhash": "999e79f47bf346c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "tests": ["assert power_sum(4) == 90", "assert power_sum(6) == 189", "assert power_sum(5) == 135", "assert power_sum(7) == 252", "assert power_sum(15) == 1080", "assert power_sum(1) == 9", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 90\nassert power_sum(6) == 189\nassert power_sum(5) == 135\nassert power_sum(7) == 252\nassert power_sum(15) == 1080\nassert power_sum(1) == 9\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 1\n return total\n```\nمثال: `power_sum(4)` يجب أن تُرجع `90`.\nالجواب:", "qhash": "c503efc4e0e1c4a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 0:\n return 3\n return 2 * f(n - 1) + 3\n\nprint(f(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 0:\n return 3\n return 2 * f(n - 1) + 3\n\nprint(f(7))\n```\nالجواب:", "qhash": "147559a449176c6b", "answer": "765", "completion": " الناتج:\n```text\n765\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -1 * x ** 2 + (-1) * x + (5)", "tests": ["assert poly(8) == -67", "assert poly(16) == -267", "assert poly(-12) == -127", "assert poly(20) == -415", "assert poly(8) == -67", "assert poly(-16) == -235", "assert poly(8) == -67", "assert poly(0) == 5"], "test_code": "assert poly(8) == -67\nassert poly(16) == -267\nassert poly(-12) == -127\nassert poly(20) == -415\nassert poly(8) == -67\nassert poly(-16) == -235\nassert poly(8) == -67\nassert poly(0) == 5", "answer": "def poly(x):\n return -1 * x ** 2 + (-1) * x + (5)", "completion": " ```python\ndef poly(x):\n return -1 * x ** 2 + (-1) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -1x² - 1x + 5 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `-67`.\nالجواب:", "qhash": "2fa02258fced004f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 71", "tests": ["assert fact_mod(9) == 20", "assert fact_mod(30) == 17", "assert fact_mod(58) == 55", "assert fact_mod(22) == 53", "assert fact_mod(0) == 1", "assert fact_mod(6) == 18", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(9) == 20\nassert fact_mod(30) == 17\nassert fact_mod(58) == 55\nassert fact_mod(22) == 53\nassert fact_mod(0) == 1\nassert fact_mod(6) == 18\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 71", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(9)` يُرجع `20`.\nالجواب:", "qhash": "969e2cb613181698"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 224\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 = 224\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": "cc33e0cacaef82b1", "answer": "21", "completion": " الناتج:\n```text\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['desert', 'signal', 'pixel', 'stone', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['desert', 'signal', 'pixel', 'stone', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "2f13fde2475d6e7c", "answer": "['pixel', 'stone', 'desert', 'signal', 'rocket']\n['signal', 'rocket', 'desert']", "completion": " الناتج:\n```text\n['pixel', 'stone', 'desert', 'signal', 'rocket']\n['signal', 'rocket', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 97", "tests": ["assert multi_fact(4) == 8", "assert multi_fact(40) == 55", "assert multi_fact(38) == 62", "assert multi_fact(14) == 70", "assert multi_fact(36) == 68", "assert multi_fact(38) == 62", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(4) == 8\nassert multi_fact(40) == 55\nassert multi_fact(38) == 62\nassert multi_fact(14) == 70\nassert multi_fact(36) == 68\nassert multi_fact(38) == 62\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 97", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(4)` يُرجع `8`.\nالجواب:", "qhash": "d3489e1a283c9f03"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'فيصل': 0, 'علي': 30, 'خالد': 50, 'يوسف': 10, 'سعيد': 39}\nmarks['يوسف'] += 6\nmarks['أحمد'] = 12\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 31])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'فيصل': 0, 'علي': 30, 'خالد': 50, 'يوسف': 10, 'سعيد': 39}\nmarks['يوسف'] += 6\nmarks['أحمد'] = 12\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 31])\n```\nالجواب:", "qhash": "3c4ad14c2a853adf", "answer": "6\nخالد\n147\n['خالد', 'سعيد']", "completion": " الناتج:\n```text\n6\nخالد\n147\n['خالد', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('of window desert coffee stone garden by cloud') == 'cloud|by|garden|stone|coffee|desert|window|of'", "assert mirror_words('of apple falcon engine') == 'engine|falcon|apple|of'", "assert mirror_words('of stone matrix an up we') == 'we|up|an|matrix|stone|of'", "assert mirror_words('go camel garden winter cloud cloud') == 'cloud|cloud|winter|garden|camel|go'", "assert mirror_words('cloud code go a falcon music apple up') == 'up|apple|music|falcon|a|go|code|cloud'", "assert mirror_words('light') == 'light'", "assert mirror_words('') == ''"], "test_code": "assert mirror_words('of window desert coffee stone garden by cloud') == 'cloud|by|garden|stone|coffee|desert|window|of'\nassert mirror_words('of apple falcon engine') == 'engine|falcon|apple|of'\nassert mirror_words('of stone matrix an up we') == 'we|up|an|matrix|stone|of'\nassert mirror_words('go camel garden winter cloud cloud') == 'cloud|cloud|winter|garden|camel|go'\nassert mirror_words('cloud code go a falcon music apple up') == 'up|apple|music|falcon|a|go|code|cloud'\nassert mirror_words('light') == 'light'\nassert mirror_words('') == ''", "answer": "def mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `mirror_words('of window desert coffee stone garden by cloud')` يجب أن تُرجع `'cloud|by|garden|stone|coffee|desert|window|of'`.\nالجواب:", "qhash": "613aa64c67068d45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 10\nfor i in range(7, 32, 1):\n s += i * 4\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 10\nfor i in range(7, 32, 1):\n s += i * 4\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "f2cf31576c4d7182", "answer": "1910\n31", "completion": " الناتج:\n```text\n1910\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_div([88, 21, 48, 30, 41, 84, 71, 25, 2]) == 2", "assert count_div([58, 18, -6, 25, -38, 42, 30, 69, 60]) == 3", "assert count_div([59, 69, 65, 52]) == 0", "assert count_div([-23, -34, 88, -19]) == 0", "assert count_div([-32, 59, 24, -25, 60, -16, 83, -3, 57, -21, 90, 40]) == 1", "assert count_div([47, 39, -22, 36, 13, 35]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([88, 21, 48, 30, 41, 84, 71, 25, 2]) == 2\nassert count_div([58, 18, -6, 25, -38, 42, 30, 69, 60]) == 3\nassert count_div([59, 69, 65, 52]) == 0\nassert count_div([-23, -34, 88, -19]) == 0\nassert count_div([-32, 59, 24, -25, 60, -16, 83, -3, 57, -21, 90, 40]) == 1\nassert count_div([47, 39, -22, 36, 13, 35]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([88, 21, 48, 30, 41, 84, 71, 25, 2])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "eb10b483b7227134"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=0):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(9))\nprint(h(9, -10))\nprint(h(h(-10), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=0):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(9))\nprint(h(9, -10))\nprint(h(h(-10), 9))\n```\nالجواب:", "qhash": "48146e6176b7345e", "answer": "27\n37\n17", "completion": " الناتج:\n```text\n27\n37\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([21, 14, 17, 7, 15]) == [21, 0, 17, 24, 0]", "assert cumulative([-9, 4, -5, 28, -8]) == [-9, -5, -10, 18, 10]", "assert cumulative([29, 8, -8, 8]) == [29, 0, -8, 0]", "assert cumulative([]) == []", "assert cumulative([1]) == [1]", "assert cumulative([22, 2, 20, 8, -9, 25, 19, 0]) == [22, 24, 0, 8, -1, 24, 0, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([21, 14, 17, 7, 15]) == [21, 0, 17, 24, 0]\nassert cumulative([-9, 4, -5, 28, -8]) == [-9, -5, -10, 18, 10]\nassert cumulative([29, 8, -8, 8]) == [29, 0, -8, 0]\nassert cumulative([]) == []\nassert cumulative([1]) == [1]\nassert cumulative([22, 2, 20, 8, -9, 25, 19, 0]) == [22, 24, 0, 8, -1, 24, 0, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\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 > 34:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 34 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([21, 14, 17, 7, 15])` يجب أن تُرجع `[21, 0, 17, 24, 0]`.\nالجواب:", "qhash": "fb824e110b912b3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 358\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 = 358\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": "6994e21e327a3589", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'نور': 5, 'سعيد': 8, 'رنا': 12, 'عمر': 2, 'خالد': 10}\npoints['نور'] += 18\npoints['ليلى'] = 8\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'نور': 5, 'سعيد': 8, 'رنا': 12, 'عمر': 2, 'خالد': 10}\npoints['نور'] += 18\npoints['ليلى'] = 8\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))\n```\nالجواب:", "qhash": "022859a4cdb4a8d7", "answer": "6\nنور\n63\n10", "completion": " الناتج:\n```text\n6\nنور\n63\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 22) == 1)", "tests": ["assert rel_prime_count(75) == 35", "assert rel_prime_count(18) == 8", "assert rel_prime_count(107) == 49", "assert rel_prime_count(198) == 90", "assert rel_prime_count(80) == 36", "assert rel_prime_count(167) == 76", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(75) == 35\nassert rel_prime_count(18) == 8\nassert rel_prime_count(107) == 49\nassert rel_prime_count(198) == 90\nassert rel_prime_count(80) == 36\nassert rel_prime_count(167) == 76\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, 22) == 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, 22) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 22، أي أن القاسم المشترك الأكبر لها مع 22 يساوي 1.\nمثال: `rel_prime_count(75)` يجب أن تُرجع `35`.\nالجواب:", "qhash": "7f9606792b1f71e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=8):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(f(-6))\nprint(f(-6, 15))\nprint(f(f(15), -6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=8):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(f(-6))\nprint(f(-6, 15))\nprint(f(f(15), -6))\n```\nالجواب:", "qhash": "e42acb344d059235", "answer": "-6\n-6\n-8", "completion": " الناتج:\n```text\n-6\n-6\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [23, -2, -3, 13, 23, 36]\nprint(data[3:4])\nprint(data[::-2])\nprint(len(data[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [23, -2, -3, 13, 23, 36]\nprint(data[3:4])\nprint(data[::-2])\nprint(len(data[3:4]))\n```\nالجواب:", "qhash": "f8da836639c55090", "answer": "[13]\n[36, 13, -2]\n1", "completion": " الناتج:\n```text\n[13]\n[36, 13, -2]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'in'}", "tests": ["assert count_chars('music') == {'i': 1, 'n': 0}", "assert count_chars('it') == {'i': 1, 'n': 0}", "assert count_chars('vector river river data rocket') == {'i': 2, 'n': 0}", "assert count_chars('data engine coffee an garden') == {'i': 1, 'n': 4}", "assert count_chars('coffee python banana winter music garden') == {'i': 2, 'n': 5}", "assert count_chars('we to summer orange by river') == {'i': 1, 'n': 1}", "assert count_chars('') == {'i': 0, 'n': 0}"], "test_code": "assert count_chars('music') == {'i': 1, 'n': 0}\nassert count_chars('it') == {'i': 1, 'n': 0}\nassert count_chars('vector river river data rocket') == {'i': 2, 'n': 0}\nassert count_chars('data engine coffee an garden') == {'i': 1, 'n': 4}\nassert count_chars('coffee python banana winter music garden') == {'i': 2, 'n': 5}\nassert count_chars('we to summer orange by river') == {'i': 1, 'n': 1}\nassert count_chars('') == {'i': 0, 'n': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'in'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'in'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'i'، 'n' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('music')` يُرجع `{'i': 1, 'n': 0}`.\nالجواب:", "qhash": "5b8999dac7fc9b1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(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_special([39, 80, 2, 78, 32, 69, 21, 20]) == 0", "assert count_special([-36, 39, 8, -28, 38, 47, -2, 50, 89, 74, 82]) == 0", "assert count_special([87, 43, -28]) == 0", "assert count_special([-4]) == 0", "assert count_special([-32]) == 0", "assert count_special([54, 41, -14, 32, -13, -38, -18, -12, 77, 66, 42]) == 2", "assert count_special([]) == 0"], "test_code": "assert count_special([39, 80, 2, 78, 32, 69, 21, 20]) == 0\nassert count_special([-36, 39, 8, -28, 38, 47, -2, 50, 89, 74, 82]) == 0\nassert count_special([87, 43, -28]) == 0\nassert count_special([-4]) == 0\nassert count_special([-32]) == 0\nassert count_special([54, 41, -14, 32, -13, -38, -18, -12, 77, 66, 42]) == 2\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_special([39, 80, 2, 78, 32, 69, 21, 20])` يُرجع `0`.\nالجواب:", "qhash": "119547728f13d7d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 2 for x in range(0, 6) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 2 for x in range(0, 6) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "78778cf42e771296", "answer": "[-1, 7, 23]\n3 29", "completion": " الناتج:\n```text\n[-1, 7, 23]\n3 29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-2, 27, 33, 38, -5, 10, -9, -3, 27]\nprint(a[0:4])\nprint(a[::3])\nprint(max(a[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-2, 27, 33, 38, -5, 10, -9, -3, 27]\nprint(a[0:4])\nprint(a[::3])\nprint(max(a[0:4]))\n```\nالجواب:", "qhash": "d90040e3b54f7b79", "answer": "[-2, 27, 33, 38]\n[-2, 38, -9]\n38", "completion": " الناتج:\n```text\n[-2, 27, 33, 38]\n[-2, 38, -9]\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [-6, 9, 37, 30, 18, 37, 15]\nprint(a[2:5])\nprint(a[::-1])\nprint(sum(a[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [-6, 9, 37, 30, 18, 37, 15]\nprint(a[2:5])\nprint(a[::-1])\nprint(sum(a[2:5]))\n```\nالجواب:", "qhash": "66937b558e8bc76b", "answer": "[37, 30, 18]\n[15, 37, 18, 30, 37, 9, -6]\n85", "completion": " الناتج:\n```text\n[37, 30, 18]\n[15, 37, 18, 30, 37, 9, -6]\n85\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([-8, 31, 29, -3, 8, 42, -19, -22]) == None", "assert top_divisible([-60, -36, -36]) == -36", "assert top_divisible([1, 13, 25, 37]) == None", "assert top_divisible([39, 36, -37, -21, -21, -10, -16]) == 36", "assert top_divisible([-5, -14, -27, -29]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-8, 31, 29, -3, 8, 42, -19, -22]) == None\nassert top_divisible([-60, -36, -36]) == -36\nassert top_divisible([1, 13, 25, 37]) == None\nassert top_divisible([39, 36, -37, -21, -21, -10, -16]) == 36\nassert top_divisible([-5, -14, -27, -29]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 12 == 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 % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(arr):\n best = 0\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(arr):\n best = 0\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `top_divisible([-8, 31, 29, -3, 8, 42, -19, -22])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "5e1d98d4714e5185"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([26, -26, 57, 47]) == None", "assert find_max_div([-24, -40, -24]) == -24", "assert find_max_div([1, 9, 17]) == None", "assert find_max_div([-35, 1, -13, 11]) == None", "assert find_max_div([28, 37, -44, -18, 49, 7, 42, -50, 38]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([26, -26, 57, 47]) == None\nassert find_max_div([-24, -40, -24]) == -24\nassert find_max_div([1, 9, 17]) == None\nassert find_max_div([-35, 1, -13, 11]) == None\nassert find_max_div([28, 37, -44, -18, 49, 7, 42, -50, 38]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(values):\n best = 0\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 find_max_div(values):\n best = 0\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مثال: `find_max_div([26, -26, 57, 47])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "5766f963f2617712"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]", "tests": ["assert roll([33, 49, 47, 39, 5, 10]) == [47, 39, 5, 10, 33, 49]", "assert roll([-1, 45, 35, 44, 45, -6, 50]) == [-1, 45, 35, 44, 45, -6, 50]", "assert roll([42, -2, 16, 31, 8, 48, 44, 19, 27, 2]) == [8, 48, 44, 19, 27, 2, 42, -2, 16, 31]", "assert roll([-5, -3, 35, 26, -1, 8, -1]) == [-5, -3, 35, 26, -1, 8, -1]", "assert roll([5, 22]) == [5, 22]", "assert roll([3, 27, 24]) == [24, 3, 27]", "assert roll([]) == []"], "test_code": "assert roll([33, 49, 47, 39, 5, 10]) == [47, 39, 5, 10, 33, 49]\nassert roll([-1, 45, 35, 44, 45, -6, 50]) == [-1, 45, 35, 44, 45, -6, 50]\nassert roll([42, -2, 16, 31, 8, 48, 44, 19, 27, 2]) == [8, 48, 44, 19, 27, 2, 42, -2, 16, 31]\nassert roll([-5, -3, 35, 26, -1, 8, -1]) == [-5, -3, 35, 26, -1, 8, -1]\nassert roll([5, 22]) == [5, 22]\nassert roll([3, 27, 24]) == [24, 3, 27]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef roll(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(items):\n if not items:\n return []\n k = 14 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `roll([33, 49, 47, 39, 5, 10])` يُرجع `[47, 39, 5, 10, 33, 49]`.\nالجواب:", "qhash": "c4365267cfd69de9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'summer_garden'\nprint(name.replace('m', '#'))\nprint(name.capitalize())\nprint(name[3:8])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'summer_garden'\nprint(name.replace('m', '#'))\nprint(name.capitalize())\nprint(name[3:8])\n```\nالجواب:", "qhash": "57d565cd039040b6", "answer": "su##er_garden\nSummer_garden\nmer_g", "completion": " الناتج:\n```text\nsu##er_garden\nSummer_garden\nmer_g\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 13) == 1)", "tests": ["assert coprimes(118) == 109", "assert coprimes(128) == 119", "assert coprimes(104) == 96", "assert coprimes(42) == 39", "assert coprimes(172) == 159", "assert coprimes(121) == 112", "assert coprimes(1) == 1"], "test_code": "assert coprimes(118) == 109\nassert coprimes(128) == 119\nassert coprimes(104) == 96\nassert coprimes(42) == 39\nassert coprimes(172) == 159\nassert coprimes(121) == 112\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, 13) == 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, 13) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 13، أي أن القاسم المشترك الأكبر لها مع 13 يساوي 1.\nمثال: `coprimes(118)` يجب أن تُرجع `109`.\nالجواب:", "qhash": "9722054b7290c3c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 1\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 + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(18))\n```\nالجواب:", "qhash": "d7638610d993bbc3", "answer": "6765", "completion": " الناتج:\n```text\n6765\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('stone by rocket winter garden banana of cloud') == 'cloud-of-banana-garden-winter-rocket-by-stone'", "assert rev_long_words('brain') == 'brain'", "assert rev_long_words('we summer cloud data table signal camel garden') == 'garden-camel-signal-table-data-cloud-summer-we'", "assert rev_long_words('garden') == 'garden'", "assert rev_long_words('we river is') == 'is-river-we'", "assert rev_long_words('we summer light') == 'light-summer-we'", "assert rev_long_words('we') == 'we'"], "test_code": "assert rev_long_words('stone by rocket winter garden banana of cloud') == 'cloud-of-banana-garden-winter-rocket-by-stone'\nassert rev_long_words('brain') == 'brain'\nassert rev_long_words('we summer cloud data table signal camel garden') == 'garden-camel-signal-table-data-cloud-summer-we'\nassert rev_long_words('garden') == 'garden'\nassert rev_long_words('we river is') == 'is-river-we'\nassert rev_long_words('we summer light') == 'light-summer-we'\nassert rev_long_words('we') == 'we'", "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('stone by rocket winter garden banana of cloud')` يجب أن تُرجع `'cloud-of-banana-garden-winter-rocket-by-stone'`.\nالجواب:", "qhash": "97a737cf247683d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['summer', 'engine', 'data', 'python', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['summer', 'engine', 'data', 'python', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "d341cb2008e230fe", "answer": "['data', 'apple', 'summer', 'engine', 'python']\n['summer', 'python', 'engine']", "completion": " الناتج:\n```text\n['data', 'apple', 'summer', 'engine', 'python']\n['summer', 'python', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 13\nfor x in range(-1, 10, 2):\n acc += x * 8\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 13\nfor x in range(-1, 10, 2):\n acc += x * 8\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "d88307b4b786a947", "answer": "205\n9", "completion": " الناتج:\n```text\n205\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "tests": ["assert total_multiples(148) == 2817", "assert total_multiples(163) == 3444", "assert total_multiples(42) == 225", "assert total_multiples(86) == 930", "assert total_multiples(122) == 1863", "assert total_multiples(297) == 11105", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(148) == 2817\nassert total_multiples(163) == 3444\nassert total_multiples(42) == 225\nassert total_multiples(86) == 930\nassert total_multiples(122) == 1863\nassert total_multiples(297) == 11105\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(148)` يُرجع `2817`.\nالجواب:", "qhash": "b66d0ef669ffc52b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('at orange winter banana OK') == 'oh cfobus kwbhsf pobobo OK'", "assert cipher('garden desert window') == 'uofrsb rsgsfh kwbrck'", "assert cipher('it matrix !') == 'wh aohfwl !'", "assert cipher('garden A1') == 'uofrsb A1'", "assert cipher('in summer brain') == 'wb giaasf pfowb'", "assert cipher('cloud') == 'qzcir'", "assert cipher('') == ''"], "test_code": "assert cipher('at orange winter banana OK') == 'oh cfobus kwbhsf pobobo OK'\nassert cipher('garden desert window') == 'uofrsb rsgsfh kwbrck'\nassert cipher('it matrix !') == 'wh aohfwl !'\nassert cipher('garden A1') == 'uofrsb A1'\nassert cipher('in summer brain') == 'wb giaasf pfowb'\nassert cipher('cloud') == 'qzcir'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('at orange winter banana OK')` يجب أن تُرجع `'oh cfobus kwbhsf pobobo OK'`.\nالجواب:", "qhash": "44dce372b83e5d7f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'signal'\nprint(name.capitalize())\nprint(name.count('g'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'signal'\nprint(name.capitalize())\nprint(name.count('g'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "39c519eae64c7913", "answer": "Signal\n1\nlangis", "completion": " الناتج:\n```text\nSignal\n1\nlangis\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 67", "tests": ["assert prod_mod(8) == 53", "assert prod_mod(11) == 9", "assert prod_mod(8) == 53", "assert prod_mod(47) == 7", "assert prod_mod(38) == 27", "assert prod_mod(32) == 2", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(8) == 53\nassert prod_mod(11) == 9\nassert prod_mod(8) == 53\nassert prod_mod(47) == 7\nassert prod_mod(38) == 27\nassert prod_mod(32) == 2\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 67", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(8)` يجب أن تُرجع `53`.\nالجواب:", "qhash": "a721aa226e73782c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 279\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 = 279\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": "584b7bb7355d3c53", "answer": "42", "completion": " الناتج:\n```text\n42\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'code_orange'\nprint(s[::-1])\nprint(s.count('o'))\nprint(s.find('o'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'code_orange'\nprint(s[::-1])\nprint(s.count('o'))\nprint(s.find('o'))\n```\nالجواب:", "qhash": "e6656206afc11dee", "answer": "egnaro_edoc\n2\n1", "completion": " الناتج:\n```text\negnaro_edoc\n2\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([8, 11, 13, 12, 20, 20, 36]) == [8, 19, 32, 44, 64, 0, 36]", "assert capped_cumsum([0, 25, -10, 21, 1, 23, 20, 11, 24]) == [0, 25, 15, 36, 37, 60, 0, 11, 35]", "assert capped_cumsum([19, 41, 28]) == [19, 60, 0]", "assert capped_cumsum([37, -4, 20, 55, 3]) == [37, 33, 53, 0, 3]", "assert capped_cumsum([42, 50, -2, 59, 55, 64, 30, 2, 41]) == [42, 0, -2, 57, 0, 64, 0, 2, 43]", "assert capped_cumsum([13, 22, -2, 52, 37, -10, 28, 20, 44, 22]) == [13, 35, 33, 0, 37, 27, 55, 0, 44, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([8, 11, 13, 12, 20, 20, 36]) == [8, 19, 32, 44, 64, 0, 36]\nassert capped_cumsum([0, 25, -10, 21, 1, 23, 20, 11, 24]) == [0, 25, 15, 36, 37, 60, 0, 11, 35]\nassert capped_cumsum([19, 41, 28]) == [19, 60, 0]\nassert capped_cumsum([37, -4, 20, 55, 3]) == [37, 33, 53, 0, 3]\nassert capped_cumsum([42, 50, -2, 59, 55, 64, 30, 2, 41]) == [42, 0, -2, 57, 0, 64, 0, 2, 43]\nassert capped_cumsum([13, 22, -2, 52, 37, -10, 28, 20, 44, 22]) == [13, 35, 33, 0, 37, 27, 55, 0, 44, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(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 capped_cumsum(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سؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 64 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([8, 11, 13, 12, 20, 20, 36])` يجب أن تُرجع `[8, 19, 32, 44, 64, 0, 36]`.\nالجواب:", "qhash": "99dc0a94f5df037e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9']", "assert fizzbuzz(2) == ['1', '2']", "assert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9', '10', '11', '12', '13', 'Foo', '15', 'Bar', '17']", "assert fizzbuzz(19) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9', '10', '11', '12', '13', 'Foo', '15', 'Bar', '17', '18', '19']", "assert fizzbuzz(6) == ['1', '2', '3', '4', '5', '6']"], "test_code": "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9']\nassert fizzbuzz(2) == ['1', '2']\nassert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9', '10', '11', '12', '13', 'Foo', '15', 'Bar', '17']\nassert fizzbuzz(19) == ['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9', '10', '11', '12', '13', 'Foo', '15', 'Bar', '17', '18', '19']\nassert fizzbuzz(6) == ['1', '2', '3', '4', '5', '6']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 8 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(9)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', 'Bar', '9']`.\nالجواب:", "qhash": "33b6d244cdea31cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [40, 30, 12, 9, 15]\nprint(xs[0:1])\nprint(xs[::-1])\nprint(sum(xs[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [40, 30, 12, 9, 15]\nprint(xs[0:1])\nprint(xs[::-1])\nprint(sum(xs[0:1]))\n```\nالجواب:", "qhash": "06b127818608c79b", "answer": "[40]\n[15, 9, 12, 30, 40]\n40", "completion": " الناتج:\n```text\n[40]\n[15, 9, 12, 30, 40]\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -4 for x in xs if 12 <= x <= 29)", "tests": ["assert between_times([17, 35, 38, 39, 18]) == [-72, -68]", "assert between_times([-24, -3, 39]) == []", "assert between_times([34]) == []", "assert between_times([14, -25]) == [-56]", "assert between_times([19, 32, -20, -29, -22, 0, -23]) == [-76]", "assert between_times([]) == []", "assert between_times([8, 16, 23, 28, 8, 13, 20, 4]) == [-112, -92, -80, -64, -52]", "assert between_times([]) == []"], "test_code": "assert between_times([17, 35, 38, 39, 18]) == [-72, -68]\nassert between_times([-24, -3, 39]) == []\nassert between_times([34]) == []\nassert between_times([14, -25]) == [-56]\nassert between_times([19, 32, -20, -29, -22, 0, -23]) == [-76]\nassert between_times([]) == []\nassert between_times([8, 16, 23, 28, 8, 13, 20, 4]) == [-112, -92, -80, -64, -52]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -4 for x in xs if 12 <= x <= 29)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -4 for x in xs if 12 <= x <= 29)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 12 ≤ x ≤ 29، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([17, 35, 38, 39, 18])` يُرجع `[-72, -68]`.\nالجواب:", "qhash": "f2e42eb90aac7bfa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'blo'}", "tests": ["assert count_chars('light light') == {'b': 0, 'l': 2, 'o': 0}", "assert count_chars('to by planet matrix banana') == {'b': 2, 'l': 1, 'o': 1}", "assert count_chars('to we up music') == {'b': 0, 'l': 0, 'o': 1}", "assert count_chars('signal on to we is orange') == {'b': 0, 'l': 1, 'o': 3}", "assert count_chars('vector engine we') == {'b': 0, 'l': 0, 'o': 1}", "assert count_chars('an pixel an coffee up matrix') == {'b': 0, 'l': 1, 'o': 1}", "assert count_chars('') == {'b': 0, 'l': 0, 'o': 0}"], "test_code": "assert count_chars('light light') == {'b': 0, 'l': 2, 'o': 0}\nassert count_chars('to by planet matrix banana') == {'b': 2, 'l': 1, 'o': 1}\nassert count_chars('to we up music') == {'b': 0, 'l': 0, 'o': 1}\nassert count_chars('signal on to we is orange') == {'b': 0, 'l': 1, 'o': 3}\nassert count_chars('vector engine we') == {'b': 0, 'l': 0, 'o': 1}\nassert count_chars('an pixel an coffee up matrix') == {'b': 0, 'l': 1, 'o': 1}\nassert count_chars('') == {'b': 0, 'l': 0, 'o': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'blo'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'blo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'l'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('light light')` يجب أن تُرجع `{'b': 0, 'l': 2, 'o': 0}`.\nالجواب:", "qhash": "c7c46f722c73b651"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'حديقة نور'\nprint(s.count('ن'))\nprint(len(s))\nprint('ن' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'حديقة نور'\nprint(s.count('ن'))\nprint(len(s))\nprint('ن' in s)\n```\nالجواب:", "qhash": "3a02c37546531986", "answer": "1\n9\nTrue", "completion": " الناتج:\n```text\n1\n9\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['table', 'falcon', 'rocket', 'data', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['table', 'falcon', 'rocket', 'data', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "c3a4d466c01885b7", "answer": "['data', 'code', 'table', 'falcon', 'rocket']\n['rocket', 'falcon', 'table']", "completion": " الناتج:\n```text\n['data', 'code', 'table', 'falcon', 'rocket']\n['rocket', 'falcon', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "tests": ["assert power_sum(5) == 1350", "assert power_sum(10) == 18150", "assert power_sum(7) == 4704", "assert power_sum(8) == 7776", "assert power_sum(11) == 26136", "assert power_sum(1) == 6", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 1350\nassert power_sum(10) == 18150\nassert power_sum(7) == 4704\nassert power_sum(8) == 7776\nassert power_sum(11) == 26136\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 ** 3\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total\n```\nمثال: `power_sum(5)` يجب أن تُرجع `1350`.\nالجواب:", "qhash": "f04e5ed74a1db94d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=0):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(0))\nprint(g(0, 1))\nprint(g(g(1), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=0):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(0))\nprint(g(0, 1))\nprint(g(g(1), 0))\n```\nالجواب:", "qhash": "0006a47c2497965e", "answer": "0\n8\n64", "completion": " الناتج:\n```text\n0\n8\n64\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(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 max_div([24, 47, 5, 35, -14]) == None", "assert max_div([-18, -18, -27]) == -18", "assert max_div([1, 10, 19]) == None", "assert max_div([32]) == None", "assert max_div([0, -21, -6]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([24, 47, 5, 35, -14]) == None\nassert max_div([-18, -18, -27]) == -18\nassert max_div([1, 10, 19]) == None\nassert max_div([32]) == None\nassert max_div([0, -21, -6]) == 0\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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 max_div(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للتوضيح: الاستدعاء `max_div([24, 47, 5, 35, -14])` يُرجع `None`.\nالجواب:", "qhash": "a97fe5d8faf61afe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حصان صديق مطر سفينة مدينة') == 0", "assert count_prefix('حديقة باب ليل لغة سلام') == 2", "assert count_prefix('ليل مدينة دفتر ليل سماء برتقال دفتر') == 2", "assert count_prefix('جمل حصان') == 0", "assert count_prefix('لغة حصان لغة معلم حاسوب طالب قلم') == 2", "assert count_prefix('ليل كتاب مطر لغة سيارة') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('حصان صديق مطر سفينة مدينة') == 0\nassert count_prefix('حديقة باب ليل لغة سلام') == 2\nassert count_prefix('ليل مدينة دفتر ليل سماء برتقال دفتر') == 2\nassert count_prefix('جمل حصان') == 0\nassert count_prefix('لغة حصان لغة معلم حاسوب طالب قلم') == 2\nassert count_prefix('ليل كتاب مطر لغة سيارة') == 2\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:\n if w.startswith('ل'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ل»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_prefix(sentence):\n count = 0\n for w in sentence:\n if w.startswith('ل'):\n count += 1\n return count\n```\nمثال: `count_prefix('حصان صديق مطر سفينة مدينة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ce8f339719172f64"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(239) == 6435", "assert total_multiples(297) == 10171", "assert total_multiples(220) == 5530", "assert total_multiples(255) == 7420", "assert total_multiples(10) == 6", "assert total_multiples(282) == 9021", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(239) == 6435\nassert total_multiples(297) == 10171\nassert total_multiples(220) == 5530\nassert total_multiples(255) == 7420\nassert total_multiples(10) == 6\nassert total_multiples(282) == 9021\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(239)` يُرجع `6435`.\nالجواب:", "qhash": "d17c9ef8806634dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=1):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(g(9))\nprint(g(9, 7))\nprint(g(g(7), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=1):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(g(9))\nprint(g(9, 7))\nprint(g(g(7), 9))\n```\nالجواب:", "qhash": "876a7c13fa6b2991", "answer": "-1\n-7\n-1", "completion": " الناتج:\n```text\n-1\n-7\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'سعيد': 36, 'باسل': 2, 'رنا': 17, 'عمر': 29, 'زينب': 37}\nmarks['باسل'] += 10\nmarks['مريم'] = 4\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'سعيد': 36, 'باسل': 2, 'رنا': 17, 'عمر': 29, 'زينب': 37}\nmarks['باسل'] += 10\nmarks['مريم'] = 4\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('باسل', -1))\n```\nالجواب:", "qhash": "212a7917d7460f67", "answer": "6\nزينب\n135\n12", "completion": " الناتج:\n```text\n6\nزينب\n135\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -3 for x in xs if -9 <= x <= 11)", "tests": ["assert select_range([0, -16, 8, -14, 0, 7, 10, 15]) == [-30, -24, -21, 0, 0]", "assert select_range([-22, 15]) == []", "assert select_range([7]) == [-21]", "assert select_range([-7, -26, 4, -22, 19, 0, 27, 41, 23, -13]) == [-12, 0, 21]", "assert select_range([49, 40, 51, -29, 47, 38]) == []", "assert select_range([8, 25, 0, -8, 10]) == [-30, -24, 0, 24]", "assert select_range([-9, 55, 50, 30, 30, -14]) == [27]", "assert select_range([]) == []"], "test_code": "assert select_range([0, -16, 8, -14, 0, 7, 10, 15]) == [-30, -24, -21, 0, 0]\nassert select_range([-22, 15]) == []\nassert select_range([7]) == [-21]\nassert select_range([-7, -26, 4, -22, 19, 0, 27, 41, 23, -13]) == [-12, 0, 21]\nassert select_range([49, 40, 51, -29, 47, 38]) == []\nassert select_range([8, 25, 0, -8, 10]) == [-30, -24, 0, 24]\nassert select_range([-9, 55, 50, 30, 30, -14]) == [27]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -3 for x in xs if -9 <= x <= 11)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -3 for x in xs if -9 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -9 ≤ x ≤ 11، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([0, -16, 8, -14, 0, 7, 10, 15])` يُرجع `[-30, -24, -21, 0, 0]`.\nالجواب:", "qhash": "4cca918b9500e57f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "tests": ["assert sum_multiples(78) == 976", "assert sum_multiples(266) == 11748", "assert sum_multiples(27) == 108", "assert sum_multiples(126) == 2584", "assert sum_multiples(222) == 8104", "assert sum_multiples(51) == 408", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(78) == 976\nassert sum_multiples(266) == 11748\nassert sum_multiples(27) == 108\nassert sum_multiples(126) == 2584\nassert sum_multiples(222) == 8104\nassert sum_multiples(51) == 408\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 % 6 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 6، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(78)` يُرجع `976`.\nالجواب:", "qhash": "a0da6eece692c6e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([15, 48, 91, 21, 29, 60, 10, 81, 39]) == [15, 63, 154, 0, 29, 89, 99, 0, 39]", "assert cumulative([36, 79, 107, 42, 45, 90]) == [36, 115, 0, 42, 87, 0]", "assert cumulative([]) == []", "assert cumulative([12, 75]) == [12, 87]", "assert cumulative([68, 123, 60, 67, -1, 62, 28]) == [68, 0, 60, 127, 126, 0, 28]", "assert cumulative([-6]) == [-6]", "assert cumulative([]) == []"], "test_code": "assert cumulative([15, 48, 91, 21, 29, 60, 10, 81, 39]) == [15, 63, 154, 0, 29, 89, 99, 0, 39]\nassert cumulative([36, 79, 107, 42, 45, 90]) == [36, 115, 0, 42, 87, 0]\nassert cumulative([]) == []\nassert cumulative([12, 75]) == [12, 87]\nassert cumulative([68, 123, 60, 67, -1, 62, 28]) == [68, 0, 60, 127, 126, 0, 28]\nassert cumulative([-6]) == [-6]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\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 > 174:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 174 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([15, 48, 91, 21, 29, 60, 10, 81, 39])` يُرجع `[15, 63, 154, 0, 29, 89, 99, 0, 39]`.\nالجواب:", "qhash": "de04e152cd0aec26"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 5 for x in range(5, 16) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 5 for x in range(5, 16) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "818fdf88a2b81eb5", "answer": "[44, 95, 164]\n3 303", "completion": " الناتج:\n```text\n[44, 95, 164]\n3 303\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'مريم': 7, 'أحمد': 3, 'علي': 45, 'هدى': 8}\npoints['علي'] += 16\npoints['خالد'] = 37\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 30])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'مريم': 7, 'أحمد': 3, 'علي': 45, 'هدى': 8}\npoints['علي'] += 16\npoints['خالد'] = 37\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 30])\n```\nالجواب:", "qhash": "ac5b4dd771d2ce78", "answer": "5\nعلي\n116\n['علي', 'خالد']", "completion": " الناتج:\n```text\n5\nعلي\n116\n['علي', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ghu'}", "tests": ["assert freq_of('stone signal') == {'g': 1, 'h': 0, 'u': 0}", "assert freq_of('garden vector code signal engine river') == {'g': 3, 'h': 0, 'u': 0}", "assert freq_of('brain') == {'g': 0, 'h': 0, 'u': 0}", "assert freq_of('table') == {'g': 0, 'h': 0, 'u': 0}", "assert freq_of('window is rocket') == {'g': 0, 'h': 0, 'u': 0}", "assert freq_of('brain vector') == {'g': 0, 'h': 0, 'u': 0}", "assert freq_of('') == {'g': 0, 'h': 0, 'u': 0}"], "test_code": "assert freq_of('stone signal') == {'g': 1, 'h': 0, 'u': 0}\nassert freq_of('garden vector code signal engine river') == {'g': 3, 'h': 0, 'u': 0}\nassert freq_of('brain') == {'g': 0, 'h': 0, 'u': 0}\nassert freq_of('table') == {'g': 0, 'h': 0, 'u': 0}\nassert freq_of('window is rocket') == {'g': 0, 'h': 0, 'u': 0}\nassert freq_of('brain vector') == {'g': 0, 'h': 0, 'u': 0}\nassert freq_of('') == {'g': 0, 'h': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ghu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ghu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'h'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('stone signal')` يُرجع `{'g': 1, 'h': 0, 'u': 0}`.\nالجواب:", "qhash": "0789ea1ca5a142c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-7, 18, 29, 17, 37, 3, -20]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-7, 18, 29, 17, 37, 3, -20]\nprint(sorted(nums, key=lambda x: (abs(x - -5), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "9b18c5b554f196f3", "answer": "[-7, 3, -20, 17, 18, 29, 37]\n[37, 29, 18]", "completion": " الناتج:\n```text\n[-7, 3, -20, 17, 18, 29, 37]\n[37, 29, 18]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 67", "tests": ["assert step_product(3) == 3", "assert step_product(25) == 13", "assert step_product(59) == 7", "assert step_product(52) == 17", "assert step_product(25) == 13", "assert step_product(6) == 48", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(25) == 13\nassert step_product(59) == 7\nassert step_product(52) == 17\nassert step_product(25) == 13\nassert step_product(6) == 48\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 67", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 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": "4c7b1600227ec1ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'engine_desert'\nprint(text.find('s'))\nprint(text.index('s') + len(text))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'engine_desert'\nprint(text.find('s'))\nprint(text.index('s') + len(text))\nprint(text[::-1])\n```\nالجواب:", "qhash": "31d75b8a8d228f5a", "answer": "9\n22\ntresed_enigne", "completion": " الناتج:\n```text\n9\n22\ntresed_enigne\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'قلم'\nprint(text.count('ا'))\nprint(text.find('ا'))\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'قلم'\nprint(text.count('ا'))\nprint(text.find('ا'))\nprint(text[-1])\n```\nالجواب:", "qhash": "d3be80c15d436113", "answer": "0\n-1\nم", "completion": " الناتج:\n```text\n0\n-1\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 7\nfor n in range(0, 5, 4):\n total += n * 9\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 7\nfor n in range(0, 5, 4):\n total += n * 9\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "59aa11fd67669ce8", "answer": "43\n4", "completion": " الناتج:\n```text\n43\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert backwards('garden falcon river it') == 'river/falcon/garden'", "assert backwards('banana an to of orange banana winter engine') == 'engine/winter/banana/orange/banana'", "assert backwards('by up summer desert cloud') == 'cloud/desert/summer'", "assert backwards('data rocket') == 'rocket/data'", "assert backwards('desert music pixel we it on') == 'pixel/music/desert'", "assert backwards('') == ''", "assert backwards('light coffee matrix window matrix') == 'matrix/window/matrix/coffee/light'"], "test_code": "assert backwards('garden falcon river it') == 'river/falcon/garden'\nassert backwards('banana an to of orange banana winter engine') == 'engine/winter/banana/orange/banana'\nassert backwards('by up summer desert cloud') == 'cloud/desert/summer'\nassert backwards('data rocket') == 'rocket/data'\nassert backwards('desert music pixel we it on') == 'pixel/music/desert'\nassert backwards('') == ''\nassert backwards('light coffee matrix window matrix') == 'matrix/window/matrix/coffee/light'", "answer": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `backwards(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `backwards('garden falcon river it')` يجب أن تُرجع `'river/falcon/garden'`.\nالجواب:", "qhash": "36efc8287478de05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(-2))\nprint(calc(-2, 15))\nprint(calc(calc(15), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(calc(-2))\nprint(calc(-2, 15))\nprint(calc(calc(15), -2))\n```\nالجواب:", "qhash": "03520d8a2a593479", "answer": "10\n88\n530", "completion": " الناتج:\n```text\n10\n88\n530\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 13 == 0)", "tests": ["assert add_multiples(298) == 13609", "assert add_multiples(108) == 1716", "assert add_multiples(99) == 1512", "assert add_multiples(209) == 6760", "assert add_multiples(111) == 1824", "assert add_multiples(263) == 10530", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(298) == 13609\nassert add_multiples(108) == 1716\nassert add_multiples(99) == 1512\nassert add_multiples(209) == 6760\nassert add_multiples(111) == 1824\nassert add_multiples(263) == 10530\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 13 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 13.\nمثال: `add_multiples(298)` يجب أن تُرجع `13609`.\nالجواب:", "qhash": "60827626b47da414"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('cloud brain data') == 'brain cloud'", "assert rev_long_words('matrix orange matrix up on coffee') == 'coffee matrix orange matrix'", "assert rev_long_words('signal rocket') == 'rocket signal'", "assert rev_long_words('falcon') == 'falcon'", "assert rev_long_words('window pixel camel light') == 'light camel pixel window'", "assert rev_long_words('orange an by code camel desert in') == 'desert camel orange'", "assert rev_long_words('river winter rocket') == 'rocket winter river'"], "test_code": "assert rev_long_words('cloud brain data') == 'brain cloud'\nassert rev_long_words('matrix orange matrix up on coffee') == 'coffee matrix orange matrix'\nassert rev_long_words('signal rocket') == 'rocket signal'\nassert rev_long_words('falcon') == 'falcon'\nassert rev_long_words('window pixel camel light') == 'light camel pixel window'\nassert rev_long_words('orange an by code camel desert in') == 'desert camel orange'\nassert rev_long_words('river winter rocket') == 'rocket winter river'", "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('cloud brain data')` يجب أن تُرجع `'brain cloud'`.\nالجواب:", "qhash": "e05985a0a03acdca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 27099\ncount = 0\nwhile m > 9:\n m = m // 3\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 27099\ncount = 0\nwhile m > 9:\n m = m // 3\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "caee2170b4c8a8e5", "answer": "4 8", "completion": " الناتج:\n```text\n4 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'deir'}", "tests": ["assert letter_stats('summer cloud') == {'d': 1, 'e': 1, 'i': 0, 'r': 1}", "assert letter_stats('engine by stone rocket table to') == {'d': 0, 'e': 5, 'i': 1, 'r': 1}", "assert letter_stats('an it') == {'d': 0, 'e': 0, 'i': 1, 'r': 0}", "assert letter_stats('rocket winter code') == {'d': 1, 'e': 3, 'i': 1, 'r': 2}", "assert letter_stats('brain an we') == {'d': 0, 'e': 1, 'i': 1, 'r': 1}", "assert letter_stats('light desert') == {'d': 1, 'e': 2, 'i': 1, 'r': 1}", "assert letter_stats('') == {'d': 0, 'e': 0, 'i': 0, 'r': 0}"], "test_code": "assert letter_stats('summer cloud') == {'d': 1, 'e': 1, 'i': 0, 'r': 1}\nassert letter_stats('engine by stone rocket table to') == {'d': 0, 'e': 5, 'i': 1, 'r': 1}\nassert letter_stats('an it') == {'d': 0, 'e': 0, 'i': 1, 'r': 0}\nassert letter_stats('rocket winter code') == {'d': 1, 'e': 3, 'i': 1, 'r': 2}\nassert letter_stats('brain an we') == {'d': 0, 'e': 1, 'i': 1, 'r': 1}\nassert letter_stats('light desert') == {'d': 1, 'e': 2, 'i': 1, 'r': 1}\nassert letter_stats('') == {'d': 0, 'e': 0, 'i': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'deir'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'deir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'e'، 'i'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('summer cloud')` يجب أن تُرجع `{'d': 1, 'e': 1, 'i': 0, 'r': 1}`.\nالجواب:", "qhash": "0fb7f202ec2a9668"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([23, -23, 40, 16, -10, 24, 13]) == None", "assert max_of_div([-7, -14, -21]) == -7", "assert max_of_div([1, 8]) == None", "assert max_of_div([26, 20, 38, -11, 28, 9]) == 28", "assert max_of_div([-27, -17, -27]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([23, -23, 40, 16, -10, 24, 13]) == None\nassert max_of_div([-7, -14, -21]) == -7\nassert max_of_div([1, 8]) == None\nassert max_of_div([26, 20, 38, -11, 28, 9]) == 28\nassert max_of_div([-27, -17, -27]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_of_div([23, -23, 40, 16, -10, 24, 13])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "f32ef3b6ec4f061a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 5) // 2 for x in range(5, 20) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 5) // 2 for x in range(5, 20) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "bf953059b01836a9", "answer": "[5, 6, 7, 8, 9, 10, 11, 12]\n8 68", "completion": " الناتج:\n```text\n[5, 6, 7, 8, 9, 10, 11, 12]\n8 68\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 15886\ncount = 0\nwhile x > 0:\n x = x // 3\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 15886\ncount = 0\nwhile x > 0:\n x = x // 3\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "6f49ba6d239d5bd6", "answer": "0 9", "completion": " الناتج:\n```text\n0 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=8):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(1))\nprint(calc(1, 4))\nprint(calc(calc(4), 1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=8):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(1))\nprint(calc(1, 4))\nprint(calc(calc(4), 1))\n```\nالجواب:", "qhash": "42c6944296933c4c", "answer": "25\n13\n83", "completion": " الناتج:\n```text\n25\n13\n83\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 59091\nc = 0\nwhile m > 18:\n m = m // 9\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 59091\nc = 0\nwhile m > 18:\n m = m // 9\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "958db7acc87afc50", "answer": "9 4", "completion": " الناتج:\n```text\n9 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "tests": ["assert total_pow(8) == 108", "assert total_pow(9) == 135", "assert total_pow(11) == 198", "assert total_pow(3) == 18", "assert total_pow(10) == 165", "assert total_pow(1) == 3", "assert total_pow(0) == 0"], "test_code": "assert total_pow(8) == 108\nassert total_pow(9) == 135\nassert total_pow(11) == 198\nassert total_pow(3) == 18\nassert total_pow(10) == 165\nassert total_pow(1) == 3\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `total_pow(8)` يُرجع `108`.\nالجواب:", "qhash": "66fa69ba7ba259ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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 max_div([52, 48, -1, -12, -16, 6]) == 48", "assert max_div([-9, -15, -12]) == -9", "assert max_div([1, 4, 7, 10]) == None", "assert max_div([24, -24, 36]) == 36", "assert max_div([49, 14, -15, 44, -6, -49, 0]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([52, 48, -1, -12, -16, 6]) == 48\nassert max_div([-9, -15, -12]) == -9\nassert max_div([1, 4, 7, 10]) == None\nassert max_div([24, -24, 36]) == 36\nassert max_div([49, 14, -15, 44, -6, -49, 0]) == 0\nassert max_div([]) == None", "answer": "def max_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 max_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 max_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 max_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للتوضيح: الاستدعاء `max_div([52, 48, -1, -12, -16, 6])` يُرجع `48`.\nالجواب:", "qhash": "91b26e06da794416"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('to desert by rocket') == 'rocket/desert'", "assert rev_long_words('code brain to window signal coffee') == 'coffee/signal/window'", "assert rev_long_words('') == ''", "assert rev_long_words('we stone window code banana is falcon is') == 'falcon/banana/window'", "assert rev_long_words('') == ''", "assert rev_long_words('go summer coffee winter python') == 'python/winter/coffee/summer'", "assert rev_long_words('python summer go apple go code river river') == 'summer/python'"], "test_code": "assert rev_long_words('to desert by rocket') == 'rocket/desert'\nassert rev_long_words('code brain to window signal coffee') == 'coffee/signal/window'\nassert rev_long_words('') == ''\nassert rev_long_words('we stone window code banana is falcon is') == 'falcon/banana/window'\nassert rev_long_words('') == ''\nassert rev_long_words('go summer coffee winter python') == 'python/winter/coffee/summer'\nassert rev_long_words('python summer go apple go code river river') == 'summer/python'", "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('to desert by rocket')` يجب أن تُرجع `'rocket/desert'`.\nالجواب:", "qhash": "14894ac3b5d880a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('banana it engine coffee banana') == 'utgtgt bm xgzbgx vhyyxx utgtgt'", "assert encode('pixel we at data') == 'ibqxe px tm wtmt'", "assert encode('camel coffee OK') == 'vtfxe vhyyxx OK'", "assert encode('vector') == 'oxvmhk'", "assert encode('at') == 'tm'", "assert encode('engine planet of matrix garden') == 'xgzbgx ietgxm hy ftmkbq ztkwxg'", "assert encode('') == ''"], "test_code": "assert encode('banana it engine coffee banana') == 'utgtgt bm xgzbgx vhyyxx utgtgt'\nassert encode('pixel we at data') == 'ibqxe px tm wtmt'\nassert encode('camel coffee OK') == 'vtfxe vhyyxx OK'\nassert encode('vector') == 'oxvmhk'\nassert encode('at') == 'tm'\nassert encode('engine planet of matrix garden') == 'xgzbgx ietgxm hy ftmkbq ztkwxg'\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 + (19)) % 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 + (19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('banana it engine coffee banana')` يُرجع `'utgtgt bm xgzbgx vhyyxx utgtgt'`.\nالجواب:", "qhash": "563249623fcfad73"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 10 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21']", "assert fizzbuzz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18']", "assert fizzbuzz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(5) == ['1', '2', '3', '4', 'Red']"], "test_code": "assert fizzbuzz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21']\nassert fizzbuzz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18']\nassert fizzbuzz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(5) == ['1', '2', '3', '4', 'Red']", "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 % 10 == 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 % 10 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Red'، وإن قَبِلها على 10 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(21)` يُرجع `['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21']`.\nالجواب:", "qhash": "b83e6d1de64f9866"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 50", "tests": ["assert dig_pow_mod(11487) == 1", "assert dig_pow_mod(871150) == 2", "assert dig_pow_mod(654670) == 8", "assert dig_pow_mod(97343) == 16", "assert dig_pow_mod(890749) == 47", "assert dig_pow_mod(239248) == 48", "assert dig_pow_mod(440912) == 30", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(11487) == 1\nassert dig_pow_mod(871150) == 2\nassert dig_pow_mod(654670) == 8\nassert dig_pow_mod(97343) == 16\nassert dig_pow_mod(890749) == 47\nassert dig_pow_mod(239248) == 48\nassert dig_pow_mod(440912) == 30\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 50", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 50\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 50.\nللتوضيح: الاستدعاء `dig_pow_mod(11487)` يُرجع `1`.\nالجواب:", "qhash": "2021b14c995dd7b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "tests": ["assert power_sum(8) == 26316", "assert power_sum(2) == 51", "assert power_sum(5) == 2937", "assert power_sum(2) == 51", "assert power_sum(8) == 26316", "assert power_sum(1) == 3", "assert power_sum(0) == 0"], "test_code": "assert power_sum(8) == 26316\nassert power_sum(2) == 51\nassert power_sum(5) == 2937\nassert power_sum(2) == 51\nassert power_sum(8) == 26316\nassert power_sum(1) == 3\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 4\n return total\n```\nمثال: `power_sum(8)` يجب أن تُرجع `26316`.\nالجواب:", "qhash": "1ca3f30f5450c8a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 70209\ncount = 0\nwhile m > 3:\n m = m // 9\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 70209\ncount = 0\nwhile m > 3:\n m = m // 9\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "e326998fc56a2e10", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('باسل', 50), ('هشام', 21), ('فيصل', 51), ('هدى', 53)]\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 = [('باسل', 50), ('هشام', 21), ('فيصل', 51), ('هدى', 53)]\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": "48cf1edcbd32f869", "answer": "[('هشام', 21), ('باسل', 50), ('فيصل', 51), ('هدى', 53)]\n['هدى', 'فيصل']", "completion": " الناتج:\n```text\n[('هشام', 21), ('باسل', 50), ('فيصل', 51), ('هدى', 53)]\n['هدى', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 4 for x in range(1, 14) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 4 for x in range(1, 14) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "1d9a77a70681087b", "answer": "[5, 45, 117]\n3 167", "completion": " الناتج:\n```text\n[5, 45, 117]\n3 167\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -2 <= x <= 11)", "tests": ["assert filter_range([-4, -4, 11, 10, 16, 6, -4, -6, -2]) == [-44, -40, -24, 8]", "assert filter_range([51, 50, -10]) == []", "assert filter_range([49, 11, 36]) == [-44]", "assert filter_range([40, 49, 58, 32]) == []", "assert filter_range([48, -30, 15, 41, 12, 32, 38, 37, -3]) == []", "assert filter_range([-9, -19, 50, -24, 1, 42, 51]) == [-4]", "assert filter_range([20, 20]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([-4, -4, 11, 10, 16, 6, -4, -6, -2]) == [-44, -40, -24, 8]\nassert filter_range([51, 50, -10]) == []\nassert filter_range([49, 11, 36]) == [-44]\nassert filter_range([40, 49, 58, 32]) == []\nassert filter_range([48, -30, 15, 41, 12, 32, 38, 37, -3]) == []\nassert filter_range([-9, -19, 50, -24, 1, 42, 51]) == [-4]\nassert filter_range([20, 20]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -2 <= x <= 11)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -4 for x in xs if -2 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -2 و11 (شاملًا الطرفين) في -4.\nمثال: `filter_range([-4, -4, 11, 10, 16, 6, -4, -6, -2])` يجب أن تُرجع `[-44, -40, -24, 8]`.\nالجواب:", "qhash": "e3a55c9e82260362"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['orange', 'camel', 'code', 'light', 'pixel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['orange', 'camel', 'code', 'light', 'pixel']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "848c137c6b1f3517", "answer": "['code', 'camel', 'light', 'pixel', 'orange']\n['orange', 'pixel', 'light']", "completion": " الناتج:\n```text\n['code', 'camel', 'light', 'pixel', 'orange']\n['orange', 'pixel', 'light']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('apple desert it table desert') == 'desert|table|desert|apple'", "assert invert_words('a vector') == 'vector'", "assert invert_words('planet pixel signal on is summer by') == 'summer|signal|pixel|planet'", "assert invert_words('stone winter pixel to desert river on') == 'river|desert|pixel|winter|stone'", "assert invert_words('in garden music banana') == 'banana|music|garden'", "assert invert_words('on to code camel an python') == 'python|camel'", "assert invert_words('winter planet river desert matrix is go on') == 'matrix|desert|river|planet|winter'"], "test_code": "assert invert_words('apple desert it table desert') == 'desert|table|desert|apple'\nassert invert_words('a vector') == 'vector'\nassert invert_words('planet pixel signal on is summer by') == 'summer|signal|pixel|planet'\nassert invert_words('stone winter pixel to desert river on') == 'river|desert|pixel|winter|stone'\nassert invert_words('in garden music banana') == 'banana|music|garden'\nassert invert_words('on to code camel an python') == 'python|camel'\nassert invert_words('winter planet river desert matrix is go on') == 'matrix|desert|river|planet|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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `invert_words('apple desert it table desert')` يُرجع `'desert|table|desert|apple'`.\nالجواب:", "qhash": "44ad258706a3827a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 40", "tests": ["assert digits_mod(8147) == 34", "assert digits_mod(2298) == 9", "assert digits_mod(724704) == 10", "assert digits_mod(212896) == 26", "assert digits_mod(12785) == 19", "assert digits_mod(922485) == 10", "assert digits_mod(718317) == 21", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(8147) == 34\nassert digits_mod(2298) == 9\nassert digits_mod(724704) == 10\nassert digits_mod(212896) == 26\nassert digits_mod(12785) == 19\nassert digits_mod(922485) == 10\nassert digits_mod(718317) == 21\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 40", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 40\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 40.\nللتوضيح: الاستدعاء `digits_mod(8147)` يُرجع `34`.\nالجواب:", "qhash": "232535f60b574942"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=3):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(calc(-8))\nprint(calc(-8, 6))\nprint(calc(calc(6), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=3):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(calc(-8))\nprint(calc(-8, 6))\nprint(calc(calc(6), -8))\n```\nالجواب:", "qhash": "46b18b997bc958c9", "answer": "-17\n-26\n3", "completion": " الناتج:\n```text\n-17\n-26\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=7):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(9))\nprint(f(9, 2))\nprint(f(f(2), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=7):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(9))\nprint(f(9, 2))\nprint(f(f(2), 9))\n```\nالجواب:", "qhash": "21675fdb6ab6e50b", "answer": "56\n61\n348", "completion": " الناتج:\n```text\n56\n61\n348\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [20, 12, 7, 38, 30, 11, 3, 38, 21]\nprint(nums[3:4])\nprint(nums[::2])\nprint(min(nums[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [20, 12, 7, 38, 30, 11, 3, 38, 21]\nprint(nums[3:4])\nprint(nums[::2])\nprint(min(nums[3:4]))\n```\nالجواب:", "qhash": "39139a87c2efecd2", "answer": "[38]\n[20, 7, 30, 3, 21]\n38", "completion": " الناتج:\n```text\n[38]\n[20, 7, 30, 3, 21]\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 5 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(5) == ['1', 'Tic', '3', 'Tic', 'Tac']", "assert play(10) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac']", "assert play(11) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11']", "assert play(9) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9']", "assert play(14) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic']"], "test_code": "assert play(5) == ['1', 'Tic', '3', 'Tic', 'Tac']\nassert play(10) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac']\nassert play(11) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11']\nassert play(9) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9']\nassert play(14) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic']", "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 % 5 == 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 % 5 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Tic'، وإن قَبِلها على 5 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(5)` يُرجع `['1', 'Tic', '3', 'Tic', 'Tac']`.\nالجواب:", "qhash": "adce610748320e68"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 1009", "tests": ["assert fact_mod(7) == 1004", "assert fact_mod(29) == 931", "assert fact_mod(12) == 39", "assert fact_mod(19) == 991", "assert fact_mod(36) == 196", "assert fact_mod(32) == 429", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 1004\nassert fact_mod(29) == 931\nassert fact_mod(12) == 39\nassert fact_mod(19) == 991\nassert fact_mod(36) == 196\nassert fact_mod(32) == 429\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 1009", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 1)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(7)` يُرجع `1004`.\nالجواب:", "qhash": "60cd1dbd66f6884b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(556031984))\nprint(calc(calc(556031984)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(556031984))\nprint(calc(calc(556031984)))\n```\nالجواب:", "qhash": "6f1ee19ca7109f9b", "answer": "41\n5", "completion": " الناتج:\n```text\n41\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'جبل'\nprint(kalima.find('ب'))\nprint(kalima[0])\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'جبل'\nprint(kalima.find('ب'))\nprint(kalima[0])\nprint(kalima[-1])\n```\nالجواب:", "qhash": "86ad179ac678bb6c", "answer": "1\nج\nل", "completion": " الناتج:\n```text\n1\nج\nل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 26) == 1)", "tests": ["assert coprime_count(53) == 25", "assert coprime_count(182) == 84", "assert coprime_count(37) == 18", "assert coprime_count(7) == 4", "assert coprime_count(94) == 43", "assert coprime_count(150) == 69", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(53) == 25\nassert coprime_count(182) == 84\nassert coprime_count(37) == 18\nassert coprime_count(7) == 4\nassert coprime_count(94) == 43\nassert coprime_count(150) == 69\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, 26) == 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, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 26، أي أن القاسم المشترك الأكبر لها مع 26 يساوي 1.\nمثال: `coprime_count(53)` يجب أن تُرجع `25`.\nالجواب:", "qhash": "94b627906fa6c8bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 16\nfor j in range(-3, 5, 4):\n s -= j * 3\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 16\nfor j in range(-3, 5, 4):\n s -= j * 3\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "5edd7c608e164ae8", "answer": "22\n1", "completion": " الناتج:\n```text\n22\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [7, 30, -8, -9, 27, 0, 5, 11]\nprint(items[3:6])\nprint(items[::3])\nprint(max(items[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [7, 30, -8, -9, 27, 0, 5, 11]\nprint(items[3:6])\nprint(items[::3])\nprint(max(items[3:6]))\n```\nالجواب:", "qhash": "468aeb7bfc844bdb", "answer": "[-9, 27, 0]\n[7, -9, 5]\n27", "completion": " الناتج:\n```text\n[-9, 27, 0]\n[7, -9, 5]\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -13 <= x <= 17)", "tests": ["assert clip_scale([-11, 12, 10, 17, -11, -22, 9, 4, 8]) == [-22, -22, 8, 16, 18, 20, 24, 34]", "assert clip_scale([-6]) == [-12]", "assert clip_scale([-6, -18, 26, 20, 49, 52, 52, 22]) == [-12]", "assert clip_scale([-13, 41, 23, -13, 28, -23, -3]) == [-26, -26, -6]", "assert clip_scale([41, 53, 47, -19, 10, -26, -27, 51, 46]) == [20]", "assert clip_scale([-9]) == [-18]", "assert clip_scale([57, 25, 13, 57, -7]) == [-14, 26]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-11, 12, 10, 17, -11, -22, 9, 4, 8]) == [-22, -22, 8, 16, 18, 20, 24, 34]\nassert clip_scale([-6]) == [-12]\nassert clip_scale([-6, -18, 26, 20, 49, 52, 52, 22]) == [-12]\nassert clip_scale([-13, 41, 23, -13, 28, -23, -3]) == [-26, -26, -6]\nassert clip_scale([41, 53, 47, -19, 10, -26, -27, 51, 46]) == [20]\nassert clip_scale([-9]) == [-18]\nassert clip_scale([57, 25, 13, 57, -7]) == [-14, 26]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if -13 <= x <= 17)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if -13 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق -13 ≤ x ≤ 17، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([-11, 12, 10, 17, -11, -22, 9, 4, 8])` يُرجع `[-22, -22, 8, 16, 18, 20, 24, 34]`.\nالجواب:", "qhash": "c0c9f09c9f3a1f7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 17 <= x <= 51)", "tests": ["assert filter_range([7, 61, 9, 32, 44]) == [-220, -160]", "assert filter_range([46, 39, 2, 41, 40, 21, -23, -5, 37]) == [-230, -205, -200, -195, -185, -105]", "assert filter_range([-7, -8, -28, 56, 27, 30, 30, 52, 15, 50]) == [-250, -150, -150, -135]", "assert filter_range([52, 28, 46, -27]) == [-230, -140]", "assert filter_range([]) == []", "assert filter_range([33, -16]) == [-165]", "assert filter_range([28, 13, -29, -17, 2, 44, -1, 20]) == [-220, -140, -100]", "assert filter_range([]) == []"], "test_code": "assert filter_range([7, 61, 9, 32, 44]) == [-220, -160]\nassert filter_range([46, 39, 2, 41, 40, 21, -23, -5, 37]) == [-230, -205, -200, -195, -185, -105]\nassert filter_range([-7, -8, -28, 56, 27, 30, 30, 52, 15, 50]) == [-250, -150, -150, -135]\nassert filter_range([52, 28, 46, -27]) == [-230, -140]\nassert filter_range([]) == []\nassert filter_range([33, -16]) == [-165]\nassert filter_range([28, 13, -29, -17, 2, 44, -1, 20]) == [-220, -140, -100]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 17 <= x <= 51)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -5 for x in xs if 17 <= x <= 51)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 17 ≤ x ≤ 51، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([7, 61, 9, 32, 44])` يُرجع `[-220, -160]`.\nالجواب:", "qhash": "599b3bcf827e0435"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 1\nfor n in range(-1, 12, 1):\n s += n * 2\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 1\nfor n in range(-1, 12, 1):\n s += n * 2\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "7dba564cf0d21075", "answer": "131\n11", "completion": " الناتج:\n```text\n131\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 110\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 = 110\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": "e452f66d738253b8", "answer": "113", "completion": " الناتج:\n```text\n113\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert turn_list([40, 8, 37, 38]) == [38, 40, 8, 37]", "assert turn_list([21, 2, 24, 23, -7, 9, 42]) == [9, 42, 21, 2, 24, 23, -7]", "assert turn_list([23, 49, 17, 17, 43, 15, 20]) == [15, 20, 23, 49, 17, 17, 43]", "assert turn_list([7, 6]) == [6, 7]", "assert turn_list([42, 1, 39, -3, 7, 36, 39, 7]) == [7, 42, 1, 39, -3, 7, 36, 39]", "assert turn_list([-4, 17, 12]) == [-4, 17, 12]", "assert turn_list([]) == []"], "test_code": "assert turn_list([40, 8, 37, 38]) == [38, 40, 8, 37]\nassert turn_list([21, 2, 24, 23, -7, 9, 42]) == [9, 42, 21, 2, 24, 23, -7]\nassert turn_list([23, 49, 17, 17, 43, 15, 20]) == [15, 20, 23, 49, 17, 17, 43]\nassert turn_list([7, 6]) == [6, 7]\nassert turn_list([42, 1, 39, -3, 7, 36, 39, 7]) == [7, 42, 1, 39, -3, 7, 36, 39]\nassert turn_list([-4, 17, 12]) == [-4, 17, 12]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 9 % len(items)\n return ____\n```\nمثال: `turn_list([40, 8, 37, 38])` يجب أن تُرجع `[38, 40, 8, 37]`.\nالجواب:", "qhash": "25ab6b990c118a4e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 2) // 3 for x in range(-5, 5) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 2) // 3 for x in range(-5, 5) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "14cba88b70c230ce", "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_coprime#1", "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, 48) == 1)", "tests": ["assert coprimes(138) == 46", "assert coprimes(18) == 6", "assert coprimes(134) == 45", "assert coprimes(65) == 22", "assert coprimes(93) == 31", "assert coprimes(159) == 53", "assert coprimes(1) == 1"], "test_code": "assert coprimes(138) == 46\nassert coprimes(18) == 6\nassert coprimes(134) == 45\nassert coprimes(65) == 22\nassert coprimes(93) == 31\nassert coprimes(159) == 53\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, 48) == 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, 48) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 48) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(138)` يُرجع `46`.\nالجواب:", "qhash": "5fe859c1f1e3b7a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(8) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8']", "assert label_numbers(20) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20']", "assert label_numbers(9) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9']", "assert label_numbers(17) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17']", "assert label_numbers(0) == []"], "test_code": "assert label_numbers(8) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8']\nassert label_numbers(20) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20']\nassert label_numbers(9) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9']\nassert label_numbers(17) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17']\nassert label_numbers(0) == []", "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 % 7 == 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 % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Tic'، وعلى 7 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(8)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Tic', 'Tac', '8']`.\nالجواب:", "qhash": "488b3599e493f8ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 1:\n return 5\n return 3 * f(n - 1) + -1\n\nprint(f(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 1:\n return 5\n return 3 * f(n - 1) + -1\n\nprint(f(4))\n```\nالجواب:", "qhash": "3535298c6194871d", "answer": "122", "completion": " الناتج:\n```text\n122\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total", "tests": ["assert power_sum(7) == 980", "assert power_sum(11) == 3542", "assert power_sum(14) == 7105", "assert power_sum(0) == 0", "assert power_sum(2) == 35", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(7) == 980\nassert power_sum(11) == 3542\nassert power_sum(14) == 7105\nassert power_sum(0) == 0\nassert power_sum(2) == 35\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 ** 2\n return total", "completion": " ```python\ndef power_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 power_sum(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 power_sum(n):\n total = 0\n for i in range(1, n):\n total += 7 * i ** 2\n return total\n```\nمثال: `power_sum(7)` يجب أن تُرجع `980`.\nالجواب:", "qhash": "333bf2d397b9e78c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 87:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([23, 45, 24, 27, 30]) == [23, 68, 0, 27, 57]", "assert running_sum([35]) == [35]", "assert running_sum([85, 57, 86, 76, 32]) == [85, 0, 86, 0, 32]", "assert running_sum([85, 12, 40, 0, 29, 59, 54]) == [85, 0, 40, 40, 69, 0, 54]", "assert running_sum([-3, 0, 60, 7, 24, 23]) == [-3, -3, 57, 64, 0, 23]", "assert running_sum([79, 20, 71, 10, 87]) == [79, 0, 71, 81, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([23, 45, 24, 27, 30]) == [23, 68, 0, 27, 57]\nassert running_sum([35]) == [35]\nassert running_sum([85, 57, 86, 76, 32]) == [85, 0, 86, 0, 32]\nassert running_sum([85, 12, 40, 0, 29, 59, 54]) == [85, 0, 40, 40, 69, 0, 54]\nassert running_sum([-3, 0, 60, 7, 24, 23]) == [-3, -3, 57, 64, 0, 23]\nassert running_sum([79, 20, 71, 10, 87]) == [79, 0, 71, 81, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 87:\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 > 87:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 87 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([23, 45, 24, 27, 30])` يجب أن تُرجع `[23, 68, 0, 27, 57]`.\nالجواب:", "qhash": "937bc170a7e22463"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "tests": ["assert sum_div(43) == 246", "assert sum_div(288) == 9589", "assert sum_div(182) == 3739", "assert sum_div(245) == 6675", "assert sum_div(98) == 1102", "assert sum_div(4) == 0", "assert sum_div(1) == 0"], "test_code": "assert sum_div(43) == 246\nassert sum_div(288) == 9589\nassert sum_div(182) == 3739\nassert sum_div(245) == 6675\nassert sum_div(98) == 1102\nassert sum_div(4) == 0\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 13.\nمثال: `sum_div(43)` يجب أن تُرجع `246`.\nالجواب:", "qhash": "504e3800b22b6cee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 6 for x in range(-3, 12) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 6 for x in range(-3, 12) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "18a135ca0f9f4bbe", "answer": "[-5, -2, 19, 58, 115]\n5 185", "completion": " الناتج:\n```text\n[-5, -2, 19, 58, 115]\n5 185\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 24) == 1)", "tests": ["assert rel_prime_count(86) == 29", "assert rel_prime_count(125) == 42", "assert rel_prime_count(96) == 32", "assert rel_prime_count(58) == 19", "assert rel_prime_count(69) == 23", "assert rel_prime_count(101) == 34", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(86) == 29\nassert rel_prime_count(125) == 42\nassert rel_prime_count(96) == 32\nassert rel_prime_count(58) == 19\nassert rel_prime_count(69) == 23\nassert rel_prime_count(101) == 34\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, 24) == 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, 24) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 24، أي أن القاسم المشترك الأكبر لها مع 24 يساوي 1.\nمثال: `rel_prime_count(86)` يجب أن تُرجع `29`.\nالجواب:", "qhash": "9c41cbb9471637eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'cgot'}", "tests": ["assert char_freq('go orange winter') == {'c': 0, 'g': 2, 'o': 2, 't': 1}", "assert char_freq('python engine music data on on') == {'c': 1, 'g': 1, 'o': 3, 't': 2}", "assert char_freq('apple on') == {'c': 0, 'g': 0, 'o': 1, 't': 0}", "assert char_freq('banana pixel engine summer cloud') == {'c': 1, 'g': 1, 'o': 1, 't': 0}", "assert char_freq('desert summer light') == {'c': 0, 'g': 1, 'o': 0, 't': 2}", "assert char_freq('of on summer coffee data river') == {'c': 1, 'g': 0, 'o': 3, 't': 1}", "assert char_freq('') == {'c': 0, 'g': 0, 'o': 0, 't': 0}"], "test_code": "assert char_freq('go orange winter') == {'c': 0, 'g': 2, 'o': 2, 't': 1}\nassert char_freq('python engine music data on on') == {'c': 1, 'g': 1, 'o': 3, 't': 2}\nassert char_freq('apple on') == {'c': 0, 'g': 0, 'o': 1, 't': 0}\nassert char_freq('banana pixel engine summer cloud') == {'c': 1, 'g': 1, 'o': 1, 't': 0}\nassert char_freq('desert summer light') == {'c': 0, 'g': 1, 'o': 0, 't': 2}\nassert char_freq('of on summer coffee data river') == {'c': 1, 'g': 0, 'o': 3, 't': 1}\nassert char_freq('') == {'c': 0, 'g': 0, 'o': 0, 't': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'cgot'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'cgot'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'g'، 'o'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('go orange winter')` يُرجع `{'c': 0, 'g': 2, 'o': 2, 't': 1}`.\nالجواب:", "qhash": "2b211a64531507f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سوق مكتبة رمل وردة قمر') == 1", "assert words_starting('سماء قمر حصان فجر عمل جمل شمس سماء') == 2", "assert words_starting('برمجة سوق معلم سوق سيارة') == 3", "assert words_starting('تفاحة بيت سوق') == 1", "assert words_starting('سلام سفينة علم مطر') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('عمل سيارة طالب قلم') == 1\nassert words_starting('سوق مكتبة رمل وردة قمر') == 1\nassert words_starting('سماء قمر حصان فجر عمل جمل شمس سماء') == 2\nassert words_starting('برمجة سوق معلم سوق سيارة') == 3\nassert words_starting('تفاحة بيت سوق') == 1\nassert words_starting('سلام سفينة علم مطر') == 2\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": "f0fbe792c9d989a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 25", "tests": ["assert digit_score(33764) == 19", "assert digit_score(656041) == 14", "assert digit_score(368122) == 18", "assert digit_score(744814) == 12", "assert digit_score(873154) == 14", "assert digit_score(739385) == 12", "assert digit_score(280575) == 17", "assert digit_score(0) == 0"], "test_code": "assert digit_score(33764) == 19\nassert digit_score(656041) == 14\nassert digit_score(368122) == 18\nassert digit_score(744814) == 12\nassert digit_score(873154) == 14\nassert digit_score(739385) == 12\nassert digit_score(280575) == 17\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 25", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 25\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 25.\nمثال: `digit_score(33764)` يجب أن تُرجع `19`.\nالجواب:", "qhash": "47694b99e49e50a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(17))\n```\nالجواب:", "qhash": "ec62eb85197ce905", "answer": "1597", "completion": " الناتج:\n```text\n1597\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [-7, 31, 1, 17, 39, 34, 15, -6, 11]\nprint(nums[3:4])\nprint(nums[::3])\nprint(len(nums[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-7, 31, 1, 17, 39, 34, 15, -6, 11]\nprint(nums[3:4])\nprint(nums[::3])\nprint(len(nums[3:4]))\n```\nالجواب:", "qhash": "ac42e39fbc46f593", "answer": "[17]\n[-7, 17, 15]\n1", "completion": " الناتج:\n```text\n[17]\n[-7, 17, 15]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ع')", "tests": ["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", "assert count_letter('') == 0"], "test_code": "assert 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\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": "04a3d894f0ab6116"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)", "tests": ["assert add_multiples(196) == 7704", "assert add_multiples(23) == 90", "assert add_multiples(269) == 14447", "assert add_multiples(77) == 1240", "assert add_multiples(15) == 39", "assert add_multiples(49) == 477", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(196) == 7704\nassert add_multiples(23) == 90\nassert add_multiples(269) == 14447\nassert add_multiples(77) == 1240\nassert add_multiples(15) == 39\nassert add_multiples(49) == 477\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 5، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(196)` يُرجع `7704`.\nالجواب:", "qhash": "e816b21c8861052e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'سعيد': 29, 'راشد': 4, 'وليد': 11}\nscores['سعيد'] += 1\nscores['حسن'] = 49\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 14])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'سعيد': 29, 'راشد': 4, 'وليد': 11}\nscores['سعيد'] += 1\nscores['حسن'] = 49\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 14])\n```\nالجواب:", "qhash": "6cc0f6a9d84f00b0", "answer": "4\nحسن\n94\n['سعيد', 'حسن']", "completion": " الناتج:\n```text\n4\nحسن\n94\n['سعيد', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 27\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 = 27\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": "ae5eb12f7b0f7d75", "answer": "111", "completion": " الناتج:\n```text\n111\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 24", "tests": ["assert digit_power(6381) == 18", "assert digit_power(733135) == 22", "assert digit_power(701640) == 18", "assert digit_power(796945) == 16", "assert digit_power(585782) == 11", "assert digit_power(453830) == 23", "assert digit_power(976704) == 9", "assert digit_power(0) == 0"], "test_code": "assert digit_power(6381) == 18\nassert digit_power(733135) == 22\nassert digit_power(701640) == 18\nassert digit_power(796945) == 16\nassert digit_power(585782) == 11\nassert digit_power(453830) == 23\nassert digit_power(976704) == 9\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 24", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 24\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 24.\nمثال: `digit_power(6381)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "1edaaf1143ec8e83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('data summer') == 'qngn fhzzre'", "assert encode('go A1') == 'tb A1'", "assert encode('rocket it') == 'ebpxrg vg'", "assert encode('stone coffee on') == 'fgbar pbssrr ba'", "assert encode('in summer of') == 'va fhzzre bs'", "assert encode('on of garden coffee we') == 'ba bs tneqra pbssrr jr'", "assert encode('') == ''"], "test_code": "assert encode('data summer') == 'qngn fhzzre'\nassert encode('go A1') == 'tb A1'\nassert encode('rocket it') == 'ebpxrg vg'\nassert encode('stone coffee on') == 'fgbar pbssrr ba'\nassert encode('in summer of') == 'va fhzzre bs'\nassert encode('on of garden coffee we') == 'ba bs tneqra pbssrr jr'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('data summer')` يجب أن تُرجع `'qngn fhzzre'`.\nالجواب:", "qhash": "af58a486c260efaa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'يوسف': 1, 'مريم': 6, 'سعيد': 11}\nscores['يوسف'] += 10\nscores['وليد'] = 19\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('نور', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'يوسف': 1, 'مريم': 6, 'سعيد': 11}\nscores['يوسف'] += 10\nscores['وليد'] = 19\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('نور', -1))\n```\nالجواب:", "qhash": "b9eb904719a9bbc7", "answer": "4\nوليد\n47\n-1", "completion": " الناتج:\n```text\n4\nوليد\n47\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 4\nfor n in range(3, 11, 1):\n result += n * 1\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 4\nfor n in range(3, 11, 1):\n result += n * 1\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "cec66b4a1decb178", "answer": "56\n10", "completion": " الناتج:\n```text\n56\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 1:\n return 5\n return 2 * rec(n - 1) + -3\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 1:\n return 5\n return 2 * rec(n - 1) + -3\n\nprint(rec(5))\n```\nالجواب:", "qhash": "e793e95ce7aec598", "answer": "35", "completion": " الناتج:\n```text\n35\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 1 + 8 for x in range(3, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 1 + 8 for x in range(3, 10) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "284061f0f7f14f6e", "answer": "[11, 13, 15, 17]\n4 56", "completion": " الناتج:\n```text\n[11, 13, 15, 17]\n4 56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (6)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('planet A1') == 'vrgtkz A1'", "assert shift_letters('desert brain stone rocket winter') == 'jkykxz hxgot yzutk xuiqkz cotzkx'", "assert shift_letters('code by matrix code A1') == 'iujk he sgzxod iujk A1'", "assert shift_letters('python table banana A1') == 'veznut zghrk hgtgtg A1'", "assert shift_letters('cloud') == 'iruaj'", "assert shift_letters('river falcon desert matrix matrix') == 'xobkx lgriut jkykxz sgzxod sgzxod'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet A1') == 'vrgtkz A1'\nassert shift_letters('desert brain stone rocket winter') == 'jkykxz hxgot yzutk xuiqkz cotzkx'\nassert shift_letters('code by matrix code A1') == 'iujk he sgzxod iujk A1'\nassert shift_letters('python table banana A1') == 'veznut zghrk hgtgtg A1'\nassert shift_letters('cloud') == 'iruaj'\nassert shift_letters('river falcon desert matrix matrix') == 'xobkx lgriut jkykxz sgzxod sgzxod'\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 + (6)) % 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 + (6)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 6 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('planet A1')` يجب أن تُرجع `'vrgtkz A1'`.\nالجواب:", "qhash": "54e658b2d8de9dd8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('باسل', 18), ('وليد', 73), ('خالد', 75), ('ليلى', 67)]\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 = [('باسل', 18), ('وليد', 73), ('خالد', 75), ('ليلى', 67)]\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": "0f0fe57f63c32883", "answer": "[('باسل', 18), ('ليلى', 67), ('وليد', 73), ('خالد', 75)]\n['خالد', 'وليد']", "completion": " الناتج:\n```text\n[('باسل', 18), ('ليلى', 67), ('وليد', 73), ('خالد', 75)]\n['خالد', 'وليد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 2 for x in range(3, 16) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 2 for x in range(3, 16) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "fb86989550728fd1", "answer": "[23, 79, 167]\n3 269", "completion": " الناتج:\n```text\n[23, 79, 167]\n3 269\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(13) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13']", "assert game(6) == ['1', '2', '3', 'Sun', '5', '6']", "assert game(1) == ['1']", "assert game(1) == ['1']", "assert game(8) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun']"], "test_code": "assert game(13) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13']\nassert game(6) == ['1', '2', '3', 'Sun', '5', '6']\nassert game(1) == ['1']\nassert game(1) == ['1']\nassert game(8) == ['1', '2', '3', 'Sun', '5', '6', '7', 'Sun']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Sun'\n if i % 10 == 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 % 4 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Sun'، وعلى 10 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(13)` يجب أن تُرجع `['1', '2', '3', 'Sun', '5', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13']`.\nالجواب:", "qhash": "28b48ee7e585cc18"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 4 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(7) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']", "assert fizz(11) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11']", "assert fizz(16) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac']", "assert fizz(20) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac', '17', 'Tic', '19', 'Tac']", "assert fizz(10) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10']"], "test_code": "assert fizz(7) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']\nassert fizz(11) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11']\nassert fizz(16) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac']\nassert fizz(20) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac', '17', 'Tic', '19', 'Tac']\nassert fizz(10) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10']", "answer": "def fizz(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 fizz(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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Tic'، وإن قَبِلها على 4 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(7)` يُرجع `['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']`.\nالجواب:", "qhash": "68321bf2cc31966c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 1\nfor j in range(5, 22, 2):\n s += j * 4\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 1\nfor j in range(5, 22, 2):\n s += j * 4\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "ba004462ebc85318", "answer": "469\n21", "completion": " الناتج:\n```text\n469\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(9))\n```\nالجواب:", "qhash": "2f0a31e62e53f7b6", "answer": "89", "completion": " الناتج:\n```text\n89\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 290\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 = 290\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": "0ad9bc409d83a635", "answer": "117", "completion": " الناتج:\n```text\n117\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [31, 34, -9, 13, 21]\nprint(xs[0:4])\nprint(xs[::-2])\nprint(len(xs[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [31, 34, -9, 13, 21]\nprint(xs[0:4])\nprint(xs[::-2])\nprint(len(xs[0:4]))\n```\nالجواب:", "qhash": "85a3a21a2d01f575", "answer": "[31, 34, -9, 13]\n[21, -9, 31]\n4", "completion": " الناتج:\n```text\n[31, 34, -9, 13]\n[21, -9, 31]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 17:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([2, 5, 2, 3, 8, 3, 4, 13, 7, 12]) == [2, 7, 9, 12, 0, 3, 7, 0, 7, 0]", "assert cumulative([-8, 17, 17, 1, -8, 17, 11, 4, 10, 16]) == [-8, 9, 0, 1, -7, 10, 0, 4, 14, 0]", "assert cumulative([-1, -4]) == [-1, -5]", "assert cumulative([7, -2, 6, 4]) == [7, 5, 11, 15]", "assert cumulative([-2, 2, 14, 8, 9, 8, 1]) == [-2, 0, 14, 0, 9, 17, 0]", "assert cumulative([17, 0, -3, -10, 8, -1, 15, -10]) == [17, 17, 14, 4, 12, 11, 0, -10]", "assert cumulative([]) == []"], "test_code": "assert cumulative([2, 5, 2, 3, 8, 3, 4, 13, 7, 12]) == [2, 7, 9, 12, 0, 3, 7, 0, 7, 0]\nassert cumulative([-8, 17, 17, 1, -8, 17, 11, 4, 10, 16]) == [-8, 9, 0, 1, -7, 10, 0, 4, 14, 0]\nassert cumulative([-1, -4]) == [-1, -5]\nassert cumulative([7, -2, 6, 4]) == [7, 5, 11, 15]\nassert cumulative([-2, 2, 14, 8, 9, 8, 1]) == [-2, 0, 14, 0, 9, 17, 0]\nassert cumulative([17, 0, -3, -10, 8, -1, 15, -10]) == [17, 17, 14, 4, 12, 11, 0, -10]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 17:\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 > 17:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 17 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([2, 5, 2, 3, 8, 3, 4, 13, 7, 12])` يُرجع `[2, 7, 9, 12, 0, 3, 7, 0, 7, 0]`.\nالجواب:", "qhash": "61ad918e216e54a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_by([49, 28, 3, 48, 18]) == [28, 3, 48, 18, 49]", "assert rotate_by([28, 46, 17, 43, -3, 25, 9, 6]) == [17, 43, -3, 25, 9, 6, 28, 46]", "assert rotate_by([23, 25, 29, 22, 33, 20, 38, -9, 29, 26, 11]) == [29, 26, 11, 23, 25, 29, 22, 33, 20, 38, -9]", "assert rotate_by([14, 44]) == [14, 44]", "assert rotate_by([19, 1, 7, 15, -3, 18, 40]) == [19, 1, 7, 15, -3, 18, 40]", "assert rotate_by([11, 44, 23, 30, 50, 12, -4, 39, 29, 19]) == [-4, 39, 29, 19, 11, 44, 23, 30, 50, 12]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([49, 28, 3, 48, 18]) == [28, 3, 48, 18, 49]\nassert rotate_by([28, 46, 17, 43, -3, 25, 9, 6]) == [17, 43, -3, 25, 9, 6, 28, 46]\nassert rotate_by([23, 25, 29, 22, 33, 20, 38, -9, 29, 26, 11]) == [29, 26, 11, 23, 25, 29, 22, 33, 20, 38, -9]\nassert rotate_by([14, 44]) == [14, 44]\nassert rotate_by([19, 1, 7, 15, -3, 18, 40]) == [19, 1, 7, 15, -3, 18, 40]\nassert rotate_by([11, 44, 23, 30, 50, 12, -4, 39, 29, 19]) == [-4, 39, 29, 19, 11, 44, 23, 30, 50, 12]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 14 % 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 = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nمثال: `rotate_by([49, 28, 3, 48, 18])` يجب أن تُرجع `[28, 3, 48, 18, 49]`.\nالجواب:", "qhash": "14cfc1e56dfc68f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('on orange 2024') == 'ts twfslj 2024'", "assert caesar('by light garden on coffee') == 'gd qnlmy lfwijs ts htkkjj'", "assert caesar('vector music of we OK') == 'ajhytw rzxnh tk bj OK'", "assert caesar('engine desert') == 'jslnsj ijxjwy'", "assert caesar('an') == 'fs'", "assert caesar('stone vector engine code') == 'xytsj ajhytw jslnsj htij'", "assert caesar('') == ''"], "test_code": "assert caesar('on orange 2024') == 'ts twfslj 2024'\nassert caesar('by light garden on coffee') == 'gd qnlmy lfwijs ts htkkjj'\nassert caesar('vector music of we OK') == 'ajhytw rzxnh tk bj OK'\nassert caesar('engine desert') == 'jslnsj ijxjwy'\nassert caesar('an') == 'fs'\nassert caesar('stone vector engine code') == 'xytsj ajhytw jslnsj htij'\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 + (-21)) % 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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('on orange 2024')` يُرجع `'ts twfslj 2024'`.\nالجواب:", "qhash": "6edf1ba5e320380b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('منى', 54), ('ليلى', 98), ('راشد', 1), ('باسل', 31)]\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 = [('منى', 54), ('ليلى', 98), ('راشد', 1), ('باسل', 31)]\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": "2c4a34d29be2ed90", "answer": "[('راشد', 1), ('باسل', 31), ('منى', 54), ('ليلى', 98)]\n['ليلى', 'منى']", "completion": " الناتج:\n```text\n[('راشد', 1), ('باسل', 31), ('منى', 54), ('ليلى', 98)]\n['ليلى', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -4 for x in xs if -10 <= x <= 7)", "tests": ["assert pick_between([16, 17, 3, 10, -3, 13, 1, 11, -5, 13]) == [-12, -4, 12, 20]", "assert pick_between([]) == []", "assert pick_between([24, 5, -14, 25, 19, 21]) == [-20]", "assert pick_between([59, -17, 33, 25, 36, 29, 20, -2]) == [8]", "assert pick_between([16]) == []", "assert pick_between([22, 58]) == []", "assert pick_between([23, 30, -17, -29]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([16, 17, 3, 10, -3, 13, 1, 11, -5, 13]) == [-12, -4, 12, 20]\nassert pick_between([]) == []\nassert pick_between([24, 5, -14, 25, 19, 21]) == [-20]\nassert pick_between([59, -17, 33, 25, 36, 29, 20, -2]) == [8]\nassert pick_between([16]) == []\nassert pick_between([22, 58]) == []\nassert pick_between([23, 30, -17, -29]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -4 for x in xs if -10 <= x <= 7)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -4 for x in xs if -10 <= x <= 7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -10 ≤ x ≤ 7، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([16, 17, 3, 10, -3, 13, 1, 11, -5, 13])` يُرجع `[-12, -4, 12, 20]`.\nالجواب:", "qhash": "a85d5d103e0fa25d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 4 for x in xs if -5 <= x <= 0)", "tests": ["assert filter_range([-15, 7, -7, -12, -7]) == []", "assert filter_range([20, 2, 17, 15]) == []", "assert filter_range([27, -20]) == []", "assert filter_range([25, -2, -5, 45, 20, 15]) == [-20, -8]", "assert filter_range([15, 43, -1, -28, 58]) == [-4]", "assert filter_range([3, -30, 6, 51, -21, 17, -20, 40, 10]) == []", "assert filter_range([18, 54, 40]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([-15, 7, -7, -12, -7]) == []\nassert filter_range([20, 2, 17, 15]) == []\nassert filter_range([27, -20]) == []\nassert filter_range([25, -2, -5, 45, 20, 15]) == [-20, -8]\nassert filter_range([15, 43, -1, -28, 58]) == [-4]\nassert filter_range([3, -30, 6, 51, -21, 17, -20, 40, 10]) == []\nassert filter_range([18, 54, 40]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 4 for x in xs if -5 <= x <= 0)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 4 for x in xs if -5 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -5 و0 (شاملًا الطرفين) في 4.\nمثال: `filter_range([-15, 7, -7, -12, -7])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "4267a5b21a732597"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_matching([43, 13, 40, 9, 39, 29, 83, 65, 41, 49, 29, 55]) == 1", "assert count_matching([-33, 49, 70, 75]) == 1", "assert count_matching([22, -20, 18, 42, -34]) == 1", "assert count_matching([11]) == 0", "assert count_matching([29, 45, 59, -32, 71, 50, 55, 4, -12, -18, -4]) == 0", "assert count_matching([78, -17]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([43, 13, 40, 9, 39, 29, 83, 65, 41, 49, 29, 55]) == 1\nassert count_matching([-33, 49, 70, 75]) == 1\nassert count_matching([22, -20, 18, 42, -34]) == 1\nassert count_matching([11]) == 0\nassert count_matching([29, 45, 59, -32, 71, 50, 55, 4, -12, -18, -4]) == 0\nassert count_matching([78, -17]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 7 == 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 % 7 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 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([43, 13, 40, 9, 39, 29, 83, 65, 41, 49, 29, 55])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "b0779400343416e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 15", "tests": ["assert digit_score(3066) == 0", "assert digit_score(245871) == 12", "assert digit_score(705231) == 3", "assert digit_score(401887) == 13", "assert digit_score(280579) == 1", "assert digit_score(635163) == 9", "assert digit_score(125203) == 13", "assert digit_score(0) == 0"], "test_code": "assert digit_score(3066) == 0\nassert digit_score(245871) == 12\nassert digit_score(705231) == 3\nassert digit_score(401887) == 13\nassert digit_score(280579) == 1\nassert digit_score(635163) == 9\nassert digit_score(125203) == 13\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 15", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 15\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 15.\nللتوضيح: الاستدعاء `digit_score(3066)` يُرجع `0`.\nالجواب:", "qhash": "e39a80d606791512"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 2256\nc = 0\nwhile x > 19:\n x = x // 3\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 2256\nc = 0\nwhile x > 19:\n x = x // 3\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "aa7c075ba9796cc6", "answer": "9 5", "completion": " الناتج:\n```text\n9 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 2) == 1)", "tests": ["assert phi_upto(56) == 28", "assert phi_upto(129) == 65", "assert phi_upto(144) == 72", "assert phi_upto(47) == 24", "assert phi_upto(27) == 14", "assert phi_upto(134) == 67", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(56) == 28\nassert phi_upto(129) == 65\nassert phi_upto(144) == 72\nassert phi_upto(47) == 24\nassert phi_upto(27) == 14\nassert phi_upto(134) == 67\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, 2) == 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, 2) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 2) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(56)` يُرجع `28`.\nالجواب:", "qhash": "7c88fc321e026448"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('vector vector in') == 'wfdups wfdups jo'", "assert caesar('matrix brain') == 'nbusjy csbjo'", "assert caesar('python') == 'qzuipo'", "assert caesar('table a pixel python coffee') == 'ubcmf b qjyfm qzuipo dpggff'", "assert caesar('orange summer desert to planet Hello') == 'psbohf tvnnfs eftfsu up qmbofu Hfmmp'", "assert caesar('summer vector') == 'tvnnfs wfdups'", "assert caesar('') == ''"], "test_code": "assert caesar('vector vector in') == 'wfdups wfdups jo'\nassert caesar('matrix brain') == 'nbusjy csbjo'\nassert caesar('python') == 'qzuipo'\nassert caesar('table a pixel python coffee') == 'ubcmf b qjyfm qzuipo dpggff'\nassert caesar('orange summer desert to planet Hello') == 'psbohf tvnnfs eftfsu up qmbofu Hfmmp'\nassert caesar('summer vector') == 'tvnnfs wfdups'\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 + (-25)) % 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 + (-25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('vector vector in')` يُرجع `'wfdups wfdups jo'`.\nالجواب:", "qhash": "83cb5c50cd40449a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 58:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([8, 27, 31, 12, 10, 28, 19]) == [8, 35, 0, 12, 22, 50, 0]", "assert acc_reset([-7, 14, 58]) == [-7, 7, 0]", "assert acc_reset([56]) == [56]", "assert acc_reset([19, 44]) == [19, 0]", "assert acc_reset([46, 47, 12]) == [46, 0, 12]", "assert acc_reset([46, 30, 37, 55]) == [46, 0, 37, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([8, 27, 31, 12, 10, 28, 19]) == [8, 35, 0, 12, 22, 50, 0]\nassert acc_reset([-7, 14, 58]) == [-7, 7, 0]\nassert acc_reset([56]) == [56]\nassert acc_reset([19, 44]) == [19, 0]\nassert acc_reset([46, 47, 12]) == [46, 0, 12]\nassert acc_reset([46, 30, 37, 55]) == [46, 0, 37, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 58:\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 > 58:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 58 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([8, 27, 31, 12, 10, 28, 19])` يُرجع `[8, 35, 0, 12, 22, 50, 0]`.\nالجواب:", "qhash": "f6dfbb34903ca8d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + 4\n\nprint(f(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + 4\n\nprint(f(8))\n```\nالجواب:", "qhash": "c7c939e2bf1470c6", "answer": "1456", "completion": " الناتج:\n```text\n1456\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'قلم قلم'\nprint(s.count('ا'))\nprint(s[::-1])\nprint(s.find('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'قلم قلم'\nprint(s.count('ا'))\nprint(s[::-1])\nprint(s.find('ا'))\n```\nالجواب:", "qhash": "a9d83704c409af80", "answer": "0\nملق ملق\n-1", "completion": " الناتج:\n```text\n0\nملق ملق\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 8 for x in range(-3, 11) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 8 for x in range(-3, 11) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "b48c188b9fd458d3", "answer": "[1, -7, 17, 73]\n4 84", "completion": " الناتج:\n```text\n[1, -7, 17, 73]\n4 84\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 11", "tests": ["assert fact_mod(10) == 10", "assert fact_mod(52) == 0", "assert fact_mod(25) == 8", "assert fact_mod(34) == 0", "assert fact_mod(38) == 0", "assert fact_mod(23) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(10) == 10\nassert fact_mod(52) == 0\nassert fact_mod(25) == 8\nassert fact_mod(34) == 0\nassert fact_mod(38) == 0\nassert fact_mod(23) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 11", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(10)` يُرجع `10`.\nالجواب:", "qhash": "e416e326d48d2b36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'سوق'\nprint(len(w.replace(' ', '')))\nprint('و' in w)\nprint(len(w))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'سوق'\nprint(len(w.replace(' ', '')))\nprint('و' in w)\nprint(len(w))\n```\nالجواب:", "qhash": "ff6d67e783f6c66d", "answer": "3\nTrue\n3", "completion": " الناتج:\n```text\n3\nTrue\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('garden apple table') == 'table/apple/garden'", "assert words_reversed('it planet planet code of on python') == 'python/on/of/code/planet/planet/it'", "assert words_reversed('') == ''", "assert words_reversed('a code falcon') == 'falcon/code'", "assert words_reversed('up to code is garden go summer signal') == 'signal/summer/go/garden/is/code/to/up'", "assert words_reversed('garden orange up to in') == 'in/to/up/orange/garden'", "assert words_reversed('on') == 'on'"], "test_code": "assert words_reversed('garden apple table') == 'table/apple/garden'\nassert words_reversed('it planet planet code of on python') == 'python/on/of/code/planet/planet/it'\nassert words_reversed('') == ''\nassert words_reversed('a code falcon') == 'falcon/code'\nassert words_reversed('up to code is garden go summer signal') == 'signal/summer/go/garden/is/code/to/up'\nassert words_reversed('garden orange up to in') == 'in/to/up/orange/garden'\nassert words_reversed('on') == 'on'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('garden apple table')` يُرجع `'table/apple/garden'`.\nالجواب:", "qhash": "d7d7e965255efb0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=2):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(16))\nprint(g(16, 5))\nprint(g(g(5), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=2):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(16))\nprint(g(16, 5))\nprint(g(g(5), 16))\n```\nالجواب:", "qhash": "9b32f6b02f7b0758", "answer": "78\n75\n99", "completion": " الناتج:\n```text\n78\n75\n99\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 177:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([76, 13, 71, 73, 50, 62, 89, 7]) == [76, 89, 160, 0, 50, 112, 0, 7]", "assert capped_cumsum([105]) == [105]", "assert capped_cumsum([114, 104, 172]) == [114, 0, 172]", "assert capped_cumsum([68, 78, 6, 30, 74, 56, 133, 174, 6, 175]) == [68, 146, 152, 0, 74, 130, 0, 174, 0, 175]", "assert capped_cumsum([18, 157, 174, 138, 144, 152]) == [18, 175, 0, 138, 0, 152]", "assert capped_cumsum([-5]) == [-5]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([76, 13, 71, 73, 50, 62, 89, 7]) == [76, 89, 160, 0, 50, 112, 0, 7]\nassert capped_cumsum([105]) == [105]\nassert capped_cumsum([114, 104, 172]) == [114, 0, 172]\nassert capped_cumsum([68, 78, 6, 30, 74, 56, 133, 174, 6, 175]) == [68, 146, 152, 0, 74, 130, 0, 174, 0, 175]\nassert capped_cumsum([18, 157, 174, 138, 144, 152]) == [18, 175, 0, 138, 0, 152]\nassert capped_cumsum([-5]) == [-5]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 177:\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 > 177:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 177 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([76, 13, 71, 73, 50, 62, 89, 7])` يُرجع `[76, 89, 160, 0, 50, 112, 0, 7]`.\nالجواب:", "qhash": "163af4903f1f1d7c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 302\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 = 302\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": "03efe395f8e07e94", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'cis'}", "tests": ["assert letter_stats('apple up code python vector') == {'c': 2, 'i': 0, 's': 0}", "assert letter_stats('river summer to a up') == {'c': 0, 'i': 1, 's': 1}", "assert letter_stats('table') == {'c': 0, 'i': 0, 's': 0}", "assert letter_stats('summer coffee') == {'c': 1, 'i': 0, 's': 1}", "assert letter_stats('falcon') == {'c': 1, 'i': 0, 's': 0}", "assert letter_stats('to orange') == {'c': 0, 'i': 0, 's': 0}", "assert letter_stats('') == {'c': 0, 'i': 0, 's': 0}"], "test_code": "assert letter_stats('apple up code python vector') == {'c': 2, 'i': 0, 's': 0}\nassert letter_stats('river summer to a up') == {'c': 0, 'i': 1, 's': 1}\nassert letter_stats('table') == {'c': 0, 'i': 0, 's': 0}\nassert letter_stats('summer coffee') == {'c': 1, 'i': 0, 's': 1}\nassert letter_stats('falcon') == {'c': 1, 'i': 0, 's': 0}\nassert letter_stats('to orange') == {'c': 0, 'i': 0, 's': 0}\nassert letter_stats('') == {'c': 0, 'i': 0, 's': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'cis'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'cis'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'i'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('apple up code python vector')` يُرجع `{'c': 2, 'i': 0, 's': 0}`.\nالجواب:", "qhash": "b80ef6bde9324a70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert only_div([48, 21, 17, 36, 4, 7]) == 2", "assert only_div([33, -18, 66, 18, 51, -19, 39, 11]) == 3", "assert only_div([]) == 0", "assert only_div([83, 75, -35, 11, 18]) == 1", "assert only_div([69, 76, 42, -26, 67, 53, 31, 17, 16, 52, -26, 83]) == 5", "assert only_div([-27, -39, 11, -16]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([48, 21, 17, 36, 4, 7]) == 2\nassert only_div([33, -18, 66, 18, 51, -19, 39, 11]) == 3\nassert only_div([]) == 0\nassert only_div([83, 75, -35, 11, 18]) == 1\nassert only_div([69, 76, 42, -26, 67, 53, 31, 17, 16, 52, -26, 83]) == 5\nassert only_div([-27, -39, 11, -16]) == 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 % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([48, 21, 17, 36, 4, 7])` يُرجع `2`.\nالجواب:", "qhash": "194f09dde914eb0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'acno'}", "tests": ["assert char_counts('up') == {'a': 0, 'c': 0, 'n': 0, 'o': 0}", "assert char_counts('python vector by winter') == {'a': 0, 'c': 1, 'n': 2, 'o': 2}", "assert char_counts('is of') == {'a': 0, 'c': 0, 'n': 0, 'o': 1}", "assert char_counts('music') == {'a': 0, 'c': 1, 'n': 0, 'o': 0}", "assert char_counts('rocket vector') == {'a': 0, 'c': 2, 'n': 0, 'o': 2}", "assert char_counts('engine garden table') == {'a': 2, 'c': 0, 'n': 3, 'o': 0}", "assert char_counts('') == {'a': 0, 'c': 0, 'n': 0, 'o': 0}"], "test_code": "assert char_counts('up') == {'a': 0, 'c': 0, 'n': 0, 'o': 0}\nassert char_counts('python vector by winter') == {'a': 0, 'c': 1, 'n': 2, 'o': 2}\nassert char_counts('is of') == {'a': 0, 'c': 0, 'n': 0, 'o': 1}\nassert char_counts('music') == {'a': 0, 'c': 1, 'n': 0, 'o': 0}\nassert char_counts('rocket vector') == {'a': 0, 'c': 2, 'n': 0, 'o': 2}\nassert char_counts('engine garden table') == {'a': 2, 'c': 0, 'n': 3, 'o': 0}\nassert char_counts('') == {'a': 0, 'c': 0, 'n': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'acno'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'acno'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'c'، 'n'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('up')` يجب أن تُرجع `{'a': 0, 'c': 0, 'n': 0, 'o': 0}`.\nالجواب:", "qhash": "923dff8e49cc9300"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 3 * x ** 2 + (2) * x + (2)", "tests": ["assert eval_poly(3) == 35", "assert eval_poly(20) == 1242", "assert eval_poly(2) == 18", "assert eval_poly(8) == 210", "assert eval_poly(9) == 263", "assert eval_poly(4) == 58", "assert eval_poly(9) == 263", "assert eval_poly(0) == 2"], "test_code": "assert eval_poly(3) == 35\nassert eval_poly(20) == 1242\nassert eval_poly(2) == 18\nassert eval_poly(8) == 210\nassert eval_poly(9) == 263\nassert eval_poly(4) == 58\nassert eval_poly(9) == 263\nassert eval_poly(0) == 2", "answer": "def eval_poly(x):\n return 3 * x ** 2 + (2) * x + (2)", "completion": " ```python\ndef eval_poly(x):\n return 3 * x ** 2 + (2) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 3x² + 2x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(3)` يُرجع `35`.\nالجواب:", "qhash": "6dc906ddc5327161"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89", "tests": ["assert multi_fact(3) == 6", "assert multi_fact(16) == 41", "assert multi_fact(17) == 74", "assert multi_fact(18) == 86", "assert multi_fact(30) == 31", "assert multi_fact(57) == 84", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(3) == 6\nassert multi_fact(16) == 41\nassert multi_fact(17) == 74\nassert multi_fact(18) == 86\nassert multi_fact(30) == 31\nassert multi_fact(57) == 84\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "9e0251de5be09754"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total", "tests": ["assert sum_terms(5) == 385", "assert sum_terms(0) == 0", "assert sum_terms(0) == 0", "assert sum_terms(1) == 7", "assert sum_terms(1) == 7", "assert sum_terms(1) == 7", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(5) == 385\nassert sum_terms(0) == 0\nassert sum_terms(0) == 0\nassert sum_terms(1) == 7\nassert sum_terms(1) == 7\nassert sum_terms(1) == 7\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 2\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 2\n return total\n```\nمثال: `sum_terms(5)` يجب أن تُرجع `385`.\nالجواب:", "qhash": "4b147b1e76750813"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['apple', 'cloud', 'winter', 'coffee', 'vector']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['apple', 'cloud', 'winter', 'coffee', 'vector']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "5fc5cbbcb1c87fb8", "answer": "['apple', 'cloud', 'winter', 'coffee', 'vector']\n['winter', 'vector', 'coffee']", "completion": " الناتج:\n```text\n['apple', 'cloud', 'winter', 'coffee', 'vector']\n['winter', 'vector', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('ف')", "tests": ["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", "assert count_in_text('نهار لغة سيارة كتاب رمل فجر جبل') == 1", "assert count_in_text('') == 0"], "test_code": "assert 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\nassert count_in_text('نهار لغة سيارة كتاب رمل فجر جبل') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ف» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('شمس برتقال مدينة دفتر سلام طالب صديق')` يُرجع `1`.\nالجواب:", "qhash": "511724516a82bf0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "tests": ["assert power_sum(4) == 5200", "assert power_sum(15) == 9196800", "assert power_sum(6) == 48804", "assert power_sum(1) == 4", "assert power_sum(7) == 116032", "assert power_sum(1) == 4", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 5200\nassert power_sum(15) == 9196800\nassert power_sum(6) == 48804\nassert power_sum(1) == 4\nassert power_sum(7) == 116032\nassert power_sum(1) == 4\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * 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 = 4 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × 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 = 4 * i ** 5\n return total\n```\nمثال: `power_sum(4)` يجب أن تُرجع `5200`.\nالجواب:", "qhash": "ba691abfc81a0b89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة حاسوب معلم') == 0", "assert count_start('حصان جبل ماء مدرسة قمر ماء') == 0", "assert count_start('باب مدينة تفاحة نهر بحر') == 1", "assert count_start('دفتر ماء معلم تفاحة حصان بيت') == 1", "assert count_start('صديق جمل مدينة تفاحة حاسوب تفاحة وردة') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('تفاحة تفاحة فجر عمل') == 2\nassert count_start('قهوة حاسوب معلم') == 0\nassert count_start('حصان جبل ماء مدرسة قمر ماء') == 0\nassert count_start('باب مدينة تفاحة نهر بحر') == 1\nassert count_start('دفتر ماء معلم تفاحة حصان بيت') == 1\nassert count_start('صديق جمل مدينة تفاحة حاسوب تفاحة وردة') == 2\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:\n if w.startswith('ت'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ت»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(line):\n count = 0\n for w in line:\n if w.startswith('ت'):\n count += 1\n return count\n```\nمثال: `count_start('تفاحة تفاحة فجر عمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "44221f494cf580ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('بيت قلم سماء') == 0", "assert count_start('دفتر جبل طائرة دفتر') == 2", "assert count_start('دفتر برمجة سفينة دفتر دفتر قهوة') == 3", "assert count_start('وردة صديق دفتر علم صديق حديقة دفتر') == 2", "assert count_start('حديقة دفتر طالب دفتر رمل دفتر قهوة بيت') == 3", "assert count_start('سماء دفتر دفتر لغة مكتبة') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('بيت قلم سماء') == 0\nassert count_start('دفتر جبل طائرة دفتر') == 2\nassert count_start('دفتر برمجة سفينة دفتر دفتر قهوة') == 3\nassert count_start('وردة صديق دفتر علم صديق حديقة دفتر') == 2\nassert count_start('حديقة دفتر طالب دفتر رمل دفتر قهوة بيت') == 3\nassert count_start('سماء دفتر دفتر لغة مكتبة') == 2\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('بيت قلم سماء')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "1f3bdd4ca98f8a21"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -6 <= x <= 28)", "tests": ["assert clip_scale([23, -13, 17, 14, -5, -15, 31, -16, 32]) == [-5, 14, 17, 23]", "assert clip_scale([30, 44, 16, 33]) == [16]", "assert clip_scale([-13, 42, 27]) == [27]", "assert clip_scale([20, 5, 1, 59, 57, 39]) == [1, 5, 20]", "assert clip_scale([-3, 57, 22, 27]) == [-3, 22, 27]", "assert clip_scale([-23]) == []", "assert clip_scale([-7, -19, 10, 52, 48, 41]) == [10]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([23, -13, 17, 14, -5, -15, 31, -16, 32]) == [-5, 14, 17, 23]\nassert clip_scale([30, 44, 16, 33]) == [16]\nassert clip_scale([-13, 42, 27]) == [27]\nassert clip_scale([20, 5, 1, 59, 57, 39]) == [1, 5, 20]\nassert clip_scale([-3, 57, 22, 27]) == [-3, 22, 27]\nassert clip_scale([-23]) == []\nassert clip_scale([-7, -19, 10, 52, 48, 41]) == [10]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -6 <= x <= 28)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if -6 <= x <= 28)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و28 (شاملًا الطرفين) في 1.\nمثال: `clip_scale([23, -13, 17, 14, -5, -15, 31, -16, 32])` يجب أن تُرجع `[-5, 14, 17, 23]`.\nالجواب:", "qhash": "dac7be0f4a7a929e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 10)", "tests": ["assert pick_between([-5, -6, 20, 15, 1, 16, 12, 4, 2]) == [-20]", "assert pick_between([-17, -24, 47, 55, -23, 28, 26, 42, 36]) == []", "assert pick_between([8, 32, 50, 34]) == [-40]", "assert pick_between([19, -19, 49, -24, 2]) == []", "assert pick_between([]) == []", "assert pick_between([60, 38, -18, 11, -20, -8, -22, -5, -9]) == []", "assert pick_between([20, -8, -15, 37, 1, -1, 8, 25, 29]) == [-40]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-5, -6, 20, 15, 1, 16, 12, 4, 2]) == [-20]\nassert pick_between([-17, -24, 47, 55, -23, 28, 26, 42, 36]) == []\nassert pick_between([8, 32, 50, 34]) == [-40]\nassert pick_between([19, -19, 49, -24, 2]) == []\nassert pick_between([]) == []\nassert pick_between([60, 38, -18, 11, -20, -8, -22, -5, -9]) == []\nassert pick_between([20, -8, -15, 37, 1, -1, 8, 25, 29]) == [-40]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 10)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 10، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-5, -6, 20, 15, 1, 16, 12, 4, 2])` يُرجع `[-20]`.\nالجواب:", "qhash": "fb67e6cc5c166295"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79", "tests": ["assert fact_mod(4) == 8", "assert fact_mod(7) == 26", "assert fact_mod(58) == 58", "assert fact_mod(33) == 63", "assert fact_mod(49) == 59", "assert fact_mod(15) == 43", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 8\nassert fact_mod(7) == 26\nassert fact_mod(58) == 58\nassert fact_mod(33) == 63\nassert fact_mod(49) == 59\nassert fact_mod(15) == 43\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(4)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "0f8fcedd7ca0c018"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([76, 23, 31, 21, 30]) == [76, 99, 130, 151, 181]", "assert capped_cumsum([]) == []", "assert capped_cumsum([142, 50, 94, 161, 51, 33, 169, 32, 35, 32]) == [142, 0, 94, 0, 51, 84, 0, 32, 67, 99]", "assert capped_cumsum([107, 137, 120, -10]) == [107, 0, 120, 110]", "assert capped_cumsum([]) == []", "assert capped_cumsum([-7, 46, 96, 125, 128, 158, 150]) == [-7, 39, 135, 0, 128, 0, 150]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([76, 23, 31, 21, 30]) == [76, 99, 130, 151, 181]\nassert capped_cumsum([]) == []\nassert capped_cumsum([142, 50, 94, 161, 51, 33, 169, 32, 35, 32]) == [142, 0, 94, 0, 51, 84, 0, 32, 67, 99]\nassert capped_cumsum([107, 137, 120, -10]) == [107, 0, 120, 110]\nassert capped_cumsum([]) == []\nassert capped_cumsum([-7, 46, 96, 125, 128, 158, 150]) == [-7, 39, 135, 0, 128, 0, 150]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\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 > 182:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 182 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([76, 23, 31, 21, 30])` يُرجع `[76, 99, 130, 151, 181]`.\nالجواب:", "qhash": "614dc4097a98a161"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 16\nfor j in range(3, 7, 4):\n total += j * 7\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 16\nfor j in range(3, 7, 4):\n total += j * 7\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "aeb909b849139680", "answer": "37\n3", "completion": " الناتج:\n```text\n37\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [37, 40, 14, -1, 40, 6]\nprint(a[0:1])\nprint(a[::3])\nprint(min(a[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [37, 40, 14, -1, 40, 6]\nprint(a[0:1])\nprint(a[::3])\nprint(min(a[0:1]))\n```\nالجواب:", "qhash": "2845b344f2238a89", "answer": "[37]\n[37, -1]\n37", "completion": " الناتج:\n```text\n[37]\n[37, -1]\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_matching([36, 11, 90, 12, 5, 44, 18, 4, 26, 38, 87, 88]) == 1", "assert count_matching([3, 32, 36]) == 1", "assert count_matching([13, 3]) == 0", "assert count_matching([56, 81, 11, 57]) == 1", "assert count_matching([-19]) == 0", "assert count_matching([-29, 65, 13, 77, 87]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([36, 11, 90, 12, 5, 44, 18, 4, 26, 38, 87, 88]) == 1\nassert count_matching([3, 32, 36]) == 1\nassert count_matching([13, 3]) == 0\nassert count_matching([56, 81, 11, 57]) == 1\nassert count_matching([-19]) == 0\nassert count_matching([-29, 65, 13, 77, 87]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 3، واكتب الدالة بعد إكمالها.\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([36, 11, 90, 12, 5, 44, 18, 4, 26, 38, 87, 88])` يُرجع `1`.\nالجواب:", "qhash": "27bb5099431c2191"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "tests": ["assert scaled_powers(3) == 6", "assert scaled_powers(10) == 55", "assert scaled_powers(2) == 3", "assert scaled_powers(1) == 1", "assert scaled_powers(9) == 45", "assert scaled_powers(1) == 1", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(3) == 6\nassert scaled_powers(10) == 55\nassert scaled_powers(2) == 3\nassert scaled_powers(1) == 1\nassert scaled_powers(9) == 45\nassert scaled_powers(1) == 1\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(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 scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 1\n return total\n```\nمثال: `scaled_powers(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "2de8a41b4a2f7318"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "tests": ["assert sum_div(250) == 15500", "assert sum_div(151) == 5700", "assert sum_div(107) == 2862", "assert sum_div(238) == 14042", "assert sum_div(23) == 132", "assert sum_div(32) == 240", "assert sum_div(1) == 0"], "test_code": "assert sum_div(250) == 15500\nassert sum_div(151) == 5700\nassert sum_div(107) == 2862\nassert sum_div(238) == 14042\nassert sum_div(23) == 132\nassert sum_div(32) == 240\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 4.\nمثال: `sum_div(250)` يجب أن تُرجع `15500`.\nالجواب:", "qhash": "9e75dca79a308b69"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'apple'\nprint(text.index('e') + len(text))\nprint(text.upper())\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'apple'\nprint(text.index('e') + len(text))\nprint(text.upper())\nprint(text[::-1])\n```\nالجواب:", "qhash": "4dbae1575bd86f8c", "answer": "9\nAPPLE\nelppa", "completion": " الناتج:\n```text\n9\nAPPLE\nelppa\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'orange'\nprint(name.replace('e', '0'))\nprint(name.index('e') + len(name))\nprint(name[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'orange'\nprint(name.replace('e', '0'))\nprint(name.index('e') + len(name))\nprint(name[-1:])\n```\nالجواب:", "qhash": "1f453acd28f4de6f", "answer": "orang0\n11\ne", "completion": " الناتج:\n```text\norang0\n11\ne\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(742648364))\nprint(f(f(742648364)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(742648364))\nprint(f(f(742648364)))\n```\nالجواب:", "qhash": "57fb857180745239", "answer": "44\n8", "completion": " الناتج:\n```text\n44\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 5 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(6) == ['1', 'Red', '3', 'Red', 'Blue', 'Red']", "assert fizzbuzz(0) == []", "assert fizzbuzz(4) == ['1', 'Red', '3', 'Red']", "assert fizzbuzz(17) == ['1', 'Red', '3', 'Red', 'Blue', 'Red', '7', 'Red', '9', 'RedBlue', '11', 'Red', '13', 'Red', 'Blue', 'Red', '17']", "assert fizzbuzz(0) == []"], "test_code": "assert fizzbuzz(6) == ['1', 'Red', '3', 'Red', 'Blue', 'Red']\nassert fizzbuzz(0) == []\nassert fizzbuzz(4) == ['1', 'Red', '3', 'Red']\nassert fizzbuzz(17) == ['1', 'Red', '3', 'Red', 'Blue', 'Red', '7', 'Red', '9', 'RedBlue', '11', 'Red', '13', 'Red', 'Blue', 'Red', '17']\nassert fizzbuzz(0) == []", "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 % 5 == 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 % 5 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Red'، وعلى 5 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(6)` يجب أن تُرجع `['1', 'Red', '3', 'Red', 'Blue', 'Red']`.\nالجواب:", "qhash": "6d600a567d90f17c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(18))\n```\nالجواب:", "qhash": "df84619efe149861", "answer": "6765", "completion": " الناتج:\n```text\n6765\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(15))\n```\nالجواب:", "qhash": "e488d467f96e6078", "answer": "1597", "completion": " الناتج:\n```text\n1597\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('برتقال بيت رمل تفاحة نهر طالب') == 1", "assert count_start('بيت مدرسة تفاحة سفينة تفاحة') == 2", "assert count_start('سماء شجرة') == 0", "assert count_start('علم تفاحة عربية تفاحة') == 2", "assert count_start('شجرة بحر قلم تفاحة علم جمل') == 1", "assert count_start('تفاحة عربية حديقة تفاحة ماء') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('برتقال بيت رمل تفاحة نهر طالب') == 1\nassert count_start('بيت مدرسة تفاحة سفينة تفاحة') == 2\nassert count_start('سماء شجرة') == 0\nassert count_start('علم تفاحة عربية تفاحة') == 2\nassert count_start('شجرة بحر قلم تفاحة علم جمل') == 1\nassert count_start('تفاحة عربية حديقة تفاحة ماء') == 2\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('برتقال بيت رمل تفاحة نهر طالب')` يُرجع `1`.\nالجواب:", "qhash": "3cf82649734ad3eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [21, -1, 3, 17, 21, -7, 17]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(len(nums[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [21, -1, 3, 17, 21, -7, 17]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(len(nums[2:7]))\n```\nالجواب:", "qhash": "07eb3b83265f3a0e", "answer": "[3, 17, 21, -7, 17]\n[17, 21, 3, 21]\n5", "completion": " الناتج:\n```text\n[3, 17, 21, -7, 17]\n[17, 21, 3, 21]\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('جمل برتقال كتاب حصان ماء خبز حديقة') == 1", "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('كتاب علم بحر سماء وردة مدرسة') == 2\nassert count_ar('جمل برتقال كتاب حصان ماء خبز حديقة') == 1\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 'د' 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": "f6d4f7e28fe1aad0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "tests": ["assert mult_sum(265) == 7453", "assert mult_sum(203) == 4222", "assert mult_sum(242) == 6433", "assert mult_sum(195) == 4026", "assert mult_sum(231) == 5724", "assert mult_sum(229) == 5724", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(265) == 7453\nassert mult_sum(203) == 4222\nassert mult_sum(242) == 6433\nassert mult_sum(195) == 4026\nassert mult_sum(231) == 5724\nassert mult_sum(229) == 5724\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(265)` يُرجع `7453`.\nالجواب:", "qhash": "94a0b447fa902428"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 62:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([13, 36, 31, 31, 14, 32, 32, 1, 7]) == [13, 49, 0, 31, 45, 0, 32, 33, 40]", "assert reset_sum([29, 41, 1, 60, -2, 41, -10, 62, 10, 19]) == [29, 0, 1, 61, 59, 0, -10, 52, 62, 0]", "assert reset_sum([-3, -3, 11, -3, 56, 15, 50, -10, 26, 16]) == [-3, -6, 5, 2, 58, 0, 50, 40, 0, 16]", "assert reset_sum([9, 27, -8, -1, 57, 31]) == [9, 36, 28, 27, 0, 31]", "assert reset_sum([-8, 56]) == [-8, 48]", "assert reset_sum([62, 14]) == [62, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([13, 36, 31, 31, 14, 32, 32, 1, 7]) == [13, 49, 0, 31, 45, 0, 32, 33, 40]\nassert reset_sum([29, 41, 1, 60, -2, 41, -10, 62, 10, 19]) == [29, 0, 1, 61, 59, 0, -10, 52, 62, 0]\nassert reset_sum([-3, -3, 11, -3, 56, 15, 50, -10, 26, 16]) == [-3, -6, 5, 2, 58, 0, 50, 40, 0, 16]\nassert reset_sum([9, 27, -8, -1, 57, 31]) == [9, 36, 28, 27, 0, 31]\nassert reset_sum([-8, 56]) == [-8, 48]\nassert reset_sum([62, 14]) == [62, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 62:\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 > 62:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 62 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([13, 36, 31, 31, 14, 32, 32, 1, 7])` يجب أن تُرجع `[13, 49, 0, 31, 45, 0, 32, 33, 40]`.\nالجواب:", "qhash": "654db4931b3db0fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('رنا', 76), ('خالد', 86), ('نور', 62), ('فيصل', 100)]\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 = [('رنا', 76), ('خالد', 86), ('نور', 62), ('فيصل', 100)]\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": "709ba396f87e6565", "answer": "[('نور', 62), ('رنا', 76), ('خالد', 86), ('فيصل', 100)]\n['فيصل', 'خالد']", "completion": " الناتج:\n```text\n[('نور', 62), ('رنا', 76), ('خالد', 86), ('فيصل', 100)]\n['فيصل', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67", "tests": ["assert digits_mod(17754) == 43", "assert digits_mod(559489) == 20", "assert digits_mod(162336) == 58", "assert digits_mod(867070) == 56", "assert digits_mod(595711) == 33", "assert digits_mod(923506) == 9", "assert digits_mod(98212) == 25", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(17754) == 43\nassert digits_mod(559489) == 20\nassert digits_mod(162336) == 58\nassert digits_mod(867070) == 56\nassert digits_mod(595711) == 33\nassert digits_mod(923506) == 9\nassert digits_mod(98212) == 25\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 67.\nمثال: `digits_mod(17754)` يجب أن تُرجع `43`.\nالجواب:", "qhash": "a19abb8243dd5af0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 31) == 1)", "tests": ["assert coprimes(40) == 39", "assert coprimes(123) == 120", "assert coprimes(114) == 111", "assert coprimes(175) == 170", "assert coprimes(143) == 139", "assert coprimes(35) == 34", "assert coprimes(1) == 1"], "test_code": "assert coprimes(40) == 39\nassert coprimes(123) == 120\nassert coprimes(114) == 111\nassert coprimes(175) == 170\nassert coprimes(143) == 139\nassert coprimes(35) == 34\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, 31) == 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, 31) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 31، أي أن القاسم المشترك الأكبر لها مع 31 يساوي 1.\nمثال: `coprimes(40)` يجب أن تُرجع `39`.\nالجواب:", "qhash": "eb6acc8ed5338a0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(30) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz', '25', '26', '27', 'Fizz', '29', '30']", "assert play(10) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10']", "assert play(25) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz', '25']", "assert play(23) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23']", "assert play(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13']"], "test_code": "assert play(30) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz', '25', '26', '27', 'Fizz', '29', '30']\nassert play(10) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10']\nassert play(25) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz', '25']\nassert play(23) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23']\nassert play(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Fizz'، وعلى 8 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(30)` يجب أن تُرجع `['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz', '25', '26', '27', 'Fizz', '29', '30']`.\nالجواب:", "qhash": "0a4910e1c64a123c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 33", "tests": ["assert digit_score(1826) == 30", "assert digit_score(87765) == 28", "assert digit_score(509405) == 15", "assert digit_score(168683) == 9", "assert digit_score(871081) == 2", "assert digit_score(699701) == 23", "assert digit_score(487431) == 29", "assert digit_score(0) == 0"], "test_code": "assert digit_score(1826) == 30\nassert digit_score(87765) == 28\nassert digit_score(509405) == 15\nassert digit_score(168683) == 9\nassert digit_score(871081) == 2\nassert digit_score(699701) == 23\nassert digit_score(487431) == 29\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 33", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 33.\nللتوضيح: الاستدعاء `digit_score(1826)` يُرجع `30`.\nالجواب:", "qhash": "1d66622365f3e5c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'summer'\nprint(text.index('s') + len(text))\nprint(text.find('s'))\nprint(text.count('s'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'summer'\nprint(text.index('s') + len(text))\nprint(text.find('s'))\nprint(text.count('s'))\n```\nالجواب:", "qhash": "30747cf573e9acfd", "answer": "6\n0\n1", "completion": " الناتج:\n```text\n6\n0\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'عمل'\nprint(w[-1])\nprint(w[::-1])\nprint(w.count('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'عمل'\nprint(w[-1])\nprint(w[::-1])\nprint(w.count('ا'))\n```\nالجواب:", "qhash": "66d1a2ccffb7be32", "answer": "ل\nلمع\n0", "completion": " الناتج:\n```text\nل\nلمع\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('pixel table light an orange pixel banana falcon') == 'falcon|banana|pixel|orange|an|light|table|pixel'", "assert rev_join('on orange apple camel pixel garden rocket') == 'rocket|garden|pixel|camel|apple|orange|on'", "assert rev_join('to summer') == 'summer|to'", "assert rev_join('summer') == 'summer'", "assert rev_join('') == ''", "assert rev_join('') == ''", "assert rev_join('desert window') == 'window|desert'"], "test_code": "assert rev_join('pixel table light an orange pixel banana falcon') == 'falcon|banana|pixel|orange|an|light|table|pixel'\nassert rev_join('on orange apple camel pixel garden rocket') == 'rocket|garden|pixel|camel|apple|orange|on'\nassert rev_join('to summer') == 'summer|to'\nassert rev_join('summer') == 'summer'\nassert rev_join('') == ''\nassert rev_join('') == ''\nassert rev_join('desert window') == 'window|desert'", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_join('pixel table light an orange pixel banana falcon')` يُرجع `'falcon|banana|pixel|orange|an|light|table|pixel'`.\nالجواب:", "qhash": "b925cbd380434e9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [9, -12, 2, -2, -14]\nprint(sorted(nums, key=lambda x: (abs(x - 22), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [9, -12, 2, -2, -14]\nprint(sorted(nums, key=lambda x: (abs(x - 22), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "1e33ce58e209ce0e", "answer": "[9, 2, -2, -12, -14]\n[9, 2, -2]", "completion": " الناتج:\n```text\n[9, 2, -2, -12, -14]\n[9, 2, -2]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('planet signal stone to up') == 'fbqduj iywdqb ijedu je kf'", "assert encode('python on') == 'fojxed ed'", "assert encode('brain banana engine A1') == 'rhqyd rqdqdq udwydu A1'", "assert encode('summer Hello') == 'ikccuh Hubbe'", "assert encode('of river !') == 'ev hyluh !'", "assert encode('up orange up apple 2024') == 'kf ehqdwu kf qffbu 2024'", "assert encode('') == ''"], "test_code": "assert encode('planet signal stone to up') == 'fbqduj iywdqb ijedu je kf'\nassert encode('python on') == 'fojxed ed'\nassert encode('brain banana engine A1') == 'rhqyd rqdqdq udwydu A1'\nassert encode('summer Hello') == 'ikccuh Hubbe'\nassert encode('of river !') == 'ev hyluh !'\nassert encode('up orange up apple 2024') == 'kf ehqdwu kf qffbu 2024'\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 + (16)) % 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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('planet signal stone to up')` يجب أن تُرجع `'fbqduj iywdqb ijedu je kf'`.\nالجواب:", "qhash": "f9a73bc312c0bc85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 26", "tests": ["assert dig_pow_mod(42589) == 6", "assert dig_pow_mod(852121) == 1", "assert dig_pow_mod(121618) == 19", "assert dig_pow_mod(325811) == 4", "assert dig_pow_mod(644343) == 24", "assert dig_pow_mod(912849) == 5", "assert dig_pow_mod(609082) == 19", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(42589) == 6\nassert dig_pow_mod(852121) == 1\nassert dig_pow_mod(121618) == 19\nassert dig_pow_mod(325811) == 4\nassert dig_pow_mod(644343) == 24\nassert dig_pow_mod(912849) == 5\nassert dig_pow_mod(609082) == 19\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 26", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 26\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 26.\nللتوضيح: الاستدعاء `dig_pow_mod(42589)` يُرجع `6`.\nالجواب:", "qhash": "779693e0a8516e1f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['cloud', 'winter', 'pixel', 'summer', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['cloud', 'winter', 'pixel', 'summer', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "b0ebf73fa1eb16af", "answer": "['cloud', 'pixel', 'music', 'winter', 'summer']\n['winter', 'summer', 'pixel']", "completion": " الناتج:\n```text\n['cloud', 'pixel', 'music', 'winter', 'summer']\n['winter', 'summer', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert backwards('data window an garden engine it brain engine') == 'engine brain engine garden window data'", "assert backwards('vector signal on data river') == 'river data signal vector'", "assert backwards('it engine brain pixel planet window') == 'window planet pixel brain engine'", "assert backwards('engine an') == 'engine'", "assert backwards('falcon signal') == 'signal falcon'", "assert backwards('python vector orange it apple engine') == 'engine apple orange vector python'", "assert backwards('to of by coffee we python') == 'python coffee'"], "test_code": "assert backwards('data window an garden engine it brain engine') == 'engine brain engine garden window data'\nassert backwards('vector signal on data river') == 'river data signal vector'\nassert backwards('it engine brain pixel planet window') == 'window planet pixel brain engine'\nassert backwards('engine an') == 'engine'\nassert backwards('falcon signal') == 'signal falcon'\nassert backwards('python vector orange it apple engine') == 'engine apple orange vector python'\nassert backwards('to of by coffee we python') == 'python coffee'", "answer": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `backwards('data window an garden engine it brain engine')` يُرجع `'engine brain engine garden window data'`.\nالجواب:", "qhash": "ae9188b8dfd31c08"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 216\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 = 216\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": "cc41db2a9316358a", "answer": "114", "completion": " الناتج:\n```text\n114\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 0:\n return 1\n return 2 * calc(n - 1) + 3\n\nprint(calc(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 0:\n return 1\n return 2 * calc(n - 1) + 3\n\nprint(calc(9))\n```\nالجواب:", "qhash": "fb23e613262c5b94", "answer": "2045", "completion": " الناتج:\n```text\n2045\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-2, 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(-2, 8))\n```\nالجواب:", "qhash": "d74ac2bbf6e36c85", "answer": "256", "completion": " الناتج:\n```text\n256\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_list([37, 11, 45, 20, 28, 4, 16]) == [37, 11, 45, 20, 28, 4, 16]", "assert rotate_list([11, 21, 0, -2, -4, 2, 8, 19, 49]) == [0, -2, -4, 2, 8, 19, 49, 11, 21]", "assert rotate_list([13, 30, 12, 2, 47]) == [2, 47, 13, 30, 12]", "assert rotate_list([17, -7, 15, 38, 41, -9, 49, 1, 8, -1]) == [38, 41, -9, 49, 1, 8, -1, 17, -7, 15]", "assert rotate_list([-6]) == [-6]", "assert rotate_list([4, 41, 38, 47, 8, 26]) == [26, 4, 41, 38, 47, 8]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([37, 11, 45, 20, 28, 4, 16]) == [37, 11, 45, 20, 28, 4, 16]\nassert rotate_list([11, 21, 0, -2, -4, 2, 8, 19, 49]) == [0, -2, -4, 2, 8, 19, 49, 11, 21]\nassert rotate_list([13, 30, 12, 2, 47]) == [2, 47, 13, 30, 12]\nassert rotate_list([17, -7, 15, 38, 41, -9, 49, 1, 8, -1]) == [38, 41, -9, 49, 1, 8, -1, 17, -7, 15]\nassert rotate_list([-6]) == [-6]\nassert rotate_list([4, 41, 38, 47, 8, 26]) == [26, 4, 41, 38, 47, 8]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return ____\n```\nمثال: `rotate_list([37, 11, 45, 20, 28, 4, 16])` يجب أن تُرجع `[37, 11, 45, 20, 28, 4, 16]`.\nالجواب:", "qhash": "5ec5bf019ac9ad45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([2, 24, 7, 14, 0, 32]) == [24, 7, 14, 0, 32, 2]", "assert roll([42, 20, 38, 0, 38, 45, 5]) == [38, 45, 5, 42, 20, 38, 0]", "assert roll([2, 27, 8]) == [27, 8, 2]", "assert roll([14, 22, 43, 28]) == [28, 14, 22, 43]", "assert roll([26, 45, 45, 48]) == [48, 26, 45, 45]", "assert roll([36, 5, 36, 36, 9, 15, 6, -5]) == [-5, 36, 5, 36, 36, 9, 15, 6]", "assert roll([]) == []"], "test_code": "assert roll([2, 24, 7, 14, 0, 32]) == [24, 7, 14, 0, 32, 2]\nassert roll([42, 20, 38, 0, 38, 45, 5]) == [38, 45, 5, 42, 20, 38, 0]\nassert roll([2, 27, 8]) == [27, 8, 2]\nassert roll([14, 22, 43, 28]) == [28, 14, 22, 43]\nassert roll([26, 45, 45, 48]) == [48, 26, 45, 45]\nassert roll([36, 5, 36, 36, 9, 15, 6, -5]) == [-5, 36, 5, 36, 36, 9, 15, 6]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 17 % 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 = 17 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 17 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([2, 24, 7, 14, 0, 32])` يُرجع `[24, 7, 14, 0, 32, 2]`.\nالجواب:", "qhash": "3bb227163cc9d616"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert shift_list([25, 21, 36, 12, 15, 21]) == [12, 15, 21, 25, 21, 36]", "assert shift_list([10, 24, 31, 25, -9]) == [10, 24, 31, 25, -9]", "assert shift_list([9, 14, 18, 1, 38, 16, 10, 34, 18, 15, -7]) == [38, 16, 10, 34, 18, 15, -7, 9, 14, 18, 1]", "assert shift_list([47, 18, 15, 15, 12, 12, 29, 33, 11]) == [29, 33, 11, 47, 18, 15, 15, 12, 12]", "assert shift_list([49, 25, 9, -6, -4, 23, 39, 48, 5, 0, 32]) == [-4, 23, 39, 48, 5, 0, 32, 49, 25, 9, -6]", "assert shift_list([21, -8, 30, 17, 27, 31, 44, 11, 12]) == [44, 11, 12, 21, -8, 30, 17, 27, 31]", "assert shift_list([]) == []"], "test_code": "assert shift_list([25, 21, 36, 12, 15, 21]) == [12, 15, 21, 25, 21, 36]\nassert shift_list([10, 24, 31, 25, -9]) == [10, 24, 31, 25, -9]\nassert shift_list([9, 14, 18, 1, 38, 16, 10, 34, 18, 15, -7]) == [38, 16, 10, 34, 18, 15, -7, 9, 14, 18, 1]\nassert shift_list([47, 18, 15, 15, 12, 12, 29, 33, 11]) == [29, 33, 11, 47, 18, 15, 15, 12, 12]\nassert shift_list([49, 25, 9, -6, -4, 23, 39, 48, 5, 0, 32]) == [-4, 23, 39, 48, 5, 0, 32, 49, 25, 9, -6]\nassert shift_list([21, -8, 30, 17, 27, 31, 44, 11, 12]) == [44, 11, 12, 21, -8, 30, 17, 27, 31]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef shift_list(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([25, 21, 36, 12, 15, 21])` يُرجع `[12, 15, 21, 25, 21, 36]`.\nالجواب:", "qhash": "99874860e3bbb606"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 3:\n return 3\n return 1 * f(n - 1) + -2\n\nprint(f(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 3:\n return 3\n return 1 * f(n - 1) + -2\n\nprint(f(11))\n```\nالجواب:", "qhash": "7b90abfb52e733da", "answer": "-13", "completion": " الناتج:\n```text\n-13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert mirror_words('orange up we go data') == 'orange'", "assert mirror_words('apple engine it up') == 'engine'", "assert mirror_words('go') == ''", "assert mirror_words('stone garden desert table coffee') == 'coffee_desert_garden'", "assert mirror_words('to desert is a banana desert engine at') == 'engine_desert_banana_desert'", "assert mirror_words('go') == ''", "assert mirror_words('') == ''"], "test_code": "assert mirror_words('orange up we go data') == 'orange'\nassert mirror_words('apple engine it up') == 'engine'\nassert mirror_words('go') == ''\nassert mirror_words('stone garden desert table coffee') == 'coffee_desert_garden'\nassert mirror_words('to desert is a banana desert engine at') == 'engine_desert_banana_desert'\nassert mirror_words('go') == ''\nassert mirror_words('') == ''", "answer": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `mirror_words('orange up we go data')` يجب أن تُرجع `'orange'`.\nالجواب:", "qhash": "6cfb15e71f95e1f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'برتقال'\nprint(kalima.replace(' ', '-'))\nprint(kalima[-1])\nprint(kalima.find('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'برتقال'\nprint(kalima.replace(' ', '-'))\nprint(kalima[-1])\nprint(kalima.find('س'))\n```\nالجواب:", "qhash": "7e54a9ce3ed7db7e", "answer": "برتقال\nل\n-1", "completion": " الناتج:\n```text\nبرتقال\nل\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['signal', 'music', 'orange', 'stone', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['signal', 'music', 'orange', 'stone', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "0b2c774729138674", "answer": "['music', 'stone', 'apple', 'signal', 'orange']\n['signal', 'orange', 'stone']", "completion": " الناتج:\n```text\n['music', 'stone', 'apple', 'signal', 'orange']\n['signal', 'orange', 'stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'pixel'\nprint(text.count('p'))\nprint(text[::-1])\nprint(text[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'pixel'\nprint(text.count('p'))\nprint(text[::-1])\nprint(text[-1:])\n```\nالجواب:", "qhash": "f2f4af8794e2fd10", "answer": "1\nlexip\nl", "completion": " الناتج:\n```text\n1\nlexip\nl\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate([38, 16, 27]) == [27, 38, 16]", "assert rotate([-8, 41, 8, 26, 6, 20, 19, 41, -7, 27, 8, -8]) == [20, 19, 41, -7, 27, 8, -8, -8, 41, 8, 26, 6]", "assert rotate([47, 4, 48, 36, 47, 4]) == [4, 47, 4, 48, 36, 47]", "assert rotate([49]) == [49]", "assert rotate([13, 35, 2, 14, 28, 10, 44, 46]) == [10, 44, 46, 13, 35, 2, 14, 28]", "assert rotate([38, 12, -3]) == [-3, 38, 12]", "assert rotate([]) == []"], "test_code": "assert rotate([38, 16, 27]) == [27, 38, 16]\nassert rotate([-8, 41, 8, 26, 6, 20, 19, 41, -7, 27, 8, -8]) == [20, 19, 41, -7, 27, 8, -8, -8, 41, 8, 26, 6]\nassert rotate([47, 4, 48, 36, 47, 4]) == [4, 47, 4, 48, 36, 47]\nassert rotate([49]) == [49]\nassert rotate([13, 35, 2, 14, 28, 10, 44, 46]) == [10, 44, 46, 13, 35, 2, 14, 28]\nassert rotate([38, 12, -3]) == [-3, 38, 12]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return ____\n```\nمثال: `rotate([38, 16, 27])` يجب أن تُرجع `[27, 38, 16]`.\nالجواب:", "qhash": "72940c06bb2b6bab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 75051\nsteps = 0\nwhile m > 8:\n m = m // 2\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 75051\nsteps = 0\nwhile m > 8:\n m = m // 2\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "1e3ae0f56f57cef3", "answer": "4 14", "completion": " الناتج:\n```text\n4 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 9 * x ** 2 + (-4) * x + (-7)", "tests": ["assert quad(3) == 62", "assert quad(-13) == 1566", "assert quad(-7) == 462", "assert quad(-16) == 2361", "assert quad(0) == -7", "assert quad(18) == 2837", "assert quad(8) == 537", "assert quad(0) == -7"], "test_code": "assert quad(3) == 62\nassert quad(-13) == 1566\nassert quad(-7) == 462\nassert quad(-16) == 2361\nassert quad(0) == -7\nassert quad(18) == 2837\nassert quad(8) == 537\nassert quad(0) == -7", "answer": "def quad(x):\n return 9 * x ** 2 + (-4) * x + (-7)", "completion": " ```python\ndef quad(x):\n return 9 * x ** 2 + (-4) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 9x² - 4x - 7 عند العدد الصحيح x.\nمثال: `quad(3)` يجب أن تُرجع `62`.\nالجواب:", "qhash": "a8f75daca765ef3f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "14758ece2fddb66d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['garden', 'brain', 'code', 'camel', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['garden', 'brain', 'code', 'camel', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "fbd3bb454ef9fd9f", "answer": "['code', 'brain', 'camel', 'garden', 'desert']\n['garden', 'desert', 'camel']", "completion": " الناتج:\n```text\n['code', 'brain', 'camel', 'garden', 'desert']\n['garden', 'desert', 'camel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(90) == 989", "assert total_multiples(134) == 2315", "assert total_multiples(216) == 5990", "assert total_multiples(21) == 64", "assert total_multiples(203) == 5360", "assert total_multiples(230) == 6659", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(90) == 989\nassert total_multiples(134) == 2315\nassert total_multiples(216) == 5990\nassert total_multiples(21) == 64\nassert total_multiples(203) == 5360\nassert total_multiples(230) == 6659\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 % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(90)` يُرجع `989`.\nالجواب:", "qhash": "a6472ef6c6ad97e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if 15 <= x <= 34)", "tests": ["assert select_range([10, 34, 41, 15]) == [-136, -60]", "assert select_range([4]) == []", "assert select_range([-11, 40, 21]) == [-84]", "assert select_range([49, 15]) == [-60]", "assert select_range([4, 37, -1, -5, 30, -21, 40]) == [-120]", "assert select_range([-28, -17, -17, -17, 13]) == []", "assert select_range([28, -24, 60]) == [-112]", "assert select_range([]) == []"], "test_code": "assert select_range([10, 34, 41, 15]) == [-136, -60]\nassert select_range([4]) == []\nassert select_range([-11, 40, 21]) == [-84]\nassert select_range([49, 15]) == [-60]\nassert select_range([4, 37, -1, -5, 30, -21, 40]) == [-120]\nassert select_range([-28, -17, -17, -17, 13]) == []\nassert select_range([28, -24, 60]) == [-112]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if 15 <= x <= 34)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if 15 <= x <= 34)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 15 ≤ x ≤ 34، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([10, 34, 41, 15])` يُرجع `[-136, -60]`.\nالجواب:", "qhash": "9b2c6adbe782ee9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 2\nfor i in range(-3, 15, 1):\n acc += i * 9\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 2\nfor i in range(-3, 15, 1):\n acc += i * 9\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "2caf5526ee866ba6", "answer": "893\n14", "completion": " الناتج:\n```text\n893\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "tests": ["assert sum_div(179) == 3962", "assert sum_div(239) == 7080", "assert sum_div(182) == 4142", "assert sum_div(184) == 4142", "assert sum_div(250) == 7814", "assert sum_div(274) == 9386", "assert sum_div(1) == 0"], "test_code": "assert sum_div(179) == 3962\nassert sum_div(239) == 7080\nassert sum_div(182) == 4142\nassert sum_div(184) == 4142\nassert sum_div(250) == 7814\nassert sum_div(274) == 9386\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(179)` يُرجع `3962`.\nالجواب:", "qhash": "00414cddb3b736d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 24) == 1)", "tests": ["assert coprimes(132) == 44", "assert coprimes(29) == 10", "assert coprimes(119) == 40", "assert coprimes(5) == 2", "assert coprimes(148) == 49", "assert coprimes(124) == 41", "assert coprimes(1) == 1"], "test_code": "assert coprimes(132) == 44\nassert coprimes(29) == 10\nassert coprimes(119) == 40\nassert coprimes(5) == 2\nassert coprimes(148) == 49\nassert coprimes(124) == 41\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, 24) == 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, 24) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 24، أي أن القاسم المشترك الأكبر لها مع 24 يساوي 1.\nمثال: `coprimes(132)` يجب أن تُرجع `44`.\nالجواب:", "qhash": "998dfc7ae864bb0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(8647632))\nprint(rec(rec(8647632)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(8647632))\nprint(rec(rec(8647632)))\n```\nالجواب:", "qhash": "8bf313a376a9a82b", "answer": "36\n9", "completion": " الناتج:\n```text\n36\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(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([11, 4, 13, 41]) == [41, 11, 4, 13]", "assert rotate([24, 11, 0, 23, 37, -5, -4, 15]) == [23, 37, -5, -4, 15, 24, 11, 0]", "assert rotate([25, 46, 43, 24, 0]) == [25, 46, 43, 24, 0]", "assert rotate([41, 32, 22, 9, 38, 17, 33]) == [22, 9, 38, 17, 33, 41, 32]", "assert rotate([39, 25, 5, 10, 37, 8, 35, 25]) == [10, 37, 8, 35, 25, 39, 25, 5]", "assert rotate([8, -2, 36, 29, 29, 34, 17, 23]) == [29, 29, 34, 17, 23, 8, -2, 36]", "assert rotate([]) == []"], "test_code": "assert rotate([11, 4, 13, 41]) == [41, 11, 4, 13]\nassert rotate([24, 11, 0, 23, 37, -5, -4, 15]) == [23, 37, -5, -4, 15, 24, 11, 0]\nassert rotate([25, 46, 43, 24, 0]) == [25, 46, 43, 24, 0]\nassert rotate([41, 32, 22, 9, 38, 17, 33]) == [22, 9, 38, 17, 33, 41, 32]\nassert rotate([39, 25, 5, 10, 37, 8, 35, 25]) == [10, 37, 8, 35, 25, 39, 25, 5]\nassert rotate([8, -2, 36, 29, 29, 34, 17, 23]) == [29, 29, 34, 17, 23, 8, -2, 36]\nassert rotate([]) == []", "answer": "def rotate(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(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(items):\n if not items:\n return []\n k = 5 % len(items)\n return ____\n```\nمثال: `rotate([11, 4, 13, 41])` يجب أن تُرجع `[41, 11, 4, 13]`.\nالجواب:", "qhash": "2a15802e3ea88696"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'stone_planet'\nprint(s[-2:])\nprint(s.split('_'))\nprint(s.find('p'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'stone_planet'\nprint(s[-2:])\nprint(s.split('_'))\nprint(s.find('p'))\n```\nالجواب:", "qhash": "581528e027167a3c", "answer": "et\n['stone', 'planet']\n6", "completion": " الناتج:\n```text\net\n['stone', 'planet']\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'bhtu'}", "tests": ["assert tally('winter camel rocket is') == {'b': 0, 'h': 0, 't': 2, 'u': 0}", "assert tally('go coffee it') == {'b': 0, 'h': 0, 't': 1, 'u': 0}", "assert tally('by window') == {'b': 1, 'h': 0, 't': 0, 'u': 0}", "assert tally('brain') == {'b': 1, 'h': 0, 't': 0, 'u': 0}", "assert tally('in') == {'b': 0, 'h': 0, 't': 0, 'u': 0}", "assert tally('is river engine it') == {'b': 0, 'h': 0, 't': 1, 'u': 0}", "assert tally('') == {'b': 0, 'h': 0, 't': 0, 'u': 0}"], "test_code": "assert tally('winter camel rocket is') == {'b': 0, 'h': 0, 't': 2, 'u': 0}\nassert tally('go coffee it') == {'b': 0, 'h': 0, 't': 1, 'u': 0}\nassert tally('by window') == {'b': 1, 'h': 0, 't': 0, 'u': 0}\nassert tally('brain') == {'b': 1, 'h': 0, 't': 0, 'u': 0}\nassert tally('in') == {'b': 0, 'h': 0, 't': 0, 'u': 0}\nassert tally('is river engine it') == {'b': 0, 'h': 0, 't': 1, 'u': 0}\nassert tally('') == {'b': 0, 'h': 0, 't': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'bhtu'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'bhtu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'h'، 't'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('winter camel rocket is')` يُرجع `{'b': 0, 'h': 0, 't': 2, 'u': 0}`.\nالجواب:", "qhash": "bcf499ba88b40211"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert reverse_words('stone an it it window') == 'window_stone'", "assert reverse_words('by') == ''", "assert reverse_words('apple banana at') == 'banana_apple'", "assert reverse_words('signal camel river planet by by is') == 'planet_river_camel_signal'", "assert reverse_words('table signal') == 'signal_table'", "assert reverse_words('falcon we light in a matrix summer up') == 'summer_matrix_light_falcon'", "assert reverse_words('music falcon music coffee up orange') == 'orange_coffee_music_falcon_music'"], "test_code": "assert reverse_words('stone an it it window') == 'window_stone'\nassert reverse_words('by') == ''\nassert reverse_words('apple banana at') == 'banana_apple'\nassert reverse_words('signal camel river planet by by is') == 'planet_river_camel_signal'\nassert reverse_words('table signal') == 'signal_table'\nassert reverse_words('falcon we light in a matrix summer up') == 'summer_matrix_light_falcon'\nassert reverse_words('music falcon music coffee up orange') == 'orange_coffee_music_falcon_music'", "answer": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `reverse_words('stone an it it window')` يُرجع `'window_stone'`.\nالجواب:", "qhash": "c0f5c209f082ef16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59", "tests": ["assert multi_fact(3) == 3", "assert multi_fact(30) == 36", "assert multi_fact(31) == 16", "assert multi_fact(56) == 1", "assert multi_fact(49) == 2", "assert multi_fact(50) == 50", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(3) == 3\nassert multi_fact(30) == 36\nassert multi_fact(31) == 16\nassert multi_fact(56) == 1\nassert multi_fact(49) == 2\nassert multi_fact(50) == 50\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(3)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "1556c421b42dbe0d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 3\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(14))", "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(14))\n```\nالجواب:", "qhash": "1300699b48a2eec2", "answer": "2207", "completion": " الناتج:\n```text\n2207\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)", "tests": ["assert sum_multiples(91) == 2070", "assert sum_multiples(14) == 42", "assert sum_multiples(176) == 7656", "assert sum_multiples(82) == 1640", "assert sum_multiples(3) == 2", "assert sum_multiples(159) == 6320", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(91) == 2070\nassert sum_multiples(14) == 42\nassert sum_multiples(176) == 7656\nassert sum_multiples(82) == 1640\nassert sum_multiples(3) == 2\nassert sum_multiples(159) == 6320\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 % 10 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 10.\nمثال: `sum_multiples(91)` يجب أن تُرجع `2070`.\nالجواب:", "qhash": "38630ef0fcbaa8fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('امل فجر عمل امل') == 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('بيت باب علم') == 0\nassert prefix_hits('امل فجر عمل امل') == 2\nassert prefix_hits('بيت شمس طالب تفاحة امل قهوة حصان') == 1\nassert prefix_hits('فجر معلم مكتبة لغة حاسوب صحراء') == 0\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 'ا' in w:\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 'ا' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('سفينة مدرسة امل')` يُرجع `1`.\nالجواب:", "qhash": "218588d0fbd7f012"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 3:\n return 4\n return 3 * rec(n - 1) + 0\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 3:\n return 4\n return 3 * rec(n - 1) + 0\n\nprint(rec(5))\n```\nالجواب:", "qhash": "77c9f04ef12d38a2", "answer": "36", "completion": " الناتج:\n```text\n36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert div_not([40, 87, 40, 84, 34, 51, 9, 39, 22, 5, 45, 35]) == 0", "assert div_not([74]) == 0", "assert div_not([-17, 34, -24]) == 1", "assert div_not([0, -19, 41, 64, 11, 79, 46, 52, 44, 80]) == 0", "assert div_not([]) == 0", "assert div_not([-34, 22]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([40, 87, 40, 84, 34, 51, 9, 39, 22, 5, 45, 35]) == 0\nassert div_not([74]) == 0\nassert div_not([-17, 34, -24]) == 1\nassert div_not([0, -19, 41, 64, 11, 79, 46, 52, 44, 80]) == 0\nassert div_not([]) == 0\nassert div_not([-34, 22]) == 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 % 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([40, 87, 40, 84, 34, 51, 9, 39, 22, 5, 45, 35])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e0c0ae6ca51b4beb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(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_matching([29, 72, 3, 52, 74, 88, 70, 63, 57, 57, 36]) == 2", "assert count_matching([86, 35, 7, 68]) == 0", "assert count_matching([]) == 0", "assert count_matching([63, 89, -2, 0]) == 0", "assert count_matching([-36, -40, -23, 73, 34, 80]) == 1", "assert count_matching([23, 25, -32, 39]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([29, 72, 3, 52, 74, 88, 70, 63, 57, 57, 36]) == 2\nassert count_matching([86, 35, 7, 68]) == 0\nassert count_matching([]) == 0\nassert count_matching([63, 89, -2, 0]) == 0\nassert count_matching([-36, -40, -23, 73, 34, 80]) == 1\nassert count_matching([23, 25, -32, 39]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(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_matching(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_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_matching([29, 72, 3, 52, 74, 88, 70, 63, 57, 57, 36])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "8ec1691f5fd58ac3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'حديقة برمجة'\nprint(w.split())\nprint(w[-1])\nprint('ة' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'حديقة برمجة'\nprint(w.split())\nprint(w[-1])\nprint('ة' in w)\n```\nالجواب:", "qhash": "5e729edc9fdec5b5", "answer": "['حديقة', 'برمجة']\nة\nTrue", "completion": " الناتج:\n```text\n['حديقة', 'برمجة']\nة\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(16))\nprint(g(16, -5))\nprint(g(g(-5), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(16))\nprint(g(16, -5))\nprint(g(g(-5), 16))\n```\nالجواب:", "qhash": "c296b7165f95df0a", "answer": "-87\n-75\n-120", "completion": " الناتج:\n```text\n-87\n-75\n-120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(-7))\nprint(g(-7, 8))\nprint(g(g(8), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(-7))\nprint(g(-7, 8))\nprint(g(g(8), -7))\n```\nالجواب:", "qhash": "f8b3daeb5e11eb9d", "answer": "-4\n17\n76", "completion": " الناتج:\n```text\n-4\n17\n76\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(7) == ['1', '2', '3', '4', 'Foo', '6', 'Bar']", "assert fizz(1) == ['1']", "assert fizz(8) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8']", "assert fizz(19) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8', '9', 'Foo', '11', '12', '13', 'Bar', 'Foo', '16', '17', '18', '19']", "assert fizz(18) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8', '9', 'Foo', '11', '12', '13', 'Bar', 'Foo', '16', '17', '18']"], "test_code": "assert fizz(7) == ['1', '2', '3', '4', 'Foo', '6', 'Bar']\nassert fizz(1) == ['1']\nassert fizz(8) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8']\nassert fizz(19) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8', '9', 'Foo', '11', '12', '13', 'Bar', 'Foo', '16', '17', '18', '19']\nassert fizz(18) == ['1', '2', '3', '4', 'Foo', '6', 'Bar', '8', '9', 'Foo', '11', '12', '13', 'Bar', 'Foo', '16', '17', '18']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Foo'\n if i % 7 == 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 % 5 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Foo'، وعلى 7 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(7)` يجب أن تُرجع `['1', '2', '3', '4', 'Foo', '6', 'Bar']`.\nالجواب:", "qhash": "5092f5317eba7ff0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('garden falcon matrix A1') == 'smdpqz rmxoaz ymfduj A1'", "assert decode('light river by python at') == 'xustf duhqd nk bkftaz mf'", "assert decode('falcon to go brain music 2024') == 'rmxoaz fa sa ndmuz ygeuo 2024'", "assert decode('camel') == 'omyqx'", "assert decode('banana') == 'nmzmzm'", "assert decode('of engine data we go') == 'ar qzsuzq pmfm iq sa'", "assert decode('') == ''"], "test_code": "assert decode('garden falcon matrix A1') == 'smdpqz rmxoaz ymfduj A1'\nassert decode('light river by python at') == 'xustf duhqd nk bkftaz mf'\nassert decode('falcon to go brain music 2024') == 'rmxoaz fa sa ndmuz ygeuo 2024'\nassert decode('camel') == 'omyqx'\nassert decode('banana') == 'nmzmzm'\nassert decode('of engine data we go') == 'ar qzsuzq pmfm iq sa'\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 + (-14)) % 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 + (-14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('garden falcon matrix A1')` يجب أن تُرجع `'smdpqz rmxoaz ymfduj A1'`.\nالجواب:", "qhash": "d1dd0d25b8c62318"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 5 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo']", "assert play(11) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11']", "assert play(17) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17']", "assert play(16) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo']", "assert play(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']"], "test_code": "assert play(12) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo']\nassert play(11) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11']\nassert play(17) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo', '17']\nassert play(16) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14', 'Bar', 'Foo']\nassert play(14) == ['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo', '13', '14']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Foo'، وعلى 5 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(12)` يجب أن تُرجع `['1', '2', '3', 'Foo', 'Bar', '6', '7', 'Foo', '9', 'Bar', '11', 'Foo']`.\nالجواب:", "qhash": "8d9f92ea1db7184a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-1, 6))", "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(-1, 6))\n```\nالجواب:", "qhash": "3d139a813ab4d146", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert begin_count('مكتبة مدرسة عربية سوق مطر صحراء سفينة نهر') == 3", "assert begin_count('مطر بحر مدرسة قمر نور') == 2", "assert begin_count('صديق معلم مكتبة مدينة لغة مكتبة') == 4", "assert begin_count('قلم لغة حاسوب باب صحراء حاسوب') == 0", "assert begin_count('بحر مكتبة سوق قلم معلم مطر شمس') == 3", "assert begin_count('نهر حاسوب قهوة مكتبة سيارة') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('مكتبة مدرسة عربية سوق مطر صحراء سفينة نهر') == 3\nassert begin_count('مطر بحر مدرسة قمر نور') == 2\nassert begin_count('صديق معلم مكتبة مدينة لغة مكتبة') == 4\nassert begin_count('قلم لغة حاسوب باب صحراء حاسوب') == 0\nassert begin_count('بحر مكتبة سوق قلم معلم مطر شمس') == 3\nassert begin_count('نهر حاسوب قهوة مكتبة سيارة') == 1\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(line):\n count = 0\n for w in line:\n if w.startswith('م'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('مكتبة مدرسة عربية سوق مطر صحراء سفينة نهر')` يُرجع `3`.\nالجواب:", "qhash": "78a5cd9ac56c60b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(89) == 678", "assert multiples_total(75) == 519", "assert multiples_total(298) == 7987", "assert multiples_total(112) == 1170", "assert multiples_total(148) == 1965", "assert multiples_total(284) == 7116", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(89) == 678\nassert multiples_total(75) == 519\nassert multiples_total(298) == 7987\nassert multiples_total(112) == 1170\nassert multiples_total(148) == 1965\nassert multiples_total(284) == 7116\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(89)` يُرجع `678`.\nالجواب:", "qhash": "028c616dcbf701d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'emnu'}", "tests": ["assert char_freq('to') == {'e': 0, 'm': 0, 'n': 0, 'u': 0}", "assert char_freq('desert code python we') == {'e': 4, 'm': 0, 'n': 1, 'u': 0}", "assert char_freq('python at camel coffee') == {'e': 3, 'm': 1, 'n': 1, 'u': 0}", "assert char_freq('signal banana') == {'e': 0, 'm': 0, 'n': 3, 'u': 0}", "assert char_freq('garden of python is summer') == {'e': 2, 'm': 2, 'n': 2, 'u': 1}", "assert char_freq('by a winter coffee an') == {'e': 3, 'm': 0, 'n': 2, 'u': 0}", "assert char_freq('') == {'e': 0, 'm': 0, 'n': 0, 'u': 0}"], "test_code": "assert char_freq('to') == {'e': 0, 'm': 0, 'n': 0, 'u': 0}\nassert char_freq('desert code python we') == {'e': 4, 'm': 0, 'n': 1, 'u': 0}\nassert char_freq('python at camel coffee') == {'e': 3, 'm': 1, 'n': 1, 'u': 0}\nassert char_freq('signal banana') == {'e': 0, 'm': 0, 'n': 3, 'u': 0}\nassert char_freq('garden of python is summer') == {'e': 2, 'm': 2, 'n': 2, 'u': 1}\nassert char_freq('by a winter coffee an') == {'e': 3, 'm': 0, 'n': 2, 'u': 0}\nassert char_freq('') == {'e': 0, 'm': 0, 'n': 0, 'u': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'emnu'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'emnu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'm'، 'n'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('to')` يُرجع `{'e': 0, 'm': 0, 'n': 0, 'u': 0}`.\nالجواب:", "qhash": "47bc65ba3bacf698"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 2) // 2 for x in range(-2, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 2) // 2 for x in range(-2, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d169edd97ff8ef20", "answer": "[0, 1, 2, 3, 4, 5]\n6 15", "completion": " الناتج:\n```text\n[0, 1, 2, 3, 4, 5]\n6 15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('summer music by music python OK') == 'tvnnfs nvtjd cz nvtjd qzuipo OK'", "assert cipher('light to A1') == 'mjhiu up A1'", "assert cipher('table light signal Hello') == 'ubcmf mjhiu tjhobm Hfmmp'", "assert cipher('python code desert it at') == 'qzuipo dpef eftfsu ju bu'", "assert cipher('a coffee by falcon') == 'b dpggff cz gbmdpo'", "assert cipher('a') == 'b'", "assert cipher('') == ''"], "test_code": "assert cipher('summer music by music python OK') == 'tvnnfs nvtjd cz nvtjd qzuipo OK'\nassert cipher('light to A1') == 'mjhiu up A1'\nassert cipher('table light signal Hello') == 'ubcmf mjhiu tjhobm Hfmmp'\nassert cipher('python code desert it at') == 'qzuipo dpef eftfsu ju bu'\nassert cipher('a coffee by falcon') == 'b dpggff cz gbmdpo'\nassert cipher('a') == 'b'\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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('summer music by music python OK')` يُرجع `'tvnnfs nvtjd cz nvtjd qzuipo OK'`.\nالجواب:", "qhash": "66fe0a8e9a85e2fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 52", "tests": ["assert digits_mod(32279) == 35", "assert digits_mod(635656) == 25", "assert digits_mod(959139) == 24", "assert digits_mod(626592) == 50", "assert digits_mod(428780) == 43", "assert digits_mod(830025) == 28", "assert digits_mod(485344) == 0", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(32279) == 35\nassert digits_mod(635656) == 25\nassert digits_mod(959139) == 24\nassert digits_mod(626592) == 50\nassert digits_mod(428780) == 43\nassert digits_mod(830025) == 28\nassert digits_mod(485344) == 0\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 52", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 52\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 52.\nمثال: `digits_mod(32279)` يجب أن تُرجع `35`.\nالجواب:", "qhash": "a2b70ee04a645cc5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'river'\nprint(s.upper())\nprint(s.replace('v', '#'))\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'river'\nprint(s.upper())\nprint(s.replace('v', '#'))\nprint(s.capitalize())\n```\nالجواب:", "qhash": "d96cc26fdcef124a", "answer": "RIVER\nri#er\nRiver", "completion": " الناتج:\n```text\nRIVER\nri#er\nRiver\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'مريم': 3, 'علي': 29, 'زينب': 40, 'ليلى': 10}\npoints['مريم'] += 17\npoints['أحمد'] = 32\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'مريم': 3, 'علي': 29, 'زينب': 40, 'ليلى': 10}\npoints['مريم'] += 17\npoints['أحمد'] = 32\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))\n```\nالجواب:", "qhash": "e23f241765a32b13", "answer": "5\nزينب\n131\n-1", "completion": " الناتج:\n```text\n5\nزينب\n131\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'adgt'}", "tests": ["assert tally('to on garden cloud coffee') == {'a': 1, 'd': 2, 'g': 1, 't': 1}", "assert tally('python at to winter an an') == {'a': 3, 'd': 0, 'g': 0, 't': 4}", "assert tally('window river') == {'a': 0, 'd': 1, 'g': 0, 't': 0}", "assert tally('winter camel up up') == {'a': 1, 'd': 0, 'g': 0, 't': 1}", "assert tally('is a apple pixel table desert') == {'a': 3, 'd': 1, 'g': 0, 't': 2}", "assert tally('music it winter apple') == {'a': 1, 'd': 0, 'g': 0, 't': 2}", "assert tally('') == {'a': 0, 'd': 0, 'g': 0, 't': 0}"], "test_code": "assert tally('to on garden cloud coffee') == {'a': 1, 'd': 2, 'g': 1, 't': 1}\nassert tally('python at to winter an an') == {'a': 3, 'd': 0, 'g': 0, 't': 4}\nassert tally('window river') == {'a': 0, 'd': 1, 'g': 0, 't': 0}\nassert tally('winter camel up up') == {'a': 1, 'd': 0, 'g': 0, 't': 1}\nassert tally('is a apple pixel table desert') == {'a': 3, 'd': 1, 'g': 0, 't': 2}\nassert tally('music it winter apple') == {'a': 1, 'd': 0, 'g': 0, 't': 2}\nassert tally('') == {'a': 0, 'd': 0, 'g': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'adgt'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'adgt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'd'، 'g'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('to on garden cloud coffee')` يجب أن تُرجع `{'a': 1, 'd': 2, 'g': 1, 't': 1}`.\nالجواب:", "qhash": "0cdbe52c8071563e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ntu'}", "tests": ["assert freq_of('matrix orange cloud falcon pixel') == {'n': 2, 't': 1, 'u': 1}", "assert freq_of('winter to an it an') == {'n': 3, 't': 3, 'u': 0}", "assert freq_of('matrix') == {'n': 0, 't': 1, 'u': 0}", "assert freq_of('apple') == {'n': 0, 't': 0, 'u': 0}", "assert freq_of('table orange') == {'n': 1, 't': 1, 'u': 0}", "assert freq_of('camel matrix go stone apple') == {'n': 1, 't': 2, 'u': 0}", "assert freq_of('') == {'n': 0, 't': 0, 'u': 0}"], "test_code": "assert freq_of('matrix orange cloud falcon pixel') == {'n': 2, 't': 1, 'u': 1}\nassert freq_of('winter to an it an') == {'n': 3, 't': 3, 'u': 0}\nassert freq_of('matrix') == {'n': 0, 't': 1, 'u': 0}\nassert freq_of('apple') == {'n': 0, 't': 0, 'u': 0}\nassert freq_of('table orange') == {'n': 1, 't': 1, 'u': 0}\nassert freq_of('camel matrix go stone apple') == {'n': 1, 't': 2, 'u': 0}\nassert freq_of('') == {'n': 0, 't': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ntu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ntu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'n'، 't'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('matrix orange cloud falcon pixel')` يُرجع `{'n': 2, 't': 1, 'u': 1}`.\nالجواب:", "qhash": "234fdf6fa675eaf6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 63) == 1)", "tests": ["assert coprime_count(146) == 84", "assert coprime_count(11) == 7", "assert coprime_count(3) == 2", "assert coprime_count(134) == 77", "assert coprime_count(6) == 4", "assert coprime_count(190) == 109", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(146) == 84\nassert coprime_count(11) == 7\nassert coprime_count(3) == 2\nassert coprime_count(134) == 77\nassert coprime_count(6) == 4\nassert coprime_count(190) == 109\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, 63) == 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, 63) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 63) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(146)` يُرجع `84`.\nالجواب:", "qhash": "3cbbf2df0b52c3c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total", "tests": ["assert weighted_sum(5) == 440", "assert weighted_sum(4) == 240", "assert weighted_sum(3) == 112", "assert weighted_sum(1) == 8", "assert weighted_sum(12) == 5200", "assert weighted_sum(1) == 8", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 440\nassert weighted_sum(4) == 240\nassert weighted_sum(3) == 112\nassert weighted_sum(1) == 8\nassert weighted_sum(12) == 5200\nassert weighted_sum(1) == 8\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `440`.\nالجواب:", "qhash": "ed7c79062c8e3823"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert count_start('وردة قهوة وردة فجر خبز مطر') == 2", "assert count_start('رمل حديقة حديقة قمر وردة ليل') == 1", "assert count_start('وردة حديقة') == 1", "assert count_start('وردة وردة مدرسة بيت') == 2", "assert count_start('سفينة فجر') == 0", "assert count_start('نهار مطر وردة') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('وردة قهوة وردة فجر خبز مطر') == 2\nassert count_start('رمل حديقة حديقة قمر وردة ليل') == 1\nassert count_start('وردة حديقة') == 1\nassert count_start('وردة وردة مدرسة بيت') == 2\nassert count_start('سفينة فجر') == 0\nassert count_start('نهار مطر وردة') == 1\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(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_start(s):\n count = 0\n for w in s.split():\n if w.endswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('وردة قهوة وردة فجر خبز مطر')` يُرجع `2`.\nالجواب:", "qhash": "cde34a87090ef4cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('by of brain it !') == 'zw md zpygl gr !'", "assert rotate_letters('is to 2024') == 'gq rm 2024'", "assert rotate_letters('winter engine music go falcon') == 'uglrcp cleglc ksqga em dyjaml'", "assert rotate_letters('is river apple') == 'gq pgtcp ynnjc'", "assert rotate_letters('go') == 'em'", "assert rotate_letters('python 2024') == 'nwrfml 2024'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('by of brain it !') == 'zw md zpygl gr !'\nassert rotate_letters('is to 2024') == 'gq rm 2024'\nassert rotate_letters('winter engine music go falcon') == 'uglrcp cleglc ksqga em dyjaml'\nassert rotate_letters('is river apple') == 'gq pgtcp ynnjc'\nassert rotate_letters('go') == 'em'\nassert rotate_letters('python 2024') == 'nwrfml 2024'\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 + (-2)) % 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 + (-2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('by of brain it !')` يجب أن تُرجع `'zw md zpygl gr !'`.\nالجواب:", "qhash": "f7ca92b8241861c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "09d46b4d5345952b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('cloud rocket falcon 2024') == 'luxdm axltnc ojulxw 2024'", "assert caesar('desert we code cloud at') == 'mnbnac fn lxmn luxdm jc'", "assert caesar('river') == 'arena'", "assert caesar('python signal') == 'yhcqxw brpwju'", "assert caesar('falcon light go') == 'ojulxw urpqc px'", "assert caesar('orange vector signal falcon') == 'xajwpn enlcxa brpwju ojulxw'", "assert caesar('') == ''"], "test_code": "assert caesar('cloud rocket falcon 2024') == 'luxdm axltnc ojulxw 2024'\nassert caesar('desert we code cloud at') == 'mnbnac fn lxmn luxdm jc'\nassert caesar('river') == 'arena'\nassert caesar('python signal') == 'yhcqxw brpwju'\nassert caesar('falcon light go') == 'ojulxw urpqc px'\nassert caesar('orange vector signal falcon') == 'xajwpn enlcxa brpwju ojulxw'\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 + (9)) % 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 + (9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('cloud rocket falcon 2024')` يجب أن تُرجع `'luxdm axltnc ojulxw 2024'`.\nالجواب:", "qhash": "f7db493064db0819"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'light_table'\nprint(word.replace('t', '#'))\nprint(word.index('t') + len(word))\nprint(word.count('t'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'light_table'\nprint(word.replace('t', '#'))\nprint(word.index('t') + len(word))\nprint(word.count('t'))\n```\nالجواب:", "qhash": "08d06ff7e64ca040", "answer": "ligh#_#able\n15\n2", "completion": " الناتج:\n```text\nligh#_#able\n15\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 45:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([3, 24, 17, 9, 27, 2, 13, 16]) == [3, 27, 44, 0, 27, 29, 42, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([-2, 31, 2, 28]) == [-2, 29, 31, 0]", "assert capped_cumsum([24]) == [24]", "assert capped_cumsum([23, 0, 10, 25]) == [23, 23, 33, 0]", "assert capped_cumsum([34, 37, -8]) == [34, 0, -8]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([3, 24, 17, 9, 27, 2, 13, 16]) == [3, 27, 44, 0, 27, 29, 42, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([-2, 31, 2, 28]) == [-2, 29, 31, 0]\nassert capped_cumsum([24]) == [24]\nassert capped_cumsum([23, 0, 10, 25]) == [23, 23, 33, 0]\nassert capped_cumsum([34, 37, -8]) == [34, 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 > 45:\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 > 45:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 45 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([3, 24, 17, 9, 27, 2, 13, 16])` يُرجع `[3, 27, 44, 0, 27, 29, 42, 0]`.\nالجواب:", "qhash": "46b20c9dd4db1f36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('ف')", "tests": ["assert tally_letter('مدينة سفينة جمل سماء صديق جمل ماء سماء') == 1", "assert tally_letter('دفتر عربية سلام صديق قهوة سفينة دفتر') == 3", "assert tally_letter('رمل خبز وردة') == 0", "assert tally_letter('ميناء عمل') == 0", "assert tally_letter('فجر مطر سيارة دفتر كتاب خبز سوق') == 2", "assert tally_letter('سماء سلام شمس شجرة ماء صديق تفاحة') == 1", "assert tally_letter('مطر مدينة شمس حصان خبز') == 0", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('مدينة سفينة جمل سماء صديق جمل ماء سماء') == 1\nassert tally_letter('دفتر عربية سلام صديق قهوة سفينة دفتر') == 3\nassert tally_letter('رمل خبز وردة') == 0\nassert tally_letter('ميناء عمل') == 0\nassert tally_letter('فجر مطر سيارة دفتر كتاب خبز سوق') == 2\nassert tally_letter('سماء سلام شمس شجرة ماء صديق تفاحة') == 1\nassert tally_letter('مطر مدينة شمس حصان خبز') == 0\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n return text.count('ف')", "completion": " ```python\ndef tally_letter(text):\n return text.count('ف')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `tally_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «ف» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('مدينة سفينة جمل سماء صديق جمل ماء سماء')` يُرجع `1`.\nالجواب:", "qhash": "8784442e8da4319d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [28, 10, -8, 4, 2, 16, 29]\nprint(a[0:1])\nprint(a[::2])\nprint(sum(a[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [28, 10, -8, 4, 2, 16, 29]\nprint(a[0:1])\nprint(a[::2])\nprint(sum(a[0:1]))\n```\nالجواب:", "qhash": "fa167990a139264c", "answer": "[28]\n[28, -8, 2, 29]\n28", "completion": " الناتج:\n```text\n[28]\n[28, -8, 2, 29]\n28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [40, 20, 19, 23, 28, 3, 2, 23, 21]\nprint(data[1:3])\nprint(data[::-2])\nprint(max(data[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [40, 20, 19, 23, 28, 3, 2, 23, 21]\nprint(data[1:3])\nprint(data[::-2])\nprint(max(data[1:3]))\n```\nالجواب:", "qhash": "e62addd04c62e6a6", "answer": "[20, 19]\n[21, 2, 28, 19, 40]\n20", "completion": " الناتج:\n```text\n[20, 19]\n[21, 2, 28, 19, 40]\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(arr):\n if not arr:\n return []\n k = 13 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_list([6, 18, 21, 44]) == [44, 6, 18, 21]", "assert rotate_list([24, 10, 49, 23]) == [23, 24, 10, 49]", "assert rotate_list([10, 38, 50, 44, 32, 39, 37, 38, 18, 41, 33, 31]) == [31, 10, 38, 50, 44, 32, 39, 37, 38, 18, 41, 33]", "assert rotate_list([44, 44, 33, 11, -9, 6, 31, 11, 37, 0, 20]) == [0, 20, 44, 44, 33, 11, -9, 6, 31, 11, 37]", "assert rotate_list([31, 31, 12, 0, -2, 49, 42, 43]) == [0, -2, 49, 42, 43, 31, 31, 12]", "assert rotate_list([23, 48, 36, 6, 13, 17, 8, 36, 5, 23, 37]) == [23, 37, 23, 48, 36, 6, 13, 17, 8, 36, 5]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([6, 18, 21, 44]) == [44, 6, 18, 21]\nassert rotate_list([24, 10, 49, 23]) == [23, 24, 10, 49]\nassert rotate_list([10, 38, 50, 44, 32, 39, 37, 38, 18, 41, 33, 31]) == [31, 10, 38, 50, 44, 32, 39, 37, 38, 18, 41, 33]\nassert rotate_list([44, 44, 33, 11, -9, 6, 31, 11, 37, 0, 20]) == [0, 20, 44, 44, 33, 11, -9, 6, 31, 11, 37]\nassert rotate_list([31, 31, 12, 0, -2, 49, 42, 43]) == [0, -2, 49, 42, 43, 31, 31, 12]\nassert rotate_list([23, 48, 36, 6, 13, 17, 8, 36, 5, 23, 37]) == [23, 37, 23, 48, 36, 6, 13, 17, 8, 36, 5]\nassert rotate_list([]) == []", "answer": "def rotate_list(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 rotate_list(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 rotate_list(arr):\n if not arr:\n return []\n k = 13 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([6, 18, 21, 44])` يُرجع `[44, 6, 18, 21]`.\nالجواب:", "qhash": "d50718d974d04c79"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(961896729))\nprint(calc(calc(961896729)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(961896729))\nprint(calc(calc(961896729)))\n```\nالجواب:", "qhash": "b80e82e62aa91cdc", "answer": "57\n12", "completion": " الناتج:\n```text\n57\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 5 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(16) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'SunMoon', '16']", "assert fizz(22) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'SunMoon', '16', '17', 'Sun', '19', 'Moon', 'Sun', '22']", "assert fizz(3) == ['1', '2', 'Sun']", "assert fizz(13) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13']", "assert fizz(9) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun']"], "test_code": "assert fizz(16) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'SunMoon', '16']\nassert fizz(22) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'SunMoon', '16', '17', 'Sun', '19', 'Moon', 'Sun', '22']\nassert fizz(3) == ['1', '2', 'Sun']\nassert fizz(13) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13']\nassert fizz(9) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Sun'، وعلى 5 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(16)` يجب أن تُرجع `['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14', 'SunMoon', '16']`.\nالجواب:", "qhash": "1072ad7d2b0993a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 8 for x in range(5, 12) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 8 for x in range(5, 12) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "ca427a9c55b46e29", "answer": "[56]\n1 56", "completion": " الناتج:\n```text\n[56]\n1 56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 6\nfor j in range(-5, 12, 4):\n acc -= j * 5\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 6\nfor j in range(-5, 12, 4):\n acc -= j * 5\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "b457e4df4da6470a", "answer": "-69\n11", "completion": " الناتج:\n```text\n-69\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(13) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13']", "assert fizzbuzz(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15', '16', '17', 'FooBar', '19', '20', '21']", "assert fizzbuzz(24) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15', '16', '17', 'FooBar', '19', '20', '21', '22', '23', 'Foo']", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15']", "assert fizzbuzz(11) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11']"], "test_code": "assert fizzbuzz(13) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13']\nassert fizzbuzz(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15', '16', '17', 'FooBar', '19', '20', '21']\nassert fizzbuzz(24) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15', '16', '17', 'FooBar', '19', '20', '21', '22', '23', 'Foo']\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13', '14', '15']\nassert fizzbuzz(11) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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سؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Foo'، وإن قَبِلها على 9 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(13)` يُرجع `['1', '2', '3', '4', '5', 'Foo', '7', '8', 'Bar', '10', '11', 'Foo', '13']`.\nالجواب:", "qhash": "6e32400f610699a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 43", "tests": ["assert rec_prod(6) == 5", "assert rec_prod(7) == 19", "assert rec_prod(20) == 18", "assert rec_prod(2) == 2", "assert rec_prod(30) == 39", "assert rec_prod(5) == 15", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 5\nassert rec_prod(7) == 19\nassert rec_prod(20) == 18\nassert rec_prod(2) == 2\nassert rec_prod(30) == 39\nassert rec_prod(5) == 15\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 43", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(6)` يُرجع `5`.\nالجواب:", "qhash": "a3f32067156758ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 111:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([16, 54, 50, 50, 15]) == [16, 70, 0, 50, 65]", "assert rolling_total([-2, 111, 24, -8, 39]) == [-2, 109, 0, -8, 31]", "assert rolling_total([96, 57, 37, 20, 33, 22, 59, 82, 111]) == [96, 0, 37, 57, 90, 0, 59, 0, 111]", "assert rolling_total([29, 79, 97, 75, 97, 48, 36, 50, 62]) == [29, 108, 0, 75, 0, 48, 84, 0, 62]", "assert rolling_total([19, -7, 67]) == [19, 12, 79]", "assert rolling_total([18]) == [18]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([16, 54, 50, 50, 15]) == [16, 70, 0, 50, 65]\nassert rolling_total([-2, 111, 24, -8, 39]) == [-2, 109, 0, -8, 31]\nassert rolling_total([96, 57, 37, 20, 33, 22, 59, 82, 111]) == [96, 0, 37, 57, 90, 0, 59, 0, 111]\nassert rolling_total([29, 79, 97, 75, 97, 48, 36, 50, 62]) == [29, 108, 0, 75, 0, 48, 84, 0, 62]\nassert rolling_total([19, -7, 67]) == [19, 12, 79]\nassert rolling_total([18]) == [18]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 111:\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 > 111:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 111 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([16, 54, 50, 50, 15])` يجب أن تُرجع `[16, 70, 0, 50, 65]`.\nالجواب:", "qhash": "feff573814c2bd31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 380\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 = 380\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": "5e55662be618fabf", "answer": "107", "completion": " الناتج:\n```text\n107\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'ماء نهر'\nprint(text[-1])\nprint(text.split())\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'ماء نهر'\nprint(text[-1])\nprint(text.split())\nprint(text[0])\n```\nالجواب:", "qhash": "c8bf228959dda140", "answer": "ر\n['ماء', 'نهر']\nم", "completion": " الناتج:\n```text\nر\n['ماء', 'نهر']\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'مريم': 14, 'سلمى': 25, 'وليد': 19, 'يوسف': 37, 'منى': 24}\nmarks['يوسف'] += 1\nmarks['سعيد'] = 39\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'مريم': 14, 'سلمى': 25, 'وليد': 19, 'يوسف': 37, 'منى': 24}\nmarks['يوسف'] += 1\nmarks['سعيد'] = 39\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 16])\n```\nالجواب:", "qhash": "7039f4becdc706e3", "answer": "6\nسعيد\n159\n['سلمى', 'وليد', 'يوسف', 'منى', 'سعيد']", "completion": " الناتج:\n```text\n6\nسعيد\n159\n['سلمى', 'وليد', 'يوسف', 'منى', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [33, 33, -5, 0, -8]\nprint(nums[3:4])\nprint(nums[::-1])\nprint(min(nums[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [33, 33, -5, 0, -8]\nprint(nums[3:4])\nprint(nums[::-1])\nprint(min(nums[3:4]))\n```\nالجواب:", "qhash": "45761fd526ddc245", "answer": "[0]\n[-8, 0, -5, 33, 33]\n0", "completion": " الناتج:\n```text\n[0]\n[-8, 0, -5, 33, 33]\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'طالب صحراء'\nprint('ء' in s)\nprint(s.replace(' ', '-'))\nprint(s.count('ء'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'طالب صحراء'\nprint('ء' in s)\nprint(s.replace(' ', '-'))\nprint(s.count('ء'))\n```\nالجواب:", "qhash": "e8f93d6d63b4e785", "answer": "True\nطالب-صحراء\n1", "completion": " الناتج:\n```text\nTrue\nطالب-صحراء\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([44, 35, 19, 51, 18]) == 18", "assert largest_div([-27, -18, -45]) == -18", "assert largest_div([1]) == None", "assert largest_div([36, -9, 21, 39, -17, 33, -31]) == 36", "assert largest_div([-46, 24, -22, -42, 36, 27, -44, -1]) == 36", "assert largest_div([]) == None"], "test_code": "assert largest_div([44, 35, 19, 51, 18]) == 18\nassert largest_div([-27, -18, -45]) == -18\nassert largest_div([1]) == None\nassert largest_div([36, -9, 21, 39, -17, 33, -31]) == 36\nassert largest_div([-46, 24, -22, -42, 36, 27, -44, -1]) == 36\nassert largest_div([]) == None", "answer": "def largest_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef largest_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([44, 35, 19, 51, 18])` يُرجع `18`.\nالجواب:", "qhash": "2b2981f72c2e57ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 0 for x in range(5, 18) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 0 for x in range(5, 18) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "38dd64602b7682fe", "answer": "[36, 121, 256]\n3 413", "completion": " الناتج:\n```text\n[36, 121, 256]\n3 413\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 87:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([12, 4, 40, 31, 18, 42, 41, 38, 45, 30]) == [12, 16, 56, 87, 0, 42, 83, 0, 45, 75]", "assert reset_sum([76, 54, 30, 8, 7, 50, -10]) == [76, 0, 30, 38, 45, 0, -10]", "assert reset_sum([48, 65, 12, 2, -10, 3, 66]) == [48, 0, 12, 14, 4, 7, 73]", "assert reset_sum([69, 29, 4]) == [69, 0, 4]", "assert reset_sum([61, 72, 12, 64, 68, 53, 35, 64, 16]) == [61, 0, 12, 76, 0, 53, 0, 64, 80]", "assert reset_sum([84, 2]) == [84, 86]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([12, 4, 40, 31, 18, 42, 41, 38, 45, 30]) == [12, 16, 56, 87, 0, 42, 83, 0, 45, 75]\nassert reset_sum([76, 54, 30, 8, 7, 50, -10]) == [76, 0, 30, 38, 45, 0, -10]\nassert reset_sum([48, 65, 12, 2, -10, 3, 66]) == [48, 0, 12, 14, 4, 7, 73]\nassert reset_sum([69, 29, 4]) == [69, 0, 4]\nassert reset_sum([61, 72, 12, 64, 68, 53, 35, 64, 16]) == [61, 0, 12, 76, 0, 53, 0, 64, 80]\nassert reset_sum([84, 2]) == [84, 86]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 87:\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 > 87:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 87 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([12, 4, 40, 31, 18, 42, 41, 38, 45, 30])` يجب أن تُرجع `[12, 16, 56, 87, 0, 42, 83, 0, 45, 75]`.\nالجواب:", "qhash": "1e0059c1f74df868"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 19\nfor j in range(-5, 4, 3):\n result -= j * 1\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 19\nfor j in range(-5, 4, 3):\n result -= j * 1\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "55235e2a920e463a", "answer": "25\n1", "completion": " الناتج:\n```text\n25\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 0 + -3 for x in range(4, 19) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 0 + -3 for x in range(4, 19) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e2c6b08f2d735dfe", "answer": "[-3, -3, -3]\n3 -9", "completion": " الناتج:\n```text\n[-3, -3, -3]\n3 -9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('falcon window planet on orange camel on') == 'camel orange planet window falcon'", "assert words_reversed('up up is an of') == ''", "assert words_reversed('code winter falcon orange orange') == 'orange orange falcon winter'", "assert words_reversed('on vector engine by engine cloud') == 'cloud engine engine vector'", "assert words_reversed('rocket pixel orange planet') == 'planet orange pixel rocket'", "assert words_reversed('') == ''", "assert words_reversed('river') == 'river'"], "test_code": "assert words_reversed('falcon window planet on orange camel on') == 'camel orange planet window falcon'\nassert words_reversed('up up is an of') == ''\nassert words_reversed('code winter falcon orange orange') == 'orange orange falcon winter'\nassert words_reversed('on vector engine by engine cloud') == 'cloud engine engine vector'\nassert words_reversed('rocket pixel orange planet') == 'planet orange pixel rocket'\nassert words_reversed('') == ''\nassert words_reversed('river') == 'river'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `words_reversed('falcon window planet on orange camel on')` يُرجع `'camel orange planet window falcon'`.\nالجواب:", "qhash": "0122edbfea002657"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 63) == 1)", "tests": ["assert count_coprime(149) == 86", "assert count_coprime(153) == 88", "assert count_coprime(150) == 86", "assert count_coprime(198) == 113", "assert count_coprime(45) == 26", "assert count_coprime(191) == 110", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(149) == 86\nassert count_coprime(153) == 88\nassert count_coprime(150) == 86\nassert count_coprime(198) == 113\nassert count_coprime(45) == 26\nassert count_coprime(191) == 110\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, 63) == 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, 63) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 63) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(149)` يُرجع `86`.\nالجواب:", "qhash": "be6d8b7ea527d081"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('go stone rocket it in') == 'dl pqlkb olzhbq fq fk'", "assert decode('river banana signal in') == 'ofsbo yxkxkx pfdkxi fk'", "assert decode('planet is to go Hello') == 'mixkbq fp ql dl Hbiil'", "assert decode('go we') == 'dl tb'", "assert decode('planet we') == 'mixkbq tb'", "assert decode('matrix matrix is orange window 2024') == 'jxqofu jxqofu fp loxkdb tfkalt 2024'", "assert decode('') == ''"], "test_code": "assert decode('go stone rocket it in') == 'dl pqlkb olzhbq fq fk'\nassert decode('river banana signal in') == 'ofsbo yxkxkx pfdkxi fk'\nassert decode('planet is to go Hello') == 'mixkbq fp ql dl Hbiil'\nassert decode('go we') == 'dl tb'\nassert decode('planet we') == 'mixkbq tb'\nassert decode('matrix matrix is orange window 2024') == 'jxqofu jxqofu fp loxkdb tfkalt 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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('go stone rocket it in')` يُرجع `'dl pqlkb olzhbq fq fk'`.\nالجواب:", "qhash": "12f6adc7ee2ce5a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(279) == 21319", "assert sum_multiples(275) == 20490", "assert sum_multiples(58) == 911", "assert sum_multiples(166) == 7510", "assert sum_multiples(251) == 17081", "assert sum_multiples(79) == 1736", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(279) == 21319\nassert sum_multiples(275) == 20490\nassert sum_multiples(58) == 911\nassert sum_multiples(166) == 7510\nassert sum_multiples(251) == 17081\nassert sum_multiples(79) == 1736\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 % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(279)` يُرجع `21319`.\nالجواب:", "qhash": "ce3f0e5259fe92c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bdlr'}", "tests": ["assert letter_stats('apple orange falcon table banana garden') == {'b': 2, 'd': 1, 'l': 3, 'r': 2}", "assert letter_stats('banana code vector river it data') == {'b': 1, 'd': 2, 'l': 0, 'r': 3}", "assert letter_stats('of') == {'b': 0, 'd': 0, 'l': 0, 'r': 0}", "assert letter_stats('by light cloud desert window') == {'b': 1, 'd': 3, 'l': 2, 'r': 1}", "assert letter_stats('orange is window falcon desert engine') == {'b': 0, 'd': 2, 'l': 1, 'r': 2}", "assert letter_stats('orange river') == {'b': 0, 'd': 0, 'l': 0, 'r': 3}", "assert letter_stats('') == {'b': 0, 'd': 0, 'l': 0, 'r': 0}"], "test_code": "assert letter_stats('apple orange falcon table banana garden') == {'b': 2, 'd': 1, 'l': 3, 'r': 2}\nassert letter_stats('banana code vector river it data') == {'b': 1, 'd': 2, 'l': 0, 'r': 3}\nassert letter_stats('of') == {'b': 0, 'd': 0, 'l': 0, 'r': 0}\nassert letter_stats('by light cloud desert window') == {'b': 1, 'd': 3, 'l': 2, 'r': 1}\nassert letter_stats('orange is window falcon desert engine') == {'b': 0, 'd': 2, 'l': 1, 'r': 2}\nassert letter_stats('orange river') == {'b': 0, 'd': 0, 'l': 0, 'r': 3}\nassert letter_stats('') == {'b': 0, 'd': 0, 'l': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bdlr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bdlr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'd'، 'l'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('apple orange falcon table banana garden')` يُرجع `{'b': 2, 'd': 1, 'l': 3, 'r': 2}`.\nالجواب:", "qhash": "f0de80ee85f6a794"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "tests": ["assert sum_terms(4) == 11700", "assert sum_terms(9) == 1087425", "assert sum_terms(6) == 109809", "assert sum_terms(7) == 261072", "assert sum_terms(11) == 3436884", "assert sum_terms(1) == 9", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 11700\nassert sum_terms(9) == 1087425\nassert sum_terms(6) == 109809\nassert sum_terms(7) == 261072\nassert sum_terms(11) == 3436884\nassert sum_terms(1) == 9\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `11700`.\nالجواب:", "qhash": "402f5dc6abee2f01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 92", "tests": ["assert dig_pow_mod(34716) == 7", "assert dig_pow_mod(468153) == 25", "assert dig_pow_mod(73756) == 42", "assert dig_pow_mod(894880) == 29", "assert dig_pow_mod(249363) == 59", "assert dig_pow_mod(560613) == 33", "assert dig_pow_mod(295003) == 61", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(34716) == 7\nassert dig_pow_mod(468153) == 25\nassert dig_pow_mod(73756) == 42\nassert dig_pow_mod(894880) == 29\nassert dig_pow_mod(249363) == 59\nassert dig_pow_mod(560613) == 33\nassert dig_pow_mod(295003) == 61\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 92", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 92\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 92.\nللتوضيح: الاستدعاء `dig_pow_mod(34716)` يُرجع `7`.\nالجواب:", "qhash": "156608936d8a19da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('صحراء ماء وردة ماء وردة جبل') == 2", "assert count_prefix('شمس برمجة سماء وردة نهر') == 1", "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('صحراء ماء وردة ماء وردة جبل') == 2\nassert count_prefix('شمس برمجة سماء وردة نهر') == 1\nassert count_prefix('برمجة وردة صديق سيارة وردة سلام علم وردة') == 3\nassert count_prefix('فجر لغة دفتر وردة وردة عربية بحر') == 2\nassert count_prefix('عمل جبل ماء حاسوب وردة طالب نهار') == 1\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": "10d52b1da8535c72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 19\nfor j in range(1, 22, 3):\n total -= j * 4\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 19\nfor j in range(1, 22, 3):\n total -= j * 4\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "7a98f54138f896c1", "answer": "-261\n19", "completion": " الناتج:\n```text\n-261\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('stone music python') == 'python/music/stone'", "assert mirror_words('we desert orange rocket desert we is') == 'is/we/desert/rocket/orange/desert/we'", "assert mirror_words('window data brain signal to an') == 'an/to/signal/brain/data/window'", "assert mirror_words('stone code orange table matrix') == 'matrix/table/orange/code/stone'", "assert mirror_words('it') == 'it'", "assert mirror_words('brain python is data banana') == 'banana/data/is/python/brain'", "assert mirror_words('engine of it matrix go desert is') == 'is/desert/go/matrix/it/of/engine'"], "test_code": "assert mirror_words('stone music python') == 'python/music/stone'\nassert mirror_words('we desert orange rocket desert we is') == 'is/we/desert/rocket/orange/desert/we'\nassert mirror_words('window data brain signal to an') == 'an/to/signal/brain/data/window'\nassert mirror_words('stone code orange table matrix') == 'matrix/table/orange/code/stone'\nassert mirror_words('it') == 'it'\nassert mirror_words('brain python is data banana') == 'banana/data/is/python/brain'\nassert mirror_words('engine of it matrix go desert is') == 'is/desert/go/matrix/it/of/engine'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `mirror_words('stone music python')` يُرجع `'python/music/stone'`.\nالجواب:", "qhash": "09669411e1ff3314"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 46", "tests": ["assert sum_digit_pow(21842) == 17", "assert sum_digit_pow(484780) == 31", "assert sum_digit_pow(123398) == 26", "assert sum_digit_pow(691111) == 19", "assert sum_digit_pow(58412) == 20", "assert sum_digit_pow(930166) == 25", "assert sum_digit_pow(889367) == 41", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(21842) == 17\nassert sum_digit_pow(484780) == 31\nassert sum_digit_pow(123398) == 26\nassert sum_digit_pow(691111) == 19\nassert sum_digit_pow(58412) == 20\nassert sum_digit_pow(930166) == 25\nassert sum_digit_pow(889367) == 41\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 46", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 46\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 46.\nمثال: `sum_digit_pow(21842)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "7f23f07dbf91838e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([-11, 7, 1, 21]) == -11", "assert max_div([-11, -44, -11]) == -11", "assert max_div([1]) == None", "assert max_div([-38, -7, -18, -8, 2, -37]) == None", "assert max_div([22, -46, -7, -2, -19, -14, -43, 36, 42]) == 22", "assert max_div([]) == None"], "test_code": "assert max_div([-11, 7, 1, 21]) == -11\nassert max_div([-11, -44, -11]) == -11\nassert max_div([1]) == None\nassert max_div([-38, -7, -18, -8, 2, -37]) == None\nassert max_div([22, -46, -7, -2, -19, -14, -43, 36, 42]) == 22\nassert max_div([]) == None", "answer": "def max_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([-11, 7, 1, 21])` يُرجع `-11`.\nالجواب:", "qhash": "23235b1121e4d4f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert cycle([4, 43, 18, 27, 36, 39]) == [39, 4, 43, 18, 27, 36]", "assert cycle([11, 42, -7, 40, 23, 36, 32, 0, 25, 39]) == [42, -7, 40, 23, 36, 32, 0, 25, 39, 11]", "assert cycle([-1, 10, 30, 11, 22, 46, 8, 1, -6, 5, 12]) == [11, 22, 46, 8, 1, -6, 5, 12, -1, 10, 30]", "assert cycle([22, 16, 27]) == [27, 22, 16]", "assert cycle([34, 1, 32, 3, 38, 0, 10, 0, 11, -4, 15, 2]) == [0, 10, 0, 11, -4, 15, 2, 34, 1, 32, 3, 38]", "assert cycle([19, 37, -7, 48, 48, 25, 24, 50]) == [25, 24, 50, 19, 37, -7, 48, 48]", "assert cycle([]) == []"], "test_code": "assert cycle([4, 43, 18, 27, 36, 39]) == [39, 4, 43, 18, 27, 36]\nassert cycle([11, 42, -7, 40, 23, 36, 32, 0, 25, 39]) == [42, -7, 40, 23, 36, 32, 0, 25, 39, 11]\nassert cycle([-1, 10, 30, 11, 22, 46, 8, 1, -6, 5, 12]) == [11, 22, 46, 8, 1, -6, 5, 12, -1, 10, 30]\nassert cycle([22, 16, 27]) == [27, 22, 16]\nassert cycle([34, 1, 32, 3, 38, 0, 10, 0, 11, -4, 15, 2]) == [0, 10, 0, 11, -4, 15, 2, 34, 1, 32, 3, 38]\nassert cycle([19, 37, -7, 48, 48, 25, 24, 50]) == [25, 24, 50, 19, 37, -7, 48, 48]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 19 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([4, 43, 18, 27, 36, 39])` يُرجع `[39, 4, 43, 18, 27, 36]`.\nالجواب:", "qhash": "7795dc1136dac8cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('up on to') == 'cx wv bw'", "assert caesar('stone we to matrix') == 'abwvm em bw uibzqf'", "assert caesar('pixel apple A1') == 'xqfmt ixxtm A1'", "assert caesar('by') == 'jg'", "assert caesar('at on') == 'ib wv'", "assert caesar('desert') == 'lmamzb'", "assert caesar('') == ''"], "test_code": "assert caesar('up on to') == 'cx wv bw'\nassert caesar('stone we to matrix') == 'abwvm em bw uibzqf'\nassert caesar('pixel apple A1') == 'xqfmt ixxtm A1'\nassert caesar('by') == 'jg'\nassert caesar('at on') == 'ib wv'\nassert caesar('desert') == 'lmamzb'\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 + (8)) % 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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('up on to')` يُرجع `'cx wv bw'`.\nالجواب:", "qhash": "c058746bf5750e6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'rstu'}", "tests": ["assert freq_of('winter we') == {'r': 1, 's': 0, 't': 1, 'u': 0}", "assert freq_of('desert desert music cloud') == {'r': 2, 's': 3, 't': 2, 'u': 2}", "assert freq_of('of data desert brain table') == {'r': 2, 's': 1, 't': 3, 'u': 0}", "assert freq_of('vector by an orange code') == {'r': 2, 's': 0, 't': 1, 'u': 0}", "assert freq_of('summer up rocket code') == {'r': 2, 's': 1, 't': 1, 'u': 2}", "assert freq_of('camel river matrix go') == {'r': 3, 's': 0, 't': 1, 'u': 0}", "assert freq_of('') == {'r': 0, 's': 0, 't': 0, 'u': 0}"], "test_code": "assert freq_of('winter we') == {'r': 1, 's': 0, 't': 1, 'u': 0}\nassert freq_of('desert desert music cloud') == {'r': 2, 's': 3, 't': 2, 'u': 2}\nassert freq_of('of data desert brain table') == {'r': 2, 's': 1, 't': 3, 'u': 0}\nassert freq_of('vector by an orange code') == {'r': 2, 's': 0, 't': 1, 'u': 0}\nassert freq_of('summer up rocket code') == {'r': 2, 's': 1, 't': 1, 'u': 2}\nassert freq_of('camel river matrix go') == {'r': 3, 's': 0, 't': 1, 'u': 0}\nassert freq_of('') == {'r': 0, 's': 0, 't': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'rstu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'rstu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'r'، 's'، 't'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('winter we')` يجب أن تُرجع `{'r': 1, 's': 0, 't': 1, 'u': 0}`.\nالجواب:", "qhash": "59b220c9169c4019"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15']", "assert label_numbers(14) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14']", "assert label_numbers(2) == ['1', '2']", "assert label_numbers(16) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15', '16']", "assert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15']"], "test_code": "assert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15']\nassert label_numbers(14) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14']\nassert label_numbers(2) == ['1', '2']\nassert label_numbers(16) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15', '16']\nassert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Sun'\n if i % 10 == 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 % 6 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Sun'، وعلى 10 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(15)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', 'Moon', '11', 'Sun', '13', '14', '15']`.\nالجواب:", "qhash": "2f28d3d1eb036cf9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('سعيد', 27), ('نور', 17), ('هشام', 8), ('يوسف', 83)]\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 = [('سعيد', 27), ('نور', 17), ('هشام', 8), ('يوسف', 83)]\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": "61550114f58fd413", "answer": "[('هشام', 8), ('نور', 17), ('سعيد', 27), ('يوسف', 83)]\n['يوسف', 'سعيد']", "completion": " الناتج:\n```text\n[('هشام', 8), ('نور', 17), ('سعيد', 27), ('يوسف', 83)]\n['يوسف', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([90, 81, 22, 36, 37, 88, 8, 70]) == 2", "assert div_not([49, 12]) == 0", "assert div_not([6, -24, -39, -29, 57, 49, 89, 83, 13, 83, 4]) == 0", "assert div_not([60, 69, -20, 84, 18, 26]) == 0", "assert div_not([65, 18, 3, 23, 51, 21, -36, 27]) == 1", "assert div_not([-17, 72, 56, -24, 60, 46, -22]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([90, 81, 22, 36, 37, 88, 8, 70]) == 2\nassert div_not([49, 12]) == 0\nassert div_not([6, -24, -39, -29, 57, 49, 89, 83, 13, 83, 4]) == 0\nassert div_not([60, 69, -20, 84, 18, 26]) == 0\nassert div_not([65, 18, 3, 23, 51, 21, -36, 27]) == 1\nassert div_not([-17, 72, 56, -24, 60, 46, -22]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([90, 81, 22, 36, 37, 88, 8, 70])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d23b279b57a33d37"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue']", "assert game(11) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11']", "assert game(5) == ['1', 'Red', '3', 'Red', '5']", "assert game(10) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red']", "assert game(2) == ['1', 'Red']"], "test_code": "assert game(12) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue']\nassert game(11) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11']\nassert game(5) == ['1', 'Red', '3', 'Red', '5']\nassert game(10) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red']\nassert game(2) == ['1', 'Red']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Red'\n if i % 6 == 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 % 2 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(12)` يُرجع `['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue']`.\nالجواب:", "qhash": "9a0cd8369833889f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(-9))\nprint(h(-9, -10))\nprint(h(h(-10), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(-9))\nprint(h(-9, -10))\nprint(h(h(-10), -9))\n```\nالجواب:", "qhash": "a3fc055d8f2556a9", "answer": "19\n-26\n81", "completion": " الناتج:\n```text\n19\n-26\n81\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_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 how_many_div([37, 59, 12, 54, 64, 63, 73]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([9, 52, 68, 63, 41, 49, -33, -1, 11, -4, 72]) == 0", "assert how_many_div([-29, 49, 61, 69, -26, 24, 8, 87, 35]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([74, 59, -27]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([37, 59, 12, 54, 64, 63, 73]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([9, 52, 68, 63, 41, 49, -33, -1, 11, -4, 72]) == 0\nassert how_many_div([-29, 49, 61, 69, -26, 24, 8, 87, 35]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([74, 59, -27]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_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 how_many_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 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([37, 59, 12, 54, 64, 63, 73])` يُرجع `0`.\nالجواب:", "qhash": "1be300fb56c6ba3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(604608169))\nprint(rec(rec(604608169)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(604608169))\nprint(rec(rec(604608169)))\n```\nالجواب:", "qhash": "0ee14af4c8a9dd50", "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#1", "code": "res = [x * 4 + -10 for x in range(-6, 9) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 4 + -10 for x in range(-6, 9) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "1cd4a7c924a0925d", "answer": "[-26, -14, -2, 10, 22]\n5 -10", "completion": " الناتج:\n```text\n[-26, -14, -2, 10, 22]\n5 -10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [40, 13, 25, 35, 24, 23, 30]\nprint(nums[1:5])\nprint(nums[::2])\nprint(len(nums[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [40, 13, 25, 35, 24, 23, 30]\nprint(nums[1:5])\nprint(nums[::2])\nprint(len(nums[1:5]))\n```\nالجواب:", "qhash": "b0ef992202e7b79e", "answer": "[13, 25, 35, 24]\n[40, 25, 24, 30]\n4", "completion": " الناتج:\n```text\n[13, 25, 35, 24]\n[40, 25, 24, 30]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([84, 11, 20, 49, 22]) == [84, 95, 115, 164, 0]", "assert running_sum([115, 117, 141, 148, 107, 147]) == [115, 0, 141, 0, 107, 0]", "assert running_sum([130, 142, 80, 37, 18, 86, 25, 172, 44, 79]) == [130, 0, 80, 117, 135, 0, 25, 0, 44, 123]", "assert running_sum([148, 24, 149, -5]) == [148, 172, 0, -5]", "assert running_sum([]) == []", "assert running_sum([73, 0, 43, 166, 157, 164, 127, 96, 114, -9]) == [73, 73, 116, 0, 157, 0, 127, 0, 114, 105]", "assert running_sum([]) == []"], "test_code": "assert running_sum([84, 11, 20, 49, 22]) == [84, 95, 115, 164, 0]\nassert running_sum([115, 117, 141, 148, 107, 147]) == [115, 0, 141, 0, 107, 0]\nassert running_sum([130, 142, 80, 37, 18, 86, 25, 172, 44, 79]) == [130, 0, 80, 117, 135, 0, 25, 0, 44, 123]\nassert running_sum([148, 24, 149, -5]) == [148, 172, 0, -5]\nassert running_sum([]) == []\nassert running_sum([73, 0, 43, 166, 157, 164, 127, 96, 114, -9]) == [73, 73, 116, 0, 157, 0, 127, 0, 114, 105]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 174:\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 > 174:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 174 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([84, 11, 20, 49, 22])` يُرجع `[84, 95, 115, 164, 0]`.\nالجواب:", "qhash": "76548e68321d0562"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 3 * x ** 2 + (-5) * x + (1)", "tests": ["assert quad(1) == -1", "assert quad(-12) == 493", "assert quad(10) == 251", "assert quad(-13) == 573", "assert quad(-3) == 43", "assert quad(-3) == 43", "assert quad(-4) == 69", "assert quad(0) == 1"], "test_code": "assert quad(1) == -1\nassert quad(-12) == 493\nassert quad(10) == 251\nassert quad(-13) == 573\nassert quad(-3) == 43\nassert quad(-3) == 43\nassert quad(-4) == 69\nassert quad(0) == 1", "answer": "def quad(x):\n return 3 * x ** 2 + (-5) * x + (1)", "completion": " ```python\ndef quad(x):\n return 3 * x ** 2 + (-5) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 3x² - 5x + 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(1)` يُرجع `-1`.\nالجواب:", "qhash": "0fbdec38dc9c1f8f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([13, 2, 36, 45, 24, 8, 31, 31]) == [31, 13, 2, 36, 45, 24, 8, 31]", "assert rotate_by([-9, -2, 45, 44, 0, 34]) == [-2, 45, 44, 0, 34, -9]", "assert rotate_by([39, 29, -7, 30, 38, 29, 40, 43, 43, 45]) == [43, 43, 45, 39, 29, -7, 30, 38, 29, 40]", "assert rotate_by([29]) == [29]", "assert rotate_by([45, 16, 31, 42, 26, 48, 15, 4, 4, 20]) == [4, 4, 20, 45, 16, 31, 42, 26, 48, 15]", "assert rotate_by([19, 2, 23, 19, 37, 50, 26, 39]) == [39, 19, 2, 23, 19, 37, 50, 26]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([13, 2, 36, 45, 24, 8, 31, 31]) == [31, 13, 2, 36, 45, 24, 8, 31]\nassert rotate_by([-9, -2, 45, 44, 0, 34]) == [-2, 45, 44, 0, 34, -9]\nassert rotate_by([39, 29, -7, 30, 38, 29, 40, 43, 43, 45]) == [43, 43, 45, 39, 29, -7, 30, 38, 29, 40]\nassert rotate_by([29]) == [29]\nassert rotate_by([45, 16, 31, 42, 26, 48, 15, 4, 4, 20]) == [4, 4, 20, 45, 16, 31, 42, 26, 48, 15]\nassert rotate_by([19, 2, 23, 19, 37, 50, 26, 39]) == [39, 19, 2, 23, 19, 37, 50, 26]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 7 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([13, 2, 36, 45, 24, 8, 31, 31])` يُرجع `[31, 13, 2, 36, 45, 24, 8, 31]`.\nالجواب:", "qhash": "f2c714d52059c39c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('up pixel by rocket orange summer data light') == 'light-data-summer-orange-rocket-pixel'", "assert rev_join('stone orange at it stone is desert by') == 'desert-stone-orange-stone'", "assert rev_join('vector go engine') == 'engine-vector'", "assert rev_join('desert') == 'desert'", "assert rev_join('table python brain stone an is') == 'stone-brain-python-table'", "assert rev_join('orange in we it orange') == 'orange-orange'", "assert rev_join('is python go up up planet') == 'planet-python'"], "test_code": "assert rev_join('up pixel by rocket orange summer data light') == 'light-data-summer-orange-rocket-pixel'\nassert rev_join('stone orange at it stone is desert by') == 'desert-stone-orange-stone'\nassert rev_join('vector go engine') == 'engine-vector'\nassert rev_join('desert') == 'desert'\nassert rev_join('table python brain stone an is') == 'stone-brain-python-table'\nassert rev_join('orange in we it orange') == 'orange-orange'\nassert rev_join('is python go up up planet') == 'planet-python'", "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('up pixel by rocket orange summer data light')` يجب أن تُرجع `'light-data-summer-orange-rocket-pixel'`.\nالجواب:", "qhash": "881fdca2cecf51be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(975660606))\nprint(calc(calc(975660606)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(975660606))\nprint(calc(calc(975660606)))\n```\nالجواب:", "qhash": "084675ab3b4f6df4", "answer": "45\n9", "completion": " الناتج:\n```text\n45\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_special([76, 24, 44, 4, 5, 47, 37, 0]) == 1", "assert count_special([-16, 68, 84, 27, -6, 34]) == 2", "assert count_special([17, -38, 34, 14, 48, 81, 44, 49, 77, 38, 34]) == 1", "assert count_special([63, 5, 15, 13, 39, -29, 60, 89, 43]) == 1", "assert count_special([-7]) == 0", "assert count_special([7, 54, 13, 15, 51, -17, 40, 72, -16, -3, 72]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([76, 24, 44, 4, 5, 47, 37, 0]) == 1\nassert count_special([-16, 68, 84, 27, -6, 34]) == 2\nassert count_special([17, -38, 34, 14, 48, 81, 44, 49, 77, 38, 34]) == 1\nassert count_special([63, 5, 15, 13, 39, -29, 60, 89, 43]) == 1\nassert count_special([-7]) == 0\nassert count_special([7, 54, 13, 15, 51, -17, 40, 72, -16, -3, 72]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 9، ثم اكتب الدالة كاملة.\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([76, 24, 44, 4, 5, 47, 37, 0])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "1d699059ef741fd8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(0, 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(0, 2))\n```\nالجواب:", "qhash": "dccf6a8c28d4e6c4", "answer": "0", "completion": " الناتج:\n```text\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([38, 4, 35, 9, 2, 27]) == [38, 42, 77, 0, 2, 29]", "assert acc_reset([69, 38, 54, 54]) == [69, 0, 54, 0]", "assert acc_reset([3, 82]) == [3, 0]", "assert acc_reset([2, 70]) == [2, 72]", "assert acc_reset([34, -5, -10, 20]) == [34, 29, 19, 39]", "assert acc_reset([53, 80]) == [53, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([38, 4, 35, 9, 2, 27]) == [38, 42, 77, 0, 2, 29]\nassert acc_reset([69, 38, 54, 54]) == [69, 0, 54, 0]\nassert acc_reset([3, 82]) == [3, 0]\nassert acc_reset([2, 70]) == [2, 72]\nassert acc_reset([34, -5, -10, 20]) == [34, 29, 19, 39]\nassert acc_reset([53, 80]) == [53, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 82:\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 > 82:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 82 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([38, 4, 35, 9, 2, 27])` يجب أن تُرجع `[38, 42, 77, 0, 2, 29]`.\nالجواب:", "qhash": "d17094889fd39ed9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 11", "tests": ["assert mfact(10) == 10", "assert mfact(10) == 10", "assert mfact(47) == 0", "assert mfact(35) == 0", "assert mfact(6) == 5", "assert mfact(36) == 0", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 10\nassert mfact(10) == 10\nassert mfact(47) == 0\nassert mfact(35) == 0\nassert mfact(6) == 5\nassert mfact(36) == 0\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 11", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(10)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "7b78be90babdb991"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'desert'\nprint(s[-4:])\nprint(len(s))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'desert'\nprint(s[-4:])\nprint(len(s))\nprint(s[::-1])\n```\nالجواب:", "qhash": "d1597978cc1d7a03", "answer": "sert\n6\ntresed", "completion": " الناتج:\n```text\nsert\n6\ntresed\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'عمر': 10, 'مريم': 27, 'زينب': 49, 'يوسف': 6, 'أحمد': 24}\npoints['مريم'] += 12\npoints['هشام'] = 22\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 = {'عمر': 10, 'مريم': 27, 'زينب': 49, 'يوسف': 6, 'أحمد': 24}\npoints['مريم'] += 12\npoints['هشام'] = 22\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": "f240a96771862c8c", "answer": "6\nزينب\n150\n[('يوسف', 6), ('عمر', 10)]", "completion": " الناتج:\n```text\n6\nزينب\n150\n[('يوسف', 6), ('عمر', 10)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 21242\nc = 0\nwhile m > 0:\n m = m // 6\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 21242\nc = 0\nwhile m > 0:\n m = m // 6\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "5ec6a414fc8492a3", "answer": "0 6", "completion": " الناتج:\n```text\n0 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 4 for x in xs if -17 <= x <= 21)", "tests": ["assert select_range([-4, -1, 7, -12]) == [-48, -16, -4, 28]", "assert select_range([-3]) == [-12]", "assert select_range([20, -6, 21, 44, 16, 43, 58, 11, 20, 49]) == [-24, 44, 64, 80, 80, 84]", "assert select_range([3, -11, 24, 50, 35, -7, 18, 20, -30]) == [-44, -28, 12, 72, 80]", "assert select_range([39]) == []", "assert select_range([32, -30, 10, 4, 13, -3, 55, -21, 5, 8]) == [-12, 16, 20, 32, 40, 52]", "assert select_range([-30]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-4, -1, 7, -12]) == [-48, -16, -4, 28]\nassert select_range([-3]) == [-12]\nassert select_range([20, -6, 21, 44, 16, 43, 58, 11, 20, 49]) == [-24, 44, 64, 80, 80, 84]\nassert select_range([3, -11, 24, 50, 35, -7, 18, 20, -30]) == [-44, -28, 12, 72, 80]\nassert select_range([39]) == []\nassert select_range([32, -30, 10, 4, 13, -3, 55, -21, 5, 8]) == [-12, 16, 20, 32, 40, 52]\nassert select_range([-30]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 4 for x in xs if -17 <= x <= 21)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 4 for x in xs if -17 <= x <= 21)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -17 و21 (شاملًا الطرفين) في 4.\nمثال: `select_range([-4, -1, 7, -12])` يجب أن تُرجع `[-48, -16, -4, 28]`.\nالجواب:", "qhash": "b09d3c478e24bcdb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 10\nfor x in range(-1, 15, 1):\n s += x * 2\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 10\nfor x in range(-1, 15, 1):\n s += x * 2\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "c04dd7b3082d3d90", "answer": "218\n14", "completion": " الناتج:\n```text\n218\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 94709\ncount = 0\nwhile x > 11:\n x = x // 6\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 94709\ncount = 0\nwhile x > 11:\n x = x // 6\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "d3dda8e5534c727b", "answer": "2 6", "completion": " الناتج:\n```text\n2 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert sum_powers(6) == 61005", "assert sum_powers(15) == 11496000", "assert sum_powers(14) == 7699125", "assert sum_powers(14) == 7699125", "assert sum_powers(11) == 1909380", "assert sum_powers(1) == 5", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 61005\nassert sum_powers(15) == 11496000\nassert sum_powers(14) == 7699125\nassert sum_powers(14) == 7699125\nassert sum_powers(11) == 1909380\nassert sum_powers(1) == 5\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `61005`.\nالجواب:", "qhash": "de3eadd932512dd9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['desert', 'winter', 'river', 'data', 'vector']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['desert', 'winter', 'river', 'data', 'vector']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3b9ae83417b2afcc", "answer": "['data', 'river', 'desert', 'winter', 'vector']\n['winter', 'vector', 'desert']", "completion": " الناتج:\n```text\n['data', 'river', 'desert', 'winter', 'vector']\n['winter', 'vector', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'banana'\nprint(s.upper())\nprint(s.count('n'))\nprint(s.index('n') + len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'banana'\nprint(s.upper())\nprint(s.count('n'))\nprint(s.index('n') + len(s))\n```\nالجواب:", "qhash": "9044a04a724b1c5f", "answer": "BANANA\n2\n8", "completion": " الناتج:\n```text\nBANANA\n2\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(286) == 10618", "assert multiples_total(155) == 2988", "assert multiples_total(109) == 1558", "assert multiples_total(21) == 63", "assert multiples_total(40) == 218", "assert multiples_total(22) == 63", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(286) == 10618\nassert multiples_total(155) == 2988\nassert multiples_total(109) == 1558\nassert multiples_total(21) == 63\nassert multiples_total(40) == 218\nassert multiples_total(22) == 63\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 % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 13.\nمثال: `multiples_total(286)` يجب أن تُرجع `10618`.\nالجواب:", "qhash": "800912fef506883b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -1 * x ** 2 + (-7) * x + (-8)", "tests": ["assert p(10) == -178", "assert p(-18) == -206", "assert p(-7) == -8", "assert p(-11) == -52", "assert p(-5) == 2", "assert p(10) == -178", "assert p(12) == -236", "assert p(0) == -8"], "test_code": "assert p(10) == -178\nassert p(-18) == -206\nassert p(-7) == -8\nassert p(-11) == -52\nassert p(-5) == 2\nassert p(10) == -178\nassert p(12) == -236\nassert p(0) == -8", "answer": "def p(x):\n return -1 * x ** 2 + (-7) * x + (-8)", "completion": " ```python\ndef p(x):\n return -1 * x ** 2 + (-7) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -1x² - 7x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(10)` يُرجع `-178`.\nالجواب:", "qhash": "c873afdb22860c3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 6) == 1)", "tests": ["assert phi_upto(84) == 28", "assert phi_upto(132) == 44", "assert phi_upto(171) == 57", "assert phi_upto(166) == 55", "assert phi_upto(10) == 3", "assert phi_upto(13) == 5", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(84) == 28\nassert phi_upto(132) == 44\nassert phi_upto(171) == 57\nassert phi_upto(166) == 55\nassert phi_upto(10) == 3\nassert phi_upto(13) == 5\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, 6) == 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, 6) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 6) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(84)` يُرجع `28`.\nالجواب:", "qhash": "58a150a829046025"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('table planet code table code planet to pixel') == 'planet-planet'", "assert rev_join('garden coffee we in at music') == 'coffee-garden'", "assert rev_join('table matrix rocket window code planet') == 'planet-window-rocket-matrix'", "assert rev_join('river an data pixel we') == ''", "assert rev_join('orange') == 'orange'", "assert rev_join('engine brain') == 'engine'", "assert rev_join('light') == ''"], "test_code": "assert rev_join('table planet code table code planet to pixel') == 'planet-planet'\nassert rev_join('garden coffee we in at music') == 'coffee-garden'\nassert rev_join('table matrix rocket window code planet') == 'planet-window-rocket-matrix'\nassert rev_join('river an data pixel we') == ''\nassert rev_join('orange') == 'orange'\nassert rev_join('engine brain') == 'engine'\nassert rev_join('light') == ''", "answer": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `rev_join('table planet code table code planet to pixel')` يُرجع `'planet-planet'`.\nالجواب:", "qhash": "2c86dd0eba6f4ea4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['python', 'banana', 'signal', 'code', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['python', 'banana', 'signal', 'code', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "bf99610ff51c7eb0", "answer": "['code', 'python', 'banana', 'signal', 'matrix']\n['signal', 'python', 'matrix']", "completion": " الناتج:\n```text\n['code', 'python', 'banana', 'signal', 'matrix']\n['signal', 'python', 'matrix']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('طائرة سماء سفينة باب') == 2", "assert starts_count('قمر سلام حاسوب سيارة') == 2", "assert starts_count('علم وردة لغة سيارة') == 1", "assert starts_count('سوق سلام جمل جبل صحراء') == 2", "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('علم وردة لغة سيارة') == 1\nassert starts_count('سوق سلام جمل جبل صحراء') == 2\nassert starts_count('كتاب ماء سفينة طالب نهر معلم سيارة') == 2\nassert starts_count('سيارة علم حصان سيارة حاسوب') == 2\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('طائرة سماء سفينة باب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "c82c9368878e04cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('table light signal') == 'signal/light/table'", "assert words_reversed('by summer') == 'summer'", "assert words_reversed('table engine') == 'engine/table'", "assert words_reversed('river') == 'river'", "assert words_reversed('orange desert by') == 'desert/orange'", "assert words_reversed('music apple coffee on') == 'coffee/apple/music'", "assert words_reversed('desert pixel orange orange garden planet') == 'planet/garden/orange/orange/pixel/desert'"], "test_code": "assert words_reversed('table light signal') == 'signal/light/table'\nassert words_reversed('by summer') == 'summer'\nassert words_reversed('table engine') == 'engine/table'\nassert words_reversed('river') == 'river'\nassert words_reversed('orange desert by') == 'desert/orange'\nassert words_reversed('music apple coffee on') == 'coffee/apple/music'\nassert words_reversed('desert pixel orange orange garden planet') == 'planet/garden/orange/orange/pixel/desert'", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('table light signal')` يُرجع `'signal/light/table'`.\nالجواب:", "qhash": "770e7e13f08be11a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'window'\nprint(s.replace('n', 'X'))\nprint(s.find('n'))\nprint(s.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'window'\nprint(s.replace('n', 'X'))\nprint(s.find('n'))\nprint(s.upper())\n```\nالجواب:", "qhash": "b925152a0109bcbf", "answer": "wiXdow\n2\nWINDOW", "completion": " الناتج:\n```text\nwiXdow\n2\nWINDOW\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert only_div([36, 42, 27, 70, 7, 62, 81]) == 3", "assert only_div([2, 24, 60, 3, 73, 20]) == 0", "assert only_div([-24, 21, 31, -16, 61, 21]) == 0", "assert only_div([4]) == 0", "assert only_div([7, 77]) == 0", "assert only_div([-35, 29, 53, -15, 1, -28, 15, 17]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([36, 42, 27, 70, 7, 62, 81]) == 3\nassert only_div([2, 24, 60, 3, 73, 20]) == 0\nassert only_div([-24, 21, 31, -16, 61, 21]) == 0\nassert only_div([4]) == 0\nassert only_div([7, 77]) == 0\nassert only_div([-35, 29, 53, -15, 1, -28, 15, 17]) == 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 % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([36, 42, 27, 70, 7, 62, 81])` يُرجع `3`.\nالجواب:", "qhash": "413c387a89fa959b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('by cloud of') == 'wt xgjpy ja'", "assert shift_text('table winter summer') == 'ovwgz rdiozm nphhzm'", "assert shift_text('apple river') == 'vkkgz mdqzm'", "assert shift_text('on') == 'ji'", "assert shift_text('go brain we window code') == 'bj wmvdi rz rdiyjr xjyz'", "assert shift_text('camel') == 'xvhzg'", "assert shift_text('') == ''"], "test_code": "assert shift_text('by cloud of') == 'wt xgjpy ja'\nassert shift_text('table winter summer') == 'ovwgz rdiozm nphhzm'\nassert shift_text('apple river') == 'vkkgz mdqzm'\nassert shift_text('on') == 'ji'\nassert shift_text('go brain we window code') == 'bj wmvdi rz rdiyjr xjyz'\nassert shift_text('camel') == 'xvhzg'\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 + (21)) % 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 + (21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('by cloud of')` يجب أن تُرجع `'wt xgjpy ja'`.\nالجواب:", "qhash": "e544e329ebb97a78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate([15, 11, 43, 33, 29, 10, 17]) == [11, 43, 33, 29, 10, 17, 15]", "assert rotate([5]) == [5]", "assert rotate([15, 41, 45, 22, 17, 30, 26, 40, 23]) == [30, 26, 40, 23, 15, 41, 45, 22, 17]", "assert rotate([38, 43, 43, 46]) == [46, 38, 43, 43]", "assert rotate([-4, 9, -8, 33]) == [33, -4, 9, -8]", "assert rotate([16, 46, 46, 46, 30, 0, 14]) == [46, 46, 46, 30, 0, 14, 16]", "assert rotate([]) == []"], "test_code": "assert rotate([15, 11, 43, 33, 29, 10, 17]) == [11, 43, 33, 29, 10, 17, 15]\nassert rotate([5]) == [5]\nassert rotate([15, 41, 45, 22, 17, 30, 26, 40, 23]) == [30, 26, 40, 23, 15, 41, 45, 22, 17]\nassert rotate([38, 43, 43, 46]) == [46, 38, 43, 43]\nassert rotate([-4, 9, -8, 33]) == [33, -4, 9, -8]\nassert rotate([16, 46, 46, 46, 30, 0, 14]) == [46, 46, 46, 30, 0, 14, 16]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 13 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return ____\n```\nمثال: `rotate([15, 11, 43, 33, 29, 10, 17])` يجب أن تُرجع `[11, 43, 33, 29, 10, 17, 15]`.\nالجواب:", "qhash": "3c040b1fd8504d05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "tests": ["assert series(7) == 84", "assert series(12) == 234", "assert series(14) == 315", "assert series(5) == 45", "assert series(7) == 84", "assert series(1) == 3", "assert series(0) == 0"], "test_code": "assert series(7) == 84\nassert series(12) == 234\nassert series(14) == 315\nassert series(5) == 45\nassert series(7) == 84\nassert series(1) == 3\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 1\n return total\n```\n", "buggy": "def series(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 series(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `series(7)` يُرجع `84`.\nالجواب:", "qhash": "498c9395ede83193"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-15, 9, 37, 20, 19, -14, 25, 24]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-15, 9, 37, 20, 19, -14, 25, 24]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "53152f386884ea8d", "answer": "[9, 19, 20, 24, 25, -14, -15, 37]\n[37, 25, 24]", "completion": " الناتج:\n```text\n[9, 19, 20, 24, 25, -14, -15, 37]\n[37, 25, 24]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'winter_data'\nprint(name.capitalize())\nprint(name.replace('d', '0'))\nprint(name.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'winter_data'\nprint(name.capitalize())\nprint(name.replace('d', '0'))\nprint(name.upper())\n```\nالجواب:", "qhash": "a4d690696f746294", "answer": "Winter_data\nwinter_0ata\nWINTER_DATA", "completion": " الناتج:\n```text\nWinter_data\nwinter_0ata\nWINTER_DATA\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'orange_pixel'\nprint(text.index('e') + len(text))\nprint(text[3:4])\nprint(text.count('e'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'orange_pixel'\nprint(text.index('e') + len(text))\nprint(text[3:4])\nprint(text.count('e'))\n```\nالجواب:", "qhash": "e4151626fe47dd5f", "answer": "17\nn\n2", "completion": " الناتج:\n```text\n17\nn\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('قمر قهوة ليل مكتبة علم نور علم صحراء')` يُرجع `0`.\nالجواب:", "qhash": "5144f977c1343074"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 23", "tests": ["assert mfact(11) == 22", "assert mfact(51) == 0", "assert mfact(55) == 0", "assert mfact(52) == 0", "assert mfact(56) == 0", "assert mfact(15) == 12", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 22\nassert mfact(51) == 0\nassert mfact(55) == 0\nassert mfact(52) == 0\nassert mfact(56) == 0\nassert mfact(15) == 12\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 23", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(11)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "2c02ba52889ae053"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert only_div([27, 5, 16, 12, 64, 88, 45]) == 3", "assert only_div([-14, 3, -29, 60, 3, -18]) == 4", "assert only_div([15, -1]) == 1", "assert only_div([-7, 40, 75, 19, -23]) == 1", "assert only_div([33]) == 1", "assert only_div([-16, 43, 7]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([27, 5, 16, 12, 64, 88, 45]) == 3\nassert only_div([-14, 3, -29, 60, 3, -18]) == 4\nassert only_div([15, -1]) == 1\nassert only_div([-7, 40, 75, 19, -23]) == 1\nassert only_div([33]) == 1\nassert only_div([-16, 43, 7]) == 0\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([27, 5, 16, 12, 64, 88, 45])` يُرجع `3`.\nالجواب:", "qhash": "c54140d1956770c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "label_numbers", "reference": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(21) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21']", "assert label_numbers(7) == ['1', '2', '3', 'Fizz', '5', '6', '7']", "assert label_numbers(12) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz']", "assert label_numbers(19) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19']", "assert label_numbers(7) == ['1', '2', '3', 'Fizz', '5', '6', '7']"], "test_code": "assert label_numbers(21) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21']\nassert label_numbers(7) == ['1', '2', '3', 'Fizz', '5', '6', '7']\nassert label_numbers(12) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz']\nassert label_numbers(19) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19']\nassert label_numbers(7) == ['1', '2', '3', 'Fizz', '5', '6', '7']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(21)` يُرجع `['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21']`.\nالجواب:", "qhash": "988f9cac18c98aff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'asu'}", "tests": ["assert freq_of('to we apple falcon') == {'a': 2, 's': 0, 'u': 0}", "assert freq_of('go to summer orange cloud at') == {'a': 2, 's': 1, 'u': 2}", "assert freq_of('music') == {'a': 0, 's': 1, 'u': 1}", "assert freq_of('python signal window river planet') == {'a': 2, 's': 1, 'u': 0}", "assert freq_of('light is matrix') == {'a': 1, 's': 1, 'u': 0}", "assert freq_of('an camel banana') == {'a': 5, 's': 0, 'u': 0}", "assert freq_of('') == {'a': 0, 's': 0, 'u': 0}"], "test_code": "assert freq_of('to we apple falcon') == {'a': 2, 's': 0, 'u': 0}\nassert freq_of('go to summer orange cloud at') == {'a': 2, 's': 1, 'u': 2}\nassert freq_of('music') == {'a': 0, 's': 1, 'u': 1}\nassert freq_of('python signal window river planet') == {'a': 2, 's': 1, 'u': 0}\nassert freq_of('light is matrix') == {'a': 1, 's': 1, 'u': 0}\nassert freq_of('an camel banana') == {'a': 5, 's': 0, 'u': 0}\nassert freq_of('') == {'a': 0, 's': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'asu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'asu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 's'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('to we apple falcon')` يجب أن تُرجع `{'a': 2, 's': 0, 'u': 0}`.\nالجواب:", "qhash": "bdf996352a429847"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 25", "tests": ["assert dig_pow_mod(82736) == 1", "assert dig_pow_mod(526739) == 7", "assert dig_pow_mod(878106) == 20", "assert dig_pow_mod(782512) == 15", "assert dig_pow_mod(269517) == 15", "assert dig_pow_mod(650031) == 20", "assert dig_pow_mod(607259) == 14", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(82736) == 1\nassert dig_pow_mod(526739) == 7\nassert dig_pow_mod(878106) == 20\nassert dig_pow_mod(782512) == 15\nassert dig_pow_mod(269517) == 15\nassert dig_pow_mod(650031) == 20\nassert dig_pow_mod(607259) == 14\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 25", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 25\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 25.\nمثال: `dig_pow_mod(82736)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "ddd93a72f738cf2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(h(-5))\nprint(h(-5, -6))\nprint(h(h(-6), -5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(h(-5))\nprint(h(-5, -6))\nprint(h(h(-6), -5))\n```\nالجواب:", "qhash": "28af75722e9cb184", "answer": "-5\n6\n-6", "completion": " الناتج:\n```text\n-5\n6\n-6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59", "tests": ["assert mfact(6) == 18", "assert mfact(29) == 33", "assert mfact(40) == 49", "assert mfact(5) == 10", "assert mfact(21) == 41", "assert mfact(38) == 44", "assert mfact(0) == 1"], "test_code": "assert mfact(6) == 18\nassert mfact(29) == 33\nassert mfact(40) == 49\nassert mfact(5) == 10\nassert mfact(21) == 41\nassert mfact(38) == 44\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(6)` يُرجع `18`.\nالجواب:", "qhash": "120fd6a08f567f53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-3, 38, 6, 7, 19, 16, 23, -6, 39]\nprint(a[1:8])\nprint(a[::-1])\nprint(len(a[1:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-3, 38, 6, 7, 19, 16, 23, -6, 39]\nprint(a[1:8])\nprint(a[::-1])\nprint(len(a[1:8]))\n```\nالجواب:", "qhash": "ab784f83c9a987a5", "answer": "[38, 6, 7, 19, 16, 23, -6]\n[39, -6, 23, 16, 19, 7, 6, 38, -3]\n7", "completion": " الناتج:\n```text\n[38, 6, 7, 19, 16, 23, -6]\n[39, -6, 23, 16, 19, 7, 6, 38, -3]\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 16 <= x <= 51)", "tests": ["assert filter_range([52, 29, 50, 24, 7, 7]) == [72, 87, 150]", "assert filter_range([]) == []", "assert filter_range([-20, 3, 5, -30, 36, -9, 43, 50, -9]) == [108, 129, 150]", "assert filter_range([51, -12, 0, 1, -21, 36]) == [108, 153]", "assert filter_range([8, -7]) == []", "assert filter_range([21, 58, 12, -25, 56, 42, 48, -27, 8, 15]) == [63, 126, 144]", "assert filter_range([]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([52, 29, 50, 24, 7, 7]) == [72, 87, 150]\nassert filter_range([]) == []\nassert filter_range([-20, 3, 5, -30, 36, -9, 43, 50, -9]) == [108, 129, 150]\nassert filter_range([51, -12, 0, 1, -21, 36]) == [108, 153]\nassert filter_range([8, -7]) == []\nassert filter_range([21, 58, 12, -25, 56, 42, 48, -27, 8, 15]) == [63, 126, 144]\nassert filter_range([]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if 16 <= x <= 51)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if 16 <= x <= 51)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 16 ≤ x ≤ 51، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([52, 29, 50, 24, 7, 7])` يُرجع `[72, 87, 150]`.\nالجواب:", "qhash": "c4a6533888b6b181"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [16, -1, 12, 25, 35, 14]\nprint(items[3:4])\nprint(items[::-2])\nprint(sum(items[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [16, -1, 12, 25, 35, 14]\nprint(items[3:4])\nprint(items[::-2])\nprint(sum(items[3:4]))\n```\nالجواب:", "qhash": "faa036c48c62b20a", "answer": "[25]\n[14, 25, -1]\n25", "completion": " الناتج:\n```text\n[25]\n[14, 25, -1]\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 18\nfor i in range(7, 24, 1):\n s += i * 8\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 18\nfor i in range(7, 24, 1):\n s += i * 8\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "c694e344476cc77a", "answer": "2058\n23", "completion": " الناتج:\n```text\n2058\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'نور'\nprint(len(s))\nprint(s[-1])\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'نور'\nprint(len(s))\nprint(s[-1])\nprint(s[::-1])\n```\nالجواب:", "qhash": "3564f8b3af2fb50f", "answer": "3\nر\nرون", "completion": " الناتج:\n```text\n3\nر\nرون\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=9):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(19))\nprint(h(19, 20))\nprint(h(h(20), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=9):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(19))\nprint(h(19, 20))\nprint(h(h(20), 19))\n```\nالجواب:", "qhash": "612695d2b7a777c9", "answer": "86\n119\n436", "completion": " الناتج:\n```text\n86\n119\n436\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 4 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(9) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9']", "assert fizz(18) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'PingPong', '17', 'Ping']", "assert fizz(1) == ['1']", "assert fizz(9) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9']", "assert fizz(5) == ['1', 'Ping', '3', 'PingPong', '5']"], "test_code": "assert fizz(9) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9']\nassert fizz(18) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'PingPong', '17', 'Ping']\nassert fizz(1) == ['1']\nassert fizz(9) == ['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9']\nassert fizz(5) == ['1', 'Ping', '3', 'PingPong', '5']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 4 == 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 % 2 == 0:\n s += 'Ping'\n if i % 4 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Ping'، وعلى 4 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(9)` يجب أن تُرجع `['1', 'Ping', '3', 'PingPong', '5', 'Ping', '7', 'PingPong', '9']`.\nالجواب:", "qhash": "b1f6cbbee7614882"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 53772\ncount = 0\nwhile m > 12:\n m = m // 2\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 53772\ncount = 0\nwhile m > 12:\n m = m // 2\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "177d6234cd5cb52d", "answer": "6 13", "completion": " الناتج:\n```text\n6 13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[k:] + items[:k]", "tests": ["assert shift_list([27, 8, 4]) == [4, 27, 8]", "assert shift_list([-3, 7, 47]) == [47, -3, 7]", "assert shift_list([37, 43, 38]) == [38, 37, 43]", "assert shift_list([11, -7, 18, 50, 37, 36]) == [36, 11, -7, 18, 50, 37]", "assert shift_list([43, 40, 45, 14, 22, 5, -2, 38, 4]) == [45, 14, 22, 5, -2, 38, 4, 43, 40]", "assert shift_list([47, 21, 35, 4, 37]) == [21, 35, 4, 37, 47]", "assert shift_list([]) == []"], "test_code": "assert shift_list([27, 8, 4]) == [4, 27, 8]\nassert shift_list([-3, 7, 47]) == [47, -3, 7]\nassert shift_list([37, 43, 38]) == [38, 37, 43]\nassert shift_list([11, -7, 18, 50, 37, 36]) == [36, 11, -7, 18, 50, 37]\nassert shift_list([43, 40, 45, 14, 22, 5, -2, 38, 4]) == [45, 14, 22, 5, -2, 38, 4, 43, 40]\nassert shift_list([47, 21, 35, 4, 37]) == [21, 35, 4, 37, 47]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return ____\n```\nمثال: `shift_list([27, 8, 4])` يجب أن تُرجع `[4, 27, 8]`.\nالجواب:", "qhash": "128dd7629b2fe91d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=4):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(g(7))\nprint(g(7, -7))\nprint(g(g(-7), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=4):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(g(7))\nprint(g(7, -7))\nprint(g(g(-7), 7))\n```\nالجواب:", "qhash": "dae2405053b519e4", "answer": "38\n49\n95", "completion": " الناتج:\n```text\n38\n49\n95\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 44)", "tests": ["assert select_range([24, 16, 9, 23, 15, 13, 9, 44]) == [-44, -24, -23, -16, -15]", "assert select_range([27]) == [-27]", "assert select_range([]) == []", "assert select_range([19, 41]) == [-41, -19]", "assert select_range([26, 30, 27]) == [-30, -27, -26]", "assert select_range([-23, 20, 29, -29, -21, 53, -23, -23, -28]) == [-29, -20]", "assert select_range([-25, -11, 7]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([24, 16, 9, 23, 15, 13, 9, 44]) == [-44, -24, -23, -16, -15]\nassert select_range([27]) == [-27]\nassert select_range([]) == []\nassert select_range([19, 41]) == [-41, -19]\nassert select_range([26, 30, 27]) == [-30, -27, -26]\nassert select_range([-23, 20, 29, -29, -21, 53, -23, -23, -28]) == [-29, -20]\nassert select_range([-25, -11, 7]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 44)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 15 ≤ x ≤ 44، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([24, 16, 9, 23, 15, 13, 9, 44])` يُرجع `[-44, -24, -23, -16, -15]`.\nالجواب:", "qhash": "0db9d637dfb1078f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return text.count('ق')", "tests": ["assert letter_count('سماء ميناء معلم طائرة') == 0", "assert letter_count('ميناء') == 0", "assert letter_count('مدرسة') == 0", "assert letter_count('سماء') == 0", "assert letter_count('حصان وردة') == 0", "assert letter_count('قلم باب') == 1", "assert letter_count('معلم علم علم ليل سماء صديق') == 1", "assert letter_count('') == 0"], "test_code": "assert letter_count('سماء ميناء معلم طائرة') == 0\nassert letter_count('ميناء') == 0\nassert letter_count('مدرسة') == 0\nassert letter_count('سماء') == 0\nassert letter_count('حصان وردة') == 0\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('سماء ميناء معلم طائرة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e1e074d5b00f545d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_by([47, 44, 11, 19]) == [44, 11, 19, 47]", "assert rotate_by([29, 34, -2, 42, 14, 12, -7, 36, 43, 5, 5]) == [43, 5, 5, 29, 34, -2, 42, 14, 12, -7, 36]", "assert rotate_by([6, 5, 26, 37, 38, 2, 39, 49]) == [2, 39, 49, 6, 5, 26, 37, 38]", "assert rotate_by([7, 9, 26, 20, 38, 19]) == [20, 38, 19, 7, 9, 26]", "assert rotate_by([32, 37, 42, 34, 3, 28, 5, 20, 26]) == [5, 20, 26, 32, 37, 42, 34, 3, 28]", "assert rotate_by([3]) == [3]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([47, 44, 11, 19]) == [44, 11, 19, 47]\nassert rotate_by([29, 34, -2, 42, 14, 12, -7, 36, 43, 5, 5]) == [43, 5, 5, 29, 34, -2, 42, 14, 12, -7, 36]\nassert rotate_by([6, 5, 26, 37, 38, 2, 39, 49]) == [2, 39, 49, 6, 5, 26, 37, 38]\nassert rotate_by([7, 9, 26, 20, 38, 19]) == [20, 38, 19, 7, 9, 26]\nassert rotate_by([32, 37, 42, 34, 3, 28, 5, 20, 26]) == [5, 20, 26, 32, 37, 42, 34, 3, 28]\nassert rotate_by([3]) == [3]\nassert rotate_by([]) == []", "answer": "def rotate_by(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 rotate_by(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 rotate_by(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return ____\n```\nمثال: `rotate_by([47, 44, 11, 19])` يجب أن تُرجع `[44, 11, 19, 47]`.\nالجواب:", "qhash": "62627e7310a3caf9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 23:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([13, 14, 4, 6, 12]) == [13, 0, 4, 10, 22]", "assert rolling_total([-4, 11, -8, -2, 21, -4, 18, -6]) == [-4, 7, -1, -3, 18, 14, 0, -6]", "assert rolling_total([9, 6, 13, 22, -7, 3, -7, 17]) == [9, 15, 0, 22, 15, 18, 11, 0]", "assert rolling_total([9, -4, 12, -8, 6]) == [9, 5, 17, 9, 15]", "assert rolling_total([-9, -7, 10, 0, 0, -7, 7, 9]) == [-9, -16, -6, -6, -6, -13, -6, 3]", "assert rolling_total([2, 12, -7, 8]) == [2, 14, 7, 15]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([13, 14, 4, 6, 12]) == [13, 0, 4, 10, 22]\nassert rolling_total([-4, 11, -8, -2, 21, -4, 18, -6]) == [-4, 7, -1, -3, 18, 14, 0, -6]\nassert rolling_total([9, 6, 13, 22, -7, 3, -7, 17]) == [9, 15, 0, 22, 15, 18, 11, 0]\nassert rolling_total([9, -4, 12, -8, 6]) == [9, 5, 17, 9, 15]\nassert rolling_total([-9, -7, 10, 0, 0, -7, 7, 9]) == [-9, -16, -6, -6, -6, -13, -6, 3]\nassert rolling_total([2, 12, -7, 8]) == [2, 14, 7, 15]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 23:\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 > 23:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 23 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([13, 14, 4, 6, 12])` يجب أن تُرجع `[13, 0, 4, 10, 22]`.\nالجواب:", "qhash": "4cd53bd2874e6703"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(209) == 3045", "assert total_multiples(113) == 952", "assert total_multiples(258) == 4662", "assert total_multiples(52) == 196", "assert total_multiples(284) == 5740", "assert total_multiples(29) == 70", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(209) == 3045\nassert total_multiples(113) == 952\nassert total_multiples(258) == 4662\nassert total_multiples(52) == 196\nassert total_multiples(284) == 5740\nassert total_multiples(29) == 70\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(209)` يُرجع `3045`.\nالجواب:", "qhash": "f2a74071c12c6bf9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 89) == 1)", "tests": ["assert phi_upto(18) == 18", "assert phi_upto(195) == 193", "assert phi_upto(47) == 47", "assert phi_upto(140) == 139", "assert phi_upto(117) == 116", "assert phi_upto(9) == 9", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(18) == 18\nassert phi_upto(195) == 193\nassert phi_upto(47) == 47\nassert phi_upto(140) == 139\nassert phi_upto(117) == 116\nassert phi_upto(9) == 9\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, 89) == 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, 89) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 89، أي أن القاسم المشترك الأكبر لها مع 89 يساوي 1.\nمثال: `phi_upto(18)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "cfdb89ede07944c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(415010832))\nprint(go(go(415010832)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(415010832))\nprint(go(go(415010832)))\n```\nالجواب:", "qhash": "6de80bd4c544f75b", "answer": "24\n6", "completion": " الناتج:\n```text\n24\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حديقة لغة همل ميناء قلم همل') == 2", "assert count_prefix('همل همل برتقال سوق صحراء') == 2", "assert count_prefix('طائرة حصان لغة تفاحة قهوة همل همل') == 2", "assert count_prefix('عربية همل معلم وردة همل معلم شمس مدينة') == 2", "assert count_prefix('ماء همل جمل حاسوب مدينة طالب همل ميناء') == 2", "assert count_prefix('ماء همل همل قلم') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('حديقة لغة همل ميناء قلم همل') == 2\nassert count_prefix('همل همل برتقال سوق صحراء') == 2\nassert count_prefix('طائرة حصان لغة تفاحة قهوة همل همل') == 2\nassert count_prefix('عربية همل معلم وردة همل معلم شمس مدينة') == 2\nassert count_prefix('ماء همل جمل حاسوب مدينة طالب همل ميناء') == 2\nassert count_prefix('ماء همل همل قلم') == 2\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('حديقة لغة همل ميناء قلم همل')` يُرجع `2`.\nالجواب:", "qhash": "df03d627af2b4b56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(433285737))\nprint(calc(calc(433285737)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(433285737))\nprint(calc(calc(433285737)))\n```\nالجواب:", "qhash": "8b03f84c2c92d06c", "answer": "42\n6", "completion": " الناتج:\n```text\n42\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 5) == 1)", "tests": ["assert coprime_count(68) == 55", "assert coprime_count(40) == 32", "assert coprime_count(168) == 135", "assert coprime_count(174) == 140", "assert coprime_count(109) == 88", "assert coprime_count(191) == 153", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(68) == 55\nassert coprime_count(40) == 32\nassert coprime_count(168) == 135\nassert coprime_count(174) == 140\nassert coprime_count(109) == 88\nassert coprime_count(191) == 153\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, 5) == 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, 5) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 5) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(68)` يُرجع `55`.\nالجواب:", "qhash": "6097321e9a8a8222"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('brain') == 'iyhpu'", "assert cipher('planet of OK') == 'wshula vm OK'", "assert cipher('cloud planet') == 'jsvbk wshula'", "assert cipher('in coffee garden falcon light Hello') == 'pu jvmmll nhyklu mhsjvu spnoa Hlssv'", "assert cipher('light engine') == 'spnoa lunpul'", "assert cipher('of desert brain') == 'vm klzlya iyhpu'", "assert cipher('') == ''"], "test_code": "assert cipher('brain') == 'iyhpu'\nassert cipher('planet of OK') == 'wshula vm OK'\nassert cipher('cloud planet') == 'jsvbk wshula'\nassert cipher('in coffee garden falcon light Hello') == 'pu jvmmll nhyklu mhsjvu spnoa Hlssv'\nassert cipher('light engine') == 'spnoa lunpul'\nassert cipher('of desert brain') == 'vm klzlya iyhpu'\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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('brain')` يجب أن تُرجع `'iyhpu'`.\nالجواب:", "qhash": "9b9e05adec97514f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ق' in w)", "tests": ["assert count_ar('لغة حاسوب معلم حديقة وردة شجرة') == 1", "assert count_ar('صحراء طالب') == 0", "assert count_ar('لغة ليل ميناء سلام صديق نور علم') == 1", "assert count_ar('') == 0", "assert count_ar('ميناء علم مدرسة') == 0", "assert count_ar('باب بحر علم') == 0", "assert count_ar('نهار برتقال مدينة وردة') == 1", "assert count_ar('') == 0"], "test_code": "assert count_ar('لغة حاسوب معلم حديقة وردة شجرة') == 1\nassert count_ar('صحراء طالب') == 0\nassert count_ar('لغة ليل ميناء سلام صديق نور علم') == 1\nassert count_ar('') == 0\nassert count_ar('ميناء علم مدرسة') == 0\nassert count_ar('باب بحر علم') == 0\nassert count_ar('نهار برتقال مدينة وردة') == 1\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('لغة حاسوب معلم حديقة وردة شجرة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "89698324eff583c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'gh'}", "tests": ["assert char_counts('light river by falcon brain in') == {'g': 1, 'h': 1}", "assert char_counts('in') == {'g': 0, 'h': 0}", "assert char_counts('at of camel') == {'g': 0, 'h': 0}", "assert char_counts('river brain rocket engine') == {'g': 1, 'h': 0}", "assert char_counts('go') == {'g': 1, 'h': 0}", "assert char_counts('it') == {'g': 0, 'h': 0}", "assert char_counts('') == {'g': 0, 'h': 0}"], "test_code": "assert char_counts('light river by falcon brain in') == {'g': 1, 'h': 1}\nassert char_counts('in') == {'g': 0, 'h': 0}\nassert char_counts('at of camel') == {'g': 0, 'h': 0}\nassert char_counts('river brain rocket engine') == {'g': 1, 'h': 0}\nassert char_counts('go') == {'g': 1, 'h': 0}\nassert char_counts('it') == {'g': 0, 'h': 0}\nassert char_counts('') == {'g': 0, 'h': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'gh'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'gh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'h' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('light river by falcon brain in')` يجب أن تُرجع `{'g': 1, 'h': 1}`.\nالجواب:", "qhash": "3e6aaf816d1652b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 42) == 1)", "tests": ["assert coprimes(69) == 20", "assert coprimes(124) == 35", "assert coprimes(109) == 32", "assert coprimes(172) == 49", "assert coprimes(65) == 19", "assert coprimes(138) == 39", "assert coprimes(1) == 1"], "test_code": "assert coprimes(69) == 20\nassert coprimes(124) == 35\nassert coprimes(109) == 32\nassert coprimes(172) == 49\nassert coprimes(65) == 19\nassert coprimes(138) == 39\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, 42) == 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, 42) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 42، أي أن القاسم المشترك الأكبر لها مع 42 يساوي 1.\nمثال: `coprimes(69)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "e11700f66fbfb752"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'pixel'\nprint(name.capitalize())\nprint(len(name))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'pixel'\nprint(name.capitalize())\nprint(len(name))\nprint(name[::-1])\n```\nالجواب:", "qhash": "1f79cb0392a024ab", "answer": "Pixel\n5\nlexip", "completion": " الناتج:\n```text\nPixel\n5\nlexip\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('زينب', 4), ('منى', 55), ('راشد', 77), ('حسن', 44)]\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 = [('زينب', 4), ('منى', 55), ('راشد', 77), ('حسن', 44)]\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": "87b6256b65de3066", "answer": "[('زينب', 4), ('حسن', 44), ('منى', 55), ('راشد', 77)]\n['راشد', 'منى']", "completion": " الناتج:\n```text\n[('زينب', 4), ('حسن', 44), ('منى', 55), ('راشد', 77)]\n['راشد', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total", "tests": ["assert sum_terms(6) == 13650", "assert sum_terms(2) == 102", "assert sum_terms(13) == 535626", "assert sum_terms(6) == 13650", "assert sum_terms(6) == 13650", "assert sum_terms(1) == 6", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(6) == 13650\nassert sum_terms(2) == 102\nassert sum_terms(13) == 535626\nassert sum_terms(6) == 13650\nassert sum_terms(6) == 13650\nassert sum_terms(1) == 6\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(6)` يُرجع `13650`.\nالجواب:", "qhash": "8a9c0e459d460d3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -1 + -9 for x in range(-6, 2) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -1 + -9 for x in range(-6, 2) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "28875b1bd36b8c4a", "answer": "[-4, -6, -8, -10]\n4 -28", "completion": " الناتج:\n```text\n[-4, -6, -8, -10]\n4 -28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -8 * x ** 2 + (5) * x + (3)", "tests": ["assert evaluate(8) == -469", "assert evaluate(-11) == -1020", "assert evaluate(4) == -105", "assert evaluate(8) == -469", "assert evaluate(-16) == -2125", "assert evaluate(-11) == -1020", "assert evaluate(-4) == -145", "assert evaluate(0) == 3"], "test_code": "assert evaluate(8) == -469\nassert evaluate(-11) == -1020\nassert evaluate(4) == -105\nassert evaluate(8) == -469\nassert evaluate(-16) == -2125\nassert evaluate(-11) == -1020\nassert evaluate(-4) == -145\nassert evaluate(0) == 3", "answer": "def evaluate(x):\n return -8 * x ** 2 + (5) * x + (3)", "completion": " ```python\ndef evaluate(x):\n return -8 * x ** 2 + (5) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -8x² + 5x + 3 عند العدد الصحيح x.\nمثال: `evaluate(8)` يجب أن تُرجع `-469`.\nالجواب:", "qhash": "12e633669256ccf0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "tests": ["assert sum_powers(5) == 900", "assert sum_powers(5) == 900", "assert sum_powers(11) == 17424", "assert sum_powers(1) == 4", "assert sum_powers(5) == 900", "assert sum_powers(1) == 4", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 900\nassert sum_powers(5) == 900\nassert sum_powers(11) == 17424\nassert sum_powers(1) == 4\nassert sum_powers(5) == 900\nassert sum_powers(1) == 4\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 4 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(5)` يُرجع `900`.\nالجواب:", "qhash": "439eb7219a81b746"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([19, 49, 55, 23, 51, 4, 19, 59]) == [19, 68, 0, 23, 74, 78, 97, 0]", "assert running_sum([39, 71, 99, 31, 77, 107, 23]) == [39, 110, 0, 31, 108, 0, 23]", "assert running_sum([102, 74, 112]) == [102, 0, 112]", "assert running_sum([110, 47, 72, 18, 15, 31, 79, -9]) == [110, 0, 72, 90, 105, 0, 79, 70]", "assert running_sum([2, 74, 4]) == [2, 76, 80]", "assert running_sum([103, 4, -8, 43, 64, 84, 101]) == [103, 107, 99, 0, 64, 0, 101]", "assert running_sum([]) == []"], "test_code": "assert running_sum([19, 49, 55, 23, 51, 4, 19, 59]) == [19, 68, 0, 23, 74, 78, 97, 0]\nassert running_sum([39, 71, 99, 31, 77, 107, 23]) == [39, 110, 0, 31, 108, 0, 23]\nassert running_sum([102, 74, 112]) == [102, 0, 112]\nassert running_sum([110, 47, 72, 18, 15, 31, 79, -9]) == [110, 0, 72, 90, 105, 0, 79, 70]\nassert running_sum([2, 74, 4]) == [2, 76, 80]\nassert running_sum([103, 4, -8, 43, 64, 84, 101]) == [103, 107, 99, 0, 64, 0, 101]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\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 > 115:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 115 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([19, 49, 55, 23, 51, 4, 19, 59])` يُرجع `[19, 68, 0, 23, 74, 78, 97, 0]`.\nالجواب:", "qhash": "8fc369e784d9350a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 34", "tests": ["assert digit_power(25450) == 16", "assert digit_power(791549) == 19", "assert digit_power(504204) == 23", "assert digit_power(856158) == 29", "assert digit_power(135022) == 33", "assert digit_power(567933) == 5", "assert digit_power(779300) == 14", "assert digit_power(0) == 0"], "test_code": "assert digit_power(25450) == 16\nassert digit_power(791549) == 19\nassert digit_power(504204) == 23\nassert digit_power(856158) == 29\nassert digit_power(135022) == 33\nassert digit_power(567933) == 5\nassert digit_power(779300) == 14\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 34", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 34\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 34.\nمثال: `digit_power(25450)` يجب أن تُرجع `16`.\nالجواب:", "qhash": "f7901ccabb7bd0f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -6 * x ** 2 + (3) * x + (4)", "tests": ["assert evaluate(10) == -566", "assert evaluate(2) == -14", "assert evaluate(-6) == -230", "assert evaluate(-7) == -311", "assert evaluate(-4) == -104", "assert evaluate(-9) == -509", "assert evaluate(2) == -14", "assert evaluate(0) == 4"], "test_code": "assert evaluate(10) == -566\nassert evaluate(2) == -14\nassert evaluate(-6) == -230\nassert evaluate(-7) == -311\nassert evaluate(-4) == -104\nassert evaluate(-9) == -509\nassert evaluate(2) == -14\nassert evaluate(0) == 4", "answer": "def evaluate(x):\n return -6 * x ** 2 + (3) * x + (4)", "completion": " ```python\ndef evaluate(x):\n return -6 * x ** 2 + (3) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -6x² + 3x + 4 عند العدد الصحيح x.\nمثال: `evaluate(10)` يجب أن تُرجع `-566`.\nالجواب:", "qhash": "18d66938d8e9efc8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -2 * x ** 2 + (9) * x + (-7)", "tests": ["assert poly(4) == -3", "assert poly(19) == -558", "assert poly(-5) == -102", "assert poly(0) == -7", "assert poly(17) == -432", "assert poly(1) == 0", "assert poly(7) == -42", "assert poly(0) == -7"], "test_code": "assert poly(4) == -3\nassert poly(19) == -558\nassert poly(-5) == -102\nassert poly(0) == -7\nassert poly(17) == -432\nassert poly(1) == 0\nassert poly(7) == -42\nassert poly(0) == -7", "answer": "def poly(x):\n return -2 * x ** 2 + (9) * x + (-7)", "completion": " ```python\ndef poly(x):\n return -2 * x ** 2 + (9) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -2x² + 9x - 7 عند العدد الصحيح x.\nمثال: `poly(4)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "3d0cb9b8128d8532"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_list([35, 31, 22]) == [22, 35, 31]", "assert rotate_list([7, 49, 43, 45, 0]) == [7, 49, 43, 45, 0]", "assert rotate_list([12, 12, 49, 9, 13]) == [12, 12, 49, 9, 13]", "assert rotate_list([22, 48, 3, 41, 11]) == [22, 48, 3, 41, 11]", "assert rotate_list([48, 27, 29]) == [29, 48, 27]", "assert rotate_list([37, 26, 47, -7, 40, 6, 44, 13]) == [40, 6, 44, 13, 37, 26, 47, -7]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([35, 31, 22]) == [22, 35, 31]\nassert rotate_list([7, 49, 43, 45, 0]) == [7, 49, 43, 45, 0]\nassert rotate_list([12, 12, 49, 9, 13]) == [12, 12, 49, 9, 13]\nassert rotate_list([22, 48, 3, 41, 11]) == [22, 48, 3, 41, 11]\nassert rotate_list([48, 27, 29]) == [29, 48, 27]\nassert rotate_list([37, 26, 47, -7, 40, 6, 44, 13]) == [40, 6, 44, 13, 37, 26, 47, -7]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([35, 31, 22])` يُرجع `[22, 35, 31]`.\nالجواب:", "qhash": "ce5f7a6421a36d29"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 31", "tests": ["assert rec_prod(12) == 14", "assert rec_prod(16) == 5", "assert rec_prod(51) == 0", "assert rec_prod(8) == 12", "assert rec_prod(15) == 28", "assert rec_prod(8) == 12", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 14\nassert rec_prod(16) == 5\nassert rec_prod(51) == 0\nassert rec_prod(8) == 12\nassert rec_prod(15) == 28\nassert rec_prod(8) == 12\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 31", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(12)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "6d40041bb09f430d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([31, 43, 5, 17, 36, 26, -24, 15]) == 36", "assert max_multiple([-3, -9, -9]) == -3", "assert max_multiple([1]) == None", "assert max_multiple([23, -36, 35]) == -36", "assert max_multiple([1, 34, -33, 10]) == -33", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([31, 43, 5, 17, 36, 26, -24, 15]) == 36\nassert max_multiple([-3, -9, -9]) == -3\nassert max_multiple([1]) == None\nassert max_multiple([23, -36, 35]) == -36\nassert max_multiple([1, 34, -33, 10]) == -33\nassert max_multiple([]) == None", "answer": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 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 % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_multiple([31, 43, 5, 17, 36, 26, -24, 15])` يجب أن تُرجع `36`.\nالجواب:", "qhash": "4bf007f99b6b5001"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ف'):\n count += 1\n return count", "tests": ["assert count_initial('برتقال جبل') == 0", "assert count_initial('علم علم فجر فجر سفينة برمجة') == 2", "assert count_initial('مكتبة قلم فجر برتقال') == 1", "assert count_initial('صحراء حاسوب صديق فجر سماء فجر صديق جمل') == 2", "assert count_initial('قمر جبل فجر فجر قلم سوق') == 2", "assert count_initial('معلم حصان فجر ماء عربية شجرة') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('برتقال جبل') == 0\nassert count_initial('علم علم فجر فجر سفينة برمجة') == 2\nassert count_initial('مكتبة قلم فجر برتقال') == 1\nassert count_initial('صحراء حاسوب صديق فجر سماء فجر صديق جمل') == 2\nassert count_initial('قمر جبل فجر فجر قلم سوق') == 2\nassert count_initial('معلم حصان فجر ماء عربية شجرة') == 1\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ف'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text:\n if w.startswith('ف'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('برتقال جبل')` يُرجع `0`.\nالجواب:", "qhash": "64bb0598365e5e9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "tests": ["assert sum_terms(7) == 3136", "assert sum_terms(5) == 900", "assert sum_terms(12) == 24336", "assert sum_terms(10) == 12100", "assert sum_terms(6) == 1764", "assert sum_terms(1) == 4", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 3136\nassert sum_terms(5) == 900\nassert sum_terms(12) == 24336\nassert sum_terms(10) == 12100\nassert sum_terms(6) == 1764\nassert sum_terms(1) == 4\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 3\n return total\n```\nمثال: `sum_terms(7)` يجب أن تُرجع `3136`.\nالجواب:", "qhash": "eeb514a5c587ebcb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bci'}", "tests": ["assert letter_stats('banana code camel python') == {'b': 1, 'c': 2, 'i': 0}", "assert letter_stats('up light to brain orange planet') == {'b': 1, 'c': 0, 'i': 2}", "assert letter_stats('garden') == {'b': 0, 'c': 0, 'i': 0}", "assert letter_stats('go in desert by banana') == {'b': 2, 'c': 0, 'i': 1}", "assert letter_stats('winter planet on') == {'b': 0, 'c': 0, 'i': 1}", "assert letter_stats('it data coffee') == {'b': 0, 'c': 1, 'i': 1}", "assert letter_stats('') == {'b': 0, 'c': 0, 'i': 0}"], "test_code": "assert letter_stats('banana code camel python') == {'b': 1, 'c': 2, 'i': 0}\nassert letter_stats('up light to brain orange planet') == {'b': 1, 'c': 0, 'i': 2}\nassert letter_stats('garden') == {'b': 0, 'c': 0, 'i': 0}\nassert letter_stats('go in desert by banana') == {'b': 2, 'c': 0, 'i': 1}\nassert letter_stats('winter planet on') == {'b': 0, 'c': 0, 'i': 1}\nassert letter_stats('it data coffee') == {'b': 0, 'c': 1, 'i': 1}\nassert letter_stats('') == {'b': 0, 'c': 0, 'i': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bci'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bci'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'i' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('banana code camel python')` يُرجع `{'b': 1, 'c': 2, 'i': 0}`.\nالجواب:", "qhash": "72d141dcb947de27"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('س')", "tests": ["assert count_letter('مدرسة برتقال شجرة ليل') == 1", "assert count_letter('جمل عمل حصان') == 0", "assert count_letter('مدرسة مطر') == 1", "assert count_letter('علم خبز ميناء شمس نهر طالب') == 1", "assert count_letter('حصان') == 0", "assert count_letter('حاسوب نهار رمل دفتر مطر طالب شمس') == 2", "assert count_letter('ليل') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('مدرسة برتقال شجرة ليل') == 1\nassert count_letter('جمل عمل حصان') == 0\nassert count_letter('مدرسة مطر') == 1\nassert count_letter('علم خبز ميناء شمس نهر طالب') == 1\nassert count_letter('حصان') == 0\nassert count_letter('حاسوب نهار رمل دفتر مطر طالب شمس') == 2\nassert count_letter('ليل') == 0\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('مدرسة برتقال شجرة ليل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "2816b7ef395b7d28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(120) == 1679", "assert sum_multiples(94) == 1050", "assert sum_multiples(147) == 2603", "assert sum_multiples(76) == 633", "assert sum_multiples(117) == 1679", "assert sum_multiples(199) == 4851", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(120) == 1679\nassert sum_multiples(94) == 1050\nassert sum_multiples(147) == 2603\nassert sum_multiples(76) == 633\nassert sum_multiples(117) == 1679\nassert sum_multiples(199) == 4851\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 % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(120)` يُرجع `1679`.\nالجواب:", "qhash": "7dd1efc5b00ba16e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [-3, 26, 15, 4, 23, 12, 9, -3]\nprint(xs[1:4])\nprint(xs[::3])\nprint(sum(xs[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [-3, 26, 15, 4, 23, 12, 9, -3]\nprint(xs[1:4])\nprint(xs[::3])\nprint(sum(xs[1:4]))\n```\nالجواب:", "qhash": "3fe93fff98b4fc19", "answer": "[26, 15, 4]\n[-3, 4, 9]\n45", "completion": " الناتج:\n```text\n[26, 15, 4]\n[-3, 4, 9]\n45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('code rocket python brain') == 'brain_python_rocket_code'", "assert reverse_words('in pixel cloud engine orange camel of') == 'camel_orange_engine_cloud_pixel'", "assert reverse_words('winter apple coffee') == 'coffee_apple_winter'", "assert reverse_words('to camel summer data planet') == 'planet_data_summer_camel'", "assert reverse_words('stone garden we to orange') == 'orange_garden_stone'", "assert reverse_words('coffee table code code desert orange desert') == 'desert_orange_desert_code_code_table_coffee'", "assert reverse_words('orange data stone') == 'stone_data_orange'"], "test_code": "assert reverse_words('code rocket python brain') == 'brain_python_rocket_code'\nassert reverse_words('in pixel cloud engine orange camel of') == 'camel_orange_engine_cloud_pixel'\nassert reverse_words('winter apple coffee') == 'coffee_apple_winter'\nassert reverse_words('to camel summer data planet') == 'planet_data_summer_camel'\nassert reverse_words('stone garden we to orange') == 'orange_garden_stone'\nassert reverse_words('coffee table code code desert orange desert') == 'desert_orange_desert_code_code_table_coffee'\nassert reverse_words('orange data stone') == 'stone_data_orange'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `reverse_words('code rocket python brain')` يُرجع `'brain_python_rocket_code'`.\nالجواب:", "qhash": "28cc0595fd840232"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "3b4b236b5f048d5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)", "tests": ["assert multiples_total(161) == 4293", "assert multiples_total(267) == 11748", "assert multiples_total(112) == 2109", "assert multiples_total(87) == 1218", "assert multiples_total(119) == 2340", "assert multiples_total(280) == 13113", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(161) == 4293\nassert multiples_total(267) == 11748\nassert multiples_total(112) == 2109\nassert multiples_total(87) == 1218\nassert multiples_total(119) == 2340\nassert multiples_total(280) == 13113\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 % 6 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 6، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(161)` يُرجع `4293`.\nالجواب:", "qhash": "40849789fea245ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 2 for x in xs if -8 <= x <= 32)", "tests": ["assert between_times([32, -2, 14, 3, -2, -5, 17, 30]) == [-10, -4, -4, 6, 28, 34, 60, 64]", "assert between_times([]) == []", "assert between_times([46]) == []", "assert between_times([10, 11, 10, 58, -7, 29, 34, 49]) == [-14, 20, 20, 22, 58]", "assert between_times([59, 20, 8, -12, 58, 15]) == [16, 30, 40]", "assert between_times([-23]) == []", "assert between_times([28, -7, -24, 20, 60, 31, -17, 38, -1]) == [-14, -2, 40, 56, 62]", "assert between_times([]) == []"], "test_code": "assert between_times([32, -2, 14, 3, -2, -5, 17, 30]) == [-10, -4, -4, 6, 28, 34, 60, 64]\nassert between_times([]) == []\nassert between_times([46]) == []\nassert between_times([10, 11, 10, 58, -7, 29, 34, 49]) == [-14, 20, 20, 22, 58]\nassert between_times([59, 20, 8, -12, 58, 15]) == [16, 30, 40]\nassert between_times([-23]) == []\nassert between_times([28, -7, -24, 20, 60, 31, -17, 38, -1]) == [-14, -2, 40, 56, 62]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 2 for x in xs if -8 <= x <= 32)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 2 for x in xs if -8 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -8 و32 (شاملًا الطرفين) في 2.\nمثال: `between_times([32, -2, 14, 3, -2, -5, 17, 30])` يجب أن تُرجع `[-10, -4, -4, 6, 28, 34, 60, 64]`.\nالجواب:", "qhash": "1f5e5625aeeab102"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'hnos'}", "tests": ["assert char_freq('we') == {'h': 0, 'n': 0, 'o': 0, 's': 0}", "assert char_freq('at') == {'h': 0, 'n': 0, 'o': 0, 's': 0}", "assert char_freq('it it rocket camel') == {'h': 0, 'n': 0, 'o': 1, 's': 0}", "assert char_freq('music is river code') == {'h': 0, 'n': 0, 'o': 1, 's': 2}", "assert char_freq('cloud') == {'h': 0, 'n': 0, 'o': 1, 's': 0}", "assert char_freq('light rocket code in apple of') == {'h': 1, 'n': 1, 'o': 3, 's': 0}", "assert char_freq('') == {'h': 0, 'n': 0, 'o': 0, 's': 0}"], "test_code": "assert char_freq('we') == {'h': 0, 'n': 0, 'o': 0, 's': 0}\nassert char_freq('at') == {'h': 0, 'n': 0, 'o': 0, 's': 0}\nassert char_freq('it it rocket camel') == {'h': 0, 'n': 0, 'o': 1, 's': 0}\nassert char_freq('music is river code') == {'h': 0, 'n': 0, 'o': 1, 's': 2}\nassert char_freq('cloud') == {'h': 0, 'n': 0, 'o': 1, 's': 0}\nassert char_freq('light rocket code in apple of') == {'h': 1, 'n': 1, 'o': 3, 's': 0}\nassert char_freq('') == {'h': 0, 'n': 0, 'o': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'hnos'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'hnos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'h'، 'n'، 'o'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('we')` يُرجع `{'h': 0, 'n': 0, 'o': 0, 's': 0}`.\nالجواب:", "qhash": "dbf5948bce905ee1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bil'}", "tests": ["assert letter_stats('desert on') == {'b': 0, 'i': 0, 'l': 0}", "assert letter_stats('garden stone a cloud') == {'b': 0, 'i': 0, 'l': 1}", "assert letter_stats('camel is music matrix python winter') == {'b': 0, 'i': 4, 'l': 1}", "assert letter_stats('matrix') == {'b': 0, 'i': 1, 'l': 0}", "assert letter_stats('coffee window music') == {'b': 0, 'i': 2, 'l': 0}", "assert letter_stats('go a rocket engine to') == {'b': 0, 'i': 1, 'l': 0}", "assert letter_stats('') == {'b': 0, 'i': 0, 'l': 0}"], "test_code": "assert letter_stats('desert on') == {'b': 0, 'i': 0, 'l': 0}\nassert letter_stats('garden stone a cloud') == {'b': 0, 'i': 0, 'l': 1}\nassert letter_stats('camel is music matrix python winter') == {'b': 0, 'i': 4, 'l': 1}\nassert letter_stats('matrix') == {'b': 0, 'i': 1, 'l': 0}\nassert letter_stats('coffee window music') == {'b': 0, 'i': 2, 'l': 0}\nassert letter_stats('go a rocket engine to') == {'b': 0, 'i': 1, 'l': 0}\nassert letter_stats('') == {'b': 0, 'i': 0, 'l': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bil'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bil'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'i'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('desert on')` يُرجع `{'b': 0, 'i': 0, 'l': 0}`.\nالجواب:", "qhash": "a9f10233f86c5f45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 237\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 = 237\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": "27b4b7be617596ca", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 89", "tests": ["assert multi_fact(10) == 13", "assert multi_fact(27) == 22", "assert multi_fact(39) == 55", "assert multi_fact(57) == 37", "assert multi_fact(3) == 3", "assert multi_fact(56) == 17", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(10) == 13\nassert multi_fact(27) == 22\nassert multi_fact(39) == 55\nassert multi_fact(57) == 37\nassert multi_fact(3) == 3\nassert multi_fact(56) == 17\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 89", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(10)` يجب أن تُرجع `13`.\nالجواب:", "qhash": "f8c0346790d123fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 79", "tests": ["assert dig_pow_mod(46698) == 78", "assert dig_pow_mod(98687) == 21", "assert dig_pow_mod(595392) == 5", "assert dig_pow_mod(50857) == 78", "assert dig_pow_mod(273673) == 16", "assert dig_pow_mod(757574) == 0", "assert dig_pow_mod(495053) == 43", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(46698) == 78\nassert dig_pow_mod(98687) == 21\nassert dig_pow_mod(595392) == 5\nassert dig_pow_mod(50857) == 78\nassert dig_pow_mod(273673) == 16\nassert dig_pow_mod(757574) == 0\nassert dig_pow_mod(495053) == 43\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 79", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 79.\nللتوضيح: الاستدعاء `dig_pow_mod(46698)` يُرجع `78`.\nالجواب:", "qhash": "63763cce1610b6f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'شجرة'\nprint(len(w))\nprint(w.split())\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'شجرة'\nprint(len(w))\nprint(w.split())\nprint(w[0])\n```\nالجواب:", "qhash": "6292d56e75e3d883", "answer": "4\n['شجرة']\nش", "completion": " الناتج:\n```text\n4\n['شجرة']\nش\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(12))\nprint(compute(12, 15))\nprint(compute(compute(15), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=7):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(12))\nprint(compute(12, 15))\nprint(compute(compute(15), 12))\n```\nالجواب:", "qhash": "90a2285cd7ef0588", "answer": "-67\n-63\n-142", "completion": " الناتج:\n```text\n-67\n-63\n-142\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 31)", "tests": ["assert in_range_scaled([14, 40, 31, 24, 9, 14, 35, 0, 31, 3]) == [-155, -155, -120, -70, -70, -45]", "assert in_range_scaled([-12, 0, 26]) == [-130]", "assert in_range_scaled([37, 34, 28, -29, -28, -20, -10, -3, 19, 11]) == [-140, -95, -55]", "assert in_range_scaled([13, 14, 47]) == [-70, -65]", "assert in_range_scaled([44, -7, 31, 28, 47, -6, -14]) == [-155, -140]", "assert in_range_scaled([-9, 53, -20, -13, -7, 32, 41, 31, 56, 46]) == [-155]", "assert in_range_scaled([-26, 54, 29, -2, 19]) == [-145, -95]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([14, 40, 31, 24, 9, 14, 35, 0, 31, 3]) == [-155, -155, -120, -70, -70, -45]\nassert in_range_scaled([-12, 0, 26]) == [-130]\nassert in_range_scaled([37, 34, 28, -29, -28, -20, -10, -3, 19, 11]) == [-140, -95, -55]\nassert in_range_scaled([13, 14, 47]) == [-70, -65]\nassert in_range_scaled([44, -7, 31, 28, 47, -6, -14]) == [-155, -140]\nassert in_range_scaled([-9, 53, -20, -13, -7, 32, 41, 31, 56, 46]) == [-155]\nassert in_range_scaled([-26, 54, 29, -2, 19]) == [-145, -95]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 31)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -5 for x in xs if 5 <= x <= 31)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 5 و31 (شاملًا الطرفين) في -5.\nمثال: `in_range_scaled([14, 40, 31, 24, 9, 14, 35, 0, 31, 3])` يجب أن تُرجع `[-155, -155, -120, -70, -70, -45]`.\nالجواب:", "qhash": "3821e5c00c9ac0f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 0\nfor n in range(6, 11, 3):\n result += n * 1\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 0\nfor n in range(6, 11, 3):\n result += n * 1\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "9516572c6e60569e", "answer": "15\n9", "completion": " الناتج:\n```text\n15\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'emru'}", "tests": ["assert freq_of('window banana vector we') == {'e': 2, 'm': 0, 'r': 1, 'u': 0}", "assert freq_of('window apple engine a it an') == {'e': 3, 'm': 0, 'r': 0, 'u': 0}", "assert freq_of('to window apple vector python a') == {'e': 2, 'm': 0, 'r': 1, 'u': 0}", "assert freq_of('brain music engine in we signal') == {'e': 3, 'm': 1, 'r': 1, 'u': 1}", "assert freq_of('it vector coffee is') == {'e': 3, 'm': 0, 'r': 1, 'u': 0}", "assert freq_of('pixel') == {'e': 1, 'm': 0, 'r': 0, 'u': 0}", "assert freq_of('') == {'e': 0, 'm': 0, 'r': 0, 'u': 0}"], "test_code": "assert freq_of('window banana vector we') == {'e': 2, 'm': 0, 'r': 1, 'u': 0}\nassert freq_of('window apple engine a it an') == {'e': 3, 'm': 0, 'r': 0, 'u': 0}\nassert freq_of('to window apple vector python a') == {'e': 2, 'm': 0, 'r': 1, 'u': 0}\nassert freq_of('brain music engine in we signal') == {'e': 3, 'm': 1, 'r': 1, 'u': 1}\nassert freq_of('it vector coffee is') == {'e': 3, 'm': 0, 'r': 1, 'u': 0}\nassert freq_of('pixel') == {'e': 1, 'm': 0, 'r': 0, 'u': 0}\nassert freq_of('') == {'e': 0, 'm': 0, 'r': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'emru'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'emru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'm'، 'r'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('window banana vector we')` يُرجع `{'e': 2, 'm': 0, 'r': 1, 'u': 0}`.\nالجواب:", "qhash": "0530f5d88c172837"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate([40, 12, 1, 26, 27, 41, 18]) == [12, 1, 26, 27, 41, 18, 40]", "assert rotate([43, -5, 26, 44]) == [43, -5, 26, 44]", "assert rotate([-1, 32, -2, 44, 28, 30, 16, 23, 5, 47, 25, 29]) == [5, 47, 25, 29, -1, 32, -2, 44, 28, 30, 16, 23]", "assert rotate([27, 37, 49, 18, 44, 43, 29, 1, 34, 4]) == [34, 4, 27, 37, 49, 18, 44, 43, 29, 1]", "assert rotate([38, 11, 49, 25, 41, 20]) == [49, 25, 41, 20, 38, 11]", "assert rotate([39, 1, 45]) == [45, 39, 1]", "assert rotate([]) == []"], "test_code": "assert rotate([40, 12, 1, 26, 27, 41, 18]) == [12, 1, 26, 27, 41, 18, 40]\nassert rotate([43, -5, 26, 44]) == [43, -5, 26, 44]\nassert rotate([-1, 32, -2, 44, 28, 30, 16, 23, 5, 47, 25, 29]) == [5, 47, 25, 29, -1, 32, -2, 44, 28, 30, 16, 23]\nassert rotate([27, 37, 49, 18, 44, 43, 29, 1, 34, 4]) == [34, 4, 27, 37, 49, 18, 44, 43, 29, 1]\nassert rotate([38, 11, 49, 25, 41, 20]) == [49, 25, 41, 20, 38, 11]\nassert rotate([39, 1, 45]) == [45, 39, 1]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 8 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([40, 12, 1, 26, 27, 41, 18])` يُرجع `[12, 1, 26, 27, 41, 18, 40]`.\nالجواب:", "qhash": "e6e4e7f99278846c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 33) == 1)", "tests": ["assert count_coprime(44) == 27", "assert count_coprime(8) == 6", "assert count_coprime(36) == 22", "assert count_coprime(115) == 70", "assert count_coprime(19) == 12", "assert count_coprime(182) == 111", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(44) == 27\nassert count_coprime(8) == 6\nassert count_coprime(36) == 22\nassert count_coprime(115) == 70\nassert count_coprime(19) == 12\nassert count_coprime(182) == 111\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 33) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(44)` يُرجع `27`.\nالجواب:", "qhash": "526aaebb0594de0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 100:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([36, 22, 40, 34, 40, 20]) == [36, 58, 98, 0, 40, 60]", "assert reset_sum([]) == []", "assert reset_sum([47, 2, -9, 21, 27]) == [47, 49, 40, 61, 88]", "assert reset_sum([60]) == [60]", "assert reset_sum([83, 80, 88, 52, 5, 21, 7]) == [83, 0, 88, 0, 5, 26, 33]", "assert reset_sum([-9, 86, 23, 8, 78, 82, 16, -2, 20, 40]) == [-9, 77, 100, 0, 78, 0, 16, 14, 34, 74]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([36, 22, 40, 34, 40, 20]) == [36, 58, 98, 0, 40, 60]\nassert reset_sum([]) == []\nassert reset_sum([47, 2, -9, 21, 27]) == [47, 49, 40, 61, 88]\nassert reset_sum([60]) == [60]\nassert reset_sum([83, 80, 88, 52, 5, 21, 7]) == [83, 0, 88, 0, 5, 26, 33]\nassert reset_sum([-9, 86, 23, 8, 78, 82, 16, -2, 20, 40]) == [-9, 77, 100, 0, 78, 0, 16, 14, 34, 74]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 100:\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 > 100:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 100 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([36, 22, 40, 34, 40, 20])` يُرجع `[36, 58, 98, 0, 40, 60]`.\nالجواب:", "qhash": "7daf905b41d71469"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('طالب تفاحة مدينة علم تفاحة نهار') == 2", "assert begin_count('طائرة برتقال مدينة كتاب سوق طالب') == 0", "assert begin_count('حديقة معلم جبل تفاحة سوق خبز') == 1", "assert begin_count('وردة ماء حاسوب مكتبة ماء شمس') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('تفاحة سلام طالب') == 1\nassert begin_count('برمجة قمر مطر طالب') == 0\nassert begin_count('طالب تفاحة مدينة علم تفاحة نهار') == 2\nassert begin_count('طائرة برتقال مدينة كتاب سوق طالب') == 0\nassert begin_count('حديقة معلم جبل تفاحة سوق خبز') == 1\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": "7d51eff006a70ae3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 8) // 4 for x in range(-6, 8) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 8) // 4 for x in range(-6, 8) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "2e2429be7d66973a", "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": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 13", "tests": ["assert rec_prod(12) == 7", "assert rec_prod(45) == 0", "assert rec_prod(38) == 0", "assert rec_prod(3) == 3", "assert rec_prod(5) == 10", "assert rec_prod(39) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 7\nassert rec_prod(45) == 0\nassert rec_prod(38) == 0\nassert rec_prod(3) == 3\nassert rec_prod(5) == 10\nassert rec_prod(39) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 13", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(12)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "c63671192bfa18d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "tests": ["assert pow_total(5) == 675", "assert pow_total(2) == 27", "assert pow_total(7) == 2352", "assert pow_total(0) == 0", "assert pow_total(15) == 43200", "assert pow_total(1) == 3", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 675\nassert pow_total(2) == 27\nassert pow_total(7) == 2352\nassert pow_total(0) == 0\nassert pow_total(15) == 43200\nassert pow_total(1) == 3\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 3 * i ** 3\n return total\n```\nمثال: `pow_total(5)` يجب أن تُرجع `675`.\nالجواب:", "qhash": "18d503ec278623a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'bcru'}", "tests": ["assert count_chars('falcon planet cloud summer') == {'b': 0, 'c': 2, 'r': 1, 'u': 2}", "assert count_chars('matrix coffee') == {'b': 0, 'c': 1, 'r': 1, 'u': 0}", "assert count_chars('planet window python river cloud') == {'b': 0, 'c': 1, 'r': 2, 'u': 1}", "assert count_chars('to cloud by') == {'b': 1, 'c': 1, 'r': 0, 'u': 1}", "assert count_chars('orange matrix') == {'b': 0, 'c': 0, 'r': 2, 'u': 0}", "assert count_chars('camel engine up winter python') == {'b': 0, 'c': 1, 'r': 1, 'u': 1}", "assert count_chars('') == {'b': 0, 'c': 0, 'r': 0, 'u': 0}"], "test_code": "assert count_chars('falcon planet cloud summer') == {'b': 0, 'c': 2, 'r': 1, 'u': 2}\nassert count_chars('matrix coffee') == {'b': 0, 'c': 1, 'r': 1, 'u': 0}\nassert count_chars('planet window python river cloud') == {'b': 0, 'c': 1, 'r': 2, 'u': 1}\nassert count_chars('to cloud by') == {'b': 1, 'c': 1, 'r': 0, 'u': 1}\nassert count_chars('orange matrix') == {'b': 0, 'c': 0, 'r': 2, 'u': 0}\nassert count_chars('camel engine up winter python') == {'b': 0, 'c': 1, 'r': 1, 'u': 1}\nassert count_chars('') == {'b': 0, 'c': 0, 'r': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'bcru'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'bcru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'r'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('falcon planet cloud summer')` يُرجع `{'b': 0, 'c': 2, 'r': 1, 'u': 2}`.\nالجواب:", "qhash": "c9191047f0add406"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 1) // 2 for x in range(5, 12) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 1) // 2 for x in range(5, 12) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e780d30334801b58", "answer": "[3, 4, 5, 6]\n4 18", "completion": " الناتج:\n```text\n[3, 4, 5, 6]\n4 18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(29) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15', '16', '17', 'Ping', '19', '20', 'Pong', '22', '23', 'Ping', '25', '26', '27', 'Pong', '29']", "assert fizzbuzz(2) == ['1', '2']", "assert fizzbuzz(19) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15', '16', '17', 'Ping', '19']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15']"], "test_code": "assert fizzbuzz(29) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15', '16', '17', 'Ping', '19', '20', 'Pong', '22', '23', 'Ping', '25', '26', '27', 'Pong', '29']\nassert fizzbuzz(2) == ['1', '2']\nassert fizzbuzz(19) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15', '16', '17', 'Ping', '19']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Ping'\n if i % 7 == 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 % 6 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Ping'، وإن قَبِلها على 7 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(29)` يُرجع `['1', '2', '3', '4', '5', 'Ping', 'Pong', '8', '9', '10', '11', 'Ping', '13', 'Pong', '15', '16', '17', 'Ping', '19', '20', 'Pong', '22', '23', 'Ping', '25', '26', '27', 'Pong', '29']`.\nالجواب:", "qhash": "d5fc65c210c68810"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'signal'\nprint(word.find('i'))\nprint(word.replace('i', '0'))\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'signal'\nprint(word.find('i'))\nprint(word.replace('i', '0'))\nprint(len(word))\n```\nالجواب:", "qhash": "6b6921b9c20107d2", "answer": "1\ns0gnal\n6", "completion": " الناتج:\n```text\n1\ns0gnal\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ص'):\n count += 1\n return count", "tests": ["assert starts_count('صديق صحراء فجر عمل') == 2", "assert starts_count('قمر حصان حصان باب سوق') == 0", "assert starts_count('صديق صحراء باب مكتبة') == 2", "assert starts_count('برتقال بحر مطر') == 0", "assert starts_count('سلام عمل صحراء') == 1", "assert starts_count('عربية معلم صحراء صحراء مدرسة مدرسة صحراء') == 3", "assert starts_count('') == 0"], "test_code": "assert starts_count('صديق صحراء فجر عمل') == 2\nassert starts_count('قمر حصان حصان باب سوق') == 0\nassert starts_count('صديق صحراء باب مكتبة') == 2\nassert starts_count('برتقال بحر مطر') == 0\nassert starts_count('سلام عمل صحراء') == 1\nassert starts_count('عربية معلم صحراء صحراء مدرسة مدرسة صحراء') == 3\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ص'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(line):\n count = 0\n for w in line:\n if w.startswith('ص'):\n count += 1\n return count\n```\nمثال: `starts_count('صديق صحراء فجر عمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "620c6e20cb2425c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('عمل مكتبة سوق علم جبل برمجة نهار') == 2", "assert count_prefix('شجرة شجرة معلم طائرة علم') == 1", "assert count_prefix('شجرة رمل قمر') == 0", "assert count_prefix('مطر مدينة شمس عمل قلم عمل حاسوب') == 2", "assert count_prefix('سيارة عمل لغة برمجة قهوة علم') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('عربية مدرسة سماء') == 1\nassert count_prefix('عمل مكتبة سوق علم جبل برمجة نهار') == 2\nassert count_prefix('شجرة شجرة معلم طائرة علم') == 1\nassert count_prefix('شجرة رمل قمر') == 0\nassert count_prefix('مطر مدينة شمس عمل قلم عمل حاسوب') == 2\nassert count_prefix('سيارة عمل لغة برمجة قهوة علم') == 2\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('عربية مدرسة سماء')` يُرجع `1`.\nالجواب:", "qhash": "d3f54fa9a02f0923"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'مدرسة طائرة'\nprint(kalima.split())\nprint(kalima[-1])\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'مدرسة طائرة'\nprint(kalima.split())\nprint(kalima[-1])\nprint(len(kalima))\n```\nالجواب:", "qhash": "152697c94f698a6a", "answer": "['مدرسة', 'طائرة']\nة\n11", "completion": " الناتج:\n```text\n['مدرسة', 'طائرة']\nة\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(18))\nprint(calc(18, -9))\nprint(calc(calc(-9), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(18))\nprint(calc(18, -9))\nprint(calc(calc(-9), 18))\n```\nالجواب:", "qhash": "b8424df839a56c2d", "answer": "142\n153\n151", "completion": " الناتج:\n```text\n142\n153\n151\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 13 == 0)", "tests": ["assert sum_div(71) == 755", "assert sum_div(259) == 10270", "assert sum_div(203) == 6348", "assert sum_div(209) == 6760", "assert sum_div(71) == 755", "assert sum_div(124) == 2289", "assert sum_div(1) == 0"], "test_code": "assert sum_div(71) == 755\nassert sum_div(259) == 10270\nassert sum_div(203) == 6348\nassert sum_div(209) == 6760\nassert sum_div(71) == 755\nassert sum_div(124) == 2289\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 % 13 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 13.\nمثال: `sum_div(71)` يجب أن تُرجع `755`.\nالجواب:", "qhash": "6acd73a0ee34fd67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 15 == 0)", "tests": ["assert add_multiples(297) == 8850", "assert add_multiples(280) == 7700", "assert add_multiples(201) == 4100", "assert add_multiples(240) == 5640", "assert add_multiples(16) == 30", "assert add_multiples(74) == 525", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(297) == 8850\nassert add_multiples(280) == 7700\nassert add_multiples(201) == 4100\nassert add_multiples(240) == 5640\nassert add_multiples(16) == 30\nassert add_multiples(74) == 525\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 15 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 15.\nمثال: `add_multiples(297)` يجب أن تُرجع `8850`.\nالجواب:", "qhash": "93a7772f0d2098b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 3\n return total", "tests": ["assert sum_powers(6) == 441", "assert sum_powers(13) == 8281", "assert sum_powers(0) == 0", "assert sum_powers(4) == 100", "assert sum_powers(15) == 14400", "assert sum_powers(1) == 1", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 441\nassert sum_powers(13) == 8281\nassert sum_powers(0) == 0\nassert sum_powers(4) == 100\nassert sum_powers(15) == 14400\nassert sum_powers(1) == 1\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(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_powers(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_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 3\n return total\n```\nمثال: `sum_powers(6)` يجب أن تُرجع `441`.\nالجواب:", "qhash": "4e281227ee961675"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 97", "tests": ["assert prod_mod(11) == 16", "assert prod_mod(57) == 81", "assert prod_mod(42) == 79", "assert prod_mod(35) == 90", "assert prod_mod(53) == 12", "assert prod_mod(52) == 89", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(11) == 16\nassert prod_mod(57) == 81\nassert prod_mod(42) == 79\nassert prod_mod(35) == 90\nassert prod_mod(53) == 12\nassert prod_mod(52) == 89\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 97", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(11)` يُرجع `16`.\nالجواب:", "qhash": "dfb31d5e6c7eabf0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=6):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(g(15))\nprint(g(15, 7))\nprint(g(g(7), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=6):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(g(15))\nprint(g(15, 7))\nprint(g(g(7), 15))\n```\nالجواب:", "qhash": "084b8bf65ae9141e", "answer": "99\n98\n286", "completion": " الناتج:\n```text\n99\n98\n286\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 162:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([83, 32, 51, 48, 29, 69, 9, 84]) == [83, 115, 0, 48, 77, 146, 155, 0]", "assert capped_cumsum([6, 87]) == [6, 93]", "assert capped_cumsum([]) == []", "assert capped_cumsum([133, 93, 158, 119, 121, 43, 58]) == [133, 0, 158, 0, 121, 0, 58]", "assert capped_cumsum([89]) == [89]", "assert capped_cumsum([4, 119, 6]) == [4, 123, 129]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([83, 32, 51, 48, 29, 69, 9, 84]) == [83, 115, 0, 48, 77, 146, 155, 0]\nassert capped_cumsum([6, 87]) == [6, 93]\nassert capped_cumsum([]) == []\nassert capped_cumsum([133, 93, 158, 119, 121, 43, 58]) == [133, 0, 158, 0, 121, 0, 58]\nassert capped_cumsum([89]) == [89]\nassert capped_cumsum([4, 119, 6]) == [4, 123, 129]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 162:\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 > 162:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 162 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([83, 32, 51, 48, 29, 69, 9, 84])` يُرجع `[83, 115, 0, 48, 77, 146, 155, 0]`.\nالجواب:", "qhash": "bb0a79d9d9416f2d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'وردة'\nprint(w.replace(' ', '-'))\nprint(w[-1])\nprint('س' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'وردة'\nprint(w.replace(' ', '-'))\nprint(w[-1])\nprint('س' in w)\n```\nالجواب:", "qhash": "eba159e2bed8b7d2", "answer": "وردة\nة\nFalse", "completion": " الناتج:\n```text\nوردة\nة\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43", "tests": ["assert prod_mod(11) == 29", "assert prod_mod(19) == 13", "assert prod_mod(10) == 30", "assert prod_mod(38) == 34", "assert prod_mod(33) == 29", "assert prod_mod(38) == 34", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(11) == 29\nassert prod_mod(19) == 13\nassert prod_mod(10) == 30\nassert prod_mod(38) == 34\nassert prod_mod(33) == 29\nassert prod_mod(38) == 34\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(11)` يُرجع `29`.\nالجواب:", "qhash": "a578801192f35d70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'مكتبة'\nprint(w.split())\nprint(w[::-1])\nprint(w.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'مكتبة'\nprint(w.split())\nprint(w[::-1])\nprint(w.count('ب'))\n```\nالجواب:", "qhash": "e043276dd30dd092", "answer": "['مكتبة']\nةبتكم\n1", "completion": " الناتج:\n```text\n['مكتبة']\nةبتكم\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('by an summer summer up music') == 'music_up_summer_summer_an_by'", "assert mirror_words('is light pixel on summer signal stone up') == 'up_stone_signal_summer_on_pixel_light_is'", "assert mirror_words('in river a light python on matrix falcon') == 'falcon_matrix_on_python_light_a_river_in'", "assert mirror_words('by cloud engine of') == 'of_engine_cloud_by'", "assert mirror_words('desert engine an apple garden engine') == 'engine_garden_apple_an_engine_desert'", "assert mirror_words('signal we river window window orange') == 'orange_window_window_river_we_signal'", "assert mirror_words('light code') == 'code_light'"], "test_code": "assert mirror_words('by an summer summer up music') == 'music_up_summer_summer_an_by'\nassert mirror_words('is light pixel on summer signal stone up') == 'up_stone_signal_summer_on_pixel_light_is'\nassert mirror_words('in river a light python on matrix falcon') == 'falcon_matrix_on_python_light_a_river_in'\nassert mirror_words('by cloud engine of') == 'of_engine_cloud_by'\nassert mirror_words('desert engine an apple garden engine') == 'engine_garden_apple_an_engine_desert'\nassert mirror_words('signal we river window window orange') == 'orange_window_window_river_we_signal'\nassert mirror_words('light code') == 'code_light'", "answer": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `mirror_words('by an summer summer up music')` يجب أن تُرجع `'music_up_summer_summer_an_by'`.\nالجواب:", "qhash": "efb9c3e8987ea692"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(20) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong']", "assert label_numbers(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']", "assert label_numbers(24) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong', '21', 'Ping', '23', 'Ping']", "assert label_numbers(1) == ['1']", "assert label_numbers(22) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong', '21', 'Ping']"], "test_code": "assert label_numbers(20) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong']\nassert label_numbers(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']\nassert label_numbers(24) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong', '21', 'Ping', '23', 'Ping']\nassert label_numbers(1) == ['1']\nassert label_numbers(22) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong', '21', 'Ping']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 % 2 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Ping'، وإن قَبِلها على 10 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(20)` يُرجع `['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19', 'PingPong']`.\nالجواب:", "qhash": "99278b8ffc2064ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(2))\n```\nالجواب:", "qhash": "c9b9615820718a53", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert div_not([7, 53, 48, 23, 87, 62, 28, 40, 32, 1]) == 2", "assert div_not([50, -34, 79, 64, 59, 28, 53, 41, -35]) == 2", "assert div_not([79]) == 0", "assert div_not([19, 1, 20, 74, 40, 20, 38, -13, 74, 48, 73]) == 0", "assert div_not([]) == 0", "assert div_not([87, -17, -29, 45]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([7, 53, 48, 23, 87, 62, 28, 40, 32, 1]) == 2\nassert div_not([50, -34, 79, 64, 59, 28, 53, 41, -35]) == 2\nassert div_not([79]) == 0\nassert div_not([19, 1, 20, 74, 40, 20, 38, -13, 74, 48, 73]) == 0\nassert div_not([]) == 0\nassert div_not([87, -17, -29, 45]) == 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 % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([7, 53, 48, 23, 87, 62, 28, 40, 32, 1])` يُرجع `2`.\nالجواب:", "qhash": "5bcf55e3185d1ee6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 28", "tests": ["assert sum_digit_pow(4143) == 14", "assert sum_digit_pow(124640) == 17", "assert sum_digit_pow(15861) == 15", "assert sum_digit_pow(633738) == 8", "assert sum_digit_pow(911632) == 20", "assert sum_digit_pow(315144) == 12", "assert sum_digit_pow(475378) == 16", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(4143) == 14\nassert sum_digit_pow(124640) == 17\nassert sum_digit_pow(15861) == 15\nassert sum_digit_pow(633738) == 8\nassert sum_digit_pow(911632) == 20\nassert sum_digit_pow(315144) == 12\nassert sum_digit_pow(475378) == 16\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 28", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 28\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 28.\nللتوضيح: الاستدعاء `sum_digit_pow(4143)` يُرجع `14`.\nالجواب:", "qhash": "27248fe3568f8e65"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "tests": ["assert sum_div(234) == 13572", "assert sum_div(293) == 21462", "assert sum_div(244) == 14762", "assert sum_div(124) == 3782", "assert sum_div(38) == 342", "assert sum_div(200) == 9900", "assert sum_div(1) == 0"], "test_code": "assert sum_div(234) == 13572\nassert sum_div(293) == 21462\nassert sum_div(244) == 14762\nassert sum_div(124) == 3782\nassert sum_div(38) == 342\nassert sum_div(200) == 9900\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 6، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(234)` يُرجع `13572`.\nالجواب:", "qhash": "85e99256558bb4b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([-7, -21, 44, -6, 0, 48, 1, -16]) == 48", "assert find_max_div([-20, -8, -8]) == -8", "assert find_max_div([1]) == None", "assert find_max_div([]) == None", "assert find_max_div([-6, -23, -27, 47, 10]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-7, -21, 44, -6, 0, 48, 1, -16]) == 48\nassert find_max_div([-20, -8, -8]) == -8\nassert find_max_div([1]) == None\nassert find_max_div([]) == None\nassert find_max_div([-6, -23, -27, 47, 10]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(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 find_max_div(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للتوضيح: الاستدعاء `find_max_div([-7, -21, 44, -6, 0, 48, 1, -16])` يُرجع `48`.\nالجواب:", "qhash": "1e3e519234fa9049"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 18:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([2, 14, 14, 6, 6, 4, 7, 5]) == [2, 16, 0, 6, 12, 16, 0, 5]", "assert acc_reset([-10, 14, 13, 1, 10, 17, -10]) == [-10, 4, 17, 18, 0, 17, 7]", "assert acc_reset([0, 10, -1, -5, 14, 11, -1, 18]) == [0, 10, 9, 4, 18, 0, -1, 17]", "assert acc_reset([-8, 12, 12, 17, 6, -10, -1, 18, 18]) == [-8, 4, 16, 0, 6, -4, -5, 13, 0]", "assert acc_reset([-8, 8, 7, 6, -2, -2, -4, 18]) == [-8, 0, 7, 13, 11, 9, 5, 0]", "assert acc_reset([7, 15, 17, -7, 11]) == [7, 0, 17, 10, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([2, 14, 14, 6, 6, 4, 7, 5]) == [2, 16, 0, 6, 12, 16, 0, 5]\nassert acc_reset([-10, 14, 13, 1, 10, 17, -10]) == [-10, 4, 17, 18, 0, 17, 7]\nassert acc_reset([0, 10, -1, -5, 14, 11, -1, 18]) == [0, 10, 9, 4, 18, 0, -1, 17]\nassert acc_reset([-8, 12, 12, 17, 6, -10, -1, 18, 18]) == [-8, 4, 16, 0, 6, -4, -5, 13, 0]\nassert acc_reset([-8, 8, 7, 6, -2, -2, -4, 18]) == [-8, 0, 7, 13, 11, 9, 5, 0]\nassert acc_reset([7, 15, 17, -7, 11]) == [7, 0, 17, 10, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 18:\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 > 18:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 18 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([2, 14, 14, 6, 6, 4, 7, 5])` يجب أن تُرجع `[2, 16, 0, 6, 12, 16, 0, 5]`.\nالجواب:", "qhash": "1c180d40eacdb289"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'خبز وردة'\nprint(s.split())\nprint(s[::-1])\nprint(s[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'خبز وردة'\nprint(s.split())\nprint(s[::-1])\nprint(s[0])\n```\nالجواب:", "qhash": "f189838c53a743b6", "answer": "['خبز', 'وردة']\nةدرو زبخ\nخ", "completion": " الناتج:\n```text\n['خبز', 'وردة']\nةدرو زبخ\nخ\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'جبل لغة'\nprint(text.split())\nprint(text.count('ا'))\nprint(text.find('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'جبل لغة'\nprint(text.split())\nprint(text.count('ا'))\nprint(text.find('ا'))\n```\nالجواب:", "qhash": "64069596abe6d4df", "answer": "['جبل', 'لغة']\n0\n-1", "completion": " الناتج:\n```text\n['جبل', 'لغة']\n0\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('go garden vector river table garden orange music') == 'music-orange-garden-table-river-vector-garden'", "assert rev_long_words('') == ''", "assert rev_long_words('at of by desert') == 'desert'", "assert rev_long_words('banana of code at on') == 'code-banana'", "assert rev_long_words('summer at pixel table planet') == 'planet-table-pixel-summer'", "assert rev_long_words('brain matrix orange') == 'orange-matrix-brain'", "assert rev_long_words('garden orange') == 'orange-garden'"], "test_code": "assert rev_long_words('go garden vector river table garden orange music') == 'music-orange-garden-table-river-vector-garden'\nassert rev_long_words('') == ''\nassert rev_long_words('at of by desert') == 'desert'\nassert rev_long_words('banana of code at on') == 'code-banana'\nassert rev_long_words('summer at pixel table planet') == 'planet-table-pixel-summer'\nassert rev_long_words('brain matrix orange') == 'orange-matrix-brain'\nassert rev_long_words('garden orange') == 'orange-garden'", "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('go garden vector river table garden orange music')` يجب أن تُرجع `'music-orange-garden-table-river-vector-garden'`.\nالجواب:", "qhash": "852fa330353d3f4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([-22, 1, -23, -17, 23, 43, 44, 24]) == 44", "assert top_divisible([-8, -4, -12]) == -4", "assert top_divisible([1, 5, 9]) == None", "assert top_divisible([-5]) == None", "assert top_divisible([29, -22, 6]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-22, 1, -23, -17, 23, 43, 44, 24]) == 44\nassert top_divisible([-8, -4, -12]) == -4\nassert top_divisible([1, 5, 9]) == None\nassert top_divisible([-5]) == None\nassert top_divisible([29, -22, 6]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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مثال: `top_divisible([-22, 1, -23, -17, 23, 43, 44, 24])` يجب أن تُرجع `44`.\nالجواب:", "qhash": "4c6ef38d72304ea7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 71", "tests": ["assert step_product(4) == 24", "assert step_product(14) == 24", "assert step_product(10) == 61", "assert step_product(35) == 1", "assert step_product(25) == 24", "assert step_product(22) == 61", "assert step_product(0) == 1"], "test_code": "assert step_product(4) == 24\nassert step_product(14) == 24\nassert step_product(10) == 61\nassert step_product(35) == 1\nassert step_product(25) == 24\nassert step_product(22) == 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)) % 71", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 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": "302a83d5de903e1f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 5 + -7 for x in range(1, 11) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 5 + -7 for x in range(1, 11) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "165cb33b4a3cb2d0", "answer": "[3, 28]\n2 31", "completion": " الناتج:\n```text\n[3, 28]\n2 31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=3):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(h(19))\nprint(h(19, 12))\nprint(h(h(12), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=3):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(h(19))\nprint(h(19, 12))\nprint(h(h(12), 19))\n```\nالجواب:", "qhash": "74d531d90ad5ea2a", "answer": "-98\n-107\n-158", "completion": " الناتج:\n```text\n-98\n-107\n-158\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(202) == 3845", "assert mult_sum(260) == 6159", "assert mult_sum(282) == 7245", "assert mult_sum(208) == 3845", "assert mult_sum(4) == 0", "assert mult_sum(243) == 5400", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(202) == 3845\nassert mult_sum(260) == 6159\nassert mult_sum(282) == 7245\nassert mult_sum(208) == 3845\nassert mult_sum(4) == 0\nassert mult_sum(243) == 5400\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 % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(202)` يُرجع `3845`.\nالجواب:", "qhash": "632eb9091b7eb88e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "tests": ["assert digits_mod(10760) == 14", "assert digits_mod(732404) == 20", "assert digits_mod(664805) == 29", "assert digits_mod(669545) == 35", "assert digits_mod(493335) == 27", "assert digits_mod(27039) == 21", "assert digits_mod(792047) == 29", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(10760) == 14\nassert digits_mod(732404) == 20\nassert digits_mod(664805) == 29\nassert digits_mod(669545) == 35\nassert digits_mod(493335) == 27\nassert digits_mod(27039) == 21\nassert digits_mod(792047) == 29\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 95.\nللتوضيح: الاستدعاء `digits_mod(10760)` يُرجع `14`.\nالجواب:", "qhash": "9dfcf7d6ed2a49c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 50)", "tests": ["assert pick_between([51, 53, 15, 28, 25, 21, 35]) == [63, 75, 84, 105]", "assert pick_between([]) == []", "assert pick_between([41, 11, 7, 53, 29, 58, -8, -26]) == [87, 123]", "assert pick_between([-3, -14, -26, 35, 38]) == [105, 114]", "assert pick_between([49]) == [147]", "assert pick_between([-21]) == []", "assert pick_between([0, 29, 47, 53, -30, 15]) == [87, 141]", "assert pick_between([]) == []"], "test_code": "assert pick_between([51, 53, 15, 28, 25, 21, 35]) == [63, 75, 84, 105]\nassert pick_between([]) == []\nassert pick_between([41, 11, 7, 53, 29, 58, -8, -26]) == [87, 123]\nassert pick_between([-3, -14, -26, 35, 38]) == [105, 114]\nassert pick_between([49]) == [147]\nassert pick_between([-21]) == []\nassert pick_between([0, 29, 47, 53, -30, 15]) == [87, 141]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 50)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 50)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 19 ≤ x ≤ 50، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([51, 53, 15, 28, 25, 21, 35])` يُرجع `[63, 75, 84, 105]`.\nالجواب:", "qhash": "d70ab0ae5e5018b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [-8, -9, 16, 23, -6, 16, -3, 11]\nprint(nums[1:2])\nprint(nums[::2])\nprint(max(nums[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-8, -9, 16, 23, -6, 16, -3, 11]\nprint(nums[1:2])\nprint(nums[::2])\nprint(max(nums[1:2]))\n```\nالجواب:", "qhash": "561b8d619499816c", "answer": "[-9]\n[-8, 16, -6, -3]\n-9", "completion": " الناتج:\n```text\n[-9]\n[-8, 16, -6, -3]\n-9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "tests": ["assert roll([14, 22, 11, 25, 23, 24]) == [24, 14, 22, 11, 25, 23]", "assert roll([4, 38, 10, 25, 2, -6, 33, 43, -3, 28, 14, 22]) == [-6, 33, 43, -3, 28, 14, 22, 4, 38, 10, 25, 2]", "assert roll([5, 50, -2, 32, 20]) == [5, 50, -2, 32, 20]", "assert roll([45, 2, 9, 23, 36, 45, 2, 4, 26, 42]) == [45, 2, 4, 26, 42, 45, 2, 9, 23, 36]", "assert roll([31, -4, 35, 14, 16, -9, 16, 25]) == [-9, 16, 25, 31, -4, 35, 14, 16]", "assert roll([44, 3, 45, 30]) == [3, 45, 30, 44]", "assert roll([]) == []"], "test_code": "assert roll([14, 22, 11, 25, 23, 24]) == [24, 14, 22, 11, 25, 23]\nassert roll([4, 38, 10, 25, 2, -6, 33, 43, -3, 28, 14, 22]) == [-6, 33, 43, -3, 28, 14, 22, 4, 38, 10, 25, 2]\nassert roll([5, 50, -2, 32, 20]) == [5, 50, -2, 32, 20]\nassert roll([45, 2, 9, 23, 36, 45, 2, 4, 26, 42]) == [45, 2, 4, 26, 42, 45, 2, 9, 23, 36]\nassert roll([31, -4, 35, 14, 16, -9, 16, 25]) == [-9, 16, 25, 31, -4, 35, 14, 16]\nassert roll([44, 3, 45, 30]) == [3, 45, 30, 44]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef roll(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 roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return ____\n```\nمثال: `roll([14, 22, 11, 25, 23, 24])` يجب أن تُرجع `[24, 14, 22, 11, 25, 23]`.\nالجواب:", "qhash": "c799ea73eec45ef2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 14\nfor x in range(4, 17, 2):\n acc -= x * 5\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 14\nfor x in range(4, 17, 2):\n acc -= x * 5\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "d2dc2a7b7ec76782", "answer": "-336\n16", "completion": " الناتج:\n```text\n-336\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 4 * x ** 2 + (-7) * x + (6)", "tests": ["assert p(9) == 267", "assert p(-15) == 1011", "assert p(19) == 1317", "assert p(-19) == 1583", "assert p(0) == 6", "assert p(3) == 21", "assert p(0) == 6", "assert p(0) == 6"], "test_code": "assert p(9) == 267\nassert p(-15) == 1011\nassert p(19) == 1317\nassert p(-19) == 1583\nassert p(0) == 6\nassert p(3) == 21\nassert p(0) == 6\nassert p(0) == 6", "answer": "def p(x):\n return 4 * x ** 2 + (-7) * x + (6)", "completion": " ```python\ndef p(x):\n return 4 * x ** 2 + (-7) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 4x² - 7x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(9)` يُرجع `267`.\nالجواب:", "qhash": "b13a7b951b68aa17"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('مريم', 66), ('راشد', 89), ('سلمى', 41), ('علي', 31)]\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), ('راشد', 89), ('سلمى', 41), ('علي', 31)]\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": "df68f3fff813e9f3", "answer": "[('علي', 31), ('سلمى', 41), ('مريم', 66), ('راشد', 89)]\n['راشد', 'مريم']", "completion": " الناتج:\n```text\n[('علي', 31), ('سلمى', 41), ('مريم', 66), ('راشد', 89)]\n['راشد', 'مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('coffee') == 'lxoonn'", "assert cipher('apple') == 'jyyun'", "assert cipher('an desert garden 2024') == 'jw mnbnac pjamnw 2024'", "assert cipher('to apple garden Hello') == 'cx jyyun pjamnw Hnuux'", "assert cipher('code table coffee') == 'lxmn cjkun lxoonn'", "assert cipher('falcon OK') == 'ojulxw OK'", "assert cipher('') == ''"], "test_code": "assert cipher('coffee') == 'lxoonn'\nassert cipher('apple') == 'jyyun'\nassert cipher('an desert garden 2024') == 'jw mnbnac pjamnw 2024'\nassert cipher('to apple garden Hello') == 'cx jyyun pjamnw Hnuux'\nassert cipher('code table coffee') == 'lxmn cjkun lxoonn'\nassert cipher('falcon OK') == 'ojulxw OK'\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 + (-17)) % 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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('coffee')` يجب أن تُرجع `'lxoonn'`.\nالجواب:", "qhash": "0b0cd7aeb7ec7192"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(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_multiple([-18, -24, 10, 54, -6, 23, 50, 22, -28]) == 50", "assert max_multiple([-10, -5, -15]) == -5", "assert max_multiple([1]) == None", "assert max_multiple([-15, -17, -8, -3, -24, 40]) == 40", "assert max_multiple([38, 17, 22, 32, 2, 19, 22, -39, 35]) == 35", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-18, -24, 10, 54, -6, 23, 50, 22, -28]) == 50\nassert max_multiple([-10, -5, -15]) == -5\nassert max_multiple([1]) == None\nassert max_multiple([-15, -17, -8, -3, -24, 40]) == 40\nassert max_multiple([38, 17, 22, 32, 2, 19, 22, -39, 35]) == 35\nassert max_multiple([]) == None", "answer": "def max_multiple(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_multiple(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_multiple(values):\n best = 0\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_multiple(values):\n best = 0\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_multiple([-18, -24, 10, 54, -6, 23, 50, 22, -28])` يجب أن تُرجع `50`.\nالجواب:", "qhash": "9a6cec3143efc6bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']", "assert label_numbers(12) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red']", "assert label_numbers(4) == ['1', '2', '3', '4']", "assert label_numbers(11) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue']", "assert label_numbers(15) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15']"], "test_code": "assert label_numbers(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']\nassert label_numbers(12) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red']\nassert label_numbers(4) == ['1', '2', '3', '4']\nassert label_numbers(11) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue']\nassert label_numbers(15) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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 % 6 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(23)` يُرجع `['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']`.\nالجواب:", "qhash": "bc4fb5695e3b0fbc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'نهر عربية'\nprint(kalima.find('ه'))\nprint('ه' in kalima)\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'نهر عربية'\nprint(kalima.find('ه'))\nprint('ه' in kalima)\nprint(kalima[-1])\n```\nالجواب:", "qhash": "5ec6c89b4a9e15d6", "answer": "1\nTrue\nة", "completion": " الناتج:\n```text\n1\nTrue\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert sum_div(150) == 2126", "assert sum_div(218) == 4493", "assert sum_div(223) == 4713", "assert sum_div(161) == 2433", "assert sum_div(39) == 156", "assert sum_div(199) == 3861", "assert sum_div(1) == 0"], "test_code": "assert sum_div(150) == 2126\nassert sum_div(218) == 4493\nassert sum_div(223) == 4713\nassert sum_div(161) == 2433\nassert sum_div(39) == 156\nassert sum_div(199) == 3861\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 11.\nمثال: `sum_div(150)` يجب أن تُرجع `2126`.\nالجواب:", "qhash": "e9a0c6ef8731759f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(199113735))\nprint(calc(calc(199113735)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(199113735))\nprint(calc(calc(199113735)))\n```\nالجواب:", "qhash": "157d55fb08e32f8c", "answer": "39\n12", "completion": " الناتج:\n```text\n39\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 7 for x in range(1, 9) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 7 for x in range(1, 9) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "48e5f27d7f810e6a", "answer": "[-3, 9, 29, 57]\n4 92", "completion": " الناتج:\n```text\n[-3, 9, 29, 57]\n4 92\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -4 * x ** 2 + (2) * x + (6)", "tests": ["assert quad(9) == -300", "assert quad(-19) == -1476", "assert quad(-12) == -594", "assert quad(1) == 4", "assert quad(10) == -374", "assert quad(-9) == -336", "assert quad(7) == -176", "assert quad(0) == 6"], "test_code": "assert quad(9) == -300\nassert quad(-19) == -1476\nassert quad(-12) == -594\nassert quad(1) == 4\nassert quad(10) == -374\nassert quad(-9) == -336\nassert quad(7) == -176\nassert quad(0) == 6", "answer": "def quad(x):\n return -4 * x ** 2 + (2) * x + (6)", "completion": " ```python\ndef quad(x):\n return -4 * x ** 2 + (2) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -4x² + 2x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(9)` يُرجع `-300`.\nالجواب:", "qhash": "95e5176e2c50cae7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 3 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(4) == ['1', 'Foo', 'Bar', 'Foo']", "assert play(14) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo', '11', 'FooBar', '13', 'Foo']", "assert play(19) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo', '11', 'FooBar', '13', 'Foo', 'Bar', 'Foo', '17', 'FooBar', '19']", "assert play(10) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo']", "assert play(8) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo']"], "test_code": "assert play(4) == ['1', 'Foo', 'Bar', 'Foo']\nassert play(14) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo', '11', 'FooBar', '13', 'Foo']\nassert play(19) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo', '11', 'FooBar', '13', 'Foo', 'Bar', 'Foo', '17', 'FooBar', '19']\nassert play(10) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo', 'Bar', 'Foo']\nassert play(8) == ['1', 'Foo', 'Bar', 'Foo', '5', 'FooBar', '7', 'Foo']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Foo'\n if i % 3 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 3 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Foo'، وعلى 3 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(4)` يجب أن تُرجع `['1', 'Foo', 'Bar', 'Foo']`.\nالجواب:", "qhash": "cf034ef40d73ceaf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 227\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 = 227\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": "e09a431b401a70f6", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'nt'}", "tests": ["assert count_chars('cloud falcon garden river desert') == {'n': 2, 't': 1}", "assert count_chars('brain it camel') == {'n': 1, 't': 1}", "assert count_chars('data planet planet falcon code') == {'n': 3, 't': 3}", "assert count_chars('table at light camel engine') == {'n': 2, 't': 3}", "assert count_chars('planet vector music stone is camel') == {'n': 2, 't': 3}", "assert count_chars('garden winter we') == {'n': 2, 't': 1}", "assert count_chars('') == {'n': 0, 't': 0}"], "test_code": "assert count_chars('cloud falcon garden river desert') == {'n': 2, 't': 1}\nassert count_chars('brain it camel') == {'n': 1, 't': 1}\nassert count_chars('data planet planet falcon code') == {'n': 3, 't': 3}\nassert count_chars('table at light camel engine') == {'n': 2, 't': 3}\nassert count_chars('planet vector music stone is camel') == {'n': 2, 't': 3}\nassert count_chars('garden winter we') == {'n': 2, 't': 1}\nassert count_chars('') == {'n': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'nt'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'nt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'n'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('cloud falcon garden river desert')` يُرجع `{'n': 2, 't': 1}`.\nالجواب:", "qhash": "30208bff97cbc3f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 61) == 1)", "tests": ["assert coprimes(82) == 81", "assert coprimes(97) == 96", "assert coprimes(190) == 187", "assert coprimes(98) == 97", "assert coprimes(172) == 170", "assert coprimes(111) == 110", "assert coprimes(1) == 1"], "test_code": "assert coprimes(82) == 81\nassert coprimes(97) == 96\nassert coprimes(190) == 187\nassert coprimes(98) == 97\nassert coprimes(172) == 170\nassert coprimes(111) == 110\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 61) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(82)` يُرجع `81`.\nالجواب:", "qhash": "3f05d83c68cce1ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert turn_list([1, 1, 1, 30, 9, 19, 1]) == [1, 30, 9, 19, 1, 1, 1]", "assert turn_list([1, 3, 31, -2, 47, 32, 12]) == [31, -2, 47, 32, 12, 1, 3]", "assert turn_list([-2, -7, 50, 24, 36]) == [36, -2, -7, 50, 24]", "assert turn_list([1, 31, 6, 20, 24, 40, 49]) == [6, 20, 24, 40, 49, 1, 31]", "assert turn_list([13, -7, 25, 6, 16, 42, 40]) == [25, 6, 16, 42, 40, 13, -7]", "assert turn_list([20, 48, 33]) == [20, 48, 33]", "assert turn_list([]) == []"], "test_code": "assert turn_list([1, 1, 1, 30, 9, 19, 1]) == [1, 30, 9, 19, 1, 1, 1]\nassert turn_list([1, 3, 31, -2, 47, 32, 12]) == [31, -2, 47, 32, 12, 1, 3]\nassert turn_list([-2, -7, 50, 24, 36]) == [36, -2, -7, 50, 24]\nassert turn_list([1, 31, 6, 20, 24, 40, 49]) == [6, 20, 24, 40, 49, 1, 31]\nassert turn_list([13, -7, 25, 6, 16, 42, 40]) == [25, 6, 16, 42, 40, 13, -7]\nassert turn_list([20, 48, 33]) == [20, 48, 33]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef turn_list(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 turn_list(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([1, 1, 1, 30, 9, 19, 1])` يُرجع `[1, 30, 9, 19, 1, 1, 1]`.\nالجواب:", "qhash": "5866b776f94068c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 367\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 = 367\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": "7ebaf1e0f6c2453b", "answer": "45", "completion": " الناتج:\n```text\n45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 12\nfor n in range(9, 24, 4):\n result += n * 7\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 12\nfor n in range(9, 24, 4):\n result += n * 7\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "8a3c9ce1c6f508e5", "answer": "432\n21", "completion": " الناتج:\n```text\n432\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-27, 10, -7, 59, 19, 29, 31]) == -7", "assert biggest_mult([-35, -35, -21]) == -21", "assert biggest_mult([1, 8]) == None", "assert biggest_mult([-19]) == None", "assert biggest_mult([41, 42, -16]) == 42", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-27, 10, -7, 59, 19, 29, 31]) == -7\nassert biggest_mult([-35, -35, -21]) == -21\nassert biggest_mult([1, 8]) == None\nassert biggest_mult([-19]) == None\nassert biggest_mult([41, 42, -16]) == 42\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([-27, 10, -7, 59, 19, 29, 31])` يُرجع `-7`.\nالجواب:", "qhash": "99983fb44156ec79"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('orange planet Hello') == 'qtcpig rncpgv Hgnnq'", "assert shift_letters('up at music coffee A1') == 'wr cv owuke eqhhgg A1'", "assert shift_letters('falcon window coffee Hello') == 'hcneqp ykpfqy eqhhgg Hgnnq'", "assert shift_letters('to of music banana brain OK') == 'vq qh owuke dcpcpc dtckp OK'", "assert shift_letters('rocket 2024') == 'tqemgv 2024'", "assert shift_letters('winter pixel vector A1') == 'ykpvgt rkzgn xgevqt A1'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('orange planet Hello') == 'qtcpig rncpgv Hgnnq'\nassert shift_letters('up at music coffee A1') == 'wr cv owuke eqhhgg A1'\nassert shift_letters('falcon window coffee Hello') == 'hcneqp ykpfqy eqhhgg Hgnnq'\nassert shift_letters('to of music banana brain OK') == 'vq qh owuke dcpcpc dtckp OK'\nassert shift_letters('rocket 2024') == 'tqemgv 2024'\nassert shift_letters('winter pixel vector A1') == 'ykpvgt rkzgn xgevqt A1'\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 + (-24)) % 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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('orange planet Hello')` يُرجع `'qtcpig rncpgv Hgnnq'`.\nالجواب:", "qhash": "8ca1e9fdd9d4536c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'علي': 31, 'سلمى': 14, 'نور': 16, 'يوسف': 32, 'أحمد': 44}\nd['علي'] += 20\nd['راشد'] = 35\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'علي': 31, 'سلمى': 14, 'نور': 16, 'يوسف': 32, 'أحمد': 44}\nd['علي'] += 20\nd['راشد'] = 35\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])\n```\nالجواب:", "qhash": "b0294d544d284e44", "answer": "6\nعلي\n192\n['علي', 'يوسف', 'أحمد', 'راشد']", "completion": " الناتج:\n```text\n6\nعلي\n192\n['علي', 'يوسف', 'أحمد', 'راشد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 61", "tests": ["assert step_product(6) == 12", "assert step_product(33) == 58", "assert step_product(43) == 46", "assert step_product(19) == 16", "assert step_product(58) == 7", "assert step_product(31) == 27", "assert step_product(0) == 1"], "test_code": "assert step_product(6) == 12\nassert step_product(33) == 58\nassert step_product(43) == 46\nassert step_product(19) == 16\nassert step_product(58) == 7\nassert step_product(31) == 27\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 61", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(6)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "eb0b3694f5fb9c53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'gns'}", "tests": ["assert freq_of('is planet light river rocket') == {'g': 1, 'n': 1, 's': 1}", "assert freq_of('desert of is') == {'g': 0, 'n': 0, 's': 2}", "assert freq_of('in') == {'g': 0, 'n': 1, 's': 0}", "assert freq_of('light stone desert') == {'g': 1, 'n': 1, 's': 2}", "assert freq_of('up stone by brain') == {'g': 0, 'n': 2, 's': 1}", "assert freq_of('light a window pixel river') == {'g': 1, 'n': 1, 's': 0}", "assert freq_of('') == {'g': 0, 'n': 0, 's': 0}"], "test_code": "assert freq_of('is planet light river rocket') == {'g': 1, 'n': 1, 's': 1}\nassert freq_of('desert of is') == {'g': 0, 'n': 0, 's': 2}\nassert freq_of('in') == {'g': 0, 'n': 1, 's': 0}\nassert freq_of('light stone desert') == {'g': 1, 'n': 1, 's': 2}\nassert freq_of('up stone by brain') == {'g': 0, 'n': 2, 's': 1}\nassert freq_of('light a window pixel river') == {'g': 1, 'n': 1, 's': 0}\nassert freq_of('') == {'g': 0, 'n': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'gns'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'gns'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'n'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('is planet light river rocket')` يُرجع `{'g': 1, 'n': 1, 's': 1}`.\nالجواب:", "qhash": "adf9507c1977ae5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('brain planet on planet rocket') == 'oenva cynarg ba cynarg ebpxrg'", "assert rotate_letters('vector to up 2024') == 'irpgbe gb hc 2024'", "assert rotate_letters('we engine A1') == 'jr ratvar A1'", "assert rotate_letters('of to !') == 'bs gb !'", "assert rotate_letters('window cloud') == 'jvaqbj pybhq'", "assert rotate_letters('camel summer') == 'pnzry fhzzre'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('brain planet on planet rocket') == 'oenva cynarg ba cynarg ebpxrg'\nassert rotate_letters('vector to up 2024') == 'irpgbe gb hc 2024'\nassert rotate_letters('we engine A1') == 'jr ratvar A1'\nassert rotate_letters('of to !') == 'bs gb !'\nassert rotate_letters('window cloud') == 'jvaqbj pybhq'\nassert rotate_letters('camel summer') == 'pnzry fhzzre'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('brain planet on planet rocket')` يُرجع `'oenva cynarg ba cynarg ebpxrg'`.\nالجواب:", "qhash": "c6b24fd0f0cfaba5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'rocket'\nprint(word.split('_'))\nprint(word.find('t'))\nprint(word.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'rocket'\nprint(word.split('_'))\nprint(word.find('t'))\nprint(word.capitalize())\n```\nالجواب:", "qhash": "070bdb837f4e1625", "answer": "['rocket']\n5\nRocket", "completion": " الناتج:\n```text\n['rocket']\n5\nRocket\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 65) == 1)", "tests": ["assert count_gcd1(96) == 71", "assert count_gcd1(107) == 79", "assert count_gcd1(57) == 42", "assert count_gcd1(44) == 33", "assert count_gcd1(120) == 88", "assert count_gcd1(149) == 111", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(96) == 71\nassert count_gcd1(107) == 79\nassert count_gcd1(57) == 42\nassert count_gcd1(44) == 33\nassert count_gcd1(120) == 88\nassert count_gcd1(149) == 111\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, 65) == 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, 65) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 65) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(96)` يُرجع `71`.\nالجواب:", "qhash": "04282abbd53e532e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 2\nfor i in range(10, 16, 3):\n s -= i * 2\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 2\nfor i in range(10, 16, 3):\n s -= i * 2\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "c9a79b5eda10e3f0", "answer": "-44\n13", "completion": " الناتج:\n```text\n-44\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total", "tests": ["assert weighted_sum(8) == 78948", "assert weighted_sum(0) == 0", "assert weighted_sum(13) == 803439", "assert weighted_sum(8) == 78948", "assert weighted_sum(0) == 0", "assert weighted_sum(1) == 9", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 78948\nassert weighted_sum(0) == 0\nassert weighted_sum(13) == 803439\nassert weighted_sum(8) == 78948\nassert weighted_sum(0) == 0\nassert weighted_sum(1) == 9\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(8)` يُرجع `78948`.\nالجواب:", "qhash": "345c4ea1406583a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)", "tests": ["assert mult_sum(204) == 5100", "assert mult_sum(247) == 7564", "assert mult_sum(140) == 2380", "assert mult_sum(143) == 2520", "assert mult_sum(236) == 6844", "assert mult_sum(213) == 5724", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(204) == 5100\nassert mult_sum(247) == 7564\nassert mult_sum(140) == 2380\nassert mult_sum(143) == 2520\nassert mult_sum(236) == 6844\nassert mult_sum(213) == 5724\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(204)` يُرجع `5100`.\nالجواب:", "qhash": "b8a663a66cf03eaa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([17, 23, 22, 25, 23, 23, 7, 17]) == [17, 40, 0, 25, 48, 0, 7, 24]", "assert rolling_total([38, 2, -2, 40, 34, 18, 50, 28, 2, -10]) == [38, 40, 38, 0, 34, 52, 0, 28, 30, 20]", "assert rolling_total([52, 14, 3, 2]) == [52, 0, 3, 5]", "assert rolling_total([18, 18, 16]) == [18, 36, 52]", "assert rolling_total([16]) == [16]", "assert rolling_total([52]) == [52]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([17, 23, 22, 25, 23, 23, 7, 17]) == [17, 40, 0, 25, 48, 0, 7, 24]\nassert rolling_total([38, 2, -2, 40, 34, 18, 50, 28, 2, -10]) == [38, 40, 38, 0, 34, 52, 0, 28, 30, 20]\nassert rolling_total([52, 14, 3, 2]) == [52, 0, 3, 5]\nassert rolling_total([18, 18, 16]) == [18, 36, 52]\nassert rolling_total([16]) == [16]\nassert rolling_total([52]) == [52]\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 60 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([17, 23, 22, 25, 23, 23, 7, 17])` يُرجع `[17, 40, 0, 25, 48, 0, 7, 24]`.\nالجواب:", "qhash": "be801c97d0fa426e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([48, 19, 31, 10, 37, 9, 2, 39]) == [9, 2, 39, 48, 19, 31, 10, 37]", "assert roll([32, 29, 30, 9, -4, 32, 25, 36, 37]) == [37, 32, 29, 30, 9, -4, 32, 25, 36]", "assert roll([24, 30, 38, 43, 9, 15, 45, 9, 24]) == [24, 24, 30, 38, 43, 9, 15, 45, 9]", "assert roll([36, 7, 41]) == [41, 36, 7]", "assert roll([46, 42, 13, 7, 39, 9, 25, 38, 10, 23, -1, 42]) == [9, 25, 38, 10, 23, -1, 42, 46, 42, 13, 7, 39]", "assert roll([42]) == [42]", "assert roll([]) == []"], "test_code": "assert roll([48, 19, 31, 10, 37, 9, 2, 39]) == [9, 2, 39, 48, 19, 31, 10, 37]\nassert roll([32, 29, 30, 9, -4, 32, 25, 36, 37]) == [37, 32, 29, 30, 9, -4, 32, 25, 36]\nassert roll([24, 30, 38, 43, 9, 15, 45, 9, 24]) == [24, 24, 30, 38, 43, 9, 15, 45, 9]\nassert roll([36, 7, 41]) == [41, 36, 7]\nassert roll([46, 42, 13, 7, 39, 9, 25, 38, 10, 23, -1, 42]) == [9, 25, 38, 10, 23, -1, 42, 46, 42, 13, 7, 39]\nassert roll([42]) == [42]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 19 % 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 = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([48, 19, 31, 10, 37, 9, 2, 39])` يُرجع `[9, 2, 39, 48, 19, 31, 10, 37]`.\nالجواب:", "qhash": "584876ad26cf5c14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('at') == 'fy'", "assert rotate_letters('data') == 'ifyf'", "assert rotate_letters('data planet A1') == 'ifyf uqfsjy A1'", "assert rotate_letters('garden table music') == 'lfwijs yfgqj rzxnh'", "assert rotate_letters('summer signal at') == 'xzrrjw xnlsfq fy'", "assert rotate_letters('rocket desert camel matrix') == 'wthpjy ijxjwy hfrjq rfywnc'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('at') == 'fy'\nassert rotate_letters('data') == 'ifyf'\nassert rotate_letters('data planet A1') == 'ifyf uqfsjy A1'\nassert rotate_letters('garden table music') == 'lfwijs yfgqj rzxnh'\nassert rotate_letters('summer signal at') == 'xzrrjw xnlsfq fy'\nassert rotate_letters('rocket desert camel matrix') == 'wthpjy ijxjwy hfrjq rfywnc'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('at')` يُرجع `'fy'`.\nالجواب:", "qhash": "afb55668335b0e4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(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 tally_div([8, 25, 63, 55, 39, 83, 11, 52]) == 2", "assert tally_div([13]) == 0", "assert tally_div([-8, 47, -20, 18, 69, -27, 7, -4, 57, 3]) == 3", "assert tally_div([49, -31, 83, -21, -22, 4, -25, -34, 11]) == 1", "assert tally_div([11, 40, 13, 58, -10, 6, -10]) == 1", "assert tally_div([50, -27, 7, -29, -9]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([8, 25, 63, 55, 39, 83, 11, 52]) == 2\nassert tally_div([13]) == 0\nassert tally_div([-8, 47, -20, 18, 69, -27, 7, -4, 57, 3]) == 3\nassert tally_div([49, -31, 83, -21, -22, 4, -25, -34, 11]) == 1\nassert tally_div([11, 40, 13, 58, -10, 6, -10]) == 1\nassert tally_div([50, -27, 7, -29, -9]) == 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 % 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 % 4 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 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([8, 25, 63, 55, 39, 83, 11, 52])` يُرجع `2`.\nالجواب:", "qhash": "4937daaf16a0212b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 13\nfor j in range(-1, 23, 1):\n acc -= j * 3\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 13\nfor j in range(-1, 23, 1):\n acc -= j * 3\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "7633d478f4a86f48", "answer": "-743\n22", "completion": " الناتج:\n```text\n-743\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 1 for x in xs if -18 <= x <= -13)", "tests": ["assert select_range([-19, -5, -27, -3, -21, -25, -4]) == []", "assert select_range([56, -30, -25, 30]) == []", "assert select_range([40, 8, -9, 9, 26, -25, 1, 23]) == []", "assert select_range([]) == []", "assert select_range([18, 21, -4, -18, 44]) == [-18]", "assert select_range([-30, 59, 32, 5, 41]) == []", "assert select_range([21, 25, 15, 4, 9, -11, 40, -2]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-19, -5, -27, -3, -21, -25, -4]) == []\nassert select_range([56, -30, -25, 30]) == []\nassert select_range([40, 8, -9, 9, 26, -25, 1, 23]) == []\nassert select_range([]) == []\nassert select_range([18, 21, -4, -18, 44]) == [-18]\nassert select_range([-30, 59, 32, 5, 41]) == []\nassert select_range([21, 25, 15, 4, 9, -11, 40, -2]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 1 for x in xs if -18 <= x <= -13)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 1 for x in xs if -18 <= x <= -13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و-13 (شاملًا الطرفين) في 1.\nمثال: `select_range([-19, -5, -27, -3, -21, -25, -4])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "3b297ad6811a6605"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "lead_count", "reference": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ع'):\n count += 1\n return count", "tests": ["assert lead_count('طائرة نهار دفتر علم باب عمل عربية') == 3", "assert lead_count('جمل علم طالب عمل') == 2", "assert lead_count('عمل ميناء مطر عربية') == 2", "assert lead_count('سلام وردة نهار ليل') == 0", "assert lead_count('عربية فجر باب سلام عربية جمل مكتبة نهر') == 2", "assert lead_count('جمل حاسوب حصان علم طالب علم علم حديقة') == 3", "assert lead_count('') == 0"], "test_code": "assert lead_count('طائرة نهار دفتر علم باب عمل عربية') == 3\nassert lead_count('جمل علم طالب عمل') == 2\nassert lead_count('عمل ميناء مطر عربية') == 2\nassert lead_count('سلام وردة نهار ليل') == 0\nassert lead_count('عربية فجر باب سلام عربية جمل مكتبة نهر') == 2\nassert lead_count('جمل حاسوب حصان علم طالب علم علم حديقة') == 3\nassert lead_count('') == 0", "answer": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ع'):\n count += 1\n return count", "completion": " ```python\ndef lead_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 lead_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 lead_count(s):\n count = 0\n for w in s.split():\n if w.endswith('ع'):\n count += 1\n return count\n```\nمثال: `lead_count('طائرة نهار دفتر علم باب عمل عربية')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "01faaa5c9a09fb6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert sum_div(161) == 2268", "assert sum_div(231) == 4448", "assert sum_div(103) == 816", "assert sum_div(92) == 720", "assert sum_div(147) == 1800", "assert sum_div(185) == 2976", "assert sum_div(1) == 0"], "test_code": "assert sum_div(161) == 2268\nassert sum_div(231) == 4448\nassert sum_div(103) == 816\nassert sum_div(92) == 720\nassert sum_div(147) == 1800\nassert sum_div(185) == 2976\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(161)` يُرجع `2268`.\nالجواب:", "qhash": "9179cf12b0a3a6b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -8 * x ** 2 + (5) * x + (-6)", "tests": ["assert p(1) == -9", "assert p(-13) == -1423", "assert p(4) == -114", "assert p(1) == -9", "assert p(0) == -6", "assert p(13) == -1293", "assert p(17) == -2233", "assert p(0) == -6"], "test_code": "assert p(1) == -9\nassert p(-13) == -1423\nassert p(4) == -114\nassert p(1) == -9\nassert p(0) == -6\nassert p(13) == -1293\nassert p(17) == -2233\nassert p(0) == -6", "answer": "def p(x):\n return -8 * x ** 2 + (5) * x + (-6)", "completion": " ```python\ndef p(x):\n return -8 * x ** 2 + (5) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -8x² + 5x - 6 عند العدد الصحيح x.\nمثال: `p(1)` يجب أن تُرجع `-9`.\nالجواب:", "qhash": "d689fd86311a01a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 2:\n return n + 0\n return f(n - 1) + f(n - 2)\n\nprint(f(14))\n```\nالجواب:", "qhash": "8c701a800b9af61c", "answer": "377", "completion": " الناتج:\n```text\n377\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 181\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 = 181\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": "fcf4066d997b2d38", "answer": "18", "completion": " الناتج:\n```text\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))", "tests": ["assert letter_count('بيت حصان ماء كتاب ميناء خبز سيارة') == 0", "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"], "test_code": "assert letter_count('بيت حصان ماء كتاب ميناء خبز سيارة') == 0\nassert 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", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_count(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «و»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('بيت حصان ماء كتاب ميناء خبز سيارة')` يُرجع `0`.\nالجواب:", "qhash": "735afee3b2bc35c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 13 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate([21, 50, 21, 34]) == [50, 21, 34, 21]", "assert rotate([9, 1, 28, 19, 21, 48, 42]) == [42, 9, 1, 28, 19, 21, 48]", "assert rotate([50, 47, 9, 7, 3, 22]) == [47, 9, 7, 3, 22, 50]", "assert rotate([10, 2, 32, 30, 25]) == [30, 25, 10, 2, 32]", "assert rotate([9, 38, 11, 45, 14, 42, 34, 14]) == [42, 34, 14, 9, 38, 11, 45, 14]", "assert rotate([-3, 50, 5, 31, 7, 4, 12, 40, 19]) == [7, 4, 12, 40, 19, -3, 50, 5, 31]", "assert rotate([]) == []"], "test_code": "assert rotate([21, 50, 21, 34]) == [50, 21, 34, 21]\nassert rotate([9, 1, 28, 19, 21, 48, 42]) == [42, 9, 1, 28, 19, 21, 48]\nassert rotate([50, 47, 9, 7, 3, 22]) == [47, 9, 7, 3, 22, 50]\nassert rotate([10, 2, 32, 30, 25]) == [30, 25, 10, 2, 32]\nassert rotate([9, 38, 11, 45, 14, 42, 34, 14]) == [42, 34, 14, 9, 38, 11, 45, 14]\nassert rotate([-3, 50, 5, 31, 7, 4, 12, 40, 19]) == [7, 4, 12, 40, 19, -3, 50, 5, 31]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 13 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 13 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 13 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 13 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([21, 50, 21, 34])` يُرجع `[50, 21, 34, 21]`.\nالجواب:", "qhash": "08f28fd18f772b19"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 31)", "tests": ["assert filter_range([39, 16, 34, 22, 1, 25, 33, -3, 35, 8]) == [-125, -110, -80, -40]", "assert filter_range([-16, -27]) == []", "assert filter_range([]) == []", "assert filter_range([24, 37, 16]) == [-120, -80]", "assert filter_range([]) == []", "assert filter_range([23, -14, 56, -6, 5, 2, 58, 26, -8]) == [-130, -115, -25]", "assert filter_range([48, -25, 32, -30, -10, -7, 7, 25, 37, -14]) == [-125, -35]", "assert filter_range([]) == []"], "test_code": "assert filter_range([39, 16, 34, 22, 1, 25, 33, -3, 35, 8]) == [-125, -110, -80, -40]\nassert filter_range([-16, -27]) == []\nassert filter_range([]) == []\nassert filter_range([24, 37, 16]) == [-120, -80]\nassert filter_range([]) == []\nassert filter_range([23, -14, 56, -6, 5, 2, 58, 26, -8]) == [-130, -115, -25]\nassert filter_range([48, -25, 32, -30, -10, -7, 7, 25, 37, -14]) == [-125, -35]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 31)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -5 for x in xs if 4 <= x <= 31)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 31، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([39, 16, 34, 22, 1, 25, 33, -3, 35, 8])` يُرجع `[-125, -110, -80, -40]`.\nالجواب:", "qhash": "cda2e9163009dbc3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert sum_div(38) == 150", "assert sum_div(150) == 2184", "assert sum_div(24) == 57", "assert sum_div(299) == 8859", "assert sum_div(7) == 0", "assert sum_div(101) == 1054", "assert sum_div(1) == 0"], "test_code": "assert sum_div(38) == 150\nassert sum_div(150) == 2184\nassert sum_div(24) == 57\nassert sum_div(299) == 8859\nassert sum_div(7) == 0\nassert sum_div(101) == 1054\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 10.\nمثال: `sum_div(38)` يجب أن تُرجع `150`.\nالجواب:", "qhash": "5b82bb2885dba7b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('عمل معلم بيت قمر سفينة شجرة جبل تفاحة') == 2", "assert count_in_text('قمر صديق حديقة سيارة جبل بيت مطر بيت') == 3", "assert count_in_text('قهوة سفينة باب') == 1", "assert count_in_text('قلم طالب سيارة بيت') == 2", "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('عمل معلم بيت قمر سفينة شجرة جبل تفاحة') == 2\nassert count_in_text('قمر صديق حديقة سيارة جبل بيت مطر بيت') == 3\nassert count_in_text('قهوة سفينة باب') == 1\nassert count_in_text('قلم طالب سيارة بيت') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ب» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('عمل معلم بيت قمر سفينة شجرة جبل تفاحة')` يُرجع `2`.\nالجواب:", "qhash": "c2e822d93917cbcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('وردة دفتر عربية شمس قمر وردة قهوة')` يُرجع `0`.\nالجواب:", "qhash": "9e6003617c7b7a26"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 2) // 3 for x in range(-2, 13) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 2) // 3 for x in range(-2, 13) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "0b8654086de9b79e", "answer": "[0, 1, 2, 3, 4]\n5 10", "completion": " الناتج:\n```text\n[0, 1, 2, 3, 4]\n5 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 10) == 1)", "tests": ["assert coprimes(115) == 46", "assert coprimes(102) == 41", "assert coprimes(117) == 47", "assert coprimes(55) == 22", "assert coprimes(112) == 45", "assert coprimes(104) == 42", "assert coprimes(1) == 1"], "test_code": "assert coprimes(115) == 46\nassert coprimes(102) == 41\nassert coprimes(117) == 47\nassert coprimes(55) == 22\nassert coprimes(112) == 45\nassert coprimes(104) == 42\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, 10) == 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, 10) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 10) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(115)` يُرجع `46`.\nالجواب:", "qhash": "9854ae5df51261df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(14) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon']", "assert fizz(5) == ['1', '2', 'Sun', '4', '5']", "assert fizz(19) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19']", "assert fizz(13) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13']", "assert fizz(24) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20', 'SunMoon', '22', '23', 'Sun']"], "test_code": "assert fizz(14) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon']\nassert fizz(5) == ['1', '2', 'Sun', '4', '5']\nassert fizz(19) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19']\nassert fizz(13) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13']\nassert fizz(24) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20', 'SunMoon', '22', '23', 'Sun']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\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 += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Sun'، وإن قَبِلها على 7 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(14)` يُرجع `['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon']`.\nالجواب:", "qhash": "43fed8ac2d287fc8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 43", "tests": ["assert digits_mod(77493) == 18", "assert digits_mod(990619) == 24", "assert digits_mod(175633) == 30", "assert digits_mod(993520) == 23", "assert digits_mod(121999) == 21", "assert digits_mod(816541) == 18", "assert digits_mod(244924) == 7", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(77493) == 18\nassert digits_mod(990619) == 24\nassert digits_mod(175633) == 30\nassert digits_mod(993520) == 23\nassert digits_mod(121999) == 21\nassert digits_mod(816541) == 18\nassert digits_mod(244924) == 7\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 43", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 43.\nللتوضيح: الاستدعاء `digits_mod(77493)` يُرجع `18`.\nالجواب:", "qhash": "4432f3edcf90e58f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([-13, 24, -18, 50, 25, 40, 36]) == None", "assert best_multiple([-35, -14, -14]) == -14", "assert best_multiple([1, 8, 15]) == None", "assert best_multiple([]) == None", "assert best_multiple([17, 21, 41, 19, 50]) == 21", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-13, 24, -18, 50, 25, 40, 36]) == None\nassert best_multiple([-35, -14, -14]) == -14\nassert best_multiple([1, 8, 15]) == None\nassert best_multiple([]) == None\nassert best_multiple([17, 21, 41, 19, 50]) == 21\nassert best_multiple([]) == None", "answer": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 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 % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `best_multiple([-13, 24, -18, 50, 25, 40, 36])` يُرجع `None`.\nالجواب:", "qhash": "8c465df7ccfc03e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bcds'}", "tests": ["assert freq_of('planet banana summer code') == {'b': 1, 'c': 1, 'd': 1, 's': 1}", "assert freq_of('of') == {'b': 0, 'c': 0, 'd': 0, 's': 0}", "assert freq_of('we') == {'b': 0, 'c': 0, 'd': 0, 's': 0}", "assert freq_of('by vector we') == {'b': 1, 'c': 1, 'd': 0, 's': 0}", "assert freq_of('river engine brain light engine we') == {'b': 1, 'c': 0, 'd': 0, 's': 0}", "assert freq_of('banana winter banana in') == {'b': 2, 'c': 0, 'd': 0, 's': 0}", "assert freq_of('') == {'b': 0, 'c': 0, 'd': 0, 's': 0}"], "test_code": "assert freq_of('planet banana summer code') == {'b': 1, 'c': 1, 'd': 1, 's': 1}\nassert freq_of('of') == {'b': 0, 'c': 0, 'd': 0, 's': 0}\nassert freq_of('we') == {'b': 0, 'c': 0, 'd': 0, 's': 0}\nassert freq_of('by vector we') == {'b': 1, 'c': 1, 'd': 0, 's': 0}\nassert freq_of('river engine brain light engine we') == {'b': 1, 'c': 0, 'd': 0, 's': 0}\nassert freq_of('banana winter banana in') == {'b': 2, 'c': 0, 'd': 0, 's': 0}\nassert freq_of('') == {'b': 0, 'c': 0, 'd': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bcds'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bcds'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'd'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('planet banana summer code')` يُرجع `{'b': 1, 'c': 1, 'd': 1, 's': 1}`.\nالجواب:", "qhash": "b49ee72da941abac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'نور': 33, 'هدى': 48, 'مريم': 14, 'حسن': 30, 'علي': 49}\nmarks['هدى'] += 9\nmarks['عمر'] = 7\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 = {'نور': 33, 'هدى': 48, 'مريم': 14, 'حسن': 30, 'علي': 49}\nmarks['هدى'] += 9\nmarks['عمر'] = 7\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": "5038951bcf5a7928", "answer": "6\nهدى\n190\n[('عمر', 7), ('مريم', 14)]", "completion": " الناتج:\n```text\n6\nهدى\n190\n[('عمر', 7), ('مريم', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'falcon_engine'\nprint(text.upper())\nprint(text[2:8])\nprint(text.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'falcon_engine'\nprint(text.upper())\nprint(text[2:8])\nprint(text.split('_'))\n```\nالجواب:", "qhash": "ae587a84379dcacc", "answer": "FALCON_ENGINE\nlcon_e\n['falcon', 'engine']", "completion": " الناتج:\n```text\nFALCON_ENGINE\nlcon_e\n['falcon', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert sum_powers(3) == 42", "assert sum_powers(15) == 840", "assert sum_powers(13) == 637", "assert sum_powers(10) == 385", "assert sum_powers(12) == 546", "assert sum_powers(1) == 7", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 42\nassert sum_powers(15) == 840\nassert sum_powers(13) == 637\nassert sum_powers(10) == 385\nassert sum_powers(12) == 546\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 ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 7 * i ** 1\n return total\n```\nمثال: `sum_powers(3)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "812af5a7c3cee2c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('of code') == 'pg dpef'", "assert cipher('window') == 'xjoepx'", "assert cipher('up an') == 'vq bo'", "assert cipher('desert falcon') == 'eftfsu gbmdpo'", "assert cipher('code signal river') == 'dpef tjhobm sjwfs'", "assert cipher('winter river table Hello') == 'xjoufs sjwfs ubcmf Hfmmp'", "assert cipher('') == ''"], "test_code": "assert cipher('of code') == 'pg dpef'\nassert cipher('window') == 'xjoepx'\nassert cipher('up an') == 'vq bo'\nassert cipher('desert falcon') == 'eftfsu gbmdpo'\nassert cipher('code signal river') == 'dpef tjhobm sjwfs'\nassert cipher('winter river table Hello') == 'xjoufs sjwfs ubcmf Hfmmp'\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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('of code')` يُرجع `'pg dpef'`.\nالجواب:", "qhash": "78898ee479d2072b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 44) == 1)", "tests": ["assert phi_upto(10) == 5", "assert phi_upto(23) == 11", "assert phi_upto(172) == 78", "assert phi_upto(28) == 13", "assert phi_upto(104) == 47", "assert phi_upto(99) == 45", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(10) == 5\nassert phi_upto(23) == 11\nassert phi_upto(172) == 78\nassert phi_upto(28) == 13\nassert phi_upto(104) == 47\nassert phi_upto(99) == 45\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, 44) == 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, 44) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 44) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(10)` يُرجع `5`.\nالجواب:", "qhash": "2239f974be98dcfd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [13, -19, -6, 31, -4, 19, 27, 38]\nprint(sorted(nums, key=lambda x: (abs(x - 14), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [13, -19, -6, 31, -4, 19, 27, 38]\nprint(sorted(nums, key=lambda x: (abs(x - 14), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "43af9ff09492795a", "answer": "[13, 19, 27, 31, -4, -6, 38, -19]\n[38, 31, 27]", "completion": " الناتج:\n```text\n[13, 19, 27, 31, -4, -6, 38, -19]\n[38, 31, 27]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'مريم': 9, 'حسن': 4, 'علي': 34, 'راشد': 28}\nscores['مريم'] += 11\nscores['سلمى'] = 50\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 = {'مريم': 9, 'حسن': 4, 'علي': 34, 'راشد': 28}\nscores['مريم'] += 11\nscores['سلمى'] = 50\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": "9e7fb94ce6f6403d", "answer": "5\nسلمى\n136\n[('حسن', 4), ('مريم', 20)]", "completion": " الناتج:\n```text\n5\nسلمى\n136\n[('حسن', 4), ('مريم', 20)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (-4) * x + (1)", "tests": ["assert poly(8) == -223", "assert poly(9) == -278", "assert poly(-10) == -259", "assert poly(3) == -38", "assert poly(8) == -223", "assert poly(2) == -19", "assert poly(-7) == -118", "assert poly(0) == 1"], "test_code": "assert poly(8) == -223\nassert poly(9) == -278\nassert poly(-10) == -259\nassert poly(3) == -38\nassert poly(8) == -223\nassert poly(2) == -19\nassert poly(-7) == -118\nassert poly(0) == 1", "answer": "def poly(x):\n return -3 * x ** 2 + (-4) * x + (1)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (-4) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -3x² - 4x + 1 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `-223`.\nالجواب:", "qhash": "711fc2e3c595c405"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 19", "tests": ["assert rec_prod(8) == 13", "assert rec_prod(39) == 0", "assert rec_prod(52) == 11", "assert rec_prod(12) == 4", "assert rec_prod(21) == 16", "assert rec_prod(55) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(8) == 13\nassert rec_prod(39) == 0\nassert rec_prod(52) == 11\nassert rec_prod(12) == 4\nassert rec_prod(21) == 16\nassert rec_prod(55) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 19", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(8)` يُرجع `13`.\nالجواب:", "qhash": "586c5384297021d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ه')", "tests": ["assert count_hits('فجر طالب خبز بيت لغة وردة قلم') == 0", "assert count_hits('ماء مدينة شجرة قهوة كتاب وردة') == 1", "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('ماء مدينة شجرة قهوة كتاب وردة') == 1\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": "d223af99351a4a9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([51, 20, 57, 53, 76, 72]) == 1", "assert how_many_div([-25, 65, -19, 18, 55, 62, 58]) == 1", "assert how_many_div([3]) == 0", "assert how_many_div([-32, -33, 3]) == 0", "assert how_many_div([78, 53, 61, 22, 11, 57, 51, 52, 65, 90, -22, 72]) == 3", "assert how_many_div([62, -5, 10, 47, 39, -16, 38, -2]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([51, 20, 57, 53, 76, 72]) == 1\nassert how_many_div([-25, 65, -19, 18, 55, 62, 58]) == 1\nassert how_many_div([3]) == 0\nassert how_many_div([-32, -33, 3]) == 0\nassert how_many_div([78, 53, 61, 22, 11, 57, 51, 52, 65, 90, -22, 72]) == 3\nassert how_many_div([62, -5, 10, 47, 39, -16, 38, -2]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 7، واكتب الدالة بعد إكمالها.\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([51, 20, 57, 53, 76, 72])` يُرجع `1`.\nالجواب:", "qhash": "8ff68b0b43b22e85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([32, 19, 8, 4]) == [19, 8, 4, 32]", "assert shift_list([35, 34, 33, 17, 7, 43, 43, 29, 35, -2]) == [34, 33, 17, 7, 43, 43, 29, 35, -2, 35]", "assert shift_list([33, 41, 32, 4, 12, 33, 38, 40]) == [33, 38, 40, 33, 41, 32, 4, 12]", "assert shift_list([-8, -6, 40, 1, 19]) == [-6, 40, 1, 19, -8]", "assert shift_list([26, 36, 33, 50, 3, 23, -8, 48, 32]) == [32, 26, 36, 33, 50, 3, 23, -8, 48]", "assert shift_list([50, 47, 46]) == [46, 50, 47]", "assert shift_list([]) == []"], "test_code": "assert shift_list([32, 19, 8, 4]) == [19, 8, 4, 32]\nassert shift_list([35, 34, 33, 17, 7, 43, 43, 29, 35, -2]) == [34, 33, 17, 7, 43, 43, 29, 35, -2, 35]\nassert shift_list([33, 41, 32, 4, 12, 33, 38, 40]) == [33, 38, 40, 33, 41, 32, 4, 12]\nassert shift_list([-8, -6, 40, 1, 19]) == [-6, 40, 1, 19, -8]\nassert shift_list([26, 36, 33, 50, 3, 23, -8, 48, 32]) == [32, 26, 36, 33, 50, 3, 23, -8, 48]\nassert shift_list([50, 47, 46]) == [46, 50, 47]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n if not xs:\n return []\n k = 19 % 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 = 19 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([32, 19, 8, 4])` يُرجع `[19, 8, 4, 32]`.\nالجواب:", "qhash": "b7c47bdc72899ea6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ه'):\n count += 1\n return count", "tests": ["assert count_initial('بيت شجرة سماء سلام همل') == 1", "assert count_initial('كتاب حصان وردة همل جمل') == 1", "assert count_initial('لغة علم برتقال همل همل') == 2", "assert count_initial('قمر نهار شجرة حصان بيت') == 0", "assert count_initial('همل شمس شمس قهوة سفينة') == 1", "assert count_initial('نهار قهوة رمل همل') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('بيت شجرة سماء سلام همل') == 1\nassert count_initial('كتاب حصان وردة همل جمل') == 1\nassert count_initial('لغة علم برتقال همل همل') == 2\nassert count_initial('قمر نهار شجرة حصان بيت') == 0\nassert count_initial('همل شمس شمس قهوة سفينة') == 1\nassert count_initial('نهار قهوة رمل همل') == 1\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ه'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text.split():\n if w.endswith('ه'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('بيت شجرة سماء سلام همل')` يُرجع `1`.\nالجواب:", "qhash": "88af004575a0a31a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('on coffee by a summer') == 'summer/coffee'", "assert reverse_words('by') == ''", "assert reverse_words('window') == 'window'", "assert reverse_words('go apple garden go winter python') == 'python/winter/garden/apple'", "assert reverse_words('at matrix on') == 'matrix'", "assert reverse_words('it camel table light apple code cloud') == 'cloud/code/apple/light/table/camel'", "assert reverse_words('data on desert') == 'desert/data'"], "test_code": "assert reverse_words('on coffee by a summer') == 'summer/coffee'\nassert reverse_words('by') == ''\nassert reverse_words('window') == 'window'\nassert reverse_words('go apple garden go winter python') == 'python/winter/garden/apple'\nassert reverse_words('at matrix on') == 'matrix'\nassert reverse_words('it camel table light apple code cloud') == 'cloud/code/apple/light/table/camel'\nassert reverse_words('data on desert') == 'desert/data'", "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('on coffee by a summer')` يجب أن تُرجع `'summer/coffee'`.\nالجواب:", "qhash": "31c7f51e78d710a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('up matrix to falcon we') == 'cx uibzqf bw nitkwv em'", "assert cipher('code') == 'kwlm'", "assert cipher('cloud on by') == 'ktwcl wv jg'", "assert cipher('vector it') == 'dmkbwz qb'", "assert cipher('by desert') == 'jg lmamzb'", "assert cipher('banana stone brain summer') == 'jivivi abwvm jziqv acuumz'", "assert cipher('') == ''"], "test_code": "assert cipher('up matrix to falcon we') == 'cx uibzqf bw nitkwv em'\nassert cipher('code') == 'kwlm'\nassert cipher('cloud on by') == 'ktwcl wv jg'\nassert cipher('vector it') == 'dmkbwz qb'\nassert cipher('by desert') == 'jg lmamzb'\nassert cipher('banana stone brain summer') == 'jivivi abwvm jziqv acuumz'\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 + (8)) % 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 + (8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('up matrix to falcon we')` يجب أن تُرجع `'cx uibzqf bw nitkwv em'`.\nالجواب:", "qhash": "681da3c9429023e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'nor'}", "tests": ["assert count_chars('in in') == {'n': 2, 'o': 0, 'r': 0}", "assert count_chars('an garden') == {'n': 2, 'o': 0, 'r': 1}", "assert count_chars('in') == {'n': 1, 'o': 0, 'r': 0}", "assert count_chars('engine music') == {'n': 2, 'o': 0, 'r': 0}", "assert count_chars('music') == {'n': 0, 'o': 0, 'r': 0}", "assert count_chars('rocket by go a data up') == {'n': 0, 'o': 2, 'r': 1}", "assert count_chars('') == {'n': 0, 'o': 0, 'r': 0}"], "test_code": "assert count_chars('in in') == {'n': 2, 'o': 0, 'r': 0}\nassert count_chars('an garden') == {'n': 2, 'o': 0, 'r': 1}\nassert count_chars('in') == {'n': 1, 'o': 0, 'r': 0}\nassert count_chars('engine music') == {'n': 2, 'o': 0, 'r': 0}\nassert count_chars('music') == {'n': 0, 'o': 0, 'r': 0}\nassert count_chars('rocket by go a data up') == {'n': 0, 'o': 2, 'r': 1}\nassert count_chars('') == {'n': 0, 'o': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'nor'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'nor'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'n'، 'o'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('in in')` يُرجع `{'n': 2, 'o': 0, 'r': 0}`.\nالجواب:", "qhash": "99175f22e3cc1b9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'وليد': 42, 'فيصل': 0, 'حسن': 20}\nscores['فيصل'] += 5\nscores['هشام'] = 20\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 15])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'وليد': 42, 'فيصل': 0, 'حسن': 20}\nscores['فيصل'] += 5\nscores['هشام'] = 20\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 15])\n```\nالجواب:", "qhash": "ec3a6b8f72537e4a", "answer": "4\nوليد\n87\n['وليد', 'حسن', 'هشام']", "completion": " الناتج:\n```text\n4\nوليد\n87\n['وليد', 'حسن', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79", "tests": ["assert fact_mod(9) == 76", "assert fact_mod(60) == 4", "assert fact_mod(41) == 56", "assert fact_mod(46) == 7", "assert fact_mod(11) == 46", "assert fact_mod(34) == 27", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(9) == 76\nassert fact_mod(60) == 4\nassert fact_mod(41) == 56\nassert fact_mod(46) == 7\nassert fact_mod(11) == 46\nassert fact_mod(34) == 27\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(9)` يُرجع `76`.\nالجواب:", "qhash": "22747e5a25f869e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 5 + 2 for x in range(6, 15) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 5 + 2 for x in range(6, 15) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "6116da50426eb087", "answer": "[32, 52, 72]\n3 156", "completion": " الناتج:\n```text\n[32, 52, 72]\n3 156\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('stone in signal matrix') == 'matrix,signal,in,stone'", "assert mirror_words('of') == 'of'", "assert mirror_words('signal falcon python by music desert a apple') == 'apple,a,desert,music,by,python,falcon,signal'", "assert mirror_words('in pixel light desert desert brain python') == 'python,brain,desert,desert,light,pixel,in'", "assert mirror_words('stone garden music winter rocket vector python') == 'python,vector,rocket,winter,music,garden,stone'", "assert mirror_words('stone camel') == 'camel,stone'", "assert mirror_words('up music') == 'music,up'"], "test_code": "assert mirror_words('stone in signal matrix') == 'matrix,signal,in,stone'\nassert mirror_words('of') == 'of'\nassert mirror_words('signal falcon python by music desert a apple') == 'apple,a,desert,music,by,python,falcon,signal'\nassert mirror_words('in pixel light desert desert brain python') == 'python,brain,desert,desert,light,pixel,in'\nassert mirror_words('stone garden music winter rocket vector python') == 'python,vector,rocket,winter,music,garden,stone'\nassert mirror_words('stone camel') == 'camel,stone'\nassert mirror_words('up music') == 'music,up'", "answer": "def mirror_words(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `mirror_words('stone in signal matrix')` يجب أن تُرجع `'matrix,signal,in,stone'`.\nالجواب:", "qhash": "0ef3e5885940d3ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'host'}", "tests": ["assert freq_of('garden desert apple brain planet banana') == {'h': 0, 'o': 0, 's': 1, 't': 2}", "assert freq_of('winter a orange matrix') == {'h': 0, 'o': 1, 's': 0, 't': 2}", "assert freq_of('matrix it is to camel on') == {'h': 0, 'o': 2, 's': 1, 't': 3}", "assert freq_of('up light winter music river at') == {'h': 1, 'o': 0, 's': 1, 't': 3}", "assert freq_of('by camel signal') == {'h': 0, 'o': 0, 's': 1, 't': 0}", "assert freq_of('music') == {'h': 0, 'o': 0, 's': 1, 't': 0}", "assert freq_of('') == {'h': 0, 'o': 0, 's': 0, 't': 0}"], "test_code": "assert freq_of('garden desert apple brain planet banana') == {'h': 0, 'o': 0, 's': 1, 't': 2}\nassert freq_of('winter a orange matrix') == {'h': 0, 'o': 1, 's': 0, 't': 2}\nassert freq_of('matrix it is to camel on') == {'h': 0, 'o': 2, 's': 1, 't': 3}\nassert freq_of('up light winter music river at') == {'h': 1, 'o': 0, 's': 1, 't': 3}\nassert freq_of('by camel signal') == {'h': 0, 'o': 0, 's': 1, 't': 0}\nassert freq_of('music') == {'h': 0, 'o': 0, 's': 1, 't': 0}\nassert freq_of('') == {'h': 0, 'o': 0, 's': 0, 't': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'host'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'host'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 'o'، 's'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('garden desert apple brain planet banana')` يجب أن تُرجع `{'h': 0, 'o': 0, 's': 1, 't': 2}`.\nالجواب:", "qhash": "cc8e0c90b9779924"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 67937\nc = 0\nwhile m > 15:\n m = m // 5\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 67937\nc = 0\nwhile m > 15:\n m = m // 5\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "effecb0efd7c84bb", "answer": "4 6", "completion": " الناتج:\n```text\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('ليل نور سلام تفاحة صحراء قهوة صحراء') == 2", "assert lead_count('قمر عربية جمل طائرة مدينة') == 0", "assert lead_count('مطر صديق صديق') == 2", "assert lead_count('حصان مكتبة قمر طالب') == 0", "assert lead_count('عمل وردة نهر صديق حصان جبل') == 1", "assert lead_count('صحراء صحراء بحر ماء') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('ليل نور سلام تفاحة صحراء قهوة صحراء') == 2\nassert lead_count('قمر عربية جمل طائرة مدينة') == 0\nassert lead_count('مطر صديق صديق') == 2\nassert lead_count('حصان مكتبة قمر طالب') == 0\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.split():\n if w.endswith('ص'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ص». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ص'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('ليل نور سلام تفاحة صحراء قهوة صحراء')` يُرجع `2`.\nالجواب:", "qhash": "7a3d90202c1f4630"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert reverse_words('is summer winter table') == 'table|winter|summer'", "assert reverse_words('apple banana garden engine go planet') == 'planet|engine|garden|banana|apple'", "assert reverse_words('code in rocket winter falcon banana banana') == 'banana|banana|falcon|winter|rocket|code'", "assert reverse_words('engine on orange data in a') == 'data|orange|engine'", "assert reverse_words('falcon winter garden in') == 'garden|winter|falcon'", "assert reverse_words('stone to table light brain data window') == 'window|data|brain|light|table|stone'", "assert reverse_words('at stone it up rocket to code') == 'code|rocket|stone'"], "test_code": "assert reverse_words('is summer winter table') == 'table|winter|summer'\nassert reverse_words('apple banana garden engine go planet') == 'planet|engine|garden|banana|apple'\nassert reverse_words('code in rocket winter falcon banana banana') == 'banana|banana|falcon|winter|rocket|code'\nassert reverse_words('engine on orange data in a') == 'data|orange|engine'\nassert reverse_words('falcon winter garden in') == 'garden|winter|falcon'\nassert reverse_words('stone to table light brain data window') == 'window|data|brain|light|table|stone'\nassert reverse_words('at stone it up rocket to code') == 'code|rocket|stone'", "answer": "def reverse_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `reverse_words('is summer winter table')` يُرجع `'table|winter|summer'`.\nالجواب:", "qhash": "e0e83e891d4cd6ad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([11, 79, 12, 38, 51, 68]) == [11, 90, 102, 140, 0, 68]", "assert rolling_total([143, 127, 74, 94, 120, 24, 136]) == [143, 0, 74, 0, 120, 144, 0]", "assert rolling_total([11, 49, 32, 120, -9, 75, 21, 110, 81]) == [11, 60, 92, 0, -9, 66, 87, 0, 81]", "assert rolling_total([124, 90, 96, 137, 145, 69, 79]) == [124, 0, 96, 0, 145, 0, 79]", "assert rolling_total([101, 34, 135, 124, 90, 84, 90]) == [101, 135, 0, 124, 0, 84, 0]", "assert rolling_total([73, 147, 139, 146, 143]) == [73, 0, 139, 0, 143]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([11, 79, 12, 38, 51, 68]) == [11, 90, 102, 140, 0, 68]\nassert rolling_total([143, 127, 74, 94, 120, 24, 136]) == [143, 0, 74, 0, 120, 144, 0]\nassert rolling_total([11, 49, 32, 120, -9, 75, 21, 110, 81]) == [11, 60, 92, 0, -9, 66, 87, 0, 81]\nassert rolling_total([124, 90, 96, 137, 145, 69, 79]) == [124, 0, 96, 0, 145, 0, 79]\nassert rolling_total([101, 34, 135, 124, 90, 84, 90]) == [101, 135, 0, 124, 0, 84, 0]\nassert rolling_total([73, 147, 139, 146, 143]) == [73, 0, 139, 0, 143]\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 158 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([11, 79, 12, 38, 51, 68])` يُرجع `[11, 90, 102, 140, 0, 68]`.\nالجواب:", "qhash": "b95301f7d298d5fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('عمر', 37), ('أحمد', 10), ('هشام', 15), ('سلمى', 77)]\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 = [('عمر', 37), ('أحمد', 10), ('هشام', 15), ('سلمى', 77)]\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": "e5b95eb6a8f10296", "answer": "[('أحمد', 10), ('هشام', 15), ('عمر', 37), ('سلمى', 77)]\n['سلمى', 'عمر']", "completion": " الناتج:\n```text\n[('أحمد', 10), ('هشام', 15), ('عمر', 37), ('سلمى', 77)]\n['سلمى', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(279) == 7917", "assert total_multiples(262) == 7378", "assert total_multiples(231) == 5412", "assert total_multiples(197) == 4129", "assert total_multiples(288) == 8770", "assert total_multiples(266) == 7378", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(279) == 7917\nassert total_multiples(262) == 7378\nassert total_multiples(231) == 5412\nassert total_multiples(197) == 4129\nassert total_multiples(288) == 8770\nassert total_multiples(266) == 7378\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(279)` يُرجع `7917`.\nالجواب:", "qhash": "9d51dc1f3b1b69a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('it we signal in !') == 'gr uc qgelyj gl !'", "assert shift_letters('summer pixel falcon matrix code') == 'qskkcp ngvcj dyjaml kyrpgv ambc'", "assert shift_letters('river of music table') == 'pgtcp md ksqga ryzjc'", "assert shift_letters('by winter 2024') == 'zw uglrcp 2024'", "assert shift_letters('window an coffee') == 'uglbmu yl amddcc'", "assert shift_letters('up table up of an') == 'sn ryzjc sn md yl'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('it we signal in !') == 'gr uc qgelyj gl !'\nassert shift_letters('summer pixel falcon matrix code') == 'qskkcp ngvcj dyjaml kyrpgv ambc'\nassert shift_letters('river of music table') == 'pgtcp md ksqga ryzjc'\nassert shift_letters('by winter 2024') == 'zw uglrcp 2024'\nassert shift_letters('window an coffee') == 'uglbmu yl amddcc'\nassert shift_letters('up table up of an') == 'sn ryzjc sn md yl'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('it we signal in !')` يجب أن تُرجع `'gr uc qgelyj gl !'`.\nالجواب:", "qhash": "38865cf8bfa0b2de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 348\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 = 348\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": "03e918e4c00f9968", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 43", "tests": ["assert mfact(11) == 32", "assert mfact(51) == 0", "assert mfact(15) == 5", "assert mfact(46) == 3", "assert mfact(18) == 31", "assert mfact(19) == 24", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 32\nassert mfact(51) == 0\nassert mfact(15) == 5\nassert mfact(46) == 3\nassert mfact(18) == 31\nassert mfact(19) == 24\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 43", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(11)` يُرجع `32`.\nالجواب:", "qhash": "90c5d07bedf9253a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(items):\n if not items:\n return []\n k = 12 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate([1, 36, 21, 7, 20, 12, 47, 29]) == [20, 12, 47, 29, 1, 36, 21, 7]", "assert rotate([27, -5]) == [27, -5]", "assert rotate([16, 33, 40, 44, 2, 16, 48, 6, -6, 40, 46]) == [46, 16, 33, 40, 44, 2, 16, 48, 6, -6, 40]", "assert rotate([31, 45, 12, 23, -9]) == [23, -9, 31, 45, 12]", "assert rotate([10, 39, 15]) == [10, 39, 15]", "assert rotate([49, 43, 27, 12, 11, 6, 8, 1, 28]) == [8, 1, 28, 49, 43, 27, 12, 11, 6]", "assert rotate([]) == []"], "test_code": "assert rotate([1, 36, 21, 7, 20, 12, 47, 29]) == [20, 12, 47, 29, 1, 36, 21, 7]\nassert rotate([27, -5]) == [27, -5]\nassert rotate([16, 33, 40, 44, 2, 16, 48, 6, -6, 40, 46]) == [46, 16, 33, 40, 44, 2, 16, 48, 6, -6, 40]\nassert rotate([31, 45, 12, 23, -9]) == [23, -9, 31, 45, 12]\nassert rotate([10, 39, 15]) == [10, 39, 15]\nassert rotate([49, 43, 27, 12, 11, 6, 8, 1, 28]) == [8, 1, 28, 49, 43, 27, 12, 11, 6]\nassert rotate([]) == []", "answer": "def rotate(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 rotate(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 rotate(items):\n if not items:\n return []\n k = 12 % len(items)\n return ____\n```\nمثال: `rotate([1, 36, 21, 7, 20, 12, 47, 29])` يجب أن تُرجع `[20, 12, 47, 29, 1, 36, 21, 7]`.\nالجواب:", "qhash": "a9b319c72689c9c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 1:\n return 3\n return 1 * rec(n - 1) + 2\n\nprint(rec(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 1:\n return 3\n return 1 * rec(n - 1) + 2\n\nprint(rec(8))\n```\nالجواب:", "qhash": "abff19ea0ae5fdf6", "answer": "17", "completion": " الناتج:\n```text\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 3 * x ** 2 + (-1) * x + (0)", "tests": ["assert poly(1) == 2", "assert poly(2) == 10", "assert poly(4) == 44", "assert poly(3) == 24", "assert poly(16) == 752", "assert poly(2) == 10", "assert poly(7) == 140", "assert poly(0) == 0"], "test_code": "assert poly(1) == 2\nassert poly(2) == 10\nassert poly(4) == 44\nassert poly(3) == 24\nassert poly(16) == 752\nassert poly(2) == 10\nassert poly(7) == 140\nassert poly(0) == 0", "answer": "def poly(x):\n return 3 * x ** 2 + (-1) * x + (0)", "completion": " ```python\ndef poly(x):\n return 3 * x ** 2 + (-1) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 3x² - 1x + 0 عند العدد الصحيح x.\nمثال: `poly(1)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "309e04b77de1aaec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 28)", "tests": ["assert between_times([36, 18, 11, 2]) == [4, 22, 36]", "assert between_times([35]) == []", "assert between_times([16]) == [32]", "assert between_times([-20, 13, -11, -4, -3, 3, 59]) == [6, 26]", "assert between_times([56]) == []", "assert between_times([56, 13, 37, 53, 59, -29, 56]) == [26]", "assert between_times([]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([36, 18, 11, 2]) == [4, 22, 36]\nassert between_times([35]) == []\nassert between_times([16]) == [32]\nassert between_times([-20, 13, -11, -4, -3, 3, 59]) == [6, 26]\nassert between_times([56]) == []\nassert between_times([56, 13, 37, 53, 59, -29, 56]) == [26]\nassert between_times([]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 28)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 28)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 0 ≤ x ≤ 28، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([36, 18, 11, 2])` يُرجع `[4, 22, 36]`.\nالجواب:", "qhash": "7ae6d47d5ee3728d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 386\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 = 386\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": "0c7dab96bba1778e", "answer": "120", "completion": " الناتج:\n```text\n120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'باسل': 3, 'هدى': 34, 'رنا': 13, 'أحمد': 44}\nmarks['هدى'] += 17\nmarks['خالد'] = 0\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 36])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'باسل': 3, 'هدى': 34, 'رنا': 13, 'أحمد': 44}\nmarks['هدى'] += 17\nmarks['خالد'] = 0\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 36])\n```\nالجواب:", "qhash": "4ad2bec770eaab3a", "answer": "5\nهدى\n111\n['هدى', 'أحمد']", "completion": " الناتج:\n```text\n5\nهدى\n111\n['هدى', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 24\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 = 24\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": "2e494d100174bcc7", "answer": "10", "completion": " الناتج:\n```text\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 75) == 1)", "tests": ["assert coprimes(63) == 34", "assert coprimes(64) == 35", "assert coprimes(131) == 70", "assert coprimes(35) == 19", "assert coprimes(142) == 76", "assert coprimes(192) == 102", "assert coprimes(1) == 1"], "test_code": "assert coprimes(63) == 34\nassert coprimes(64) == 35\nassert coprimes(131) == 70\nassert coprimes(35) == 19\nassert coprimes(142) == 76\nassert coprimes(192) == 102\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, 75) == 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, 75) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 75) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(63)` يُرجع `34`.\nالجواب:", "qhash": "1937835d84d46d3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 4 + 1 for x in range(-5, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 4 + 1 for x in range(-5, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "8dd333366e955321", "answer": "[-15, -7, 1, 9, 17, 25, 33]\n7 63", "completion": " الناتج:\n```text\n[-15, -7, 1, 9, 17, 25, 33]\n7 63\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('باسل', 7), ('أحمد', 23), ('خالد', 12), ('عمر', 73)]\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 = [('باسل', 7), ('أحمد', 23), ('خالد', 12), ('عمر', 73)]\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": "a7204298f1b8f707", "answer": "[('باسل', 7), ('خالد', 12), ('أحمد', 23), ('عمر', 73)]\n['عمر', 'أحمد']", "completion": " الناتج:\n```text\n[('باسل', 7), ('خالد', 12), ('أحمد', 23), ('عمر', 73)]\n['عمر', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 6\nfor i in range(-3, 13, 2):\n s += i * 8\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 6\nfor i in range(-3, 13, 2):\n s += i * 8\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "d824f04ce86734d6", "answer": "262\n11", "completion": " الناتج:\n```text\n262\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 10 <= x <= 39)", "tests": ["assert pick_between([44, 48, 20, 42]) == [80]", "assert pick_between([37, -16, -28, -27]) == [148]", "assert pick_between([-18, 53, -11, 53, 36, 53]) == [144]", "assert pick_between([17, 17, 13, 53, 45, 4, 41, 28, -17]) == [52, 68, 68, 112]", "assert pick_between([-10, -16, -21, 36, 17, 40, 35]) == [68, 140, 144]", "assert pick_between([29, 24, 0, 49, 3, -7, -19, 2, 22, 31]) == [88, 96, 116, 124]", "assert pick_between([5, 21, -11, 5, 17, -17, 31, 28, 57, 14]) == [56, 68, 84, 112, 124]", "assert pick_between([]) == []"], "test_code": "assert pick_between([44, 48, 20, 42]) == [80]\nassert pick_between([37, -16, -28, -27]) == [148]\nassert pick_between([-18, 53, -11, 53, 36, 53]) == [144]\nassert pick_between([17, 17, 13, 53, 45, 4, 41, 28, -17]) == [52, 68, 68, 112]\nassert pick_between([-10, -16, -21, 36, 17, 40, 35]) == [68, 140, 144]\nassert pick_between([29, 24, 0, 49, 3, -7, -19, 2, 22, 31]) == [88, 96, 116, 124]\nassert pick_between([5, 21, -11, 5, 17, -17, 31, 28, 57, 14]) == [56, 68, 84, 112, 124]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 10 <= x <= 39)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if 10 <= x <= 39)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و39 (شاملًا الطرفين) في 4.\nمثال: `pick_between([44, 48, 20, 42])` يجب أن تُرجع `[80]`.\nالجواب:", "qhash": "4d336628174cb226"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']", "assert play(6) == ['1', '2', '3', '4', '5', '6']", "assert play(16) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16']", "assert play(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']", "assert play(0) == []"], "test_code": "assert play(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']\nassert play(6) == ['1', '2', '3', '4', '5', '6']\nassert play(16) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16']\nassert play(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']\nassert play(0) == []", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 9 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(10)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10']`.\nالجواب:", "qhash": "bccf40d59343a391"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "tests": ["assert digit_power(19206) == 20", "assert digit_power(990476) == 3", "assert digit_power(583971) == 15", "assert digit_power(512638) == 21", "assert digit_power(110839) == 4", "assert digit_power(17110) == 6", "assert digit_power(78693) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(19206) == 20\nassert digit_power(990476) == 3\nassert digit_power(583971) == 15\nassert digit_power(512638) == 21\nassert digit_power(110839) == 4\nassert digit_power(17110) == 6\nassert digit_power(78693) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 22.\nمثال: `digit_power(19206)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "9d70ddfbe4c296db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 33975\nsteps = 0\nwhile n > 9:\n n = n // 7\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 33975\nsteps = 0\nwhile n > 9:\n n = n // 7\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "f3ccface04ac2d75", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [6, 36, 17, 29, 1, 17, 1, 40]\nprint(xs[2:4])\nprint(xs[::3])\nprint(sum(xs[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [6, 36, 17, 29, 1, 17, 1, 40]\nprint(xs[2:4])\nprint(xs[::3])\nprint(sum(xs[2:4]))\n```\nالجواب:", "qhash": "dce02fcb2fa17200", "answer": "[17, 29]\n[6, 29, 1]\n46", "completion": " الناتج:\n```text\n[17, 29]\n[6, 29, 1]\n46\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_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 max_of_div([-16, -8, 39, 4, 2, 11]) == 4", "assert max_of_div([-6, -4, -6]) == -4", "assert max_of_div([1, 3, 5]) == None", "assert max_of_div([33, 7, -19, -11, -6, 9, -24, -5]) == -6", "assert max_of_div([-19, 37, 32, 0, -18]) == 32", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-16, -8, 39, 4, 2, 11]) == 4\nassert max_of_div([-6, -4, -6]) == -4\nassert max_of_div([1, 3, 5]) == None\nassert max_of_div([33, 7, -19, -11, -6, 9, -24, -5]) == -6\nassert max_of_div([-19, 37, 32, 0, -18]) == 32\nassert max_of_div([]) == None", "answer": "def max_of_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 max_of_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 max_of_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 max_of_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مثال: `max_of_div([-16, -8, 39, 4, 2, 11])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "d2fa2dee320659f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 17 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert cycle([48, 2, 9, 35, 43, 19]) == [2, 9, 35, 43, 19, 48]", "assert cycle([18, 0, 2, 23, 27, 20, 37, 15, -5, 4]) == [23, 27, 20, 37, 15, -5, 4, 18, 0, 2]", "assert cycle([-6, 32, 13, 4, 26, 42, 41, 38, 45, 19, 16]) == [42, 41, 38, 45, 19, 16, -6, 32, 13, 4, 26]", "assert cycle([22, 45, 22, 14, 5, -6, -7, -7]) == [-7, 22, 45, 22, 14, 5, -6, -7]", "assert cycle([33, -7, -9, -5, 22]) == [-5, 22, 33, -7, -9]", "assert cycle([15, 8, 43, 12, 15, -2, -6, 5, 10]) == [8, 43, 12, 15, -2, -6, 5, 10, 15]", "assert cycle([]) == []"], "test_code": "assert cycle([48, 2, 9, 35, 43, 19]) == [2, 9, 35, 43, 19, 48]\nassert cycle([18, 0, 2, 23, 27, 20, 37, 15, -5, 4]) == [23, 27, 20, 37, 15, -5, 4, 18, 0, 2]\nassert cycle([-6, 32, 13, 4, 26, 42, 41, 38, 45, 19, 16]) == [42, 41, 38, 45, 19, 16, -6, 32, 13, 4, 26]\nassert cycle([22, 45, 22, 14, 5, -6, -7, -7]) == [-7, 22, 45, 22, 14, 5, -6, -7]\nassert cycle([33, -7, -9, -5, 22]) == [-5, 22, 33, -7, -9]\nassert cycle([15, 8, 43, 12, 15, -2, -6, 5, 10]) == [8, 43, 12, 15, -2, -6, 5, 10, 15]\nassert cycle([]) == []", "answer": "def cycle(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 cycle(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 cycle(lst):\n if not lst:\n return []\n k = 17 % len(lst)\n return ____\n```\nمثال: `cycle([48, 2, 9, 35, 43, 19])` يجب أن تُرجع `[2, 9, 35, 43, 19, 48]`.\nالجواب:", "qhash": "00fc8c2c23faa5c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['river', 'python', 'code', 'falcon', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['river', 'python', 'code', 'falcon', 'apple']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "d9926023cc89a9f5", "answer": "['code', 'river', 'apple', 'python', 'falcon']\n['python', 'falcon', 'river']", "completion": " الناتج:\n```text\n['code', 'river', 'apple', 'python', 'falcon']\n['python', 'falcon', 'river']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(118) == 952", "assert total_multiples(292) == 6027", "assert total_multiples(232) == 3927", "assert total_multiples(176) == 2275", "assert total_multiples(263) == 4921", "assert total_multiples(226) == 3696", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(118) == 952\nassert total_multiples(292) == 6027\nassert total_multiples(232) == 3927\nassert total_multiples(176) == 2275\nassert total_multiples(263) == 4921\nassert total_multiples(226) == 3696\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 14.\nمثال: `total_multiples(118)` يجب أن تُرجع `952`.\nالجواب:", "qhash": "48e471cd44bb5789"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 3\nfor n in range(-3, 8, 1):\n result -= n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 3\nfor n in range(-3, 8, 1):\n result -= n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "f485ec9ccddcd225", "answer": "-173\n7", "completion": " الناتج:\n```text\n-173\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'باب'\nprint(len(s))\nprint(s.count('س'))\nprint('س' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'باب'\nprint(len(s))\nprint(s.count('س'))\nprint('س' in s)\n```\nالجواب:", "qhash": "f6581468da9f73e8", "answer": "3\n0\nFalse", "completion": " الناتج:\n```text\n3\n0\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 95465\ncount = 0\nwhile m > 6:\n m = m // 4\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 95465\ncount = 0\nwhile m > 6:\n m = m // 4\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "9bf36e6a0ef351c1", "answer": "5 7", "completion": " الناتج:\n```text\n5 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'جبل طائرة'\nprint(kalima[-1])\nprint(kalima.count('ب'))\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'جبل طائرة'\nprint(kalima[-1])\nprint(kalima.count('ب'))\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "f532c36aaf8066d1", "answer": "ة\n1\nجبل-طائرة", "completion": " الناتج:\n```text\nة\n1\nجبل-طائرة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 89) == 1)", "tests": ["assert phi_upto(29) == 29", "assert phi_upto(77) == 77", "assert phi_upto(103) == 102", "assert phi_upto(126) == 125", "assert phi_upto(44) == 44", "assert phi_upto(6) == 6", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(29) == 29\nassert phi_upto(77) == 77\nassert phi_upto(103) == 102\nassert phi_upto(126) == 125\nassert phi_upto(44) == 44\nassert phi_upto(6) == 6\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, 89) == 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, 89) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 89) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(29)` يُرجع `29`.\nالجواب:", "qhash": "746d572cdd78edd5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 41)", "tests": ["assert in_range_scaled([13, 28, 27, 40, 32, 17, 33, 20, 33, 15]) == [60, 81, 84, 96, 99, 99, 120]", "assert in_range_scaled([-20, 53, -11, 4, 8, 26, 25, -22, 59, 39]) == [75, 78, 117]", "assert in_range_scaled([]) == []", "assert in_range_scaled([-5, 3, 40, 57, 13, 13, 33]) == [99, 120]", "assert in_range_scaled([27, -1, -11]) == [81]", "assert in_range_scaled([-19, 37, 30, 20, 50, 28, 51, -5, 33]) == [60, 84, 90, 99, 111]", "assert in_range_scaled([56, 24, 27, -13, 22, 58]) == [66, 72, 81]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([13, 28, 27, 40, 32, 17, 33, 20, 33, 15]) == [60, 81, 84, 96, 99, 99, 120]\nassert in_range_scaled([-20, 53, -11, 4, 8, 26, 25, -22, 59, 39]) == [75, 78, 117]\nassert in_range_scaled([]) == []\nassert in_range_scaled([-5, 3, 40, 57, 13, 13, 33]) == [99, 120]\nassert in_range_scaled([27, -1, -11]) == [81]\nassert in_range_scaled([-19, 37, 30, 20, 50, 28, 51, -5, 33]) == [60, 84, 90, 99, 111]\nassert in_range_scaled([56, 24, 27, -13, 22, 58]) == [66, 72, 81]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 41)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 3 for x in xs if 19 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 19 ≤ x ≤ 41، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([13, 28, 27, 40, 32, 17, 33, 20, 33, 15])` يُرجع `[60, 81, 84, 96, 99, 99, 120]`.\nالجواب:", "qhash": "c40496a76c93d478"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل قهوة بيت جبل') == 2", "assert count_prefix('سيارة شجرة جمل') == 1", "assert count_prefix('جمل طائرة نهار لغة جبل شمس') == 2", "assert count_prefix('جمل مكتبة قمر ميناء جمل صديق') == 2", "assert count_prefix('بحر جبل جمل حديقة سماء') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('ليل عربية قمر برتقال جبل مدرسة') == 1\nassert count_prefix('جبل قهوة بيت جبل') == 2\nassert count_prefix('سيارة شجرة جمل') == 1\nassert count_prefix('جمل طائرة نهار لغة جبل شمس') == 2\nassert count_prefix('جمل مكتبة قمر ميناء جمل صديق') == 2\nassert count_prefix('بحر جبل جمل حديقة سماء') == 2\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('ليل عربية قمر برتقال جبل مدرسة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "071e69289301229c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 6) == 1)", "tests": ["assert coprime_count(103) == 35", "assert coprime_count(171) == 57", "assert coprime_count(67) == 23", "assert coprime_count(110) == 37", "assert coprime_count(180) == 60", "assert coprime_count(106) == 35", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(103) == 35\nassert coprime_count(171) == 57\nassert coprime_count(67) == 23\nassert coprime_count(110) == 37\nassert coprime_count(180) == 60\nassert coprime_count(106) == 35\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, 6) == 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, 6) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 6، أي أن القاسم المشترك الأكبر لها مع 6 يساوي 1.\nمثال: `coprime_count(103)` يجب أن تُرجع `35`.\nالجواب:", "qhash": "534900a7709afe36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'garden'\nprint(text.split('_'))\nprint(text[::-1])\nprint(text.count('n'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'garden'\nprint(text.split('_'))\nprint(text[::-1])\nprint(text.count('n'))\n```\nالجواب:", "qhash": "a62103d6446c9f0f", "answer": "['garden']\nnedrag\n1", "completion": " الناتج:\n```text\n['garden']\nnedrag\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 72) == 1)", "tests": ["assert phi_upto(97) == 33", "assert phi_upto(88) == 29", "assert phi_upto(34) == 11", "assert phi_upto(30) == 10", "assert phi_upto(116) == 39", "assert phi_upto(119) == 40", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(97) == 33\nassert phi_upto(88) == 29\nassert phi_upto(34) == 11\nassert phi_upto(30) == 10\nassert phi_upto(116) == 39\nassert phi_upto(119) == 40\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, 72) == 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, 72) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 72، أي أن القاسم المشترك الأكبر لها مع 72 يساوي 1.\nمثال: `phi_upto(97)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "efa79b440951f4e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 2 * x ** 2 + (-5) * x + (4)", "tests": ["assert poly(7) == 67", "assert poly(11) == 191", "assert poly(19) == 631", "assert poly(5) == 29", "assert poly(-6) == 106", "assert poly(-4) == 56", "assert poly(12) == 232", "assert poly(0) == 4"], "test_code": "assert poly(7) == 67\nassert poly(11) == 191\nassert poly(19) == 631\nassert poly(5) == 29\nassert poly(-6) == 106\nassert poly(-4) == 56\nassert poly(12) == 232\nassert poly(0) == 4", "answer": "def poly(x):\n return 2 * x ** 2 + (-5) * x + (4)", "completion": " ```python\ndef poly(x):\n return 2 * x ** 2 + (-5) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 2x² - 5x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(7)` يُرجع `67`.\nالجواب:", "qhash": "44f23f4f26f263d1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "tests": ["assert mult_sum(61) == 428", "assert mult_sum(245) == 6432", "assert mult_sum(14) == 18", "assert mult_sum(280) == 8264", "assert mult_sum(290) == 9114", "assert mult_sum(5) == 0", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(61) == 428\nassert mult_sum(245) == 6432\nassert mult_sum(14) == 18\nassert mult_sum(280) == 8264\nassert mult_sum(290) == 9114\nassert mult_sum(5) == 0\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 % 14 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(61)` يُرجع `428`.\nالجواب:", "qhash": "05a2918b84a08328"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_join('signal to an') == 'signal'", "assert rev_join('apple planet pixel cloud python light window banana') == 'banana|window|light|python|cloud|pixel|planet|apple'", "assert rev_join('is desert river summer') == 'summer|river|desert'", "assert rev_join('we rocket an by signal a garden signal') == 'signal|garden|signal|rocket'", "assert rev_join('apple is coffee planet table is vector engine') == 'engine|vector|table|planet|coffee|apple'", "assert rev_join('music to it') == 'music'", "assert rev_join('data desert') == 'desert|data'"], "test_code": "assert rev_join('signal to an') == 'signal'\nassert rev_join('apple planet pixel cloud python light window banana') == 'banana|window|light|python|cloud|pixel|planet|apple'\nassert rev_join('is desert river summer') == 'summer|river|desert'\nassert rev_join('we rocket an by signal a garden signal') == 'signal|garden|signal|rocket'\nassert rev_join('apple is coffee planet table is vector engine') == 'engine|vector|table|planet|coffee|apple'\nassert rev_join('music to it') == 'music'\nassert rev_join('data desert') == 'desert|data'", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_join('signal to an')` يُرجع `'signal'`.\nالجواب:", "qhash": "d3d4ef8682f139b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 8 * x ** 2 + (9) * x + (-2)", "tests": ["assert poly(6) == 340", "assert poly(19) == 3057", "assert poly(-7) == 327", "assert poly(-4) == 90", "assert poly(-9) == 565", "assert poly(16) == 2190", "assert poly(-6) == 232", "assert poly(0) == -2"], "test_code": "assert poly(6) == 340\nassert poly(19) == 3057\nassert poly(-7) == 327\nassert poly(-4) == 90\nassert poly(-9) == 565\nassert poly(16) == 2190\nassert poly(-6) == 232\nassert poly(0) == -2", "answer": "def poly(x):\n return 8 * x ** 2 + (9) * x + (-2)", "completion": " ```python\ndef poly(x):\n return 8 * x ** 2 + (9) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 8x² + 9x - 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(6)` يُرجع `340`.\nالجواب:", "qhash": "785ac0f8901732cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 56540\nsteps = 0\nwhile n > 11:\n n = n // 7\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 56540\nsteps = 0\nwhile n > 11:\n n = n // 7\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "541fe68244b6bdbe", "answer": "3 5", "completion": " الناتج:\n```text\n3 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 11", "tests": ["assert dig_pow_mod(13506) == 6", "assert dig_pow_mod(789426) == 2", "assert dig_pow_mod(817789) == 9", "assert dig_pow_mod(939937) == 10", "assert dig_pow_mod(975291) == 10", "assert dig_pow_mod(939472) == 8", "assert dig_pow_mod(915083) == 8", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(13506) == 6\nassert dig_pow_mod(789426) == 2\nassert dig_pow_mod(817789) == 9\nassert dig_pow_mod(939937) == 10\nassert dig_pow_mod(975291) == 10\nassert dig_pow_mod(939472) == 8\nassert dig_pow_mod(915083) == 8\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 11", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 11.\nللتوضيح: الاستدعاء `dig_pow_mod(13506)` يُرجع `6`.\nالجواب:", "qhash": "dadfce9e41f83b7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('python rocket camel winter go') == 'winter|rocket|python'", "assert rev_join('up orange music') == 'orange'", "assert rev_join('python a it on brain by is') == 'python'", "assert rev_join('winter at go matrix python') == 'python|matrix|winter'", "assert rev_join('engine rocket light desert at it') == 'desert|rocket|engine'", "assert rev_join('by camel up winter engine falcon python') == 'python|falcon|engine|winter'", "assert rev_join('on') == ''"], "test_code": "assert rev_join('python rocket camel winter go') == 'winter|rocket|python'\nassert rev_join('up orange music') == 'orange'\nassert rev_join('python a it on brain by is') == 'python'\nassert rev_join('winter at go matrix python') == 'python|matrix|winter'\nassert rev_join('engine rocket light desert at it') == 'desert|rocket|engine'\nassert rev_join('by camel up winter engine falcon python') == 'python|falcon|engine|winter'\nassert rev_join('on') == ''", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_join('python rocket camel winter go')` يُرجع `'winter|rocket|python'`.\nالجواب:", "qhash": "1139f63b9c161ea3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "tests": ["assert sum_div(60) == 417", "assert sum_div(180) == 3540", "assert sum_div(171) == 3189", "assert sum_div(74) == 616", "assert sum_div(102) == 1153", "assert sum_div(202) == 4492", "assert sum_div(1) == 0"], "test_code": "assert sum_div(60) == 417\nassert sum_div(180) == 3540\nassert sum_div(171) == 3189\nassert sum_div(74) == 616\nassert sum_div(102) == 1153\nassert sum_div(202) == 4492\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 11.\nمثال: `sum_div(60)` يجب أن تُرجع `417`.\nالجواب:", "qhash": "cbdc390c15c98fb8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "tests": ["assert sum_terms(3) == 6", "assert sum_terms(15) == 120", "assert sum_terms(7) == 28", "assert sum_terms(5) == 15", "assert sum_terms(0) == 0", "assert sum_terms(1) == 1", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 6\nassert sum_terms(15) == 120\nassert sum_terms(7) == 28\nassert sum_terms(5) == 15\nassert sum_terms(0) == 0\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 ** 1\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * 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 = 1 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × 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 = 1 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(3)` يُرجع `6`.\nالجواب:", "qhash": "fd1c68f772f6a212"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('coffee banana pixel camel') == 'camel_pixel_banana_coffee'", "assert rev_long_words('matrix stone') == 'stone_matrix'", "assert rev_long_words('data window banana up') == 'banana_window'", "assert rev_long_words('rocket is go garden rocket of window engine') == 'engine_window_rocket_garden_rocket'", "assert rev_long_words('code to river an camel pixel planet desert') == 'desert_planet_pixel_camel_river'", "assert rev_long_words('orange table stone table is desert') == 'desert_table_stone_table_orange'", "assert rev_long_words('summer coffee garden a desert winter pixel code') == 'pixel_winter_desert_garden_coffee_summer'"], "test_code": "assert rev_long_words('coffee banana pixel camel') == 'camel_pixel_banana_coffee'\nassert rev_long_words('matrix stone') == 'stone_matrix'\nassert rev_long_words('data window banana up') == 'banana_window'\nassert rev_long_words('rocket is go garden rocket of window engine') == 'engine_window_rocket_garden_rocket'\nassert rev_long_words('code to river an camel pixel planet desert') == 'desert_planet_pixel_camel_river'\nassert rev_long_words('orange table stone table is desert') == 'desert_table_stone_table_orange'\nassert rev_long_words('summer coffee garden a desert winter pixel code') == 'pixel_winter_desert_garden_coffee_summer'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_long_words('coffee banana pixel camel')` يُرجع `'camel_pixel_banana_coffee'`.\nالجواب:", "qhash": "b2c572150413855e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'table'\nprint(name.capitalize())\nprint(len(name))\nprint(name[3:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'table'\nprint(name.capitalize())\nprint(len(name))\nprint(name[3:4])\n```\nالجواب:", "qhash": "d633d3fcb086787f", "answer": "Table\n5\nl", "completion": " الناتج:\n```text\nTable\n5\nl\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(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 running_sum([42, 35, 41, 13, 22, 34, 37, 35]) == [42, 77, 0, 13, 35, 69, 0, 35]", "assert running_sum([20, 64, 46, 55, 40, 47]) == [20, 84, 0, 55, 0, 47]", "assert running_sum([15, 57, 36, 89, 51]) == [15, 72, 0, 89, 0]", "assert running_sum([16, 31, -4, 41, 78, 34, 20]) == [16, 47, 43, 84, 0, 34, 54]", "assert running_sum([-2, 44]) == [-2, 42]", "assert running_sum([56, 86, 33, 7, 62, 32, -4, 50, 26]) == [56, 0, 33, 40, 0, 32, 28, 78, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([42, 35, 41, 13, 22, 34, 37, 35]) == [42, 77, 0, 13, 35, 69, 0, 35]\nassert running_sum([20, 64, 46, 55, 40, 47]) == [20, 84, 0, 55, 0, 47]\nassert running_sum([15, 57, 36, 89, 51]) == [15, 72, 0, 89, 0]\nassert running_sum([16, 31, -4, 41, 78, 34, 20]) == [16, 47, 43, 84, 0, 34, 54]\nassert running_sum([-2, 44]) == [-2, 42]\nassert running_sum([56, 86, 33, 7, 62, 32, -4, 50, 26]) == [56, 0, 33, 40, 0, 32, 28, 78, 0]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 90 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([42, 35, 41, 13, 22, 34, 37, 35])` يجب أن تُرجع `[42, 77, 0, 13, 35, 69, 0, 35]`.\nالجواب:", "qhash": "deae7cbf927c0f8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 4) // 2 for x in range(1, 8) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 4) // 2 for x in range(1, 8) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "d1c2a84048ec5013", "answer": "[3, 4, 5]\n3 12", "completion": " الناتج:\n```text\n[3, 4, 5]\n3 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)", "tests": ["assert mult_sum(216) == 8851", "assert mult_sum(177) == 5926", "assert mult_sum(177) == 5926", "assert mult_sum(248) == 11860", "assert mult_sum(56) == 604", "assert mult_sum(283) == 15306", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(216) == 8851\nassert mult_sum(177) == 5926\nassert mult_sum(177) == 5926\nassert mult_sum(248) == 11860\nassert mult_sum(56) == 604\nassert mult_sum(283) == 15306\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(216)` يُرجع `8851`.\nالجواب:", "qhash": "80b99b66a8136419"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 119:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([28, 46, 3, 56, 33, 50]) == [28, 74, 77, 0, 33, 83]", "assert running_sum([56, 91, 82, 75, 74, 109, 106, 112, 70, 117]) == [56, 0, 82, 0, 74, 0, 106, 0, 70, 0]", "assert running_sum([11, 97, 119, 14, 87, 21, -2, 100]) == [11, 108, 0, 14, 101, 0, -2, 98]", "assert running_sum([]) == []", "assert running_sum([72]) == [72]", "assert running_sum([8, 69]) == [8, 77]", "assert running_sum([]) == []"], "test_code": "assert running_sum([28, 46, 3, 56, 33, 50]) == [28, 74, 77, 0, 33, 83]\nassert running_sum([56, 91, 82, 75, 74, 109, 106, 112, 70, 117]) == [56, 0, 82, 0, 74, 0, 106, 0, 70, 0]\nassert running_sum([11, 97, 119, 14, 87, 21, -2, 100]) == [11, 108, 0, 14, 101, 0, -2, 98]\nassert running_sum([]) == []\nassert running_sum([72]) == [72]\nassert running_sum([8, 69]) == [8, 77]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 119:\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 > 119:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 119 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([28, 46, 3, 56, 33, 50])` يجب أن تُرجع `[28, 74, 77, 0, 33, 83]`.\nالجواب:", "qhash": "71ce06158af604a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [35, 13, 30, 22, 3, 36, -3, 17, -1]\nprint(a[3:5])\nprint(a[::-1])\nprint(min(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [35, 13, 30, 22, 3, 36, -3, 17, -1]\nprint(a[3:5])\nprint(a[::-1])\nprint(min(a[3:5]))\n```\nالجواب:", "qhash": "d52815260ed0d96c", "answer": "[22, 3]\n[-1, 17, -3, 36, 3, 22, 30, 13, 35]\n3", "completion": " الناتج:\n```text\n[22, 3]\n[-1, 17, -3, 36, 3, 22, 30, 13, 35]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "how_many", "reference": "def how_many(text):\n return text.count('ج')", "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('حصان قلم') == 0", "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('حصان قلم') == 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": "01bf86288e21eeef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «د»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('عمل رمل بحر سلام سيارة بيت')` يُرجع `0`.\nالجواب:", "qhash": "64a15184126fc2fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 77", "tests": ["assert pow_digits(71262) == 17", "assert pow_digits(300608) == 32", "assert pow_digits(928777) == 65", "assert pow_digits(909377) == 38", "assert pow_digits(414236) == 5", "assert pow_digits(198067) == 0", "assert pow_digits(17351) == 8", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(71262) == 17\nassert pow_digits(300608) == 32\nassert pow_digits(928777) == 65\nassert pow_digits(909377) == 38\nassert pow_digits(414236) == 5\nassert pow_digits(198067) == 0\nassert pow_digits(17351) == 8\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 77", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 77.\nمثال: `pow_digits(71262)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "a12ea36ed51f81e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'جمل'\nprint(w.count('ر'))\nprint(w[0])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'جمل'\nprint(w.count('ر'))\nprint(w[0])\nprint(w.split())\n```\nالجواب:", "qhash": "b1474a84040dd909", "answer": "0\nج\n['جمل']", "completion": " الناتج:\n```text\n0\nج\n['جمل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_list([2, 39, 45, 22, 39, 16]) == [45, 22, 39, 16, 2, 39]", "assert rotate_list([19, 8, 4]) == [4, 19, 8]", "assert rotate_list([9, 28, 25, 7, -7, 20]) == [25, 7, -7, 20, 9, 28]", "assert rotate_list([24, 38, 3, -4, 44, 11, 6, 46, 7, 33]) == [6, 46, 7, 33, 24, 38, 3, -4, 44, 11]", "assert rotate_list([12, -3, 31, 37, 11, 36, 1, 31, 14, -8, 28]) == [31, 14, -8, 28, 12, -3, 31, 37, 11, 36, 1]", "assert rotate_list([20]) == [20]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([2, 39, 45, 22, 39, 16]) == [45, 22, 39, 16, 2, 39]\nassert rotate_list([19, 8, 4]) == [4, 19, 8]\nassert rotate_list([9, 28, 25, 7, -7, 20]) == [25, 7, -7, 20, 9, 28]\nassert rotate_list([24, 38, 3, -4, 44, 11, 6, 46, 7, 33]) == [6, 46, 7, 33, 24, 38, 3, -4, 44, 11]\nassert rotate_list([12, -3, 31, 37, 11, 36, 1, 31, 14, -8, 28]) == [31, 14, -8, 28, 12, -3, 31, 37, 11, 36, 1]\nassert rotate_list([20]) == [20]\nassert rotate_list([]) == []", "answer": "def rotate_list(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 rotate_list(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 rotate_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return ____\n```\nمثال: `rotate_list([2, 39, 45, 22, 39, 16])` يجب أن تُرجع `[45, 22, 39, 16, 2, 39]`.\nالجواب:", "qhash": "d13f6b779bff4fff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-3, -7, 23, 7, 6]\nprint(a[3:5])\nprint(a[::-2])\nprint(min(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-3, -7, 23, 7, 6]\nprint(a[3:5])\nprint(a[::-2])\nprint(min(a[3:5]))\n```\nالجواب:", "qhash": "747a84d70999c742", "answer": "[7, 6]\n[6, 23, -3]\n6", "completion": " الناتج:\n```text\n[7, 6]\n[6, 23, -3]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=3):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(-6))\nprint(h(-6, -5))\nprint(h(h(-5), -6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=3):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(-6))\nprint(h(-6, -5))\nprint(h(h(-5), -6))\n```\nالجواب:", "qhash": "c8049be2382070f6", "answer": "9\n-31\n56", "completion": " الناتج:\n```text\n9\n-31\n56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(123) == 1920", "assert total_multiples(40) == 192", "assert total_multiples(247) == 7553", "assert total_multiples(51) == 326", "assert total_multiples(95) == 1050", "assert total_multiples(0) == 0", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(123) == 1920\nassert total_multiples(40) == 192\nassert total_multiples(247) == 7553\nassert total_multiples(51) == 326\nassert total_multiples(95) == 1050\nassert total_multiples(0) == 0\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(123)` يُرجع `1920`.\nالجواب:", "qhash": "69e465065c80e458"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 15\nfor n in range(-5, 18, 2):\n result += n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 15\nfor n in range(-5, 18, 2):\n result += n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "5185120568d1bd3d", "answer": "591\n17", "completion": " الناتج:\n```text\n591\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 39) == 1)", "tests": ["assert phi_upto(89) == 56", "assert phi_upto(44) == 28", "assert phi_upto(55) == 34", "assert phi_upto(188) == 116", "assert phi_upto(158) == 98", "assert phi_upto(189) == 116", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(89) == 56\nassert phi_upto(44) == 28\nassert phi_upto(55) == 34\nassert phi_upto(188) == 116\nassert phi_upto(158) == 98\nassert phi_upto(189) == 116\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, 39) == 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, 39) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 39، أي أن القاسم المشترك الأكبر لها مع 39 يساوي 1.\nمثال: `phi_upto(89)` يجب أن تُرجع `56`.\nالجواب:", "qhash": "7f9884f7ee7cd53e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "reverse_words", "reference": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert reverse_words('python is python brain') == 'python python'", "assert reverse_words('a apple pixel on pixel table') == ''", "assert reverse_words('rocket planet a brain') == 'planet rocket'", "assert reverse_words('signal') == 'signal'", "assert reverse_words('in in desert in') == 'desert'", "assert reverse_words('matrix we planet stone') == 'planet matrix'", "assert reverse_words('music cloud rocket orange') == 'orange rocket'"], "test_code": "assert reverse_words('python is python brain') == 'python python'\nassert reverse_words('a apple pixel on pixel table') == ''\nassert reverse_words('rocket planet a brain') == 'planet rocket'\nassert reverse_words('signal') == 'signal'\nassert reverse_words('in in desert in') == 'desert'\nassert reverse_words('matrix we planet stone') == 'planet matrix'\nassert reverse_words('music cloud rocket orange') == 'orange rocket'", "answer": "def reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef reverse_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reverse_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `reverse_words('python is python brain')` يُرجع `'python python'`.\nالجواب:", "qhash": "8593e15bbfc41d8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo', '22', '23', '24']", "assert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15']", "assert fizz(3) == ['1', '2', '3']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Foo']", "assert fizz(1) == ['1']"], "test_code": "assert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo', '22', '23', '24']\nassert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15']\nassert fizz(3) == ['1', '2', '3']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Foo']\nassert fizz(1) == ['1']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 9 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(24)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo', '22', '23', '24']`.\nالجواب:", "qhash": "d9ed4a7d2bf12f54"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(708811109))\nprint(f(f(708811109)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(708811109))\nprint(f(f(708811109)))\n```\nالجواب:", "qhash": "9b37c256a0269f34", "answer": "35\n8", "completion": " الناتج:\n```text\n35\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(20))\nprint(calc(20, 5))\nprint(calc(calc(5), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(20))\nprint(calc(20, 5))\nprint(calc(calc(5), 20))\n```\nالجواب:", "qhash": "2e596432149f218f", "answer": "96\n95\n85", "completion": " الناتج:\n```text\n96\n95\n85\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(143) == 1656", "assert multiples_total(159) == 2109", "assert multiples_total(213) == 3780", "assert multiples_total(2) == 0", "assert multiples_total(202) == 3369", "assert multiples_total(81) == 468", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(143) == 1656\nassert multiples_total(159) == 2109\nassert multiples_total(213) == 3780\nassert multiples_total(2) == 0\nassert multiples_total(202) == 3369\nassert multiples_total(81) == 468\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 12.\nمثال: `multiples_total(143)` يجب أن تُرجع `1656`.\nالجواب:", "qhash": "bae20868af9e2a34"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if 20 <= x <= 57)", "tests": ["assert between_times([19, 46, 37, 51, 14, 37]) == [37, 37, 46, 51]", "assert between_times([-15, -21, 46, 52, 1, -6, -6, -16]) == [46, 52]", "assert between_times([-2, -3, 46, 2, 41, 17, 3, -27, 43]) == [41, 43, 46]", "assert between_times([-1, 16, 22, 26]) == [22, 26]", "assert between_times([27]) == [27]", "assert between_times([]) == []", "assert between_times([-21]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([19, 46, 37, 51, 14, 37]) == [37, 37, 46, 51]\nassert between_times([-15, -21, 46, 52, 1, -6, -6, -16]) == [46, 52]\nassert between_times([-2, -3, 46, 2, 41, 17, 3, -27, 43]) == [41, 43, 46]\nassert between_times([-1, 16, 22, 26]) == [22, 26]\nassert between_times([27]) == [27]\nassert between_times([]) == []\nassert between_times([-21]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if 20 <= x <= 57)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if 20 <= x <= 57)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 57، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([19, 46, 37, 51, 14, 37])` يُرجع `[37, 37, 46, 51]`.\nالجواب:", "qhash": "b78732d3d1a78631"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 29", "tests": ["assert mfact(6) == 18", "assert mfact(20) == 11", "assert mfact(25) == 22", "assert mfact(48) == 6", "assert mfact(6) == 18", "assert mfact(49) == 19", "assert mfact(0) == 1"], "test_code": "assert mfact(6) == 18\nassert mfact(20) == 11\nassert mfact(25) == 22\nassert mfact(48) == 6\nassert mfact(6) == 18\nassert mfact(49) == 19\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 29", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(6)` يُرجع `18`.\nالجواب:", "qhash": "bab7ce90b0af412d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'winter'\nprint(len(text))\nprint(text.split('_'))\nprint(text.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'winter'\nprint(len(text))\nprint(text.split('_'))\nprint(text.upper())\n```\nالجواب:", "qhash": "aa031e3af0efca8e", "answer": "6\n['winter']\nWINTER", "completion": " الناتج:\n```text\n6\n['winter']\nWINTER\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if w.startswith('ع'))", "tests": ["assert tally_letter('سماء علم علم سفينة حديقة سلام نور') == 2", "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('سماء علم علم سفينة حديقة سلام نور') == 2\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 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('سماء علم علم سفينة حديقة سلام نور')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "e83041b05b196ed3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 7 for x in range(6, 18) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 7 for x in range(6, 18) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d78790a9d9a08b23", "answer": "[29, 74, 137, 218]\n4 458", "completion": " الناتج:\n```text\n[29, 74, 137, 218]\n4 458\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 210\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 = 210\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": "3c2d122adf0c0670", "answer": "39", "completion": " الناتج:\n```text\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [25, 17, 27, 1, 5, 32, 38]\nprint(a[3:4])\nprint(a[::-1])\nprint(len(a[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [25, 17, 27, 1, 5, 32, 38]\nprint(a[3:4])\nprint(a[::-1])\nprint(len(a[3:4]))\n```\nالجواب:", "qhash": "d3dcd02d7befdc55", "answer": "[1]\n[38, 32, 5, 1, 27, 17, 25]\n1", "completion": " الناتج:\n```text\n[1]\n[38, 32, 5, 1, 27, 17, 25]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(16))\n```\nالجواب:", "qhash": "391c8172158544b6", "answer": "4181", "completion": " الناتج:\n```text\n4181\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [24, 8, 27, 22, 3, 17, 25, -2, 23]\nprint(nums[0:7])\nprint(nums[::-1])\nprint(len(nums[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [24, 8, 27, 22, 3, 17, 25, -2, 23]\nprint(nums[0:7])\nprint(nums[::-1])\nprint(len(nums[0:7]))\n```\nالجواب:", "qhash": "53092317ac2d92e0", "answer": "[24, 8, 27, 22, 3, 17, 25]\n[23, -2, 25, 17, 3, 22, 27, 8, 24]\n7", "completion": " الناتج:\n```text\n[24, 8, 27, 22, 3, 17, 25]\n[23, -2, 25, 17, 3, 22, 27, 8, 24]\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'desert_matrix'\nprint(word.split('_'))\nprint(word.replace('m', 'X'))\nprint(word.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'desert_matrix'\nprint(word.split('_'))\nprint(word.replace('m', 'X'))\nprint(word.upper())\n```\nالجواب:", "qhash": "92c115ad4aef3a8b", "answer": "['desert', 'matrix']\ndesert_Xatrix\nDESERT_MATRIX", "completion": " الناتج:\n```text\n['desert', 'matrix']\ndesert_Xatrix\nDESERT_MATRIX\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('by engine at') == 'at-engine-by'", "assert invert_words('falcon is') == 'is-falcon'", "assert invert_words('up on orange') == 'orange-on-up'", "assert invert_words('on window') == 'window-on'", "assert invert_words('light an up an brain go') == 'go-brain-an-up-an-light'", "assert invert_words('table python rocket orange') == 'orange-rocket-python-table'", "assert invert_words('') == ''"], "test_code": "assert invert_words('by engine at') == 'at-engine-by'\nassert invert_words('falcon is') == 'is-falcon'\nassert invert_words('up on orange') == 'orange-on-up'\nassert invert_words('on window') == 'window-on'\nassert invert_words('light an up an brain go') == 'go-brain-an-up-an-light'\nassert invert_words('table python rocket orange') == 'orange-rocket-python-table'\nassert invert_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `invert_words('by engine at')` يُرجع `'at-engine-by'`.\nالجواب:", "qhash": "30af8963e8ec04f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert begin_count('ميناء ليل معلم خبز') == 2", "assert begin_count('ماء مطر مطر عمل مطر طالب جمل نور') == 4", "assert begin_count('ميناء علم كتاب شجرة عربية') == 1", "assert begin_count('عمل لغة سفينة جبل') == 0", "assert begin_count('عمل قمر') == 0", "assert begin_count('عمل قهوة ماء مدرسة سوق عربية') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('ميناء ليل معلم خبز') == 2\nassert begin_count('ماء مطر مطر عمل مطر طالب جمل نور') == 4\nassert begin_count('ميناء علم كتاب شجرة عربية') == 1\nassert begin_count('عمل لغة سفينة جبل') == 0\nassert begin_count('عمل قمر') == 0\nassert begin_count('عمل قهوة ماء مدرسة سوق عربية') == 2\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_count(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 begin_count(line):\n count = 0\n for w in line.split():\n if 'م' in w:\n count += 1\n return count\n```\nمثال: `begin_count('ميناء ليل معلم خبز')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "072e7e8a8507c4c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz']", "assert fizzbuzz(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19', '20', 'Fizz', 'Buzz', '23', '24']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15']", "assert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17']"], "test_code": "assert fizzbuzz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz']\nassert fizzbuzz(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19', '20', 'Fizz', 'Buzz', '23', '24']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15']\nassert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17']", "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 % 11 == 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 % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 11 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(14)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz']`.\nالجواب:", "qhash": "6590545c4be9f4a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([34, 35, 35, 96, 73, 69, 83]) == [34, 69, 104, 0, 73, 142, 0]", "assert rolling_total([31, 74, 93, 128, 129, 147, 53, 49, 107, 171]) == [31, 105, 0, 128, 0, 147, 0, 49, 156, 0]", "assert rolling_total([183, 162, 70]) == [183, 0, 70]", "assert rolling_total([170, 66, 182]) == [170, 0, 182]", "assert rolling_total([-10]) == [-10]", "assert rolling_total([151, 116, 100, 65]) == [151, 0, 100, 165]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([34, 35, 35, 96, 73, 69, 83]) == [34, 69, 104, 0, 73, 142, 0]\nassert rolling_total([31, 74, 93, 128, 129, 147, 53, 49, 107, 171]) == [31, 105, 0, 128, 0, 147, 0, 49, 156, 0]\nassert rolling_total([183, 162, 70]) == [183, 0, 70]\nassert rolling_total([170, 66, 182]) == [170, 0, 182]\nassert rolling_total([-10]) == [-10]\nassert rolling_total([151, 116, 100, 65]) == [151, 0, 100, 165]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 186:\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 > 186:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 186 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([34, 35, 35, 96, 73, 69, 83])` يُرجع `[34, 69, 104, 0, 73, 142, 0]`.\nالجواب:", "qhash": "6e3bf0033a6f39db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert game(18) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic']", "assert game(21) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21']", "assert game(13) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13']", "assert game(23) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21', '22', '23']", "assert game(7) == ['1', '2', '3', '4', '5', 'Tic', '7']"], "test_code": "assert game(18) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic']\nassert game(21) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21']\nassert game(13) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13']\nassert game(23) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21', '22', '23']\nassert game(7) == ['1', '2', '3', '4', '5', 'Tic', '7']", "answer": "def game(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 game(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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(18)` يُرجع `['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic']`.\nالجواب:", "qhash": "9d2c9c01709c5686"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('brain banana it') == 'lbksx lkxkxk sd'", "assert rotate_letters('winter we orange to Hello') == 'gsxdob go ybkxqo dy Hovvy'", "assert rotate_letters('summer is matrix music 2024') == 'cewwob sc wkdbsh wecsm 2024'", "assert rotate_letters('falcon in data an go Hello') == 'pkvmyx sx nkdk kx qy Hovvy'", "assert rotate_letters('up engine') == 'ez oxqsxo'", "assert rotate_letters('brain camel we planet signal') == 'lbksx mkwov go zvkxod csqxkv'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('brain banana it') == 'lbksx lkxkxk sd'\nassert rotate_letters('winter we orange to Hello') == 'gsxdob go ybkxqo dy Hovvy'\nassert rotate_letters('summer is matrix music 2024') == 'cewwob sc wkdbsh wecsm 2024'\nassert rotate_letters('falcon in data an go Hello') == 'pkvmyx sx nkdk kx qy Hovvy'\nassert rotate_letters('up engine') == 'ez oxqsxo'\nassert rotate_letters('brain camel we planet signal') == 'lbksx mkwov go zvkxod csqxkv'\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 + (-16)) % 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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('brain banana it')` يجب أن تُرجع `'lbksx lkxkxk sd'`.\nالجواب:", "qhash": "fd53a6d9118c4556"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 92", "tests": ["assert dig_pow_mod(91223) == 7", "assert dig_pow_mod(301754) == 8", "assert dig_pow_mod(85418) == 78", "assert dig_pow_mod(612700) == 90", "assert dig_pow_mod(889436) == 86", "assert dig_pow_mod(852797) == 88", "assert dig_pow_mod(691639) == 60", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(91223) == 7\nassert dig_pow_mod(301754) == 8\nassert dig_pow_mod(85418) == 78\nassert dig_pow_mod(612700) == 90\nassert dig_pow_mod(889436) == 86\nassert dig_pow_mod(852797) == 88\nassert dig_pow_mod(691639) == 60\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 92", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 92\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 92.\nمثال: `dig_pow_mod(91223)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "822c3de1c7d99b75"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 19 <= x <= 59)", "tests": ["assert in_range_scaled([56, 64, 16, 34, 19, 37, 33]) == [-224, -148, -136, -132, -76]", "assert in_range_scaled([26, 46, 44, 20]) == [-184, -176, -104, -80]", "assert in_range_scaled([10, 32]) == [-128]", "assert in_range_scaled([14, 22, 55, 44, -21, 22, 55, -13, 24, -18]) == [-220, -220, -176, -96, -88, -88]", "assert in_range_scaled([16, 19]) == [-76]", "assert in_range_scaled([9, 60, -8, 58, -2, 37, 16, 21, 9, 33]) == [-232, -148, -132, -84]", "assert in_range_scaled([-12, 58, 53, 57, 39, 12, 2, -20]) == [-232, -228, -212, -156]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([56, 64, 16, 34, 19, 37, 33]) == [-224, -148, -136, -132, -76]\nassert in_range_scaled([26, 46, 44, 20]) == [-184, -176, -104, -80]\nassert in_range_scaled([10, 32]) == [-128]\nassert in_range_scaled([14, 22, 55, 44, -21, 22, 55, -13, 24, -18]) == [-220, -220, -176, -96, -88, -88]\nassert in_range_scaled([16, 19]) == [-76]\nassert in_range_scaled([9, 60, -8, 58, -2, 37, 16, 21, 9, 33]) == [-232, -148, -132, -84]\nassert in_range_scaled([-12, 58, 53, 57, 39, 12, 2, -20]) == [-232, -228, -212, -156]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 19 <= x <= 59)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 19 <= x <= 59)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 19 و59 (شاملًا الطرفين) في -4.\nمثال: `in_range_scaled([56, 64, 16, 34, 19, 37, 33])` يجب أن تُرجع `[-224, -148, -136, -132, -76]`.\nالجواب:", "qhash": "8471beeb805ef741"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ا'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ا».\nمثال: `letter_count('علم نهار فجر دفتر جبل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e4b4f9d44826dd84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([-23, -19, 40, 10, -12, 13]) == 40", "assert largest_div([-50, -40, -10]) == -10", "assert largest_div([1, 11, 21]) == None", "assert largest_div([-8, -25, -6, -19, 10, -17, 40, 40]) == 40", "assert largest_div([38, 11, 44, -19, 36]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([-23, -19, 40, 10, -12, 13]) == 40\nassert largest_div([-50, -40, -10]) == -10\nassert largest_div([1, 11, 21]) == None\nassert largest_div([-8, -25, -6, -19, 10, -17, 40, 40]) == 40\nassert largest_div([38, 11, 44, -19, 36]) == None\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 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 % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([-23, -19, 40, 10, -12, 13])` يُرجع `40`.\nالجواب:", "qhash": "ed29cdb80baf20fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([-25, 31, 37, 15, 20, 41]) == 20", "assert best_multiple([-30, -10, -40]) == -10", "assert best_multiple([1, 11, 21, 31]) == None", "assert best_multiple([10, -26, -17, 14, 12, 30]) == 30", "assert best_multiple([24, -16, 37, -42, 38, 48, 39, -46]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-25, 31, 37, 15, 20, 41]) == 20\nassert best_multiple([-30, -10, -40]) == -10\nassert best_multiple([1, 11, 21, 31]) == None\nassert best_multiple([10, -26, -17, 14, 12, 30]) == 30\nassert best_multiple([24, -16, 37, -42, 38, 48, 39, -46]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 == 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 % 10 == 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 % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `best_multiple([-25, 31, 37, 15, 20, 41])` يجب أن تُرجع `20`.\nالجواب:", "qhash": "fd68ce23639e46d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [-6, 1, 36, -2, -7, 3]\nprint(items[2:5])\nprint(items[::-1])\nprint(min(items[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [-6, 1, 36, -2, -7, 3]\nprint(items[2:5])\nprint(items[::-1])\nprint(min(items[2:5]))\n```\nالجواب:", "qhash": "a452eec911d6c6a2", "answer": "[36, -2, -7]\n[3, -7, -2, 36, 1, -6]\n-7", "completion": " الناتج:\n```text\n[36, -2, -7]\n[3, -7, -2, 36, 1, -6]\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 11", "tests": ["assert step_product(5) == 10", "assert step_product(44) == 0", "assert step_product(25) == 0", "assert step_product(2) == 2", "assert step_product(3) == 6", "assert step_product(23) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(5) == 10\nassert step_product(44) == 0\nassert step_product(25) == 0\nassert step_product(2) == 2\nassert step_product(3) == 6\nassert step_product(23) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 11", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(5)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "33e342877eb83dc1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 2", "tests": ["assert dig_pow_mod(64023) == 1", "assert dig_pow_mod(325880) == 0", "assert dig_pow_mod(840219) == 0", "assert dig_pow_mod(928701) == 1", "assert dig_pow_mod(722552) == 1", "assert dig_pow_mod(545464) == 0", "assert dig_pow_mod(801581) == 1", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(64023) == 1\nassert dig_pow_mod(325880) == 0\nassert dig_pow_mod(840219) == 0\nassert dig_pow_mod(928701) == 1\nassert dig_pow_mod(722552) == 1\nassert dig_pow_mod(545464) == 0\nassert dig_pow_mod(801581) == 1\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 2", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 2\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 2.\nللتوضيح: الاستدعاء `dig_pow_mod(64023)` يُرجع `1`.\nالجواب:", "qhash": "7ec1624d7069365d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_special([35, 83, 31, 69, 72, 16, 33]) == 0", "assert count_special([24, -31]) == 0", "assert count_special([8, 21, 10, -18, 14, 57, 7, -25, 58, -22, 62]) == 0", "assert count_special([74, 87, 21, 79, 71, 47, 52, 34]) == 0", "assert count_special([4, -29, 20, 68]) == 0", "assert count_special([21, -4, 7, 70, 4, 53, -27, -23]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([35, 83, 31, 69, 72, 16, 33]) == 0\nassert count_special([24, -31]) == 0\nassert count_special([8, 21, 10, -18, 14, 57, 7, -25, 58, -22, 62]) == 0\nassert count_special([74, 87, 21, 79, 71, 47, 52, 34]) == 0\nassert count_special([4, -29, 20, 68]) == 0\nassert count_special([21, -4, 7, 70, 4, 53, -27, -23]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 6 == 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 % 6 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([35, 83, 31, 69, 72, 16, 33])` يُرجع `0`.\nالجواب:", "qhash": "4b9f6762aadcbdd4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'و' in w)", "tests": ["assert count_ar('طائرة باب صديق') == 0", "assert count_ar('صحراء مطر معلم عربية برمجة شجرة') == 0", "assert count_ar('صديق برمجة') == 0", "assert count_ar('سيارة قمر كتاب ماء') == 0", "assert count_ar('فجر لغة وردة قلم نهار كتاب سوق') == 2", "assert count_ar('ليل ميناء قهوة قلم') == 1", "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('فجر لغة وردة قلم نهار كتاب سوق') == 2\nassert count_ar('ليل ميناء قهوة قلم') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «و» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('طائرة باب صديق')` يُرجع `0`.\nالجواب:", "qhash": "914a632736b1ffba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ر'):\n count += 1\n return count", "tests": ["assert count_initial('ليل كتاب نور شمس مدينة رمل') == 1", "assert count_initial('مطر صديق مطر ليل رمل قلم') == 1", "assert count_initial('رمل مدينة حديقة رمل صحراء سلام عمل نهار') == 2", "assert count_initial('رمل قمر باب مطر') == 1", "assert count_initial('نهر شمس مدرسة رمل') == 1", "assert count_initial('برتقال برمجة شجرة ماء برتقال') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('ليل كتاب نور شمس مدينة رمل') == 1\nassert count_initial('مطر صديق مطر ليل رمل قلم') == 1\nassert count_initial('رمل مدينة حديقة رمل صحراء سلام عمل نهار') == 2\nassert count_initial('رمل قمر باب مطر') == 1\nassert count_initial('نهر شمس مدرسة رمل') == 1\nassert count_initial('برتقال برمجة شجرة ماء برتقال') == 0\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ر'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(line):\n count = 0\n for w in line.split():\n if 'ر' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('ليل كتاب نور شمس مدينة رمل')` يُرجع `1`.\nالجواب:", "qhash": "f3b88ad192873b31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 8 * x ** 2 + (-1) * x + (-9)", "tests": ["assert quad(3) == 60", "assert quad(-2) == 25", "assert quad(8) == 495", "assert quad(-20) == 3211", "assert quad(5) == 186", "assert quad(15) == 1776", "assert quad(-2) == 25", "assert quad(0) == -9"], "test_code": "assert quad(3) == 60\nassert quad(-2) == 25\nassert quad(8) == 495\nassert quad(-20) == 3211\nassert quad(5) == 186\nassert quad(15) == 1776\nassert quad(-2) == 25\nassert quad(0) == -9", "answer": "def quad(x):\n return 8 * x ** 2 + (-1) * x + (-9)", "completion": " ```python\ndef quad(x):\n return 8 * x ** 2 + (-1) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 8x² - 1x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(3)` يُرجع `60`.\nالجواب:", "qhash": "6c2c10b270eb883d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 79537\ncount = 0\nwhile x > 11:\n x = x // 3\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 79537\ncount = 0\nwhile x > 11:\n x = x // 3\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "2023510c8b9d5325", "answer": "4 9", "completion": " الناتج:\n```text\n4 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('at OK') == 'xq OK'", "assert rotate_letters('brain') == 'yoxfk'", "assert rotate_letters('music is coffee') == 'jrpfz fp zlccbb'", "assert rotate_letters('light 2024') == 'ifdeq 2024'", "assert rotate_letters('of apple cloud cloud at 2024') == 'lc xmmib zilra zilra xq 2024'", "assert rotate_letters('stone window rocket rocket !') == 'pqlkb tfkalt olzhbq olzhbq !'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('at OK') == 'xq OK'\nassert rotate_letters('brain') == 'yoxfk'\nassert rotate_letters('music is coffee') == 'jrpfz fp zlccbb'\nassert rotate_letters('light 2024') == 'ifdeq 2024'\nassert rotate_letters('of apple cloud cloud at 2024') == 'lc xmmib zilra zilra xq 2024'\nassert rotate_letters('stone window rocket rocket !') == 'pqlkb tfkalt olzhbq olzhbq !'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('at OK')` يجب أن تُرجع `'xq OK'`.\nالجواب:", "qhash": "339572ee1e527736"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('by pixel rocket') == 'rocket'", "assert backwards('is falcon at data light in by') == 'falcon'", "assert backwards('on stone') == ''", "assert backwards('rocket matrix to') == 'matrix|rocket'", "assert backwards('') == ''", "assert backwards('is') == ''", "assert backwards('winter table river') == 'winter'"], "test_code": "assert backwards('by pixel rocket') == 'rocket'\nassert backwards('is falcon at data light in by') == 'falcon'\nassert backwards('on stone') == ''\nassert backwards('rocket matrix to') == 'matrix|rocket'\nassert backwards('') == ''\nassert backwards('is') == ''\nassert backwards('winter table river') == 'winter'", "answer": "def backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `backwards('by pixel rocket')` يُرجع `'rocket'`.\nالجواب:", "qhash": "078c09ddbed1715d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('music 2024') == 'rzxnh 2024'", "assert shift_letters('python orange by !') == 'udymts twfslj gd !'", "assert shift_letters('rocket vector cloud OK') == 'wthpjy ajhytw hqtzi OK'", "assert shift_letters('light data on brain 2024') == 'qnlmy ifyf ts gwfns 2024'", "assert shift_letters('vector') == 'ajhytw'", "assert shift_letters('desert engine brain data garden !') == 'ijxjwy jslnsj gwfns ifyf lfwijs !'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('music 2024') == 'rzxnh 2024'\nassert shift_letters('python orange by !') == 'udymts twfslj gd !'\nassert shift_letters('rocket vector cloud OK') == 'wthpjy ajhytw hqtzi OK'\nassert shift_letters('light data on brain 2024') == 'qnlmy ifyf ts gwfns 2024'\nassert shift_letters('vector') == 'ajhytw'\nassert shift_letters('desert engine brain data garden !') == 'ijxjwy jslnsj gwfns ifyf lfwijs !'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('music 2024')` يجب أن تُرجع `'rzxnh 2024'`.\nالجواب:", "qhash": "c472c67187190487"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 5 + -7 for x in range(2, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 5 + -7 for x in range(2, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a99925df910a5b9e", "answer": "[8, 18, 28, 38]\n4 92", "completion": " الناتج:\n```text\n[8, 18, 28, 38]\n4 92\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'mos'}", "tests": ["assert count_chars('is we python') == {'m': 0, 'o': 1, 's': 1}", "assert count_chars('vector go') == {'m': 0, 'o': 2, 's': 0}", "assert count_chars('it at winter summer light') == {'m': 2, 'o': 0, 's': 1}", "assert count_chars('apple cloud') == {'m': 0, 'o': 1, 's': 0}", "assert count_chars('stone data coffee vector coffee signal') == {'m': 0, 'o': 4, 's': 2}", "assert count_chars('desert go garden stone winter we') == {'m': 0, 'o': 2, 's': 2}", "assert count_chars('') == {'m': 0, 'o': 0, 's': 0}"], "test_code": "assert count_chars('is we python') == {'m': 0, 'o': 1, 's': 1}\nassert count_chars('vector go') == {'m': 0, 'o': 2, 's': 0}\nassert count_chars('it at winter summer light') == {'m': 2, 'o': 0, 's': 1}\nassert count_chars('apple cloud') == {'m': 0, 'o': 1, 's': 0}\nassert count_chars('stone data coffee vector coffee signal') == {'m': 0, 'o': 4, 's': 2}\nassert count_chars('desert go garden stone winter we') == {'m': 0, 'o': 2, 's': 2}\nassert count_chars('') == {'m': 0, 'o': 0, 's': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'mos'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'mos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'm'، 'o'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('is we python')` يجب أن تُرجع `{'m': 0, 'o': 1, 's': 1}`.\nالجواب:", "qhash": "16505c134aedad6f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(227) == 4592", "assert total_multiples(51) == 252", "assert total_multiples(200) == 3534", "assert total_multiples(81) == 594", "assert total_multiples(34) == 122", "assert total_multiples(104) == 960", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(227) == 4592\nassert total_multiples(51) == 252\nassert total_multiples(200) == 3534\nassert total_multiples(81) == 594\nassert total_multiples(34) == 122\nassert total_multiples(104) == 960\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 % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 14.\nمثال: `total_multiples(227)` يجب أن تُرجع `4592`.\nالجواب:", "qhash": "9123842a8041e040"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(15))\nprint(h(15, 9))\nprint(h(h(9), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(15))\nprint(h(15, 9))\nprint(h(h(9), 15))\n```\nالجواب:", "qhash": "cd5cc1bca1dd8102", "answer": "-22\n-24\n-31", "completion": " الناتج:\n```text\n-22\n-24\n-31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'حديقة'\nprint(s[-1])\nprint(s[0])\nprint('ح' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'حديقة'\nprint(s[-1])\nprint(s[0])\nprint('ح' in s)\n```\nالجواب:", "qhash": "8691a37b1912811b", "answer": "ة\nح\nTrue", "completion": " الناتج:\n```text\nة\nح\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-19, -2, -20, 4, 10, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-19, -2, -20, 4, 10, 18]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "10503ecd2c3979b9", "answer": "[18, 10, 4, -2, -19, -20]\n[18, 10, 4]", "completion": " الناتج:\n```text\n[18, 10, 4, -2, -19, -20]\n[18, 10, 4]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'camel'\nprint(name.count('l'))\nprint(name.replace('l', '0'))\nprint(name[1:5])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'camel'\nprint(name.count('l'))\nprint(name.replace('l', '0'))\nprint(name[1:5])\n```\nالجواب:", "qhash": "ab030425711df4eb", "answer": "1\ncame0\namel", "completion": " الناتج:\n```text\n1\ncame0\namel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)", "tests": ["assert sum_div(168) == 4620", "assert sum_div(156) == 3978", "assert sum_div(39) == 234", "assert sum_div(94) == 1488", "assert sum_div(284) == 13395", "assert sum_div(0) == 0", "assert sum_div(1) == 0"], "test_code": "assert sum_div(168) == 4620\nassert sum_div(156) == 3978\nassert sum_div(39) == 234\nassert sum_div(94) == 1488\nassert sum_div(284) == 13395\nassert sum_div(0) == 0\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 % 6 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 6.\nمثال: `sum_div(168)` يجب أن تُرجع `4620`.\nالجواب:", "qhash": "77b20206eeaa2a1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'brain_coffee'\nprint(name.replace('f', '*'))\nprint(name.index('f') + len(name))\nprint(name.count('f'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'brain_coffee'\nprint(name.replace('f', '*'))\nprint(name.index('f') + len(name))\nprint(name.count('f'))\n```\nالجواب:", "qhash": "ca3279aa15040167", "answer": "brain_co**ee\n20\n2", "completion": " الناتج:\n```text\nbrain_co**ee\n20\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-3, 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(-3, 0))\n```\nالجواب:", "qhash": "a51eaba926cbb0e7", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'سلمى': 36, 'حسن': 28, 'رنا': 14, 'خالد': 22, 'نور': 44}\nd['خالد'] += 14\nd['يوسف'] = 29\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 = {'سلمى': 36, 'حسن': 28, 'رنا': 14, 'خالد': 22, 'نور': 44}\nd['خالد'] += 14\nd['يوسف'] = 29\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": "22f357ba7696d3d1", "answer": "6\nنور\n187\n[('رنا', 14), ('حسن', 28)]", "completion": " الناتج:\n```text\n6\nنور\n187\n[('رنا', 14), ('حسن', 28)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total", "tests": ["assert weighted_sum(8) == 370656", "assert weighted_sum(7) == 174048", "assert weighted_sum(12) == 3784248", "assert weighted_sum(0) == 0", "assert weighted_sum(11) == 2291256", "assert weighted_sum(1) == 6", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 370656\nassert weighted_sum(7) == 174048\nassert weighted_sum(12) == 3784248\nassert weighted_sum(0) == 0\nassert weighted_sum(11) == 2291256\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 ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(8)` يُرجع `370656`.\nالجواب:", "qhash": "7939331651e892fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 6 * x ** 2 + (5) * x + (-6)", "tests": ["assert evaluate(7) == 323", "assert evaluate(10) == 644", "assert evaluate(-7) == 253", "assert evaluate(-3) == 33", "assert evaluate(6) == 240", "assert evaluate(-20) == 2294", "assert evaluate(-10) == 544", "assert evaluate(0) == -6"], "test_code": "assert evaluate(7) == 323\nassert evaluate(10) == 644\nassert evaluate(-7) == 253\nassert evaluate(-3) == 33\nassert evaluate(6) == 240\nassert evaluate(-20) == 2294\nassert evaluate(-10) == 544\nassert evaluate(0) == -6", "answer": "def evaluate(x):\n return 6 * x ** 2 + (5) * x + (-6)", "completion": " ```python\ndef evaluate(x):\n return 6 * x ** 2 + (5) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 6x² + 5x - 6 عند العدد الصحيح x.\nمثال: `evaluate(7)` يجب أن تُرجع `323`.\nالجواب:", "qhash": "48aa1b2d69078b97"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ر')", "tests": ["assert count_hits('سلام مدينة لغة ميناء') == 0", "assert count_hits('طائرة حاسوب سوق') == 1", "assert count_hits('لغة نهار عمل مدرسة حصان حاسوب دفتر') == 3", "assert count_hits('حاسوب ميناء شجرة حاسوب معلم باب مطر مدرسة') == 3", "assert count_hits('نهار') == 1", "assert count_hits('حاسوب صديق فجر بحر ماء وردة قمر ليل') == 4", "assert count_hits('نهر سوق سيارة شمس شجرة') == 3", "assert count_hits('') == 0"], "test_code": "assert count_hits('سلام مدينة لغة ميناء') == 0\nassert count_hits('طائرة حاسوب سوق') == 1\nassert count_hits('لغة نهار عمل مدرسة حصان حاسوب دفتر') == 3\nassert count_hits('حاسوب ميناء شجرة حاسوب معلم باب مطر مدرسة') == 3\nassert count_hits('نهار') == 1\nassert count_hits('حاسوب صديق فجر بحر ماء وردة قمر ليل') == 4\nassert count_hits('نهر سوق سيارة شمس شجرة') == 3\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": "debde010a74a3f71"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 2\n return total", "tests": ["assert scaled_powers(5) == 220", "assert scaled_powers(14) == 4060", "assert scaled_powers(10) == 1540", "assert scaled_powers(9) == 1140", "assert scaled_powers(11) == 2024", "assert scaled_powers(1) == 4", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(5) == 220\nassert scaled_powers(14) == 4060\nassert scaled_powers(10) == 1540\nassert scaled_powers(9) == 1140\nassert scaled_powers(11) == 2024\nassert scaled_powers(1) == 4\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 2\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 2\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 4 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(5)` يُرجع `220`.\nالجواب:", "qhash": "9c698eb095a2d12d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'crsu'}", "tests": ["assert char_counts('a an in rocket') == {'c': 1, 'r': 1, 's': 0, 'u': 0}", "assert char_counts('matrix signal') == {'c': 0, 'r': 1, 's': 1, 'u': 0}", "assert char_counts('orange at') == {'c': 0, 'r': 1, 's': 0, 'u': 0}", "assert char_counts('in up we at is stone') == {'c': 0, 'r': 0, 's': 2, 'u': 1}", "assert char_counts('in table') == {'c': 0, 'r': 0, 's': 0, 'u': 0}", "assert char_counts('we an code') == {'c': 1, 'r': 0, 's': 0, 'u': 0}", "assert char_counts('') == {'c': 0, 'r': 0, 's': 0, 'u': 0}"], "test_code": "assert char_counts('a an in rocket') == {'c': 1, 'r': 1, 's': 0, 'u': 0}\nassert char_counts('matrix signal') == {'c': 0, 'r': 1, 's': 1, 'u': 0}\nassert char_counts('orange at') == {'c': 0, 'r': 1, 's': 0, 'u': 0}\nassert char_counts('in up we at is stone') == {'c': 0, 'r': 0, 's': 2, 'u': 1}\nassert char_counts('in table') == {'c': 0, 'r': 0, 's': 0, 'u': 0}\nassert char_counts('we an code') == {'c': 1, 'r': 0, 's': 0, 'u': 0}\nassert char_counts('') == {'c': 0, 'r': 0, 's': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'crsu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'crsu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'r'، 's'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('a an in rocket')` يُرجع `{'c': 1, 'r': 1, 's': 0, 'u': 0}`.\nالجواب:", "qhash": "549041246c1dc574"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [-1, 27, 17, 32, 36, -1, 30, 38, 8]\nprint(nums[1:4])\nprint(nums[::2])\nprint(min(nums[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-1, 27, 17, 32, 36, -1, 30, 38, 8]\nprint(nums[1:4])\nprint(nums[::2])\nprint(min(nums[1:4]))\n```\nالجواب:", "qhash": "fd6afe9f6aac1c7b", "answer": "[27, 17, 32]\n[-1, 17, 36, 30, 8]\n17", "completion": " الناتج:\n```text\n[27, 17, 32]\n[-1, 17, 36, 30, 8]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 80", "tests": ["assert pow_digits(9575) == 20", "assert pow_digits(436957) == 56", "assert pow_digits(566917) == 68", "assert pow_digits(698352) == 59", "assert pow_digits(28465) == 65", "assert pow_digits(460178) == 6", "assert pow_digits(532794) == 24", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(9575) == 20\nassert pow_digits(436957) == 56\nassert pow_digits(566917) == 68\nassert pow_digits(698352) == 59\nassert pow_digits(28465) == 65\nassert pow_digits(460178) == 6\nassert pow_digits(532794) == 24\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 80", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 80\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 80.\nللتوضيح: الاستدعاء `pow_digits(9575)` يُرجع `20`.\nالجواب:", "qhash": "66672256bc23beda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('ليلى', 73), ('فيصل', 38), ('باسل', 48), ('سلمى', 82)]\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 = [('ليلى', 73), ('فيصل', 38), ('باسل', 48), ('سلمى', 82)]\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": "836d704cd7d2ad5f", "answer": "[('فيصل', 38), ('باسل', 48), ('ليلى', 73), ('سلمى', 82)]\n['سلمى', 'ليلى']", "completion": " الناتج:\n```text\n[('فيصل', 38), ('باسل', 48), ('ليلى', 73), ('سلمى', 82)]\n['سلمى', 'ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 59906\nc = 0\nwhile n > 13:\n n = n // 3\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 59906\nc = 0\nwhile n > 13:\n n = n // 3\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "d36603904a4f0e60", "answer": "9 8", "completion": " الناتج:\n```text\n9 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 180:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([82, 68, 13, 53, 82, 71]) == [82, 150, 163, 0, 82, 153]", "assert running_sum([4, 121]) == [4, 125]", "assert running_sum([80, 74, 63, 38, 3, 69, 155]) == [80, 154, 0, 38, 41, 110, 0]", "assert running_sum([75, 31]) == [75, 106]", "assert running_sum([12, 160, 111, 31, 54, 178]) == [12, 172, 0, 31, 85, 0]", "assert running_sum([120]) == [120]", "assert running_sum([]) == []"], "test_code": "assert running_sum([82, 68, 13, 53, 82, 71]) == [82, 150, 163, 0, 82, 153]\nassert running_sum([4, 121]) == [4, 125]\nassert running_sum([80, 74, 63, 38, 3, 69, 155]) == [80, 154, 0, 38, 41, 110, 0]\nassert running_sum([75, 31]) == [75, 106]\nassert running_sum([12, 160, 111, 31, 54, 178]) == [12, 172, 0, 31, 85, 0]\nassert running_sum([120]) == [120]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 180:\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 > 180:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 180 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([82, 68, 13, 53, 82, 71])` يجب أن تُرجع `[82, 150, 163, 0, 82, 153]`.\nالجواب:", "qhash": "838c21b9d1047665"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + 0 for x in range(5, 19) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + 0 for x in range(5, 19) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "8b282031263d49f5", "answer": "[0, 0, 0, 0]\n4 0", "completion": " الناتج:\n```text\n[0, 0, 0, 0]\n4 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)", "tests": ["assert multiples_total(120) == 1740", "assert multiples_total(98) == 1200", "assert multiples_total(181) == 4142", "assert multiples_total(90) == 1014", "assert multiples_total(145) == 2664", "assert multiples_total(58) == 422", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(120) == 1740\nassert multiples_total(98) == 1200\nassert multiples_total(181) == 4142\nassert multiples_total(90) == 1014\nassert multiples_total(145) == 2664\nassert multiples_total(58) == 422\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 % 8 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(120)` يُرجع `1740`.\nالجواب:", "qhash": "8527091dd8a7d46d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سلام طالب فجر تفاحة فجر برمجة') == 2", "assert count_initial('شجرة فجر حاسوب مدرسة فجر سلام') == 2", "assert count_initial('معلم قهوة فجر طائرة سيارة سماء') == 1", "assert count_initial('عربية برمجة ميناء مدرسة سوق معلم') == 0", "assert count_initial('لغة رمل كتاب حديقة رمل فجر') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('حاسوب نور حاسوب تفاحة دفتر ماء') == 0\nassert count_initial('سلام طالب فجر تفاحة فجر برمجة') == 2\nassert count_initial('شجرة فجر حاسوب مدرسة فجر سلام') == 2\nassert count_initial('معلم قهوة فجر طائرة سيارة سماء') == 1\nassert count_initial('عربية برمجة ميناء مدرسة سوق معلم') == 0\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:\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": "096882c66400db65"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 8 for x in range(-2, 13) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 8 for x in range(-2, 13) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ef0c84a588e6e35d", "answer": "[-4, 1, 56]\n3 53", "completion": " الناتج:\n```text\n[-4, 1, 56]\n3 53\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 7\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 = 7\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": "470e7ea74e3e60d5", "answer": "16", "completion": " الناتج:\n```text\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 194:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([72, 27, 21, 98, 70, 98, 56, 27, 97, 16]) == [72, 99, 120, 0, 70, 168, 0, 27, 124, 140]", "assert reset_sum([-10, 128]) == [-10, 118]", "assert reset_sum([121, 53, 104, 194, 90, 184, 60, 194]) == [121, 174, 0, 194, 0, 184, 0, 194]", "assert reset_sum([]) == []", "assert reset_sum([54, 15, 140, 160, 6, -9, 49, 58]) == [54, 69, 0, 160, 166, 157, 0, 58]", "assert reset_sum([120, 156, 189, 29, 37]) == [120, 0, 189, 0, 37]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([72, 27, 21, 98, 70, 98, 56, 27, 97, 16]) == [72, 99, 120, 0, 70, 168, 0, 27, 124, 140]\nassert reset_sum([-10, 128]) == [-10, 118]\nassert reset_sum([121, 53, 104, 194, 90, 184, 60, 194]) == [121, 174, 0, 194, 0, 184, 0, 194]\nassert reset_sum([]) == []\nassert reset_sum([54, 15, 140, 160, 6, -9, 49, 58]) == [54, 69, 0, 160, 166, 157, 0, 58]\nassert reset_sum([120, 156, 189, 29, 37]) == [120, 0, 189, 0, 37]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 194:\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 > 194:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 194 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([72, 27, 21, 98, 70, 98, 56, 27, 97, 16])` يُرجع `[72, 99, 120, 0, 70, 168, 0, 27, 124, 140]`.\nالجواب:", "qhash": "41a3a11205f31847"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ق'))", "tests": ["assert letter_hits('ليل خبز بيت حديقة كتاب قلم ميناء') == 1", "assert letter_hits('طالب دفتر سوق سيارة') == 0", "assert letter_hits('نهر سلام صحراء فجر شمس نهر كتاب شجرة') == 0", "assert letter_hits('نهر') == 0", "assert letter_hits('تفاحة رمل سيارة شمس مدرسة عربية') == 0", "assert letter_hits('') == 0", "assert letter_hits('قلم سلام مطر طالب معلم ميناء قمر') == 2", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('ليل خبز بيت حديقة كتاب قلم ميناء') == 1\nassert letter_hits('طالب دفتر سوق سيارة') == 0\nassert letter_hits('نهر سلام صحراء فجر شمس نهر كتاب شجرة') == 0\nassert letter_hits('نهر') == 0\nassert letter_hits('تفاحة رمل سيارة شمس مدرسة عربية') == 0\nassert letter_hits('') == 0\nassert letter_hits('قلم سلام مطر طالب معلم ميناء قمر') == 2\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ق'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ق'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق».\nمثال: `letter_hits('ليل خبز بيت حديقة كتاب قلم ميناء')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "185f545f63b66f0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 32, 'هشام': 46, 'منى': 1, 'باسل': 19}\npoints['يوسف'] += 3\npoints['هدى'] = 36\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 32, 'هشام': 46, 'منى': 1, 'باسل': 19}\npoints['يوسف'] += 3\npoints['هدى'] = 36\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))\n```\nالجواب:", "qhash": "d0687e465ecc9773", "answer": "5\nهشام\n137\n-1", "completion": " الناتج:\n```text\n5\nهشام\n137\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 43", "tests": ["assert step_product(5) == 34", "assert step_product(40) == 21", "assert step_product(59) == 0", "assert step_product(7) == 9", "assert step_product(28) == 29", "assert step_product(26) == 39", "assert step_product(0) == 1"], "test_code": "assert step_product(5) == 34\nassert step_product(40) == 21\nassert step_product(59) == 0\nassert step_product(7) == 9\nassert step_product(28) == 29\nassert step_product(26) == 39\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 43", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(5)` يُرجع `34`.\nالجواب:", "qhash": "287d6ba8a59c0bbe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -7 * x ** 2 + (6) * x + (2)", "tests": ["assert evaluate(2) == -14", "assert evaluate(-20) == -2918", "assert evaluate(1) == 1", "assert evaluate(-20) == -2918", "assert evaluate(-16) == -1886", "assert evaluate(2) == -14", "assert evaluate(-19) == -2639", "assert evaluate(0) == 2"], "test_code": "assert evaluate(2) == -14\nassert evaluate(-20) == -2918\nassert evaluate(1) == 1\nassert evaluate(-20) == -2918\nassert evaluate(-16) == -1886\nassert evaluate(2) == -14\nassert evaluate(-19) == -2639\nassert evaluate(0) == 2", "answer": "def evaluate(x):\n return -7 * x ** 2 + (6) * x + (2)", "completion": " ```python\ndef evaluate(x):\n return -7 * x ** 2 + (6) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -7x² + 6x + 2 عند العدد الصحيح x.\nمثال: `evaluate(2)` يجب أن تُرجع `-14`.\nالجواب:", "qhash": "31dbb3b9fe3d91ed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ق')", "tests": ["assert count_ar('حاسوب سلام سوق مكتبة قهوة رمل سفينة عمل') == 2", "assert count_ar('جمل حصان حديقة نهر بحر حصان شجرة عمل') == 1", "assert count_ar('تفاحة نهر طائرة طائرة برتقال مدرسة نهار سلام') == 1", "assert count_ar('قلم معلم شجرة لغة عمل بيت مطر ميناء') == 1", "assert count_ar('مكتبة مدرسة برمجة حاسوب رمل طائرة') == 0", "assert count_ar('برتقال جبل') == 1", "assert count_ar('نور كتاب عمل ميناء طالب علم') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('حاسوب سلام سوق مكتبة قهوة رمل سفينة عمل') == 2\nassert count_ar('جمل حصان حديقة نهر بحر حصان شجرة عمل') == 1\nassert count_ar('تفاحة نهر طائرة طائرة برتقال مدرسة نهار سلام') == 1\nassert count_ar('قلم معلم شجرة لغة عمل بيت مطر ميناء') == 1\nassert count_ar('مكتبة مدرسة برمجة حاسوب رمل طائرة') == 0\nassert count_ar('برتقال جبل') == 1\nassert count_ar('نور كتاب عمل ميناء طالب علم') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('ق')", "completion": " ```python\ndef count_ar(text):\n return text.count('ق')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `count_ar(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ق» في النص.\nمثال: `count_ar('حاسوب سلام سوق مكتبة قهوة رمل سفينة عمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "4c5c78df81903131"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 79", "tests": ["assert rec_prod(7) == 21", "assert rec_prod(15) == 68", "assert rec_prod(40) == 47", "assert rec_prod(31) == 11", "assert rec_prod(45) == 30", "assert rec_prod(14) == 21", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(7) == 21\nassert rec_prod(15) == 68\nassert rec_prod(40) == 47\nassert rec_prod(31) == 11\nassert rec_prod(45) == 30\nassert rec_prod(14) == 21\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 79", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(7)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "f05c8c1c66934bfc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 4\nfor x in range(3, 20, 4):\n s += x * 6\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 4\nfor x in range(3, 20, 4):\n s += x * 6\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "a6917d4e0480c2b7", "answer": "334\n19", "completion": " الناتج:\n```text\n334\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'د' in w)", "tests": ["assert count_ar('سماء فجر لغة') == 0", "assert count_ar('سماء') == 0", "assert count_ar('بحر بحر حصان باب') == 0", "assert count_ar('عمل ليل جبل مدينة نور برتقال') == 1", "assert count_ar('') == 0", "assert count_ar('قهوة جبل طالب رمل ليل لغة دفتر معلم') == 1", "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('عمل ليل جبل مدينة نور برتقال') == 1\nassert count_ar('') == 0\nassert count_ar('قهوة جبل طالب رمل ليل لغة دفتر معلم') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «د» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('سماء فجر لغة')` يُرجع `0`.\nالجواب:", "qhash": "ddb1e7349e566a32"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([43, 3, 48, 33, 18]) == [3, 48, 33, 18, 43]", "assert rotate_by([15, 13, 26, 24, 41, 7]) == [41, 7, 15, 13, 26, 24]", "assert rotate_by([-9, 43, -8, 40, 46]) == [43, -8, 40, 46, -9]", "assert rotate_by([9, 49, 20, 7, 25, 43, 43, -1, 37]) == [-1, 37, 9, 49, 20, 7, 25, 43, 43]", "assert rotate_by([39, 5, 6, 9, 14, 40, 36]) == [6, 9, 14, 40, 36, 39, 5]", "assert rotate_by([48]) == [48]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([43, 3, 48, 33, 18]) == [3, 48, 33, 18, 43]\nassert rotate_by([15, 13, 26, 24, 41, 7]) == [41, 7, 15, 13, 26, 24]\nassert rotate_by([-9, 43, -8, 40, 46]) == [43, -8, 40, 46, -9]\nassert rotate_by([9, 49, 20, 7, 25, 43, 43, -1, 37]) == [-1, 37, 9, 49, 20, 7, 25, 43, 43]\nassert rotate_by([39, 5, 6, 9, 14, 40, 36]) == [6, 9, 14, 40, 36, 39, 5]\nassert rotate_by([48]) == [48]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return ____\n```\nمثال: `rotate_by([43, 3, 48, 33, 18])` يجب أن تُرجع `[3, 48, 33, 18, 43]`.\nالجواب:", "qhash": "f1a2149691e22fa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['table', 'apple', 'orange', 'code', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['table', 'apple', 'orange', 'code', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3df5608fa50b3692", "answer": "['code', 'table', 'apple', 'stone', 'orange']\n['orange', 'table', 'stone']", "completion": " الناتج:\n```text\n['code', 'table', 'apple', 'stone', 'orange']\n['orange', 'table', 'stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [29, 10, 14, 24, 9, 21, 32, 8]\nprint(lst[2:8])\nprint(lst[::3])\nprint(len(lst[2:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [29, 10, 14, 24, 9, 21, 32, 8]\nprint(lst[2:8])\nprint(lst[::3])\nprint(len(lst[2:8]))\n```\nالجواب:", "qhash": "c61fe54017853ee7", "answer": "[14, 24, 9, 21, 32, 8]\n[29, 24, 32]\n6", "completion": " الناتج:\n```text\n[14, 24, 9, 21, 32, 8]\n[29, 24, 32]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -6 * x ** 2 + (-6) * x + (0)", "tests": ["assert p(7) == -336", "assert p(-7) == -252", "assert p(-5) == -120", "assert p(15) == -1440", "assert p(-13) == -936", "assert p(-3) == -36", "assert p(-13) == -936", "assert p(0) == 0"], "test_code": "assert p(7) == -336\nassert p(-7) == -252\nassert p(-5) == -120\nassert p(15) == -1440\nassert p(-13) == -936\nassert p(-3) == -36\nassert p(-13) == -936\nassert p(0) == 0", "answer": "def p(x):\n return -6 * x ** 2 + (-6) * x + (0)", "completion": " ```python\ndef p(x):\n return -6 * x ** 2 + (-6) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -6x² - 6x + 0 عند العدد الصحيح x.\nمثال: `p(7)` يجب أن تُرجع `-336`.\nالجواب:", "qhash": "5b5fb3cb2fb7d3b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'سعيد': 1, 'حسن': 19, 'يوسف': 39, 'نور': 9, 'فيصل': 21}\npoints['يوسف'] += 8\npoints['وليد'] = 11\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 = {'سعيد': 1, 'حسن': 19, 'يوسف': 39, 'نور': 9, 'فيصل': 21}\npoints['يوسف'] += 8\npoints['وليد'] = 11\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": "fdae887c8663b06a", "answer": "6\nيوسف\n108\n[('سعيد', 1), ('نور', 9)]", "completion": " الناتج:\n```text\n6\nيوسف\n108\n[('سعيد', 1), ('نور', 9)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 2 * x ** 2 + (3) * x + (2)", "tests": ["assert evaluate(2) == 16", "assert evaluate(-12) == 254", "assert evaluate(-4) == 22", "assert evaluate(-4) == 22", "assert evaluate(-17) == 529", "assert evaluate(-9) == 137", "assert evaluate(-5) == 37", "assert evaluate(0) == 2"], "test_code": "assert evaluate(2) == 16\nassert evaluate(-12) == 254\nassert evaluate(-4) == 22\nassert evaluate(-4) == 22\nassert evaluate(-17) == 529\nassert evaluate(-9) == 137\nassert evaluate(-5) == 37\nassert evaluate(0) == 2", "answer": "def evaluate(x):\n return 2 * x ** 2 + (3) * x + (2)", "completion": " ```python\ndef evaluate(x):\n return 2 * x ** 2 + (3) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 2x² + 3x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(2)` يُرجع `16`.\nالجواب:", "qhash": "690e9578465d20fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('cloud banana it') == 'bkntc azmzmz hs'", "assert caesar('garden at !') == 'fzqcdm zs !'", "assert caesar('apple summer cloud OK') == 'zookd rtlldq bkntc OK'", "assert caesar('by window') == 'ax vhmcnv'", "assert caesar('go coffee at at coffee') == 'fn bneedd zs zs bneedd'", "assert caesar('signal camel apple up up') == 'rhfmzk bzldk zookd to to'", "assert caesar('') == ''"], "test_code": "assert caesar('cloud banana it') == 'bkntc azmzmz hs'\nassert caesar('garden at !') == 'fzqcdm zs !'\nassert caesar('apple summer cloud OK') == 'zookd rtlldq bkntc OK'\nassert caesar('by window') == 'ax vhmcnv'\nassert caesar('go coffee at at coffee') == 'fn bneedd zs zs bneedd'\nassert caesar('signal camel apple up up') == 'rhfmzk bzldk zookd to to'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('cloud banana it')` يجب أن تُرجع `'bkntc azmzmz hs'`.\nالجواب:", "qhash": "20a80d157d09a403"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 3 * x ** 2 + (-5) * x + (5)", "tests": ["assert quad(6) == 83", "assert quad(-3) == 47", "assert quad(3) == 17", "assert quad(-7) == 187", "assert quad(1) == 3", "assert quad(19) == 993", "assert quad(19) == 993", "assert quad(0) == 5"], "test_code": "assert quad(6) == 83\nassert quad(-3) == 47\nassert quad(3) == 17\nassert quad(-7) == 187\nassert quad(1) == 3\nassert quad(19) == 993\nassert quad(19) == 993\nassert quad(0) == 5", "answer": "def quad(x):\n return 3 * x ** 2 + (-5) * x + (5)", "completion": " ```python\ndef quad(x):\n return 3 * x ** 2 + (-5) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 3x² - 5x + 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(6)` يُرجع `83`.\nالجواب:", "qhash": "04864b41b5810a4f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 8\nfor i in range(7, 32, 2):\n total -= i * 5\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 8\nfor i in range(7, 32, 2):\n total -= i * 5\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "dbf578f8d9773e26", "answer": "-1227\n31", "completion": " الناتج:\n```text\n-1227\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 7", "tests": ["assert prod_mod(10) == 0", "assert prod_mod(18) == 0", "assert prod_mod(11) == 0", "assert prod_mod(18) == 0", "assert prod_mod(9) == 0", "assert prod_mod(53) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(10) == 0\nassert prod_mod(18) == 0\nassert prod_mod(11) == 0\nassert prod_mod(18) == 0\nassert prod_mod(9) == 0\nassert prod_mod(53) == 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)) % 7", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(10)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "589f855069e8d0d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(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_special([44, 27, 15, 71, 82, 59, 34, 64]) == 0", "assert count_special([37, 50, 37, 67, 84, 39, 65, 0, 60]) == 0", "assert count_special([29, -8, 8, 31, 73, 67, -26, 67, -9, 42]) == 1", "assert count_special([-39, 12, 11, 35, -27]) == 0", "assert count_special([1, 32]) == 0", "assert count_special([49, 62, 90, 12, 24, -27, 28, 47, 43]) == 1", "assert count_special([]) == 0"], "test_code": "assert count_special([44, 27, 15, 71, 82, 59, 34, 64]) == 0\nassert count_special([37, 50, 37, 67, 84, 39, 65, 0, 60]) == 0\nassert count_special([29, -8, 8, 31, 73, 67, -26, 67, -9, 42]) == 1\nassert count_special([-39, 12, 11, 35, -27]) == 0\nassert count_special([1, 32]) == 0\nassert count_special([49, 62, 90, 12, 24, -27, 28, 47, 43]) == 1\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_special([44, 27, 15, 71, 82, 59, 34, 64])` يُرجع `0`.\nالجواب:", "qhash": "2b16d0ef725a7f75"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(20) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong']", "assert game(8) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping']", "assert game(20) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong']", "assert game(4) == ['1', '2', '3', 'Ping']", "assert game(23) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23']"], "test_code": "assert game(20) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong']\nassert game(8) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping']\nassert game(20) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong']\nassert game(4) == ['1', '2', '3', 'Ping']\nassert game(23) == ['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\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 % 4 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 5 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(20)` يجب أن تُرجع `['1', '2', '3', 'Ping', 'Pong', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', 'Pong', 'Ping', '17', '18', '19', 'PingPong']`.\nالجواب:", "qhash": "9bd32c887de39cb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['cloud', 'python', 'signal', 'engine', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['cloud', 'python', 'signal', 'engine', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "60fec365f88995bc", "answer": "['cloud', 'python', 'signal', 'engine', 'desert']\n['signal', 'python', 'engine']", "completion": " الناتج:\n```text\n['cloud', 'python', 'signal', 'engine', 'desert']\n['signal', 'python', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ر')", "tests": ["assert letter_hits('صحراء دفتر رمل') == 3", "assert letter_hits('برتقال قهوة صديق لغة رمل حصان مدينة') == 2", "assert letter_hits('نور كتاب كتاب') == 1", "assert letter_hits('') == 0", "assert letter_hits('وردة بحر نهر') == 3", "assert letter_hits('جمل باب') == 0", "assert letter_hits('ميناء باب خبز بحر شجرة رمل') == 3", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('صحراء دفتر رمل') == 3\nassert letter_hits('برتقال قهوة صديق لغة رمل حصان مدينة') == 2\nassert letter_hits('نور كتاب كتاب') == 1\nassert letter_hits('') == 0\nassert letter_hits('وردة بحر نهر') == 3\nassert letter_hits('جمل باب') == 0\nassert letter_hits('ميناء باب خبز بحر شجرة رمل') == 3\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)` بحيث تُعيد عدد مرات ظهور الحرف «ر» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('صحراء دفتر رمل')` يُرجع `3`.\nالجواب:", "qhash": "586a3013de973301"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 9 <= x <= 29)", "tests": ["assert pick_between([10, 37, 35, 14]) == [20, 28]", "assert pick_between([23, 32, 41, -24]) == [46]", "assert pick_between([53, 8, 3, 33, -25, -10, 45, 9]) == [18]", "assert pick_between([13, -18, -21, -6, 4, 49, -17, 19, -5]) == [26, 38]", "assert pick_between([-21, 13, 55, 39]) == [26]", "assert pick_between([-12, 11, 30, 21]) == [22, 42]", "assert pick_between([-1, 31, -11, 43, -7, -28, -28, 24]) == [48]", "assert pick_between([]) == []"], "test_code": "assert pick_between([10, 37, 35, 14]) == [20, 28]\nassert pick_between([23, 32, 41, -24]) == [46]\nassert pick_between([53, 8, 3, 33, -25, -10, 45, 9]) == [18]\nassert pick_between([13, -18, -21, -6, 4, 49, -17, 19, -5]) == [26, 38]\nassert pick_between([-21, 13, 55, 39]) == [26]\nassert pick_between([-12, 11, 30, 21]) == [22, 42]\nassert pick_between([-1, 31, -11, 43, -7, -28, -28, 24]) == [48]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 9 <= x <= 29)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if 9 <= x <= 29)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 9 و29 (شاملًا الطرفين) في 2.\nمثال: `pick_between([10, 37, 35, 14])` يجب أن تُرجع `[20, 28]`.\nالجواب:", "qhash": "f6e375bc2e318cac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 3 for x in range(3, 11) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 3 for x in range(3, 11) if x % 4 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a32c43637612f671", "answer": "[13, 61]\n2 74", "completion": " الناتج:\n```text\n[13, 61]\n2 74\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -15 <= x <= 11)", "tests": ["assert in_range_scaled([-10, 1, -4, 5, 9, 21, -13, -3, -13]) == [-18, -10, -2, 6, 8, 20, 26, 26]", "assert in_range_scaled([48, 0, 30, 24, -26, 19, 20, 20, 36]) == [0]", "assert in_range_scaled([30, 13, 34, 6, -29, -16]) == [-12]", "assert in_range_scaled([9, 42, 10]) == [-20, -18]", "assert in_range_scaled([]) == []", "assert in_range_scaled([8]) == [-16]", "assert in_range_scaled([]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-10, 1, -4, 5, 9, 21, -13, -3, -13]) == [-18, -10, -2, 6, 8, 20, 26, 26]\nassert in_range_scaled([48, 0, 30, 24, -26, 19, 20, 20, 36]) == [0]\nassert in_range_scaled([30, 13, 34, 6, -29, -16]) == [-12]\nassert in_range_scaled([9, 42, 10]) == [-20, -18]\nassert in_range_scaled([]) == []\nassert in_range_scaled([8]) == [-16]\nassert in_range_scaled([]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -15 <= x <= 11)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -15 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -15 ≤ x ≤ 11، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([-10, 1, -4, 5, 9, 21, -13, -3, -13])` يُرجع `[-18, -10, -2, 6, 8, 20, 26, 26]`.\nالجواب:", "qhash": "17f9ebb7819fae23"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 86", "tests": ["assert digit_score(21780) == 72", "assert digit_score(271241) == 9", "assert digit_score(672375) == 70", "assert digit_score(24849) == 71", "assert digit_score(74121) == 63", "assert digit_score(742421) == 0", "assert digit_score(413758) == 46", "assert digit_score(0) == 0"], "test_code": "assert digit_score(21780) == 72\nassert digit_score(271241) == 9\nassert digit_score(672375) == 70\nassert digit_score(24849) == 71\nassert digit_score(74121) == 63\nassert digit_score(742421) == 0\nassert digit_score(413758) == 46\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 86", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 86\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 86.\nللتوضيح: الاستدعاء `digit_score(21780)` يُرجع `72`.\nالجواب:", "qhash": "81aa4e35826801f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('engine planet brain we code') == 'vexzev gcrevk sirze nv tfuv'", "assert cipher('table go') == 'krscv xf'", "assert cipher('window we on garden !') == 'nzeufn nv fe xriuve !'", "assert cipher('by matrix at by') == 'sp drkizo rk sp'", "assert cipher('signal music banana of on') == 'jzxerc dljzt srerer fw fe'", "assert cipher('matrix') == 'drkizo'", "assert cipher('') == ''"], "test_code": "assert cipher('engine planet brain we code') == 'vexzev gcrevk sirze nv tfuv'\nassert cipher('table go') == 'krscv xf'\nassert cipher('window we on garden !') == 'nzeufn nv fe xriuve !'\nassert cipher('by matrix at by') == 'sp drkizo rk sp'\nassert cipher('signal music banana of on') == 'jzxerc dljzt srerer fw fe'\nassert cipher('matrix') == 'drkizo'\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 + (17)) % 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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('engine planet brain we code')` يجب أن تُرجع `'vexzev gcrevk sirze nv tfuv'`.\nالجواب:", "qhash": "81b2a02a4d1e6e5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_sel([13, 84, 77, 32, 20, 21, 58, 78]) == 2", "assert count_sel([10, 16, -12, -28, 80, 85, 22]) == 2", "assert count_sel([-36, -31, 59, 18, 31, 8, 79, 1, -10]) == 1", "assert count_sel([-4, 79, -13, 14, 55, -40, -13, 66, 14, 33, 52, 83]) == 2", "assert count_sel([45, 88, 1, 84, -19]) == 1", "assert count_sel([5, 84, 62, 78, -9, 63]) == 1", "assert count_sel([]) == 0"], "test_code": "assert count_sel([13, 84, 77, 32, 20, 21, 58, 78]) == 2\nassert count_sel([10, 16, -12, -28, 80, 85, 22]) == 2\nassert count_sel([-36, -31, 59, 18, 31, 8, 79, 1, -10]) == 1\nassert count_sel([-4, 79, -13, 14, 55, -40, -13, 66, 14, 33, 52, 83]) == 2\nassert count_sel([45, 88, 1, 84, -19]) == 1\nassert count_sel([5, 84, 62, 78, -9, 63]) == 1\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([13, 84, 77, 32, 20, 21, 58, 78])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "2f089a6ec0fb5316"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 16\nfor n in range(6, 18, 2):\n acc += n * 1\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 16\nfor n in range(6, 18, 2):\n acc += n * 1\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "4637916e8fa1a9ba", "answer": "82\n16", "completion": " الناتج:\n```text\n82\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'مدينة سوق'\nprint(s.split())\nprint(s[::-1])\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'مدينة سوق'\nprint(s.split())\nprint(s[::-1])\nprint(s[-1])\n```\nالجواب:", "qhash": "e3aa4d370cb3a1ca", "answer": "['مدينة', 'سوق']\nقوس ةنيدم\nق", "completion": " الناتج:\n```text\n['مدينة', 'سوق']\nقوس ةنيدم\nق\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('شجرة علم كتاب') == 0", "assert count_in_text('قلم ليل حاسوب مدرسة معلم كتاب') == 0", "assert count_in_text('عمل برمجة ليل شجرة') == 0", "assert count_in_text('') == 0", "assert count_in_text('ميناء كتاب قمر مدينة شمس صديق مطر شجرة') == 2", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('فجر حاسوب نهر ميناء') == 2\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('ميناء كتاب قمر مدينة شمس صديق مطر شجرة') == 2\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": "4c6b08939df12e7b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [24, 38, 24, 22, 37, -9]\nprint(data[2:6])\nprint(data[::-1])\nprint(len(data[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [24, 38, 24, 22, 37, -9]\nprint(data[2:6])\nprint(data[::-1])\nprint(len(data[2:6]))\n```\nالجواب:", "qhash": "f262842fc54e96d5", "answer": "[24, 22, 37, -9]\n[-9, 37, 22, 24, 38, 24]\n4", "completion": " الناتج:\n```text\n[24, 22, 37, -9]\n[-9, 37, 22, 24, 38, 24]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(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 game(28) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi', '22', '23', 'Yo', '25', '26', '27', 'Hi']", "assert game(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']", "assert game(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']", "assert game(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 game(6) == ['1', '2', '3', '4', '5', '6']"], "test_code": "assert game(28) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi', '22', '23', 'Yo', '25', '26', '27', 'Hi']\nassert game(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']\nassert game(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']\nassert game(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 game(6) == ['1', '2', '3', '4', '5', '6']", "answer": "def game(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 game(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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Hi'، وعلى 8 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(28)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi', '22', '23', 'Yo', '25', '26', '27', 'Hi']`.\nالجواب:", "qhash": "69f03124c1510600"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cde'}", "tests": ["assert freq_of('go to') == {'c': 0, 'd': 0, 'e': 0}", "assert freq_of('banana') == {'c': 0, 'd': 0, 'e': 0}", "assert freq_of('is up coffee brain') == {'c': 1, 'd': 0, 'e': 2}", "assert freq_of('at winter an brain engine') == {'c': 0, 'd': 0, 'e': 3}", "assert freq_of('summer music in it garden falcon') == {'c': 2, 'd': 1, 'e': 2}", "assert freq_of('coffee') == {'c': 1, 'd': 0, 'e': 2}", "assert freq_of('') == {'c': 0, 'd': 0, 'e': 0}"], "test_code": "assert freq_of('go to') == {'c': 0, 'd': 0, 'e': 0}\nassert freq_of('banana') == {'c': 0, 'd': 0, 'e': 0}\nassert freq_of('is up coffee brain') == {'c': 1, 'd': 0, 'e': 2}\nassert freq_of('at winter an brain engine') == {'c': 0, 'd': 0, 'e': 3}\nassert freq_of('summer music in it garden falcon') == {'c': 2, 'd': 1, 'e': 2}\nassert freq_of('coffee') == {'c': 1, 'd': 0, 'e': 2}\nassert freq_of('') == {'c': 0, 'd': 0, 'e': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cde'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cde'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'd'، 'e' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('go to')` يجب أن تُرجع `{'c': 0, 'd': 0, 'e': 0}`.\nالجواب:", "qhash": "f628a4bc8881ce91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ك')", "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 text.count('ك')", "completion": " ```python\ndef count_ar(text):\n return text.count('ك')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `count_ar(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ك» في النص.\nمثال: `count_ar('باب برمجة عمل مدينة ماء سوق قمر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "0d280b5d5bb91fc2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [21, 32, -17, 7, 30, -6, -11]\nprint(sorted(nums, key=lambda x: (abs(x - 26), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [21, 32, -17, 7, 30, -6, -11]\nprint(sorted(nums, key=lambda x: (abs(x - 26), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "eee558885388481b", "answer": "[30, 21, 32, 7, -6, -11, -17]\n[32, 30, 21]", "completion": " الناتج:\n```text\n[30, 21, 32, 7, -6, -11, -17]\n[32, 30, 21]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 20\nfor i in range(-5, 13, 2):\n acc += i * 2\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 20\nfor i in range(-5, 13, 2):\n acc += i * 2\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "6cd87b85e8c71b98", "answer": "74\n11", "completion": " الناتج:\n```text\n74\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -6 * x ** 2 + (-9) * x + (3)", "tests": ["assert value_at(6) == -267", "assert value_at(-16) == -1389", "assert value_at(-17) == -1578", "assert value_at(-8) == -309", "assert value_at(-13) == -894", "assert value_at(-15) == -1212", "assert value_at(-2) == -3", "assert value_at(0) == 3"], "test_code": "assert value_at(6) == -267\nassert value_at(-16) == -1389\nassert value_at(-17) == -1578\nassert value_at(-8) == -309\nassert value_at(-13) == -894\nassert value_at(-15) == -1212\nassert value_at(-2) == -3\nassert value_at(0) == 3", "answer": "def value_at(x):\n return -6 * x ** 2 + (-9) * x + (3)", "completion": " ```python\ndef value_at(x):\n return -6 * x ** 2 + (-9) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -6x² - 9x + 3 عند العدد الصحيح x.\nمثال: `value_at(6)` يجب أن تُرجع `-267`.\nالجواب:", "qhash": "454a9a53be47b71e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "tests": ["assert sum_terms(4) == 800", "assert sum_terms(11) == 34848", "assert sum_terms(15) == 115200", "assert sum_terms(4) == 800", "assert sum_terms(9) == 16200", "assert sum_terms(1) == 8", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 800\nassert sum_terms(11) == 34848\nassert sum_terms(15) == 115200\nassert sum_terms(4) == 800\nassert sum_terms(9) == 16200\nassert sum_terms(1) == 8\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `800`.\nالجواب:", "qhash": "8858fcbfca34250b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 6 * x ** 2 + (-9) * x + (5)", "tests": ["assert evaluate(6) == 167", "assert evaluate(2) == 11", "assert evaluate(-17) == 1892", "assert evaluate(-4) == 137", "assert evaluate(-6) == 275", "assert evaluate(6) == 167", "assert evaluate(2) == 11", "assert evaluate(0) == 5"], "test_code": "assert evaluate(6) == 167\nassert evaluate(2) == 11\nassert evaluate(-17) == 1892\nassert evaluate(-4) == 137\nassert evaluate(-6) == 275\nassert evaluate(6) == 167\nassert evaluate(2) == 11\nassert evaluate(0) == 5", "answer": "def evaluate(x):\n return 6 * x ** 2 + (-9) * x + (5)", "completion": " ```python\ndef evaluate(x):\n return 6 * x ** 2 + (-9) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 6x² - 9x + 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(6)` يُرجع `167`.\nالجواب:", "qhash": "0b52c92edfa1968e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return sum(1 for w in text.split() if w.startswith('ب'))", "tests": ["assert count_letter('برمجة قمر حديقة طائرة سلام بيت سفينة') == 2", "assert count_letter('مدينة عربية كتاب ليل') == 0", "assert count_letter('نهار') == 0", "assert count_letter('مكتبة دفتر طالب خبز جبل') == 0", "assert count_letter('') == 0", "assert count_letter('باب ميناء نهار بيت مدينة') == 2", "assert count_letter('شجرة حديقة لغة حاسوب فجر') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('برمجة قمر حديقة طائرة سلام بيت سفينة') == 2\nassert count_letter('مدينة عربية كتاب ليل') == 0\nassert count_letter('نهار') == 0\nassert count_letter('مكتبة دفتر طالب خبز جبل') == 0\nassert count_letter('') == 0\nassert count_letter('باب ميناء نهار بيت مدينة') == 2\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('برمجة قمر حديقة طائرة سلام بيت سفينة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "6c68f2cbdc3711bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(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 cumulative([1, 31, 24, 14, 19, 11, 12]) == [1, 32, 56, 70, 0, 11, 23]", "assert cumulative([27, 57, 39, 11, 28, 30, 24, -10]) == [27, 0, 39, 50, 0, 30, 54, 44]", "assert cumulative([18, 56, 73, 42, 24, -2, 61]) == [18, 74, 0, 42, 66, 64, 0]", "assert cumulative([-1, 15, -10, 58, 41, 45, 46]) == [-1, 14, 4, 62, 0, 45, 0]", "assert cumulative([66, 69, -3, 76, 60, 10]) == [66, 0, -3, 73, 0, 10]", "assert cumulative([23]) == [23]", "assert cumulative([]) == []"], "test_code": "assert cumulative([1, 31, 24, 14, 19, 11, 12]) == [1, 32, 56, 70, 0, 11, 23]\nassert cumulative([27, 57, 39, 11, 28, 30, 24, -10]) == [27, 0, 39, 50, 0, 30, 54, 44]\nassert cumulative([18, 56, 73, 42, 24, -2, 61]) == [18, 74, 0, 42, 66, 64, 0]\nassert cumulative([-1, 15, -10, 58, 41, 45, 46]) == [-1, 14, 4, 62, 0, 45, 0]\nassert cumulative([66, 69, -3, 76, 60, 10]) == [66, 0, -3, 73, 0, 10]\nassert cumulative([23]) == [23]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 77 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([1, 31, 24, 14, 19, 11, 12])` يجب أن تُرجع `[1, 32, 56, 70, 0, 11, 23]`.\nالجواب:", "qhash": "211a03f0cbe4f4bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -1 * x ** 2 + (-7) * x + (-6)", "tests": ["assert p(5) == -66", "assert p(18) == -456", "assert p(-14) == -104", "assert p(18) == -456", "assert p(-8) == -14", "assert p(1) == -14", "assert p(-5) == 4", "assert p(0) == -6"], "test_code": "assert p(5) == -66\nassert p(18) == -456\nassert p(-14) == -104\nassert p(18) == -456\nassert p(-8) == -14\nassert p(1) == -14\nassert p(-5) == 4\nassert p(0) == -6", "answer": "def p(x):\n return -1 * x ** 2 + (-7) * x + (-6)", "completion": " ```python\ndef p(x):\n return -1 * x ** 2 + (-7) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -1x² - 7x - 6 عند العدد الصحيح x.\nمثال: `p(5)` يجب أن تُرجع `-66`.\nالجواب:", "qhash": "7881850bfb8f4612"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "tests": ["assert total_multiples(267) == 5535", "assert total_multiples(287) == 6369", "assert total_multiples(133) == 1350", "assert total_multiples(16) == 24", "assert total_multiples(221) == 3825", "assert total_multiples(192) == 2799", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(267) == 5535\nassert total_multiples(287) == 6369\nassert total_multiples(133) == 1350\nassert total_multiples(16) == 24\nassert total_multiples(221) == 3825\nassert total_multiples(192) == 2799\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 % 15 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 15.\nمثال: `total_multiples(267)` يجب أن تُرجع `5535`.\nالجواب:", "qhash": "b164a1e164afc2b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 11 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18', '19', '20', 'Ping', 'Pong', '23', '24', '25', '26']", "assert fizz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18', '19', '20', 'Ping', 'Pong']", "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']", "assert fizz(1) == ['1']", "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']"], "test_code": "assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18', '19', '20', 'Ping', 'Pong', '23', '24', '25', '26']\nassert fizz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18', '19', '20', 'Ping', 'Pong']\nassert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']\nassert fizz(1) == ['1']\nassert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Ping'، وعلى 11 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(26)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', '10', 'Pong', '12', '13', 'Ping', '15', '16', '17', '18', '19', '20', 'Ping', 'Pong', '23', '24', '25', '26']`.\nالجواب:", "qhash": "edd7d5c46213f9bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ت')", "tests": ["assert letter_hits('قمر شمس طائرة قهوة') == 0", "assert letter_hits('بيت جمل برمجة حديقة') == 1", "assert letter_hits('') == 0", "assert letter_hits('جمل ميناء حديقة نهر دفتر علم ماء مدرسة') == 1", "assert letter_hits('نهر طالب طالب عمل') == 0", "assert letter_hits('مدينة مكتبة') == 1", "assert letter_hits('رمل') == 0", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('قمر شمس طائرة قهوة') == 0\nassert letter_hits('بيت جمل برمجة حديقة') == 1\nassert letter_hits('') == 0\nassert letter_hits('جمل ميناء حديقة نهر دفتر علم ماء مدرسة') == 1\nassert letter_hits('نهر طالب طالب عمل') == 0\nassert letter_hits('مدينة مكتبة') == 1\nassert letter_hits('رمل') == 0\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)` بحيث تُعيد عدد مرات ظهور الحرف «ت» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('قمر شمس طائرة قهوة')` يُرجع `0`.\nالجواب:", "qhash": "38df4d9e3ec8585d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(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 max_div([6, 26, 48, 5, 54, 32, -23, 58, -9]) == 48", "assert max_div([-24, -36, -24]) == -24", "assert max_div([1]) == None", "assert max_div([-1, -40, 2, -1, -33, -18, 0, 16]) == 0", "assert max_div([10, -48, 44, -23]) == -48", "assert max_div([]) == None"], "test_code": "assert max_div([6, 26, 48, 5, 54, 32, -23, 58, -9]) == 48\nassert max_div([-24, -36, -24]) == -24\nassert max_div([1]) == None\nassert max_div([-1, -40, 2, -1, -33, -18, 0, 16]) == 0\nassert max_div([10, -48, 44, -23]) == -48\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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 max_div(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مثال: `max_div([6, 26, 48, 5, 54, 32, -23, 58, -9])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "d3894bd80dc7bbba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('جبل عربية قلم فجر قمر ميناء معلم قهوة') == 3", "assert count_start('دفتر ميناء قلم برمجة قلم جمل وردة قهوة') == 3", "assert count_start('قلم باب سوق معلم قمر عربية') == 2", "assert count_start('صحراء كتاب قلم') == 1", "assert count_start('طائرة حديقة برمجة قمر') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('برتقال كتاب قمر قلم باب') == 2\nassert count_start('جبل عربية قلم فجر قمر ميناء معلم قهوة') == 3\nassert count_start('دفتر ميناء قلم برمجة قلم جمل وردة قهوة') == 3\nassert count_start('قلم باب سوق معلم قمر عربية') == 2\nassert count_start('صحراء كتاب قلم') == 1\nassert count_start('طائرة حديقة برمجة قمر') == 1\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": "1f7dc4b6da7b13ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-3, 3, 2, 13, 4, 28, 6]\nprint(a[3:5])\nprint(a[::-2])\nprint(sum(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-3, 3, 2, 13, 4, 28, 6]\nprint(a[3:5])\nprint(a[::-2])\nprint(sum(a[3:5]))\n```\nالجواب:", "qhash": "d1559d6fc0424d7f", "answer": "[13, 4]\n[6, 4, 2, -3]\n17", "completion": " الناتج:\n```text\n[13, 4]\n[6, 4, 2, -3]\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('خبز امل عمل قهوة قهوة نور') == 1", "assert starts_count('مطر امل خبز طالب مدينة وردة جمل امل') == 2", "assert starts_count('سفينة رمل نهار امل مدرسة خبز قهوة امل') == 2", "assert starts_count('قمر لغة جبل') == 0", "assert starts_count('حديقة دفتر برتقال بيت برتقال معلم') == 0", "assert starts_count('معلم علم برتقال جمل جمل') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('خبز امل عمل قهوة قهوة نور') == 1\nassert starts_count('مطر امل خبز طالب مدينة وردة جمل امل') == 2\nassert starts_count('سفينة رمل نهار امل مدرسة خبز قهوة امل') == 2\nassert starts_count('قمر لغة جبل') == 0\nassert starts_count('حديقة دفتر برتقال بيت برتقال معلم') == 0\nassert starts_count('معلم علم برتقال جمل جمل') == 0\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 w.endswith('ا'):\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 w.endswith('ا'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('خبز امل عمل قهوة قهوة نور')` يُرجع `1`.\nالجواب:", "qhash": "3135941948d2bec2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([-6, -3, -27, 27, -12]) == None", "assert best_multiple([-15, -25, -5]) == -5", "assert best_multiple([1, 6, 11, 16]) == None", "assert best_multiple([-33, 15, 11, -5, -20, -17]) == 15", "assert best_multiple([-14, 39, -9, 44, -45, -30, -40, -30]) == -30", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-6, -3, -27, 27, -12]) == None\nassert best_multiple([-15, -25, -5]) == -5\nassert best_multiple([1, 6, 11, 16]) == None\nassert best_multiple([-33, 15, 11, -5, -20, -17]) == 15\nassert best_multiple([-14, 39, -9, 44, -45, -30, -40, -30]) == -30\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([-6, -3, -27, 27, -12])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "e1545b423d4acf68"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'bo'}", "tests": ["assert char_freq('signal it falcon summer rocket') == {'b': 0, 'o': 2}", "assert char_freq('river of') == {'b': 0, 'o': 1}", "assert char_freq('it python garden orange') == {'b': 0, 'o': 2}", "assert char_freq('code window music is camel stone') == {'b': 0, 'o': 3}", "assert char_freq('window') == {'b': 0, 'o': 1}", "assert char_freq('signal') == {'b': 0, 'o': 0}", "assert char_freq('') == {'b': 0, 'o': 0}"], "test_code": "assert char_freq('signal it falcon summer rocket') == {'b': 0, 'o': 2}\nassert char_freq('river of') == {'b': 0, 'o': 1}\nassert char_freq('it python garden orange') == {'b': 0, 'o': 2}\nassert char_freq('code window music is camel stone') == {'b': 0, 'o': 3}\nassert char_freq('window') == {'b': 0, 'o': 1}\nassert char_freq('signal') == {'b': 0, 'o': 0}\nassert char_freq('') == {'b': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'bo'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'bo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('signal it falcon summer rocket')` يجب أن تُرجع `{'b': 0, 'o': 2}`.\nالجواب:", "qhash": "70a6ac1c4e460d73"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('وردة حاسوب وردة تفاحة') == 2", "assert begin_count('وردة طالب علم وردة عمل عمل وردة') == 3", "assert begin_count('قمر ماء حديقة مكتبة مدينة عمل') == 0", "assert begin_count('باب وردة قلم شمس مدينة حصان نهر') == 1", "assert begin_count('طائرة جبل طائرة بيت وردة نهار وردة مدينة') == 2", "assert begin_count('عمل برمجة مكتبة عربية سلام معلم وردة') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('وردة حاسوب وردة تفاحة') == 2\nassert begin_count('وردة طالب علم وردة عمل عمل وردة') == 3\nassert begin_count('قمر ماء حديقة مكتبة مدينة عمل') == 0\nassert begin_count('باب وردة قلم شمس مدينة حصان نهر') == 1\nassert begin_count('طائرة جبل طائرة بيت وردة نهار وردة مدينة') == 2\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.split():\n if 'و' in w:\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 'و' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('وردة حاسوب وردة تفاحة')` يُرجع `2`.\nالجواب:", "qhash": "179546fe7fae7bed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 9 for x in range(4, 9) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 9 for x in range(4, 9) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "d68e37f7cbc98be7", "answer": "[7, 55]\n2 62", "completion": " الناتج:\n```text\n[7, 55]\n2 62\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 7", "tests": ["assert mfact(10) == 0", "assert mfact(3) == 3", "assert mfact(60) == 0", "assert mfact(4) == 4", "assert mfact(8) == 3", "assert mfact(40) == 0", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 0\nassert mfact(3) == 3\nassert mfact(60) == 0\nassert mfact(4) == 4\nassert mfact(8) == 3\nassert mfact(40) == 0\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 7", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(10)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "5f0ea425168b9822"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "tests": ["assert scaled_powers(6) == 273", "assert scaled_powers(10) == 1155", "assert scaled_powers(7) == 420", "assert scaled_powers(6) == 273", "assert scaled_powers(0) == 0", "assert scaled_powers(1) == 3", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 273\nassert scaled_powers(10) == 1155\nassert scaled_powers(7) == 420\nassert scaled_powers(6) == 273\nassert scaled_powers(0) == 0\nassert scaled_powers(1) == 3\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(6)` يُرجع `273`.\nالجواب:", "qhash": "a90740f3dc54fb1e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'alnu'}", "tests": ["assert freq_of('is garden rocket') == {'a': 1, 'l': 0, 'n': 1, 'u': 0}", "assert freq_of('apple apple to at winter an') == {'a': 4, 'l': 2, 'n': 2, 'u': 0}", "assert freq_of('pixel planet engine brain') == {'a': 2, 'l': 2, 'n': 4, 'u': 0}", "assert freq_of('river window python') == {'a': 0, 'l': 0, 'n': 2, 'u': 0}", "assert freq_of('by orange') == {'a': 1, 'l': 0, 'n': 1, 'u': 0}", "assert freq_of('code python is a in') == {'a': 1, 'l': 0, 'n': 2, 'u': 0}", "assert freq_of('') == {'a': 0, 'l': 0, 'n': 0, 'u': 0}"], "test_code": "assert freq_of('is garden rocket') == {'a': 1, 'l': 0, 'n': 1, 'u': 0}\nassert freq_of('apple apple to at winter an') == {'a': 4, 'l': 2, 'n': 2, 'u': 0}\nassert freq_of('pixel planet engine brain') == {'a': 2, 'l': 2, 'n': 4, 'u': 0}\nassert freq_of('river window python') == {'a': 0, 'l': 0, 'n': 2, 'u': 0}\nassert freq_of('by orange') == {'a': 1, 'l': 0, 'n': 1, 'u': 0}\nassert freq_of('code python is a in') == {'a': 1, 'l': 0, 'n': 2, 'u': 0}\nassert freq_of('') == {'a': 0, 'l': 0, 'n': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'alnu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'alnu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'l'، 'n'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('is garden rocket')` يُرجع `{'a': 1, 'l': 0, 'n': 1, 'u': 0}`.\nالجواب:", "qhash": "a7391a3c937d75b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 137:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([6, 48, 29, 37, 70, 34, 34, 67, 64, 14]) == [6, 54, 83, 120, 0, 34, 68, 135, 0, 14]", "assert reset_sum([85, 103, 84, 134, 90, 24]) == [85, 0, 84, 0, 90, 114]", "assert reset_sum([110, 39, 43, 123, 95, 54]) == [110, 0, 43, 0, 95, 0]", "assert reset_sum([70, 53, 35, 79, 93, 22, 47, 24, 64, 66]) == [70, 123, 0, 79, 0, 22, 69, 93, 0, 66]", "assert reset_sum([107, 13, 17, 28, 78, 20, 132, 96, 106]) == [107, 120, 137, 0, 78, 98, 0, 96, 0]", "assert reset_sum([84, 134, 122, 31]) == [84, 0, 122, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([6, 48, 29, 37, 70, 34, 34, 67, 64, 14]) == [6, 54, 83, 120, 0, 34, 68, 135, 0, 14]\nassert reset_sum([85, 103, 84, 134, 90, 24]) == [85, 0, 84, 0, 90, 114]\nassert reset_sum([110, 39, 43, 123, 95, 54]) == [110, 0, 43, 0, 95, 0]\nassert reset_sum([70, 53, 35, 79, 93, 22, 47, 24, 64, 66]) == [70, 123, 0, 79, 0, 22, 69, 93, 0, 66]\nassert reset_sum([107, 13, 17, 28, 78, 20, 132, 96, 106]) == [107, 120, 137, 0, 78, 98, 0, 96, 0]\nassert reset_sum([84, 134, 122, 31]) == [84, 0, 122, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 137:\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 > 137:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 137 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([6, 48, 29, 37, 70, 34, 34, 67, 64, 14])` يُرجع `[6, 54, 83, 120, 0, 34, 68, 135, 0, 14]`.\nالجواب:", "qhash": "22a575d37585bac0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(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 fizz(7) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7']", "assert fizz(5) == ['1', 'Sun', 'Moon', 'Sun', '5']", "assert fizz(24) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon', '13', 'Sun', 'Moon', 'Sun', '17', 'SunMoon', '19', 'Sun', 'Moon', 'Sun', '23', 'SunMoon']", "assert fizz(4) == ['1', 'Sun', 'Moon', 'Sun']", "assert fizz(23) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon', '13', 'Sun', 'Moon', 'Sun', '17', 'SunMoon', '19', 'Sun', 'Moon', 'Sun', '23']"], "test_code": "assert fizz(7) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7']\nassert fizz(5) == ['1', 'Sun', 'Moon', 'Sun', '5']\nassert fizz(24) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon', '13', 'Sun', 'Moon', 'Sun', '17', 'SunMoon', '19', 'Sun', 'Moon', 'Sun', '23', 'SunMoon']\nassert fizz(4) == ['1', 'Sun', 'Moon', 'Sun']\nassert fizz(23) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon', '13', 'Sun', 'Moon', 'Sun', '17', 'SunMoon', '19', 'Sun', 'Moon', 'Sun', '23']", "answer": "def fizz(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 fizz(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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Sun'، وإن قَبِلها على 3 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(7)` يُرجع `['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7']`.\nالجواب:", "qhash": "60f0ce1e6acfce92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(331708814))\nprint(rec(rec(331708814)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(331708814))\nprint(rec(rec(331708814)))\n```\nالجواب:", "qhash": "6d94e4e2e9357ed3", "answer": "35\n8", "completion": " الناتج:\n```text\n35\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'جبل حديقة'\nprint(kalima[-1])\nprint(kalima.split())\nprint(kalima[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'جبل حديقة'\nprint(kalima[-1])\nprint(kalima.split())\nprint(kalima[0])\n```\nالجواب:", "qhash": "a75c5ffcb37d7248", "answer": "ة\n['جبل', 'حديقة']\nج", "completion": " الناتج:\n```text\nة\n['جبل', 'حديقة']\nج\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 1:\n return 1\n return 2 * f(n - 1) + 3\n\nprint(f(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 1:\n return 1\n return 2 * f(n - 1) + 3\n\nprint(f(9))\n```\nالجواب:", "qhash": "61a900dd1165fe0f", "answer": "1021", "completion": " الناتج:\n```text\n1021\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-15, -8, 43, -3, -10]) == None", "assert biggest_mult([-12, -18, -24]) == -12", "assert biggest_mult([1]) == None", "assert biggest_mult([11, 32, 38, -4]) == None", "assert biggest_mult([-31, -37, 34, -10, 8]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-15, -8, 43, -3, -10]) == None\nassert biggest_mult([-12, -18, -24]) == -12\nassert biggest_mult([1]) == None\nassert biggest_mult([11, 32, 38, -4]) == None\nassert biggest_mult([-31, -37, 34, -10, 8]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 6 == 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 % 6 == 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 % 6 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(xs):\n best = 0\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([-15, -8, 43, -3, -10])` يُرجع `None`.\nالجواب:", "qhash": "34e7136a49510377"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 3 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(4) == ['1', 'Fizz', 'Buzz', 'Fizz']", "assert fizz(12) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'FizzBuzz']", "assert fizz(11) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11']", "assert fizz(10) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz']", "assert fizz(14) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'FizzBuzz', '13', 'Fizz']"], "test_code": "assert fizz(4) == ['1', 'Fizz', 'Buzz', 'Fizz']\nassert fizz(12) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'FizzBuzz']\nassert fizz(11) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11']\nassert fizz(10) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz']\nassert fizz(14) == ['1', 'Fizz', 'Buzz', 'Fizz', '5', 'FizzBuzz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'FizzBuzz', '13', 'Fizz']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 3 == 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 % 2 == 0:\n s += 'Fizz'\n if i % 3 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Fizz'، وعلى 3 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(4)` يجب أن تُرجع `['1', 'Fizz', 'Buzz', 'Fizz']`.\nالجواب:", "qhash": "7268cc4ef361d42d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_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 best_multiple([54, 39, 55, 12, -19, -16, 26, -3, -28]) == -16", "assert best_multiple([-16, -32, -8]) == -8", "assert best_multiple([1]) == None", "assert best_multiple([36, 21]) == None", "assert best_multiple([-15, -44, 42, -24, 20, 42, 36, 41, 24]) == 24", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([54, 39, 55, 12, -19, -16, 26, -3, -28]) == -16\nassert best_multiple([-16, -32, -8]) == -8\nassert best_multiple([1]) == None\nassert best_multiple([36, 21]) == None\nassert best_multiple([-15, -44, 42, -24, 20, 42, 36, 41, 24]) == 24\nassert best_multiple([]) == None", "answer": "def best_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 best_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 best_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 best_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مثال: `best_multiple([54, 39, 55, 12, -19, -16, 26, -3, -28])` يجب أن تُرجع `-16`.\nالجواب:", "qhash": "85c3bb35e2e5346c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 20\nfor i in range(-4, 8, 1):\n acc += i * 1\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 20\nfor i in range(-4, 8, 1):\n acc += i * 1\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "6e5fe8166efd7e3c", "answer": "38\n7", "completion": " الناتج:\n```text\n38\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([18, 53, 61, 61, 22, 26, 15, 29, 2, 32]) == [18, 71, 0, 61, 83, 109, 0, 29, 31, 63]", "assert capped_cumsum([64, 61, 95, 80, 85, 87, 97, 23, 42]) == [64, 0, 95, 0, 85, 0, 97, 0, 42]", "assert capped_cumsum([79]) == [79]", "assert capped_cumsum([3, 42, 11, 12, 60, 9]) == [3, 45, 56, 68, 0, 9]", "assert capped_cumsum([64, 86]) == [64, 0]", "assert capped_cumsum([-6, 91, 57, 2, 53, 73]) == [-6, 85, 0, 2, 55, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([18, 53, 61, 61, 22, 26, 15, 29, 2, 32]) == [18, 71, 0, 61, 83, 109, 0, 29, 31, 63]\nassert capped_cumsum([64, 61, 95, 80, 85, 87, 97, 23, 42]) == [64, 0, 95, 0, 85, 0, 97, 0, 42]\nassert capped_cumsum([79]) == [79]\nassert capped_cumsum([3, 42, 11, 12, 60, 9]) == [3, 45, 56, 68, 0, 9]\nassert capped_cumsum([64, 86]) == [64, 0]\nassert capped_cumsum([-6, 91, 57, 2, 53, 73]) == [-6, 85, 0, 2, 55, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\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 > 115:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 115 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([18, 53, 61, 61, 22, 26, 15, 29, 2, 32])` يُرجع `[18, 71, 0, 61, 83, 109, 0, 29, 31, 63]`.\nالجواب:", "qhash": "5d331d96fef427c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert roll([31, 14, 33, 5, 6]) == [14, 33, 5, 6, 31]", "assert roll([-2, -1]) == [-2, -1]", "assert roll([-9, 16, 39, 20, 12, 5, 17, 43, 2]) == [12, 5, 17, 43, 2, -9, 16, 39, 20]", "assert roll([25, 36, 1, 40, -5, 2]) == [-5, 2, 25, 36, 1, 40]", "assert roll([39]) == [39]", "assert roll([22, 13, 7, 9, 37, -7, 23, 8, 36, 4]) == [23, 8, 36, 4, 22, 13, 7, 9, 37, -7]", "assert roll([]) == []"], "test_code": "assert roll([31, 14, 33, 5, 6]) == [14, 33, 5, 6, 31]\nassert roll([-2, -1]) == [-2, -1]\nassert roll([-9, 16, 39, 20, 12, 5, 17, 43, 2]) == [12, 5, 17, 43, 2, -9, 16, 39, 20]\nassert roll([25, 36, 1, 40, -5, 2]) == [-5, 2, 25, 36, 1, 40]\nassert roll([39]) == [39]\nassert roll([22, 13, 7, 9, 37, -7, 23, 8, 36, 4]) == [23, 8, 36, 4, 22, 13, 7, 9, 37, -7]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 14 % 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 = 14 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `roll([31, 14, 33, 5, 6])` يُرجع `[14, 33, 5, 6, 31]`.\nالجواب:", "qhash": "3923a2d99495fa65"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total", "tests": ["assert weighted_sum(4) == 7800", "assert weighted_sum(2) == 198", "assert weighted_sum(6) == 73206", "assert weighted_sum(14) == 9238950", "assert weighted_sum(15) == 13795200", "assert weighted_sum(1) == 6", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 7800\nassert weighted_sum(2) == 198\nassert weighted_sum(6) == 73206\nassert weighted_sum(14) == 9238950\nassert weighted_sum(15) == 13795200\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 ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(4)` يُرجع `7800`.\nالجواب:", "qhash": "b54a301318d85a8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert roll([16, 1, 38, 45, 21]) == [16, 1, 38, 45, 21]", "assert roll([50, -4, 27, -6, 3, -6, 11, 24, 29, 4, 11]) == [24, 29, 4, 11, 50, -4, 27, -6, 3, -6, 11]", "assert roll([19, 36, 38, 6, 32, 35, 34, -1, -1]) == [6, 32, 35, 34, -1, -1, 19, 36, 38]", "assert roll([5, 25, 4, 43, -8, -4]) == [43, -8, -4, 5, 25, 4]", "assert roll([23, 44, 3, 13]) == [44, 3, 13, 23]", "assert roll([25, 29, 39, 27, 15, 32, 25, -9, 0, 43, -6, 43]) == [43, -6, 43, 25, 29, 39, 27, 15, 32, 25, -9, 0]", "assert roll([]) == []"], "test_code": "assert roll([16, 1, 38, 45, 21]) == [16, 1, 38, 45, 21]\nassert roll([50, -4, 27, -6, 3, -6, 11, 24, 29, 4, 11]) == [24, 29, 4, 11, 50, -4, 27, -6, 3, -6, 11]\nassert roll([19, 36, 38, 6, 32, 35, 34, -1, -1]) == [6, 32, 35, 34, -1, -1, 19, 36, 38]\nassert roll([5, 25, 4, 43, -8, -4]) == [43, -8, -4, 5, 25, 4]\nassert roll([23, 44, 3, 13]) == [44, 3, 13, 23]\nassert roll([25, 29, 39, 27, 15, 32, 25, -9, 0, 43, -6, 43]) == [43, -6, 43, 25, 29, 39, 27, 15, 32, 25, -9, 0]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(items):\n if not items:\n return []\n k = 15 % len(items)\n return ____\n```\nمثال: `roll([16, 1, 38, 45, 21])` يجب أن تُرجع `[16, 1, 38, 45, 21]`.\nالجواب:", "qhash": "68678cb77eb2cd49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['camel', 'orange', 'cloud', 'signal', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['camel', 'orange', 'cloud', 'signal', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "c5c0915873608cab", "answer": "['camel', 'cloud', 'orange', 'signal', 'engine']\n['signal', 'orange', 'engine']", "completion": " الناتج:\n```text\n['camel', 'cloud', 'orange', 'signal', 'engine']\n['signal', 'orange', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [22, 15, 12, 9, 22]\nprint(data[2:3])\nprint(data[::2])\nprint(min(data[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [22, 15, 12, 9, 22]\nprint(data[2:3])\nprint(data[::2])\nprint(min(data[2:3]))\n```\nالجواب:", "qhash": "ae2fb94952c23e68", "answer": "[12]\n[22, 12, 22]\n12", "completion": " الناتج:\n```text\n[12]\n[22, 12, 22]\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)", "tests": ["assert total_multiples(210) == 7245", "assert total_multiples(250) == 10458", "assert total_multiples(164) == 4455", "assert total_multiples(93) == 1395", "assert total_multiples(96) == 1488", "assert total_multiples(109) == 1998", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(210) == 7245\nassert total_multiples(250) == 10458\nassert total_multiples(164) == 4455\nassert total_multiples(93) == 1395\nassert total_multiples(96) == 1488\nassert total_multiples(109) == 1998\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 % 6 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 6.\nمثال: `total_multiples(210)` يجب أن تُرجع `7245`.\nالجواب:", "qhash": "fc224c620ff3984d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([16, 13, 13, 13, 13, 6, 17, 14]) == [16, 29, 0, 13, 26, 32, 0, 14]", "assert running_sum([27, 32, -5, -9, 29, 24, -9, -2, -4, 3]) == [27, 0, -5, -14, 15, 0, -9, -11, -15, -12]", "assert running_sum([6, -1, 21, 17, 11, 22, -1]) == [6, 5, 26, 0, 11, 33, 32]", "assert running_sum([-1, 2, 10, 9, 24, -5]) == [-1, 1, 11, 20, 0, -5]", "assert running_sum([34, -9, 5, -1]) == [34, 25, 30, 29]", "assert running_sum([2, 18, 13]) == [2, 20, 33]", "assert running_sum([]) == []"], "test_code": "assert running_sum([16, 13, 13, 13, 13, 6, 17, 14]) == [16, 29, 0, 13, 26, 32, 0, 14]\nassert running_sum([27, 32, -5, -9, 29, 24, -9, -2, -4, 3]) == [27, 0, -5, -14, 15, 0, -9, -11, -15, -12]\nassert running_sum([6, -1, 21, 17, 11, 22, -1]) == [6, 5, 26, 0, 11, 33, 32]\nassert running_sum([-1, 2, 10, 9, 24, -5]) == [-1, 1, 11, 20, 0, -5]\nassert running_sum([34, -9, 5, -1]) == [34, 25, 30, 29]\nassert running_sum([2, 18, 13]) == [2, 20, 33]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 34:\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 > 34:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 34 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([16, 13, 13, 13, 13, 6, 17, 14])` يُرجع `[16, 29, 0, 13, 26, 32, 0, 14]`.\nالجواب:", "qhash": "7077aef760cd67ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عربية شجرة سوق نور برمجة دفتر') == 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(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:\n if w.startswith('ف'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ف»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef prefix_hits(line):\n count = 0\n for w in line:\n if w.startswith('ف'):\n count += 1\n return count\n```\nمثال: `prefix_hits('فجر شمس لغة ماء معلم سلام سوق')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "2cf3e69a9c112ce0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'dlr'}", "tests": ["assert char_counts('data river python window brain') == {'d': 2, 'l': 0, 'r': 3}", "assert char_counts('window is an') == {'d': 1, 'l': 0, 'r': 0}", "assert char_counts('of it banana') == {'d': 0, 'l': 0, 'r': 0}", "assert char_counts('go winter light code brain') == {'d': 1, 'l': 1, 'r': 2}", "assert char_counts('brain it at') == {'d': 0, 'l': 0, 'r': 1}", "assert char_counts('pixel winter it data falcon planet') == {'d': 1, 'l': 3, 'r': 1}", "assert char_counts('') == {'d': 0, 'l': 0, 'r': 0}"], "test_code": "assert char_counts('data river python window brain') == {'d': 2, 'l': 0, 'r': 3}\nassert char_counts('window is an') == {'d': 1, 'l': 0, 'r': 0}\nassert char_counts('of it banana') == {'d': 0, 'l': 0, 'r': 0}\nassert char_counts('go winter light code brain') == {'d': 1, 'l': 1, 'r': 2}\nassert char_counts('brain it at') == {'d': 0, 'l': 0, 'r': 1}\nassert char_counts('pixel winter it data falcon planet') == {'d': 1, 'l': 3, 'r': 1}\nassert char_counts('') == {'d': 0, 'l': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'dlr'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'dlr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'l'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('data river python window brain')` يُرجع `{'d': 2, 'l': 0, 'r': 3}`.\nالجواب:", "qhash": "5b17c0b9d1604854"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(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 only_div([18, 11, 48, 3, 48, 64, 59, 42, 3, 0, 51, 54]) == 0", "assert only_div([4, 74, 79]) == 0", "assert only_div([41, 19, -2, -19, 16, 77, 87, 20, 52, 40, 25, 28]) == 0", "assert only_div([13, -28, -24, 90]) == 0", "assert only_div([48, 20, 11]) == 0", "assert only_div([-26, 74, 49, 76, -3, 81, 16, 58]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([18, 11, 48, 3, 48, 64, 59, 42, 3, 0, 51, 54]) == 0\nassert only_div([4, 74, 79]) == 0\nassert only_div([41, 19, -2, -19, 16, 77, 87, 20, 52, 40, 25, 28]) == 0\nassert only_div([13, -28, -24, 90]) == 0\nassert only_div([48, 20, 11]) == 0\nassert only_div([-26, 74, 49, 76, -3, 81, 16, 58]) == 0\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([18, 11, 48, 3, 48, 64, 59, 42, 3, 0, 51, 54])` يُرجع `0`.\nالجواب:", "qhash": "28610143df3babaf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_matching([28, 3, 72, 44, 2, 37]) == 0", "assert count_matching([34, -23, 27, -15, -13]) == 1", "assert count_matching([13, -23, -37, 13, 85]) == 1", "assert count_matching([35, -36, -6, 54, -29, -20, 90, 63, 73, 66, 3]) == 2", "assert count_matching([33, 43, 0, 71]) == 0", "assert count_matching([14, 31, 65, 61, -18, 45, -14, 34, 67]) == 2", "assert count_matching([]) == 0"], "test_code": "assert count_matching([28, 3, 72, 44, 2, 37]) == 0\nassert count_matching([34, -23, 27, -15, -13]) == 1\nassert count_matching([13, -23, -37, 13, 85]) == 1\nassert count_matching([35, -36, -6, 54, -29, -20, 90, 63, 73, 66, 3]) == 2\nassert count_matching([33, 43, 0, 71]) == 0\nassert count_matching([14, 31, 65, 61, -18, 45, -14, 34, 67]) == 2\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، ثم اكتب الدالة كاملة.\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([28, 3, 72, 44, 2, 37])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "7fc419fab077842a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('نور جبل حصان جمل') == 1", "assert starts_count('برتقال نهر نهر عربية قهوة بيت') == 0", "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('نور جبل حصان جمل') == 1\nassert starts_count('برتقال نهر نهر عربية قهوة بيت') == 0\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:\n if w.startswith('ح'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ح». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef starts_count(text):\n count = 0\n for w in text:\n if w.startswith('ح'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('نور جبل حصان جمل')` يُرجع `1`.\nالجواب:", "qhash": "6c80aa694fcc7f46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_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 best_multiple([12, 7, 15, -28]) == None", "assert best_multiple([-8, -16, -8]) == -8", "assert best_multiple([1]) == None", "assert best_multiple([-27, 11, 36, -15, -23, 16, 4, -11, -1]) == 16", "assert best_multiple([-10, 39, 21, 31, 6, -36, -46, 41]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([12, 7, 15, -28]) == None\nassert best_multiple([-8, -16, -8]) == -8\nassert best_multiple([1]) == None\nassert best_multiple([-27, 11, 36, -15, -23, 16, 4, -11, -1]) == 16\nassert best_multiple([-10, 39, 21, 31, 6, -36, -46, 41]) == None\nassert best_multiple([]) == None", "answer": "def best_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 best_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 best_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 best_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مثال: `best_multiple([12, 7, 15, -28])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "02ea925732e5e654"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(275) == 6860", "assert add_multiples(233) == 4824", "assert add_multiples(16) == 22", "assert add_multiples(216) == 4152", "assert add_multiples(298) == 8018", "assert add_multiples(99) == 960", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(275) == 6860\nassert add_multiples(233) == 4824\nassert add_multiples(16) == 22\nassert add_multiples(216) == 4152\nassert add_multiples(298) == 8018\nassert add_multiples(99) == 960\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 14.\nمثال: `add_multiples(275)` يجب أن تُرجع `6860`.\nالجواب:", "qhash": "75c3b7654d828368"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 7", "tests": ["assert step_product(3) == 6", "assert step_product(58) == 0", "assert step_product(8) == 0", "assert step_product(53) == 0", "assert step_product(47) == 0", "assert step_product(3) == 6", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 6\nassert step_product(58) == 0\nassert step_product(8) == 0\nassert step_product(53) == 0\nassert step_product(47) == 0\nassert step_product(3) == 6\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 7", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "610d9d9eacac0d7f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert sum_powers(7) == 348096", "assert sum_powers(0) == 0", "assert sum_powers(7) == 348096", "assert sum_powers(0) == 0", "assert sum_powers(11) == 4582512", "assert sum_powers(1) == 12", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(7) == 348096\nassert sum_powers(0) == 0\nassert sum_powers(7) == 348096\nassert sum_powers(0) == 0\nassert sum_powers(11) == 4582512\nassert sum_powers(1) == 12\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(7)` يُرجع `348096`.\nالجواب:", "qhash": "5506c98efb0010b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 80", "tests": ["assert digits_mod(9572) == 53", "assert digits_mod(927939) == 69", "assert digits_mod(863093) == 79", "assert digits_mod(256282) == 5", "assert digits_mod(670503) == 31", "assert digits_mod(351112) == 43", "assert digits_mod(635403) == 11", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(9572) == 53\nassert digits_mod(927939) == 69\nassert digits_mod(863093) == 79\nassert digits_mod(256282) == 5\nassert digits_mod(670503) == 31\nassert digits_mod(351112) == 43\nassert digits_mod(635403) == 11\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 80", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 80\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 80.\nمثال: `digits_mod(9572)` يجب أن تُرجع `53`.\nالجواب:", "qhash": "e1595ec7a06883c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [-6, 32, -7, 37, 33, 0, 16]\nprint(lst[3:4])\nprint(lst[::-2])\nprint(max(lst[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [-6, 32, -7, 37, 33, 0, 16]\nprint(lst[3:4])\nprint(lst[::-2])\nprint(max(lst[3:4]))\n```\nالجواب:", "qhash": "bd9b89af4f6608e7", "answer": "[37]\n[16, 33, -7, -6]\n37", "completion": " الناتج:\n```text\n[37]\n[16, 33, -7, -6]\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 6) // 5 for x in range(-1, 9) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 6) // 5 for x in range(-1, 9) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a445a1db87f87dd0", "answer": "[1, 2]\n2 3", "completion": " الناتج:\n```text\n[1, 2]\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert turn_list([9, 36, 26, 22, 1]) == [1, 9, 36, 26, 22]", "assert turn_list([-2, 31, -2, 27]) == [27, -2, 31, -2]", "assert turn_list([-2, 0]) == [0, -2]", "assert turn_list([21, 31, 42, 3, 2, 13, 19, -3, 21]) == [31, 42, 3, 2, 13, 19, -3, 21, 21]", "assert turn_list([2, 26, 19, 20]) == [20, 2, 26, 19]", "assert turn_list([-1, 2, -3, -8, 10, 14]) == [2, -3, -8, 10, 14, -1]", "assert turn_list([]) == []"], "test_code": "assert turn_list([9, 36, 26, 22, 1]) == [1, 9, 36, 26, 22]\nassert turn_list([-2, 31, -2, 27]) == [27, -2, 31, -2]\nassert turn_list([-2, 0]) == [0, -2]\nassert turn_list([21, 31, 42, 3, 2, 13, 19, -3, 21]) == [31, 42, 3, 2, 13, 19, -3, 21, 21]\nassert turn_list([2, 26, 19, 20]) == [20, 2, 26, 19]\nassert turn_list([-1, 2, -3, -8, 10, 14]) == [2, -3, -8, 10, 14, -1]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([9, 36, 26, 22, 1])` يُرجع `[1, 9, 36, 26, 22]`.\nالجواب:", "qhash": "326915f557f7ca3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(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 largest_div([-10, -12, 36, 11, -22]) == 36", "assert largest_div([-15, -15, -15]) == -15", "assert largest_div([1, 4, 7, 10]) == None", "assert largest_div([29, -2, 11]) == None", "assert largest_div([6, -25, -50]) == 6", "assert largest_div([]) == None"], "test_code": "assert largest_div([-10, -12, 36, 11, -22]) == 36\nassert largest_div([-15, -15, -15]) == -15\nassert largest_div([1, 4, 7, 10]) == None\nassert largest_div([29, -2, 11]) == None\nassert largest_div([6, -25, -50]) == 6\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(nums):\n best = 0\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 largest_div(nums):\n best = 0\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للتوضيح: الاستدعاء `largest_div([-10, -12, 36, 11, -22])` يُرجع `36`.\nالجواب:", "qhash": "eeeb91e6797834ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(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 cumulative([5, 14, 36, 31, 8, 32]) == [5, 19, 55, 0, 8, 40]", "assert cumulative([18, 70, 72, 51, 31, 25, 27, 17, 48, -10]) == [18, 0, 72, 0, 31, 56, 0, 17, 65, 55]", "assert cumulative([61, 2, 12, 64]) == [61, 63, 75, 0]", "assert cumulative([-3, 42, -3, 20, 53, 31, 70, 67]) == [-3, 39, 36, 56, 0, 31, 0, 67]", "assert cumulative([79, 45, 45, 74, 0]) == [79, 0, 45, 0, 0]", "assert cumulative([28, 69, -1]) == [28, 0, -1]", "assert cumulative([]) == []"], "test_code": "assert cumulative([5, 14, 36, 31, 8, 32]) == [5, 19, 55, 0, 8, 40]\nassert cumulative([18, 70, 72, 51, 31, 25, 27, 17, 48, -10]) == [18, 0, 72, 0, 31, 56, 0, 17, 65, 55]\nassert cumulative([61, 2, 12, 64]) == [61, 63, 75, 0]\nassert cumulative([-3, 42, -3, 20, 53, 31, 70, 67]) == [-3, 39, 36, 56, 0, 31, 0, 67]\nassert cumulative([79, 45, 45, 74, 0]) == [79, 0, 45, 0, 0]\nassert cumulative([28, 69, -1]) == [28, 0, -1]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 80 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([5, 14, 36, 31, 8, 32])` يجب أن تُرجع `[5, 19, 55, 0, 8, 40]`.\nالجواب:", "qhash": "b35f9a96a6d664e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'rocket'\nprint(text.find('k'))\nprint(text[::-1])\nprint(text.index('k') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'rocket'\nprint(text.find('k'))\nprint(text[::-1])\nprint(text.index('k') + len(text))\n```\nالجواب:", "qhash": "08827f3549f97353", "answer": "3\ntekcor\n9", "completion": " الناتج:\n```text\n3\ntekcor\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([-23, 46, -29, 28, -1, -30]) == 28", "assert best_multiple([-7, -35, -7]) == -7", "assert best_multiple([1, 8, 15, 22]) == None", "assert best_multiple([33, 4, 28, -40, 3, 16]) == 28", "assert best_multiple([17, -44, 21, -33, -38, 24, 17, 14, 47]) == 21", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-23, 46, -29, 28, -1, -30]) == 28\nassert best_multiple([-7, -35, -7]) == -7\nassert best_multiple([1, 8, 15, 22]) == None\nassert best_multiple([33, 4, 28, -40, 3, 16]) == 28\nassert best_multiple([17, -44, 21, -33, -38, 24, 17, 14, 47]) == 21\nassert best_multiple([]) == None", "answer": "def best_multiple(xs):\n best = None\n for x in xs:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `best_multiple([-23, 46, -29, 28, -1, -30])` يجب أن تُرجع `28`.\nالجواب:", "qhash": "09af059d6227fc83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(47) == 225", "assert mult_sum(151) == 2325", "assert mult_sum(48) == 225", "assert mult_sum(253) == 6375", "assert mult_sum(260) == 6630", "assert mult_sum(288) == 8265", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(47) == 225\nassert mult_sum(151) == 2325\nassert mult_sum(48) == 225\nassert mult_sum(253) == 6375\nassert mult_sum(260) == 6630\nassert mult_sum(288) == 8265\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 % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(47)` يُرجع `225`.\nالجواب:", "qhash": "bcc51fe9ce0b45f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 395\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 = 395\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": "95ae39c30a0e2695", "answer": "76", "completion": " الناتج:\n```text\n76\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 33", "tests": ["assert sum_digit_pow(17476) == 10", "assert sum_digit_pow(166627) == 7", "assert sum_digit_pow(600144) == 24", "assert sum_digit_pow(401783) == 23", "assert sum_digit_pow(683307) == 21", "assert sum_digit_pow(395096) == 14", "assert sum_digit_pow(100734) == 24", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(17476) == 10\nassert sum_digit_pow(166627) == 7\nassert sum_digit_pow(600144) == 24\nassert sum_digit_pow(401783) == 23\nassert sum_digit_pow(683307) == 21\nassert sum_digit_pow(395096) == 14\nassert sum_digit_pow(100734) == 24\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 33", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 33.\nمثال: `sum_digit_pow(17476)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "205b255f20405575"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'iort'}", "tests": ["assert char_freq('it') == {'i': 1, 'o': 0, 'r': 0, 't': 1}", "assert char_freq('cloud window') == {'i': 1, 'o': 2, 'r': 0, 't': 0}", "assert char_freq('cloud summer brain') == {'i': 1, 'o': 1, 'r': 2, 't': 0}", "assert char_freq('garden cloud is an') == {'i': 1, 'o': 1, 'r': 1, 't': 0}", "assert char_freq('window window') == {'i': 2, 'o': 2, 'r': 0, 't': 0}", "assert char_freq('falcon of camel of cloud cloud') == {'i': 0, 'o': 5, 'r': 0, 't': 0}", "assert char_freq('') == {'i': 0, 'o': 0, 'r': 0, 't': 0}"], "test_code": "assert char_freq('it') == {'i': 1, 'o': 0, 'r': 0, 't': 1}\nassert char_freq('cloud window') == {'i': 1, 'o': 2, 'r': 0, 't': 0}\nassert char_freq('cloud summer brain') == {'i': 1, 'o': 1, 'r': 2, 't': 0}\nassert char_freq('garden cloud is an') == {'i': 1, 'o': 1, 'r': 1, 't': 0}\nassert char_freq('window window') == {'i': 2, 'o': 2, 'r': 0, 't': 0}\nassert char_freq('falcon of camel of cloud cloud') == {'i': 0, 'o': 5, 'r': 0, 't': 0}\nassert char_freq('') == {'i': 0, 'o': 0, 'r': 0, 't': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'iort'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'iort'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'i'، 'o'، 'r'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('it')` يُرجع `{'i': 1, 'o': 0, 'r': 0, 't': 1}`.\nالجواب:", "qhash": "ff97531eda449088"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 60", "tests": ["assert dig_pow_mod(56012) == 18", "assert dig_pow_mod(665777) == 40", "assert dig_pow_mod(29389) == 35", "assert dig_pow_mod(650613) == 59", "assert dig_pow_mod(716519) == 25", "assert dig_pow_mod(522907) == 19", "assert dig_pow_mod(525501) == 32", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(56012) == 18\nassert dig_pow_mod(665777) == 40\nassert dig_pow_mod(29389) == 35\nassert dig_pow_mod(650613) == 59\nassert dig_pow_mod(716519) == 25\nassert dig_pow_mod(522907) == 19\nassert dig_pow_mod(525501) == 32\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 60", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 60\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 60.\nمثال: `dig_pow_mod(56012)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "858ce5544ffa09d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'تفاحة'\nprint('ت' in w)\nprint(len(w.replace(' ', '')))\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'تفاحة'\nprint('ت' in w)\nprint(len(w.replace(' ', '')))\nprint(w[0])\n```\nالجواب:", "qhash": "1f4410ef7f54de57", "answer": "True\n5\nت", "completion": " الناتج:\n```text\nTrue\n5\nت\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(10))\nprint(h(10, 1))\nprint(h(h(1), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=9):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(10))\nprint(h(10, 1))\nprint(h(h(1), 10))\n```\nالجواب:", "qhash": "ec8083ca426c9454", "answer": "61\n69\n438", "completion": " الناتج:\n```text\n61\n69\n438\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(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 cumulative([11, 30, 65, 30, 1, 66, 70, 28]) == [11, 41, 106, 136, 137, 0, 70, 98]", "assert cumulative([47, 36, 21, 46, 107, 33]) == [47, 83, 104, 0, 107, 140]", "assert cumulative([89, 60, 136, 113, 38, 112, 51, 85, 48, 126]) == [89, 0, 136, 0, 38, 0, 51, 136, 0, 126]", "assert cumulative([40, 108]) == [40, 0]", "assert cumulative([15, 96, 1, 73]) == [15, 111, 112, 0]", "assert cumulative([-2, 66, 54, 8, 2, 128, 40, 43]) == [-2, 64, 118, 126, 128, 0, 40, 83]", "assert cumulative([]) == []"], "test_code": "assert cumulative([11, 30, 65, 30, 1, 66, 70, 28]) == [11, 41, 106, 136, 137, 0, 70, 98]\nassert cumulative([47, 36, 21, 46, 107, 33]) == [47, 83, 104, 0, 107, 140]\nassert cumulative([89, 60, 136, 113, 38, 112, 51, 85, 48, 126]) == [89, 0, 136, 0, 38, 0, 51, 136, 0, 126]\nassert cumulative([40, 108]) == [40, 0]\nassert cumulative([15, 96, 1, 73]) == [15, 111, 112, 0]\nassert cumulative([-2, 66, 54, 8, 2, 128, 40, 43]) == [-2, 64, 118, 126, 128, 0, 40, 83]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 142 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([11, 30, 65, 30, 1, 66, 70, 28])` يجب أن تُرجع `[11, 41, 106, 136, 137, 0, 70, 98]`.\nالجواب:", "qhash": "7b9655072dad2711"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 38)", "tests": ["assert between_times([26, 29, 40, 22, 3, -4, 33, 6, 34, 48]) == [-68, -66, -58, -52, -44, -12, -6]", "assert between_times([-15, 49, 44]) == []", "assert between_times([25, -28, -17]) == [-50]", "assert between_times([-23, 54, 31]) == [-62]", "assert between_times([50, 3, 3, 48]) == [-6, -6]", "assert between_times([47]) == []", "assert between_times([0, 11, 48, 23, -22]) == [-46, -22]", "assert between_times([]) == []"], "test_code": "assert between_times([26, 29, 40, 22, 3, -4, 33, 6, 34, 48]) == [-68, -66, -58, -52, -44, -12, -6]\nassert between_times([-15, 49, 44]) == []\nassert between_times([25, -28, -17]) == [-50]\nassert between_times([-23, 54, 31]) == [-62]\nassert between_times([50, 3, 3, 48]) == [-6, -6]\nassert between_times([47]) == []\nassert between_times([0, 11, 48, 23, -22]) == [-46, -22]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 38)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -2 for x in xs if 2 <= x <= 38)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 2 ≤ x ≤ 38، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([26, 29, 40, 22, 3, -4, 33, 6, 34, 48])` يُرجع `[-68, -66, -58, -52, -44, -12, -6]`.\nالجواب:", "qhash": "19ac1a0e704b2c9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (6)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('code in in') == 'iujk ot ot'", "assert rot('light is desert planet up') == 'romnz oy jkykxz vrgtkz av'", "assert rot('desert !') == 'jkykxz !'", "assert rot('engine music 2024') == 'ktmotk sayoi 2024'", "assert rot('summer garden') == 'yasskx mgxjkt'", "assert rot('go falcon orange Hello') == 'mu lgriut uxgtmk Hkrru'", "assert rot('') == ''"], "test_code": "assert rot('code in in') == 'iujk ot ot'\nassert rot('light is desert planet up') == 'romnz oy jkykxz vrgtkz av'\nassert rot('desert !') == 'jkykxz !'\nassert rot('engine music 2024') == 'ktmotk sayoi 2024'\nassert rot('summer garden') == 'yasskx mgxjkt'\nassert rot('go falcon orange Hello') == 'mu lgriut uxgtmk Hkrru'\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 + (6)) % 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 + (6)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 6 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('code in in')` يُرجع `'iujk ot ot'`.\nالجواب:", "qhash": "1ac82d19206a9487"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'nru'}", "tests": ["assert count_chars('light') == {'n': 0, 'r': 0, 'u': 0}", "assert count_chars('an') == {'n': 1, 'r': 0, 'u': 0}", "assert count_chars('desert go on a pixel') == {'n': 1, 'r': 1, 'u': 0}", "assert count_chars('it planet on') == {'n': 2, 'r': 0, 'u': 0}", "assert count_chars('matrix rocket garden up') == {'n': 1, 'r': 3, 'u': 1}", "assert count_chars('go window signal of river') == {'n': 2, 'r': 2, 'u': 0}", "assert count_chars('') == {'n': 0, 'r': 0, 'u': 0}"], "test_code": "assert count_chars('light') == {'n': 0, 'r': 0, 'u': 0}\nassert count_chars('an') == {'n': 1, 'r': 0, 'u': 0}\nassert count_chars('desert go on a pixel') == {'n': 1, 'r': 1, 'u': 0}\nassert count_chars('it planet on') == {'n': 2, 'r': 0, 'u': 0}\nassert count_chars('matrix rocket garden up') == {'n': 1, 'r': 3, 'u': 1}\nassert count_chars('go window signal of river') == {'n': 2, 'r': 2, 'u': 0}\nassert count_chars('') == {'n': 0, 'r': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'nru'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'nru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'n'، 'r'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('light')` يجب أن تُرجع `{'n': 0, 'r': 0, 'u': 0}`.\nالجواب:", "qhash": "7675649236891d55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -2 * x ** 2 + (7) * x + (-3)", "tests": ["assert quad(7) == -52", "assert quad(14) == -297", "assert quad(-9) == -228", "assert quad(-7) == -150", "assert quad(6) == -33", "assert quad(14) == -297", "assert quad(9) == -102", "assert quad(0) == -3"], "test_code": "assert quad(7) == -52\nassert quad(14) == -297\nassert quad(-9) == -228\nassert quad(-7) == -150\nassert quad(6) == -33\nassert quad(14) == -297\nassert quad(9) == -102\nassert quad(0) == -3", "answer": "def quad(x):\n return -2 * x ** 2 + (7) * x + (-3)", "completion": " ```python\ndef quad(x):\n return -2 * x ** 2 + (7) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -2x² + 7x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(7)` يُرجع `-52`.\nالجواب:", "qhash": "77e928f0526f4005"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert sum_div(294) == 17259", "assert sum_div(61) == 750", "assert sum_div(254) == 12880", "assert sum_div(295) == 17553", "assert sum_div(169) == 5698", "assert sum_div(10) == 18", "assert sum_div(1) == 0"], "test_code": "assert sum_div(294) == 17259\nassert sum_div(61) == 750\nassert sum_div(254) == 12880\nassert sum_div(295) == 17553\nassert sum_div(169) == 5698\nassert sum_div(10) == 18\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 % 10 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `sum_div(294)` يجب أن تُرجع `17259`.\nالجواب:", "qhash": "b340c0e482b58657"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 54) == 1)", "tests": ["assert count_coprime(115) == 39", "assert count_coprime(47) == 16", "assert count_coprime(72) == 24", "assert count_coprime(136) == 45", "assert count_coprime(103) == 35", "assert count_coprime(107) == 36", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(115) == 39\nassert count_coprime(47) == 16\nassert count_coprime(72) == 24\nassert count_coprime(136) == 45\nassert count_coprime(103) == 35\nassert count_coprime(107) == 36\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 54) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(115)` يُرجع `39`.\nالجواب:", "qhash": "566309270d96be32"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [-9, 21, 28, 35, -1, 8]\nprint(nums[2:6])\nprint(nums[::3])\nprint(min(nums[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-9, 21, 28, 35, -1, 8]\nprint(nums[2:6])\nprint(nums[::3])\nprint(min(nums[2:6]))\n```\nالجواب:", "qhash": "ec8af7aaec2a0122", "answer": "[28, 35, -1, 8]\n[-9, 35]\n-1", "completion": " الناتج:\n```text\n[28, 35, -1, 8]\n[-9, 35]\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 44) == 1)", "tests": ["assert rel_prime_count(72) == 33", "assert rel_prime_count(136) == 62", "assert rel_prime_count(56) == 25", "assert rel_prime_count(106) == 48", "assert rel_prime_count(106) == 48", "assert rel_prime_count(178) == 81", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(72) == 33\nassert rel_prime_count(136) == 62\nassert rel_prime_count(56) == 25\nassert rel_prime_count(106) == 48\nassert rel_prime_count(106) == 48\nassert rel_prime_count(178) == 81\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, 44) == 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, 44) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 44) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(72)` يُرجع `33`.\nالجواب:", "qhash": "864a370b4db0070d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "tests": ["assert pow_total(5) == 2937", "assert pow_total(9) == 45999", "assert pow_total(6) == 6825", "assert pow_total(11) == 119922", "assert pow_total(6) == 6825", "assert pow_total(1) == 3", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 2937\nassert pow_total(9) == 45999\nassert pow_total(6) == 6825\nassert pow_total(11) == 119922\nassert pow_total(6) == 6825\nassert pow_total(1) == 3\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 4\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 4\n return total\n```\nمثال: `pow_total(5)` يجب أن تُرجع `2937`.\nالجواب:", "qhash": "451a5a3ab103f34b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [30, -9, 37, 16, 30, 35, 11, 6]\nprint(xs[0:5])\nprint(xs[::3])\nprint(sum(xs[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [30, -9, 37, 16, 30, 35, 11, 6]\nprint(xs[0:5])\nprint(xs[::3])\nprint(sum(xs[0:5]))\n```\nالجواب:", "qhash": "b3bd411e2bb42149", "answer": "[30, -9, 37, 16, 30]\n[30, 16, 11]\n104", "completion": " الناتج:\n```text\n[30, -9, 37, 16, 30]\n[30, 16, 11]\n104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('عربية دفتر') == 1", "assert letter_count('سلام سماء سيارة دفتر لغة معلم') == 1", "assert letter_count('وردة شجرة بيت قلم وردة كتاب سيارة') == 2", "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('عربية دفتر') == 1\nassert letter_count('سلام سماء سيارة دفتر لغة معلم') == 1\nassert letter_count('وردة شجرة بيت قلم وردة كتاب سيارة') == 2\nassert letter_count('صديق قمر جمل كتاب') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «د» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('دفتر حاسوب برتقال سلام')` يُرجع `1`.\nالجواب:", "qhash": "88920a90d1bea68e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['garden', 'summer', 'music', 'planet', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['garden', 'summer', 'music', 'planet', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "0898768978b52bed", "answer": "['music', 'cloud', 'garden', 'summer', 'planet']\n['summer', 'planet', 'garden']", "completion": " الناتج:\n```text\n['music', 'cloud', 'garden', 'summer', 'planet']\n['summer', 'planet', 'garden']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'بحر'\nprint(kalima[::-1])\nprint(len(kalima))\nprint(kalima[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'بحر'\nprint(kalima[::-1])\nprint(len(kalima))\nprint(kalima[0])\n```\nالجواب:", "qhash": "8032f7260708da3d", "answer": "رحب\n3\nب", "completion": " الناتج:\n```text\nرحب\n3\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(18) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17', 'Buzz']", "assert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz']", "assert label_numbers(17) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17']", "assert label_numbers(4) == ['1', '2', '3', '4']", "assert label_numbers(19) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17', 'Buzz', '19']"], "test_code": "assert label_numbers(18) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17', 'Buzz']\nassert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz']\nassert label_numbers(17) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17']\nassert label_numbers(4) == ['1', '2', '3', '4']\nassert label_numbers(19) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17', 'Buzz', '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 += 'Fizz'\n if i % 9 == 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 % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Fizz'، وعلى 9 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(18)` يجب أن تُرجع `['1', '2', '3', '4', 'Fizz', '6', '7', '8', 'Buzz', 'Fizz', '11', '12', '13', '14', 'Fizz', '16', '17', 'Buzz']`.\nالجواب:", "qhash": "a2162bafe9dd8304"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 96", "tests": ["assert pow_digits(72650) == 18", "assert pow_digits(117150) == 77", "assert pow_digits(786898) == 70", "assert pow_digits(956235) == 84", "assert pow_digits(45884) == 89", "assert pow_digits(915784) == 44", "assert pow_digits(601886) == 9", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(72650) == 18\nassert pow_digits(117150) == 77\nassert pow_digits(786898) == 70\nassert pow_digits(956235) == 84\nassert pow_digits(45884) == 89\nassert pow_digits(915784) == 44\nassert pow_digits(601886) == 9\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 96", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 96\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 96.\nللتوضيح: الاستدعاء `pow_digits(72650)` يُرجع `18`.\nالجواب:", "qhash": "d4242087145c9805"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [38, 16, 36, 16, -8, 9, 5]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [38, 16, 36, 16, -8, 9, 5]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "bcd94b25b3d4d54f", "answer": "[5, 9, -8, 16, 16, 36, 38]\n[38, 36, 16]", "completion": " الناتج:\n```text\n[5, 9, -8, 16, 16, 36, 38]\n[38, 36, 16]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('music cloud pixel apple OK') == 'qywmg gpsyh tmbip ettpi OK'", "assert rot('banana desert') == 'ferere hiwivx'", "assert rot('rocket stone falcon code up OK') == 'vsgoix wxsri jepgsr gshi yt OK'", "assert rot('by on falcon camel engine OK') == 'fc sr jepgsr geqip irkmri OK'", "assert rot('to cloud falcon it') == 'xs gpsyh jepgsr mx'", "assert rot('light a') == 'pmklx e'", "assert rot('') == ''"], "test_code": "assert rot('music cloud pixel apple OK') == 'qywmg gpsyh tmbip ettpi OK'\nassert rot('banana desert') == 'ferere hiwivx'\nassert rot('rocket stone falcon code up OK') == 'vsgoix wxsri jepgsr gshi yt OK'\nassert rot('by on falcon camel engine OK') == 'fc sr jepgsr geqip irkmri OK'\nassert rot('to cloud falcon it') == 'xs gpsyh jepgsr mx'\nassert rot('light a') == 'pmklx e'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('music cloud pixel apple OK')` يجب أن تُرجع `'qywmg gpsyh tmbip ettpi OK'`.\nالجواب:", "qhash": "6a0b2f7e5f188990"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [34, 31, -5, 2, -4, 19, 34]\nprint(data[1:5])\nprint(data[::-2])\nprint(min(data[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [34, 31, -5, 2, -4, 19, 34]\nprint(data[1:5])\nprint(data[::-2])\nprint(min(data[1:5]))\n```\nالجواب:", "qhash": "4769dc72f695d7b4", "answer": "[31, -5, 2, -4]\n[34, -4, -5, 34]\n-5", "completion": " الناتج:\n```text\n[31, -5, 2, -4]\n[34, -4, -5, 34]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(9))\nprint(h(9, 10))\nprint(h(h(10), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(9))\nprint(h(9, 10))\nprint(h(h(10), 9))\n```\nالجواب:", "qhash": "5aa964c3ef4c9b8f", "answer": "-14\n-1\n-24", "completion": " الناتج:\n```text\n-14\n-1\n-24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 68:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([33, 10, 9, 29, 22, 3, 32, 22]) == [33, 43, 52, 0, 22, 25, 57, 0]", "assert rolling_total([58, 45, 23, 67, 27, 42]) == [58, 0, 23, 0, 27, 0]", "assert rolling_total([61, 46, 60]) == [61, 0, 60]", "assert rolling_total([64, 8, -7, 8, 25, 38, 15]) == [64, 0, -7, 1, 26, 64, 0]", "assert rolling_total([16, 5, -3, 34, -8, 29, 28]) == [16, 21, 18, 52, 44, 0, 28]", "assert rolling_total([3, -10, 56, 1, 64, 68, 67, 48]) == [3, -7, 49, 50, 0, 68, 0, 48]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([33, 10, 9, 29, 22, 3, 32, 22]) == [33, 43, 52, 0, 22, 25, 57, 0]\nassert rolling_total([58, 45, 23, 67, 27, 42]) == [58, 0, 23, 0, 27, 0]\nassert rolling_total([61, 46, 60]) == [61, 0, 60]\nassert rolling_total([64, 8, -7, 8, 25, 38, 15]) == [64, 0, -7, 1, 26, 64, 0]\nassert rolling_total([16, 5, -3, 34, -8, 29, 28]) == [16, 21, 18, 52, 44, 0, 28]\nassert rolling_total([3, -10, 56, 1, 64, 68, 67, 48]) == [3, -7, 49, 50, 0, 68, 0, 48]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 68:\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 > 68:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 68 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([33, 10, 9, 29, 22, 3, 32, 22])` يجب أن تُرجع `[33, 43, 52, 0, 22, 25, 57, 0]`.\nالجواب:", "qhash": "1bfe5d935eee4b3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'lo'}", "tests": ["assert freq_of('of cloud data') == {'l': 1, 'o': 2}", "assert freq_of('to coffee summer') == {'l': 0, 'o': 2}", "assert freq_of('river orange to coffee') == {'l': 0, 'o': 3}", "assert freq_of('cloud') == {'l': 1, 'o': 1}", "assert freq_of('engine') == {'l': 0, 'o': 0}", "assert freq_of('window rocket music river code') == {'l': 0, 'o': 3}", "assert freq_of('') == {'l': 0, 'o': 0}"], "test_code": "assert freq_of('of cloud data') == {'l': 1, 'o': 2}\nassert freq_of('to coffee summer') == {'l': 0, 'o': 2}\nassert freq_of('river orange to coffee') == {'l': 0, 'o': 3}\nassert freq_of('cloud') == {'l': 1, 'o': 1}\nassert freq_of('engine') == {'l': 0, 'o': 0}\nassert freq_of('window rocket music river code') == {'l': 0, 'o': 3}\nassert freq_of('') == {'l': 0, 'o': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'lo'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'lo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'l'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('of cloud data')` يجب أن تُرجع `{'l': 1, 'o': 2}`.\nالجواب:", "qhash": "cd2f7c63cad4bb38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'عمل'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ت'))\nprint(kalima.find('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'عمل'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ت'))\nprint(kalima.find('ت'))\n```\nالجواب:", "qhash": "e0a83e3dd9450507", "answer": "3\n0\n-1", "completion": " الناتج:\n```text\n3\n0\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 67", "tests": ["assert step_product(6) == 18", "assert step_product(34) == 51", "assert step_product(1) == 1", "assert step_product(47) == 50", "assert step_product(54) == 43", "assert step_product(29) == 38", "assert step_product(0) == 1"], "test_code": "assert step_product(6) == 18\nassert step_product(34) == 51\nassert step_product(1) == 1\nassert step_product(47) == 50\nassert step_product(54) == 43\nassert step_product(29) == 38\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 67", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 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": "d0f65fbd4d00c3d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 38", "tests": ["assert digit_score(4833) == 22", "assert digit_score(738504) == 11", "assert digit_score(576571) == 33", "assert digit_score(605411) == 3", "assert digit_score(35068) == 20", "assert digit_score(493562) == 19", "assert digit_score(794436) == 17", "assert digit_score(0) == 0"], "test_code": "assert digit_score(4833) == 22\nassert digit_score(738504) == 11\nassert digit_score(576571) == 33\nassert digit_score(605411) == 3\nassert digit_score(35068) == 20\nassert digit_score(493562) == 19\nassert digit_score(794436) == 17\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 38", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 38\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 38.\nللتوضيح: الاستدعاء `digit_score(4833)` يُرجع `22`.\nالجواب:", "qhash": "0820258fbf8da641"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(-4))\nprint(h(-4, 8))\nprint(h(h(8), -4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(-4))\nprint(h(-4, 8))\nprint(h(h(8), -4))\n```\nالجواب:", "qhash": "47750d621011fc3d", "answer": "36\n60\n476", "completion": " الناتج:\n```text\n36\n60\n476\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(2))\nprint(h(2, 7))\nprint(h(h(7), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=1):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(2))\nprint(h(2, 7))\nprint(h(h(7), 2))\n```\nالجواب:", "qhash": "8ac3a1ad9f351c70", "answer": "1\n9\n4", "completion": " الناتج:\n```text\n1\n9\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= 14)", "tests": ["assert in_range_scaled([17, -4, 20, -9, -2, -24, 14, 22]) == [-45, -20, -10, 70]", "assert in_range_scaled([-5, 46, 16, 24, 12, -3, -14, 39, -19]) == [-70, -25, -15, 60]", "assert in_range_scaled([37, -25, 40, -24, -23, -16, 39, -10]) == [-50]", "assert in_range_scaled([5, 45, -7, 58]) == [-35, 25]", "assert in_range_scaled([51, 36, -17]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([-11, -8, -24, 40, 49, 10]) == [-55, -40, 50]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([17, -4, 20, -9, -2, -24, 14, 22]) == [-45, -20, -10, 70]\nassert in_range_scaled([-5, 46, 16, 24, 12, -3, -14, 39, -19]) == [-70, -25, -15, 60]\nassert in_range_scaled([37, -25, 40, -24, -23, -16, 39, -10]) == [-50]\nassert in_range_scaled([5, 45, -7, 58]) == [-35, 25]\nassert in_range_scaled([51, 36, -17]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([-11, -8, -24, 40, 49, 10]) == [-55, -40, 50]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= 14)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -14 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -14 ≤ x ≤ 14، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([17, -4, 20, -9, -2, -24, 14, 22])` يُرجع `[-45, -20, -10, 70]`.\nالجواب:", "qhash": "c03732403e7a7c4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(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 count_div([24, 17, 54, 42, 0, 48, 85, 70]) == 1", "assert count_div([18, 2, 2, 8, 6, 80, -37, 88, 40, 9, 59, 24]) == 0", "assert count_div([-13, -20, 31, 43, 88, 27, 61, -7, 89, 46, -18]) == 1", "assert count_div([84, 37, -40, 89, -7, 69, 9, -13, -28, 79]) == 2", "assert count_div([19, 36]) == 0", "assert count_div([-24, -35, 49, 72, -10, 15, -38, 63, 23, -6, 26, -5]) == 2", "assert count_div([]) == 0"], "test_code": "assert count_div([24, 17, 54, 42, 0, 48, 85, 70]) == 1\nassert count_div([18, 2, 2, 8, 6, 80, -37, 88, 40, 9, 59, 24]) == 0\nassert count_div([-13, -20, 31, 43, 88, 27, 61, -7, 89, 46, -18]) == 1\nassert count_div([84, 37, -40, 89, -7, 69, 9, -13, -28, 79]) == 2\nassert count_div([19, 36]) == 0\nassert count_div([-24, -35, 49, 72, -10, 15, -38, 63, 23, -6, 26, -5]) == 2\nassert count_div([]) == 0", "answer": "def count_div(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 count_div(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 count_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_div([24, 17, 54, 42, 0, 48, 85, 70])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "f3e9cfc8a85a5ce9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 166\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 = 166\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": "26d7ff5ac982cd12", "answer": "111", "completion": " الناتج:\n```text\n111\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([75, 10, 61, 9, 60, 7, 34]) == 2", "assert tally_div([70, 6, -9, 28, -29, 7, -3, 57, 15, 37, 26, 75]) == 5", "assert tally_div([85, 42, 30, 13, 30, 24, 84, -17, -19, -40, 17, 3]) == 1", "assert tally_div([-6, 61, 36, -27]) == 1", "assert tally_div([12, 34, 74, 87, -18]) == 1", "assert tally_div([24]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([75, 10, 61, 9, 60, 7, 34]) == 2\nassert tally_div([70, 6, -9, 28, -29, 7, -3, 57, 15, 37, 26, 75]) == 5\nassert tally_div([85, 42, 30, 13, 30, 24, 84, -17, -19, -40, 17, 3]) == 1\nassert tally_div([-6, 61, 36, -27]) == 1\nassert tally_div([12, 34, 74, 87, -18]) == 1\nassert tally_div([24]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([75, 10, 61, 9, 60, 7, 34])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "25473fa84b098baf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "tests": ["assert pow_digits(57733) == 51", "assert pow_digits(476318) == 53", "assert pow_digits(58539) == 38", "assert pow_digits(628756) == 14", "assert pow_digits(436379) == 0", "assert pow_digits(55517) == 53", "assert pow_digits(106192) == 67", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(57733) == 51\nassert pow_digits(476318) == 53\nassert pow_digits(58539) == 38\nassert pow_digits(628756) == 14\nassert pow_digits(436379) == 0\nassert pow_digits(55517) == 53\nassert pow_digits(106192) == 67\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 74.\nللتوضيح: الاستدعاء `pow_digits(57733)` يُرجع `51`.\nالجواب:", "qhash": "8d8a0f07d56f7742"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'ghr'}", "tests": ["assert char_counts('to') == {'g': 0, 'h': 0, 'r': 0}", "assert char_counts('we light window') == {'g': 1, 'h': 1, 'r': 0}", "assert char_counts('python table') == {'g': 0, 'h': 1, 'r': 0}", "assert char_counts('banana planet coffee') == {'g': 0, 'h': 0, 'r': 0}", "assert char_counts('camel signal winter apple up table') == {'g': 1, 'h': 0, 'r': 1}", "assert char_counts('table table') == {'g': 0, 'h': 0, 'r': 0}", "assert char_counts('') == {'g': 0, 'h': 0, 'r': 0}"], "test_code": "assert char_counts('to') == {'g': 0, 'h': 0, 'r': 0}\nassert char_counts('we light window') == {'g': 1, 'h': 1, 'r': 0}\nassert char_counts('python table') == {'g': 0, 'h': 1, 'r': 0}\nassert char_counts('banana planet coffee') == {'g': 0, 'h': 0, 'r': 0}\nassert char_counts('camel signal winter apple up table') == {'g': 1, 'h': 0, 'r': 1}\nassert char_counts('table table') == {'g': 0, 'h': 0, 'r': 0}\nassert char_counts('') == {'g': 0, 'h': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'ghr'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'ghr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'h'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('to')` يُرجع `{'g': 0, 'h': 0, 'r': 0}`.\nالجواب:", "qhash": "406c46c3bec3266d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [33, 30, 7, 8, 3, 9, 6, 19, 27]\nprint(lst[0:3])\nprint(lst[::-1])\nprint(sum(lst[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [33, 30, 7, 8, 3, 9, 6, 19, 27]\nprint(lst[0:3])\nprint(lst[::-1])\nprint(sum(lst[0:3]))\n```\nالجواب:", "qhash": "0298c518912baa6d", "answer": "[33, 30, 7]\n[27, 19, 6, 9, 3, 8, 7, 30, 33]\n70", "completion": " الناتج:\n```text\n[33, 30, 7]\n[27, 19, 6, 9, 3, 8, 7, 30, 33]\n70\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'vector'\nprint(word[::-1])\nprint(word.capitalize())\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'vector'\nprint(word[::-1])\nprint(word.capitalize())\nprint(word.split('_'))\n```\nالجواب:", "qhash": "865c7155de70a16f", "answer": "rotcev\nVector\n['vector']", "completion": " الناتج:\n```text\nrotcev\nVector\n['vector']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 127:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([22, 6, 36, 68, 10, 16, 36]) == [22, 28, 64, 0, 10, 26, 62]", "assert running_sum([90, 64, 26, 122, 34, 0, 106, 6, 6]) == [90, 0, 26, 0, 34, 34, 0, 6, 12]", "assert running_sum([-9, 66]) == [-9, 57]", "assert running_sum([0, 70, 71, 61, 58, 114]) == [0, 70, 0, 61, 119, 0]", "assert running_sum([15, 31, 72, 102, 109, 25, 30, 94]) == [15, 46, 118, 0, 109, 0, 30, 124]", "assert running_sum([4, 116, 10, 109, 45]) == [4, 120, 0, 109, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([22, 6, 36, 68, 10, 16, 36]) == [22, 28, 64, 0, 10, 26, 62]\nassert running_sum([90, 64, 26, 122, 34, 0, 106, 6, 6]) == [90, 0, 26, 0, 34, 34, 0, 6, 12]\nassert running_sum([-9, 66]) == [-9, 57]\nassert running_sum([0, 70, 71, 61, 58, 114]) == [0, 70, 0, 61, 119, 0]\nassert running_sum([15, 31, 72, 102, 109, 25, 30, 94]) == [15, 46, 118, 0, 109, 0, 30, 124]\nassert running_sum([4, 116, 10, 109, 45]) == [4, 120, 0, 109, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 127:\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 > 127:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 127 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([22, 6, 36, 68, 10, 16, 36])` يجب أن تُرجع `[22, 28, 64, 0, 10, 26, 62]`.\nالجواب:", "qhash": "7a84fbe03b45bb4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [37, -2, 10, 32, 0, 40, 2]\nprint(data[0:7])\nprint(data[::-2])\nprint(len(data[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [37, -2, 10, 32, 0, 40, 2]\nprint(data[0:7])\nprint(data[::-2])\nprint(len(data[0:7]))\n```\nالجواب:", "qhash": "75e358167af2e627", "answer": "[37, -2, 10, 32, 0, 40, 2]\n[2, 0, 10, 37]\n7", "completion": " الناتج:\n```text\n[37, -2, 10, 32, 0, 40, 2]\n[2, 0, 10, 37]\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([4, 30, 38, 28, 43, 63, 39]) == 1", "assert div_not([47, 47, -31, -17, 23, -36, 44, 31]) == 0", "assert div_not([9, 10, 9, 84, 50]) == 0", "assert div_not([26, 79, 41, 45]) == 0", "assert div_not([65, 8, -19]) == 0", "assert div_not([44, 59, -9, 47, 27, -38, 51, 2, 54, 26, 38, 40]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([4, 30, 38, 28, 43, 63, 39]) == 1\nassert div_not([47, 47, -31, -17, 23, -36, 44, 31]) == 0\nassert div_not([9, 10, 9, 84, 50]) == 0\nassert div_not([26, 79, 41, 45]) == 0\nassert div_not([65, 8, -19]) == 0\nassert div_not([44, 59, -9, 47, 27, -38, 51, 2, 54, 26, 38, 40]) == 1\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([4, 30, 38, 28, 43, 63, 39])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "a132c3bac63b86e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [29, -8, 40, 20, 11, 19]\nprint(nums[1:6])\nprint(nums[::2])\nprint(max(nums[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [29, -8, 40, 20, 11, 19]\nprint(nums[1:6])\nprint(nums[::2])\nprint(max(nums[1:6]))\n```\nالجواب:", "qhash": "163345bb28e5e2f3", "answer": "[-8, 40, 20, 11, 19]\n[29, 40, 11]\n40", "completion": " الناتج:\n```text\n[-8, 40, 20, 11, 19]\n[29, 40, 11]\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'راشد': 13, 'يوسف': 46, 'ليلى': 45, 'سلمى': 2}\npoints['ليلى'] += 10\npoints['نور'] = 28\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 = {'راشد': 13, 'يوسف': 46, 'ليلى': 45, 'سلمى': 2}\npoints['ليلى'] += 10\npoints['نور'] = 28\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": "3d34e2b7f8ebc226", "answer": "5\nليلى\n144\n[('سلمى', 2), ('راشد', 13)]", "completion": " الناتج:\n```text\n5\nليلى\n144\n[('سلمى', 2), ('راشد', 13)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 250\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 = 250\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": "541e9e0886974220", "answer": "109", "completion": " الناتج:\n```text\n109\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('banana we cloud we camel') == 'camel we cloud we banana'", "assert reverse_words('it') == 'it'", "assert reverse_words('pixel a we river') == 'river we pixel'", "assert reverse_words('music river falcon') == 'falcon river music'", "assert reverse_words('desert winter engine a signal planet river') == 'river planet signal engine winter desert'", "assert reverse_words('falcon banana is we banana') == 'banana we is banana falcon'", "assert reverse_words('a of summer') == 'summer of'"], "test_code": "assert reverse_words('banana we cloud we camel') == 'camel we cloud we banana'\nassert reverse_words('it') == 'it'\nassert reverse_words('pixel a we river') == 'river we pixel'\nassert reverse_words('music river falcon') == 'falcon river music'\nassert reverse_words('desert winter engine a signal planet river') == 'river planet signal engine winter desert'\nassert reverse_words('falcon banana is we banana') == 'banana we is banana falcon'\nassert reverse_words('a of summer') == 'summer of'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `reverse_words('banana we cloud we camel')` يُرجع `'camel we cloud we banana'`.\nالجواب:", "qhash": "7c6f261504b58b8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert cycle([10, 27, 11, 40, 11, 27]) == [11, 27, 10, 27, 11, 40]", "assert cycle([21, 40]) == [21, 40]", "assert cycle([16, 6, 43, 25, -7]) == [6, 43, 25, -7, 16]", "assert cycle([27, -2, 4, 46, 14, 27, 37, 49, -1, 38, 39]) == [-1, 38, 39, 27, -2, 4, 46, 14, 27, 37, 49]", "assert cycle([37, 22, 46, -1, 26, 36, 14]) == [37, 22, 46, -1, 26, 36, 14]", "assert cycle([44, 6, 46, 32, 47, 7, 20]) == [44, 6, 46, 32, 47, 7, 20]", "assert cycle([]) == []"], "test_code": "assert cycle([10, 27, 11, 40, 11, 27]) == [11, 27, 10, 27, 11, 40]\nassert cycle([21, 40]) == [21, 40]\nassert cycle([16, 6, 43, 25, -7]) == [6, 43, 25, -7, 16]\nassert cycle([27, -2, 4, 46, 14, 27, 37, 49, -1, 38, 39]) == [-1, 38, 39, 27, -2, 4, 46, 14, 27, 37, 49]\nassert cycle([37, 22, 46, -1, 26, 36, 14]) == [37, 22, 46, -1, 26, 36, 14]\nassert cycle([44, 6, 46, 32, 47, 7, 20]) == [44, 6, 46, 32, 47, 7, 20]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return ____\n```\nمثال: `cycle([10, 27, 11, 40, 11, 27])` يجب أن تُرجع `[11, 27, 10, 27, 11, 40]`.\nالجواب:", "qhash": "c67b64bb78257bc2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 61) == 1)", "tests": ["assert count_gcd1(15) == 15", "assert count_gcd1(34) == 34", "assert count_gcd1(9) == 9", "assert count_gcd1(87) == 86", "assert count_gcd1(171) == 169", "assert count_gcd1(98) == 97", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(15) == 15\nassert count_gcd1(34) == 34\nassert count_gcd1(9) == 9\nassert count_gcd1(87) == 86\nassert count_gcd1(171) == 169\nassert count_gcd1(98) == 97\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 61، أي أن القاسم المشترك الأكبر لها مع 61 يساوي 1.\nمثال: `count_gcd1(15)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "66293f89cf422de5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 27) == 1)", "tests": ["assert coprimes(113) == 76", "assert coprimes(53) == 36", "assert coprimes(38) == 26", "assert coprimes(118) == 79", "assert coprimes(38) == 26", "assert coprimes(15) == 10", "assert coprimes(1) == 1"], "test_code": "assert coprimes(113) == 76\nassert coprimes(53) == 36\nassert coprimes(38) == 26\nassert coprimes(118) == 79\nassert coprimes(38) == 26\nassert coprimes(15) == 10\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, 27) == 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, 27) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 27، أي أن القاسم المشترك الأكبر لها مع 27 يساوي 1.\nمثال: `coprimes(113)` يجب أن تُرجع `76`.\nالجواب:", "qhash": "ea02805d47e1db90"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'حاسوب قلم'\nprint(s.replace(' ', '-'))\nprint(s[0])\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'حاسوب قلم'\nprint(s.replace(' ', '-'))\nprint(s[0])\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "75a00a766a2ea206", "answer": "حاسوب-قلم\nح\n8", "completion": " الناتج:\n```text\nحاسوب-قلم\nح\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 13\nfor n in range(6, 27, 3):\n s -= n * 4\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 13\nfor n in range(6, 27, 3):\n s -= n * 4\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "8761cbade4bee297", "answer": "-407\n24", "completion": " الناتج:\n```text\n-407\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(43) == 126", "assert multiples_total(43) == 126", "assert multiples_total(27) == 63", "assert multiples_total(192) == 2979", "assert multiples_total(269) == 5943", "assert multiples_total(178) == 2610", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(43) == 126\nassert multiples_total(43) == 126\nassert multiples_total(27) == 63\nassert multiples_total(192) == 2979\nassert multiples_total(269) == 5943\nassert multiples_total(178) == 2610\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 12.\nمثال: `multiples_total(43)` يجب أن تُرجع `126`.\nالجواب:", "qhash": "dabc1cf7983d0242"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 28)", "tests": ["assert pick_between([38, -17, 17, 15, 37, -1, 29, 0, -17, 6]) == [-5, 0, 30, 75, 85]", "assert pick_between([43, 58, 40, 38, 8, 32, 21, -20, 25, 40]) == [40, 105, 125]", "assert pick_between([-14, 5, 28, 10, 37, 56, 44]) == [25, 50, 140]", "assert pick_between([7, 55, 31, -19, 54, 47, 17, 9]) == [35, 45, 85]", "assert pick_between([-13, 47, -27, 22, 34, -12, 10]) == [50, 110]", "assert pick_between([8, -8, 40]) == [40]", "assert pick_between([-6, 20, 10, 31, 17, -12, 55, 17, 54]) == [-30, 50, 85, 85, 100]", "assert pick_between([]) == []"], "test_code": "assert pick_between([38, -17, 17, 15, 37, -1, 29, 0, -17, 6]) == [-5, 0, 30, 75, 85]\nassert pick_between([43, 58, 40, 38, 8, 32, 21, -20, 25, 40]) == [40, 105, 125]\nassert pick_between([-14, 5, 28, 10, 37, 56, 44]) == [25, 50, 140]\nassert pick_between([7, 55, 31, -19, 54, 47, 17, 9]) == [35, 45, 85]\nassert pick_between([-13, 47, -27, 22, 34, -12, 10]) == [50, 110]\nassert pick_between([8, -8, 40]) == [40]\nassert pick_between([-6, 20, 10, 31, 17, -12, 55, 17, 54]) == [-30, 50, 85, 85, 100]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 28)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 28)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -7 ≤ x ≤ 28، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([38, -17, 17, 15, 37, -1, 29, 0, -17, 6])` يُرجع `[-5, 0, 30, 75, 85]`.\nالجواب:", "qhash": "0bec94d932b14a84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سلام ميناء نهار كتاب تفاحة جمل') == 0", "assert begin_count('تفاحة همل عربية صحراء نهر همل حديقة') == 2", "assert begin_count('جمل فجر نهر همل مطر همل') == 2", "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('تفاحة همل عربية صحراء نهر همل حديقة') == 2\nassert begin_count('جمل فجر نهر همل مطر همل') == 2\nassert begin_count('باب ميناء ماء ميناء') == 0\nassert begin_count('شمس سلام صحراء سلام طالب') == 0\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 'ه' in w:\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 'ه' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('رمل همل كتاب نهر ليل سوق')` يُرجع `1`.\nالجواب:", "qhash": "656c01436137abe2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 54070\nsteps = 0\nwhile m > 1:\n m = m // 7\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 54070\nsteps = 0\nwhile m > 1:\n m = m // 7\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "5ba4f5a734ee8069", "answer": "0 6", "completion": " الناتج:\n```text\n0 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [-7, 8, 29, -7, 34]\nprint(xs[2:5])\nprint(xs[::3])\nprint(max(xs[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [-7, 8, 29, -7, 34]\nprint(xs[2:5])\nprint(xs[::3])\nprint(max(xs[2:5]))\n```\nالجواب:", "qhash": "b8c942a18589528f", "answer": "[29, -7, 34]\n[-7, -7]\n34", "completion": " الناتج:\n```text\n[29, -7, 34]\n[-7, -7]\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(10) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', 'Yo', '10']", "assert fizz(6) == ['1', '2', '3', 'Hi', '5', '6']", "assert fizz(2) == ['1', '2']", "assert fizz(8) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi']", "assert fizz(8) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi']"], "test_code": "assert fizz(10) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', 'Yo', '10']\nassert fizz(6) == ['1', '2', '3', 'Hi', '5', '6']\nassert fizz(2) == ['1', '2']\nassert fizz(8) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi']\nassert fizz(8) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\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 % 4 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Hi'، وإن قَبِلها على 9 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(10)` يُرجع `['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', 'Yo', '10']`.\nالجواب:", "qhash": "c74498d70729ff0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 317\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 = 317\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": "a1b392b8fb8cf8fc", "answer": "37", "completion": " الناتج:\n```text\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'winter_signal'\nprint(name.index('e') + len(name))\nprint(name.split('_'))\nprint(name.replace('e', 'X'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'winter_signal'\nprint(name.index('e') + len(name))\nprint(name.split('_'))\nprint(name.replace('e', 'X'))\n```\nالجواب:", "qhash": "93e1d6ed4c36c68b", "answer": "17\n['winter', 'signal']\nwintXr_signal", "completion": " الناتج:\n```text\n17\n['winter', 'signal']\nwintXr_signal\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47", "tests": ["assert fact_mod(6) == 18", "assert fact_mod(36) == 40", "assert fact_mod(20) == 19", "assert fact_mod(34) == 22", "assert fact_mod(47) == 0", "assert fact_mod(1) == 1", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 18\nassert fact_mod(36) == 40\nassert fact_mod(20) == 19\nassert fact_mod(34) == 22\nassert fact_mod(47) == 0\nassert fact_mod(1) == 1\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 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": "02351bca2c90c15a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -9 <= x <= 20)", "tests": ["assert in_range_scaled([14, 1, 14, -17, 28, 15]) == [-75, -70, -70, -5]", "assert in_range_scaled([0, 41, -15, -23, 52, 36, 36, 52, 20, 3]) == [-100, -15, 0]", "assert in_range_scaled([]) == []", "assert in_range_scaled([-5, -26, 53, 49, 7]) == [-35, 25]", "assert in_range_scaled([12, 44, 57, -29, 52, -25, -30]) == [-60]", "assert in_range_scaled([46]) == []", "assert in_range_scaled([45, 16, -1, 6, 1]) == [-80, -30, -5, 5]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([14, 1, 14, -17, 28, 15]) == [-75, -70, -70, -5]\nassert in_range_scaled([0, 41, -15, -23, 52, 36, 36, 52, 20, 3]) == [-100, -15, 0]\nassert in_range_scaled([]) == []\nassert in_range_scaled([-5, -26, 53, 49, 7]) == [-35, 25]\nassert in_range_scaled([12, 44, 57, -29, 52, -25, -30]) == [-60]\nassert in_range_scaled([46]) == []\nassert in_range_scaled([45, 16, -1, 6, 1]) == [-80, -30, -5, 5]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -9 <= x <= 20)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -9 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و20 (شاملًا الطرفين) في -5.\nمثال: `in_range_scaled([14, 1, 14, -17, 28, 15])` يجب أن تُرجع `[-75, -70, -70, -5]`.\nالجواب:", "qhash": "22732903f23b05d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'حصان'\nprint(kalima[::-1])\nprint(kalima.find('ن'))\nprint(kalima[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'حصان'\nprint(kalima[::-1])\nprint(kalima.find('ن'))\nprint(kalima[0])\n```\nالجواب:", "qhash": "2363481b5c4d9010", "answer": "ناصح\n3\nح", "completion": " الناتج:\n```text\nناصح\n3\nح\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'table'\nprint(word.find('l'))\nprint(word.index('l') + len(word))\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'table'\nprint(word.find('l'))\nprint(word.index('l') + len(word))\nprint(len(word))\n```\nالجواب:", "qhash": "64158f3efd9120b0", "answer": "3\n8\n5", "completion": " الناتج:\n```text\n3\n8\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('to we apple garden') == 'garden|apple|we|to'", "assert flip_words('coffee') == 'coffee'", "assert flip_words('by camel data brain planet') == 'planet|brain|data|camel|by'", "assert flip_words('coffee window summer on code is') == 'is|code|on|summer|window|coffee'", "assert flip_words('camel') == 'camel'", "assert flip_words('in') == 'in'", "assert flip_words('planet') == 'planet'"], "test_code": "assert flip_words('to we apple garden') == 'garden|apple|we|to'\nassert flip_words('coffee') == 'coffee'\nassert flip_words('by camel data brain planet') == 'planet|brain|data|camel|by'\nassert flip_words('coffee window summer on code is') == 'is|code|on|summer|window|coffee'\nassert flip_words('camel') == 'camel'\nassert flip_words('in') == 'in'\nassert flip_words('planet') == 'planet'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `flip_words('to we apple garden')` يُرجع `'garden|apple|we|to'`.\nالجواب:", "qhash": "3c6b47d3664a7f6b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)", "tests": ["assert sum_div(67) == 1064", "assert sum_div(243) == 13560", "assert sum_div(87) == 1758", "assert sum_div(144) == 4739", "assert sum_div(215) == 10608", "assert sum_div(220) == 11258", "assert sum_div(1) == 0"], "test_code": "assert sum_div(67) == 1064\nassert sum_div(243) == 13560\nassert sum_div(87) == 1758\nassert sum_div(144) == 4739\nassert sum_div(215) == 10608\nassert sum_div(220) == 11258\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 % 5 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 5.\nمثال: `sum_div(67)` يجب أن تُرجع `1064`.\nالجواب:", "qhash": "86cf9aa90ac80397"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(11) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11']", "assert play(3) == ['1', '2', '3']", "assert play(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']", "assert play(9) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz']", "assert play(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22']"], "test_code": "assert play(11) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11']\nassert play(3) == ['1', '2', '3']\nassert play(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']\nassert play(9) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz']\nassert play(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22']", "answer": "def play(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 play(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سؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Fizz'، وإن قَبِلها على 9 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(11)` يُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11']`.\nالجواب:", "qhash": "c8c939953a2d05a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'garden'\nprint(name.replace('g', '*'))\nprint(name.upper())\nprint(name.index('g') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'garden'\nprint(name.replace('g', '*'))\nprint(name.upper())\nprint(name.index('g') + len(name))\n```\nالجواب:", "qhash": "3d69e2c8e7e3b228", "answer": "*arden\nGARDEN\n6", "completion": " الناتج:\n```text\n*arden\nGARDEN\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert turn_list([48, 33, 9, 12, 39, 39]) == [39, 48, 33, 9, 12, 39]", "assert turn_list([0, 34]) == [34, 0]", "assert turn_list([38, 30, 50]) == [50, 38, 30]", "assert turn_list([35, 19, 11, 15, 13, 10, 44, 45, 26, -1, 44]) == [-1, 44, 35, 19, 11, 15, 13, 10, 44, 45, 26]", "assert turn_list([-3, -9, 39, -6, 19, 29, 11, 43, 29, 32, 49, 31]) == [31, -3, -9, 39, -6, 19, 29, 11, 43, 29, 32, 49]", "assert turn_list([33, 9, 21, 25, 1, 35, 10, -9, 44, 9, 22, -2]) == [-2, 33, 9, 21, 25, 1, 35, 10, -9, 44, 9, 22]", "assert turn_list([]) == []"], "test_code": "assert turn_list([48, 33, 9, 12, 39, 39]) == [39, 48, 33, 9, 12, 39]\nassert turn_list([0, 34]) == [34, 0]\nassert turn_list([38, 30, 50]) == [50, 38, 30]\nassert turn_list([35, 19, 11, 15, 13, 10, 44, 45, 26, -1, 44]) == [-1, 44, 35, 19, 11, 15, 13, 10, 44, 45, 26]\nassert turn_list([-3, -9, 39, -6, 19, 29, 11, 43, 29, 32, 49, 31]) == [31, -3, -9, 39, -6, 19, 29, 11, 43, 29, 32, 49]\nassert turn_list([33, 9, 21, 25, 1, 35, 10, -9, 44, 9, 22, -2]) == [-2, 33, 9, 21, 25, 1, 35, 10, -9, 44, 9, 22]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 13 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 13 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([48, 33, 9, 12, 39, 39])` يُرجع `[39, 48, 33, 9, 12, 39]`.\nالجواب:", "qhash": "4be65c767149a662"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(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 largest_div([-4, 30, -5, -24, 7, -19]) == 30", "assert largest_div([-6, -30, -12]) == -6", "assert largest_div([1, 7, 13]) == None", "assert largest_div([19, -23, 16, 30, -24, 26, -33, 29]) == 30", "assert largest_div([-16, 21, -46, 2]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([-4, 30, -5, -24, 7, -19]) == 30\nassert largest_div([-6, -30, -12]) == -6\nassert largest_div([1, 7, 13]) == None\nassert largest_div([19, -23, 16, 30, -24, 26, -33, 29]) == 30\nassert largest_div([-16, 21, -46, 2]) == None\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(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للتوضيح: الاستدعاء `largest_div([-4, 30, -5, -24, 7, -19])` يُرجع `30`.\nالجواب:", "qhash": "5465dca5bd7b9668"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 10 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']", "assert play(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19']", "assert play(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar', 'Foo', '22', '23', '24', '25']", "assert play(18) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18']", "assert play(21) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar', 'Foo']"], "test_code": "assert play(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']\nassert play(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19']\nassert play(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar', 'Foo', '22', '23', '24', '25']\nassert play(18) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18']\nassert play(21) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar', 'Foo']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 10 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(20)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']`.\nالجواب:", "qhash": "f42470c80d901b31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 77", "tests": ["assert digit_power(71813) == 1", "assert digit_power(81217) == 21", "assert digit_power(154772) == 66", "assert digit_power(903756) == 67", "assert digit_power(134719) == 48", "assert digit_power(978616) == 53", "assert digit_power(487955) == 13", "assert digit_power(0) == 0"], "test_code": "assert digit_power(71813) == 1\nassert digit_power(81217) == 21\nassert digit_power(154772) == 66\nassert digit_power(903756) == 67\nassert digit_power(134719) == 48\nassert digit_power(978616) == 53\nassert digit_power(487955) == 13\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 77", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 77.\nللتوضيح: الاستدعاء `digit_power(71813)` يُرجع `1`.\nالجواب:", "qhash": "d51928336e19b11a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "mirror_words", "reference": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert mirror_words('it apple it window') == 'window'", "assert mirror_words('brain river window coffee garden to river desert') == 'desert garden coffee window'", "assert mirror_words('summer') == 'summer'", "assert mirror_words('light data light cloud') == ''", "assert mirror_words('by an') == ''", "assert mirror_words('at in') == ''", "assert mirror_words('matrix orange brain music an') == 'orange matrix'"], "test_code": "assert mirror_words('it apple it window') == 'window'\nassert mirror_words('brain river window coffee garden to river desert') == 'desert garden coffee window'\nassert mirror_words('summer') == 'summer'\nassert mirror_words('light data light cloud') == ''\nassert mirror_words('by an') == ''\nassert mirror_words('at in') == ''\nassert mirror_words('matrix orange brain music an') == 'orange matrix'", "answer": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `mirror_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ' '.\nمثال: `mirror_words('it apple it window')` يجب أن تُرجع `'window'`.\nالجواب:", "qhash": "a8d00d79077fb93c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('banana of we window Hello') == 'hgtgtg ul ck cotjuc Hkrru'", "assert cipher('python') == 'veznut'", "assert cipher('in camel data') == 'ot igskr jgzg'", "assert cipher('music is') == 'sayoi oy'", "assert cipher('brain vector we camel') == 'hxgot bkizux ck igskr'", "assert cipher('vector summer OK') == 'bkizux yasskx OK'", "assert cipher('') == ''"], "test_code": "assert cipher('banana of we window Hello') == 'hgtgtg ul ck cotjuc Hkrru'\nassert cipher('python') == 'veznut'\nassert cipher('in camel data') == 'ot igskr jgzg'\nassert cipher('music is') == 'sayoi oy'\nassert cipher('brain vector we camel') == 'hxgot bkizux ck igskr'\nassert cipher('vector summer OK') == 'bkizux yasskx OK'\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 + (-20)) % 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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('banana of we window Hello')` يُرجع `'hgtgtg ul ck cotjuc Hkrru'`.\nالجواب:", "qhash": "a36bb19e61378caf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18", "tests": ["assert dig_pow_mod(71688) == 16", "assert dig_pow_mod(894402) == 1", "assert dig_pow_mod(64949) == 14", "assert dig_pow_mod(58647) == 10", "assert dig_pow_mod(7740) == 6", "assert dig_pow_mod(193411) == 1", "assert dig_pow_mod(321061) == 15", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(71688) == 16\nassert dig_pow_mod(894402) == 1\nassert dig_pow_mod(64949) == 14\nassert dig_pow_mod(58647) == 10\nassert dig_pow_mod(7740) == 6\nassert dig_pow_mod(193411) == 1\nassert dig_pow_mod(321061) == 15\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 18.\nمثال: `dig_pow_mod(71688)` يجب أن تُرجع `16`.\nالجواب:", "qhash": "94647106eb838b99"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 0:\n return 5\n return 3 * f(n - 1) + 2\n\nprint(f(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 0:\n return 5\n return 3 * f(n - 1) + 2\n\nprint(f(8))\n```\nالجواب:", "qhash": "9a0a5b1fe5af58a8", "answer": "39365", "completion": " الناتج:\n```text\n39365\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'تفاحة لغة'\nprint(w[::-1])\nprint(w.replace(' ', '-'))\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'تفاحة لغة'\nprint(w[::-1])\nprint(w.replace(' ', '-'))\nprint(w.split())\n```\nالجواب:", "qhash": "7035270dae25d7fc", "answer": "ةغل ةحافت\nتفاحة-لغة\n['تفاحة', 'لغة']", "completion": " الناتج:\n```text\nةغل ةحافت\nتفاحة-لغة\n['تفاحة', 'لغة']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('engine on banana OK') == 'gpikpg qp dcpcpc OK'", "assert rot('code apple 2024') == 'eqfg crrng 2024'", "assert rot('go cloud signal 2024') == 'iq enqwf ukipcn 2024'", "assert rot('pixel camel desert engine code A1') == 'rkzgn ecogn fgugtv gpikpg eqfg A1'", "assert rot('planet music A1') == 'rncpgv owuke A1'", "assert rot('brain') == 'dtckp'", "assert rot('') == ''"], "test_code": "assert rot('engine on banana OK') == 'gpikpg qp dcpcpc OK'\nassert rot('code apple 2024') == 'eqfg crrng 2024'\nassert rot('go cloud signal 2024') == 'iq enqwf ukipcn 2024'\nassert rot('pixel camel desert engine code A1') == 'rkzgn ecogn fgugtv gpikpg eqfg A1'\nassert rot('planet music A1') == 'rncpgv owuke A1'\nassert rot('brain') == 'dtckp'\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 + (-24)) % 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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('engine on banana OK')` يُرجع `'gpikpg qp dcpcpc OK'`.\nالجواب:", "qhash": "3ae933457d5b8bbb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "words_starting", "reference": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ي'):\n count += 1\n return count", "tests": ["assert words_starting('يمل قلم ميناء سفينة نور سوق يمل') == 2", "assert words_starting('طالب قلم') == 0", "assert words_starting('سلام يمل شمس رمل يمل شجرة') == 2", "assert words_starting('حصان لغة نهر معلم') == 0", "assert words_starting('شجرة مطر ميناء لغة نهار') == 0", "assert words_starting('يمل حديقة يمل صحراء حديقة قلم دفتر مدينة') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('يمل قلم ميناء سفينة نور سوق يمل') == 2\nassert words_starting('طالب قلم') == 0\nassert words_starting('سلام يمل شمس رمل يمل شجرة') == 2\nassert words_starting('حصان لغة نهر معلم') == 0\nassert words_starting('شجرة مطر ميناء لغة نهار') == 0\nassert words_starting('يمل حديقة يمل صحراء حديقة قلم دفتر مدينة') == 2\nassert words_starting('') == 0", "answer": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ي'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ي'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(s):\n count = 0\n for w in s.split():\n if 'ي' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ي»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef words_starting(s):\n count = 0\n for w in s.split():\n if 'ي' in w:\n count += 1\n return count\n```\nمثال: `words_starting('يمل قلم ميناء سفينة نور سوق يمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "0d2a7d4b8ff6dcd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 23)", "tests": ["assert clip_scale([18, 21, 18, 33, 11, 12]) == [22, 24, 36, 36, 42]", "assert clip_scale([-15, 26, -18, 29, 15, 13]) == [26, 30]", "assert clip_scale([-4]) == []", "assert clip_scale([19, -20, -5, -5]) == [38]", "assert clip_scale([1, -9, 20, -17, 42, 8]) == [40]", "assert clip_scale([31, -23, 3]) == []", "assert clip_scale([-19, 12]) == [24]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([18, 21, 18, 33, 11, 12]) == [22, 24, 36, 36, 42]\nassert clip_scale([-15, 26, -18, 29, 15, 13]) == [26, 30]\nassert clip_scale([-4]) == []\nassert clip_scale([19, -20, -5, -5]) == [38]\nassert clip_scale([1, -9, 20, -17, 42, 8]) == [40]\nassert clip_scale([31, -23, 3]) == []\nassert clip_scale([-19, 12]) == [24]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 23)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if 10 <= x <= 23)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 10 ≤ x ≤ 23، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([18, 21, 18, 33, 11, 12])` يُرجع `[22, 24, 36, 36, 42]`.\nالجواب:", "qhash": "a08e42aca63b35ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=8):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(12))\nprint(g(12, -3))\nprint(g(g(-3), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=8):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(12))\nprint(g(12, -3))\nprint(g(g(-3), 12))\n```\nالجواب:", "qhash": "efe6b45f8b0d5d5a", "answer": "-20\n-9\n-23", "completion": " الناتج:\n```text\n-20\n-9\n-23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('cloud music data code vector !') == 'radjs bjhxr spip rdst ktridg !'", "assert encode('in OK') == 'xc OK'", "assert encode('coffee to') == 'rduutt id'", "assert encode('cloud vector apple') == 'radjs ktridg peeat'", "assert encode('it OK') == 'xi OK'", "assert encode('by') == 'qn'", "assert encode('') == ''"], "test_code": "assert encode('cloud music data code vector !') == 'radjs bjhxr spip rdst ktridg !'\nassert encode('in OK') == 'xc OK'\nassert encode('coffee to') == 'rduutt id'\nassert encode('cloud vector apple') == 'radjs ktridg peeat'\nassert encode('it OK') == 'xi OK'\nassert encode('by') == 'qn'\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 + (-11)) % 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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('cloud music data code vector !')` يجب أن تُرجع `'radjs bjhxr spip rdst ktridg !'`.\nالجواب:", "qhash": "d6322e89d599aaac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert count_start('صديق باب امل') == 1", "assert count_start('امل نور عربية امل نهار سماء') == 2", "assert count_start('دفتر سلام معلم مطر') == 0", "assert count_start('امل سماء نور امل علم نور سيارة سيارة') == 2", "assert count_start('ماء عمل حديقة قلم عمل سيارة') == 0", "assert count_start('امل لغة امل ميناء') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('صديق باب امل') == 1\nassert count_start('امل نور عربية امل نهار سماء') == 2\nassert count_start('دفتر سلام معلم مطر') == 0\nassert count_start('امل سماء نور امل علم نور سيارة سيارة') == 2\nassert count_start('ماء عمل حديقة قلم عمل سيارة') == 0\nassert count_start('امل لغة امل ميناء') == 2\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(s):\n count = 0\n for w in s.split():\n if 'ا' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ا»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(s):\n count = 0\n for w in s.split():\n if 'ا' in w:\n count += 1\n return count\n```\nمثال: `count_start('صديق باب امل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "48fcf1464bf1e028"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=3):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(11))\nprint(g(11, -5))\nprint(g(g(-5), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=3):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(11))\nprint(g(11, -5))\nprint(g(g(-5), 11))\n```\nالجواب:", "qhash": "91a09c115e3e0707", "answer": "-58\n-50\n-75", "completion": " الناتج:\n```text\n-58\n-50\n-75\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('د'):\n count += 1\n return count", "tests": ["assert count_prefix('لغة دفتر سوق معلم دفتر') == 2", "assert count_prefix('بحر نهر دفتر حاسوب دفتر شمس قلم') == 2", "assert count_prefix('دفتر مدرسة ميناء دفتر سيارة سوق') == 2", "assert count_prefix('فجر خبز سيارة') == 0", "assert count_prefix('ماء طائرة رمل علم') == 0", "assert count_prefix('صحراء سلام دفتر دفتر دفتر') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('لغة دفتر سوق معلم دفتر') == 2\nassert count_prefix('بحر نهر دفتر حاسوب دفتر شمس قلم') == 2\nassert count_prefix('دفتر مدرسة ميناء دفتر سيارة سوق') == 2\nassert count_prefix('فجر خبز سيارة') == 0\nassert count_prefix('ماء طائرة رمل علم') == 0\nassert count_prefix('صحراء سلام دفتر دفتر دفتر') == 3\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('د'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(s):\n count = 0\n for w in s.split():\n if 'د' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «د». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_prefix(s):\n count = 0\n for w in s.split():\n if 'د' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('لغة دفتر سوق معلم دفتر')` يُرجع `2`.\nالجواب:", "qhash": "7385d9b7c3278db3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "tests": ["assert sum_div(219) == 5690", "assert sum_div(181) == 4088", "assert sum_div(60) == 435", "assert sum_div(145) == 2603", "assert sum_div(92) == 1050", "assert sum_div(113) == 1565", "assert sum_div(1) == 0"], "test_code": "assert sum_div(219) == 5690\nassert sum_div(181) == 4088\nassert sum_div(60) == 435\nassert sum_div(145) == 2603\nassert sum_div(92) == 1050\nassert sum_div(113) == 1565\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(219)` يُرجع `5690`.\nالجواب:", "qhash": "934569a9fc52b8c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 2:\n return 3\n return 1 * f(n - 1) + 4\n\nprint(f(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 2:\n return 3\n return 1 * f(n - 1) + 4\n\nprint(f(11))\n```\nالجواب:", "qhash": "f1b32f8c9a881fe1", "answer": "39", "completion": " الناتج:\n```text\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 12\nfor j in range(-3, 18, 2):\n total -= j * 9\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 12\nfor j in range(-3, 18, 2):\n total -= j * 9\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "93f7a1ba40b07812", "answer": "-681\n17", "completion": " الناتج:\n```text\n-681\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(6, 2))", "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, 2))\n```\nالجواب:", "qhash": "079d1f6a961d3cbe", "answer": "36", "completion": " الناتج:\n```text\n36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 5 for x in range(4, 9) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 5 for x in range(4, 9) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "c2f6b1233b99fbf7", "answer": "[44]\n1 44", "completion": " الناتج:\n```text\n[44]\n1 44\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'garden'\nprint(name.find('d'))\nprint(name[2:5])\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'garden'\nprint(name.find('d'))\nprint(name[2:5])\nprint(len(name))\n```\nالجواب:", "qhash": "36bdd9836def73ae", "answer": "3\nrde\n6", "completion": " الناتج:\n```text\n3\nrde\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(12) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping']", "assert fizz(20) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping', '17', 'Ping', '19', 'Ping']", "assert fizz(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping', '17', 'Ping']", "assert fizz(16) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping']", "assert fizz(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']"], "test_code": "assert fizz(12) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping']\nassert fizz(20) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping', '17', 'Ping', '19', 'Ping']\nassert fizz(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping', '17', 'Ping']\nassert fizz(16) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping', '13', 'PingPong', '15', 'Ping']\nassert fizz(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 7 == 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 % 2 == 0:\n s += 'Ping'\n if i % 7 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Ping'، وعلى 7 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(12)` يجب أن تُرجع `['1', 'Ping', '3', 'Ping', '5', 'Ping', 'Pong', 'Ping', '9', 'Ping', '11', 'Ping']`.\nالجواب:", "qhash": "815ebb9cadea9cb5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([25, 4, 47]) == [4, 47, 25]", "assert rotate_by([6]) == [6]", "assert rotate_by([47, 37]) == [37, 47]", "assert rotate_by([6, 15, 0, 4, 26, 23, 31, 5]) == [4, 26, 23, 31, 5, 6, 15, 0]", "assert rotate_by([2]) == [2]", "assert rotate_by([41, 41, 15, 15, 42, 48]) == [41, 15, 15, 42, 48, 41]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([25, 4, 47]) == [4, 47, 25]\nassert rotate_by([6]) == [6]\nassert rotate_by([47, 37]) == [37, 47]\nassert rotate_by([6, 15, 0, 4, 26, 23, 31, 5]) == [4, 26, 23, 31, 5, 6, 15, 0]\nassert rotate_by([2]) == [2]\nassert rotate_by([41, 41, 15, 15, 42, 48]) == [41, 15, 15, 42, 48, 41]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([25, 4, 47])` يُرجع `[4, 47, 25]`.\nالجواب:", "qhash": "36ce9b50f47b42ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'مريم': 7, 'سعيد': 43, 'أحمد': 50, 'عمر': 27}\nscores['أحمد'] += 19\nscores['فيصل'] = 5\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 = {'مريم': 7, 'سعيد': 43, 'أحمد': 50, 'عمر': 27}\nscores['أحمد'] += 19\nscores['فيصل'] = 5\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": "0a065ccb4f828bbd", "answer": "5\nأحمد\n151\n[('فيصل', 5), ('مريم', 7)]", "completion": " الناتج:\n```text\n5\nأحمد\n151\n[('فيصل', 5), ('مريم', 7)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(18) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13', '14', 'Ping', 'Pong', '17', 'Ping']", "assert label_numbers(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10']", "assert label_numbers(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13', '14', 'Ping', 'Pong', '17', 'Ping', '19']", "assert label_numbers(13) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13']", "assert label_numbers(1) == ['1']"], "test_code": "assert label_numbers(18) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13', '14', 'Ping', 'Pong', '17', 'Ping']\nassert label_numbers(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10']\nassert label_numbers(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13', '14', 'Ping', 'Pong', '17', 'Ping', '19']\nassert label_numbers(13) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13']\nassert label_numbers(1) == ['1']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Ping'\n if i % 8 == 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 % 3 == 0:\n s += 'Ping'\n if i % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Ping'، وعلى 8 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(18)` يجب أن تُرجع `['1', '2', 'Ping', '4', '5', 'Ping', '7', 'Pong', 'Ping', '10', '11', 'Ping', '13', '14', 'Ping', 'Pong', '17', 'Ping']`.\nالجواب:", "qhash": "9ab67b55c0f2841f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_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_div([39, 7, 1, 44, 11, 1, -17]) == 44", "assert max_div([-4, -6, -8]) == -4", "assert max_div([1, 3, 5, 7]) == None", "assert max_div([14, -4, 11]) == 14", "assert max_div([-14, -12, 49, 49]) == -12", "assert max_div([]) == None"], "test_code": "assert max_div([39, 7, 1, 44, 11, 1, -17]) == 44\nassert max_div([-4, -6, -8]) == -4\nassert max_div([1, 3, 5, 7]) == None\nassert max_div([14, -4, 11]) == 14\nassert max_div([-14, -12, 49, 49]) == -12\nassert max_div([]) == None", "answer": "def max_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_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_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_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مثال: `max_div([39, 7, 1, 44, 11, 1, -17])` يجب أن تُرجع `44`.\nالجواب:", "qhash": "c2040843c27aeaaf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ت'))", "tests": ["assert letter_hits('ليل كتاب بحر قمر باب') == 0", "assert letter_hits('نهار جبل صديق سماء مدينة') == 0", "assert letter_hits('بيت دفتر مدرسة برتقال خبز تفاحة برمجة') == 1", "assert letter_hits('علم حاسوب ماء مدينة لغة') == 0", "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('علم حاسوب ماء مدينة لغة') == 0\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 w.startswith('ت'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ت'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ت».\nمثال: `letter_hits('ليل كتاب بحر قمر باب')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "6e980e339d4ab11c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 15 == 0)", "tests": ["assert multiples_total(85) == 680", "assert multiples_total(55) == 275", "assert multiples_total(129) == 1625", "assert multiples_total(193) == 3705", "assert multiples_total(123) == 1500", "assert multiples_total(30) == 75", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(85) == 680\nassert multiples_total(55) == 275\nassert multiples_total(129) == 1625\nassert multiples_total(193) == 3705\nassert multiples_total(123) == 1500\nassert multiples_total(30) == 75\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 % 15 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(85)` يُرجع `680`.\nالجواب:", "qhash": "2a40f1ba8223d289"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'ماء معلم'\nprint(text.find('م'))\nprint(text.count('م'))\nprint('م' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'ماء معلم'\nprint(text.find('م'))\nprint(text.count('م'))\nprint('م' in text)\n```\nالجواب:", "qhash": "e63d7796898709ed", "answer": "0\n3\nTrue", "completion": " الناتج:\n```text\n0\n3\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'فجر مدرسة'\nprint(s.replace(' ', '-'))\nprint(s.find('ف'))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'فجر مدرسة'\nprint(s.replace(' ', '-'))\nprint(s.find('ف'))\nprint(s[-1])\n```\nالجواب:", "qhash": "7fe52a585770bdae", "answer": "فجر-مدرسة\n0\nة", "completion": " الناتج:\n```text\nفجر-مدرسة\n0\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('سعيد', 31), ('هشام', 27), ('أحمد', 21), ('رنا', 59)]\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 = [('سعيد', 31), ('هشام', 27), ('أحمد', 21), ('رنا', 59)]\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": "18bae03823df96e2", "answer": "[('أحمد', 21), ('هشام', 27), ('سعيد', 31), ('رنا', 59)]\n['رنا', 'سعيد']", "completion": " الناتج:\n```text\n[('أحمد', 21), ('هشام', 27), ('سعيد', 31), ('رنا', 59)]\n['رنا', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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_multiple([25, 38, 10, -21, 24, 45, -20, 14]) == 24", "assert max_multiple([-12, -36, -12]) == -12", "assert max_multiple([1, 13, 25, 37]) == None", "assert max_multiple([27, 32, 16, 32, -25]) == None", "assert max_multiple([-42, -3, 6]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([25, 38, 10, -21, 24, 45, -20, 14]) == 24\nassert max_multiple([-12, -36, -12]) == -12\nassert max_multiple([1, 13, 25, 37]) == None\nassert max_multiple([27, 32, 16, 32, -25]) == None\nassert max_multiple([-42, -3, 6]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(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_multiple(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_multiple(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_multiple(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_multiple([25, 38, 10, -21, 24, 45, -20, 14])` يُرجع `24`.\nالجواب:", "qhash": "126886f202f7b706"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('راشد', 37), ('نور', 63), ('خالد', 64), ('سعيد', 4)]\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 = [('راشد', 37), ('نور', 63), ('خالد', 64), ('سعيد', 4)]\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": "d948b49cc55b4a07", "answer": "[('سعيد', 4), ('راشد', 37), ('نور', 63), ('خالد', 64)]\n['خالد', 'نور']", "completion": " الناتج:\n```text\n[('سعيد', 4), ('راشد', 37), ('نور', 63), ('خالد', 64)]\n['خالد', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([25, -19, -5, -25]) == None", "assert biggest_mult([-20, -30, -40]) == -20", "assert biggest_mult([1, 11]) == None", "assert biggest_mult([12, -18, 2, -13, -17]) == None", "assert biggest_mult([28, -40, -20, 29, 10, -6]) == 10", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([25, -19, -5, -25]) == None\nassert biggest_mult([-20, -30, -40]) == -20\nassert biggest_mult([1, 11]) == None\nassert biggest_mult([12, -18, 2, -13, -17]) == None\nassert biggest_mult([28, -40, -20, 29, 10, -6]) == 10\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(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مثال: `biggest_mult([25, -19, -5, -25])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "7df686732b7952a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'سلمى': 32, 'فيصل': 44, 'هدى': 16, 'باسل': 27}\nscores['هدى'] += 16\nscores['راشد'] = 5\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 = {'سلمى': 32, 'فيصل': 44, 'هدى': 16, 'باسل': 27}\nscores['هدى'] += 16\nscores['راشد'] = 5\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": "c86db7ee69294873", "answer": "5\nفيصل\n140\n[('راشد', 5), ('باسل', 27)]", "completion": " الناتج:\n```text\n5\nفيصل\n140\n[('راشد', 5), ('باسل', 27)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 4 == 0)", "tests": ["assert sum_multiples(29) == 211", "assert sum_multiples(112) == 3081", "assert sum_multiples(6) == 7", "assert sum_multiples(151) == 5701", "assert sum_multiples(235) == 13807", "assert sum_multiples(72) == 1260", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(29) == 211\nassert sum_multiples(112) == 3081\nassert sum_multiples(6) == 7\nassert sum_multiples(151) == 5701\nassert sum_multiples(235) == 13807\nassert sum_multiples(72) == 1260\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 % 4 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 4، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(29)` يُرجع `211`.\nالجواب:", "qhash": "836dc3adba979c2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([51, -16, 28, 2, -18, -5, -20, -2, -23]) == 51", "assert best_multiple([-15, -12, -6]) == -6", "assert best_multiple([1, 4]) == None", "assert best_multiple([17, 26, -13, 10, 3, -23]) == 3", "assert best_multiple([35, -18, -17]) == -18", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([51, -16, 28, 2, -18, -5, -20, -2, -23]) == 51\nassert best_multiple([-15, -12, -6]) == -6\nassert best_multiple([1, 4]) == None\nassert best_multiple([17, 26, -13, 10, 3, -23]) == 3\nassert best_multiple([35, -18, -17]) == -18\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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للتوضيح: الاستدعاء `best_multiple([51, -16, 28, 2, -18, -5, -20, -2, -23])` يُرجع `51`.\nالجواب:", "qhash": "30c6a68810640480"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert sum_powers(6) == 146412", "assert sum_powers(0) == 0", "assert sum_powers(0) == 0", "assert sum_powers(6) == 146412", "assert sum_powers(9) == 1449900", "assert sum_powers(1) == 12", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 146412\nassert sum_powers(0) == 0\nassert sum_powers(0) == 0\nassert sum_powers(6) == 146412\nassert sum_powers(9) == 1449900\nassert sum_powers(1) == 12\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total\n```\nمثال: `sum_powers(6)` يجب أن تُرجع `146412`.\nالجواب:", "qhash": "6f86aca32d76b6e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 7 for x in range(2, 12) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 7 for x in range(2, 12) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "3468b3c349b07682", "answer": "[2, 42, 114]\n3 158", "completion": " الناتج:\n```text\n[2, 42, 114]\n3 158\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'code'\nprint(word.upper())\nprint(word.capitalize())\nprint(word.count('c'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'code'\nprint(word.upper())\nprint(word.capitalize())\nprint(word.count('c'))\n```\nالجواب:", "qhash": "0fec0d3014bb181d", "answer": "CODE\nCode\n1", "completion": " الناتج:\n```text\nCODE\nCode\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-19, 33, 27, 16, 12, 38, -9, 35]) == 33", "assert biggest_mult([-22, -44, -33]) == -22", "assert biggest_mult([1]) == None", "assert biggest_mult([-38, -20]) == None", "assert biggest_mult([33, -3, 8, 28, 14, 12, 46, -36, 26]) == 33", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-19, 33, 27, 16, 12, 38, -9, 35]) == 33\nassert biggest_mult([-22, -44, -33]) == -22\nassert biggest_mult([1]) == None\nassert biggest_mult([-38, -20]) == None\nassert biggest_mult([33, -3, 8, 28, 14, 12, 46, -36, 26]) == 33\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(xs):\n best = 0\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `biggest_mult([-19, 33, 27, 16, 12, 38, -9, 35])` يجب أن تُرجع `33`.\nالجواب:", "qhash": "27c4b395389a8682"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert begin_count('فجر سفينة نهر سلام امل امل فجر') == 2", "assert begin_count('بحر مطر امل برتقال كتاب عمل لغة امل') == 2", "assert begin_count('طالب مطر امل امل') == 2", "assert begin_count('امل جبل رمل مدينة') == 1", "assert begin_count('سلام مدرسة امل شجرة امل بحر') == 2", "assert begin_count('جبل صحراء سماء شمس حديقة') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('فجر سفينة نهر سلام امل امل فجر') == 2\nassert begin_count('بحر مطر امل برتقال كتاب عمل لغة امل') == 2\nassert begin_count('طالب مطر امل امل') == 2\nassert begin_count('امل جبل رمل مدينة') == 1\nassert begin_count('سلام مدرسة امل شجرة امل بحر') == 2\nassert begin_count('جبل صحراء سماء شمس حديقة') == 0\nassert begin_count('') == 0", "answer": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(text):\n count = 0\n for w in text.split():\n if 'ا' in w:\n count += 1\n return count\n```\nمثال: `begin_count('فجر سفينة نهر سلام امل امل فجر')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "1f035c605aece549"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -3 for x in xs if -2 <= x <= 34)", "tests": ["assert pick_between([-7, 32, 20, 38, -6, 1, 21]) == [-96, -63, -60, -3]", "assert pick_between([23, 17, -18]) == [-69, -51]", "assert pick_between([]) == []", "assert pick_between([31, -6, -28, -3, -2, 34, 55]) == [-102, -93, 6]", "assert pick_between([17, 52, -19, 28, -7, -6, 55, 22, 35, 9]) == [-84, -66, -51, -27]", "assert pick_between([53, 53, 19]) == [-57]", "assert pick_between([8, 11]) == [-33, -24]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-7, 32, 20, 38, -6, 1, 21]) == [-96, -63, -60, -3]\nassert pick_between([23, 17, -18]) == [-69, -51]\nassert pick_between([]) == []\nassert pick_between([31, -6, -28, -3, -2, 34, 55]) == [-102, -93, 6]\nassert pick_between([17, 52, -19, 28, -7, -6, 55, 22, 35, 9]) == [-84, -66, -51, -27]\nassert pick_between([53, 53, 19]) == [-57]\nassert pick_between([8, 11]) == [-33, -24]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -3 for x in xs if -2 <= x <= 34)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -3 for x in xs if -2 <= x <= 34)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -2 و34 (شاملًا الطرفين) في -3.\nمثال: `pick_between([-7, 32, 20, 38, -6, 1, 21])` يجب أن تُرجع `[-96, -63, -60, -3]`.\nالجواب:", "qhash": "c47c978c962f382d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'قهوة'\nprint('ه' in s)\nprint(s.count('ه'))\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'قهوة'\nprint('ه' in s)\nprint(s.count('ه'))\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "bfcb252cb8c5ef22", "answer": "True\n1\n4", "completion": " الناتج:\n```text\nTrue\n1\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 29", "tests": ["assert mfact(8) == 7", "assert mfact(55) == 0", "assert mfact(2) == 2", "assert mfact(58) == 0", "assert mfact(29) == 0", "assert mfact(23) == 13", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 7\nassert mfact(55) == 0\nassert mfact(2) == 2\nassert mfact(58) == 0\nassert mfact(29) == 0\nassert mfact(23) == 13\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 29", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(8)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "047ebb75ee339cce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=9):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(-8))\nprint(g(-8, 2))\nprint(g(g(2), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=9):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(-8))\nprint(g(-8, 2))\nprint(g(g(2), -8))\n```\nالجواب:", "qhash": "04db196117547a72", "answer": "-53\n-18\n-3", "completion": " الناتج:\n```text\n-53\n-18\n-3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 49) == 1)", "tests": ["assert phi_upto(20) == 18", "assert phi_upto(155) == 133", "assert phi_upto(171) == 147", "assert phi_upto(19) == 17", "assert phi_upto(173) == 149", "assert phi_upto(171) == 147", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(20) == 18\nassert phi_upto(155) == 133\nassert phi_upto(171) == 147\nassert phi_upto(19) == 17\nassert phi_upto(173) == 149\nassert phi_upto(171) == 147\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, 49) == 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, 49) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 49) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(20)` يُرجع `18`.\nالجواب:", "qhash": "2e6ac0ebd515083a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 34) == 1)", "tests": ["assert coprimes(67) == 32", "assert coprimes(80) == 38", "assert coprimes(59) == 28", "assert coprimes(14) == 7", "assert coprimes(39) == 19", "assert coprimes(13) == 7", "assert coprimes(1) == 1"], "test_code": "assert coprimes(67) == 32\nassert coprimes(80) == 38\nassert coprimes(59) == 28\nassert coprimes(14) == 7\nassert coprimes(39) == 19\nassert coprimes(13) == 7\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, 34) == 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, 34) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 34) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(67)` يُرجع `32`.\nالجواب:", "qhash": "7d19d95222d0abc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(0))\nprint(compute(0, -3))\nprint(compute(compute(-3), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(0))\nprint(compute(0, -3))\nprint(compute(compute(-3), 0))\n```\nالجواب:", "qhash": "32df96b275e8ba9d", "answer": "12\n3\n36", "completion": " الناتج:\n```text\n12\n3\n36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "tests": ["assert pow_total(6) == 182", "assert pow_total(0) == 0", "assert pow_total(4) == 60", "assert pow_total(8) == 408", "assert pow_total(5) == 110", "assert pow_total(1) == 2", "assert pow_total(0) == 0"], "test_code": "assert pow_total(6) == 182\nassert pow_total(0) == 0\nassert pow_total(4) == 60\nassert pow_total(8) == 408\nassert pow_total(5) == 110\nassert pow_total(1) == 2\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `pow_total(6)` يُرجع `182`.\nالجواب:", "qhash": "6b2ba827455a730f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('ماء حديقة قهوة معلم مدينة تفاحة') == 1", "assert words_starting('سلام صديق ماء طائرة تفاحة') == 1", "assert words_starting('عمل فجر نهار') == 0", "assert words_starting('قلم مدرسة قهوة فجر تفاحة') == 1", "assert words_starting('بحر نهر برتقال تفاحة شمس') == 1", "assert words_starting('كتاب حديقة ليل جبل') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('ماء حديقة قهوة معلم مدينة تفاحة') == 1\nassert words_starting('سلام صديق ماء طائرة تفاحة') == 1\nassert words_starting('عمل فجر نهار') == 0\nassert words_starting('قلم مدرسة قهوة فجر تفاحة') == 1\nassert words_starting('بحر نهر برتقال تفاحة شمس') == 1\nassert words_starting('كتاب حديقة ليل جبل') == 0\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 'ت' in w:\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 'ت' in w:\n count += 1\n return count\n```\nمثال: `words_starting('ماء حديقة قهوة معلم مدينة تفاحة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "4baaa2050cd754ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=7):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(9))\nprint(h(9, 11))\nprint(h(h(11), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=7):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(9))\nprint(h(9, 11))\nprint(h(h(11), 9))\n```\nالجواب:", "qhash": "db41792181403010", "answer": "29\n53\n139", "completion": " الناتج:\n```text\n29\n53\n139\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(655716319))\nprint(rec(rec(655716319)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(655716319))\nprint(rec(rec(655716319)))\n```\nالجواب:", "qhash": "270d6536320e1f34", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('is') == 'eo'", "assert shift_letters('coffee winter on by apple OK') == 'ykbbaa sejpan kj xu wllha OK'", "assert shift_letters('by we code is A1') == 'xu sa ykza eo A1'", "assert shift_letters('it a') == 'ep w'", "assert shift_letters('orange python OK') == 'knwjca lupdkj OK'", "assert shift_letters('music of') == 'iqoey kb'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('is') == 'eo'\nassert shift_letters('coffee winter on by apple OK') == 'ykbbaa sejpan kj xu wllha OK'\nassert shift_letters('by we code is A1') == 'xu sa ykza eo A1'\nassert shift_letters('it a') == 'ep w'\nassert shift_letters('orange python OK') == 'knwjca lupdkj OK'\nassert shift_letters('music of') == 'iqoey kb'\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 + (22)) % 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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('is')` يُرجع `'eo'`.\nالجواب:", "qhash": "14bddd5972144096"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'لغة'\nprint(text[-1])\nprint(text.count('ر'))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'لغة'\nprint(text[-1])\nprint(text.count('ر'))\nprint(text[::-1])\n```\nالجواب:", "qhash": "c45da38133674072", "answer": "ة\n0\nةغل", "completion": " الناتج:\n```text\nة\n0\nةغل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 85", "tests": ["assert digit_power(15823) == 59", "assert digit_power(901061) == 39", "assert digit_power(487835) == 80", "assert digit_power(475637) == 5", "assert digit_power(310171) == 20", "assert digit_power(148979) == 71", "assert digit_power(632923) == 61", "assert digit_power(0) == 0"], "test_code": "assert digit_power(15823) == 59\nassert digit_power(901061) == 39\nassert digit_power(487835) == 80\nassert digit_power(475637) == 5\nassert digit_power(310171) == 20\nassert digit_power(148979) == 71\nassert digit_power(632923) == 61\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 85", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 85\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 85.\nللتوضيح: الاستدعاء `digit_power(15823)` يُرجع `59`.\nالجواب:", "qhash": "332d96ed34f65441"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29", "tests": ["assert mfact(8) == 3", "assert mfact(28) == 6", "assert mfact(42) == 19", "assert mfact(52) == 23", "assert mfact(32) == 18", "assert mfact(32) == 18", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 3\nassert mfact(28) == 6\nassert mfact(42) == 19\nassert mfact(52) == 23\nassert mfact(32) == 18\nassert mfact(32) == 18\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(8)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "41dc37549a468994"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([77, 84, 71, 28, 42, 69, 22, 61, 84]) == 1", "assert tally_div([-16, 2, 46, -38, 88, 10, 84, 75, 59, -40, -31]) == 1", "assert tally_div([-23, 5, -8, 40, -7, 85, 31, -12, 49]) == 0", "assert tally_div([71, 35, 1, 14, -2]) == 0", "assert tally_div([64, 90, -14, -6, 68]) == 0", "assert tally_div([6, -38, -36, 86]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([77, 84, 71, 28, 42, 69, 22, 61, 84]) == 1\nassert tally_div([-16, 2, 46, -38, 88, 10, 84, 75, 59, -40, -31]) == 1\nassert tally_div([-23, 5, -8, 40, -7, 85, 31, -12, 49]) == 0\nassert tally_div([71, 35, 1, 14, -2]) == 0\nassert tally_div([64, 90, -14, -6, 68]) == 0\nassert tally_div([6, -38, -36, 86]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([77, 84, 71, 28, 42, 69, 22, 61, 84])` يُرجع `1`.\nالجواب:", "qhash": "5f26885091a2ee4b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(7, 7))", "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(7, 7))\n```\nالجواب:", "qhash": "95fb47baa4b69dfc", "answer": "823543", "completion": " الناتج:\n```text\n823543\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 11\nfor i in range(2, 11, 4):\n total += i * 7\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 11\nfor i in range(2, 11, 4):\n total += i * 7\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "14dc934ac1a4a1ea", "answer": "137\n10", "completion": " الناتج:\n```text\n137\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 356\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 = 356\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": "5e51e95d54163e60", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['banana', 'data', 'vector', 'window', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['banana', 'data', 'vector', 'window', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "941260643769c92f", "answer": "['data', 'banana', 'vector', 'window', 'signal']\n['window', 'vector', 'signal']", "completion": " الناتج:\n```text\n['data', 'banana', 'vector', 'window', 'signal']\n['window', 'vector', 'signal']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert div_not([57, 26, 72, 2, 79, 56]) == 1", "assert div_not([59]) == 0", "assert div_not([4, -2]) == 0", "assert div_not([31]) == 0", "assert div_not([39, -12, -16, -19, 77, 46]) == 1", "assert div_not([74]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([57, 26, 72, 2, 79, 56]) == 1\nassert div_not([59]) == 0\nassert div_not([4, -2]) == 0\nassert div_not([31]) == 0\nassert div_not([39, -12, -16, -19, 77, 46]) == 1\nassert div_not([74]) == 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 % 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([57, 26, 72, 2, 79, 56])` يُرجع `1`.\nالجواب:", "qhash": "bd30af315a2f62c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert shift_list([12, 43, 24, 22]) == [43, 24, 22, 12]", "assert shift_list([-2, 15, -9, 48, 32, 8, -8]) == [32, 8, -8, -2, 15, -9, 48]", "assert shift_list([33, -9, -3, 36, 33, 43]) == [36, 33, 43, 33, -9, -3]", "assert shift_list([18, 21, 44, 28, 49, 0, 1, 48, 16, 19]) == [48, 16, 19, 18, 21, 44, 28, 49, 0, 1]", "assert shift_list([9, 29, 47, 25, 10, 33, 42, -6]) == [33, 42, -6, 9, 29, 47, 25, 10]", "assert shift_list([47, -9, 12]) == [47, -9, 12]", "assert shift_list([]) == []"], "test_code": "assert shift_list([12, 43, 24, 22]) == [43, 24, 22, 12]\nassert shift_list([-2, 15, -9, 48, 32, 8, -8]) == [32, 8, -8, -2, 15, -9, 48]\nassert shift_list([33, -9, -3, 36, 33, 43]) == [36, 33, 43, 33, -9, -3]\nassert shift_list([18, 21, 44, 28, 49, 0, 1, 48, 16, 19]) == [48, 16, 19, 18, 21, 44, 28, 49, 0, 1]\nassert shift_list([9, 29, 47, 25, 10, 33, 42, -6]) == [33, 42, -6, 9, 29, 47, 25, 10]\nassert shift_list([47, -9, 12]) == [47, -9, 12]\nassert shift_list([]) == []", "answer": "def shift_list(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 shift_list(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 shift_list(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([12, 43, 24, 22])` يُرجع `[43, 24, 22, 12]`.\nالجواب:", "qhash": "c4f23802a1b13ef1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'وردة'\nprint('ر' in text)\nprint(text.count('ر'))\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'وردة'\nprint('ر' in text)\nprint(text.count('ر'))\nprint(text[0])\n```\nالجواب:", "qhash": "3c1858d35a9af68f", "answer": "True\n1\nو", "completion": " الناتج:\n```text\nTrue\n1\nو\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('at engine window engine is summer') == 'summer/is/engine/window/engine/at'", "assert mirror_words('winter an apple') == 'apple/an/winter'", "assert mirror_words('planet coffee') == 'coffee/planet'", "assert mirror_words('is by table code an music python we') == 'we/python/music/an/code/table/by/is'", "assert mirror_words('') == ''", "assert mirror_words('banana cloud camel data code matrix') == 'matrix/code/data/camel/cloud/banana'", "assert mirror_words('desert falcon orange') == 'orange/falcon/desert'"], "test_code": "assert mirror_words('at engine window engine is summer') == 'summer/is/engine/window/engine/at'\nassert mirror_words('winter an apple') == 'apple/an/winter'\nassert mirror_words('planet coffee') == 'coffee/planet'\nassert mirror_words('is by table code an music python we') == 'we/python/music/an/code/table/by/is'\nassert mirror_words('') == ''\nassert mirror_words('banana cloud camel data code matrix') == 'matrix/code/data/camel/cloud/banana'\nassert mirror_words('desert falcon orange') == 'orange/falcon/desert'", "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('at engine window engine is summer')` يجب أن تُرجع `'summer/is/engine/window/engine/at'`.\nالجواب:", "qhash": "ffa463241cfb8e48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo']", "assert game(6) == ['1', '2', '3', 'Foo', '5', '6']", "assert game(11) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11']", "assert game(10) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10']", "assert game(6) == ['1', '2', '3', 'Foo', '5', '6']"], "test_code": "assert game(12) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo']\nassert game(6) == ['1', '2', '3', 'Foo', '5', '6']\nassert game(11) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11']\nassert game(10) == ['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10']\nassert game(6) == ['1', '2', '3', 'Foo', '5', '6']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\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 % 4 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Foo'، وإن قَبِلها على 7 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(12)` يُرجع `['1', '2', '3', 'Foo', '5', '6', 'Bar', 'Foo', '9', '10', '11', 'Foo']`.\nالجواب:", "qhash": "83fad0b2f85c1cfa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-27, 13, 6, 48, 19]) == None", "assert find_max_div([-10, -20, -30]) == -10", "assert find_max_div([1]) == None", "assert find_max_div([-6, 2, 37, -3]) == None", "assert find_max_div([4, -30, 13, 35, -29, 22, 29, -6, -45]) == -30", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-27, 13, 6, 48, 19]) == None\nassert find_max_div([-10, -20, -30]) == -10\nassert find_max_div([1]) == None\nassert find_max_div([-6, 2, 37, -3]) == None\nassert find_max_div([4, -30, 13, 35, -29, 22, 29, -6, -45]) == -30\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([-27, 13, 6, 48, 19])` يُرجع `None`.\nالجواب:", "qhash": "91756418d782a02b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert shift_list([31, 2, 43, 28, 4, 11]) == [4, 11, 31, 2, 43, 28]", "assert shift_list([6, 23, 37, 17, 39, 39, 44, 39, 25, 10, 16]) == [16, 6, 23, 37, 17, 39, 39, 44, 39, 25, 10]", "assert shift_list([-1, 20, -6, 45]) == [-6, 45, -1, 20]", "assert shift_list([-8, 40, 21, 15, 30, 0, 35, -3]) == [21, 15, 30, 0, 35, -3, -8, 40]", "assert shift_list([29, -3, 26, 10]) == [26, 10, 29, -3]", "assert shift_list([34, 11, 35, 10, 6, 47, 22, 0, 3]) == [11, 35, 10, 6, 47, 22, 0, 3, 34]", "assert shift_list([]) == []"], "test_code": "assert shift_list([31, 2, 43, 28, 4, 11]) == [4, 11, 31, 2, 43, 28]\nassert shift_list([6, 23, 37, 17, 39, 39, 44, 39, 25, 10, 16]) == [16, 6, 23, 37, 17, 39, 39, 44, 39, 25, 10]\nassert shift_list([-1, 20, -6, 45]) == [-6, 45, -1, 20]\nassert shift_list([-8, 40, 21, 15, 30, 0, 35, -3]) == [21, 15, 30, 0, 35, -3, -8, 40]\nassert shift_list([29, -3, 26, 10]) == [26, 10, 29, -3]\nassert shift_list([34, 11, 35, 10, 6, 47, 22, 0, 3]) == [11, 35, 10, 6, 47, 22, 0, 3, 34]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return ____\n```\nمثال: `shift_list([31, 2, 43, 28, 4, 11])` يجب أن تُرجع `[4, 11, 31, 2, 43, 28]`.\nالجواب:", "qhash": "a1e2f7acc1146331"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 9\nfor i in range(2, 8, 2):\n s -= i * 7\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 9\nfor i in range(2, 8, 2):\n s -= i * 7\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "a0259bbc66e3df09", "answer": "-75\n6", "completion": " الناتج:\n```text\n-75\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [25, 9, 0, 19, 2, -3]\nprint(items[2:6])\nprint(items[::-2])\nprint(len(items[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [25, 9, 0, 19, 2, -3]\nprint(items[2:6])\nprint(items[::-2])\nprint(len(items[2:6]))\n```\nالجواب:", "qhash": "83d16e80ae94c3e8", "answer": "[0, 19, 2, -3]\n[-3, 19, 9]\n4", "completion": " الناتج:\n```text\n[0, 19, 2, -3]\n[-3, 19, 9]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('a in light') == 'light'", "assert rev_join('') == ''", "assert rev_join('we a code') == 'code'", "assert rev_join('planet summer camel orange to') == 'orange_camel_summer_planet'", "assert rev_join('to up matrix code summer pixel river') == 'river_pixel_summer_code_matrix'", "assert rev_join('apple in music falcon river brain apple desert') == 'desert_apple_brain_river_falcon_music_apple'", "assert rev_join('stone at it is falcon') == 'falcon_stone'"], "test_code": "assert rev_join('a in light') == 'light'\nassert rev_join('') == ''\nassert rev_join('we a code') == 'code'\nassert rev_join('planet summer camel orange to') == 'orange_camel_summer_planet'\nassert rev_join('to up matrix code summer pixel river') == 'river_pixel_summer_code_matrix'\nassert rev_join('apple in music falcon river brain apple desert') == 'desert_apple_brain_river_falcon_music_apple'\nassert rev_join('stone at it is falcon') == 'falcon_stone'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_join('a in light')` يُرجع `'light'`.\nالجواب:", "qhash": "6c09a889dfb2d556"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([9, 52, 28, 45, 9, 41]) == None", "assert biggest_mult([-12, -24, -48]) == -12", "assert biggest_mult([1, 13]) == None", "assert biggest_mult([]) == None", "assert biggest_mult([25, -45, -42, 0, -7, 23, -37, 42, -38]) == 0", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([9, 52, 28, 45, 9, 41]) == None\nassert biggest_mult([-12, -24, -48]) == -12\nassert biggest_mult([1, 13]) == None\nassert biggest_mult([]) == None\nassert biggest_mult([25, -45, -42, 0, -7, 23, -37, 42, -38]) == 0\nassert biggest_mult([]) == None", "answer": "def biggest_mult(arr):\n best = None\n for x in arr:\n if x % 12 == 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 % 12 == 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 % 12 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(arr):\n best = None\n for x in arr:\n if x % 12 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([9, 52, 28, 45, 9, 41])` يُرجع `None`.\nالجواب:", "qhash": "f90e1ffbffe59897"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 17 <= x <= 47)", "tests": ["assert pick_between([23, 38, 13, 12, 52, 39, 41, 42, 53]) == [46, 76, 78, 82, 84]", "assert pick_between([12, 28, 12, 37, 9]) == [56, 74]", "assert pick_between([25, 13, 5, 9, 10, 8, 10, -2, 55]) == [50]", "assert pick_between([-5, 41, 28, 14, -15, -28, -7, -15, 22]) == [44, 56, 82]", "assert pick_between([41, 12, 12, -11, 1, 49, 0, 40, -21]) == [80, 82]", "assert pick_between([46, -15, 49]) == [92]", "assert pick_between([37]) == [74]", "assert pick_between([]) == []"], "test_code": "assert pick_between([23, 38, 13, 12, 52, 39, 41, 42, 53]) == [46, 76, 78, 82, 84]\nassert pick_between([12, 28, 12, 37, 9]) == [56, 74]\nassert pick_between([25, 13, 5, 9, 10, 8, 10, -2, 55]) == [50]\nassert pick_between([-5, 41, 28, 14, -15, -28, -7, -15, 22]) == [44, 56, 82]\nassert pick_between([41, 12, 12, -11, 1, 49, 0, 40, -21]) == [80, 82]\nassert pick_between([46, -15, 49]) == [92]\nassert pick_between([37]) == [74]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if 17 <= x <= 47)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if 17 <= x <= 47)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 17 و47 (شاملًا الطرفين) في 2.\nمثال: `pick_between([23, 38, 13, 12, 52, 39, 41, 42, 53])` يجب أن تُرجع `[46, 76, 78, 82, 84]`.\nالجواب:", "qhash": "5bdfe5cb64b8df8c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 79", "tests": ["assert multi_fact(6) == 18", "assert multi_fact(8) == 1", "assert multi_fact(55) == 28", "assert multi_fact(60) == 15", "assert multi_fact(17) == 11", "assert multi_fact(4) == 4", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(6) == 18\nassert multi_fact(8) == 1\nassert multi_fact(55) == 28\nassert multi_fact(60) == 15\nassert multi_fact(17) == 11\nassert multi_fact(4) == 4\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 79", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(6)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "f551ff8df67a8350"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "how_many", "reference": "def how_many(text):\n return text.count('م')", "tests": ["assert how_many('عمل سوق فجر') == 1", "assert how_many('مدرسة وردة باب تفاحة') == 1", "assert how_many('كتاب عمل كتاب قلم برمجة قلم شجرة قهوة') == 4", "assert how_many('سوق طائرة حاسوب شجرة') == 0", "assert how_many('دفتر باب طالب مكتبة حصان قمر عربية') == 2", "assert how_many('برتقال ميناء شجرة') == 1", "assert how_many('') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('عمل سوق فجر') == 1\nassert how_many('مدرسة وردة باب تفاحة') == 1\nassert how_many('كتاب عمل كتاب قلم برمجة قلم شجرة قهوة') == 4\nassert how_many('سوق طائرة حاسوب شجرة') == 0\nassert how_many('دفتر باب طالب مكتبة حصان قمر عربية') == 2\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)` بحيث تُعيد عدد مرات ظهور الحرف «م» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('عمل سوق فجر')` يُرجع `1`.\nالجواب:", "qhash": "61999c9e99b4fde5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'pixel_desert'\nprint(name[-1:])\nprint(name[1:3])\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'pixel_desert'\nprint(name[-1:])\nprint(name[1:3])\nprint(name.capitalize())\n```\nالجواب:", "qhash": "568371758a723c8f", "answer": "t\nix\nPixel_desert", "completion": " الناتج:\n```text\nt\nix\nPixel_desert\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "tests": ["assert sum_div(165) == 3909", "assert sum_div(271) == 10665", "assert sum_div(154) == 3432", "assert sum_div(176) == 4590", "assert sum_div(211) == 6549", "assert sum_div(184) == 4770", "assert sum_div(1) == 0"], "test_code": "assert sum_div(165) == 3909\nassert sum_div(271) == 10665\nassert sum_div(154) == 3432\nassert sum_div(176) == 4590\nassert sum_div(211) == 6549\nassert sum_div(184) == 4770\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 9.\nمثال: `sum_div(165)` يجب أن تُرجع `3909`.\nالجواب:", "qhash": "a237eed20730e2a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('طائرة نور سماء طالب بيت فجر') == 1", "assert tally_letter('برمجة') == 0", "assert tally_letter('سيارة تفاحة بحر') == 1", "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('سيارة تفاحة بحر') == 1\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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «س»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('برمجة بحر قلم تفاحة')` يُرجع `0`.\nالجواب:", "qhash": "b7707d338e2c8956"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'python_music'\nprint(s.capitalize())\nprint(s[3:5])\nprint(s.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'python_music'\nprint(s.capitalize())\nprint(s[3:5])\nprint(s.upper())\n```\nالجواب:", "qhash": "2fa62bd6bd3a1507", "answer": "Python_music\nho\nPYTHON_MUSIC", "completion": " الناتج:\n```text\nPython_music\nho\nPYTHON_MUSIC\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'coffee'\nprint(word.count('f'))\nprint(len(word))\nprint(word.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'coffee'\nprint(word.count('f'))\nprint(len(word))\nprint(word.capitalize())\n```\nالجواب:", "qhash": "4e57c77ea1ec70d8", "answer": "2\n6\nCoffee", "completion": " الناتج:\n```text\n2\n6\nCoffee\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=4):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(-6))\nprint(compute(-6, 5))\nprint(compute(compute(5), -6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=4):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(-6))\nprint(compute(-6, 5))\nprint(compute(compute(5), -6))\n```\nالجواب:", "qhash": "570bf6b91e817e9f", "answer": "-18\n-21\n-1", "completion": " الناتج:\n```text\n-18\n-21\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 54) == 1)", "tests": ["assert count_coprime(94) == 31", "assert count_coprime(95) == 32", "assert count_coprime(20) == 7", "assert count_coprime(130) == 43", "assert count_coprime(133) == 45", "assert count_coprime(84) == 28", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(94) == 31\nassert count_coprime(95) == 32\nassert count_coprime(20) == 7\nassert count_coprime(130) == 43\nassert count_coprime(133) == 45\nassert count_coprime(84) == 28\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 54، أي أن القاسم المشترك الأكبر لها مع 54 يساوي 1.\nمثال: `count_coprime(94)` يجب أن تُرجع `31`.\nالجواب:", "qhash": "7910483bf4fc8cdf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 14\nfor n in range(-2, 8, 4):\n result += n * 5\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 14\nfor n in range(-2, 8, 4):\n result += n * 5\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "f6d1de402570c005", "answer": "44\n6", "completion": " الناتج:\n```text\n44\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('منى', 7), ('حسن', 5), ('راشد', 50), ('أحمد', 10)]\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 = [('منى', 7), ('حسن', 5), ('راشد', 50), ('أحمد', 10)]\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": "6d102d0749d46d11", "answer": "[('حسن', 5), ('منى', 7), ('أحمد', 10), ('راشد', 50)]\n['راشد', 'أحمد']", "completion": " الناتج:\n```text\n[('حسن', 5), ('منى', 7), ('أحمد', 10), ('راشد', 50)]\n['راشد', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_sel([1, 23, 62, 48, 80, 5, 42, 41, 7, 86]) == 5", "assert count_sel([71, -40, 54, 39, 88, -38, -7, 12]) == 4", "assert count_sel([68, 13, 39, 12]) == 2", "assert count_sel([-39, 73, 43, 13, 46, 4, 23, 4]) == 3", "assert count_sel([-12, -23, -16, 16, 46, 73, 75, 89, -36, 44]) == 5", "assert count_sel([30, -28, 80, -3]) == 3", "assert count_sel([]) == 0"], "test_code": "assert count_sel([1, 23, 62, 48, 80, 5, 42, 41, 7, 86]) == 5\nassert count_sel([71, -40, 54, 39, 88, -38, -7, 12]) == 4\nassert count_sel([68, 13, 39, 12]) == 2\nassert count_sel([-39, 73, 43, 13, 46, 4, 23, 4]) == 3\nassert count_sel([-12, -23, -16, 16, 46, 73, 75, 89, -36, 44]) == 5\nassert count_sel([30, -28, 80, -3]) == 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 % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([1, 23, 62, 48, 80, 5, 42, 41, 7, 86])` يُرجع `5`.\nالجواب:", "qhash": "454f7b2bed705fb9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 1:\n return 4\n return 2 * rec(n - 1) + 0\n\nprint(rec(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 1:\n return 4\n return 2 * rec(n - 1) + 0\n\nprint(rec(11))\n```\nالجواب:", "qhash": "07e3ddb61b29f157", "answer": "4096", "completion": " الناتج:\n```text\n4096\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 12:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([9, 7, 4, 8, 5, 9, 8, 10, 1]) == [9, 0, 4, 12, 0, 9, 0, 10, 11]", "assert capped_cumsum([8, -2, -6]) == [8, 6, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([6, -1, -4, -10]) == [6, 5, 1, -9]", "assert capped_cumsum([11, -2, 5]) == [11, 9, 0]", "assert capped_cumsum([-10]) == [-10]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([9, 7, 4, 8, 5, 9, 8, 10, 1]) == [9, 0, 4, 12, 0, 9, 0, 10, 11]\nassert capped_cumsum([8, -2, -6]) == [8, 6, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([6, -1, -4, -10]) == [6, 5, 1, -9]\nassert capped_cumsum([11, -2, 5]) == [11, 9, 0]\nassert capped_cumsum([-10]) == [-10]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 12:\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 > 12:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 12 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([9, 7, 4, 8, 5, 9, 8, 10, 1])` يُرجع `[9, 0, 4, 12, 0, 9, 0, 10, 11]`.\nالجواب:", "qhash": "a9360446f1828a0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "tests": ["assert fact_mod(8) == 19", "assert fact_mod(24) == 2", "assert fact_mod(0) == 1", "assert fact_mod(46) == 44", "assert fact_mod(57) == 37", "assert fact_mod(35) == 38", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(8) == 19\nassert fact_mod(24) == 2\nassert fact_mod(0) == 1\nassert fact_mod(46) == 44\nassert fact_mod(57) == 37\nassert fact_mod(35) == 38\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(8)` يجب أن تُرجع `19`.\nالجواب:", "qhash": "96c62d1827a83e51"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * -3 + -8 for x in range(6, 13) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * -3 + -8 for x in range(6, 13) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "6e763f7b4ef91d2c", "answer": "[-32, -44]\n2 -76", "completion": " الناتج:\n```text\n[-32, -44]\n2 -76\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 78", "tests": ["assert digit_score(96709) == 31", "assert digit_score(838920) == 30", "assert digit_score(854160) == 24", "assert digit_score(22683) == 21", "assert digit_score(2894) == 23", "assert digit_score(958268) == 38", "assert digit_score(801981) == 27", "assert digit_score(0) == 0"], "test_code": "assert digit_score(96709) == 31\nassert digit_score(838920) == 30\nassert digit_score(854160) == 24\nassert digit_score(22683) == 21\nassert digit_score(2894) == 23\nassert digit_score(958268) == 38\nassert digit_score(801981) == 27\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 78", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 78\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 78.\nللتوضيح: الاستدعاء `digit_score(96709)` يُرجع `31`.\nالجواب:", "qhash": "a171d2f6c3cf00d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 8 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(16) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac']", "assert label_numbers(4) == ['1', '2', '3', '4']", "assert label_numbers(18) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18']", "assert label_numbers(10) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic']", "assert label_numbers(2) == ['1', '2']"], "test_code": "assert label_numbers(16) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac']\nassert label_numbers(4) == ['1', '2', '3', '4']\nassert label_numbers(18) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18']\nassert label_numbers(10) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic']\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 % 5 == 0:\n s += 'Tic'\n if i % 8 == 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 % 8 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Tic'، وعلى 8 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(16)` يجب أن تُرجع `['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac']`.\nالجواب:", "qhash": "d6380d8404d3de80"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('window is') == 'pbgwhp bl'", "assert shift_text('falcon we') == 'ytevhg px'", "assert shift_text('banana planet a') == 'utgtgt ietgxm t'", "assert shift_text('up light 2024') == 'ni ebzam 2024'", "assert shift_text('apple winter in A1') == 'tiiex pbgmxk bg A1'", "assert shift_text('go rocket winter code') == 'zh khvdxm pbgmxk vhwx'", "assert shift_text('') == ''"], "test_code": "assert shift_text('window is') == 'pbgwhp bl'\nassert shift_text('falcon we') == 'ytevhg px'\nassert shift_text('banana planet a') == 'utgtgt ietgxm t'\nassert shift_text('up light 2024') == 'ni ebzam 2024'\nassert shift_text('apple winter in A1') == 'tiiex pbgmxk bg A1'\nassert shift_text('go rocket winter code') == 'zh khvdxm pbgmxk vhwx'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('window is')` يُرجع `'pbgwhp bl'`.\nالجواب:", "qhash": "eff6e8302f64f791"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'مدينة جمل'\nprint(s.count('ي'))\nprint('ي' in s)\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'مدينة جمل'\nprint(s.count('ي'))\nprint('ي' in s)\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "619d34215f4162cf", "answer": "1\nTrue\nمدينة-جمل", "completion": " الناتج:\n```text\n1\nTrue\nمدينة-جمل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'جبل'\nprint(text.find('ب'))\nprint(text[0])\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'جبل'\nprint(text.find('ب'))\nprint(text[0])\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "f0b087a76eed8d11", "answer": "1\nج\n3", "completion": " الناتج:\n```text\n1\nج\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([35, -30, -7, -18, 32, 7, 26, 45, 43]) == 32", "assert biggest_mult([-16, -8, -16]) == -8", "assert biggest_mult([1, 9, 17, 25]) == None", "assert biggest_mult([38, -1, 18, -19, 16]) == 16", "assert biggest_mult([-22, 22, -49, -8, -36]) == -8", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([35, -30, -7, -18, 32, 7, 26, 45, 43]) == 32\nassert biggest_mult([-16, -8, -16]) == -8\nassert biggest_mult([1, 9, 17, 25]) == None\nassert biggest_mult([38, -1, 18, -19, 16]) == 16\nassert biggest_mult([-22, 22, -49, -8, -36]) == -8\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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مثال: `biggest_mult([35, -30, -7, -18, 32, 7, 26, 45, 43])` يجب أن تُرجع `32`.\nالجواب:", "qhash": "e4e316fbe6e92ec4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 19) == 1)", "tests": ["assert rel_prime_count(11) == 11", "assert rel_prime_count(13) == 13", "assert rel_prime_count(173) == 164", "assert rel_prime_count(11) == 11", "assert rel_prime_count(40) == 38", "assert rel_prime_count(147) == 140", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(11) == 11\nassert rel_prime_count(13) == 13\nassert rel_prime_count(173) == 164\nassert rel_prime_count(11) == 11\nassert rel_prime_count(40) == 38\nassert rel_prime_count(147) == 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, 19) == 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, 19) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 19، أي أن القاسم المشترك الأكبر لها مع 19 يساوي 1.\nمثال: `rel_prime_count(11)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "aa35cf9c1cd678e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 11", "tests": ["assert mfact(3) == 3", "assert mfact(25) == 0", "assert mfact(45) == 0", "assert mfact(21) == 7", "assert mfact(13) == 10", "assert mfact(36) == 0", "assert mfact(0) == 1"], "test_code": "assert mfact(3) == 3\nassert mfact(25) == 0\nassert mfact(45) == 0\nassert mfact(21) == 7\nassert mfact(13) == 10\nassert mfact(36) == 0\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 11", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(3)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "c827935fba084b83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('desert 2024') == 'tuiuhj 2024'", "assert rotate_letters('camel light') == 'sqcub bywxj'", "assert rotate_letters('is summer falcon garden stone') == 'yi ikccuh vqbsed wqhtud ijedu'", "assert rotate_letters('in brain') == 'yd rhqyd'", "assert rotate_letters('apple it at matrix') == 'qffbu yj qj cqjhyn'", "assert rotate_letters('signal is rocket by') == 'iywdqb yi hesauj ro'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('desert 2024') == 'tuiuhj 2024'\nassert rotate_letters('camel light') == 'sqcub bywxj'\nassert rotate_letters('is summer falcon garden stone') == 'yi ikccuh vqbsed wqhtud ijedu'\nassert rotate_letters('in brain') == 'yd rhqyd'\nassert rotate_letters('apple it at matrix') == 'qffbu yj qj cqjhyn'\nassert rotate_letters('signal is rocket by') == 'iywdqb yi hesauj ro'\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 + (16)) % 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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('desert 2024')` يجب أن تُرجع `'tuiuhj 2024'`.\nالجواب:", "qhash": "b335090527841457"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('يوسف', 37), ('رنا', 98), ('حسن', 87), ('هدى', 43)]\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 = [('يوسف', 37), ('رنا', 98), ('حسن', 87), ('هدى', 43)]\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": "f0d7f5b0f1f849cd", "answer": "[('يوسف', 37), ('هدى', 43), ('حسن', 87), ('رنا', 98)]\n['رنا', 'حسن']", "completion": " الناتج:\n```text\n[('يوسف', 37), ('هدى', 43), ('حسن', 87), ('رنا', 98)]\n['رنا', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 1\nfor n in range(-4, 20, 2):\n result -= n * 5\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 1\nfor n in range(-4, 20, 2):\n result -= n * 5\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "af64726e1cac7be0", "answer": "-419\n18", "completion": " الناتج:\n```text\n-419\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [8, -5, 32, 11, 29, -3, 7]\nprint(xs[2:4])\nprint(xs[::2])\nprint(sum(xs[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [8, -5, 32, 11, 29, -3, 7]\nprint(xs[2:4])\nprint(xs[::2])\nprint(sum(xs[2:4]))\n```\nالجواب:", "qhash": "427ed334d6449a43", "answer": "[32, 11]\n[8, 32, 29, 7]\n43", "completion": " الناتج:\n```text\n[32, 11]\n[8, 32, 29, 7]\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('light music an OK') == 'khfgs ltrhb zm OK'", "assert shift_text('by stone planet') == 'ax rsnmd okzmds'", "assert shift_text('up apple planet signal window !') == 'to zookd okzmds rhfmzk vhmcnv !'", "assert shift_text('go rocket go music pixel') == 'fn qnbjds fn ltrhb ohwdk'", "assert shift_text('rocket') == 'qnbjds'", "assert shift_text('rocket summer on by on') == 'qnbjds rtlldq nm ax nm'", "assert shift_text('') == ''"], "test_code": "assert shift_text('light music an OK') == 'khfgs ltrhb zm OK'\nassert shift_text('by stone planet') == 'ax rsnmd okzmds'\nassert shift_text('up apple planet signal window !') == 'to zookd okzmds rhfmzk vhmcnv !'\nassert shift_text('go rocket go music pixel') == 'fn qnbjds fn ltrhb ohwdk'\nassert shift_text('rocket') == 'qnbjds'\nassert shift_text('rocket summer on by on') == 'qnbjds rtlldq nm ax nm'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('light music an OK')` يُرجع `'khfgs ltrhb zm OK'`.\nالجواب:", "qhash": "c76b79dbc2184c38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(-7))\nprint(h(-7, 15))\nprint(h(h(15), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=2):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(-7))\nprint(h(-7, 15))\nprint(h(h(15), -7))\n```\nالجواب:", "qhash": "a2626bcfea90f467", "answer": "5\n83\n535", "completion": " الناتج:\n```text\n5\n83\n535\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'سعيد': 20, 'خالد': 30, 'عمر': 19}\nd['عمر'] += 6\nd['فيصل'] = 22\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 33])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'سعيد': 20, 'خالد': 30, 'عمر': 19}\nd['عمر'] += 6\nd['فيصل'] = 22\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 33])\n```\nالجواب:", "qhash": "9c125d17fcac36cb", "answer": "4\nخالد\n97\n[]", "completion": " الناتج:\n```text\n4\nخالد\n97\n[]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 163:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([9, 49, 73, 15, 45, 45]) == [9, 58, 131, 146, 0, 45]", "assert rolling_total([86, 21, 124]) == [86, 107, 0]", "assert rolling_total([80, 53, 30, -1, 128]) == [80, 133, 163, 162, 0]", "assert rolling_total([]) == []", "assert rolling_total([8, 105, 144, 114, 14]) == [8, 113, 0, 114, 128]", "assert rolling_total([102, 85, 135, 65, 8, 77, 84, 119, 37]) == [102, 0, 135, 0, 8, 85, 0, 119, 156]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([9, 49, 73, 15, 45, 45]) == [9, 58, 131, 146, 0, 45]\nassert rolling_total([86, 21, 124]) == [86, 107, 0]\nassert rolling_total([80, 53, 30, -1, 128]) == [80, 133, 163, 162, 0]\nassert rolling_total([]) == []\nassert rolling_total([8, 105, 144, 114, 14]) == [8, 113, 0, 114, 128]\nassert rolling_total([102, 85, 135, 65, 8, 77, 84, 119, 37]) == [102, 0, 135, 0, 8, 85, 0, 119, 156]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 163:\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 > 163:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 163 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([9, 49, 73, 15, 45, 45])` يجب أن تُرجع `[9, 58, 131, 146, 0, 45]`.\nالجواب:", "qhash": "8162aaeeb92153ed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "flip_words", "reference": "def flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert flip_words('banana desert an up garden window by') == 'window_garden_desert_banana'", "assert flip_words('window banana matrix') == 'matrix_banana_window'", "assert flip_words('desert') == 'desert'", "assert flip_words('go to garden orange rocket a matrix') == 'matrix_rocket_orange_garden'", "assert flip_words('') == ''", "assert flip_words('go garden banana signal stone a up') == 'stone_signal_banana_garden'", "assert flip_words('rocket apple orange vector an') == 'vector_orange_apple_rocket'"], "test_code": "assert flip_words('banana desert an up garden window by') == 'window_garden_desert_banana'\nassert flip_words('window banana matrix') == 'matrix_banana_window'\nassert flip_words('desert') == 'desert'\nassert flip_words('go to garden orange rocket a matrix') == 'matrix_rocket_orange_garden'\nassert flip_words('') == ''\nassert flip_words('go garden banana signal stone a up') == 'stone_signal_banana_garden'\nassert flip_words('rocket apple orange vector an') == 'vector_orange_apple_rocket'", "answer": "def flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef flip_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `flip_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 3 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `flip_words('banana desert an up garden window by')` يجب أن تُرجع `'window_garden_desert_banana'`.\nالجواب:", "qhash": "29527aa912f2213c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 74638\nc = 0\nwhile m > 11:\n m = m // 4\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 74638\nc = 0\nwhile m > 11:\n m = m // 4\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "545ca3983f9a84f3", "answer": "4 7", "completion": " الناتج:\n```text\n4 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 5 for x in range(5, 12) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 5 for x in range(5, 12) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "f4605f9d2f5b4db4", "answer": "[20, 59, 116]\n3 195", "completion": " الناتج:\n```text\n[20, 59, 116]\n3 195\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 53) == 1)", "tests": ["assert rel_prime_count(135) == 133", "assert rel_prime_count(114) == 112", "assert rel_prime_count(56) == 55", "assert rel_prime_count(126) == 124", "assert rel_prime_count(2) == 2", "assert rel_prime_count(113) == 111", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(135) == 133\nassert rel_prime_count(114) == 112\nassert rel_prime_count(56) == 55\nassert rel_prime_count(126) == 124\nassert rel_prime_count(2) == 2\nassert rel_prime_count(113) == 111\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, 53) == 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, 53) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 53، أي أن القاسم المشترك الأكبر لها مع 53 يساوي 1.\nمثال: `rel_prime_count(135)` يجب أن تُرجع `133`.\nالجواب:", "qhash": "98ec3dacc66b5469"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ق'):\n count += 1\n return count", "tests": ["assert starts_count('شجرة قمر شجرة باب رمل قمر رمل') == 2", "assert starts_count('عربية سفينة حاسوب مدرسة عربية') == 0", "assert starts_count('تفاحة حصان فجر ليل قهوة سيارة') == 1", "assert starts_count('قهوة حاسوب صحراء نور قهوة ليل') == 2", "assert starts_count('نهار فجر') == 0", "assert starts_count('دفتر بيت حاسوب طالب شجرة') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('شجرة قمر شجرة باب رمل قمر رمل') == 2\nassert starts_count('عربية سفينة حاسوب مدرسة عربية') == 0\nassert starts_count('تفاحة حصان فجر ليل قهوة سيارة') == 1\nassert starts_count('قهوة حاسوب صحراء نور قهوة ليل') == 2\nassert starts_count('نهار فجر') == 0\nassert starts_count('دفتر بيت حاسوب طالب شجرة') == 0\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ق'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(line):\n count = 0\n for w in line.split():\n if w.endswith('ق'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('شجرة قمر شجرة باب رمل قمر رمل')` يُرجع `2`.\nالجواب:", "qhash": "327db35363928478"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -2 * x ** 2 + (-1) * x + (-3)", "tests": ["assert evaluate(3) == -24", "assert evaluate(12) == -303", "assert evaluate(8) == -139", "assert evaluate(-10) == -193", "assert evaluate(18) == -669", "assert evaluate(6) == -81", "assert evaluate(-17) == -564", "assert evaluate(0) == -3"], "test_code": "assert evaluate(3) == -24\nassert evaluate(12) == -303\nassert evaluate(8) == -139\nassert evaluate(-10) == -193\nassert evaluate(18) == -669\nassert evaluate(6) == -81\nassert evaluate(-17) == -564\nassert evaluate(0) == -3", "answer": "def evaluate(x):\n return -2 * x ** 2 + (-1) * x + (-3)", "completion": " ```python\ndef evaluate(x):\n return -2 * x ** 2 + (-1) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -2x² - 1x - 3 عند العدد الصحيح x.\nمثال: `evaluate(3)` يجب أن تُرجع `-24`.\nالجواب:", "qhash": "f3a46b3ebf40e409"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([26, 15, 57, 41, 1, 43]) == None", "assert largest_div([-20, -10, -50]) == -10", "assert largest_div([1, 11, 21, 31]) == None", "assert largest_div([20, -34, -19, 19, -2, 31, 13, -31, 36]) == 20", "assert largest_div([37, 2, 10, 38, 0, 15, 27, -30, -25]) == 10", "assert largest_div([]) == None"], "test_code": "assert largest_div([26, 15, 57, 41, 1, 43]) == None\nassert largest_div([-20, -10, -50]) == -10\nassert largest_div([1, 11, 21, 31]) == None\nassert largest_div([20, -34, -19, 19, -2, 31, 13, -31, 36]) == 20\nassert largest_div([37, 2, 10, 38, 0, 15, 27, -30, -25]) == 10\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 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 % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `largest_div([26, 15, 57, 41, 1, 43])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "9cdfb7b7ed621bb7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 260\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 = 260\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": "7c9e05e1342eada4", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert cycle([2, 36, 2, 33, 17, 50, 32, 3]) == [33, 17, 50, 32, 3, 2, 36, 2]", "assert cycle([25, 1, 14]) == [1, 14, 25]", "assert cycle([48, 16, 26, 21, -9, 19]) == [16, 26, 21, -9, 19, 48]", "assert cycle([21, 45]) == [45, 21]", "assert cycle([29, 7, -9, 41, 10, 6, -2, -6, 50, 8, -5]) == [50, 8, -5, 29, 7, -9, 41, 10, 6, -2, -6]", "assert cycle([17, 28, 31, 25, 11, 44, 35, 3, 12, 4, 33]) == [12, 4, 33, 17, 28, 31, 25, 11, 44, 35, 3]", "assert cycle([]) == []"], "test_code": "assert cycle([2, 36, 2, 33, 17, 50, 32, 3]) == [33, 17, 50, 32, 3, 2, 36, 2]\nassert cycle([25, 1, 14]) == [1, 14, 25]\nassert cycle([48, 16, 26, 21, -9, 19]) == [16, 26, 21, -9, 19, 48]\nassert cycle([21, 45]) == [45, 21]\nassert cycle([29, 7, -9, 41, 10, 6, -2, -6, 50, 8, -5]) == [50, 8, -5, 29, 7, -9, 41, 10, 6, -2, -6]\nassert cycle([17, 28, 31, 25, 11, 44, 35, 3, 12, 4, 33]) == [12, 4, 33, 17, 28, 31, 25, 11, 44, 35, 3]\nassert cycle([]) == []", "answer": "def cycle(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef cycle(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([2, 36, 2, 33, 17, 50, 32, 3])` يُرجع `[33, 17, 50, 32, 3, 2, 36, 2]`.\nالجواب:", "qhash": "df7fe496ebe3a6a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'منى': 47, 'نور': 31, 'عمر': 13}\npoints['عمر'] += 17\npoints['ليلى'] = 31\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 39])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'منى': 47, 'نور': 31, 'عمر': 13}\npoints['عمر'] += 17\npoints['ليلى'] = 31\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 39])\n```\nالجواب:", "qhash": "28fd81e2609b9b9a", "answer": "4\nمنى\n139\n['منى']", "completion": " الناتج:\n```text\n4\nمنى\n139\n['منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'برتقال'\nprint(len(kalima))\nprint(kalima.replace(' ', '-'))\nprint(kalima[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'برتقال'\nprint(len(kalima))\nprint(kalima.replace(' ', '-'))\nprint(kalima[::-1])\n```\nالجواب:", "qhash": "f7f0a20ad9baf80f", "answer": "6\nبرتقال\nلاقترب", "completion": " الناتج:\n```text\n6\nبرتقال\nلاقترب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 56) == 1)", "tests": ["assert count_gcd1(41) == 18", "assert count_gcd1(100) == 43", "assert count_gcd1(43) == 19", "assert count_gcd1(158) == 68", "assert count_gcd1(6) == 3", "assert count_gcd1(180) == 77", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(41) == 18\nassert count_gcd1(100) == 43\nassert count_gcd1(43) == 19\nassert count_gcd1(158) == 68\nassert count_gcd1(6) == 3\nassert count_gcd1(180) == 77\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, 56) == 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, 56) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 56، أي أن القاسم المشترك الأكبر لها مع 56 يساوي 1.\nمثال: `count_gcd1(41)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "4814d3cb35126f4a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 2 * x ** 2 + (-9) * x + (-6)", "tests": ["assert p(8) == 50", "assert p(8) == 50", "assert p(13) == 215", "assert p(-19) == 887", "assert p(-2) == 20", "assert p(13) == 215", "assert p(-16) == 650", "assert p(0) == -6"], "test_code": "assert p(8) == 50\nassert p(8) == 50\nassert p(13) == 215\nassert p(-19) == 887\nassert p(-2) == 20\nassert p(13) == 215\nassert p(-16) == 650\nassert p(0) == -6", "answer": "def p(x):\n return 2 * x ** 2 + (-9) * x + (-6)", "completion": " ```python\ndef p(x):\n return 2 * x ** 2 + (-9) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 2x² - 9x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(8)` يُرجع `50`.\nالجواب:", "qhash": "4af91f183defb0a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'vector_code'\nprint(name.count('o'))\nprint(name.upper())\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'vector_code'\nprint(name.count('o'))\nprint(name.upper())\nprint(name[::-1])\n```\nالجواب:", "qhash": "01ea63960bb4f4bf", "answer": "2\nVECTOR_CODE\nedoc_rotcev", "completion": " الناتج:\n```text\n2\nVECTOR_CODE\nedoc_rotcev\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'نهار برتقال'\nprint(len(w))\nprint(w[-1])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'نهار برتقال'\nprint(len(w))\nprint(w[-1])\nprint(w.split())\n```\nالجواب:", "qhash": "9cc77dd2b2453e60", "answer": "11\nل\n['نهار', 'برتقال']", "completion": " الناتج:\n```text\n11\nل\n['نهار', 'برتقال']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -5 for x in xs if -17 <= x <= 12)", "tests": ["assert select_range([22, 10, -18, 1]) == [-50, -5]", "assert select_range([26, 5, 33, 21, 10, 49, 50, -20, -22, 16]) == [-50, -25]", "assert select_range([58, -6, 18, 21, 12, 47, 24]) == [-60, 30]", "assert select_range([-24, 16, 8, 4, 59, -4, 52, 23, -25, -19]) == [-40, -20, 20]", "assert select_range([21, 22, -29, 59, 13, -3]) == [15]", "assert select_range([-5, -20, 60, 57, 36, -16]) == [25, 80]", "assert select_range([3, 37, 49, 16, 18, 5, -2]) == [-25, -15, 10]", "assert select_range([]) == []"], "test_code": "assert select_range([22, 10, -18, 1]) == [-50, -5]\nassert select_range([26, 5, 33, 21, 10, 49, 50, -20, -22, 16]) == [-50, -25]\nassert select_range([58, -6, 18, 21, 12, 47, 24]) == [-60, 30]\nassert select_range([-24, 16, 8, 4, 59, -4, 52, 23, -25, -19]) == [-40, -20, 20]\nassert select_range([21, 22, -29, 59, 13, -3]) == [15]\nassert select_range([-5, -20, 60, 57, 36, -16]) == [25, 80]\nassert select_range([3, 37, 49, 16, 18, 5, -2]) == [-25, -15, 10]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -5 for x in xs if -17 <= x <= 12)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -5 for x in xs if -17 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -17 و12 (شاملًا الطرفين) في -5.\nمثال: `select_range([22, 10, -18, 1])` يجب أن تُرجع `[-50, -5]`.\nالجواب:", "qhash": "9cb729cef435e125"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([41, 35, 2, 48, 24, 22, 40, 13, 2]) == [41, 76, 78, 0, 24, 46, 86, 99, 101]", "assert acc_reset([67, 102, 106, -8, 5, 89, 61, 19]) == [67, 0, 106, 98, 103, 0, 61, 80]", "assert acc_reset([96, 91, 105, 72, 21, 80, 7, 13, 69]) == [96, 0, 105, 0, 21, 101, 0, 13, 82]", "assert acc_reset([45, 102, 10, 105, 104, 8]) == [45, 0, 10, 0, 104, 0]", "assert acc_reset([39, 61, 104, 64]) == [39, 100, 0, 64]", "assert acc_reset([-10, 67, 0, 104, 47, 13, 66, 38]) == [-10, 57, 57, 0, 47, 60, 0, 38]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([41, 35, 2, 48, 24, 22, 40, 13, 2]) == [41, 76, 78, 0, 24, 46, 86, 99, 101]\nassert acc_reset([67, 102, 106, -8, 5, 89, 61, 19]) == [67, 0, 106, 98, 103, 0, 61, 80]\nassert acc_reset([96, 91, 105, 72, 21, 80, 7, 13, 69]) == [96, 0, 105, 0, 21, 101, 0, 13, 82]\nassert acc_reset([45, 102, 10, 105, 104, 8]) == [45, 0, 10, 0, 104, 0]\nassert acc_reset([39, 61, 104, 64]) == [39, 100, 0, 64]\nassert acc_reset([-10, 67, 0, 104, 47, 13, 66, 38]) == [-10, 57, 57, 0, 47, 60, 0, 38]\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 106 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([41, 35, 2, 48, 24, 22, 40, 13, 2])` يُرجع `[41, 76, 78, 0, 24, 46, 86, 99, 101]`.\nالجواب:", "qhash": "2dfca6be5cba4dc2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "tests": ["assert step_product(11) == 32", "assert step_product(2) == 2", "assert step_product(33) == 29", "assert step_product(52) == 42", "assert step_product(41) == 42", "assert step_product(0) == 1", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 32\nassert step_product(2) == 2\nassert step_product(33) == 29\nassert step_product(52) == 42\nassert step_product(41) == 42\nassert step_product(0) == 1\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(11)` يجب أن تُرجع `32`.\nالجواب:", "qhash": "e0dabe7a12a44647"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44", "tests": ["assert digits_mod(13756) == 4", "assert digits_mod(142396) == 27", "assert digits_mod(536370) == 40", "assert digits_mod(869119) == 36", "assert digits_mod(569296) == 31", "assert digits_mod(479526) == 23", "assert digits_mod(790224) == 10", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(13756) == 4\nassert digits_mod(142396) == 27\nassert digits_mod(536370) == 40\nassert digits_mod(869119) == 36\nassert digits_mod(569296) == 31\nassert digits_mod(479526) == 23\nassert digits_mod(790224) == 10\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 44\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 44.\nمثال: `digits_mod(13756)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "8f8f53f3b0f42973"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 19", "tests": ["assert multi_fact(9) == 14", "assert multi_fact(44) == 0", "assert multi_fact(59) == 0", "assert multi_fact(27) == 0", "assert multi_fact(13) == 7", "assert multi_fact(38) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(9) == 14\nassert multi_fact(44) == 0\nassert multi_fact(59) == 0\nassert multi_fact(27) == 0\nassert multi_fact(13) == 7\nassert multi_fact(38) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 19", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(9)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "d89ed91a34f11bb7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 17) == 1)", "tests": ["assert count_coprime(56) == 53", "assert count_coprime(107) == 101", "assert count_coprime(77) == 73", "assert count_coprime(60) == 57", "assert count_coprime(29) == 28", "assert count_coprime(14) == 14", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(56) == 53\nassert count_coprime(107) == 101\nassert count_coprime(77) == 73\nassert count_coprime(60) == 57\nassert count_coprime(29) == 28\nassert count_coprime(14) == 14\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, 17) == 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, 17) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 17، أي أن القاسم المشترك الأكبر لها مع 17 يساوي 1.\nمثال: `count_coprime(56)` يجب أن تُرجع `53`.\nالجواب:", "qhash": "b94772f74f77c691"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سماء'\nprint(text[::-1])\nprint(text[-1])\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سماء'\nprint(text[::-1])\nprint(text[-1])\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "e49e90a8d3247df1", "answer": "ءامس\nء\n4", "completion": " الناتج:\n```text\nءامس\nء\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 9", "tests": ["assert digit_score(72889) == 7", "assert digit_score(97081) == 4", "assert digit_score(134826) == 3", "assert digit_score(721254) == 6", "assert digit_score(961032) == 6", "assert digit_score(908452) == 4", "assert digit_score(445310) == 8", "assert digit_score(0) == 0"], "test_code": "assert digit_score(72889) == 7\nassert digit_score(97081) == 4\nassert digit_score(134826) == 3\nassert digit_score(721254) == 6\nassert digit_score(961032) == 6\nassert digit_score(908452) == 4\nassert digit_score(445310) == 8\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 9", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 9\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 9.\nمثال: `digit_score(72889)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "307477719ece9b62"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -1 + 2 for x in range(4, 9) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -1 + 2 for x in range(4, 9) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "08841ca00a983cf8", "answer": "[-3, -6]\n2 -9", "completion": " الناتج:\n```text\n[-3, -6]\n2 -9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [-1, 19, 20, 3, 31, -9, 15, 26]\nprint(items[2:6])\nprint(items[::3])\nprint(sum(items[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [-1, 19, 20, 3, 31, -9, 15, 26]\nprint(items[2:6])\nprint(items[::3])\nprint(sum(items[2:6]))\n```\nالجواب:", "qhash": "e59c2363c396d8fb", "answer": "[20, 3, 31, -9]\n[-1, 3, 15]\n45", "completion": " الناتج:\n```text\n[20, 3, 31, -9]\n[-1, 3, 15]\n45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ل')", "tests": ["assert count_hits('عربية حديقة نهار معلم عربية') == 1", "assert count_hits('شجرة شجرة') == 0", "assert count_hits('عربية خبز') == 0", "assert count_hits('معلم ماء') == 1", "assert count_hits('بيت كتاب سماء جبل سوق') == 1", "assert count_hits('عمل علم بحر علم خبز') == 3", "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('معلم ماء') == 1\nassert count_hits('بيت كتاب سماء جبل سوق') == 1\nassert count_hits('عمل علم بحر علم خبز') == 3\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)` بحيث تُعيد عدد مرات ظهور الحرف «ل» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('عربية حديقة نهار معلم عربية')` يُرجع `1`.\nالجواب:", "qhash": "b38d24ef9e26fa00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 34) == 1)", "tests": ["assert rel_prime_count(45) == 22", "assert rel_prime_count(38) == 18", "assert rel_prime_count(167) == 79", "assert rel_prime_count(81) == 39", "assert rel_prime_count(68) == 32", "assert rel_prime_count(158) == 74", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(45) == 22\nassert rel_prime_count(38) == 18\nassert rel_prime_count(167) == 79\nassert rel_prime_count(81) == 39\nassert rel_prime_count(68) == 32\nassert rel_prime_count(158) == 74\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, 34) == 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, 34) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 34) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(45)` يُرجع `22`.\nالجواب:", "qhash": "437c5547d2a54e28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حديقة ماء نور حديقة مطر') == 2", "assert lead_count('سوق نور حصان حصان خبز نور سوق') == 2", "assert lead_count('سفينة صحراء باب') == 0", "assert lead_count('سماء مدينة') == 0", "assert lead_count('سيارة سفينة صديق معلم حصان') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('حصان نهار حديقة سماء سوق') == 2\nassert lead_count('حديقة ماء نور حديقة مطر') == 2\nassert lead_count('سوق نور حصان حصان خبز نور سوق') == 2\nassert lead_count('سفينة صحراء باب') == 0\nassert lead_count('سماء مدينة') == 0\nassert lead_count('سيارة سفينة صديق معلم حصان') == 1\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.split():\n if 'ح' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ح»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef lead_count(line):\n count = 0\n for w in line.split():\n if 'ح' in w:\n count += 1\n return count\n```\nمثال: `lead_count('حصان نهار حديقة سماء سوق')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "bf2449d154fa3483"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([-27, -21, -1, 18, 8, -1]) == None", "assert find_max_div([-55, -44, -44]) == -44", "assert find_max_div([1, 12]) == None", "assert find_max_div([-14, 7, -2, -16, 19, 1, 11, 9]) == 11", "assert find_max_div([-17, 24, 25, -24, 10, -2, -41, -42]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-27, -21, -1, 18, 8, -1]) == None\nassert find_max_div([-55, -44, -44]) == -44\nassert find_max_div([1, 12]) == None\nassert find_max_div([-14, 7, -2, -16, 19, 1, 11, 9]) == 11\nassert find_max_div([-17, 24, 25, -24, 10, -2, -41, -42]) == None\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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للتوضيح: الاستدعاء `find_max_div([-27, -21, -1, 18, 8, -1])` يُرجع `None`.\nالجواب:", "qhash": "eff15d69be448aa6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('camel data engine signal') == 'trdvc urkr vexzev jzxerc'", "assert cipher('camel') == 'trdvc'", "assert cipher('falcon engine of camel at') == 'wrctfe vexzev fw trdvc rk'", "assert cipher('coffee to go A1') == 'tfwwvv kf xf A1'", "assert cipher('falcon brain falcon river banana') == 'wrctfe sirze wrctfe izmvi srerer'", "assert cipher('python data A1') == 'gpkyfe urkr A1'", "assert cipher('') == ''"], "test_code": "assert cipher('camel data engine signal') == 'trdvc urkr vexzev jzxerc'\nassert cipher('camel') == 'trdvc'\nassert cipher('falcon engine of camel at') == 'wrctfe vexzev fw trdvc rk'\nassert cipher('coffee to go A1') == 'tfwwvv kf xf A1'\nassert cipher('falcon brain falcon river banana') == 'wrctfe sirze wrctfe izmvi srerer'\nassert cipher('python data A1') == 'gpkyfe urkr 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 + (-9)) % 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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('camel data engine signal')` يُرجع `'trdvc urkr vexzev jzxerc'`.\nالجواب:", "qhash": "74acc9637a7ae02c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 87) == 1)", "tests": ["assert rel_prime_count(56) == 37", "assert rel_prime_count(132) == 85", "assert rel_prime_count(188) == 122", "assert rel_prime_count(30) == 19", "assert rel_prime_count(0) == 0", "assert rel_prime_count(126) == 81", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(56) == 37\nassert rel_prime_count(132) == 85\nassert rel_prime_count(188) == 122\nassert rel_prime_count(30) == 19\nassert rel_prime_count(0) == 0\nassert rel_prime_count(126) == 81\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, 87) == 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, 87) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 87، أي أن القاسم المشترك الأكبر لها مع 87 يساوي 1.\nمثال: `rel_prime_count(56)` يجب أن تُرجع `37`.\nالجواب:", "qhash": "3e7755d0073c6080"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [22, 27, 31, 27, 20, -6, -4]\nprint(data[2:6])\nprint(data[::-2])\nprint(len(data[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [22, 27, 31, 27, 20, -6, -4]\nprint(data[2:6])\nprint(data[::-2])\nprint(len(data[2:6]))\n```\nالجواب:", "qhash": "c7b9dcf814877444", "answer": "[31, 27, 20, -6]\n[-4, 20, 31, 22]\n4", "completion": " الناتج:\n```text\n[31, 27, 20, -6]\n[-4, 20, 31, 22]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23", "tests": ["assert sum_digit_pow(25010) == 8", "assert sum_digit_pow(832777) == 11", "assert sum_digit_pow(906270) == 1", "assert sum_digit_pow(481923) == 4", "assert sum_digit_pow(779144) == 9", "assert sum_digit_pow(678338) == 12", "assert sum_digit_pow(880231) == 22", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(25010) == 8\nassert sum_digit_pow(832777) == 11\nassert sum_digit_pow(906270) == 1\nassert sum_digit_pow(481923) == 4\nassert sum_digit_pow(779144) == 9\nassert sum_digit_pow(678338) == 12\nassert sum_digit_pow(880231) == 22\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 23.\nمثال: `sum_digit_pow(25010)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "f8c7c43471350910"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(5))\nprint(compute(5, 1))\nprint(compute(compute(1), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(5))\nprint(compute(5, 1))\nprint(compute(compute(1), 5))\n```\nالجواب:", "qhash": "f224b3ef73403734", "answer": "24\n24\n25", "completion": " الناتج:\n```text\n24\n24\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 61) == 1)", "tests": ["assert rel_prime_count(59) == 59", "assert rel_prime_count(99) == 98", "assert rel_prime_count(16) == 16", "assert rel_prime_count(80) == 79", "assert rel_prime_count(56) == 56", "assert rel_prime_count(16) == 16", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(59) == 59\nassert rel_prime_count(99) == 98\nassert rel_prime_count(16) == 16\nassert rel_prime_count(80) == 79\nassert rel_prime_count(56) == 56\nassert rel_prime_count(16) == 16\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 61) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(59)` يُرجع `59`.\nالجواب:", "qhash": "d4b92a1d471ddda3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['light', 'orange', 'table', 'engine', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['light', 'orange', 'table', 'engine', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "adaf9db7b9ea1c84", "answer": "['light', 'table', 'orange', 'engine', 'window']\n['window', 'orange', 'engine']", "completion": " الناتج:\n```text\n['light', 'table', 'orange', 'engine', 'window']\n['window', 'orange', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 165\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 = 165\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": "aafa969e4b86a180", "answer": "111", "completion": " الناتج:\n```text\n111\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 69", "tests": ["assert digits_mod(70030) == 58", "assert digits_mod(547671) == 38", "assert digits_mod(376170) == 6", "assert digits_mod(426119) == 1", "assert digits_mod(397243) == 30", "assert digits_mod(184961) == 61", "assert digits_mod(542262) == 20", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(70030) == 58\nassert digits_mod(547671) == 38\nassert digits_mod(376170) == 6\nassert digits_mod(426119) == 1\nassert digits_mod(397243) == 30\nassert digits_mod(184961) == 61\nassert digits_mod(542262) == 20\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 69", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 69\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 69.\nمثال: `digits_mod(70030)` يجب أن تُرجع `58`.\nالجواب:", "qhash": "863879c386d12576"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 12) == 1)", "tests": ["assert coprimes(130) == 43", "assert coprimes(142) == 47", "assert coprimes(84) == 28", "assert coprimes(52) == 17", "assert coprimes(16) == 5", "assert coprimes(87) == 29", "assert coprimes(1) == 1"], "test_code": "assert coprimes(130) == 43\nassert coprimes(142) == 47\nassert coprimes(84) == 28\nassert coprimes(52) == 17\nassert coprimes(16) == 5\nassert coprimes(87) == 29\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, 12) == 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, 12) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 12، أي أن القاسم المشترك الأكبر لها مع 12 يساوي 1.\nمثال: `coprimes(130)` يجب أن تُرجع `43`.\nالجواب:", "qhash": "ebcb15a5127d160a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([-27, -13, -4, 48, 59, -23, 0]) == 48", "assert top_divisible([-2, -6, -2]) == -2", "assert top_divisible([1, 3]) == None", "assert top_divisible([-22, 22, 34, -5, -19, -31, 30, -20, -13]) == 34", "assert top_divisible([31, 40, -3, -3, -37, -9]) == 40", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-27, -13, -4, 48, 59, -23, 0]) == 48\nassert top_divisible([-2, -6, -2]) == -2\nassert top_divisible([1, 3]) == None\nassert top_divisible([-22, 22, 34, -5, -19, -31, 30, -20, -13]) == 34\nassert top_divisible([31, 40, -3, -3, -37, -9]) == 40\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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مثال: `top_divisible([-27, -13, -4, 48, 59, -23, 0])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "ae2bc3e5ba6e0a15"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 8\nfor j in range(6, 24, 3):\n s -= j * 4\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 8\nfor j in range(6, 24, 3):\n s -= j * 4\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "17fa4d07c67681a1", "answer": "-316\n21", "completion": " الناتج:\n```text\n-316\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18", "tests": ["assert dig_pow_mod(54172) == 5", "assert dig_pow_mod(348096) == 8", "assert dig_pow_mod(179297) == 13", "assert dig_pow_mod(943976) == 2", "assert dig_pow_mod(160215) == 13", "assert dig_pow_mod(748826) == 17", "assert dig_pow_mod(378838) == 7", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(54172) == 5\nassert dig_pow_mod(348096) == 8\nassert dig_pow_mod(179297) == 13\nassert dig_pow_mod(943976) == 2\nassert dig_pow_mod(160215) == 13\nassert dig_pow_mod(748826) == 17\nassert dig_pow_mod(378838) == 7\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 18\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 18.\nللتوضيح: الاستدعاء `dig_pow_mod(54172)` يُرجع `5`.\nالجواب:", "qhash": "b684a8f3774cfcee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'جبل'\nprint(kalima[::-1])\nprint(kalima[0])\nprint(len(kalima.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'جبل'\nprint(kalima[::-1])\nprint(kalima[0])\nprint(len(kalima.replace(' ', '')))\n```\nالجواب:", "qhash": "314519d8631877a9", "answer": "لبج\nج\n3", "completion": " الناتج:\n```text\nلبج\nج\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 40)", "tests": ["assert in_range_scaled([35, 11, 50, 45, 39, 5, 15, 27, 14, 24]) == [70, 75, 120, 135, 175, 195]", "assert in_range_scaled([34, 7, -8, 17, 36, 50, 32, 6, 1]) == [85, 160, 170, 180]", "assert in_range_scaled([7, 12, -13, -8, -29, 34, 48, 60, 21, 59]) == [105, 170]", "assert in_range_scaled([38, -29, -9, 2, -19, 7, 21, 17]) == [85, 105, 190]", "assert in_range_scaled([-6]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([0, -20]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([35, 11, 50, 45, 39, 5, 15, 27, 14, 24]) == [70, 75, 120, 135, 175, 195]\nassert in_range_scaled([34, 7, -8, 17, 36, 50, 32, 6, 1]) == [85, 160, 170, 180]\nassert in_range_scaled([7, 12, -13, -8, -29, 34, 48, 60, 21, 59]) == [105, 170]\nassert in_range_scaled([38, -29, -9, 2, -19, 7, 21, 17]) == [85, 105, 190]\nassert in_range_scaled([-6]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([0, -20]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 40)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 13 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 13 ≤ x ≤ 40، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([35, 11, 50, 45, 39, 5, 15, 27, 14, 24])` يُرجع `[70, 75, 120, 135, 175, 195]`.\nالجواب:", "qhash": "e3355de2bd3b3d27"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "tests": ["assert series(8) == 555984", "assert series(7) == 261072", "assert series(0) == 0", "assert series(8) == 555984", "assert series(2) == 297", "assert series(1) == 9", "assert series(0) == 0"], "test_code": "assert series(8) == 555984\nassert series(7) == 261072\nassert series(0) == 0\nassert series(8) == 555984\nassert series(2) == 297\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 ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 9 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 9 * i ** 5\n return total\n```\nمثال: `series(8)` يجب أن تُرجع `555984`.\nالجواب:", "qhash": "22bee4d3c2ce92dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('مدرسة صديق جبل') == 2", "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('فجر وردة جمل جمل رمل ميناء رمل') == 1\nassert count_letter('مدرسة صديق جبل') == 2\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 'د' 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «د» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('عمل بحر ميناء سماء برتقال ميناء معلم')` يُرجع `0`.\nالجواب:", "qhash": "ecec250acf4ab125"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'نور': 18, 'أحمد': 45, 'علي': 19}\npoints['أحمد'] += 7\npoints['راشد'] = 51\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('أحمد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'نور': 18, 'أحمد': 45, 'علي': 19}\npoints['أحمد'] += 7\npoints['راشد'] = 51\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('أحمد', -1))\n```\nالجواب:", "qhash": "fe283568a7080f7f", "answer": "4\nأحمد\n140\n52", "completion": " الناتج:\n```text\n4\nأحمد\n140\n52\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'حصان باب'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'حصان باب'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "7b8c148ee3fc5b68", "answer": "7\n['حصان', 'باب']\nحصان-باب", "completion": " الناتج:\n```text\n7\n['حصان', 'باب']\nحصان-باب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert count_initial('ميناء مطر قمر مدرسة باب نهر') == 3", "assert count_initial('لغة نور باب ماء قلم سوق معلم مدرسة') == 3", "assert count_initial('مدرسة حاسوب جبل') == 1", "assert count_initial('مكتبة مدينة ليل ماء') == 3", "assert count_initial('قهوة ميناء نهار مدينة معلم') == 3", "assert count_initial('نور جمل تفاحة نهر وردة مكتبة معلم') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('ميناء مطر قمر مدرسة باب نهر') == 3\nassert count_initial('لغة نور باب ماء قلم سوق معلم مدرسة') == 3\nassert count_initial('مدرسة حاسوب جبل') == 1\nassert count_initial('مكتبة مدينة ليل ماء') == 3\nassert count_initial('قهوة ميناء نهار مدينة معلم') == 3\nassert count_initial('نور جمل تفاحة نهر وردة مكتبة معلم') == 2\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(line):\n count = 0\n for w in line.split():\n if 'م' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('ميناء مطر قمر مدرسة باب نهر')` يُرجع `3`.\nالجواب:", "qhash": "c1b9264b0a6f3d63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 68) == 1)", "tests": ["assert coprimes(113) == 54", "assert coprimes(32) == 15", "assert coprimes(41) == 20", "assert coprimes(88) == 41", "assert coprimes(177) == 84", "assert coprimes(72) == 34", "assert coprimes(1) == 1"], "test_code": "assert coprimes(113) == 54\nassert coprimes(32) == 15\nassert coprimes(41) == 20\nassert coprimes(88) == 41\nassert coprimes(177) == 84\nassert coprimes(72) == 34\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, 68) == 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, 68) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 68) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(113)` يُرجع `54`.\nالجواب:", "qhash": "8724bd9427e4c0c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(148130886))\nprint(rec(rec(148130886)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(148130886))\nprint(rec(rec(148130886)))\n```\nالجواب:", "qhash": "cd48189aa25dbd60", "answer": "39\n12", "completion": " الناتج:\n```text\n39\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 42)", "tests": ["assert pick_between([48, 43, 43, 39, 42, 14, 29, 14, 24, 14]) == [-168, -156, -116, -96]", "assert pick_between([-24, 1, 24, -30, 1, 41, 14, 36, -3]) == [-164, -144, -96]", "assert pick_between([-3, 0, -27, -3, -30]) == []", "assert pick_between([-30, 35, 5, -16, -6, 15, 5, 21]) == [-140, -84]", "assert pick_between([-9, -3, 58, -25, 32, 37, 1, -16]) == [-148, -128]", "assert pick_between([26, 0, 42, -21, 21, 52, 21]) == [-168, -104, -84, -84]", "assert pick_between([]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([48, 43, 43, 39, 42, 14, 29, 14, 24, 14]) == [-168, -156, -116, -96]\nassert pick_between([-24, 1, 24, -30, 1, 41, 14, 36, -3]) == [-164, -144, -96]\nassert pick_between([-3, 0, -27, -3, -30]) == []\nassert pick_between([-30, 35, 5, -16, -6, 15, 5, 21]) == [-140, -84]\nassert pick_between([-9, -3, 58, -25, 32, 37, 1, -16]) == [-148, -128]\nassert pick_between([26, 0, 42, -21, 21, 52, 21]) == [-168, -104, -84, -84]\nassert pick_between([]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 42)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 42)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 42، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([48, 43, 43, 39, 42, 14, 29, 14, 24, 14])` يُرجع `[-168, -156, -116, -96]`.\nالجواب:", "qhash": "68eb1fc65c8fd300"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(5))\nprint(h(5, 14))\nprint(h(h(14), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=1):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(5))\nprint(h(5, 14))\nprint(h(h(14), 5))\n```\nالجواب:", "qhash": "0de46ee7ad00014b", "answer": "-6\n-9\n-20", "completion": " الناتج:\n```text\n-6\n-9\n-20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert game(11) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue']", "assert game(5) == ['1', '2', '3', 'Red', '5']", "assert game(25) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19', 'Red', '21', 'Blue', '23', 'Red', '25']", "assert game(14) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14']", "assert game(8) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red']"], "test_code": "assert game(11) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue']\nassert game(5) == ['1', '2', '3', 'Red', '5']\nassert game(25) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19', 'Red', '21', 'Blue', '23', 'Red', '25']\nassert game(14) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14']\nassert game(8) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(11)` يُرجع `['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue']`.\nالجواب:", "qhash": "c546e68764659dc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-9))\nprint(h(-9, 13))\nprint(h(h(13), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-9))\nprint(h(-9, 13))\nprint(h(h(13), -9))\n```\nالجواب:", "qhash": "5569120c5dac2d6f", "answer": "-12\n-48\n-13", "completion": " الناتج:\n```text\n-12\n-48\n-13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 9 * x ** 2 + (8) * x + (-3)", "tests": ["assert value_at(9) == 798", "assert value_at(8) == 637", "assert value_at(-8) == 509", "assert value_at(-17) == 2462", "assert value_at(16) == 2429", "assert value_at(3) == 102", "assert value_at(5) == 262", "assert value_at(0) == -3"], "test_code": "assert value_at(9) == 798\nassert value_at(8) == 637\nassert value_at(-8) == 509\nassert value_at(-17) == 2462\nassert value_at(16) == 2429\nassert value_at(3) == 102\nassert value_at(5) == 262\nassert value_at(0) == -3", "answer": "def value_at(x):\n return 9 * x ** 2 + (8) * x + (-3)", "completion": " ```python\ndef value_at(x):\n return 9 * x ** 2 + (8) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 9x² + 8x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(9)` يُرجع `798`.\nالجواب:", "qhash": "b743ebeabaad4d80"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "tests": ["assert pow_total(5) == 1350", "assert pow_total(5) == 1350", "assert pow_total(14) == 66150", "assert pow_total(1) == 6", "assert pow_total(11) == 26136", "assert pow_total(1) == 6", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 1350\nassert pow_total(5) == 1350\nassert pow_total(14) == 66150\nassert pow_total(1) == 6\nassert pow_total(11) == 26136\nassert pow_total(1) == 6\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `pow_total(5)` يُرجع `1350`.\nالجواب:", "qhash": "1ec5e831cc86b558"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(-2, 3))", "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(-2, 3))\n```\nالجواب:", "qhash": "93fa948223ed68fd", "answer": "-8", "completion": " الناتج:\n```text\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'dmn'}", "tests": ["assert tally('light an banana vector') == {'d': 0, 'm': 0, 'n': 3}", "assert tally('pixel music pixel vector up go') == {'d': 0, 'm': 1, 'n': 0}", "assert tally('is') == {'d': 0, 'm': 0, 'n': 0}", "assert tally('rocket') == {'d': 0, 'm': 0, 'n': 0}", "assert tally('a summer planet camel cloud python') == {'d': 1, 'm': 3, 'n': 2}", "assert tally('winter camel') == {'d': 0, 'm': 1, 'n': 1}", "assert tally('') == {'d': 0, 'm': 0, 'n': 0}"], "test_code": "assert tally('light an banana vector') == {'d': 0, 'm': 0, 'n': 3}\nassert tally('pixel music pixel vector up go') == {'d': 0, 'm': 1, 'n': 0}\nassert tally('is') == {'d': 0, 'm': 0, 'n': 0}\nassert tally('rocket') == {'d': 0, 'm': 0, 'n': 0}\nassert tally('a summer planet camel cloud python') == {'d': 1, 'm': 3, 'n': 2}\nassert tally('winter camel') == {'d': 0, 'm': 1, 'n': 1}\nassert tally('') == {'d': 0, 'm': 0, 'n': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'dmn'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'dmn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'm'، 'n' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('light an banana vector')` يُرجع `{'d': 0, 'm': 0, 'n': 3}`.\nالجواب:", "qhash": "44ebcf36cdac009a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -6 * x ** 2 + (-8) * x + (5)", "tests": ["assert quad(9) == -553", "assert quad(-11) == -633", "assert quad(15) == -1465", "assert quad(18) == -2083", "assert quad(2) == -35", "assert quad(-14) == -1059", "assert quad(12) == -955", "assert quad(0) == 5"], "test_code": "assert quad(9) == -553\nassert quad(-11) == -633\nassert quad(15) == -1465\nassert quad(18) == -2083\nassert quad(2) == -35\nassert quad(-14) == -1059\nassert quad(12) == -955\nassert quad(0) == 5", "answer": "def quad(x):\n return -6 * x ** 2 + (-8) * x + (5)", "completion": " ```python\ndef quad(x):\n return -6 * x ** 2 + (-8) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -6x² - 8x + 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(9)` يُرجع `-553`.\nالجواب:", "qhash": "4b903b2463713638"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 237\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 = 237\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": "24f5fbdaf8f29c03", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 5", "tests": ["assert digit_power(76650) == 1", "assert digit_power(127150) == 0", "assert digit_power(224718) == 3", "assert digit_power(984363) == 0", "assert digit_power(7544) == 1", "assert digit_power(104579) == 2", "assert digit_power(431887) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(76650) == 1\nassert digit_power(127150) == 0\nassert digit_power(224718) == 3\nassert digit_power(984363) == 0\nassert digit_power(7544) == 1\nassert digit_power(104579) == 2\nassert digit_power(431887) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 5", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 2 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 5.\nللتوضيح: الاستدعاء `digit_power(76650)` يُرجع `1`.\nالجواب:", "qhash": "d9b0c01c4d54aa28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(463848551))\nprint(f(f(463848551)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(463848551))\nprint(f(f(463848551)))\n```\nالجواب:", "qhash": "e54a2349e740601a", "answer": "44\n8", "completion": " الناتج:\n```text\n44\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(133) == 1978", "assert sum_multiples(115) == 1480", "assert sum_multiples(295) == 9720", "assert sum_multiples(236) == 6006", "assert sum_multiples(223) == 5551", "assert sum_multiples(99) == 1054", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(133) == 1978\nassert sum_multiples(115) == 1480\nassert sum_multiples(295) == 9720\nassert sum_multiples(236) == 6006\nassert sum_multiples(223) == 5551\nassert sum_multiples(99) == 1054\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 % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 11.\nمثال: `sum_multiples(133)` يجب أن تُرجع `1978`.\nالجواب:", "qhash": "b348e0c517991a75"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 62) == 1)", "tests": ["assert rel_prime_count(20) == 10", "assert rel_prime_count(98) == 47", "assert rel_prime_count(124) == 60", "assert rel_prime_count(110) == 53", "assert rel_prime_count(173) == 84", "assert rel_prime_count(131) == 64", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(20) == 10\nassert rel_prime_count(98) == 47\nassert rel_prime_count(124) == 60\nassert rel_prime_count(110) == 53\nassert rel_prime_count(173) == 84\nassert rel_prime_count(131) == 64\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, 62) == 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, 62) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 62، أي أن القاسم المشترك الأكبر لها مع 62 يساوي 1.\nمثال: `rel_prime_count(20)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "9af042d725066e93"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "tests": ["assert power_sum(5) == 13275", "assert power_sum(7) == 87024", "assert power_sum(3) == 828", "assert power_sum(7) == 87024", "assert power_sum(6) == 36603", "assert power_sum(1) == 3", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 13275\nassert power_sum(7) == 87024\nassert power_sum(3) == 828\nassert power_sum(7) == 87024\nassert power_sum(6) == 36603\nassert power_sum(1) == 3\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 5\n return total\n```\nمثال: `power_sum(5)` يجب أن تُرجع `13275`.\nالجواب:", "qhash": "67dae3b9a2b0895b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [26, -5, 20, -7, 16, 2, 33, -1, 10]\nprint(nums[3:8])\nprint(nums[::-1])\nprint(sum(nums[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [26, -5, 20, -7, 16, 2, 33, -1, 10]\nprint(nums[3:8])\nprint(nums[::-1])\nprint(sum(nums[3:8]))\n```\nالجواب:", "qhash": "70681691733db99b", "answer": "[-7, 16, 2, 33, -1]\n[10, -1, 33, 2, 16, -7, 20, -5, 26]\n43", "completion": " الناتج:\n```text\n[-7, 16, 2, 33, -1]\n[10, -1, 33, 2, 16, -7, 20, -5, 26]\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 37) == 1)", "tests": ["assert count_coprime(119) == 116", "assert count_coprime(63) == 62", "assert count_coprime(85) == 83", "assert count_coprime(142) == 139", "assert count_coprime(33) == 33", "assert count_coprime(117) == 114", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(119) == 116\nassert count_coprime(63) == 62\nassert count_coprime(85) == 83\nassert count_coprime(142) == 139\nassert count_coprime(33) == 33\nassert count_coprime(117) == 114\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, 37) == 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, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 37) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(119)` يُرجع `116`.\nالجواب:", "qhash": "055e80043fba829c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [29, 18, -19, 24, -10]\nprint(sorted(nums, key=lambda x: (abs(x - -9), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [29, 18, -19, 24, -10]\nprint(sorted(nums, key=lambda x: (abs(x - -9), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "a7150505525b0ada", "answer": "[-10, -19, 18, 24, 29]\n[29, 24, 18]", "completion": " الناتج:\n```text\n[-10, -19, 18, 24, 29]\n[29, 24, 18]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78", "tests": ["assert pow_digits(77020) == 24", "assert pow_digits(44100) == 33", "assert pow_digits(52008) == 15", "assert pow_digits(90428) == 9", "assert pow_digits(700429) == 72", "assert pow_digits(506382) == 60", "assert pow_digits(813141) == 14", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(77020) == 24\nassert pow_digits(44100) == 33\nassert pow_digits(52008) == 15\nassert pow_digits(90428) == 9\nassert pow_digits(700429) == 72\nassert pow_digits(506382) == 60\nassert pow_digits(813141) == 14\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 78\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 78.\nمثال: `pow_digits(77020)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "6ad61326a58f7c23"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'ben'}", "tests": ["assert char_freq('vector up') == {'b': 0, 'e': 1, 'n': 0}", "assert char_freq('matrix camel python a') == {'b': 0, 'e': 1, 'n': 1}", "assert char_freq('vector') == {'b': 0, 'e': 1, 'n': 0}", "assert char_freq('table river desert engine') == {'b': 1, 'e': 6, 'n': 2}", "assert char_freq('window engine on of go') == {'b': 0, 'e': 2, 'n': 4}", "assert char_freq('code') == {'b': 0, 'e': 1, 'n': 0}", "assert char_freq('') == {'b': 0, 'e': 0, 'n': 0}"], "test_code": "assert char_freq('vector up') == {'b': 0, 'e': 1, 'n': 0}\nassert char_freq('matrix camel python a') == {'b': 0, 'e': 1, 'n': 1}\nassert char_freq('vector') == {'b': 0, 'e': 1, 'n': 0}\nassert char_freq('table river desert engine') == {'b': 1, 'e': 6, 'n': 2}\nassert char_freq('window engine on of go') == {'b': 0, 'e': 2, 'n': 4}\nassert char_freq('code') == {'b': 0, 'e': 1, 'n': 0}\nassert char_freq('') == {'b': 0, 'e': 0, 'n': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'ben'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'ben'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'e'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('vector up')` يجب أن تُرجع `{'b': 0, 'e': 1, 'n': 0}`.\nالجواب:", "qhash": "06331d38c8e94952"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('شجرة شجرة مدرسة بحر') == 2", "assert prefix_hits('بحر ميناء') == 0", "assert prefix_hits('شجرة حديقة شجرة حصان رمل طائرة') == 2", "assert prefix_hits('شجرة شجرة سفينة قمر') == 2", "assert prefix_hits('رمل عربية خبز مكتبة') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('عمل ميناء مدينة حصان') == 0\nassert prefix_hits('شجرة شجرة مدرسة بحر') == 2\nassert prefix_hits('بحر ميناء') == 0\nassert prefix_hits('شجرة حديقة شجرة حصان رمل طائرة') == 2\nassert prefix_hits('شجرة شجرة سفينة قمر') == 2\nassert prefix_hits('رمل عربية خبز مكتبة') == 0\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 w.endswith('ش'):\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 w.endswith('ش'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('عمل ميناء مدينة حصان')` يُرجع `0`.\nالجواب:", "qhash": "3563e5539313174e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total", "tests": ["assert scaled_powers(6) == 42", "assert scaled_powers(7) == 56", "assert scaled_powers(15) == 240", "assert scaled_powers(4) == 20", "assert scaled_powers(4) == 20", "assert scaled_powers(1) == 2", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 42\nassert scaled_powers(7) == 56\nassert scaled_powers(15) == 240\nassert scaled_powers(4) == 20\nassert scaled_powers(4) == 20\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 ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 2 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 2 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 2 * i ** 1\n return total\n```\nمثال: `scaled_powers(6)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "aaeb1a33544140e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 3 for x in range(6, 17) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 3 for x in range(6, 17) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "01952bcd4a0a17d7", "answer": "[61, 118, 193]\n3 372", "completion": " الناتج:\n```text\n[61, 118, 193]\n3 372\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'أحمد': 23, 'حسن': 42, 'خالد': 18}\nmarks['خالد'] += 20\nmarks['ليلى'] = 26\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('خالد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'أحمد': 23, 'حسن': 42, 'خالد': 18}\nmarks['خالد'] += 20\nmarks['ليلى'] = 26\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('خالد', -1))\n```\nالجواب:", "qhash": "d1a702034dcdd79d", "answer": "4\nحسن\n129\n38", "completion": " الناتج:\n```text\n4\nحسن\n129\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 19", "tests": ["assert prod_mod(9) == 10", "assert prod_mod(32) == 14", "assert prod_mod(51) == 13", "assert prod_mod(49) == 0", "assert prod_mod(8) == 4", "assert prod_mod(18) == 5", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(9) == 10\nassert prod_mod(32) == 14\nassert prod_mod(51) == 13\nassert prod_mod(49) == 0\nassert prod_mod(8) == 4\nassert prod_mod(18) == 5\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 19", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(9)` يُرجع `10`.\nالجواب:", "qhash": "a16cdc7501873444"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert sum_terms(7) == 224", "assert sum_terms(8) == 288", "assert sum_terms(7) == 224", "assert sum_terms(11) == 528", "assert sum_terms(3) == 48", "assert sum_terms(1) == 8", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 224\nassert sum_terms(8) == 288\nassert sum_terms(7) == 224\nassert sum_terms(11) == 528\nassert sum_terms(3) == 48\nassert sum_terms(1) == 8\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 1\n return total\n```\nمثال: `sum_terms(7)` يجب أن تُرجع `224`.\nالجواب:", "qhash": "e40058e0e612002c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(16445297))\nprint(f(f(16445297)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(16445297))\nprint(f(f(16445297)))\n```\nالجواب:", "qhash": "c11999b4ffe7828c", "answer": "38\n11", "completion": " الناتج:\n```text\n38\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 48", "tests": ["assert digits_mod(22088) == 40", "assert digits_mod(888452) == 45", "assert digits_mod(838766) == 18", "assert digits_mod(569055) == 0", "assert digits_mod(95258) == 7", "assert digits_mod(725978) == 32", "assert digits_mod(776896) == 27", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(22088) == 40\nassert digits_mod(888452) == 45\nassert digits_mod(838766) == 18\nassert digits_mod(569055) == 0\nassert digits_mod(95258) == 7\nassert digits_mod(725978) == 32\nassert digits_mod(776896) == 27\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 48", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 48\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 48.\nمثال: `digits_mod(22088)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "ef55a42f27872d7f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'يوسف': 10, 'أحمد': 44, 'علي': 42, 'سلمى': 11, 'وليد': 35}\nd['سلمى'] += 17\nd['زينب'] = 3\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'يوسف': 10, 'أحمد': 44, 'علي': 42, 'سلمى': 11, 'وليد': 35}\nd['سلمى'] += 17\nd['زينب'] = 3\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('راشد', -1))\n```\nالجواب:", "qhash": "81ccf3e38704e03c", "answer": "6\nأحمد\n162\n-1", "completion": " الناتج:\n```text\n6\nأحمد\n162\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 24) == 1)", "tests": ["assert count_coprime(71) == 24", "assert count_coprime(64) == 21", "assert count_coprime(58) == 19", "assert count_coprime(105) == 35", "assert count_coprime(11) == 4", "assert count_coprime(109) == 37", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(71) == 24\nassert count_coprime(64) == 21\nassert count_coprime(58) == 19\nassert count_coprime(105) == 35\nassert count_coprime(11) == 4\nassert count_coprime(109) == 37\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, 24) == 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, 24) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 24، أي أن القاسم المشترك الأكبر لها مع 24 يساوي 1.\nمثال: `count_coprime(71)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "977ae4935c0ea9ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 1\nfor j in range(10, 14, 4):\n result -= j * 4\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 1\nfor j in range(10, 14, 4):\n result -= j * 4\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "8c225022d67d3d77", "answer": "-39\n10", "completion": " الناتج:\n```text\n-39\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ا»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('معلم جمل ليل صديق رمل')` يُرجع `0`.\nالجواب:", "qhash": "0684864daf646d0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 92", "tests": ["assert sum_digit_pow(44615) == 20", "assert sum_digit_pow(648687) == 39", "assert sum_digit_pow(34369) == 25", "assert sum_digit_pow(123791) == 23", "assert sum_digit_pow(81166) == 22", "assert sum_digit_pow(562228) == 25", "assert sum_digit_pow(252804) == 21", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(44615) == 20\nassert sum_digit_pow(648687) == 39\nassert sum_digit_pow(34369) == 25\nassert sum_digit_pow(123791) == 23\nassert sum_digit_pow(81166) == 22\nassert sum_digit_pow(562228) == 25\nassert sum_digit_pow(252804) == 21\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 92", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 92\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 92.\nللتوضيح: الاستدعاء `sum_digit_pow(44615)` يُرجع `20`.\nالجواب:", "qhash": "217b169c30631b90"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 127\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 = 127\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": "1cbc78fec3d050dd", "answer": "46", "completion": " الناتج:\n```text\n46\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 55:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([16, 4, 29, 1, 6, 25, 31]) == [16, 20, 49, 50, 0, 25, 0]", "assert acc_reset([6]) == [6]", "assert acc_reset([15, 18]) == [15, 33]", "assert acc_reset([24, 39, 23, -4, 44, -6]) == [24, 0, 23, 19, 0, -6]", "assert acc_reset([17, 50, 40, 9, -7, 55, 41, 1]) == [17, 0, 40, 49, 42, 0, 41, 42]", "assert acc_reset([52, 44]) == [52, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([16, 4, 29, 1, 6, 25, 31]) == [16, 20, 49, 50, 0, 25, 0]\nassert acc_reset([6]) == [6]\nassert acc_reset([15, 18]) == [15, 33]\nassert acc_reset([24, 39, 23, -4, 44, -6]) == [24, 0, 23, 19, 0, -6]\nassert acc_reset([17, 50, 40, 9, -7, 55, 41, 1]) == [17, 0, 40, 49, 42, 0, 41, 42]\nassert acc_reset([52, 44]) == [52, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 55:\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 > 55:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 55 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([16, 4, 29, 1, 6, 25, 31])` يُرجع `[16, 20, 49, 50, 0, 25, 0]`.\nالجواب:", "qhash": "936fae5bad55152e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'brain_data'\nprint(word.count('d'))\nprint(word.capitalize())\nprint(word.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'brain_data'\nprint(word.count('d'))\nprint(word.capitalize())\nprint(word.upper())\n```\nالجواب:", "qhash": "ad0709fe81805863", "answer": "1\nBrain_data\nBRAIN_DATA", "completion": " الناتج:\n```text\n1\nBrain_data\nBRAIN_DATA\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "tests": ["assert sum_powers(3) == 54", "assert sum_powers(0) == 0", "assert sum_powers(15) == 1080", "assert sum_powers(11) == 594", "assert sum_powers(8) == 324", "assert sum_powers(1) == 9", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 54\nassert sum_powers(0) == 0\nassert sum_powers(15) == 1080\nassert sum_powers(11) == 594\nassert sum_powers(8) == 324\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 ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 1\n return total\n```\nمثال: `sum_powers(3)` يجب أن تُرجع `54`.\nالجواب:", "qhash": "429337d86046e182"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(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 largest_div([0, 32, 6, -20, -29, -17, 20, 1, -25]) == 32", "assert largest_div([-4, -12, -8]) == -4", "assert largest_div([1]) == None", "assert largest_div([36]) == 36", "assert largest_div([47, -27, -44, 20, 48, 30, -47]) == 48", "assert largest_div([]) == None"], "test_code": "assert largest_div([0, 32, 6, -20, -29, -17, 20, 1, -25]) == 32\nassert largest_div([-4, -12, -8]) == -4\nassert largest_div([1]) == None\nassert largest_div([36]) == 36\nassert largest_div([47, -27, -44, 20, 48, 30, -47]) == 48\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(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 largest_div(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مثال: `largest_div([0, 32, 6, -20, -29, -17, 20, 1, -25])` يجب أن تُرجع `32`.\nالجواب:", "qhash": "82fdfb3d10ce20ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(-3))\nprint(h(-3, 10))\nprint(h(h(10), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(h(-3))\nprint(h(-3, 10))\nprint(h(h(10), -3))\n```\nالجواب:", "qhash": "16ea4dbfc4b89467", "answer": "-8\n-13\n-12", "completion": " الناتج:\n```text\n-8\n-13\n-12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 15\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 = 15\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": "60d59c8bd733c671", "answer": "17", "completion": " الناتج:\n```text\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('نور', 61), ('مريم', 88), ('سلمى', 78), ('عمر', 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 = [('نور', 61), ('مريم', 88), ('سلمى', 78), ('عمر', 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": "6ff8fedddbf1406a", "answer": "[('نور', 61), ('سلمى', 78), ('عمر', 78), ('مريم', 88)]\n['مريم', 'سلمى']", "completion": " الناتج:\n```text\n[('نور', 61), ('سلمى', 78), ('عمر', 78), ('مريم', 88)]\n['مريم', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 8 * x ** 2 + (4) * x + (-2)", "tests": ["assert evaluate(8) == 542", "assert evaluate(-10) == 758", "assert evaluate(14) == 1622", "assert evaluate(6) == 310", "assert evaluate(-7) == 362", "assert evaluate(-12) == 1102", "assert evaluate(8) == 542", "assert evaluate(0) == -2"], "test_code": "assert evaluate(8) == 542\nassert evaluate(-10) == 758\nassert evaluate(14) == 1622\nassert evaluate(6) == 310\nassert evaluate(-7) == 362\nassert evaluate(-12) == 1102\nassert evaluate(8) == 542\nassert evaluate(0) == -2", "answer": "def evaluate(x):\n return 8 * x ** 2 + (4) * x + (-2)", "completion": " ```python\ndef evaluate(x):\n return 8 * x ** 2 + (4) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 8x² + 4x - 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(8)` يُرجع `542`.\nالجواب:", "qhash": "d5ff7a02dc23311b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([36, 32, 35]) == [35, 36, 32]", "assert spin([38, 16, -4, 40, 10, 26, 28, 7, 36]) == [36, 38, 16, -4, 40, 10, 26, 28, 7]", "assert spin([50, 33, 5]) == [5, 50, 33]", "assert spin([26, 9, 42, 20]) == [9, 42, 20, 26]", "assert spin([33, 18, 38, 31, 19, 16]) == [16, 33, 18, 38, 31, 19]", "assert spin([29, -7, 10, -2, 44, -3, 44, 32, -9]) == [-9, 29, -7, 10, -2, 44, -3, 44, 32]", "assert spin([]) == []"], "test_code": "assert spin([36, 32, 35]) == [35, 36, 32]\nassert spin([38, 16, -4, 40, 10, 26, 28, 7, 36]) == [36, 38, 16, -4, 40, 10, 26, 28, 7]\nassert spin([50, 33, 5]) == [5, 50, 33]\nassert spin([26, 9, 42, 20]) == [9, 42, 20, 26]\nassert spin([33, 18, 38, 31, 19, 16]) == [16, 33, 18, 38, 31, 19]\nassert spin([29, -7, 10, -2, 44, -3, 44, 32, -9]) == [-9, 29, -7, 10, -2, 44, -3, 44, 32]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return ____\n```\nمثال: `spin([36, 32, 35])` يجب أن تُرجع `[35, 36, 32]`.\nالجواب:", "qhash": "df0b69205ad852ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(-4, 8))", "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(-4, 8))\n```\nالجواب:", "qhash": "e7a9328cf5ce7030", "answer": "65536", "completion": " الناتج:\n```text\n65536\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'مطر صحراء'\nprint(kalima[0])\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'مطر صحراء'\nprint(kalima[0])\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ا'))\n```\nالجواب:", "qhash": "41fd8d936d9b6c4c", "answer": "م\n8\n1", "completion": " الناتج:\n```text\nم\n8\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [-3, 33, 16, 34, 20, 38]\nprint(items[0:6])\nprint(items[::-2])\nprint(len(items[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [-3, 33, 16, 34, 20, 38]\nprint(items[0:6])\nprint(items[::-2])\nprint(len(items[0:6]))\n```\nالجواب:", "qhash": "077e52e399ccb18b", "answer": "[-3, 33, 16, 34, 20, 38]\n[38, 34, 33]\n6", "completion": " الناتج:\n```text\n[-3, 33, 16, 34, 20, 38]\n[38, 34, 33]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_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 max_div([-8, -5, 27, 18]) == None", "assert max_div([-22, -11, -44]) == -11", "assert max_div([1, 12, 23]) == None", "assert max_div([22, -18, 3, 26, -12, -25]) == 22", "assert max_div([-37, -10, 3]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([-8, -5, 27, 18]) == None\nassert max_div([-22, -11, -44]) == -11\nassert max_div([1, 12, 23]) == None\nassert max_div([22, -18, 3, 26, -12, -25]) == 22\nassert max_div([-37, -10, 3]) == None\nassert max_div([]) == None", "answer": "def max_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 max_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 max_div(nums):\n best = 0\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 max_div(nums):\n best = 0\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للتوضيح: الاستدعاء `max_div([-8, -5, 27, 18])` يُرجع `None`.\nالجواب:", "qhash": "286631c9234712e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(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 tally_div([51, 23, 89, 6, 18, 15, 1, 85, 25, 83, 49]) == 1", "assert tally_div([13, 11, 54, 89, 35, 15, 62, 26, 41]) == 1", "assert tally_div([64, -28]) == 1", "assert tally_div([63, -39]) == 0", "assert tally_div([2, -2, 75, 84, -19, 38, 58, -30]) == 0", "assert tally_div([54, 9]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([51, 23, 89, 6, 18, 15, 1, 85, 25, 83, 49]) == 1\nassert tally_div([13, 11, 54, 89, 35, 15, 62, 26, 41]) == 1\nassert tally_div([64, -28]) == 1\nassert tally_div([63, -39]) == 0\nassert tally_div([2, -2, 75, 84, -19, 38, 58, -30]) == 0\nassert tally_div([54, 9]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `tally_div([51, 23, 89, 6, 18, 15, 1, 85, 25, 83, 49])` يُرجع `1`.\nالجواب:", "qhash": "bac58ff3465c5dae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('engine') == 'irkmri'", "assert shift_text('light up in cloud') == 'pmklx yt mr gpsyh'", "assert shift_text('garden code coffee') == 'kevhir gshi gsjjii'", "assert shift_text('by light matrix winter') == 'fc pmklx qexvmb amrxiv'", "assert shift_text('winter banana') == 'amrxiv ferere'", "assert shift_text('stone on python') == 'wxsri sr tcxlsr'", "assert shift_text('') == ''"], "test_code": "assert shift_text('engine') == 'irkmri'\nassert shift_text('light up in cloud') == 'pmklx yt mr gpsyh'\nassert shift_text('garden code coffee') == 'kevhir gshi gsjjii'\nassert shift_text('by light matrix winter') == 'fc pmklx qexvmb amrxiv'\nassert shift_text('winter banana') == 'amrxiv ferere'\nassert shift_text('stone on python') == 'wxsri sr tcxlsr'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('engine')` يجب أن تُرجع `'irkmri'`.\nالجواب:", "qhash": "8dc4174c9c68ced4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'باب مدرسة'\nprint('د' in text)\nprint(text.split())\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'باب مدرسة'\nprint('د' in text)\nprint(text.split())\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "1437869b619ce8ff", "answer": "True\n['باب', 'مدرسة']\n8", "completion": " الناتج:\n```text\nTrue\n['باب', 'مدرسة']\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(23) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8', '9', 'Hi', '11', '12', '13', 'Yo', 'Hi', '16', '17', '18', '19', 'Hi', 'Yo', '22', '23']", "assert label_numbers(7) == ['1', '2', '3', '4', 'Hi', '6', 'Yo']", "assert label_numbers(6) == ['1', '2', '3', '4', 'Hi', '6']", "assert label_numbers(8) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8']", "assert label_numbers(23) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8', '9', 'Hi', '11', '12', '13', 'Yo', 'Hi', '16', '17', '18', '19', 'Hi', 'Yo', '22', '23']"], "test_code": "assert label_numbers(23) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8', '9', 'Hi', '11', '12', '13', 'Yo', 'Hi', '16', '17', '18', '19', 'Hi', 'Yo', '22', '23']\nassert label_numbers(7) == ['1', '2', '3', '4', 'Hi', '6', 'Yo']\nassert label_numbers(6) == ['1', '2', '3', '4', 'Hi', '6']\nassert label_numbers(8) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8']\nassert label_numbers(23) == ['1', '2', '3', '4', 'Hi', '6', 'Yo', '8', '9', 'Hi', '11', '12', '13', 'Yo', 'Hi', '16', '17', '18', '19', 'Hi', 'Yo', '22', '23']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Hi'، وإن قَبِلها على 7 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(23)` يُرجع `['1', '2', '3', '4', 'Hi', '6', 'Yo', '8', '9', 'Hi', '11', '12', '13', 'Yo', 'Hi', '16', '17', '18', '19', 'Hi', 'Yo', '22', '23']`.\nالجواب:", "qhash": "8e5f133de8252ad8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 9) // 2 for x in range(-5, 9) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 9) // 2 for x in range(-5, 9) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "785f2a79228befb5", "answer": "[2, 3, 4, 5, 6, 7, 8]\n7 35", "completion": " الناتج:\n```text\n[2, 3, 4, 5, 6, 7, 8]\n7 35\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "tests": ["assert letter_stats('matrix vector') == {'m': 1, 'r': 2}", "assert letter_stats('up on desert code engine of') == {'m': 0, 'r': 1}", "assert letter_stats('apple falcon vector on') == {'m': 0, 'r': 1}", "assert letter_stats('go we desert a code at') == {'m': 0, 'r': 1}", "assert letter_stats('an garden') == {'m': 0, 'r': 1}", "assert letter_stats('signal falcon') == {'m': 0, 'r': 0}", "assert letter_stats('') == {'m': 0, 'r': 0}"], "test_code": "assert letter_stats('matrix vector') == {'m': 1, 'r': 2}\nassert letter_stats('up on desert code engine of') == {'m': 0, 'r': 1}\nassert letter_stats('apple falcon vector on') == {'m': 0, 'r': 1}\nassert letter_stats('go we desert a code at') == {'m': 0, 'r': 1}\nassert letter_stats('an garden') == {'m': 0, 'r': 1}\nassert letter_stats('signal falcon') == {'m': 0, 'r': 0}\nassert letter_stats('') == {'m': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'mr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'm'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('matrix vector')` يُرجع `{'m': 1, 'r': 2}`.\nالجواب:", "qhash": "ae5ed5c52a2c064d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 70", "tests": ["assert digit_power(15698) == 29", "assert digit_power(440020) == 10", "assert digit_power(968600) == 29", "assert digit_power(176704) == 25", "assert digit_power(863608) == 31", "assert digit_power(44847) == 27", "assert digit_power(583404) == 24", "assert digit_power(0) == 0"], "test_code": "assert digit_power(15698) == 29\nassert digit_power(440020) == 10\nassert digit_power(968600) == 29\nassert digit_power(176704) == 25\nassert digit_power(863608) == 31\nassert digit_power(44847) == 27\nassert digit_power(583404) == 24\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 70", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 70\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 70.\nللتوضيح: الاستدعاء `digit_power(15698)` يُرجع `29`.\nالجواب:", "qhash": "067332e9bff3da60"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 86) == 1)", "tests": ["assert coprime_count(131) == 64", "assert coprime_count(99) == 49", "assert coprime_count(127) == 63", "assert coprime_count(105) == 52", "assert coprime_count(142) == 69", "assert coprime_count(115) == 57", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(131) == 64\nassert coprime_count(99) == 49\nassert coprime_count(127) == 63\nassert coprime_count(105) == 52\nassert coprime_count(142) == 69\nassert coprime_count(115) == 57\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, 86) == 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, 86) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 86) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(131)` يُرجع `64`.\nالجواب:", "qhash": "cc94ee668cd7c6d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 4 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(5) == ['1', 'Foo', '3', 'FooBar', '5']", "assert label_numbers(14) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo']", "assert label_numbers(25) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo', '23', 'FooBar', '25']", "assert label_numbers(22) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo']", "assert label_numbers(14) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo']"], "test_code": "assert label_numbers(5) == ['1', 'Foo', '3', 'FooBar', '5']\nassert label_numbers(14) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo']\nassert label_numbers(25) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo', '23', 'FooBar', '25']\nassert label_numbers(22) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'FooBar', '21', 'Foo']\nassert label_numbers(14) == ['1', 'Foo', '3', 'FooBar', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'FooBar', '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 % 4 == 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 % 4 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Foo'، وإن قَبِلها على 4 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(5)` يُرجع `['1', 'Foo', '3', 'FooBar', '5']`.\nالجواب:", "qhash": "19928ec9f3911d7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 39) == 1)", "tests": ["assert coprime_count(145) == 89", "assert coprime_count(172) == 106", "assert coprime_count(181) == 112", "assert coprime_count(1) == 1", "assert coprime_count(48) == 30", "assert coprime_count(128) == 80", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(145) == 89\nassert coprime_count(172) == 106\nassert coprime_count(181) == 112\nassert coprime_count(1) == 1\nassert coprime_count(48) == 30\nassert coprime_count(128) == 80\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, 39) == 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, 39) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 39) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(145)` يُرجع `89`.\nالجواب:", "qhash": "d59a48cf45b6fed7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(text):\n count = 0\n for w in text.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('جبل برمجة همل خبز قلم برتقال طائرة') == 1", "assert begin_count('همل كتاب همل فجر') == 2", "assert begin_count('ماء معلم') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('نهر علم تفاحة همل قمر ميناء ليل') == 1\nassert begin_count('همل سلام سوق بحر جمل دفتر') == 1\nassert begin_count('مكتبة رمل') == 0\nassert begin_count('جبل برمجة همل خبز قلم برتقال طائرة') == 1\nassert begin_count('همل كتاب همل فجر') == 2\nassert begin_count('ماء معلم') == 0\nassert begin_count('') == 0", "answer": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ه'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(text):\n count = 0\n for w in text.split():\n if 'ه' in w:\n count += 1\n return count\n```\nمثال: `begin_count('نهر علم تفاحة همل قمر ميناء ليل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "9b32e3197f54fb63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'زينب': 19, 'هشام': 10, 'باسل': 28, 'سلمى': 49}\nd['زينب'] += 19\nd['أحمد'] = 0\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 18])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'زينب': 19, 'هشام': 10, 'باسل': 28, 'سلمى': 49}\nd['زينب'] += 19\nd['أحمد'] = 0\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 18])\n```\nالجواب:", "qhash": "77420006e88a7c8d", "answer": "5\nسلمى\n125\n['زينب', 'باسل', 'سلمى']", "completion": " الناتج:\n```text\n5\nسلمى\n125\n['زينب', 'باسل', 'سلمى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 93", "tests": ["assert digits_mod(50793) == 89", "assert digits_mod(216973) == 33", "assert digits_mod(232491) == 49", "assert digits_mod(264475) == 14", "assert digits_mod(664957) == 66", "assert digits_mod(271428) == 90", "assert digits_mod(735025) == 28", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(50793) == 89\nassert digits_mod(216973) == 33\nassert digits_mod(232491) == 49\nassert digits_mod(264475) == 14\nassert digits_mod(664957) == 66\nassert digits_mod(271428) == 90\nassert digits_mod(735025) == 28\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 93", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 93\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 93.\nللتوضيح: الاستدعاء `digits_mod(50793)` يُرجع `89`.\nالجواب:", "qhash": "54fa18c8d46a835d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'stone'\nprint(s.index('s') + len(s))\nprint(s.find('s'))\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'stone'\nprint(s.index('s') + len(s))\nprint(s.find('s'))\nprint(s.split('_'))\n```\nالجواب:", "qhash": "2441f720fb03229e", "answer": "5\n0\n['stone']", "completion": " الناتج:\n```text\n5\n0\n['stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert series(4) == 6500", "assert series(15) == 11496000", "assert series(14) == 7699125", "assert series(0) == 0", "assert series(1) == 5", "assert series(1) == 5", "assert series(0) == 0"], "test_code": "assert series(4) == 6500\nassert series(15) == 11496000\nassert series(14) == 7699125\nassert series(0) == 0\nassert series(1) == 5\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 ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 5\n return total\n```\nمثال: `series(4)` يجب أن تُرجع `6500`.\nالجواب:", "qhash": "44dde66f60a59474"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'aegl'}", "tests": ["assert count_chars('data planet to light winter an') == {'a': 4, 'e': 2, 'g': 1, 'l': 2}", "assert count_chars('desert light') == {'a': 0, 'e': 2, 'g': 1, 'l': 1}", "assert count_chars('orange falcon data by go vector') == {'a': 4, 'e': 2, 'g': 2, 'l': 1}", "assert count_chars('of banana banana code engine desert') == {'a': 6, 'e': 5, 'g': 1, 'l': 0}", "assert count_chars('garden brain table') == {'a': 3, 'e': 2, 'g': 1, 'l': 1}", "assert count_chars('rocket cloud summer window') == {'a': 0, 'e': 2, 'g': 0, 'l': 1}", "assert count_chars('') == {'a': 0, 'e': 0, 'g': 0, 'l': 0}"], "test_code": "assert count_chars('data planet to light winter an') == {'a': 4, 'e': 2, 'g': 1, 'l': 2}\nassert count_chars('desert light') == {'a': 0, 'e': 2, 'g': 1, 'l': 1}\nassert count_chars('orange falcon data by go vector') == {'a': 4, 'e': 2, 'g': 2, 'l': 1}\nassert count_chars('of banana banana code engine desert') == {'a': 6, 'e': 5, 'g': 1, 'l': 0}\nassert count_chars('garden brain table') == {'a': 3, 'e': 2, 'g': 1, 'l': 1}\nassert count_chars('rocket cloud summer window') == {'a': 0, 'e': 2, 'g': 0, 'l': 1}\nassert count_chars('') == {'a': 0, 'e': 0, 'g': 0, 'l': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'aegl'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'aegl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'e'، 'g'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('data planet to light winter an')` يُرجع `{'a': 4, 'e': 2, 'g': 1, 'l': 2}`.\nالجواب:", "qhash": "dc5b8099d36f4f1e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('is data it winter planet') == 'yi tqjq yj mydjuh fbqduj'", "assert shift_text('a up stone a table') == 'q kf ijedu q jqrbu'", "assert shift_text('banana engine on 2024') == 'rqdqdq udwydu ed 2024'", "assert shift_text('table garden') == 'jqrbu wqhtud'", "assert shift_text('desert an code') == 'tuiuhj qd setu'", "assert shift_text('garden of summer light A1') == 'wqhtud ev ikccuh bywxj A1'", "assert shift_text('') == ''"], "test_code": "assert shift_text('is data it winter planet') == 'yi tqjq yj mydjuh fbqduj'\nassert shift_text('a up stone a table') == 'q kf ijedu q jqrbu'\nassert shift_text('banana engine on 2024') == 'rqdqdq udwydu ed 2024'\nassert shift_text('table garden') == 'jqrbu wqhtud'\nassert shift_text('desert an code') == 'tuiuhj qd setu'\nassert shift_text('garden of summer light A1') == 'wqhtud ev ikccuh bywxj A1'\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 + (-10)) % 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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('is data it winter planet')` يجب أن تُرجع `'yi tqjq yj mydjuh fbqduj'`.\nالجواب:", "qhash": "c330de4eb8356b95"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'رنا': 12, 'باسل': 44, 'هدى': 27}\nd['رنا'] += 2\nd['نور'] = 32\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 30])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'رنا': 12, 'باسل': 44, 'هدى': 27}\nd['رنا'] += 2\nd['نور'] = 32\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 30])\n```\nالجواب:", "qhash": "8500e6d207ef3b40", "answer": "4\nباسل\n117\n['باسل', 'نور']", "completion": " الناتج:\n```text\n4\nباسل\n117\n['باسل', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حصان فجر دفتر') == 0", "assert prefix_hits('مدينة مدرسة طالب') == 2", "assert prefix_hits('معلم ماء حاسوب') == 2", "assert prefix_hits('شجرة كتاب سلام سماء ميناء بيت') == 1", "assert prefix_hits('معلم شجرة سيارة بحر قهوة عربية') == 1", "assert prefix_hits('برمجة معلم طائرة ميناء طائرة مكتبة') == 3", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حصان فجر دفتر') == 0\nassert prefix_hits('مدينة مدرسة طالب') == 2\nassert prefix_hits('معلم ماء حاسوب') == 2\nassert prefix_hits('شجرة كتاب سلام سماء ميناء بيت') == 1\nassert prefix_hits('معلم شجرة سيارة بحر قهوة عربية') == 1\nassert prefix_hits('برمجة معلم طائرة ميناء طائرة مكتبة') == 3\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('حصان فجر دفتر')` يُرجع `0`.\nالجواب:", "qhash": "45049b817f1b53a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ي')", "tests": ["assert count_letter('تفاحة حاسوب شمس بيت نهر') == 1", "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"], "test_code": "assert count_letter('تفاحة حاسوب شمس بيت نهر') == 1\nassert 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", "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)` بحيث تُعيد عدد مرات ظهور الحرف «ي» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('تفاحة حاسوب شمس بيت نهر')` يُرجع `1`.\nالجواب:", "qhash": "1a6595dae5520c31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('at brain rocket desert') == 'pi qgpxc gdrzti sthtgi'", "assert rotate_letters('rocket 2024') == 'gdrzti 2024'", "assert rotate_letters('up table it up coffee') == 'je ipqat xi je rduutt'", "assert rotate_letters('banana vector summer an A1') == 'qpcpcp ktridg hjbbtg pc A1'", "assert rotate_letters('brain cloud an orange table OK') == 'qgpxc radjs pc dgpcvt ipqat OK'", "assert rotate_letters('camel by') == 'rpbta qn'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('at brain rocket desert') == 'pi qgpxc gdrzti sthtgi'\nassert rotate_letters('rocket 2024') == 'gdrzti 2024'\nassert rotate_letters('up table it up coffee') == 'je ipqat xi je rduutt'\nassert rotate_letters('banana vector summer an A1') == 'qpcpcp ktridg hjbbtg pc A1'\nassert rotate_letters('brain cloud an orange table OK') == 'qgpxc radjs pc dgpcvt ipqat OK'\nassert rotate_letters('camel by') == 'rpbta qn'\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 + (15)) % 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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('at brain rocket desert')` يُرجع `'pi qgpxc gdrzti sthtgi'`.\nالجواب:", "qhash": "313a8ffd251dfca0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ن' in w)", "tests": ["assert count_ar('سماء عمل صديق عمل') == 0", "assert count_ar('باب برتقال ليل صديق جبل لغة') == 0", "assert count_ar('ميناء صحراء صحراء طالب مكتبة برتقال') == 1", "assert count_ar('نهار شمس') == 1", "assert count_ar('سيارة حاسوب صحراء') == 0", "assert count_ar('قلم رمل') == 0", "assert count_ar('ميناء شمس بيت برتقال بيت برمجة') == 1", "assert count_ar('') == 0"], "test_code": "assert count_ar('سماء عمل صديق عمل') == 0\nassert count_ar('باب برتقال ليل صديق جبل لغة') == 0\nassert count_ar('ميناء صحراء صحراء طالب مكتبة برتقال') == 1\nassert count_ar('نهار شمس') == 1\nassert count_ar('سيارة حاسوب صحراء') == 0\nassert count_ar('قلم رمل') == 0\nassert count_ar('ميناء شمس بيت برتقال بيت برمجة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ن» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('سماء عمل صديق عمل')` يُرجع `0`.\nالجواب:", "qhash": "c68bfe47c2387962"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'summer_stone'\nprint(s.split('_'))\nprint(s.replace('s', 'X'))\nprint(s[3:6])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'summer_stone'\nprint(s.split('_'))\nprint(s.replace('s', 'X'))\nprint(s[3:6])\n```\nالجواب:", "qhash": "f4d6bb16ec4fe980", "answer": "['summer', 'stone']\nXummer_Xtone\nmer", "completion": " الناتج:\n```text\n['summer', 'stone']\nXummer_Xtone\nmer\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'falcon_data'\nprint(s[-3:])\nprint(s.capitalize())\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'falcon_data'\nprint(s[-3:])\nprint(s.capitalize())\nprint(s.split('_'))\n```\nالجواب:", "qhash": "a0bc48a19de544ac", "answer": "ata\nFalcon_data\n['falcon', 'data']", "completion": " الناتج:\n```text\nata\nFalcon_data\n['falcon', 'data']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'راشد': 7, 'سلمى': 9, 'حسن': 19, 'ليلى': 25, 'منى': 28}\nd['راشد'] += 18\nd['عمر'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'راشد': 7, 'سلمى': 9, 'حسن': 19, 'ليلى': 25, 'منى': 28}\nd['راشد'] += 18\nd['عمر'] = 33\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))\n```\nالجواب:", "qhash": "94a9de92bdd28214", "answer": "6\nعمر\n139\n-1", "completion": " الناتج:\n```text\n6\nعمر\n139\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('summer engine brain') == 'kmeewj wfyafw tjsaf'", "assert rotate_letters('rocket winter up engine a') == 'jgucwl oaflwj mh wfyafw s'", "assert rotate_letters('it table table summer !') == 'al lstdw lstdw kmeewj !'", "assert rotate_letters('garden up Hello') == 'ysjvwf mh Hwddg'", "assert rotate_letters('window light OK') == 'oafvgo dayzl OK'", "assert rotate_letters('code a vector desert') == 'ugvw s nwulgj vwkwjl'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('summer engine brain') == 'kmeewj wfyafw tjsaf'\nassert rotate_letters('rocket winter up engine a') == 'jgucwl oaflwj mh wfyafw s'\nassert rotate_letters('it table table summer !') == 'al lstdw lstdw kmeewj !'\nassert rotate_letters('garden up Hello') == 'ysjvwf mh Hwddg'\nassert rotate_letters('window light OK') == 'oafvgo dayzl OK'\nassert rotate_letters('code a vector desert') == 'ugvw s nwulgj vwkwjl'\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 + (18)) % 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 + (18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('summer engine brain')` يُرجع `'kmeewj wfyafw tjsaf'`.\nالجواب:", "qhash": "25325d30668e591b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [28, 8, 26, 34, -7, -9, -18]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [28, 8, 26, 34, -7, -9, -18]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "0f2940ca0959e81c", "answer": "[-7, -9, 8, -18, 26, 28, 34]\n[34, 28, 26]", "completion": " الناتج:\n```text\n[-7, -9, 8, -18, 26, 28, 34]\n[34, 28, 26]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(9))\nprint(h(9, 1))\nprint(h(h(1), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=2):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(9))\nprint(h(9, 1))\nprint(h(h(1), 9))\n```\nالجواب:", "qhash": "084c173de8901559", "answer": "7\n8\n12", "completion": " الناتج:\n```text\n7\n8\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "tests": ["assert rec_prod(4) == 4", "assert rec_prod(60) == 4", "assert rec_prod(21) == 41", "assert rec_prod(12) == 56", "assert rec_prod(13) == 41", "assert rec_prod(33) == 2", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(4) == 4\nassert rec_prod(60) == 4\nassert rec_prod(21) == 41\nassert rec_prod(12) == 56\nassert rec_prod(13) == 41\nassert rec_prod(33) == 2\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(4)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "cfc8d6c9615a5849"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 84) == 1)", "tests": ["assert count_gcd1(64) == 18", "assert count_gcd1(25) == 8", "assert count_gcd1(54) == 15", "assert count_gcd1(129) == 37", "assert count_gcd1(31) == 10", "assert count_gcd1(192) == 55", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(64) == 18\nassert count_gcd1(25) == 8\nassert count_gcd1(54) == 15\nassert count_gcd1(129) == 37\nassert count_gcd1(31) == 10\nassert count_gcd1(192) == 55\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, 84) == 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, 84) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 84، أي أن القاسم المشترك الأكبر لها مع 84 يساوي 1.\nمثال: `count_gcd1(64)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "b70574ff228faf87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'فيصل': 29, 'نور': 28, 'يوسف': 50}\nscores['يوسف'] += 10\nscores['راشد'] = 57\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 39])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'فيصل': 29, 'نور': 28, 'يوسف': 50}\nscores['يوسف'] += 10\nscores['راشد'] = 57\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 39])\n```\nالجواب:", "qhash": "25ab42a9160331ec", "answer": "4\nيوسف\n174\n['يوسف', 'راشد']", "completion": " الناتج:\n```text\n4\nيوسف\n174\n['يوسف', 'راشد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 0\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(10))\n```\nالجواب:", "qhash": "6ffb92b59517c7cb", "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#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 97", "tests": ["assert sum_digit_pow(7976) == 49", "assert sum_digit_pow(341968) == 69", "assert sum_digit_pow(446997) == 65", "assert sum_digit_pow(102200) == 33", "assert sum_digit_pow(664028) == 73", "assert sum_digit_pow(479383) == 90", "assert sum_digit_pow(244255) == 48", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(7976) == 49\nassert sum_digit_pow(341968) == 69\nassert sum_digit_pow(446997) == 65\nassert sum_digit_pow(102200) == 33\nassert sum_digit_pow(664028) == 73\nassert sum_digit_pow(479383) == 90\nassert sum_digit_pow(244255) == 48\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 97", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 97.\nللتوضيح: الاستدعاء `sum_digit_pow(7976)` يُرجع `49`.\nالجواب:", "qhash": "f65b7b0f259d4d1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([44, 2, 16, -13, 31]) == 44", "assert best_multiple([-4, -4, -10]) == -4", "assert best_multiple([1]) == None", "assert best_multiple([-7, 21]) == None", "assert best_multiple([-32, -21, -32, -50, -32, -18]) == -18", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([44, 2, 16, -13, 31]) == 44\nassert best_multiple([-4, -4, -10]) == -4\nassert best_multiple([1]) == None\nassert best_multiple([-7, 21]) == None\nassert best_multiple([-32, -21, -32, -50, -32, -18]) == -18\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([44, 2, 16, -13, 31])` يجب أن تُرجع `44`.\nالجواب:", "qhash": "66d9699e15dedee4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'برمجة معلم'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'برمجة معلم'\nprint(len(s))\nprint(s.replace(' ', '-'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "86f8e85c6f4f5461", "answer": "10\nبرمجة-معلم\nملعم ةجمرب", "completion": " الناتج:\n```text\n10\nبرمجة-معلم\nملعم ةجمرب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 0\nfor i in range(10, 22, 2):\n result -= i * 8\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 0\nfor i in range(10, 22, 2):\n result -= i * 8\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "344707f60770059f", "answer": "-720\n20", "completion": " الناتج:\n```text\n-720\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=3):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(7))\nprint(h(7, 13))\nprint(h(h(13), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=3):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(7))\nprint(h(7, 13))\nprint(h(h(13), 7))\n```\nالجواب:", "qhash": "8dfa1431ee565691", "answer": "53\n111\n801", "completion": " الناتج:\n```text\n53\n111\n801\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_list([11, 22, 1]) == [22, 1, 11]", "assert rotate_list([45, 13, 16, 11, 43]) == [13, 16, 11, 43, 45]", "assert rotate_list([24, 28, 30, 23, 11, 15, -5, 11, 21, 15, 32]) == [15, -5, 11, 21, 15, 32, 24, 28, 30, 23, 11]", "assert rotate_list([41]) == [41]", "assert rotate_list([38, -4, 48, -5, 3, 3, 45]) == [48, -5, 3, 3, 45, 38, -4]", "assert rotate_list([-2]) == [-2]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([11, 22, 1]) == [22, 1, 11]\nassert rotate_list([45, 13, 16, 11, 43]) == [13, 16, 11, 43, 45]\nassert rotate_list([24, 28, 30, 23, 11, 15, -5, 11, 21, 15, 32]) == [15, -5, 11, 21, 15, 32, 24, 28, 30, 23, 11]\nassert rotate_list([41]) == [41]\nassert rotate_list([38, -4, 48, -5, 3, 3, 45]) == [48, -5, 3, 3, 45, 38, -4]\nassert rotate_list([-2]) == [-2]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nمثال: `rotate_list([11, 22, 1])` يجب أن تُرجع `[22, 1, 11]`.\nالجواب:", "qhash": "ffa2b3b6b3230f78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']", "assert label_numbers(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']", "assert label_numbers(12) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12']", "assert label_numbers(6) == ['1', '2', '3', '4', '5', '6']", "assert label_numbers(3) == ['1', '2', '3']"], "test_code": "assert label_numbers(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']\nassert label_numbers(19) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']\nassert label_numbers(12) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12']\nassert label_numbers(6) == ['1', '2', '3', '4', '5', '6']\nassert label_numbers(3) == ['1', '2', '3']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Foo'، وإن قَبِلها على 9 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(19)` يُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19']`.\nالجواب:", "qhash": "38cf62c098721063"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 22", "tests": ["assert pow_digits(19479) == 18", "assert pow_digits(256907) == 13", "assert pow_digits(821048) == 19", "assert pow_digits(773889) == 2", "assert pow_digits(683401) == 6", "assert pow_digits(295054) == 17", "assert pow_digits(137448) == 21", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(19479) == 18\nassert pow_digits(256907) == 13\nassert pow_digits(821048) == 19\nassert pow_digits(773889) == 2\nassert pow_digits(683401) == 6\nassert pow_digits(295054) == 17\nassert pow_digits(137448) == 21\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 22", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 22.\nمثال: `pow_digits(19479)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "61bad3d097a16b5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([28, 43, 49, 58, 41, 31, 53]) == 28", "assert find_max_div([-12, -4, -8]) == -4", "assert find_max_div([1, 5]) == None", "assert find_max_div([]) == None", "assert find_max_div([0, -5, -38, -44, -7]) == 0", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([28, 43, 49, 58, 41, 31, 53]) == 28\nassert find_max_div([-12, -4, -8]) == -4\nassert find_max_div([1, 5]) == None\nassert find_max_div([]) == None\nassert find_max_div([0, -5, -38, -44, -7]) == 0\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `find_max_div([28, 43, 49, 58, 41, 31, 53])` يجب أن تُرجع `28`.\nالجواب:", "qhash": "c8f548c6dd74c9ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 116:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([5, 57, 62, 4, 46, 1, 9]) == [5, 62, 0, 4, 50, 51, 60]", "assert capped_cumsum([66, 19]) == [66, 85]", "assert capped_cumsum([27, 20, 104, 28, 50, 24, 5]) == [27, 47, 0, 28, 78, 102, 107]", "assert capped_cumsum([111, 0, 46, 74, 51, 59, 29]) == [111, 111, 0, 74, 0, 59, 88]", "assert capped_cumsum([97, -2, 34, 107]) == [97, 95, 0, 107]", "assert capped_cumsum([109, 101, 7, 57]) == [109, 0, 7, 64]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([5, 57, 62, 4, 46, 1, 9]) == [5, 62, 0, 4, 50, 51, 60]\nassert capped_cumsum([66, 19]) == [66, 85]\nassert capped_cumsum([27, 20, 104, 28, 50, 24, 5]) == [27, 47, 0, 28, 78, 102, 107]\nassert capped_cumsum([111, 0, 46, 74, 51, 59, 29]) == [111, 111, 0, 74, 0, 59, 88]\nassert capped_cumsum([97, -2, 34, 107]) == [97, 95, 0, 107]\nassert capped_cumsum([109, 101, 7, 57]) == [109, 0, 7, 64]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 116:\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 > 116:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 116 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([5, 57, 62, 4, 46, 1, 9])` يُرجع `[5, 62, 0, 4, 50, 51, 60]`.\nالجواب:", "qhash": "30dad086cd023e38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 173:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([9, 44, 8, 26, 32, 46]) == [9, 53, 61, 87, 119, 165]", "assert reset_sum([112, 50, 121]) == [112, 162, 0]", "assert reset_sum([8, 104, 90, 58, 69, 123, 58, 75]) == [8, 112, 0, 58, 127, 0, 58, 133]", "assert reset_sum([169, 56, 151, 149, 172, 86, 132, 20, 121]) == [169, 0, 151, 0, 172, 0, 132, 152, 0]", "assert reset_sum([137]) == [137]", "assert reset_sum([72, 109]) == [72, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([9, 44, 8, 26, 32, 46]) == [9, 53, 61, 87, 119, 165]\nassert reset_sum([112, 50, 121]) == [112, 162, 0]\nassert reset_sum([8, 104, 90, 58, 69, 123, 58, 75]) == [8, 112, 0, 58, 127, 0, 58, 133]\nassert reset_sum([169, 56, 151, 149, 172, 86, 132, 20, 121]) == [169, 0, 151, 0, 172, 0, 132, 152, 0]\nassert reset_sum([137]) == [137]\nassert reset_sum([72, 109]) == [72, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 173:\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 > 173:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 173 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([9, 44, 8, 26, 32, 46])` يجب أن تُرجع `[9, 53, 61, 87, 119, 165]`.\nالجواب:", "qhash": "a3b13d9c3584f59a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 1 + 7 for x in range(-2, 9) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 1 + 7 for x in range(-2, 9) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ada9e3c07ed16880", "answer": "[7, 11, 15]\n3 33", "completion": " الناتج:\n```text\n[7, 11, 15]\n3 33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سماء صديق سيارة سلام يمل') == 1", "assert prefix_hits('شمس شجرة كتاب حصان') == 0", "assert prefix_hits('حصان وردة شجرة صحراء') == 0", "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('شمس شجرة كتاب حصان') == 0\nassert prefix_hits('حصان وردة شجرة صحراء') == 0\nassert prefix_hits('سماء علم يمل صحراء نهار باب تفاحة') == 1\nassert prefix_hits('حديقة عمل رمل جمل برتقال') == 0\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 'ي' in w:\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 'ي' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('سماء صديق سيارة سلام يمل')` يُرجع `1`.\nالجواب:", "qhash": "b7ce994366852511"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'os'}", "tests": ["assert freq_of('it falcon') == {'o': 1, 's': 0}", "assert freq_of('planet is coffee river planet cloud') == {'o': 2, 's': 1}", "assert freq_of('river coffee by orange') == {'o': 2, 's': 0}", "assert freq_of('an') == {'o': 0, 's': 0}", "assert freq_of('on window vector go') == {'o': 4, 's': 0}", "assert freq_of('up up rocket to table') == {'o': 2, 's': 0}", "assert freq_of('') == {'o': 0, 's': 0}"], "test_code": "assert freq_of('it falcon') == {'o': 1, 's': 0}\nassert freq_of('planet is coffee river planet cloud') == {'o': 2, 's': 1}\nassert freq_of('river coffee by orange') == {'o': 2, 's': 0}\nassert freq_of('an') == {'o': 0, 's': 0}\nassert freq_of('on window vector go') == {'o': 4, 's': 0}\nassert freq_of('up up rocket to table') == {'o': 2, 's': 0}\nassert freq_of('') == {'o': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'os'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'os'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'o'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('it falcon')` يجب أن تُرجع `{'o': 1, 's': 0}`.\nالجواب:", "qhash": "4714362ec5c720ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "tests": ["assert pow_total(7) == 319088", "assert pow_total(2) == 363", "assert pow_total(7) == 319088", "assert pow_total(10) == 2429075", "assert pow_total(0) == 0", "assert pow_total(1) == 11", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 319088\nassert pow_total(2) == 363\nassert pow_total(7) == 319088\nassert pow_total(10) == 2429075\nassert pow_total(0) == 0\nassert pow_total(1) == 11\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * 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 = 11 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × 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 = 11 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `pow_total(7)` يُرجع `319088`.\nالجواب:", "qhash": "7f3529b30cb18eec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=3):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(calc(-9))\nprint(calc(-9, -5))\nprint(calc(calc(-5), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=3):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(calc(-9))\nprint(calc(-9, -5))\nprint(calc(calc(-5), -9))\n```\nالجواب:", "qhash": "faba5a772e5b0c6e", "answer": "3\n-29\n37", "completion": " الناتج:\n```text\n3\n-29\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "tests": ["assert total_multiples(141) == 2310", "assert total_multiples(117) == 1542", "assert total_multiples(38) == 165", "assert total_multiples(176) == 3595", "assert total_multiples(203) == 4732", "assert total_multiples(212) == 5145", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(141) == 2310\nassert total_multiples(117) == 1542\nassert total_multiples(38) == 165\nassert total_multiples(176) == 3595\nassert total_multiples(203) == 4732\nassert total_multiples(212) == 5145\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 10.\nمثال: `total_multiples(141)` يجب أن تُرجع `2310`.\nالجواب:", "qhash": "2e7ebf06e40f70a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(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_div([29, 58, 38, 77, 24, 66]) == 0", "assert count_div([21, 75, 36, 45, -40, 41, 41]) == 1", "assert count_div([-34, 43]) == 0", "assert count_div([-19, 2, 1, 10, 22, 65, -9, -8, 52, -27, 87]) == 2", "assert count_div([80, -13, 75]) == 0", "assert count_div([-21, 21, -7, 41, 70, -23, 69, 53, 45, 5, 73, -36]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([29, 58, 38, 77, 24, 66]) == 0\nassert count_div([21, 75, 36, 45, -40, 41, 41]) == 1\nassert count_div([-34, 43]) == 0\nassert count_div([-19, 2, 1, 10, 22, 65, -9, -8, 52, -27, 87]) == 2\nassert count_div([80, -13, 75]) == 0\nassert count_div([-21, 21, -7, 41, 70, -23, 69, 53, 45, 5, 73, -36]) == 1\nassert count_div([]) == 0", "answer": "def count_div(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_div(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_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_div([29, 58, 38, 77, 24, 66])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ecae329e0199022f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(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 count_sel([5, 27, 87, 19, 87, 29, 25, 69, 80]) == 1", "assert count_sel([76, 49, 43, -16, 85]) == 2", "assert count_sel([-7, 69, 11]) == 0", "assert count_sel([-23, -24, 5, 81, -33, -25, 49, -17]) == 1", "assert count_sel([]) == 0", "assert count_sel([-40, 20, -12, 26, -30, 54, 37, 14, 14]) == 6", "assert count_sel([]) == 0"], "test_code": "assert count_sel([5, 27, 87, 19, 87, 29, 25, 69, 80]) == 1\nassert count_sel([76, 49, 43, -16, 85]) == 2\nassert count_sel([-7, 69, 11]) == 0\nassert count_sel([-23, -24, 5, 81, -33, -25, 49, -17]) == 1\nassert count_sel([]) == 0\nassert count_sel([-40, 20, -12, 26, -30, 54, 37, 14, 14]) == 6\nassert count_sel([]) == 0", "answer": "def count_sel(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 count_sel(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 count_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_sel([5, 27, 87, 19, 87, 29, 25, 69, 80])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "1fa2245998ecef8f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 3:\n return 3\n return 2 * f(n - 1) + 2\n\nprint(f(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 3:\n return 3\n return 2 * f(n - 1) + 2\n\nprint(f(11))\n```\nالجواب:", "qhash": "defac7578e62c9f9", "answer": "1278", "completion": " الناتج:\n```text\n1278\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -2 * x ** 2 + (-9) * x + (0)", "tests": ["assert p(8) == -200", "assert p(-15) == -315", "assert p(4) == -68", "assert p(3) == -45", "assert p(16) == -656", "assert p(-8) == -56", "assert p(7) == -161", "assert p(0) == 0"], "test_code": "assert p(8) == -200\nassert p(-15) == -315\nassert p(4) == -68\nassert p(3) == -45\nassert p(16) == -656\nassert p(-8) == -56\nassert p(7) == -161\nassert p(0) == 0", "answer": "def p(x):\n return -2 * x ** 2 + (-9) * x + (0)", "completion": " ```python\ndef p(x):\n return -2 * x ** 2 + (-9) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -2x² - 9x + 0 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(8)` يُرجع `-200`.\nالجواب:", "qhash": "d7eff492ede9736a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'خالد': 38, 'باسل': 13, 'حسن': 1}\nscores['باسل'] += 1\nscores['سعيد'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'خالد': 38, 'باسل': 13, 'حسن': 1}\nscores['باسل'] += 1\nscores['سعيد'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('يوسف', -1))\n```\nالجواب:", "qhash": "dc701d4231b5d840", "answer": "4\nخالد\n87\n-1", "completion": " الناتج:\n```text\n4\nخالد\n87\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "tests": ["assert power_sum(8) == 247104", "assert power_sum(10) == 883300", "assert power_sum(12) == 2522832", "assert power_sum(9) == 483300", "assert power_sum(15) == 9196800", "assert power_sum(1) == 4", "assert power_sum(0) == 0"], "test_code": "assert power_sum(8) == 247104\nassert power_sum(10) == 883300\nassert power_sum(12) == 2522832\nassert power_sum(9) == 483300\nassert power_sum(15) == 9196800\nassert power_sum(1) == 4\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * 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 = 4 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × 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 = 4 * i ** 5\n return total\n```\nمثال: `power_sum(8)` يجب أن تُرجع `247104`.\nالجواب:", "qhash": "0e17b17cb79cb2b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([14, -9, 5, 56, -21, -13]) == -9", "assert find_max_div([-27, -18, -9]) == -9", "assert find_max_div([1, 10]) == None", "assert find_max_div([]) == None", "assert find_max_div([30, 40, 50, -28, -36, 9, -32, -35]) == 9", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([14, -9, 5, 56, -21, -13]) == -9\nassert find_max_div([-27, -18, -9]) == -9\nassert find_max_div([1, 10]) == None\nassert find_max_div([]) == None\nassert find_max_div([30, 40, 50, -28, -36, 9, -32, -35]) == 9\nassert find_max_div([]) == None", "answer": "def find_max_div(values):\n best = None\n for x in values:\n if x % 9 == 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 % 9 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([14, -9, 5, 56, -21, -13])` يُرجع `-9`.\nالجواب:", "qhash": "482a91656f6d7769"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 38:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([9, 16, 16, 15, 22, 4, 7, 24, 18]) == [9, 25, 0, 15, 37, 0, 7, 31, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([24, -10, 29, 38, 15, 15, 33, 18]) == [24, 14, 0, 38, 0, 15, 0, 18]", "assert capped_cumsum([10, 14, 26, 35, -4, -1, 22, 13, 25, 17]) == [10, 24, 0, 35, 31, 30, 0, 13, 38, 0]", "assert capped_cumsum([25, 8, 21, 6, 24]) == [25, 33, 0, 6, 30]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([9, 16, 16, 15, 22, 4, 7, 24, 18]) == [9, 25, 0, 15, 37, 0, 7, 31, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([24, -10, 29, 38, 15, 15, 33, 18]) == [24, 14, 0, 38, 0, 15, 0, 18]\nassert capped_cumsum([10, 14, 26, 35, -4, -1, 22, 13, 25, 17]) == [10, 24, 0, 35, 31, 30, 0, 13, 38, 0]\nassert capped_cumsum([25, 8, 21, 6, 24]) == [25, 33, 0, 6, 30]\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 > 38:\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 > 38:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 38 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([9, 16, 16, 15, 22, 4, 7, 24, 18])` يجب أن تُرجع `[9, 25, 0, 15, 37, 0, 7, 31, 0]`.\nالجواب:", "qhash": "35b799315f83d048"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('سفينة معلم صحراء ماء')` يُرجع `0`.\nالجواب:", "qhash": "259241f16274f85a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'python_desert'\nprint(word[-3:])\nprint(word.upper())\nprint(word.find('y'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'python_desert'\nprint(word[-3:])\nprint(word.upper())\nprint(word.find('y'))\n```\nالجواب:", "qhash": "f8ec9c135c1fff80", "answer": "ert\nPYTHON_DESERT\n1", "completion": " الناتج:\n```text\nert\nPYTHON_DESERT\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('جبل وردة بيت لغة باب طائرة') == 0", "assert lead_count('ماء سفينة مكتبة سفينة قهوة سفينة') == 0", "assert lead_count('همل همل صحراء قلم علم حاسوب') == 2", "assert lead_count('مكتبة بيت همل عربية سلام بيت طائرة') == 1", "assert lead_count('ماء سماء قلم معلم') == 0", "assert lead_count('همل جبل قهوة همل') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('جبل وردة بيت لغة باب طائرة') == 0\nassert lead_count('ماء سفينة مكتبة سفينة قهوة سفينة') == 0\nassert lead_count('همل همل صحراء قلم علم حاسوب') == 2\nassert lead_count('مكتبة بيت همل عربية سلام بيت طائرة') == 1\nassert lead_count('ماء سماء قلم معلم') == 0\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('جبل وردة بيت لغة باب طائرة')` يُرجع `0`.\nالجواب:", "qhash": "30a482226d411f7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('سلمى', 2), ('هدى', 77), ('نور', 47), ('راشد', 0)]\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 = [('سلمى', 2), ('هدى', 77), ('نور', 47), ('راشد', 0)]\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": "e364581fa2b49012", "answer": "[('راشد', 0), ('سلمى', 2), ('نور', 47), ('هدى', 77)]\n['هدى', 'نور']", "completion": " الناتج:\n```text\n[('راشد', 0), ('سلمى', 2), ('نور', 47), ('هدى', 77)]\n['هدى', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "tests": ["assert total_multiples(244) == 14762", "assert total_multiples(266) == 17556", "assert total_multiples(208) == 10712", "assert total_multiples(25) == 156", "assert total_multiples(187) == 8742", "assert total_multiples(124) == 3782", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(244) == 14762\nassert total_multiples(266) == 17556\nassert total_multiples(208) == 10712\nassert total_multiples(25) == 156\nassert total_multiples(187) == 8742\nassert total_multiples(124) == 3782\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 % 8 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(244)` يُرجع `14762`.\nالجواب:", "qhash": "f4b21eaf2b56dc31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * 1 + -6 for x in range(3, 11) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * 1 + -6 for x in range(3, 11) if x % 3 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "65ca41727f2d11fd", "answer": "[-1, 2]\n2 1", "completion": " الناتج:\n```text\n[-1, 2]\n2 1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 7) // 2 for x in range(-6, 2) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 7) // 2 for x in range(-6, 2) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a1a037fcb0d0ed86", "answer": "[0, 1, 2, 3]\n4 6", "completion": " الناتج:\n```text\n[0, 1, 2, 3]\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'stone'\nprint(len(text))\nprint(text.index('t') + len(text))\nprint(text.count('t'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'stone'\nprint(len(text))\nprint(text.index('t') + len(text))\nprint(text.count('t'))\n```\nالجواب:", "qhash": "79f4b5857af494cf", "answer": "5\n6\n1", "completion": " الناتج:\n```text\n5\n6\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'rocket_python'\nprint(text.index('o') + len(text))\nprint(text.find('o'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'rocket_python'\nprint(text.index('o') + len(text))\nprint(text.find('o'))\nprint(len(text))\n```\nالجواب:", "qhash": "79806fc5b9fad27c", "answer": "14\n1\n13", "completion": " الناتج:\n```text\n14\n1\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -16 <= x <= 21)", "tests": ["assert filter_range([26, 21, 7, 14, -3, 9]) == [-9, 21, 27, 42, 63]", "assert filter_range([30]) == []", "assert filter_range([55]) == []", "assert filter_range([26, -25]) == []", "assert filter_range([40, 58, 59]) == []", "assert filter_range([16, 57, 34, 0, 47]) == [0, 48]", "assert filter_range([20, -12, 58, -21, 9, 43, -1]) == [-36, -3, 27, 60]", "assert filter_range([]) == []"], "test_code": "assert filter_range([26, 21, 7, 14, -3, 9]) == [-9, 21, 27, 42, 63]\nassert filter_range([30]) == []\nassert filter_range([55]) == []\nassert filter_range([26, -25]) == []\nassert filter_range([40, 58, 59]) == []\nassert filter_range([16, 57, 34, 0, 47]) == [0, 48]\nassert filter_range([20, -12, 58, -21, 9, 43, -1]) == [-36, -3, 27, 60]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -16 <= x <= 21)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if -16 <= x <= 21)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -16 ≤ x ≤ 21، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([26, 21, 7, 14, -3, 9])` يُرجع `[-9, 21, 27, 42, 63]`.\nالجواب:", "qhash": "e474a907174973e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('summer coffee by to orange') == 'vxpphu friihh eb wr rudqjh'", "assert shift_text('rocket python light') == 'urfnhw sbwkrq oljkw'", "assert shift_text('rocket') == 'urfnhw'", "assert shift_text('python engine') == 'sbwkrq hqjlqh'", "assert shift_text('table to of engine python') == 'wdeoh wr ri hqjlqh sbwkrq'", "assert shift_text('summer music coffee go winter A1') == 'vxpphu pxvlf friihh jr zlqwhu A1'", "assert shift_text('') == ''"], "test_code": "assert shift_text('summer coffee by to orange') == 'vxpphu friihh eb wr rudqjh'\nassert shift_text('rocket python light') == 'urfnhw sbwkrq oljkw'\nassert shift_text('rocket') == 'urfnhw'\nassert shift_text('python engine') == 'sbwkrq hqjlqh'\nassert shift_text('table to of engine python') == 'wdeoh wr ri hqjlqh sbwkrq'\nassert shift_text('summer music coffee go winter A1') == 'vxpphu pxvlf friihh jr zlqwhu A1'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('summer coffee by to orange')` يُرجع `'vxpphu friihh eb wr rudqjh'`.\nالجواب:", "qhash": "102f07a76d4ef410"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 4\nfor n in range(6, 28, 1):\n total -= n * 3\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 4\nfor n in range(6, 28, 1):\n total -= n * 3\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "4a78b5efd93ced46", "answer": "-1085\n27", "completion": " الناتج:\n```text\n-1085\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -5 * x ** 2 + (5) * x + (-8)", "tests": ["assert quad(1) == -8", "assert quad(10) == -458", "assert quad(2) == -18", "assert quad(-3) == -68", "assert quad(-20) == -2108", "assert quad(-5) == -158", "assert quad(8) == -288", "assert quad(0) == -8"], "test_code": "assert quad(1) == -8\nassert quad(10) == -458\nassert quad(2) == -18\nassert quad(-3) == -68\nassert quad(-20) == -2108\nassert quad(-5) == -158\nassert quad(8) == -288\nassert quad(0) == -8", "answer": "def quad(x):\n return -5 * x ** 2 + (5) * x + (-8)", "completion": " ```python\ndef quad(x):\n return -5 * x ** 2 + (5) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -5x² + 5x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(1)` يُرجع `-8`.\nالجواب:", "qhash": "0e71f50601578fcb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قمر سوق سوق خبز وردة') == 1", "assert lead_count('دفتر جمل') == 0", "assert lead_count('ماء جمل قهوة قلم عمل جمل حصان جبل') == 2", "assert lead_count('قلم قلم مدينة قهوة') == 3", "assert lead_count('') == 0"], "test_code": "assert lead_count('نور كتاب قمر') == 1\nassert lead_count('قلم لغة معلم شجرة') == 1\nassert lead_count('قمر سوق سوق خبز وردة') == 1\nassert lead_count('دفتر جمل') == 0\nassert lead_count('ماء جمل قهوة قلم عمل جمل حصان جبل') == 2\nassert lead_count('قلم قلم مدينة قهوة') == 3\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.split():\n if 'ق' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ق». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if 'ق' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('نور كتاب قمر')` يُرجع `1`.\nالجواب:", "qhash": "30562db6fca07e2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['cloud', 'stone', 'garden', 'signal', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['cloud', 'stone', 'garden', 'signal', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "f948cae906de2411", "answer": "['cloud', 'stone', 'garden', 'signal', 'coffee']\n['signal', 'garden', 'coffee']", "completion": " الناتج:\n```text\n['cloud', 'stone', 'garden', 'signal', 'coffee']\n['signal', 'garden', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'python_planet'\nprint(text.split('_'))\nprint(text.upper())\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'python_planet'\nprint(text.split('_'))\nprint(text.upper())\nprint(len(text))\n```\nالجواب:", "qhash": "23b1290c6c558ba6", "answer": "['python', 'planet']\nPYTHON_PLANET\n13", "completion": " الناتج:\n```text\n['python', 'planet']\nPYTHON_PLANET\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('camel to') == 'bzldk sn'", "assert decode('stone is 2024') == 'rsnmd hr 2024'", "assert decode('on !') == 'nm !'", "assert decode('of camel light river table') == 'ne bzldk khfgs qhudq szakd'", "assert decode('a') == 'z'", "assert decode('a') == 'z'", "assert decode('') == ''"], "test_code": "assert decode('camel to') == 'bzldk sn'\nassert decode('stone is 2024') == 'rsnmd hr 2024'\nassert decode('on !') == 'nm !'\nassert decode('of camel light river table') == 'ne bzldk khfgs qhudq szakd'\nassert decode('a') == 'z'\nassert decode('a') == 'z'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('camel to')` يُرجع `'bzldk sn'`.\nالجواب:", "qhash": "a200278dac28ed85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'باسل': 4, 'خالد': 26, 'مريم': 28}\nscores['خالد'] += 9\nscores['حسن'] = 13\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 = {'باسل': 4, 'خالد': 26, 'مريم': 28}\nscores['خالد'] += 9\nscores['حسن'] = 13\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": "001fd16afa31d1ac", "answer": "4\nخالد\n80\n[('باسل', 4), ('حسن', 13)]", "completion": " الناتج:\n```text\n4\nخالد\n80\n[('باسل', 4), ('حسن', 13)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('مدرسة قلم عربية دفتر شجرة ماء') == 1", "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('مدرسة قلم عربية دفتر شجرة ماء') == 1\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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ش»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('مطر عمل قمر')` يُرجع `0`.\nالجواب:", "qhash": "9cb7f2b2fe4a8324"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([1, 45, 44, -13, 56, -18]) == 44", "assert max_multiple([-22, -11, -33]) == -11", "assert max_multiple([1, 12, 23, 34]) == None", "assert max_multiple([23, -37, 28, -33, 23, -6, -39]) == -33", "assert max_multiple([43, -17, -24]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([1, 45, 44, -13, 56, -18]) == 44\nassert max_multiple([-22, -11, -33]) == -11\nassert max_multiple([1, 12, 23, 34]) == None\nassert max_multiple([23, -37, 28, -33, 23, -6, -39]) == -33\nassert max_multiple([43, -17, -24]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(values):\n best = None\n for x in values:\n if x % 11 == 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 % 11 == 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 % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_multiple(values):\n best = None\n for x in values:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_multiple([1, 45, 44, -13, 56, -18])` يُرجع `44`.\nالجواب:", "qhash": "df2a40dcb0a6aba8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [11, -4, 36, 31, 16]\nprint(lst[1:4])\nprint(lst[::3])\nprint(max(lst[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [11, -4, 36, 31, 16]\nprint(lst[1:4])\nprint(lst[::3])\nprint(max(lst[1:4]))\n```\nالجواب:", "qhash": "ba1f425319646667", "answer": "[-4, 36, 31]\n[11, 31]\n36", "completion": " الناتج:\n```text\n[-4, 36, 31]\n[11, 31]\n36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "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": "751b55065fc8e7da", "answer": "ر\n9\n['صحراء', 'مطر']", "completion": " الناتج:\n```text\nر\n9\n['صحراء', 'مطر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 58) == 1)", "tests": ["assert coprimes(135) == 66", "assert coprimes(70) == 34", "assert coprimes(13) == 7", "assert coprimes(129) == 63", "assert coprimes(44) == 21", "assert coprimes(182) == 88", "assert coprimes(1) == 1"], "test_code": "assert coprimes(135) == 66\nassert coprimes(70) == 34\nassert coprimes(13) == 7\nassert coprimes(129) == 63\nassert coprimes(44) == 21\nassert coprimes(182) == 88\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, 58) == 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, 58) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 58) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(135)` يُرجع `66`.\nالجواب:", "qhash": "f9c51429871240ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 33) == 1)", "tests": ["assert rel_prime_count(120) == 73", "assert rel_prime_count(11) == 7", "assert rel_prime_count(35) == 22", "assert rel_prime_count(0) == 0", "assert rel_prime_count(25) == 15", "assert rel_prime_count(103) == 63", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(120) == 73\nassert rel_prime_count(11) == 7\nassert rel_prime_count(35) == 22\nassert rel_prime_count(0) == 0\nassert rel_prime_count(25) == 15\nassert rel_prime_count(103) == 63\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 33) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(120)` يُرجع `73`.\nالجواب:", "qhash": "8162e7066fe57f31"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 24) == 1)", "tests": ["assert coprimes(121) == 41", "assert coprimes(173) == 58", "assert coprimes(23) == 8", "assert coprimes(190) == 63", "assert coprimes(27) == 9", "assert coprimes(15) == 5", "assert coprimes(1) == 1"], "test_code": "assert coprimes(121) == 41\nassert coprimes(173) == 58\nassert coprimes(23) == 8\nassert coprimes(190) == 63\nassert coprimes(27) == 9\nassert coprimes(15) == 5\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, 24) == 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, 24) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 24، أي أن القاسم المشترك الأكبر لها مع 24 يساوي 1.\nمثال: `coprimes(121)` يجب أن تُرجع `41`.\nالجواب:", "qhash": "8c06f2c9c6f7ff53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('بحر قلم كتاب') == 1", "assert count_start('قلم نور سيارة سماء ماء') == 0", "assert count_start('عربية لغة معلم ماء طائرة كتاب كتاب') == 2", "assert count_start('كتاب علم مدرسة سيارة مكتبة كتاب') == 2", "assert count_start('مطر ميناء نهار') == 0", "assert count_start('ليل كتاب جبل كتاب') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('بحر قلم كتاب') == 1\nassert count_start('قلم نور سيارة سماء ماء') == 0\nassert count_start('عربية لغة معلم ماء طائرة كتاب كتاب') == 2\nassert count_start('كتاب علم مدرسة سيارة مكتبة كتاب') == 2\nassert count_start('مطر ميناء نهار') == 0\nassert count_start('ليل كتاب جبل كتاب') == 2\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('بحر قلم كتاب')` يُرجع `1`.\nالجواب:", "qhash": "c44a2cd0a780972c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x ** 2 - 7 for x in range(-4, 8) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x ** 2 - 7 for x in range(-4, 8) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a40fc09265be1616", "answer": "[9, -6, 29]\n3 32", "completion": " الناتج:\n```text\n[9, -6, 29]\n3 32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'signal'\nprint(word.capitalize())\nprint(word.upper())\nprint(word.find('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'signal'\nprint(word.capitalize())\nprint(word.upper())\nprint(word.find('l'))\n```\nالجواب:", "qhash": "4a2840fae14e0c45", "answer": "Signal\nSIGNAL\n5", "completion": " الناتج:\n```text\nSignal\nSIGNAL\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 10) // 3 for x in range(0, 14) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 10) // 3 for x in range(0, 14) if x % 3 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "e130dab603302d0d", "answer": "[3, 4, 5, 6, 7]\n5 25", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7]\n5 25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 12\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 = 12\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": "d2f84e84bd6b73f2", "answer": "9", "completion": " الناتج:\n```text\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "ae2086e0046654ad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 2:\n return 2\n return 2 * f(n - 1) + 4\n\nprint(f(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 2:\n return 2\n return 2 * f(n - 1) + 4\n\nprint(f(11))\n```\nالجواب:", "qhash": "d435d7f303e60649", "answer": "3068", "completion": " الناتج:\n```text\n3068\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 31) == 1)", "tests": ["assert rel_prime_count(73) == 71", "assert rel_prime_count(5) == 5", "assert rel_prime_count(69) == 67", "assert rel_prime_count(63) == 61", "assert rel_prime_count(38) == 37", "assert rel_prime_count(82) == 80", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(73) == 71\nassert rel_prime_count(5) == 5\nassert rel_prime_count(69) == 67\nassert rel_prime_count(63) == 61\nassert rel_prime_count(38) == 37\nassert rel_prime_count(82) == 80\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, 31) == 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, 31) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 31) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(73)` يُرجع `71`.\nالجواب:", "qhash": "bbe20ab00adb13ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -5 * x ** 2 + (-5) * x + (1)", "tests": ["assert quad(2) == -29", "assert quad(-20) == -1899", "assert quad(-6) == -149", "assert quad(-5) == -99", "assert quad(-12) == -659", "assert quad(12) == -779", "assert quad(1) == -9", "assert quad(0) == 1"], "test_code": "assert quad(2) == -29\nassert quad(-20) == -1899\nassert quad(-6) == -149\nassert quad(-5) == -99\nassert quad(-12) == -659\nassert quad(12) == -779\nassert quad(1) == -9\nassert quad(0) == 1", "answer": "def quad(x):\n return -5 * x ** 2 + (-5) * x + (1)", "completion": " ```python\ndef quad(x):\n return -5 * x ** 2 + (-5) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -5x² - 5x + 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(2)` يُرجع `-29`.\nالجواب:", "qhash": "2c07be34f4018f00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert count_initial('شجرة نهار سفينة قهوة خبز وردة') == 1", "assert count_initial('وردة وردة دفتر صديق') == 2", "assert count_initial('ميناء ماء صحراء ماء مدرسة سوق') == 0", "assert count_initial('عمل رمل وردة باب شجرة وردة') == 2", "assert count_initial('شمس صديق لغة سماء مطر خبز') == 0", "assert count_initial('وردة ماء طائرة حاسوب نهر وردة عمل سفينة') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('شجرة نهار سفينة قهوة خبز وردة') == 1\nassert count_initial('وردة وردة دفتر صديق') == 2\nassert count_initial('ميناء ماء صحراء ماء مدرسة سوق') == 0\nassert count_initial('عمل رمل وردة باب شجرة وردة') == 2\nassert count_initial('شمس صديق لغة سماء مطر خبز') == 0\nassert count_initial('وردة ماء طائرة حاسوب نهر وردة عمل سفينة') == 2\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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 count_initial(line):\n count = 0\n for w in line:\n if w.startswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('شجرة نهار سفينة قهوة خبز وردة')` يُرجع `1`.\nالجواب:", "qhash": "abd3ef735df1d136"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "tests": ["assert pow_total(8) == 11664", "assert pow_total(11) == 39204", "assert pow_total(4) == 900", "assert pow_total(5) == 2025", "assert pow_total(1) == 9", "assert pow_total(1) == 9", "assert pow_total(0) == 0"], "test_code": "assert pow_total(8) == 11664\nassert pow_total(11) == 39204\nassert pow_total(4) == 900\nassert pow_total(5) == 2025\nassert pow_total(1) == 9\nassert pow_total(1) == 9\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 9 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 9 * i ** 3\n return total\n```\nمثال: `pow_total(8)` يجب أن تُرجع `11664`.\nالجواب:", "qhash": "f851b76531ba2555"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 47\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 = 47\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": "43ce9f8d4761cd60", "answer": "104", "completion": " الناتج:\n```text\n104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 32)", "tests": ["assert filter_range([20, 15, 4, 31, 31, 18]) == [-31, -31, -20, -18, -15, -4]", "assert filter_range([]) == []", "assert filter_range([42, -23, 38, 55, 2, 10, 3, 48, -24]) == [-10, -3, -2]", "assert filter_range([29, 24, 7, -14, -18, 52]) == [-29, -24, -7]", "assert filter_range([35, 33, -23, 8, 50, 34, 43, -30, 42, -27]) == [-8]", "assert filter_range([25, 38, -11, 44]) == [-25]", "assert filter_range([-25, -7, 5, 10, 34, 48]) == [-10, -5, 7]", "assert filter_range([]) == []"], "test_code": "assert filter_range([20, 15, 4, 31, 31, 18]) == [-31, -31, -20, -18, -15, -4]\nassert filter_range([]) == []\nassert filter_range([42, -23, 38, 55, 2, 10, 3, 48, -24]) == [-10, -3, -2]\nassert filter_range([29, 24, 7, -14, -18, 52]) == [-29, -24, -7]\nassert filter_range([35, 33, -23, 8, 50, 34, 43, -30, 42, -27]) == [-8]\nassert filter_range([25, 38, -11, 44]) == [-25]\nassert filter_range([-25, -7, 5, 10, 34, 48]) == [-10, -5, 7]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 32)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -7 ≤ x ≤ 32، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([20, 15, 4, 31, 31, 18])` يُرجع `[-31, -31, -20, -18, -15, -4]`.\nالجواب:", "qhash": "595ba35e632e8db3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('on garden go planet') == 'hg ztkwxg zh ietgxm'", "assert shift_text('coffee vector !') == 'vhyyxx oxvmhk !'", "assert shift_text('vector') == 'oxvmhk'", "assert shift_text('code !') == 'vhwx !'", "assert shift_text('music in coffee Hello') == 'fnlbv bg vhyyxx Hxeeh'", "assert shift_text('in an matrix stone stone 2024') == 'bg tg ftmkbq lmhgx lmhgx 2024'", "assert shift_text('') == ''"], "test_code": "assert shift_text('on garden go planet') == 'hg ztkwxg zh ietgxm'\nassert shift_text('coffee vector !') == 'vhyyxx oxvmhk !'\nassert shift_text('vector') == 'oxvmhk'\nassert shift_text('code !') == 'vhwx !'\nassert shift_text('music in coffee Hello') == 'fnlbv bg vhyyxx Hxeeh'\nassert shift_text('in an matrix stone stone 2024') == 'bg tg ftmkbq lmhgx lmhgx 2024'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('on garden go planet')` يجب أن تُرجع `'hg ztkwxg zh ietgxm'`.\nالجواب:", "qhash": "dac5004ceb5e2b62"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([42, -18, 26, 56, 35, -25, 57, 60, -14]) == 60", "assert max_multiple([-4, -10, -6]) == -4", "assert max_multiple([1, 3]) == None", "assert max_multiple([26, 8, 15]) == 26", "assert max_multiple([9, -47, 46]) == 46", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([42, -18, 26, 56, 35, -25, 57, 60, -14]) == 60\nassert max_multiple([-4, -10, -6]) == -4\nassert max_multiple([1, 3]) == None\nassert max_multiple([26, 8, 15]) == 26\nassert max_multiple([9, -47, 46]) == 46\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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مثال: `max_multiple([42, -18, 26, 56, 35, -25, 57, 60, -14])` يجب أن تُرجع `60`.\nالجواب:", "qhash": "564321ac2761c794"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'music'\nprint(word[::-1])\nprint(word.find('s'))\nprint(word.count('s'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'music'\nprint(word[::-1])\nprint(word.find('s'))\nprint(word.count('s'))\n```\nالجواب:", "qhash": "64fadde2d1b7aa0e", "answer": "cisum\n2\n1", "completion": " الناتج:\n```text\ncisum\n2\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('at desert river winter in brain') == 'winter,desert'", "assert flip_words('data table is rocket') == 'rocket'", "assert flip_words('cloud music light planet code river is planet') == 'planet,planet'", "assert flip_words('at cloud pixel a is is winter') == 'winter'", "assert flip_words('garden') == 'garden'", "assert flip_words('by winter orange desert signal summer') == 'summer,signal,desert,orange,winter'", "assert flip_words('matrix a orange winter a') == 'winter,orange,matrix'"], "test_code": "assert flip_words('at desert river winter in brain') == 'winter,desert'\nassert flip_words('data table is rocket') == 'rocket'\nassert flip_words('cloud music light planet code river is planet') == 'planet,planet'\nassert flip_words('at cloud pixel a is is winter') == 'winter'\nassert flip_words('garden') == 'garden'\nassert flip_words('by winter orange desert signal summer') == 'summer,signal,desert,orange,winter'\nassert flip_words('matrix a orange winter a') == 'winter,orange,matrix'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `flip_words('at desert river winter in brain')` يُرجع `'winter,desert'`.\nالجواب:", "qhash": "9ff8156dbaebf6a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 5) // 5 for x in range(6, 12) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 5) // 5 for x in range(6, 12) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "670e51a7cd27200a", "answer": "[2]\n1 2", "completion": " الناتج:\n```text\n[2]\n1 2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 9 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(12) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12']", "assert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13']", "assert fizzbuzz(23) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19', '20', 'Sun', '22', '23']", "assert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon']", "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon']"], "test_code": "assert fizzbuzz(12) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12']\nassert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13']\nassert fizzbuzz(23) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19', '20', 'Sun', '22', '23']\nassert fizzbuzz(18) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon']\nassert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon']", "answer": "def fizzbuzz(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 fizzbuzz(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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Sun'، وعلى 9 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(12)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12']`.\nالجواب:", "qhash": "52c336eb23f12875"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('قهوة سيارة مدرسة دفتر صحراء صديق') == 1", "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", "assert count_in_text('ماء بيت شمس') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('قهوة سيارة مدرسة دفتر صحراء صديق') == 1\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\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('قهوة سيارة مدرسة دفتر صحراء صديق')` يُرجع `1`.\nالجواب:", "qhash": "157979e4af8271fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -3 * x ** 2 + (6) * x + (9)", "tests": ["assert value_at(8) == -135", "assert value_at(13) == -420", "assert value_at(-13) == -576", "assert value_at(-18) == -1071", "assert value_at(-17) == -960", "assert value_at(9) == -180", "assert value_at(-4) == -63", "assert value_at(0) == 9"], "test_code": "assert value_at(8) == -135\nassert value_at(13) == -420\nassert value_at(-13) == -576\nassert value_at(-18) == -1071\nassert value_at(-17) == -960\nassert value_at(9) == -180\nassert value_at(-4) == -63\nassert value_at(0) == 9", "answer": "def value_at(x):\n return -3 * x ** 2 + (6) * x + (9)", "completion": " ```python\ndef value_at(x):\n return -3 * x ** 2 + (6) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -3x² + 6x + 9 عند العدد الصحيح x.\nمثال: `value_at(8)` يجب أن تُرجع `-135`.\nالجواب:", "qhash": "a0f38aa0dcdac18b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 39776\ncount = 0\nwhile x > 4:\n x = x // 4\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 39776\ncount = 0\nwhile x > 4:\n x = x // 4\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "31f62dfe7afb44f6", "answer": "2 7", "completion": " الناتج:\n```text\n2 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'winter'\nprint(name[1:6])\nprint(name.find('w'))\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'winter'\nprint(name[1:6])\nprint(name.find('w'))\nprint(name.capitalize())\n```\nالجواب:", "qhash": "367c6a9e754cf307", "answer": "inter\n0\nWinter", "completion": " الناتج:\n```text\ninter\n0\nWinter\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 22)", "tests": ["assert clip_scale([11, 9, 15, -13, -7, -2, 29, -13, -1]) == [-2, -1, 9, 11, 15]", "assert clip_scale([-18, 37, -15, 38]) == []", "assert clip_scale([-20, 0, -26, -4, 56, 58, 15]) == [-4, 0, 15]", "assert clip_scale([56, 41, -23, 17, 44]) == [17]", "assert clip_scale([48, 56, 41]) == []", "assert clip_scale([-7, 20, 33, -5, 59, 27, 23, 52, -23, -26]) == [20]", "assert clip_scale([53, 12, 46, 1]) == [1, 12]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([11, 9, 15, -13, -7, -2, 29, -13, -1]) == [-2, -1, 9, 11, 15]\nassert clip_scale([-18, 37, -15, 38]) == []\nassert clip_scale([-20, 0, -26, -4, 56, 58, 15]) == [-4, 0, 15]\nassert clip_scale([56, 41, -23, 17, 44]) == [17]\nassert clip_scale([48, 56, 41]) == []\nassert clip_scale([-7, 20, 33, -5, 59, 27, 23, 52, -23, -26]) == [20]\nassert clip_scale([53, 12, 46, 1]) == [1, 12]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 22)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 22)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق -4 ≤ x ≤ 22، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([11, 9, 15, -13, -7, -2, 29, -13, -1])` يُرجع `[-2, -1, 9, 11, 15]`.\nالجواب:", "qhash": "dd090c07a0131fe4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 18)", "tests": ["assert in_range_scaled([10, 20, 11, 10, 9, 23, -4, 15, 24]) == [18, 20, 20, 22, 30]", "assert in_range_scaled([6, 32, -21, -29, -26, 25, 52]) == [12]", "assert in_range_scaled([5, -28]) == [10]", "assert in_range_scaled([]) == []", "assert in_range_scaled([-22, 1, -4, 13, 58, -12, 56, 55, -28, 56]) == [2, 26]", "assert in_range_scaled([-27, 48, -23, 40, 31]) == []", "assert in_range_scaled([4, 35, -8, 30]) == [8]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([10, 20, 11, 10, 9, 23, -4, 15, 24]) == [18, 20, 20, 22, 30]\nassert in_range_scaled([6, 32, -21, -29, -26, 25, 52]) == [12]\nassert in_range_scaled([5, -28]) == [10]\nassert in_range_scaled([]) == []\nassert in_range_scaled([-22, 1, -4, 13, 58, -12, 56, 55, -28, 56]) == [2, 26]\nassert in_range_scaled([-27, 48, -23, 40, 31]) == []\nassert in_range_scaled([4, 35, -8, 30]) == [8]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 18)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 0 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 0 و18 (شاملًا الطرفين) في 2.\nمثال: `in_range_scaled([10, 20, 11, 10, 9, 23, -4, 15, 24])` يجب أن تُرجع `[18, 20, 20, 22, 30]`.\nالجواب:", "qhash": "6b0a458c2a15571a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 1\nfor n in range(2, 9, 3):\n s += n * 4\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 1\nfor n in range(2, 9, 3):\n s += n * 4\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "778a39a190c025c3", "answer": "61\n8", "completion": " الناتج:\n```text\n61\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 0:\n return 1\n return 2 * go(n - 1) + 1\n\nprint(go(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 0:\n return 1\n return 2 * go(n - 1) + 1\n\nprint(go(9))\n```\nالجواب:", "qhash": "162460cc510916fc", "answer": "1023", "completion": " الناتج:\n```text\n1023\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-3, 38, 32, 18, 6, 36]\nprint(a[1:5])\nprint(a[::3])\nprint(min(a[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-3, 38, 32, 18, 6, 36]\nprint(a[1:5])\nprint(a[::3])\nprint(min(a[1:5]))\n```\nالجواب:", "qhash": "a7e99dc46a4645bf", "answer": "[38, 32, 18, 6]\n[-3, 18]\n6", "completion": " الناتج:\n```text\n[38, 32, 18, 6]\n[-3, 18]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 4", "tests": ["assert digit_power(7734) == 1", "assert digit_power(344378) == 1", "assert digit_power(342223) == 2", "assert digit_power(759180) == 2", "assert digit_power(302678) == 2", "assert digit_power(259241) == 3", "assert digit_power(746631) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(7734) == 1\nassert digit_power(344378) == 1\nassert digit_power(342223) == 2\nassert digit_power(759180) == 2\nassert digit_power(302678) == 2\nassert digit_power(259241) == 3\nassert digit_power(746631) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 4", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 4\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 4.\nللتوضيح: الاستدعاء `digit_power(7734)` يُرجع `1`.\nالجواب:", "qhash": "fbca3a4bfd44d83a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('برمجة علم جمل قهوة ميناء قهوة قهوة تفاحة') == 1", "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('برمجة علم جمل قهوة ميناء قهوة قهوة تفاحة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('حصان ليل سوق صحراء نهار')` يُرجع `0`.\nالجواب:", "qhash": "5aac25bf6c4cb160"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('ماء قمر مدينة سوق جبل عربية') == 1", "assert tally_letter('ليل خبز عربية قهوة') == 0", "assert tally_letter('حاسوب وردة قهوة مدرسة نهر مطر ماء') == 1", "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('ماء قمر مدينة سوق جبل عربية') == 1\nassert tally_letter('ليل خبز عربية قهوة') == 0\nassert tally_letter('حاسوب وردة قهوة مدرسة نهر مطر ماء') == 1\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 'ن' 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ن» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('عمل ليل سماء')` يُرجع `0`.\nالجواب:", "qhash": "cdedce141da93534"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 20:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([6, 7, 2, 9, 1, 1, 12, 2, 11]) == [6, 13, 15, 0, 1, 2, 14, 16, 0]", "assert reset_sum([18, 8, 3, 15, 7, 17, 7, -10]) == [18, 0, 3, 18, 0, 17, 0, -10]", "assert reset_sum([8, 5, 20, 8, 14, 12, 6]) == [8, 13, 0, 8, 0, 12, 18]", "assert reset_sum([0, 17, 3, 10, 18, 1, 9, 13]) == [0, 17, 20, 0, 18, 19, 0, 13]", "assert reset_sum([-1, -4, 8, -4, -8]) == [-1, -5, 3, -1, -9]", "assert reset_sum([5, 1, 12, 6, -10, -4, -3, -7, -3]) == [5, 6, 18, 0, -10, -14, -17, -24, -27]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([6, 7, 2, 9, 1, 1, 12, 2, 11]) == [6, 13, 15, 0, 1, 2, 14, 16, 0]\nassert reset_sum([18, 8, 3, 15, 7, 17, 7, -10]) == [18, 0, 3, 18, 0, 17, 0, -10]\nassert reset_sum([8, 5, 20, 8, 14, 12, 6]) == [8, 13, 0, 8, 0, 12, 18]\nassert reset_sum([0, 17, 3, 10, 18, 1, 9, 13]) == [0, 17, 20, 0, 18, 19, 0, 13]\nassert reset_sum([-1, -4, 8, -4, -8]) == [-1, -5, 3, -1, -9]\nassert reset_sum([5, 1, 12, 6, -10, -4, -3, -7, -3]) == [5, 6, 18, 0, -10, -14, -17, -24, -27]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 20:\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 > 20:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 20 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([6, 7, 2, 9, 1, 1, 12, 2, 11])` يُرجع `[6, 13, 15, 0, 1, 2, 14, 16, 0]`.\nالجواب:", "qhash": "a8c08a47858a84e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'do'}", "tests": ["assert char_counts('music apple music banana') == {'d': 0, 'o': 0}", "assert char_counts('it') == {'d': 0, 'o': 0}", "assert char_counts('is') == {'d': 0, 'o': 0}", "assert char_counts('is orange vector') == {'d': 0, 'o': 2}", "assert char_counts('brain on window apple river') == {'d': 1, 'o': 2}", "assert char_counts('camel in engine summer') == {'d': 0, 'o': 0}", "assert char_counts('') == {'d': 0, 'o': 0}"], "test_code": "assert char_counts('music apple music banana') == {'d': 0, 'o': 0}\nassert char_counts('it') == {'d': 0, 'o': 0}\nassert char_counts('is') == {'d': 0, 'o': 0}\nassert char_counts('is orange vector') == {'d': 0, 'o': 2}\nassert char_counts('brain on window apple river') == {'d': 1, 'o': 2}\nassert char_counts('camel in engine summer') == {'d': 0, 'o': 0}\nassert char_counts('') == {'d': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'do'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'do'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('music apple music banana')` يجب أن تُرجع `{'d': 0, 'o': 0}`.\nالجواب:", "qhash": "60caf9f8f726ef57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert roll([17, 28, 50, 37, 11, 9, 11]) == [11, 9, 11, 17, 28, 50, 37]", "assert roll([25, -7, -3, 8, 22, 26, 0]) == [22, 26, 0, 25, -7, -3, 8]", "assert roll([26, 14, 28, 11, 16, 33, 7]) == [16, 33, 7, 26, 14, 28, 11]", "assert roll([28, 7, 20]) == [20, 28, 7]", "assert roll([6, -5, 6, 30, 31, 24]) == [6, 30, 31, 24, 6, -5]", "assert roll([18, 1, 7]) == [7, 18, 1]", "assert roll([]) == []"], "test_code": "assert roll([17, 28, 50, 37, 11, 9, 11]) == [11, 9, 11, 17, 28, 50, 37]\nassert roll([25, -7, -3, 8, 22, 26, 0]) == [22, 26, 0, 25, -7, -3, 8]\nassert roll([26, 14, 28, 11, 16, 33, 7]) == [16, 33, 7, 26, 14, 28, 11]\nassert roll([28, 7, 20]) == [20, 28, 7]\nassert roll([6, -5, 6, 30, 31, 24]) == [6, 30, 31, 24, 6, -5]\nassert roll([18, 1, 7]) == [7, 18, 1]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 10 % 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 = 10 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `roll([17, 28, 50, 37, 11, 9, 11])` يُرجع `[11, 9, 11, 17, 28, 50, 37]`.\nالجواب:", "qhash": "9a1b47992575b938"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_sel([12, 87, 56, 16, 67, 59, 90, 40, 30, 38, 62]) == 3", "assert count_sel([68]) == 0", "assert count_sel([71, 33, -9, 7]) == 0", "assert count_sel([83, 52, 57, 77, 83, 38, 4, 83, 5]) == 0", "assert count_sel([31, -21, 64]) == 1", "assert count_sel([29, 84, -11, 66, 89, -38, 81, 87, 40]) == 1", "assert count_sel([]) == 0"], "test_code": "assert count_sel([12, 87, 56, 16, 67, 59, 90, 40, 30, 38, 62]) == 3\nassert count_sel([68]) == 0\nassert count_sel([71, 33, -9, 7]) == 0\nassert count_sel([83, 52, 57, 77, 83, 38, 4, 83, 5]) == 0\nassert count_sel([31, -21, 64]) == 1\nassert count_sel([29, 84, -11, 66, 89, -38, 81, 87, 40]) == 1\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 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 % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 3، واكتب الدالة بعد إكمالها.\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([12, 87, 56, 16, 67, 59, 90, 40, 30, 38, 62])` يُرجع `3`.\nالجواب:", "qhash": "5a1115e568c9dc99"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 61", "tests": ["assert dig_pow_mod(40656) == 57", "assert dig_pow_mod(7201) == 39", "assert dig_pow_mod(267490) == 38", "assert dig_pow_mod(951154) == 17", "assert dig_pow_mod(489112) == 12", "assert dig_pow_mod(954712) == 39", "assert dig_pow_mod(39682) == 33", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(40656) == 57\nassert dig_pow_mod(7201) == 39\nassert dig_pow_mod(267490) == 38\nassert dig_pow_mod(951154) == 17\nassert dig_pow_mod(489112) == 12\nassert dig_pow_mod(954712) == 39\nassert dig_pow_mod(39682) == 33\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 61", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 61.\nمثال: `dig_pow_mod(40656)` يجب أن تُرجع `57`.\nالجواب:", "qhash": "2d09d96f1314c756"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 3 * x ** 2 + (-2) * x + (-4)", "tests": ["assert eval_poly(1) == -3", "assert eval_poly(-8) == 204", "assert eval_poly(4) == 36", "assert eval_poly(-10) == 316", "assert eval_poly(-10) == 316", "assert eval_poly(7) == 129", "assert eval_poly(5) == 61", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(1) == -3\nassert eval_poly(-8) == 204\nassert eval_poly(4) == 36\nassert eval_poly(-10) == 316\nassert eval_poly(-10) == 316\nassert eval_poly(7) == 129\nassert eval_poly(5) == 61\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return 3 * x ** 2 + (-2) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return 3 * x ** 2 + (-2) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 3x² - 2x - 4 عند العدد الصحيح x.\nمثال: `eval_poly(1)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "8b3286de248eb555"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سفينة جبل'\nprint(len(text))\nprint(text[::-1])\nprint(text.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سفينة جبل'\nprint(len(text))\nprint(text[::-1])\nprint(text.replace(' ', '-'))\n```\nالجواب:", "qhash": "57e9f2957e5cee31", "answer": "9\nلبج ةنيفس\nسفينة-جبل", "completion": " الناتج:\n```text\n9\nلبج ةنيفس\nسفينة-جبل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('engine engine camel Hello') == 'qzsuzq qzsuzq omyqx Hqxxa'", "assert caesar('go falcon an stone A1') == 'sa rmxoaz mz efazq A1'", "assert caesar('of camel up A1') == 'ar omyqx gb A1'", "assert caesar('it orange') == 'uf admzsq'", "assert caesar('river rocket engine light banana OK') == 'duhqd daowqf qzsuzq xustf nmzmzm OK'", "assert caesar('vector camel') == 'hqofad omyqx'", "assert caesar('') == ''"], "test_code": "assert caesar('engine engine camel Hello') == 'qzsuzq qzsuzq omyqx Hqxxa'\nassert caesar('go falcon an stone A1') == 'sa rmxoaz mz efazq A1'\nassert caesar('of camel up A1') == 'ar omyqx gb A1'\nassert caesar('it orange') == 'uf admzsq'\nassert caesar('river rocket engine light banana OK') == 'duhqd daowqf qzsuzq xustf nmzmzm OK'\nassert caesar('vector camel') == 'hqofad omyqx'\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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('engine engine camel Hello')` يجب أن تُرجع `'qzsuzq qzsuzq omyqx Hqxxa'`.\nالجواب:", "qhash": "b4e36b2f35c1044d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "tests": ["assert total_pow(6) == 27300", "assert total_pow(15) == 2139744", "assert total_pow(6) == 27300", "assert total_pow(1) == 12", "assert total_pow(11) == 479688", "assert total_pow(1) == 12", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 27300\nassert total_pow(15) == 2139744\nassert total_pow(6) == 27300\nassert total_pow(1) == 12\nassert total_pow(11) == 479688\nassert total_pow(1) == 12\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 4\n return total\n```\nمثال: `total_pow(6)` يجب أن تُرجع `27300`.\nالجواب:", "qhash": "7e993474389c1be8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('وردة قهوة حاسوب معلم ميناء مدينة فجر طالب') == 3", "assert count_initial('معلم معلم حاسوب فجر ماء') == 3", "assert count_initial('حديقة لغة مدرسة ليل حصان مطر عربية') == 2", "assert count_initial('قمر طالب شمس برتقال') == 0", "assert count_initial('ماء مكتبة مدرسة قهوة برمجة') == 3", "assert count_initial('دفتر جبل ميناء مدينة') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('وردة قهوة حاسوب معلم ميناء مدينة فجر طالب') == 3\nassert count_initial('معلم معلم حاسوب فجر ماء') == 3\nassert count_initial('حديقة لغة مدرسة ليل حصان مطر عربية') == 2\nassert count_initial('قمر طالب شمس برتقال') == 0\nassert count_initial('ماء مكتبة مدرسة قهوة برمجة') == 3\nassert count_initial('دفتر جبل ميناء مدينة') == 2\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('وردة قهوة حاسوب معلم ميناء مدينة فجر طالب')` يُرجع `3`.\nالجواب:", "qhash": "803ffea04a2504d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 6\nfor x in range(-2, 21, 4):\n total += x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 6\nfor x in range(-2, 21, 4):\n total += x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "e27ae0ae07196604", "answer": "438\n18", "completion": " الناتج:\n```text\n438\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]", "tests": ["assert shift_list([46, 39, 29, 35]) == [29, 35, 46, 39]", "assert shift_list([38, 14, 24, 4, 16, 31, 34, -5, -6]) == [31, 34, -5, -6, 38, 14, 24, 4, 16]", "assert shift_list([23, -4, 30, 14, 21, -3]) == [30, 14, 21, -3, 23, -4]", "assert shift_list([-1, 17, 37]) == [37, -1, 17]", "assert shift_list([1, 3, 4, -7, 21, 30, 18, 35, 15, 34]) == [21, 30, 18, 35, 15, 34, 1, 3, 4, -7]", "assert shift_list([0, 33, 9, 38, 27]) == [27, 0, 33, 9, 38]", "assert shift_list([]) == []"], "test_code": "assert shift_list([46, 39, 29, 35]) == [29, 35, 46, 39]\nassert shift_list([38, 14, 24, 4, 16, 31, 34, -5, -6]) == [31, 34, -5, -6, 38, 14, 24, 4, 16]\nassert shift_list([23, -4, 30, 14, 21, -3]) == [30, 14, 21, -3, 23, -4]\nassert shift_list([-1, 17, 37]) == [37, -1, 17]\nassert shift_list([1, 3, 4, -7, 21, 30, 18, 35, 15, 34]) == [21, 30, 18, 35, 15, 34, 1, 3, 4, -7]\nassert shift_list([0, 33, 9, 38, 27]) == [27, 0, 33, 9, 38]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n if not items:\n return []\n k = 14 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 14 % len(items)\n return ____\n```\nمثال: `shift_list([46, 39, 29, 35])` يجب أن تُرجع `[29, 35, 46, 39]`.\nالجواب:", "qhash": "c0b0e9713db7705a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('منى', 22), ('سلمى', 56), ('يوسف', 95), ('مريم', 71)]\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 = [('منى', 22), ('سلمى', 56), ('يوسف', 95), ('مريم', 71)]\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": "7111a5c999c1eb14", "answer": "[('منى', 22), ('سلمى', 56), ('مريم', 71), ('يوسف', 95)]\n['يوسف', 'مريم']", "completion": " الناتج:\n```text\n[('منى', 22), ('سلمى', 56), ('مريم', 71), ('يوسف', 95)]\n['يوسف', 'مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(3, 0))", "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(3, 0))\n```\nالجواب:", "qhash": "572868ebc6c61a74", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([10, 40, 10, 25]) == [10, 40, 10, 25]", "assert roll([25, 50, 22]) == [22, 25, 50]", "assert roll([33, 18, 25, 3, 2, 16, 1, -3, -7]) == [25, 3, 2, 16, 1, -3, -7, 33, 18]", "assert roll([38, 4, 7, 8, 37, 2, 45, 38, 23, 24, 32, 44]) == [23, 24, 32, 44, 38, 4, 7, 8, 37, 2, 45, 38]", "assert roll([28, 7, 8, 39, -8, 12, 36, 26, 33, 48, 28]) == [36, 26, 33, 48, 28, 28, 7, 8, 39, -8, 12]", "assert roll([1, 36, 32, 3, 39]) == [39, 1, 36, 32, 3]", "assert roll([]) == []"], "test_code": "assert roll([10, 40, 10, 25]) == [10, 40, 10, 25]\nassert roll([25, 50, 22]) == [22, 25, 50]\nassert roll([33, 18, 25, 3, 2, 16, 1, -3, -7]) == [25, 3, 2, 16, 1, -3, -7, 33, 18]\nassert roll([38, 4, 7, 8, 37, 2, 45, 38, 23, 24, 32, 44]) == [23, 24, 32, 44, 38, 4, 7, 8, 37, 2, 45, 38]\nassert roll([28, 7, 8, 39, -8, 12, 36, 26, 33, 48, 28]) == [36, 26, 33, 48, 28, 28, 7, 8, 39, -8, 12]\nassert roll([1, 36, 32, 3, 39]) == [39, 1, 36, 32, 3]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 16 % 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 = 16 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([10, 40, 10, 25])` يُرجع `[10, 40, 10, 25]`.\nالجواب:", "qhash": "baeb1e52f720c334"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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(23) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong', '10', '11', 'Ping', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22', '23']", "assert play(13) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong', '10', '11', 'Ping', '13']", "assert play(7) == ['1', '2', '3', 'Ping', '5', '6', '7']", "assert play(9) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong']", "assert play(2) == ['1', '2']"], "test_code": "assert play(23) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong', '10', '11', 'Ping', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22', '23']\nassert play(13) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong', '10', '11', 'Ping', '13']\nassert play(7) == ['1', '2', '3', 'Ping', '5', '6', '7']\nassert play(9) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong']\nassert play(2) == ['1', '2']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 % 4 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 9 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(23)` يجب أن تُرجع `['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', 'Pong', '10', '11', 'Ping', '13', '14', '15', 'Ping', '17', 'Pong', '19', 'Ping', '21', '22', '23']`.\nالجواب:", "qhash": "6e8f1922979b1420"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(14) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red', '13', 'RedBlue']", "assert fizzbuzz(2) == ['1', 'Red']", "assert fizzbuzz(6) == ['1', 'Red', '3', 'Red', '5', 'Red']", "assert fizzbuzz(16) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red', '13', 'RedBlue', '15', 'Red']", "assert fizzbuzz(12) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red']"], "test_code": "assert fizzbuzz(14) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red', '13', 'RedBlue']\nassert fizzbuzz(2) == ['1', 'Red']\nassert fizzbuzz(6) == ['1', 'Red', '3', 'Red', '5', 'Red']\nassert fizzbuzz(16) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red', '13', 'RedBlue', '15', 'Red']\nassert fizzbuzz(12) == ['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', '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 % 7 == 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 % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Red'، وعلى 7 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(14)` يجب أن تُرجع `['1', 'Red', '3', 'Red', '5', 'Red', 'Blue', 'Red', '9', 'Red', '11', 'Red', '13', 'RedBlue']`.\nالجواب:", "qhash": "0495050526c30789"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['table', 'banana', 'river', 'brain', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['table', 'banana', 'river', 'brain', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "badfb7d071e3d97e", "answer": "['table', 'river', 'brain', 'stone', 'banana']\n['banana', 'table', 'stone']", "completion": " الناتج:\n```text\n['table', 'river', 'brain', 'stone', 'banana']\n['banana', 'table', 'stone']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(619349307))\nprint(go(go(619349307)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(619349307))\nprint(go(go(619349307)))\n```\nالجواب:", "qhash": "141716f664b9aac6", "answer": "42\n6", "completion": " الناتج:\n```text\n42\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert sum_powers(5) == 7832", "assert sum_powers(1) == 8", "assert sum_powers(1) == 8", "assert sum_powers(5) == 7832", "assert sum_powers(2) == 136", "assert sum_powers(1) == 8", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 7832\nassert sum_powers(1) == 8\nassert sum_powers(1) == 8\nassert sum_powers(5) == 7832\nassert sum_powers(2) == 136\nassert sum_powers(1) == 8\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total\n```\nمثال: `sum_powers(5)` يجب أن تُرجع `7832`.\nالجواب:", "qhash": "be48770faf307f71"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(23) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9', '10', '11', 'Foo', '13', 'Bar', '15', '16', '17', 'Foo', '19', '20', 'Bar', '22', '23']", "assert fizz(4) == ['1', '2', '3', '4']", "assert fizz(3) == ['1', '2', '3']", "assert fizz(18) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9', '10', '11', 'Foo', '13', 'Bar', '15', '16', '17', 'Foo']", "assert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9']"], "test_code": "assert fizz(23) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9', '10', '11', 'Foo', '13', 'Bar', '15', '16', '17', 'Foo', '19', '20', 'Bar', '22', '23']\nassert fizz(4) == ['1', '2', '3', '4']\nassert fizz(3) == ['1', '2', '3']\nassert fizz(18) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9', '10', '11', 'Foo', '13', 'Bar', '15', '16', '17', 'Foo']\nassert fizz(9) == ['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 7 == 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 % 6 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Foo'، وعلى 7 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(23)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Foo', 'Bar', '8', '9', '10', '11', 'Foo', '13', 'Bar', '15', '16', '17', 'Foo', '19', '20', 'Bar', '22', '23']`.\nالجواب:", "qhash": "bacd308e7952ab5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([4, 67, 80, 90, 70, 44, 21, 35, 16]) == 0", "assert div_not([-20, -39, 43, 59, -31, 60, -29]) == 0", "assert div_not([68, 10, -30, -7, 37, 42, -19]) == 0", "assert div_not([-25, 12, -25, 27, 68, 45, 85, 16, 74]) == 0", "assert div_not([-18, 59, 77, 22]) == 0", "assert div_not([52, 29, 66, 60, 64, -4, 83, 85, 83]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([4, 67, 80, 90, 70, 44, 21, 35, 16]) == 0\nassert div_not([-20, -39, 43, 59, -31, 60, -29]) == 0\nassert div_not([68, 10, -30, -7, 37, 42, -19]) == 0\nassert div_not([-25, 12, -25, 27, 68, 45, 85, 16, 74]) == 0\nassert div_not([-18, 59, 77, 22]) == 0\nassert div_not([52, 29, 66, 60, 64, -4, 83, 85, 83]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([4, 67, 80, 90, 70, 44, 21, 35, 16])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "8ea5e871969a8ddd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'aein'}", "tests": ["assert char_freq('on in we') == {'a': 0, 'e': 1, 'i': 1, 'n': 2}", "assert char_freq('engine') == {'a': 0, 'e': 2, 'i': 1, 'n': 2}", "assert char_freq('up at music orange banana of') == {'a': 5, 'e': 1, 'i': 1, 'n': 3}", "assert char_freq('stone up') == {'a': 0, 'e': 1, 'i': 0, 'n': 1}", "assert char_freq('in camel python planet') == {'a': 2, 'e': 2, 'i': 1, 'n': 3}", "assert char_freq('in') == {'a': 0, 'e': 0, 'i': 1, 'n': 1}", "assert char_freq('') == {'a': 0, 'e': 0, 'i': 0, 'n': 0}"], "test_code": "assert char_freq('on in we') == {'a': 0, 'e': 1, 'i': 1, 'n': 2}\nassert char_freq('engine') == {'a': 0, 'e': 2, 'i': 1, 'n': 2}\nassert char_freq('up at music orange banana of') == {'a': 5, 'e': 1, 'i': 1, 'n': 3}\nassert char_freq('stone up') == {'a': 0, 'e': 1, 'i': 0, 'n': 1}\nassert char_freq('in camel python planet') == {'a': 2, 'e': 2, 'i': 1, 'n': 3}\nassert char_freq('in') == {'a': 0, 'e': 0, 'i': 1, 'n': 1}\nassert char_freq('') == {'a': 0, 'e': 0, 'i': 0, 'n': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'aein'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'aein'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'e'، 'i'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('on in we')` يجب أن تُرجع `{'a': 0, 'e': 1, 'i': 1, 'n': 2}`.\nالجواب:", "qhash": "72fd24afc217d23c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'حاسوب'\nprint(s.find('و'))\nprint('و' in s)\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'حاسوب'\nprint(s.find('و'))\nprint('و' in s)\nprint(s[-1])\n```\nالجواب:", "qhash": "ebf3cdeb04d86b91", "answer": "3\nTrue\nب", "completion": " الناتج:\n```text\n3\nTrue\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([31, 2, 72, 27, 82, 19, 61, 87, 29, 67]) == 1", "assert only_div([51, 13, 18, 7, -4, -12, 40, 88, 68, 47]) == 1", "assert only_div([84, 68]) == 0", "assert only_div([10, -25, 31, 49, 36, 86, 47, 31, -35]) == 1", "assert only_div([90, -8, 67, -9, 27, 27, 90, 60]) == 5", "assert only_div([49, 35, 79, -23]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([31, 2, 72, 27, 82, 19, 61, 87, 29, 67]) == 1\nassert only_div([51, 13, 18, 7, -4, -12, 40, 88, 68, 47]) == 1\nassert only_div([84, 68]) == 0\nassert only_div([10, -25, 31, 49, 36, 86, 47, 31, -35]) == 1\nassert only_div([90, -8, 67, -9, 27, 27, 90, 60]) == 5\nassert only_div([49, 35, 79, -23]) == 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 % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([31, 2, 72, 27, 82, 19, 61, 87, 29, 67])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "337d4dee99587d24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 6 * x ** 2 + (0) * x + (3)", "tests": ["assert poly(2) == 27", "assert poly(-10) == 603", "assert poly(-6) == 219", "assert poly(14) == 1179", "assert poly(5) == 153", "assert poly(-6) == 219", "assert poly(-8) == 387", "assert poly(0) == 3"], "test_code": "assert poly(2) == 27\nassert poly(-10) == 603\nassert poly(-6) == 219\nassert poly(14) == 1179\nassert poly(5) == 153\nassert poly(-6) == 219\nassert poly(-8) == 387\nassert poly(0) == 3", "answer": "def poly(x):\n return 6 * x ** 2 + (0) * x + (3)", "completion": " ```python\ndef poly(x):\n return 6 * x ** 2 + (0) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 6x² + 0x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(2)` يُرجع `27`.\nالجواب:", "qhash": "efb55dc535ce6c3f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert backwards('matrix coffee signal coffee') == 'coffee|signal|coffee|matrix'", "assert backwards('it we we engine') == 'engine'", "assert backwards('at we python a planet is coffee summer') == 'summer|coffee|planet|python'", "assert backwards('apple desert orange we brain signal orange orange') == 'orange|orange|signal|brain|orange|desert|apple'", "assert backwards('') == ''", "assert backwards('window brain cloud orange cloud') == 'cloud|orange|cloud|brain|window'", "assert backwards('garden on we engine is apple by') == 'apple|engine|garden'"], "test_code": "assert backwards('matrix coffee signal coffee') == 'coffee|signal|coffee|matrix'\nassert backwards('it we we engine') == 'engine'\nassert backwards('at we python a planet is coffee summer') == 'summer|coffee|planet|python'\nassert backwards('apple desert orange we brain signal orange orange') == 'orange|orange|signal|brain|orange|desert|apple'\nassert backwards('') == ''\nassert backwards('window brain cloud orange cloud') == 'cloud|orange|cloud|brain|window'\nassert backwards('garden on we engine is apple by') == 'apple|engine|garden'", "answer": "def backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `backwards('matrix coffee signal coffee')` يُرجع `'coffee|signal|coffee|matrix'`.\nالجواب:", "qhash": "14bbd31421f0b78c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'كتاب نهار'\nprint(s.split())\nprint(s.find('س'))\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'كتاب نهار'\nprint(s.split())\nprint(s.find('س'))\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "aff3fbd037f97ae1", "answer": "['كتاب', 'نهار']\n-1\nكتاب-نهار", "completion": " الناتج:\n```text\n['كتاب', 'نهار']\n-1\nكتاب-نهار\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11", "tests": ["assert multi_fact(12) == 1", "assert multi_fact(34) == 0", "assert multi_fact(9) == 10", "assert multi_fact(26) == 0", "assert multi_fact(59) == 0", "assert multi_fact(8) == 10", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(12) == 1\nassert multi_fact(34) == 0\nassert multi_fact(9) == 10\nassert multi_fact(26) == 0\nassert multi_fact(59) == 0\nassert multi_fact(8) == 10\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(12)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d0fc2abe5b598535"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([15, 67, 18, 2, 4, 66, 27, 36, 24]) == [15, 82, 100, 102, 106, 0, 27, 63, 87]", "assert rolling_total([-9, 57, 106, 33, 82, 113]) == [-9, 48, 0, 33, 115, 0]", "assert rolling_total([101]) == [101]", "assert rolling_total([12, 63, 108, 65, 80, 108, 7, -4]) == [12, 75, 0, 65, 0, 108, 115, 111]", "assert rolling_total([16, 28, 0, 103, 99, 49, 89, -8]) == [16, 44, 44, 0, 99, 0, 89, 81]", "assert rolling_total([-10, 73, 75]) == [-10, 63, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([15, 67, 18, 2, 4, 66, 27, 36, 24]) == [15, 82, 100, 102, 106, 0, 27, 63, 87]\nassert rolling_total([-9, 57, 106, 33, 82, 113]) == [-9, 48, 0, 33, 115, 0]\nassert rolling_total([101]) == [101]\nassert rolling_total([12, 63, 108, 65, 80, 108, 7, -4]) == [12, 75, 0, 65, 0, 108, 115, 111]\nassert rolling_total([16, 28, 0, 103, 99, 49, 89, -8]) == [16, 44, 44, 0, 99, 0, 89, 81]\nassert rolling_total([-10, 73, 75]) == [-10, 63, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\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 > 128:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 128 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([15, 67, 18, 2, 4, 66, 27, 36, 24])` يجب أن تُرجع `[15, 82, 100, 102, 106, 0, 27, 63, 87]`.\nالجواب:", "qhash": "0f3b8860c25fcd76"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 58247\nc = 0\nwhile m > 2:\n m = m // 4\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 58247\nc = 0\nwhile m > 2:\n m = m // 4\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "af908b6df91c9218", "answer": "0 8", "completion": " الناتج:\n```text\n0 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'pixel'\nprint(name.capitalize())\nprint(name.index('l') + len(name))\nprint(name.count('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'pixel'\nprint(name.capitalize())\nprint(name.index('l') + len(name))\nprint(name.count('l'))\n```\nالجواب:", "qhash": "c43e087241687528", "answer": "Pixel\n9\n1", "completion": " الناتج:\n```text\nPixel\n9\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(22) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9', 'Sun', '11', '12', '13', '14', 'Sun', 'Moon', '17', '18', '19', 'Sun', '21', '22']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(7) == ['1', '2', '3', '4', 'Sun', '6', '7']", "assert fizzbuzz(9) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9']", "assert fizzbuzz(21) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9', 'Sun', '11', '12', '13', '14', 'Sun', 'Moon', '17', '18', '19', 'Sun', '21']"], "test_code": "assert fizzbuzz(22) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9', 'Sun', '11', '12', '13', '14', 'Sun', 'Moon', '17', '18', '19', 'Sun', '21', '22']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(7) == ['1', '2', '3', '4', 'Sun', '6', '7']\nassert fizzbuzz(9) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9']\nassert fizzbuzz(21) == ['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9', 'Sun', '11', '12', '13', '14', 'Sun', 'Moon', '17', '18', '19', 'Sun', '21']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Sun'\n if i % 8 == 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 % 5 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Sun'، وإن قَبِلها على 8 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(22)` يُرجع `['1', '2', '3', '4', 'Sun', '6', '7', 'Moon', '9', 'Sun', '11', '12', '13', '14', 'Sun', 'Moon', '17', '18', '19', 'Sun', '21', '22']`.\nالجواب:", "qhash": "4cfb4c47f842cdd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 89", "tests": ["assert rec_prod(6) == 48", "assert rec_prod(52) == 14", "assert rec_prod(22) == 33", "assert rec_prod(39) == 8", "assert rec_prod(13) == 33", "assert rec_prod(38) == 4", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 48\nassert rec_prod(52) == 14\nassert rec_prod(22) == 33\nassert rec_prod(39) == 8\nassert rec_prod(13) == 33\nassert rec_prod(38) == 4\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 89", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(6)` يُرجع `48`.\nالجواب:", "qhash": "73b9193a40e5441d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('سعيد', 61), ('حسن', 71), ('فيصل', 71), ('خالد', 100)]\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), ('حسن', 71), ('فيصل', 71), ('خالد', 100)]\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": "723b06865949397e", "answer": "[('سعيد', 61), ('حسن', 71), ('فيصل', 71), ('خالد', 100)]\n['خالد', 'حسن']", "completion": " الناتج:\n```text\n[('سعيد', 61), ('حسن', 71), ('فيصل', 71), ('خالد', 100)]\n['خالد', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'عمل'\nprint(w.find('ل'))\nprint('ل' in w)\nprint(w[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'عمل'\nprint(w.find('ل'))\nprint('ل' in w)\nprint(w[-1])\n```\nالجواب:", "qhash": "19659aab6a200872", "answer": "2\nTrue\nل", "completion": " الناتج:\n```text\n2\nTrue\nل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(247) == 6132", "assert multiples_total(81) == 684", "assert multiples_total(172) == 3150", "assert multiples_total(255) == 6634", "assert multiples_total(291) == 8562", "assert multiples_total(170) == 2809", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(247) == 6132\nassert multiples_total(81) == 684\nassert multiples_total(172) == 3150\nassert multiples_total(255) == 6634\nassert multiples_total(291) == 8562\nassert multiples_total(170) == 2809\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(247)` يُرجع `6132`.\nالجواب:", "qhash": "4fddfa49f1fe4a87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 997", "tests": ["assert multi_fact(10) == 120", "assert multi_fact(24) == 991", "assert multi_fact(6) == 12", "assert multi_fact(18) == 330", "assert multi_fact(36) == 879", "assert multi_fact(37) == 449", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(10) == 120\nassert multi_fact(24) == 991\nassert multi_fact(6) == 12\nassert multi_fact(18) == 330\nassert multi_fact(36) == 879\nassert multi_fact(37) == 449\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 997", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(10)` يُرجع `120`.\nالجواب:", "qhash": "db5b13345484b2e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 78", "tests": ["assert pow_digits(63947) == 65", "assert pow_digits(315708) == 28", "assert pow_digits(925427) == 47", "assert pow_digits(405859) == 73", "assert pow_digits(625055) == 67", "assert pow_digits(187679) == 64", "assert pow_digits(792789) == 40", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(63947) == 65\nassert pow_digits(315708) == 28\nassert pow_digits(925427) == 47\nassert pow_digits(405859) == 73\nassert pow_digits(625055) == 67\nassert pow_digits(187679) == 64\nassert pow_digits(792789) == 40\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 78", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 78\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 78.\nمثال: `pow_digits(63947)` يجب أن تُرجع `65`.\nالجواب:", "qhash": "034354b7b68fc5bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [5, 25, -14, 8, 17]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [5, 25, -14, 8, 17]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "cb3f8b02d6fa29a4", "answer": "[25, 17, 8, 5, -14]\n[25, 17, 8]", "completion": " الناتج:\n```text\n[25, 17, 8, 5, -14]\n[25, 17, 8]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 54542\nc = 0\nwhile x > 1:\n x = x // 7\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 54542\nc = 0\nwhile x > 1:\n x = x // 7\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "e610ef748f194ee9", "answer": "0 6", "completion": " الناتج:\n```text\n0 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سوق حاسوب نهار طالب') == 1", "assert count_start('نهار بيت تفاحة نهر') == 2", "assert count_start('كتاب مطر طالب') == 0", "assert count_start('نور نور بيت طالب حاسوب سفينة') == 2", "assert count_start('علم فجر طائرة نور سوق نهار نور') == 3", "assert count_start('نور عربية قمر') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('سوق حاسوب نهار طالب') == 1\nassert count_start('نهار بيت تفاحة نهر') == 2\nassert count_start('كتاب مطر طالب') == 0\nassert count_start('نور نور بيت طالب حاسوب سفينة') == 2\nassert count_start('علم فجر طائرة نور سوق نهار نور') == 3\nassert count_start('نور عربية قمر') == 1\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('سوق حاسوب نهار طالب')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d330dee60196ac26"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 35516\ncount = 0\nwhile x > 6:\n x = x // 7\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 35516\ncount = 0\nwhile x > 6:\n x = x // 7\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "eef9f0eb57d5bd42", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [32, 0, -2, -3, 23, 7]\nprint(nums[2:3])\nprint(nums[::2])\nprint(len(nums[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [32, 0, -2, -3, 23, 7]\nprint(nums[2:3])\nprint(nums[::2])\nprint(len(nums[2:3]))\n```\nالجواب:", "qhash": "55b0b1d4263f7a00", "answer": "[-2]\n[32, -2, 23]\n1", "completion": " الناتج:\n```text\n[-2]\n[32, -2, 23]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 159\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 = 159\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": "9ecdce13feaea39e", "answer": "54", "completion": " الناتج:\n```text\n54\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ش'))", "tests": ["assert letter_count('كتاب ماء ماء باب') == 0", "assert letter_count('') == 0", "assert letter_count('قمر جبل جبل معلم شمس طائرة رمل') == 1", "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('كتاب ماء ماء باب') == 0\nassert letter_count('') == 0\nassert letter_count('قمر جبل جبل معلم شمس طائرة رمل') == 1\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 w.startswith('ش'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ش'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_count(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ش»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('كتاب ماء ماء باب')` يُرجع `0`.\nالجواب:", "qhash": "a4ff4370301ff279"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'or'}", "tests": ["assert freq_of('cloud in garden to window vector') == {'o': 4, 'r': 2}", "assert freq_of('at apple camel orange up') == {'o': 1, 'r': 1}", "assert freq_of('on engine a up river stone') == {'o': 2, 'r': 2}", "assert freq_of('garden') == {'o': 0, 'r': 1}", "assert freq_of('a table window banana') == {'o': 1, 'r': 0}", "assert freq_of('matrix at python engine') == {'o': 1, 'r': 1}", "assert freq_of('') == {'o': 0, 'r': 0}"], "test_code": "assert freq_of('cloud in garden to window vector') == {'o': 4, 'r': 2}\nassert freq_of('at apple camel orange up') == {'o': 1, 'r': 1}\nassert freq_of('on engine a up river stone') == {'o': 2, 'r': 2}\nassert freq_of('garden') == {'o': 0, 'r': 1}\nassert freq_of('a table window banana') == {'o': 1, 'r': 0}\nassert freq_of('matrix at python engine') == {'o': 1, 'r': 1}\nassert freq_of('') == {'o': 0, 'r': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'or'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'or'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'o'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('cloud in garden to window vector')` يجب أن تُرجع `{'o': 4, 'r': 2}`.\nالجواب:", "qhash": "87b7629b5f57a9c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(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 only_div([32, 30, 65, 66, 52, 50, 53, 40, 35, 16, 5]) == 5", "assert only_div([10, -31, 15]) == 1", "assert only_div([1, 29, 56, 57]) == 1", "assert only_div([-39, 33, 82, 38, 70, 84, -37, 60, 86, -29, -3, -11]) == 4", "assert only_div([9, -10, 60, -26, 51, -12, 71, 23, 70, -32]) == 4", "assert only_div([-24, 18, -37, 86, 37]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([32, 30, 65, 66, 52, 50, 53, 40, 35, 16, 5]) == 5\nassert only_div([10, -31, 15]) == 1\nassert only_div([1, 29, 56, 57]) == 1\nassert only_div([-39, 33, 82, 38, 70, 84, -37, 60, 86, -29, -3, -11]) == 4\nassert only_div([9, -10, 60, -26, 51, -12, 71, 23, 70, -32]) == 4\nassert only_div([-24, 18, -37, 86, 37]) == 1\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([32, 30, 65, 66, 52, 50, 53, 40, 35, 16, 5])` يُرجع `5`.\nالجواب:", "qhash": "b4496347a028753f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 89:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([36, 24, 1, 2, 29, 22, 18]) == [36, 60, 61, 63, 0, 22, 40]", "assert capped_cumsum([68, 6, 52, 60, 55, 66]) == [68, 74, 0, 60, 0, 66]", "assert capped_cumsum([44, 16, -1, 5, -2]) == [44, 60, 59, 64, 62]", "assert capped_cumsum([56, 51, 58, 34, 37, 39, 2, 31]) == [56, 0, 58, 0, 37, 76, 78, 0]", "assert capped_cumsum([19, 79, -6, 70, 51]) == [19, 0, -6, 64, 0]", "assert capped_cumsum([19, 45, 88, 63, 39, 8, 25, 14]) == [19, 64, 0, 63, 0, 8, 33, 47]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([36, 24, 1, 2, 29, 22, 18]) == [36, 60, 61, 63, 0, 22, 40]\nassert capped_cumsum([68, 6, 52, 60, 55, 66]) == [68, 74, 0, 60, 0, 66]\nassert capped_cumsum([44, 16, -1, 5, -2]) == [44, 60, 59, 64, 62]\nassert capped_cumsum([56, 51, 58, 34, 37, 39, 2, 31]) == [56, 0, 58, 0, 37, 76, 78, 0]\nassert capped_cumsum([19, 79, -6, 70, 51]) == [19, 0, -6, 64, 0]\nassert capped_cumsum([19, 45, 88, 63, 39, 8, 25, 14]) == [19, 64, 0, 63, 0, 8, 33, 47]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 89:\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 > 89:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 89 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([36, 24, 1, 2, 29, 22, 18])` يُرجع `[36, 60, 61, 63, 0, 22, 40]`.\nالجواب:", "qhash": "0880068d5b3e3e59"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'ليلى': 34, 'منى': 39, 'عمر': 41, 'علي': 17, 'مريم': 5}\nmarks['عمر'] += 5\nmarks['زينب'] = 8\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'ليلى': 34, 'منى': 39, 'عمر': 41, 'علي': 17, 'مريم': 5}\nmarks['عمر'] += 5\nmarks['زينب'] = 8\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('باسل', -1))\n```\nالجواب:", "qhash": "b842cb0d3bb43374", "answer": "6\nعمر\n149\n-1", "completion": " الناتج:\n```text\n6\nعمر\n149\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_sel([63, 9, 49, 60, 28, 58, 33, 90, 90]) == 2", "assert count_sel([-7, 29, 48, -6, 43]) == 0", "assert count_sel([23, -7, -19]) == 0", "assert count_sel([11, 72, 35]) == 0", "assert count_sel([-8, 67, -26, 61, -5, 61, 65, 82, -33, 87, -2, -24]) == 4", "assert count_sel([4, -31, 26, -22, -38, 12, 26, 26, 80, -15]) == 7", "assert count_sel([]) == 0"], "test_code": "assert count_sel([63, 9, 49, 60, 28, 58, 33, 90, 90]) == 2\nassert count_sel([-7, 29, 48, -6, 43]) == 0\nassert count_sel([23, -7, -19]) == 0\nassert count_sel([11, 72, 35]) == 0\nassert count_sel([-8, 67, -26, 61, -5, 61, 65, 82, -33, 87, -2, -24]) == 4\nassert count_sel([4, -31, 26, -22, -38, 12, 26, 26, 80, -15]) == 7\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 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 % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([63, 9, 49, 60, 28, 58, 33, 90, 90])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "ecbcac4ce6ec74ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 73) == 1)", "tests": ["assert rel_prime_count(139) == 138", "assert rel_prime_count(69) == 69", "assert rel_prime_count(21) == 21", "assert rel_prime_count(64) == 64", "assert rel_prime_count(166) == 164", "assert rel_prime_count(23) == 23", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(139) == 138\nassert rel_prime_count(69) == 69\nassert rel_prime_count(21) == 21\nassert rel_prime_count(64) == 64\nassert rel_prime_count(166) == 164\nassert rel_prime_count(23) == 23\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, 73) == 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, 73) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 73) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(139)` يُرجع `138`.\nالجواب:", "qhash": "61ae3549a3db2936"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 5 * x ** 2 + (6) * x + (1)", "tests": ["assert poly(4) == 105", "assert poly(-4) == 57", "assert poly(-12) == 649", "assert poly(12) == 793", "assert poly(5) == 156", "assert poly(6) == 217", "assert poly(-15) == 1036", "assert poly(0) == 1"], "test_code": "assert poly(4) == 105\nassert poly(-4) == 57\nassert poly(-12) == 649\nassert poly(12) == 793\nassert poly(5) == 156\nassert poly(6) == 217\nassert poly(-15) == 1036\nassert poly(0) == 1", "answer": "def poly(x):\n return 5 * x ** 2 + (6) * x + (1)", "completion": " ```python\ndef poly(x):\n return 5 * x ** 2 + (6) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 5x² + 6x + 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(4)` يُرجع `105`.\nالجواب:", "qhash": "2fee34d1d3e00c29"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'طائرة'\nprint('ت' in kalima)\nprint(kalima.split())\nprint(kalima.count('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'طائرة'\nprint('ت' in kalima)\nprint(kalima.split())\nprint(kalima.count('ت'))\n```\nالجواب:", "qhash": "68603876f8f5792c", "answer": "False\n['طائرة']\n0", "completion": " الناتج:\n```text\nFalse\n['طائرة']\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=4):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(12))\nprint(g(12, 11))\nprint(g(g(11), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=4):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(12))\nprint(g(12, 11))\nprint(g(g(11), 12))\n```\nالجواب:", "qhash": "175277a478dda935", "answer": "32\n25\n75", "completion": " الناتج:\n```text\n32\n25\n75\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 15\nfor x in range(1, 10, 1):\n total += x * 7\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 15\nfor x in range(1, 10, 1):\n total += x * 7\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "a08176217c63b237", "answer": "330\n9", "completion": " الناتج:\n```text\n330\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=0):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(16))\nprint(g(16, 1))\nprint(g(g(1), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=0):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(g(16))\nprint(g(16, 1))\nprint(g(g(1), 16))\n```\nالجواب:", "qhash": "c1bbf5630b98a828", "answer": "80\n79\n85", "completion": " الناتج:\n```text\n80\n79\n85\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= 2)", "tests": ["assert clip_scale([-14, -11, -19, 3, -8]) == [-8]", "assert clip_scale([25, -24, -29]) == []", "assert clip_scale([25, -9, 18, -24, -20]) == [-9]", "assert clip_scale([-22, 13, 36]) == []", "assert clip_scale([-23, -4]) == [-4]", "assert clip_scale([46, -5, 50, 15, 37, 41]) == [-5]", "assert clip_scale([40, -25, 4]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-14, -11, -19, 3, -8]) == [-8]\nassert clip_scale([25, -24, -29]) == []\nassert clip_scale([25, -9, 18, -24, -20]) == [-9]\nassert clip_scale([-22, 13, 36]) == []\nassert clip_scale([-23, -4]) == [-4]\nassert clip_scale([46, -5, 50, 15, 37, 41]) == [-5]\nassert clip_scale([40, -25, 4]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= 2)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= 2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و2 (شاملًا الطرفين) في 1.\nمثال: `clip_scale([-14, -11, -19, 3, -8])` يجب أن تُرجع `[-8]`.\nالجواب:", "qhash": "27699f2e105c8070"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if 19 <= x <= 41)", "tests": ["assert between_times([13, 29, 20, 29]) == [20, 29, 29]", "assert between_times([-10, -30, 35, 23, 48]) == [23, 35]", "assert between_times([30, -5, -19, 59, 60]) == [30]", "assert between_times([15, -11, -9, 24, 38, -6, 47, 10]) == [24, 38]", "assert between_times([44, 5, -29, 50, -13, 13, 24, 30]) == [24, 30]", "assert between_times([3, 21, -13, -15, 49, 3, -24, -12]) == [21]", "assert between_times([2, -6, 8, 1, 9, -4, 41]) == [41]", "assert between_times([]) == []"], "test_code": "assert between_times([13, 29, 20, 29]) == [20, 29, 29]\nassert between_times([-10, -30, 35, 23, 48]) == [23, 35]\nassert between_times([30, -5, -19, 59, 60]) == [30]\nassert between_times([15, -11, -9, 24, 38, -6, 47, 10]) == [24, 38]\nassert between_times([44, 5, -29, 50, -13, 13, 24, 30]) == [24, 30]\nassert between_times([3, 21, -13, -15, 49, 3, -24, -12]) == [21]\nassert between_times([2, -6, 8, 1, 9, -4, 41]) == [41]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if 19 <= x <= 41)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if 19 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 19 و41 (شاملًا الطرفين) في 1.\nمثال: `between_times([13, 29, 20, 29])` يجب أن تُرجع `[20, 29, 29]`.\nالجواب:", "qhash": "9a4e8a0ceb18963a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "tests": ["assert weighted_sum(8) == 617760", "assert weighted_sum(9) == 1208250", "assert weighted_sum(12) == 6307080", "assert weighted_sum(11) == 3818760", "assert weighted_sum(2) == 330", "assert weighted_sum(1) == 10", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 617760\nassert weighted_sum(9) == 1208250\nassert weighted_sum(12) == 6307080\nassert weighted_sum(11) == 3818760\nassert weighted_sum(2) == 330\nassert weighted_sum(1) == 10\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 10 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 5\n return total\n```\nمثال: `weighted_sum(8)` يجب أن تُرجع `617760`.\nالجواب:", "qhash": "effebde1b17c1a3c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [-3, -1, 6, -1, 37, -4]\nprint(nums[2:6])\nprint(nums[::-1])\nprint(min(nums[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-3, -1, 6, -1, 37, -4]\nprint(nums[2:6])\nprint(nums[::-1])\nprint(min(nums[2:6]))\n```\nالجواب:", "qhash": "ee1385b51b9ead6b", "answer": "[6, -1, 37, -4]\n[-4, 37, -1, 6, -1, -3]\n-4", "completion": " الناتج:\n```text\n[6, -1, 37, -4]\n[-4, 37, -1, 6, -1, -3]\n-4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('in desert a') == 'desert'", "assert rev_long_words('music falcon river') == 'river,falcon,music'", "assert rev_long_words('vector winter orange on go rocket') == 'rocket,orange,winter,vector'", "assert rev_long_words('pixel brain we') == 'brain,pixel'", "assert rev_long_words('at in code light table stone desert') == 'desert,stone,table,light'", "assert rev_long_words('river python window data') == 'window,python,river'", "assert rev_long_words('river') == 'river'"], "test_code": "assert rev_long_words('in desert a') == 'desert'\nassert rev_long_words('music falcon river') == 'river,falcon,music'\nassert rev_long_words('vector winter orange on go rocket') == 'rocket,orange,winter,vector'\nassert rev_long_words('pixel brain we') == 'brain,pixel'\nassert rev_long_words('at in code light table stone desert') == 'desert,stone,table,light'\nassert rev_long_words('river python window data') == 'window,python,river'\nassert rev_long_words('river') == 'river'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_long_words('in desert a')` يُرجع `'desert'`.\nالجواب:", "qhash": "4156f8aaac11d2d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'قهوة شمس'\nprint(kalima[::-1])\nprint(len(kalima.replace(' ', '')))\nprint(kalima.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'قهوة شمس'\nprint(kalima[::-1])\nprint(len(kalima.replace(' ', '')))\nprint(kalima.split())\n```\nالجواب:", "qhash": "7a338a2be76455a9", "answer": "سمش ةوهق\n7\n['قهوة', 'شمس']", "completion": " الناتج:\n```text\nسمش ةوهق\n7\n['قهوة', 'شمس']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert play(8) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red']", "assert play(25) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17', 'RedBlue', '19', 'Red', '21', 'Red', '23', 'RedBlue', '25']", "assert play(2) == ['1', 'Red']", "assert play(4) == ['1', 'Red', '3', 'Red']", "assert play(4) == ['1', 'Red', '3', 'Red']"], "test_code": "assert play(8) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red']\nassert play(25) == ['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'Red', '17', 'RedBlue', '19', 'Red', '21', 'Red', '23', 'RedBlue', '25']\nassert play(2) == ['1', 'Red']\nassert play(4) == ['1', 'Red', '3', 'Red']\nassert play(4) == ['1', 'Red', '3', 'Red']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(8)` يُرجع `['1', 'Red', '3', 'Red', '5', 'RedBlue', '7', 'Red']`.\nالجواب:", "qhash": "29df4f08663f277e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'acdi'}", "tests": ["assert tally('river') == {'a': 0, 'c': 0, 'd': 0, 'i': 1}", "assert tally('cloud rocket cloud pixel desert') == {'a': 0, 'c': 3, 'd': 3, 'i': 1}", "assert tally('apple go we up is') == {'a': 1, 'c': 0, 'd': 0, 'i': 1}", "assert tally('vector pixel') == {'a': 0, 'c': 1, 'd': 0, 'i': 1}", "assert tally('vector to apple in is in') == {'a': 1, 'c': 1, 'd': 0, 'i': 3}", "assert tally('is a go engine pixel signal') == {'a': 2, 'c': 0, 'd': 0, 'i': 4}", "assert tally('') == {'a': 0, 'c': 0, 'd': 0, 'i': 0}"], "test_code": "assert tally('river') == {'a': 0, 'c': 0, 'd': 0, 'i': 1}\nassert tally('cloud rocket cloud pixel desert') == {'a': 0, 'c': 3, 'd': 3, 'i': 1}\nassert tally('apple go we up is') == {'a': 1, 'c': 0, 'd': 0, 'i': 1}\nassert tally('vector pixel') == {'a': 0, 'c': 1, 'd': 0, 'i': 1}\nassert tally('vector to apple in is in') == {'a': 1, 'c': 1, 'd': 0, 'i': 3}\nassert tally('is a go engine pixel signal') == {'a': 2, 'c': 0, 'd': 0, 'i': 4}\nassert tally('') == {'a': 0, 'c': 0, 'd': 0, 'i': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'acdi'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'acdi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'c'، 'd'، 'i' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('river')` يجب أن تُرجع `{'a': 0, 'c': 0, 'd': 0, 'i': 1}`.\nالجواب:", "qhash": "9a610e6e9f025665"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return -7 * x ** 2 + (-4) * x + (4)", "tests": ["assert value_at(3) == -71", "assert value_at(-3) == -47", "assert value_at(16) == -1852", "assert value_at(2) == -32", "assert value_at(8) == -476", "assert value_at(0) == 4", "assert value_at(-5) == -151", "assert value_at(0) == 4"], "test_code": "assert value_at(3) == -71\nassert value_at(-3) == -47\nassert value_at(16) == -1852\nassert value_at(2) == -32\nassert value_at(8) == -476\nassert value_at(0) == 4\nassert value_at(-5) == -151\nassert value_at(0) == 4", "answer": "def value_at(x):\n return -7 * x ** 2 + (-4) * x + (4)", "completion": " ```python\ndef value_at(x):\n return -7 * x ** 2 + (-4) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار -7x² - 4x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(3)` يُرجع `-71`.\nالجواب:", "qhash": "3cd5c07646806277"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'signal'\nprint(text.upper())\nprint(len(text))\nprint(text.find('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'signal'\nprint(text.upper())\nprint(len(text))\nprint(text.find('l'))\n```\nالجواب:", "qhash": "1cbb2fe3cf21e313", "answer": "SIGNAL\n6\n5", "completion": " الناتج:\n```text\nSIGNAL\n6\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('يوسف', 20), ('رنا', 71), ('باسل', 71), ('ليلى', 54)]\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 = [('يوسف', 20), ('رنا', 71), ('باسل', 71), ('ليلى', 54)]\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": "b608eebe555b9730", "answer": "[('يوسف', 20), ('ليلى', 54), ('باسل', 71), ('رنا', 71)]\n['باسل', 'رنا']", "completion": " الناتج:\n```text\n[('يوسف', 20), ('ليلى', 54), ('باسل', 71), ('رنا', 71)]\n['باسل', 'رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert turn_list([33, 17, 47, 48]) == [33, 17, 47, 48]", "assert turn_list([47, 50, 12, 38, 41, -5, -9, 36, 38, -1, 10]) == [38, -1, 10, 47, 50, 12, 38, 41, -5, -9, 36]", "assert turn_list([37, 7, -7, 3]) == [37, 7, -7, 3]", "assert turn_list([-4, -1, 8, -9, 15, 3]) == [8, -9, 15, 3, -4, -1]", "assert turn_list([15, -4, 26]) == [26, 15, -4]", "assert turn_list([0]) == [0]", "assert turn_list([]) == []"], "test_code": "assert turn_list([33, 17, 47, 48]) == [33, 17, 47, 48]\nassert turn_list([47, 50, 12, 38, 41, -5, -9, 36, 38, -1, 10]) == [38, -1, 10, 47, 50, 12, 38, 41, -5, -9, 36]\nassert turn_list([37, 7, -7, 3]) == [37, 7, -7, 3]\nassert turn_list([-4, -1, 8, -9, 15, 3]) == [8, -9, 15, 3, -4, -1]\nassert turn_list([15, -4, 26]) == [26, 15, -4]\nassert turn_list([0]) == [0]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 8 % len(xs)\n return ____\n```\nمثال: `turn_list([33, 17, 47, 48])` يجب أن تُرجع `[33, 17, 47, 48]`.\nالجواب:", "qhash": "ebf4de8f3dd25e30"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 11\nfor n in range(-2, 10, 2):\n s -= n * 1\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 11\nfor n in range(-2, 10, 2):\n s -= n * 1\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "4bf1bedac1d3d616", "answer": "-7\n8", "completion": " الناتج:\n```text\n-7\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return items[k:] + items[:k]", "tests": ["assert shift_list([36, 48, 0, 34, 6]) == [6, 36, 48, 0, 34]", "assert shift_list([46, 26, 31, 11, -7, 47, 47, 50, 1, 14, 30, 37]) == [-7, 47, 47, 50, 1, 14, 30, 37, 46, 26, 31, 11]", "assert shift_list([46, 28, 7, 22, 21, 1]) == [21, 1, 46, 28, 7, 22]", "assert shift_list([16, 16, 34, 48, 36, 9, -9, 28, 23, 46]) == [36, 9, -9, 28, 23, 46, 16, 16, 34, 48]", "assert shift_list([5, 13, -1, 14, 6]) == [6, 5, 13, -1, 14]", "assert shift_list([10, -2, 29]) == [-2, 29, 10]", "assert shift_list([]) == []"], "test_code": "assert shift_list([36, 48, 0, 34, 6]) == [6, 36, 48, 0, 34]\nassert shift_list([46, 26, 31, 11, -7, 47, 47, 50, 1, 14, 30, 37]) == [-7, 47, 47, 50, 1, 14, 30, 37, 46, 26, 31, 11]\nassert shift_list([46, 28, 7, 22, 21, 1]) == [21, 1, 46, 28, 7, 22]\nassert shift_list([16, 16, 34, 48, 36, 9, -9, 28, 23, 46]) == [36, 9, -9, 28, 23, 46, 16, 16, 34, 48]\nassert shift_list([5, 13, -1, 14, 6]) == [6, 5, 13, -1, 14]\nassert shift_list([10, -2, 29]) == [-2, 29, 10]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 4 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([36, 48, 0, 34, 6])` يُرجع `[6, 36, 48, 0, 34]`.\nالجواب:", "qhash": "b341384baede39e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'شمس'\nprint(kalima[::-1])\nprint(kalima.split())\nprint('س' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'شمس'\nprint(kalima[::-1])\nprint(kalima.split())\nprint('س' in kalima)\n```\nالجواب:", "qhash": "de72d6da66560f7b", "answer": "سمش\n['شمس']\nTrue", "completion": " الناتج:\n```text\nسمش\n['شمس']\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 9) // 4 for x in range(-3, 2) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 9) // 4 for x in range(-3, 2) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a4d920e871cc26bc", "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#0", "code": "def go(n):\n if n <= 0:\n return 1\n return 3 * go(n - 1) + 0\n\nprint(go(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 0:\n return 1\n return 3 * go(n - 1) + 0\n\nprint(go(5))\n```\nالجواب:", "qhash": "b8f0ad9f52722f3d", "answer": "243", "completion": " الناتج:\n```text\n243\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 24) == 1)", "tests": ["assert phi_upto(23) == 8", "assert phi_upto(27) == 9", "assert phi_upto(5) == 2", "assert phi_upto(94) == 31", "assert phi_upto(141) == 47", "assert phi_upto(61) == 21", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(23) == 8\nassert phi_upto(27) == 9\nassert phi_upto(5) == 2\nassert phi_upto(94) == 31\nassert phi_upto(141) == 47\nassert phi_upto(61) == 21\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, 24) == 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, 24) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 24) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(23)` يُرجع `8`.\nالجواب:", "qhash": "a8530c80e4274cdc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('تفاحة برتقال مدرسة مدينة عربية قلم') == 0", "assert prefix_hits('ليل لغة سيارة نهار بيت حاسوب برمجة') == 2", "assert prefix_hits('شجرة حاسوب لغة سوق صديق حصان') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حديقة باب شمس صحراء ليل قمر') == 1\nassert prefix_hits('لغة وردة شمس مدينة قمر') == 1\nassert prefix_hits('مدرسة علم كتاب ماء لغة نهر لغة') == 2\nassert prefix_hits('تفاحة برتقال مدرسة مدينة عربية قلم') == 0\nassert prefix_hits('ليل لغة سيارة نهار بيت حاسوب برمجة') == 2\nassert prefix_hits('شجرة حاسوب لغة سوق صديق حصان') == 1\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": "02f8ac8fff6a56e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert add_multiples(98) == 939", "assert add_multiples(136) == 1643", "assert add_multiples(189) == 3258", "assert add_multiples(232) == 4928", "assert add_multiples(167) == 2550", "assert add_multiples(157) == 2225", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(98) == 939\nassert add_multiples(136) == 1643\nassert add_multiples(189) == 3258\nassert add_multiples(232) == 4928\nassert add_multiples(167) == 2550\nassert add_multiples(157) == 2225\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(98)` يُرجع `939`.\nالجواب:", "qhash": "cd7507a8f0977394"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 1 * x ** 2 + (6) * x + (3)", "tests": ["assert value_at(6) == 75", "assert value_at(13) == 250", "assert value_at(11) == 190", "assert value_at(7) == 94", "assert value_at(19) == 478", "assert value_at(15) == 318", "assert value_at(3) == 30", "assert value_at(0) == 3"], "test_code": "assert value_at(6) == 75\nassert value_at(13) == 250\nassert value_at(11) == 190\nassert value_at(7) == 94\nassert value_at(19) == 478\nassert value_at(15) == 318\nassert value_at(3) == 30\nassert value_at(0) == 3", "answer": "def value_at(x):\n return 1 * x ** 2 + (6) * x + (3)", "completion": " ```python\ndef value_at(x):\n return 1 * x ** 2 + (6) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 1x² + 6x + 3 عند العدد الصحيح x.\nمثال: `value_at(6)` يجب أن تُرجع `75`.\nالجواب:", "qhash": "cdad5adecdcc6b89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('ق')", "tests": ["assert tally_letter('بيت شمس نور دفتر رمل رمل معلم') == 0", "assert tally_letter('تفاحة حديقة بحر') == 1", "assert tally_letter('فجر') == 0", "assert tally_letter('جبل برتقال سيارة سفينة رمل شجرة حصان') == 1", "assert tally_letter('حديقة حديقة برتقال سماء برمجة مدينة برمجة') == 3", "assert tally_letter('برتقال كتاب قلم دفتر جمل') == 2", "assert tally_letter('قلم لغة علم ماء طالب نهار شمس') == 1", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('بيت شمس نور دفتر رمل رمل معلم') == 0\nassert tally_letter('تفاحة حديقة بحر') == 1\nassert tally_letter('فجر') == 0\nassert tally_letter('جبل برتقال سيارة سفينة رمل شجرة حصان') == 1\nassert tally_letter('حديقة حديقة برتقال سماء برمجة مدينة برمجة') == 3\nassert tally_letter('برتقال كتاب قلم دفتر جمل') == 2\nassert tally_letter('قلم لغة علم ماء طالب نهار شمس') == 1\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n return text.count('ق')", "completion": " ```python\ndef tally_letter(text):\n return text.count('ق')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `tally_letter(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ق» في النص.\nمثال: `tally_letter('بيت شمس نور دفتر رمل رمل معلم')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "465b476aba4612d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 89", "tests": ["assert prod_mod(11) == 33", "assert prod_mod(16) == 41", "assert prod_mod(4) == 24", "assert prod_mod(48) == 34", "assert prod_mod(10) == 3", "assert prod_mod(10) == 3", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(11) == 33\nassert prod_mod(16) == 41\nassert prod_mod(4) == 24\nassert prod_mod(48) == 34\nassert prod_mod(10) == 3\nassert prod_mod(10) == 3\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 89", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(11)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "54630e6aeca0efa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=5):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-7))\nprint(calc(-7, 11))\nprint(calc(calc(11), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(-7))\nprint(calc(-7, 11))\nprint(calc(calc(11), -7))\n```\nالجواب:", "qhash": "85be2da9feba2d5d", "answer": "8\n26\n91", "completion": " الناتج:\n```text\n8\n26\n91\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'خالد': 9, 'باسل': 3, 'سعيد': 22, 'زينب': 34}\nd['باسل'] += 2\nd['فيصل'] = 6\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 = {'خالد': 9, 'باسل': 3, 'سعيد': 22, 'زينب': 34}\nd['باسل'] += 2\nd['فيصل'] = 6\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": "f73b187b4f7374c0", "answer": "5\nزينب\n76\n[('باسل', 5), ('فيصل', 6)]", "completion": " الناتج:\n```text\n5\nزينب\n76\n[('باسل', 5), ('فيصل', 6)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 2 + -3 for x in range(2, 11) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 2 + -3 for x in range(2, 11) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "eebbe5d0f2ddbf77", "answer": "[3, 9, 15]\n3 27", "completion": " الناتج:\n```text\n[3, 9, 15]\n3 27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([-10, 16, -10, 22, 53]) == None", "assert max_multiple([-9, -18, -27]) == -9", "assert max_multiple([1]) == None", "assert max_multiple([-15, 8, -20, -31, 6, 26, 4]) == None", "assert max_multiple([5, -6, -29, -38]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-10, 16, -10, 22, 53]) == None\nassert max_multiple([-9, -18, -27]) == -9\nassert max_multiple([1]) == None\nassert max_multiple([-15, 8, -20, -31, 6, 26, 4]) == None\nassert max_multiple([5, -6, -29, -38]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(nums):\n best = 0\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 max_multiple(nums):\n best = 0\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للتوضيح: الاستدعاء `max_multiple([-10, 16, -10, 22, 53])` يُرجع `None`.\nالجواب:", "qhash": "eb7e11565c5f8561"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [-6, 21, 15, 36, 16, 17]\nprint(nums[0:5])\nprint(nums[::2])\nprint(max(nums[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-6, 21, 15, 36, 16, 17]\nprint(nums[0:5])\nprint(nums[::2])\nprint(max(nums[0:5]))\n```\nالجواب:", "qhash": "57ad398664302110", "answer": "[-6, 21, 15, 36, 16]\n[-6, 15, 16]\n36", "completion": " الناتج:\n```text\n[-6, 21, 15, 36, 16]\n[-6, 15, 16]\n36\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 15 == 0)", "tests": ["assert sum_div(141) == 3243", "assert sum_div(226) == 8550", "assert sum_div(167) == 4620", "assert sum_div(21) == 63", "assert sum_div(196) == 6435", "assert sum_div(43) == 315", "assert sum_div(1) == 0"], "test_code": "assert sum_div(141) == 3243\nassert sum_div(226) == 8550\nassert sum_div(167) == 4620\nassert sum_div(21) == 63\nassert sum_div(196) == 6435\nassert sum_div(43) == 315\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 % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 15.\nمثال: `sum_div(141)` يجب أن تُرجع `3243`.\nالجواب:", "qhash": "b360db3ca7c8483e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [24, 2, 38, 7, 23]\nprint(lst[3:4])\nprint(lst[::3])\nprint(len(lst[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [24, 2, 38, 7, 23]\nprint(lst[3:4])\nprint(lst[::3])\nprint(len(lst[3:4]))\n```\nالجواب:", "qhash": "bfb5ef0a3b4ade35", "answer": "[7]\n[24, 7]\n1", "completion": " الناتج:\n```text\n[7]\n[24, 7]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'عمر': 15, 'هدى': 34, 'فيصل': 24}\nd['هدى'] += 20\nd['وليد'] = 5\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 = {'عمر': 15, 'هدى': 34, 'فيصل': 24}\nd['هدى'] += 20\nd['وليد'] = 5\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": "862eb7dbef42ec87", "answer": "4\nهدى\n98\n['هدى']", "completion": " الناتج:\n```text\n4\nهدى\n98\n['هدى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'بحر'\nprint(text.split())\nprint(text.replace(' ', '-'))\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'بحر'\nprint(text.split())\nprint(text.replace(' ', '-'))\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "b1f0b06a3e1951da", "answer": "['بحر']\nبحر\n3", "completion": " الناتج:\n```text\n['بحر']\nبحر\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 10\nfor i in range(1, 11, 1):\n result -= i * 8\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 10\nfor i in range(1, 11, 1):\n result -= i * 8\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "e7e388eb0273b483", "answer": "-430\n10", "completion": " الناتج:\n```text\n-430\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 1:\n return 2\n return 3 * rec(n - 1) + 4\n\nprint(rec(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 1:\n return 2\n return 3 * rec(n - 1) + 4\n\nprint(rec(2))\n```\nالجواب:", "qhash": "26784a769624a293", "answer": "10", "completion": " الناتج:\n```text\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + 2\n\nprint(f(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + 2\n\nprint(f(7))\n```\nالجواب:", "qhash": "661bc7510c6ae8fa", "answer": "404", "completion": " الناتج:\n```text\n404\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(11))\nprint(calc(11, 7))\nprint(calc(calc(7), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(11))\nprint(calc(11, 7))\nprint(calc(calc(7), 11))\n```\nالجواب:", "qhash": "62eaa7f1e762c96a", "answer": "97\n92\n538", "completion": " الناتج:\n```text\n97\n92\n538\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 28:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([13, 14, 18, 16, 11, 13, 9, 4, 19]) == [13, 27, 0, 16, 27, 0, 9, 13, 0]", "assert cumulative([19, 6, 2, 12, 4]) == [19, 25, 27, 0, 4]", "assert cumulative([19, 5, -3, 11, 28]) == [19, 24, 21, 0, 28]", "assert cumulative([19]) == [19]", "assert cumulative([17, 24, 28]) == [17, 0, 28]", "assert cumulative([14, 0, -1, 27, 24, 19, 24, 12, 25, 27]) == [14, 14, 13, 0, 24, 0, 24, 0, 25, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([13, 14, 18, 16, 11, 13, 9, 4, 19]) == [13, 27, 0, 16, 27, 0, 9, 13, 0]\nassert cumulative([19, 6, 2, 12, 4]) == [19, 25, 27, 0, 4]\nassert cumulative([19, 5, -3, 11, 28]) == [19, 24, 21, 0, 28]\nassert cumulative([19]) == [19]\nassert cumulative([17, 24, 28]) == [17, 0, 28]\nassert cumulative([14, 0, -1, 27, 24, 19, 24, 12, 25, 27]) == [14, 14, 13, 0, 24, 0, 24, 0, 25, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 28:\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 > 28:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 28 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([13, 14, 18, 16, 11, 13, 9, 4, 19])` يجب أن تُرجع `[13, 27, 0, 16, 27, 0, 9, 13, 0]`.\nالجواب:", "qhash": "e4baafd0434b41d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "501ad1718142e4fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('أحمد', 33), ('علي', 95), ('سلمى', 2), ('يوسف', 25)]\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 = [('أحمد', 33), ('علي', 95), ('سلمى', 2), ('يوسف', 25)]\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": "86c3698fcbee960c", "answer": "[('سلمى', 2), ('يوسف', 25), ('أحمد', 33), ('علي', 95)]\n['علي', 'أحمد']", "completion": " الناتج:\n```text\n[('سلمى', 2), ('يوسف', 25), ('أحمد', 33), ('علي', 95)]\n['علي', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 35", "tests": ["assert pow_digits(57502) == 27", "assert pow_digits(228853) == 5", "assert pow_digits(834937) == 1", "assert pow_digits(397688) == 16", "assert pow_digits(597621) == 15", "assert pow_digits(219924) == 6", "assert pow_digits(239002) == 24", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(57502) == 27\nassert pow_digits(228853) == 5\nassert pow_digits(834937) == 1\nassert pow_digits(397688) == 16\nassert pow_digits(597621) == 15\nassert pow_digits(219924) == 6\nassert pow_digits(239002) == 24\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 35", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 35\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 35.\nمثال: `pow_digits(57502)` يجب أن تُرجع `27`.\nالجواب:", "qhash": "286d85149b16184c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ك')", "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 text.count('ك')", "completion": " ```python\ndef count_ar(text):\n return text.count('ك')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `count_ar(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ك» في النص.\nمثال: `count_ar('قلم صحراء حصان معلم')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "e477357eff22be5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)", "tests": ["assert sum_div(113) == 1984", "assert sum_div(87) == 1084", "assert sum_div(1) == 0", "assert sum_div(257) == 10010", "assert sum_div(238) == 8520", "assert sum_div(77) == 920", "assert sum_div(1) == 0"], "test_code": "assert sum_div(113) == 1984\nassert sum_div(87) == 1084\nassert sum_div(1) == 0\nassert sum_div(257) == 10010\nassert sum_div(238) == 8520\nassert sum_div(77) == 920\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 % 10 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 10.\nمثال: `sum_div(113)` يجب أن تُرجع `1984`.\nالجواب:", "qhash": "06bcb029badd9a05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "tests": ["assert pow_digits(5147) == 15", "assert pow_digits(268390) == 12", "assert pow_digits(492975) == 0", "assert pow_digits(584871) == 3", "assert pow_digits(592970) == 10", "assert pow_digits(229630) == 26", "assert pow_digits(582213) == 15", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(5147) == 15\nassert pow_digits(268390) == 12\nassert pow_digits(492975) == 0\nassert pow_digits(584871) == 3\nassert pow_digits(592970) == 10\nassert pow_digits(229630) == 26\nassert pow_digits(582213) == 15\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 74\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 74.\nللتوضيح: الاستدعاء `pow_digits(5147)` يُرجع `15`.\nالجواب:", "qhash": "e1ed68d82d9a2073"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 9 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_list([0, 26, 37, 20]) == [20, 0, 26, 37]", "assert rotate_list([-9, 6, 13, 28, 49, 12]) == [28, 49, 12, -9, 6, 13]", "assert rotate_list([31, 15, 25, 42, 17]) == [15, 25, 42, 17, 31]", "assert rotate_list([18, 42, -5, 32, 38, 23, 27, -1, 0, 10, 28, 15]) == [32, 38, 23, 27, -1, 0, 10, 28, 15, 18, 42, -5]", "assert rotate_list([41]) == [41]", "assert rotate_list([-4, 38, 41, 16, 4, 13, 33, 46, 42, -1]) == [38, 41, 16, 4, 13, 33, 46, 42, -1, -4]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([0, 26, 37, 20]) == [20, 0, 26, 37]\nassert rotate_list([-9, 6, 13, 28, 49, 12]) == [28, 49, 12, -9, 6, 13]\nassert rotate_list([31, 15, 25, 42, 17]) == [15, 25, 42, 17, 31]\nassert rotate_list([18, 42, -5, 32, 38, 23, 27, -1, 0, 10, 28, 15]) == [32, 38, 23, 27, -1, 0, 10, 28, 15, 18, 42, -5]\nassert rotate_list([41]) == [41]\nassert rotate_list([-4, 38, 41, 16, 4, 13, 33, 46, 42, -1]) == [38, 41, 16, 4, 13, 33, 46, 42, -1, -4]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 9 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 9 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 9 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([0, 26, 37, 20])` يُرجع `[20, 0, 26, 37]`.\nالجواب:", "qhash": "ed86ac1c34035109"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(14) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun', '13', 'Sun']", "assert fizz(12) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun']", "assert fizz(21) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'Sun', '21']", "assert fizz(11) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11']", "assert fizz(8) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon']"], "test_code": "assert fizz(14) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun', '13', 'Sun']\nassert fizz(12) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun']\nassert fizz(21) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun', '13', 'Sun', '15', 'SunMoon', '17', 'Sun', '19', 'Sun', '21']\nassert fizz(11) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11']\nassert fizz(8) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\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 % 2 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Sun'، وعلى 8 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(14)` يجب أن تُرجع `['1', 'Sun', '3', 'Sun', '5', 'Sun', '7', 'SunMoon', '9', 'Sun', '11', 'Sun', '13', 'Sun']`.\nالجواب:", "qhash": "f7800384a97b491c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'lmtu'}", "tests": ["assert letter_stats('winter') == {'l': 0, 'm': 0, 't': 1, 'u': 0}", "assert letter_stats('desert camel desert brain') == {'l': 1, 'm': 1, 't': 2, 'u': 0}", "assert letter_stats('engine') == {'l': 0, 'm': 0, 't': 0, 'u': 0}", "assert letter_stats('matrix') == {'l': 0, 'm': 1, 't': 1, 'u': 0}", "assert letter_stats('python matrix') == {'l': 0, 'm': 1, 't': 2, 'u': 0}", "assert letter_stats('rocket we winter go camel code') == {'l': 1, 'm': 1, 't': 2, 'u': 0}", "assert letter_stats('') == {'l': 0, 'm': 0, 't': 0, 'u': 0}"], "test_code": "assert letter_stats('winter') == {'l': 0, 'm': 0, 't': 1, 'u': 0}\nassert letter_stats('desert camel desert brain') == {'l': 1, 'm': 1, 't': 2, 'u': 0}\nassert letter_stats('engine') == {'l': 0, 'm': 0, 't': 0, 'u': 0}\nassert letter_stats('matrix') == {'l': 0, 'm': 1, 't': 1, 'u': 0}\nassert letter_stats('python matrix') == {'l': 0, 'm': 1, 't': 2, 'u': 0}\nassert letter_stats('rocket we winter go camel code') == {'l': 1, 'm': 1, 't': 2, 'u': 0}\nassert letter_stats('') == {'l': 0, 'm': 0, 't': 0, 'u': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'lmtu'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'lmtu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'l'، 'm'، 't'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('winter')` يُرجع `{'l': 0, 'm': 0, 't': 1, 'u': 0}`.\nالجواب:", "qhash": "51020d0b8e4f1b72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 17\nfor n in range(8, 29, 1):\n result += n * 3\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 17\nfor n in range(8, 29, 1):\n result += n * 3\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "27b4fbbb38ff4d6b", "answer": "1151\n28", "completion": " الناتج:\n```text\n1151\n28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('garden') == 'fzqcdm'", "assert shift_text('planet on matrix at A1') == 'okzmds nm lzsqhw zs A1'", "assert shift_text('at engine python it by A1') == 'zs dmfhmd oxsgnm hs ax A1'", "assert shift_text('it') == 'hs'", "assert shift_text('garden engine garden brain') == 'fzqcdm dmfhmd fzqcdm aqzhm'", "assert shift_text('planet of code go') == 'okzmds ne bncd fn'", "assert shift_text('') == ''"], "test_code": "assert shift_text('garden') == 'fzqcdm'\nassert shift_text('planet on matrix at A1') == 'okzmds nm lzsqhw zs A1'\nassert shift_text('at engine python it by A1') == 'zs dmfhmd oxsgnm hs ax A1'\nassert shift_text('it') == 'hs'\nassert shift_text('garden engine garden brain') == 'fzqcdm dmfhmd fzqcdm aqzhm'\nassert shift_text('planet of code go') == 'okzmds ne bncd fn'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('garden')` يُرجع `'fzqcdm'`.\nالجواب:", "qhash": "5370a9a137d8f772"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('window stone desert signal') == 'signal desert stone window'", "assert rev_join('at') == 'at'", "assert rev_join('an up') == 'up an'", "assert rev_join('planet code we') == 'we code planet'", "assert rev_join('banana window go of falcon is planet') == 'planet is falcon of go window banana'", "assert rev_join('planet python winter in matrix at engine') == 'engine at matrix in winter python planet'", "assert rev_join('table we in an engine') == 'engine an in we table'"], "test_code": "assert rev_join('window stone desert signal') == 'signal desert stone window'\nassert rev_join('at') == 'at'\nassert rev_join('an up') == 'up an'\nassert rev_join('planet code we') == 'we code planet'\nassert rev_join('banana window go of falcon is planet') == 'planet is falcon of go window banana'\nassert rev_join('planet python winter in matrix at engine') == 'engine at matrix in winter python planet'\nassert rev_join('table we in an engine') == 'engine an in we table'", "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('window stone desert signal')` يجب أن تُرجع `'signal desert stone window'`.\nالجواب:", "qhash": "06799c3a27fd5fdb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([48, 28, -22, 14, -18]) == -22", "assert find_max_div([-44, -55, -33]) == -33", "assert find_max_div([1, 12]) == None", "assert find_max_div([-26, -36, 15, 25, -19, 12, -15, 11, 33]) == 33", "assert find_max_div([-19, 23, -8, -26, -50]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([48, 28, -22, 14, -18]) == -22\nassert find_max_div([-44, -55, -33]) == -33\nassert find_max_div([1, 12]) == None\nassert find_max_div([-26, -36, 15, 25, -19, 12, -15, 11, 33]) == 33\nassert find_max_div([-19, 23, -8, -26, -50]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 11 == 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 % 11 == 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 % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(arr):\n best = None\n for x in arr:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `find_max_div([48, 28, -22, 14, -18])` يجب أن تُرجع `-22`.\nالجواب:", "qhash": "774c3c9f44579369"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 10:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([6, 5, 10, 8, 9, 1, 1, 10, 6, 8]) == [6, 0, 10, 0, 9, 10, 0, 10, 0, 8]", "assert rolling_total([10, 3]) == [10, 0]", "assert rolling_total([-8]) == [-8]", "assert rolling_total([-7, -4, -9]) == [-7, -11, -20]", "assert rolling_total([1, 0, -7, -1, -9, -3, 10]) == [1, 1, -6, -7, -16, -19, -9]", "assert rolling_total([-9]) == [-9]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([6, 5, 10, 8, 9, 1, 1, 10, 6, 8]) == [6, 0, 10, 0, 9, 10, 0, 10, 0, 8]\nassert rolling_total([10, 3]) == [10, 0]\nassert rolling_total([-8]) == [-8]\nassert rolling_total([-7, -4, -9]) == [-7, -11, -20]\nassert rolling_total([1, 0, -7, -1, -9, -3, 10]) == [1, 1, -6, -7, -16, -19, -9]\nassert rolling_total([-9]) == [-9]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 10:\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 > 10:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 10 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([6, 5, 10, 8, 9, 1, 1, 10, 6, 8])` يُرجع `[6, 0, 10, 0, 9, 10, 0, 10, 0, 8]`.\nالجواب:", "qhash": "651369aae3168062"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 3 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([2, 19, 1]) == [2, 19, 1]", "assert shift_list([-2, -9, -7, 6, 23, 3, 43, 5]) == [3, 43, 5, -2, -9, -7, 6, 23]", "assert shift_list([25, -5, 36, 23]) == [-5, 36, 23, 25]", "assert shift_list([13, 19, 4, 14, -7, 18, 7, 39]) == [18, 7, 39, 13, 19, 4, 14, -7]", "assert shift_list([-2, -5, 10]) == [-2, -5, 10]", "assert shift_list([39, 4, 39]) == [39, 4, 39]", "assert shift_list([]) == []"], "test_code": "assert shift_list([2, 19, 1]) == [2, 19, 1]\nassert shift_list([-2, -9, -7, 6, 23, 3, 43, 5]) == [3, 43, 5, -2, -9, -7, 6, 23]\nassert shift_list([25, -5, 36, 23]) == [-5, 36, 23, 25]\nassert shift_list([13, 19, 4, 14, -7, 18, 7, 39]) == [18, 7, 39, 13, 19, 4, 14, -7]\nassert shift_list([-2, -5, 10]) == [-2, -5, 10]\nassert shift_list([39, 4, 39]) == [39, 4, 39]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 3 % 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 = 3 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 3 % len(items)\n return ____\n```\nمثال: `shift_list([2, 19, 1])` يجب أن تُرجع `[2, 19, 1]`.\nالجواب:", "qhash": "f432cded9f03581e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [-5, 28, 25, 10, 25, -4, 12, -4]\nprint(a[2:8])\nprint(a[::-1])\nprint(max(a[2:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [-5, 28, 25, 10, 25, -4, 12, -4]\nprint(a[2:8])\nprint(a[::-1])\nprint(max(a[2:8]))\n```\nالجواب:", "qhash": "ab241338aad9a284", "answer": "[25, 10, 25, -4, 12, -4]\n[-4, 12, -4, 25, 10, 25, 28, -5]\n25", "completion": " الناتج:\n```text\n[25, 10, 25, -4, 12, -4]\n[-4, 12, -4, 25, 10, 25, 28, -5]\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(29) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19', 'Red', '21', 'Blue', '23', 'Red', '25', '26', '27', 'Red', '29']", "assert fizz(19) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19']", "assert fizz(16) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red']", "assert fizz(0) == []", "assert fizz(15) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15']"], "test_code": "assert fizz(29) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19', 'Red', '21', 'Blue', '23', 'Red', '25', '26', '27', 'Red', '29']\nassert fizz(19) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19']\nassert fizz(16) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red']\nassert fizz(0) == []\nassert fizz(15) == ['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Red'، وعلى 11 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(29)` يجب أن تُرجع `['1', '2', '3', 'Red', '5', '6', '7', 'Red', '9', '10', 'Blue', 'Red', '13', '14', '15', 'Red', '17', '18', '19', 'Red', '21', 'Blue', '23', 'Red', '25', '26', '27', 'Red', '29']`.\nالجواب:", "qhash": "f710c6c512e85afd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('pixel planet coffee stone coffee light matrix') == 'matrix/light/coffee/stone/coffee/planet/pixel'", "assert rev_long_words('planet desert banana to music') == 'music/banana/desert/planet'", "assert rev_long_words('') == ''", "assert rev_long_words('brain') == 'brain'", "assert rev_long_words('of data cloud banana') == 'banana/cloud'", "assert rev_long_words('up an orange brain desert it') == 'desert/brain/orange'", "assert rev_long_words('cloud go an vector up a') == 'vector/cloud'"], "test_code": "assert rev_long_words('pixel planet coffee stone coffee light matrix') == 'matrix/light/coffee/stone/coffee/planet/pixel'\nassert rev_long_words('planet desert banana to music') == 'music/banana/desert/planet'\nassert rev_long_words('') == ''\nassert rev_long_words('brain') == 'brain'\nassert rev_long_words('of data cloud banana') == 'banana/cloud'\nassert rev_long_words('up an orange brain desert it') == 'desert/brain/orange'\nassert rev_long_words('cloud go an vector up a') == 'vector/cloud'", "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('pixel planet coffee stone coffee light matrix')` يجب أن تُرجع `'matrix/light/coffee/stone/coffee/planet/pixel'`.\nالجواب:", "qhash": "89503d3bf3fd1d48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('راشد', 41), ('باسل', 14), ('مريم', 46), ('منى', 30)]\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), ('باسل', 14), ('مريم', 46), ('منى', 30)]\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": "b3173410f102a1d2", "answer": "[('باسل', 14), ('منى', 30), ('راشد', 41), ('مريم', 46)]\n['مريم', 'راشد']", "completion": " الناتج:\n```text\n[('باسل', 14), ('منى', 30), ('راشد', 41), ('مريم', 46)]\n['مريم', 'راشد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'signal'\nprint(name.replace('n', '0'))\nprint(name[::-1])\nprint(name.count('n'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'signal'\nprint(name.replace('n', '0'))\nprint(name[::-1])\nprint(name.count('n'))\n```\nالجواب:", "qhash": "455a80796944530c", "answer": "sig0al\nlangis\n1", "completion": " الناتج:\n```text\nsig0al\nlangis\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 19\nfor n in range(2, 23, 3):\n s -= n * 2\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 19\nfor n in range(2, 23, 3):\n s -= n * 2\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "cdf56b4f905973ff", "answer": "-135\n20", "completion": " الناتج:\n```text\n-135\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'signal'\nprint(s.capitalize())\nprint(s.find('l'))\nprint(s[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'signal'\nprint(s.capitalize())\nprint(s.find('l'))\nprint(s[-4:])\n```\nالجواب:", "qhash": "74650808198d06ec", "answer": "Signal\n5\ngnal", "completion": " الناتج:\n```text\nSignal\n5\ngnal\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 41865\ncount = 0\nwhile m > 11:\n m = m // 6\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 41865\ncount = 0\nwhile m > 11:\n m = m // 6\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "f369490da005f19f", "answer": "5 5", "completion": " الناتج:\n```text\n5 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)", "tests": ["assert sum_div(241) == 10477", "assert sum_div(239) == 10237", "assert sum_div(272) == 13039", "assert sum_div(206) == 7565", "assert sum_div(45) == 383", "assert sum_div(234) == 9763", "assert sum_div(1) == 0"], "test_code": "assert sum_div(241) == 10477\nassert sum_div(239) == 10237\nassert sum_div(272) == 13039\nassert sum_div(206) == 7565\nassert sum_div(45) == 383\nassert sum_div(234) == 9763\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 % 7 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 7، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(241)` يُرجع `10477`.\nالجواب:", "qhash": "d88ab6a9531b3e5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 6 * x ** 2 + (-7) * x + (-6)", "tests": ["assert evaluate(10) == 524", "assert evaluate(13) == 917", "assert evaluate(3) == 27", "assert evaluate(-3) == 69", "assert evaluate(15) == 1239", "assert evaluate(-13) == 1099", "assert evaluate(-3) == 69", "assert evaluate(0) == -6"], "test_code": "assert evaluate(10) == 524\nassert evaluate(13) == 917\nassert evaluate(3) == 27\nassert evaluate(-3) == 69\nassert evaluate(15) == 1239\nassert evaluate(-13) == 1099\nassert evaluate(-3) == 69\nassert evaluate(0) == -6", "answer": "def evaluate(x):\n return 6 * x ** 2 + (-7) * x + (-6)", "completion": " ```python\ndef evaluate(x):\n return 6 * x ** 2 + (-7) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 6x² - 7x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(10)` يُرجع `524`.\nالجواب:", "qhash": "57f78b1bf3065cd2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('برتقال جبل سلام سيارة صديق بيت قمر') == 1", "assert letter_count('ماء حصان سيارة') == 0", "assert letter_count('') == 0", "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('برتقال جبل سلام سيارة صديق بيت قمر') == 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)` بحيث تُعيد عدد مرات ظهور الحرف «د» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('قمر رمل حاسوب بيت صحراء كتاب نور بحر')` يُرجع `0`.\nالجواب:", "qhash": "5e07570749c18ddb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(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 count_matching([74, 50, 57, 48, 28, 27, 8, 8, 81]) == 0", "assert count_matching([40, 63, -32, 63, 73, 13, -11, 75, 33, -34, 73]) == 2", "assert count_matching([48]) == 0", "assert count_matching([66, 89, -18, -36]) == 0", "assert count_matching([-1, 65, 44, 11]) == 0", "assert count_matching([13, 85, -3]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([74, 50, 57, 48, 28, 27, 8, 8, 81]) == 0\nassert count_matching([40, 63, -32, 63, 73, 13, -11, 75, 33, -34, 73]) == 2\nassert count_matching([48]) == 0\nassert count_matching([66, 89, -18, -36]) == 0\nassert count_matching([-1, 65, 44, 11]) == 0\nassert count_matching([13, 85, -3]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(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 count_matching(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 count_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_matching([74, 50, 57, 48, 28, 27, 8, 8, 81])` يُرجع `0`.\nالجواب:", "qhash": "10cfbd298ea50c76"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 997", "tests": ["assert rec_prod(3) == 3", "assert rec_prod(28) == 900", "assert rec_prod(56) == 501", "assert rec_prod(32) == 377", "assert rec_prod(54) == 248", "assert rec_prod(9) == 162", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 3\nassert rec_prod(28) == 900\nassert rec_prod(56) == 501\nassert rec_prod(32) == 377\nassert rec_prod(54) == 248\nassert rec_prod(9) == 162\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 997", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 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": "2ea3d9b1e1bd0715"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 0\nfor i in range(-5, 18, 3):\n total -= i * 5\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 0\nfor i in range(-5, 18, 3):\n total -= i * 5\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "b9766a0ce17d2f86", "answer": "-220\n16", "completion": " الناتج:\n```text\n-220\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('music planet river cloud apple stone') == 'stone/apple/cloud/river/planet/music'", "assert rev_join('up code in orange to falcon brain river') == 'river/brain/falcon/to/orange/in/code/up'", "assert rev_join('river music music') == 'music/music/river'", "assert rev_join('river code data camel') == 'camel/data/code/river'", "assert rev_join('cloud falcon planet python orange') == 'orange/python/planet/falcon/cloud'", "assert rev_join('up apple camel pixel is') == 'is/pixel/camel/apple/up'", "assert rev_join('is pixel') == 'pixel/is'"], "test_code": "assert rev_join('music planet river cloud apple stone') == 'stone/apple/cloud/river/planet/music'\nassert rev_join('up code in orange to falcon brain river') == 'river/brain/falcon/to/orange/in/code/up'\nassert rev_join('river music music') == 'music/music/river'\nassert rev_join('river code data camel') == 'camel/data/code/river'\nassert rev_join('cloud falcon planet python orange') == 'orange/python/planet/falcon/cloud'\nassert rev_join('up apple camel pixel is') == 'is/pixel/camel/apple/up'\nassert rev_join('is pixel') == 'pixel/is'", "answer": "def rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '/'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '/'.\nمثال: `rev_join('music planet river cloud apple stone')` يجب أن تُرجع `'stone/apple/cloud/river/planet/music'`.\nالجواب:", "qhash": "ebda5d88da3e9d5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "tests": ["assert pow_total(5) == 110", "assert pow_total(2) == 10", "assert pow_total(1) == 2", "assert pow_total(4) == 60", "assert pow_total(10) == 770", "assert pow_total(1) == 2", "assert pow_total(0) == 0"], "test_code": "assert pow_total(5) == 110\nassert pow_total(2) == 10\nassert pow_total(1) == 2\nassert pow_total(4) == 60\nassert pow_total(10) == 770\nassert pow_total(1) == 2\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 2 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 2\n return total\n```\nمثال: `pow_total(5)` يجب أن تُرجع `110`.\nالجواب:", "qhash": "1a645a479e07f859"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('ليل برتقال قلم ميناء بحر لغة بيت') == 1", "assert how_many('سلام حصان حديقة لغة دفتر') == 2", "assert how_many('نهر قمر برتقال لغة طالب حديقة بيت') == 1", "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('سلام حصان حديقة لغة دفتر') == 2\nassert how_many('نهر قمر برتقال لغة طالب حديقة بيت') == 1\nassert how_many('باب جمل صحراء') == 1\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('برتقال جبل نور')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "72c5acd4feedd7f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue']", "assert fizz(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 fizz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21']", "assert fizz(4) == ['1', '2', '3', '4']", "assert fizz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18']"], "test_code": "assert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue']\nassert fizz(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 fizz(21) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21']\nassert fizz(4) == ['1', '2', '3', '4']\nassert fizz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18']", "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 % 11 == 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 % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(11)` يُرجع `['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue']`.\nالجواب:", "qhash": "964d84ec975d8e4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([52, 9, 3, 38, 11, 56, 44]) == [52, 61, 64, 102, 0, 56, 100]", "assert reset_sum([91, 39, 59, 35]) == [91, 0, 59, 94]", "assert reset_sum([101, 44, 39, 76, 64, 20, 67, 82]) == [101, 0, 39, 0, 64, 84, 0, 82]", "assert reset_sum([59, 52, 43, 99, 39, 71, 21, 36, 85, 35]) == [59, 0, 43, 0, 39, 0, 21, 57, 0, 35]", "assert reset_sum([33, 55, 61, 38]) == [33, 88, 0, 38]", "assert reset_sum([57, 47]) == [57, 104]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([52, 9, 3, 38, 11, 56, 44]) == [52, 61, 64, 102, 0, 56, 100]\nassert reset_sum([91, 39, 59, 35]) == [91, 0, 59, 94]\nassert reset_sum([101, 44, 39, 76, 64, 20, 67, 82]) == [101, 0, 39, 0, 64, 84, 0, 82]\nassert reset_sum([59, 52, 43, 99, 39, 71, 21, 36, 85, 35]) == [59, 0, 43, 0, 39, 0, 21, 57, 0, 35]\nassert reset_sum([33, 55, 61, 38]) == [33, 88, 0, 38]\nassert reset_sum([57, 47]) == [57, 104]\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 106 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([52, 9, 3, 38, 11, 56, 44])` يجب أن تُرجع `[52, 61, 64, 102, 0, 56, 100]`.\nالجواب:", "qhash": "ea3cc05b0db68a80"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=4):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(-4))\nprint(g(-4, 15))\nprint(g(g(15), -4))", "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(-4))\nprint(g(-4, 15))\nprint(g(g(15), -4))\n```\nالجواب:", "qhash": "f0ced4f48bb5de31", "answer": "-12\n-34\n-26", "completion": " الناتج:\n```text\n-12\n-34\n-26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert div_not([64, 45, 58, 24, 24, 90, 45, 49, 86, 40]) == 0", "assert div_not([18, 35, 47, 72, -39]) == 0", "assert div_not([63, -2, 57]) == 0", "assert div_not([88, 26, -19]) == 0", "assert div_not([]) == 0", "assert div_not([-12, 13]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([64, 45, 58, 24, 24, 90, 45, 49, 86, 40]) == 0\nassert div_not([18, 35, 47, 72, -39]) == 0\nassert div_not([63, -2, 57]) == 0\nassert div_not([88, 26, -19]) == 0\nassert div_not([]) == 0\nassert div_not([-12, 13]) == 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 % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([64, 45, 58, 24, 24, 90, 45, 49, 86, 40])` يُرجع `0`.\nالجواب:", "qhash": "3ed75d4e0e650898"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 4 for x in xs if 20 <= x <= 43)", "tests": ["assert in_range_scaled([19, 17, 33, 19]) == [132]", "assert in_range_scaled([35, 56, -13, 16, 23]) == [92, 140]", "assert in_range_scaled([-3, -10, 2, 21, 56, 49, 11]) == [84]", "assert in_range_scaled([41, 46]) == [164]", "assert in_range_scaled([-27]) == []", "assert in_range_scaled([16, 30, -24, 50, 43]) == [120, 172]", "assert in_range_scaled([32, 12, 29, -3, 21, -23, 23]) == [84, 92, 116, 128]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([19, 17, 33, 19]) == [132]\nassert in_range_scaled([35, 56, -13, 16, 23]) == [92, 140]\nassert in_range_scaled([-3, -10, 2, 21, 56, 49, 11]) == [84]\nassert in_range_scaled([41, 46]) == [164]\nassert in_range_scaled([-27]) == []\nassert in_range_scaled([16, 30, -24, 50, 43]) == [120, 172]\nassert in_range_scaled([32, 12, 29, -3, 21, -23, 23]) == [84, 92, 116, 128]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 4 for x in xs if 20 <= x <= 43)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 4 for x in xs if 20 <= x <= 43)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 20 و43 (شاملًا الطرفين) في 4.\nمثال: `in_range_scaled([19, 17, 33, 19])` يجب أن تُرجع `[132]`.\nالجواب:", "qhash": "69c9582002a3cc5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=5):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(20))\nprint(calc(20, -7))\nprint(calc(calc(-7), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(20))\nprint(calc(20, -7))\nprint(calc(calc(-7), 20))\n```\nالجواب:", "qhash": "9e264566c1f3be98", "answer": "175\n187\n322", "completion": " الناتج:\n```text\n175\n187\n322\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('engine we python is code') == 'python/engine'", "assert flip_words('python winter signal on') == 'signal/winter/python'", "assert flip_words('table') == ''", "assert flip_words('python at') == 'python'", "assert flip_words('') == ''", "assert flip_words('') == ''", "assert flip_words('an is in an river') == ''"], "test_code": "assert flip_words('engine we python is code') == 'python/engine'\nassert flip_words('python winter signal on') == 'signal/winter/python'\nassert flip_words('table') == ''\nassert flip_words('python at') == 'python'\nassert flip_words('') == ''\nassert flip_words('') == ''\nassert flip_words('an is in an river') == ''", "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('engine we python is code')` يجب أن تُرجع `'python/engine'`.\nالجواب:", "qhash": "a27225c758e8fb6c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(2))\nprint(f(2, 1))\nprint(f(f(1), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(f(2))\nprint(f(2, 1))\nprint(f(f(1), 2))\n```\nالجواب:", "qhash": "9c7e2596ae48ea23", "answer": "37\n9\n178", "completion": " الناتج:\n```text\n37\n9\n178\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 3 * x ** 2 + (4) * x + (-5)", "tests": ["assert value_at(7) == 170", "assert value_at(7) == 170", "assert value_at(5) == 90", "assert value_at(-2) == -1", "assert value_at(18) == 1039", "assert value_at(13) == 554", "assert value_at(6) == 127", "assert value_at(0) == -5"], "test_code": "assert value_at(7) == 170\nassert value_at(7) == 170\nassert value_at(5) == 90\nassert value_at(-2) == -1\nassert value_at(18) == 1039\nassert value_at(13) == 554\nassert value_at(6) == 127\nassert value_at(0) == -5", "answer": "def value_at(x):\n return 3 * x ** 2 + (4) * x + (-5)", "completion": " ```python\ndef value_at(x):\n return 3 * x ** 2 + (4) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 3x² + 4x - 5 عند العدد الصحيح x.\nمثال: `value_at(7)` يجب أن تُرجع `170`.\nالجواب:", "qhash": "43b0eee5f83f4709"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(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 max_div([-2, -21, 60, -27, 5]) == None", "assert max_div([-24, -24, -40]) == -24", "assert max_div([1, 9, 17, 25]) == None", "assert max_div([12, 6, -33]) == None", "assert max_div([13, -28, -35, 12, 8, 7, 8, -30]) == 8", "assert max_div([]) == None"], "test_code": "assert max_div([-2, -21, 60, -27, 5]) == None\nassert max_div([-24, -24, -40]) == -24\nassert max_div([1, 9, 17, 25]) == None\nassert max_div([12, 6, -33]) == None\nassert max_div([13, -28, -35, 12, 8, 7, 8, -30]) == 8\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(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مثال: `max_div([-2, -21, 60, -27, 5])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "14f110ab29b50175"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "tests": ["assert cycle([4, 6, 13, 31]) == [13, 31, 4, 6]", "assert cycle([23, -8, 8, 19, 1, 7, 46]) == [19, 1, 7, 46, 23, -8, 8]", "assert cycle([17, -5, 32, 11, 33, 49, 4, 50, 19, 23]) == [17, -5, 32, 11, 33, 49, 4, 50, 19, 23]", "assert cycle([39, 2, 49, 44, 20, 49, 6, 19]) == [49, 44, 20, 49, 6, 19, 39, 2]", "assert cycle([8, 31, 15, 0]) == [15, 0, 8, 31]", "assert cycle([24, 27, 16, 19, 10, 1]) == [10, 1, 24, 27, 16, 19]", "assert cycle([]) == []"], "test_code": "assert cycle([4, 6, 13, 31]) == [13, 31, 4, 6]\nassert cycle([23, -8, 8, 19, 1, 7, 46]) == [19, 1, 7, 46, 23, -8, 8]\nassert cycle([17, -5, 32, 11, 33, 49, 4, 50, 19, 23]) == [17, -5, 32, 11, 33, 49, 4, 50, 19, 23]\nassert cycle([39, 2, 49, 44, 20, 49, 6, 19]) == [49, 44, 20, 49, 6, 19, 39, 2]\nassert cycle([8, 31, 15, 0]) == [15, 0, 8, 31]\nassert cycle([24, 27, 16, 19, 10, 1]) == [10, 1, 24, 27, 16, 19]\nassert cycle([]) == []", "answer": "def cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(items):\n if not items:\n return []\n k = 10 % len(items)\n return ____\n```\nمثال: `cycle([4, 6, 13, 31])` يجب أن تُرجع `[13, 31, 4, 6]`.\nالجواب:", "qhash": "fdb74a066b803e6f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[k:] + items[:k]", "tests": ["assert rotate_list([2, 47, 7, 13, 34, 28, 44]) == [2, 47, 7, 13, 34, 28, 44]", "assert rotate_list([20, 5, 18, 13, -9, 23, 45, 47, 40, 42]) == [47, 40, 42, 20, 5, 18, 13, -9, 23, 45]", "assert rotate_list([44, 35, 40, -3, 7, 10, 9, 40, 39, 34]) == [40, 39, 34, 44, 35, 40, -3, 7, 10, 9]", "assert rotate_list([11, 35, 0, 33, 13, 37, 38, 1, 41, 7, -4, 28]) == [1, 41, 7, -4, 28, 11, 35, 0, 33, 13, 37, 38]", "assert rotate_list([44, 6, -7, 18, 6, -9, 40]) == [44, 6, -7, 18, 6, -9, 40]", "assert rotate_list([22, 47, 12]) == [47, 12, 22]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([2, 47, 7, 13, 34, 28, 44]) == [2, 47, 7, 13, 34, 28, 44]\nassert rotate_list([20, 5, 18, 13, -9, 23, 45, 47, 40, 42]) == [47, 40, 42, 20, 5, 18, 13, -9, 23, 45]\nassert rotate_list([44, 35, 40, -3, 7, 10, 9, 40, 39, 34]) == [40, 39, 34, 44, 35, 40, -3, 7, 10, 9]\nassert rotate_list([11, 35, 0, 33, 13, 37, 38, 1, 41, 7, -4, 28]) == [1, 41, 7, -4, 28, 11, 35, 0, 33, 13, 37, 38]\nassert rotate_list([44, 6, -7, 18, 6, -9, 40]) == [44, 6, -7, 18, 6, -9, 40]\nassert rotate_list([22, 47, 12]) == [47, 12, 22]\nassert rotate_list([]) == []", "answer": "def rotate_list(items):\n if not items:\n return []\n k = 7 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef rotate_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 rotate_list(items):\n if not items:\n return []\n k = 7 % len(items)\n return ____\n```\nمثال: `rotate_list([2, 47, 7, 13, 34, 28, 44])` يجب أن تُرجع `[2, 47, 7, 13, 34, 28, 44]`.\nالجواب:", "qhash": "5195507797f36aae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 7 for x in range(6, 13) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 7 for x in range(6, 13) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "87b7a323ed459da7", "answer": "[42, 74, 114]\n3 230", "completion": " الناتج:\n```text\n[42, 74, 114]\n3 230\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 1009", "tests": ["assert rec_prod(6) == 48", "assert rec_prod(13) == 938", "assert rec_prod(11) == 305", "assert rec_prod(51) == 351", "assert rec_prod(19) == 74", "assert rec_prod(1) == 1", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 48\nassert rec_prod(13) == 938\nassert rec_prod(11) == 305\nassert rec_prod(51) == 351\nassert rec_prod(19) == 74\nassert rec_prod(1) == 1\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 1009", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(6)` يجب أن تُرجع `48`.\nالجواب:", "qhash": "1d83b6ff5507c96a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('light winter garden rocket') == 'rocket_garden_winter_light'", "assert rev_join('falcon data go data') == 'data_go_data_falcon'", "assert rev_join('matrix at cloud python table music in cloud') == 'cloud_in_music_table_python_cloud_at_matrix'", "assert rev_join('winter brain camel garden by summer cloud') == 'cloud_summer_by_garden_camel_brain_winter'", "assert rev_join('garden in river data') == 'data_river_in_garden'", "assert rev_join('winter an cloud we music garden go vector') == 'vector_go_garden_music_we_cloud_an_winter'", "assert rev_join('window in winter falcon code') == 'code_falcon_winter_in_window'"], "test_code": "assert rev_join('light winter garden rocket') == 'rocket_garden_winter_light'\nassert rev_join('falcon data go data') == 'data_go_data_falcon'\nassert rev_join('matrix at cloud python table music in cloud') == 'cloud_in_music_table_python_cloud_at_matrix'\nassert rev_join('winter brain camel garden by summer cloud') == 'cloud_summer_by_garden_camel_brain_winter'\nassert rev_join('garden in river data') == 'data_river_in_garden'\nassert rev_join('winter an cloud we music garden go vector') == 'vector_go_garden_music_we_cloud_an_winter'\nassert rev_join('window in winter falcon code') == 'code_falcon_winter_in_window'", "answer": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_join('light winter garden rocket')` يُرجع `'rocket_garden_winter_light'`.\nالجواب:", "qhash": "f9fc152b2f488ea1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['banana', 'camel', 'desert', 'light', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['banana', 'camel', 'desert', 'light', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "416ff4dc6bcb4d05", "answer": "['camel', 'light', 'banana', 'desert', 'coffee']\n['desert', 'coffee', 'banana']", "completion": " الناتج:\n```text\n['camel', 'light', 'banana', 'desert', 'coffee']\n['desert', 'coffee', 'banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_matching([0, 71, 2, 21, 81, 45, 58, 3]) == 1", "assert count_matching([54, -20, -24, -16, -22, 50, -26, 19, 77]) == 1", "assert count_matching([56, 34, 9, 88, -26, 9, 3, 16, -9, -32]) == 3", "assert count_matching([-8, -11, -8, 33, -28]) == 0", "assert count_matching([84, -14, 25, 60, 90]) == 0", "assert count_matching([9, 6, -33, 9, 57, -16, -40, 36]) == 3", "assert count_matching([]) == 0"], "test_code": "assert count_matching([0, 71, 2, 21, 81, 45, 58, 3]) == 1\nassert count_matching([54, -20, -24, -16, -22, 50, -26, 19, 77]) == 1\nassert count_matching([56, 34, 9, 88, -26, 9, 3, 16, -9, -32]) == 3\nassert count_matching([-8, -11, -8, 33, -28]) == 0\nassert count_matching([84, -14, 25, 60, 90]) == 0\nassert count_matching([9, 6, -33, 9, 57, -16, -40, 36]) == 3\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 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 % 9 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([0, 71, 2, 21, 81, 45, 58, 3])` يُرجع `1`.\nالجواب:", "qhash": "381319f9f928d844"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([5, 44, 27, 9]) == [27, 9, 5, 44]", "assert shift_list([50, 34, 25, 28, 15, -2, 18, 27, 11, 12, 33]) == [33, 50, 34, 25, 28, 15, -2, 18, 27, 11, 12]", "assert shift_list([32, 26, 39, 45, 4, 41, 44, 39, 33]) == [26, 39, 45, 4, 41, 44, 39, 33, 32]", "assert shift_list([34, 30, 1, 40, 28, 42]) == [28, 42, 34, 30, 1, 40]", "assert shift_list([34, 10]) == [34, 10]", "assert shift_list([23, 8, 4, 16, 24]) == [23, 8, 4, 16, 24]", "assert shift_list([]) == []"], "test_code": "assert shift_list([5, 44, 27, 9]) == [27, 9, 5, 44]\nassert shift_list([50, 34, 25, 28, 15, -2, 18, 27, 11, 12, 33]) == [33, 50, 34, 25, 28, 15, -2, 18, 27, 11, 12]\nassert shift_list([32, 26, 39, 45, 4, 41, 44, 39, 33]) == [26, 39, 45, 4, 41, 44, 39, 33, 32]\nassert shift_list([34, 30, 1, 40, 28, 42]) == [28, 42, 34, 30, 1, 40]\nassert shift_list([34, 10]) == [34, 10]\nassert shift_list([23, 8, 4, 16, 24]) == [23, 8, 4, 16, 24]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return ____\n```\nمثال: `shift_list([5, 44, 27, 9])` يجب أن تُرجع `[27, 9, 5, 44]`.\nالجواب:", "qhash": "89e33510127793ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'bgl'}", "tests": ["assert tally('desert we python window an brain') == {'b': 1, 'g': 0, 'l': 0}", "assert tally('pixel on go banana') == {'b': 1, 'g': 1, 'l': 1}", "assert tally('of table vector cloud brain') == {'b': 2, 'g': 0, 'l': 2}", "assert tally('up apple') == {'b': 0, 'g': 0, 'l': 1}", "assert tally('falcon stone') == {'b': 0, 'g': 0, 'l': 1}", "assert tally('an falcon rocket in light') == {'b': 0, 'g': 1, 'l': 2}", "assert tally('') == {'b': 0, 'g': 0, 'l': 0}"], "test_code": "assert tally('desert we python window an brain') == {'b': 1, 'g': 0, 'l': 0}\nassert tally('pixel on go banana') == {'b': 1, 'g': 1, 'l': 1}\nassert tally('of table vector cloud brain') == {'b': 2, 'g': 0, 'l': 2}\nassert tally('up apple') == {'b': 0, 'g': 0, 'l': 1}\nassert tally('falcon stone') == {'b': 0, 'g': 0, 'l': 1}\nassert tally('an falcon rocket in light') == {'b': 0, 'g': 1, 'l': 2}\nassert tally('') == {'b': 0, 'g': 0, 'l': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'bgl'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'bgl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'g'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('desert we python window an brain')` يُرجع `{'b': 1, 'g': 0, 'l': 0}`.\nالجواب:", "qhash": "ab97374573c72e5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 72942\nc = 0\nwhile x > 14:\n x = x // 9\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 72942\nc = 0\nwhile x > 14:\n x = x // 9\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "0a7b2787f961e89b", "answer": "11 4", "completion": " الناتج:\n```text\n11 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 112\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 = 112\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": "6a00e4931a9f4d99", "answer": "20", "completion": " الناتج:\n```text\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 9541\nc = 0\nwhile x > 12:\n x = x // 7\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 9541\nc = 0\nwhile x > 12:\n x = x // 7\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "8aa215d007085ce3", "answer": "3 4", "completion": " الناتج:\n```text\n3 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([12, 2, 64, 62, 35, 34, 20, 17, 68, 49]) == [12, 14, 78, 140, 0, 34, 54, 71, 139, 0]", "assert reset_sum([61, 22, 10, 16, 51, 6, 99, 8]) == [61, 83, 93, 109, 160, 166, 0, 8]", "assert reset_sum([68, 46]) == [68, 114]", "assert reset_sum([116, 30, 164, 39, 4, 143, 72, 160, 151]) == [116, 146, 0, 39, 43, 0, 72, 0, 151]", "assert reset_sum([99, 32, 123, 41, 159, -5, 68]) == [99, 131, 0, 41, 0, -5, 63]", "assert reset_sum([128, 32, 112, 170, 26, 26, 118, 39]) == [128, 160, 0, 170, 0, 26, 144, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([12, 2, 64, 62, 35, 34, 20, 17, 68, 49]) == [12, 14, 78, 140, 0, 34, 54, 71, 139, 0]\nassert reset_sum([61, 22, 10, 16, 51, 6, 99, 8]) == [61, 83, 93, 109, 160, 166, 0, 8]\nassert reset_sum([68, 46]) == [68, 114]\nassert reset_sum([116, 30, 164, 39, 4, 143, 72, 160, 151]) == [116, 146, 0, 39, 43, 0, 72, 0, 151]\nassert reset_sum([99, 32, 123, 41, 159, -5, 68]) == [99, 131, 0, 41, 0, -5, 63]\nassert reset_sum([128, 32, 112, 170, 26, 26, 118, 39]) == [128, 160, 0, 170, 0, 26, 144, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 170 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([12, 2, 64, 62, 35, 34, 20, 17, 68, 49])` يجب أن تُرجع `[12, 14, 78, 140, 0, 34, 54, 71, 139, 0]`.\nالجواب:", "qhash": "532671431915d81e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ش'):\n count += 1\n return count", "tests": ["assert starts_count('نور طائرة شجرة قلم برمجة ماء شمس') == 2", "assert starts_count('شجرة نهر طالب') == 1", "assert starts_count('برمجة نور') == 0", "assert starts_count('معلم سفينة دفتر بحر') == 0", "assert starts_count('صحراء معلم شجرة') == 1", "assert starts_count('سيارة عربية') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('نور طائرة شجرة قلم برمجة ماء شمس') == 2\nassert starts_count('شجرة نهر طالب') == 1\nassert starts_count('برمجة نور') == 0\nassert starts_count('معلم سفينة دفتر بحر') == 0\nassert starts_count('صحراء معلم شجرة') == 1\nassert starts_count('سيارة عربية') == 0\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ش'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ش'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('نور طائرة شجرة قلم برمجة ماء شمس')` يُرجع `2`.\nالجواب:", "qhash": "42d0733666aa8754"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 97", "tests": ["assert prod_mod(5) == 10", "assert prod_mod(0) == 1", "assert prod_mod(47) == 87", "assert prod_mod(42) == 57", "assert prod_mod(53) == 78", "assert prod_mod(43) == 43", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(5) == 10\nassert prod_mod(0) == 1\nassert prod_mod(47) == 87\nassert prod_mod(42) == 57\nassert prod_mod(53) == 78\nassert prod_mod(43) == 43\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 97", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 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": "594cb8b2ac6edd2c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_sel([32, 11, 17, 28, 28, 82, 8, 70, 21, 10, 46]) == 0", "assert count_sel([84, 85, 66, 62, 49]) == 2", "assert count_sel([]) == 0", "assert count_sel([-31, -7, 89, 74, -32, -22, 32, -12, 26, 47, 44]) == 1", "assert count_sel([-22, 16, 72, -4, -8, 79, -25, -16, -15, 70]) == 0", "assert count_sel([38]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([32, 11, 17, 28, 28, 82, 8, 70, 21, 10, 46]) == 0\nassert count_sel([84, 85, 66, 62, 49]) == 2\nassert count_sel([]) == 0\nassert count_sel([-31, -7, 89, 74, -32, -22, 32, -12, 26, 47, 44]) == 1\nassert count_sel([-22, 16, 72, -4, -8, 79, -25, -16, -15, 70]) == 0\nassert count_sel([38]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([32, 11, 17, 28, 28, 82, 8, 70, 21, 10, 46])` يُرجع `0`.\nالجواب:", "qhash": "3f1822d2c71d0ed7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [11, 2, 40, 13, 24, -9, 0, 37]\nprint(items[3:4])\nprint(items[::2])\nprint(max(items[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [11, 2, 40, 13, 24, -9, 0, 37]\nprint(items[3:4])\nprint(items[::2])\nprint(max(items[3:4]))\n```\nالجواب:", "qhash": "b0326613180dfb9b", "answer": "[13]\n[11, 40, 24, 0]\n13", "completion": " الناتج:\n```text\n[13]\n[11, 40, 24, 0]\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert only_div([30, 66, 15, 78, 83, 80]) == 2", "assert only_div([]) == 0", "assert only_div([-38, -10, -30, -40, 88, 26, 36, 63, 79, 58, 71, 11]) == 2", "assert only_div([72, 24, -27, 4, 16, 57, 60]) == 1", "assert only_div([6, 11, 48, 7, 43, 32, 37, 45, -10, 89, 17, -7]) == 2", "assert only_div([-35, 40, 41, -21]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([30, 66, 15, 78, 83, 80]) == 2\nassert only_div([]) == 0\nassert only_div([-38, -10, -30, -40, 88, 26, 36, 63, 79, 58, 71, 11]) == 2\nassert only_div([72, 24, -27, 4, 16, 57, 60]) == 1\nassert only_div([6, 11, 48, 7, 43, 32, 37, 45, -10, 89, 17, -7]) == 2\nassert only_div([-35, 40, 41, -21]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([30, 66, 15, 78, 83, 80])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "225d547f781b5921"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'garden_orange'\nprint(name.index('a') + len(name))\nprint(name.find('a'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'garden_orange'\nprint(name.index('a') + len(name))\nprint(name.find('a'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "4f3895289107b2aa", "answer": "14\n1\negnaro_nedrag", "completion": " الناتج:\n```text\n14\n1\negnaro_nedrag\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('matrix') == 'uibzqf'", "assert caesar('by light rocket') == 'jg tqopb zwksmb'", "assert caesar('desert window') == 'lmamzb eqvlwe'", "assert caesar('apple orange is up Hello') == 'ixxtm wzivom qa cx Hmttw'", "assert caesar('rocket orange engine coffee') == 'zwksmb wzivom mvoqvm kwnnmm'", "assert caesar('go summer A1') == 'ow acuumz A1'", "assert caesar('') == ''"], "test_code": "assert caesar('matrix') == 'uibzqf'\nassert caesar('by light rocket') == 'jg tqopb zwksmb'\nassert caesar('desert window') == 'lmamzb eqvlwe'\nassert caesar('apple orange is up Hello') == 'ixxtm wzivom qa cx Hmttw'\nassert caesar('rocket orange engine coffee') == 'zwksmb wzivom mvoqvm kwnnmm'\nassert caesar('go summer A1') == 'ow acuumz A1'\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 + (-18)) % 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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('matrix')` يجب أن تُرجع `'uibzqf'`.\nالجواب:", "qhash": "eed1306a9ef22169"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 33362\nsteps = 0\nwhile x > 4:\n x = x // 5\n steps += 1\nprint(x, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 33362\nsteps = 0\nwhile x > 4:\n x = x // 5\n steps += 1\nprint(x, steps)\n```\nالجواب:", "qhash": "fa2ab0b9489c79db", "answer": "2 6", "completion": " الناتج:\n```text\n2 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 8 * x ** 2 + (0) * x + (4)", "tests": ["assert p(4) == 132", "assert p(-18) == 2596", "assert p(-18) == 2596", "assert p(19) == 2892", "assert p(6) == 292", "assert p(-13) == 1356", "assert p(-20) == 3204", "assert p(0) == 4"], "test_code": "assert p(4) == 132\nassert p(-18) == 2596\nassert p(-18) == 2596\nassert p(19) == 2892\nassert p(6) == 292\nassert p(-13) == 1356\nassert p(-20) == 3204\nassert p(0) == 4", "answer": "def p(x):\n return 8 * x ** 2 + (0) * x + (4)", "completion": " ```python\ndef p(x):\n return 8 * x ** 2 + (0) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 8x² + 0x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(4)` يُرجع `132`.\nالجواب:", "qhash": "ac4d0a66dc68a50b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(28) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19', '20', '21', '22', '23', 'Hi', '25', '26', 'Yo', '28']", "assert fizz(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16']", "assert fizz(19) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19']", "assert fizz(23) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19', '20', '21', '22', '23']", "assert fizz(8) == ['1', '2', '3', '4', '5', 'Hi', '7', '8']"], "test_code": "assert fizz(28) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19', '20', '21', '22', '23', 'Hi', '25', '26', 'Yo', '28']\nassert fizz(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16']\nassert fizz(19) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19']\nassert fizz(23) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19', '20', '21', '22', '23']\nassert fizz(8) == ['1', '2', '3', '4', '5', 'Hi', '7', '8']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 9 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Hi'، وإن قَبِلها على 9 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(28)` يُرجع `['1', '2', '3', '4', '5', 'Hi', '7', '8', 'Yo', '10', '11', 'Hi', '13', '14', '15', '16', '17', 'HiYo', '19', '20', '21', '22', '23', 'Hi', '25', '26', 'Yo', '28']`.\nالجواب:", "qhash": "f0dded0c3596d883"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('is camel at') == 'at-camel-is'", "assert mirror_words('orange at') == 'at-orange'", "assert mirror_words('planet garden winter banana light camel planet music') == 'music-planet-camel-light-banana-winter-garden-planet'", "assert mirror_words('it') == 'it'", "assert mirror_words('table vector go stone apple camel falcon') == 'falcon-camel-apple-stone-go-vector-table'", "assert mirror_words('we desert summer go at we signal') == 'signal-we-at-go-summer-desert-we'", "assert mirror_words('vector cloud desert') == 'desert-cloud-vector'"], "test_code": "assert mirror_words('is camel at') == 'at-camel-is'\nassert mirror_words('orange at') == 'at-orange'\nassert mirror_words('planet garden winter banana light camel planet music') == 'music-planet-camel-light-banana-winter-garden-planet'\nassert mirror_words('it') == 'it'\nassert mirror_words('table vector go stone apple camel falcon') == 'falcon-camel-apple-stone-go-vector-table'\nassert mirror_words('we desert summer go at we signal') == 'signal-we-at-go-summer-desert-we'\nassert mirror_words('vector cloud desert') == 'desert-cloud-vector'", "answer": "def mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `mirror_words('is camel at')` يُرجع `'at-camel-is'`.\nالجواب:", "qhash": "bb59abf7ccee0211"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bds'}", "tests": ["assert freq_of('river music light camel brain') == {'b': 1, 'd': 0, 's': 1}", "assert freq_of('signal falcon vector') == {'b': 0, 'd': 0, 's': 1}", "assert freq_of('python we winter') == {'b': 0, 'd': 0, 's': 0}", "assert freq_of('to') == {'b': 0, 'd': 0, 's': 0}", "assert freq_of('data matrix at go') == {'b': 0, 'd': 1, 's': 0}", "assert freq_of('in') == {'b': 0, 'd': 0, 's': 0}", "assert freq_of('') == {'b': 0, 'd': 0, 's': 0}"], "test_code": "assert freq_of('river music light camel brain') == {'b': 1, 'd': 0, 's': 1}\nassert freq_of('signal falcon vector') == {'b': 0, 'd': 0, 's': 1}\nassert freq_of('python we winter') == {'b': 0, 'd': 0, 's': 0}\nassert freq_of('to') == {'b': 0, 'd': 0, 's': 0}\nassert freq_of('data matrix at go') == {'b': 0, 'd': 1, 's': 0}\nassert freq_of('in') == {'b': 0, 'd': 0, 's': 0}\nassert freq_of('') == {'b': 0, 'd': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bds'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bds'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'd'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('river music light camel brain')` يُرجع `{'b': 1, 'd': 0, 's': 1}`.\nالجواب:", "qhash": "565a2fc0a183d9bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('coffee music matrix !') == 'ykbbaa iqoey iwpnet !'", "assert shift_text('winter stone summer brain A1') == 'sejpan opkja oqiian xnwej A1'", "assert shift_text('code rocket OK') == 'ykza nkygap OK'", "assert shift_text('rocket of data desert !') == 'nkygap kb zwpw zaoanp !'", "assert shift_text('up it is it garden') == 'ql ep eo ep cwnzaj'", "assert shift_text('music on up winter') == 'iqoey kj ql sejpan'", "assert shift_text('') == ''"], "test_code": "assert shift_text('coffee music matrix !') == 'ykbbaa iqoey iwpnet !'\nassert shift_text('winter stone summer brain A1') == 'sejpan opkja oqiian xnwej A1'\nassert shift_text('code rocket OK') == 'ykza nkygap OK'\nassert shift_text('rocket of data desert !') == 'nkygap kb zwpw zaoanp !'\nassert shift_text('up it is it garden') == 'ql ep eo ep cwnzaj'\nassert shift_text('music on up winter') == 'iqoey kj ql sejpan'\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 + (22)) % 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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('coffee music matrix !')` يجب أن تُرجع `'ykbbaa iqoey iwpnet !'`.\nالجواب:", "qhash": "4ae9798e1f46e754"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_matching([3, 1, 13, 18, 42, 87, 38, 83, 58, 52]) == 0", "assert count_matching([50, 3, 69, 71, 69, 44]) == 0", "assert count_matching([68, 25]) == 0", "assert count_matching([64, 62]) == 1", "assert count_matching([41, 66, 75]) == 0", "assert count_matching([-19, 4, -40, 18, 21]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([3, 1, 13, 18, 42, 87, 38, 83, 58, 52]) == 0\nassert count_matching([50, 3, 69, 71, 69, 44]) == 0\nassert count_matching([68, 25]) == 0\nassert count_matching([64, 62]) == 1\nassert count_matching([41, 66, 75]) == 0\nassert count_matching([-19, 4, -40, 18, 21]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([3, 1, 13, 18, 42, 87, 38, 83, 58, 52])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "4c91c337309c7ede"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [12, 4, 15, 9, 26, 28]\nprint(data[0:4])\nprint(data[::-1])\nprint(len(data[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [12, 4, 15, 9, 26, 28]\nprint(data[0:4])\nprint(data[::-1])\nprint(len(data[0:4]))\n```\nالجواب:", "qhash": "4bc300c60543b11a", "answer": "[12, 4, 15, 9]\n[28, 26, 9, 15, 4, 12]\n4", "completion": " الناتج:\n```text\n[12, 4, 15, 9]\n[28, 26, 9, 15, 4, 12]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 356\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 = 356\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": "899286177104cd97", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([-9, -20, 52, 9, 48]) == None", "assert max_multiple([-28, -21, -14]) == -14", "assert max_multiple([1, 8, 15]) == None", "assert max_multiple([-21, 6, -18]) == -21", "assert max_multiple([40, 19, 43, 20, 28]) == 28", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-9, -20, 52, 9, 48]) == None\nassert max_multiple([-28, -21, -14]) == -14\nassert max_multiple([1, 8, 15]) == None\nassert max_multiple([-21, 6, -18]) == -21\nassert max_multiple([40, 19, 43, 20, 28]) == 28\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 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 % 7 == 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 % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(nums):\n best = 0\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_multiple([-9, -20, 52, 9, 48])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "7cc8c53c06d1f1fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [25, 10, 34, 4, 2, 13]\nprint(items[0:2])\nprint(items[::2])\nprint(max(items[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [25, 10, 34, 4, 2, 13]\nprint(items[0:2])\nprint(items[::2])\nprint(max(items[0:2]))\n```\nالجواب:", "qhash": "233217ad6c9320ff", "answer": "[25, 10]\n[25, 34, 2]\n25", "completion": " الناتج:\n```text\n[25, 10]\n[25, 34, 2]\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([26, 23, -11, 52, 21, 39, -28]) == -11", "assert biggest_mult([-55, -55, -55]) == -55", "assert biggest_mult([1]) == None", "assert biggest_mult([2, 29]) == None", "assert biggest_mult([10, 28, 9, -43, 33, -22, 48]) == 33", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([26, 23, -11, 52, 21, 39, -28]) == -11\nassert biggest_mult([-55, -55, -55]) == -55\nassert biggest_mult([1]) == None\nassert biggest_mult([2, 29]) == None\nassert biggest_mult([10, 28, 9, -43, 33, -22, 48]) == 33\nassert biggest_mult([]) == None", "answer": "def biggest_mult(values):\n best = None\n for x in values:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `biggest_mult([26, 23, -11, 52, 21, 39, -28])` يجب أن تُرجع `-11`.\nالجواب:", "qhash": "40ec0fe3611bd129"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ق'))", "tests": ["assert letter_hits('قلم شمس نور بيت ميناء سفينة بحر نور') == 1", "assert letter_hits('شجرة جبل صديق') == 0", "assert letter_hits('بحر لغة جمل شجرة') == 0", "assert letter_hits('قهوة صديق') == 1", "assert letter_hits('حاسوب شمس عمل مدينة ليل دفتر سيارة جمل') == 0", "assert letter_hits('ميناء بيت مكتبة تفاحة') == 0", "assert letter_hits('طائرة') == 0", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('قلم شمس نور بيت ميناء سفينة بحر نور') == 1\nassert letter_hits('شجرة جبل صديق') == 0\nassert letter_hits('بحر لغة جمل شجرة') == 0\nassert letter_hits('قهوة صديق') == 1\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 w.startswith('ق'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ق'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق».\nمثال: `letter_hits('قلم شمس نور بيت ميناء سفينة بحر نور')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "77a0b19f0c890e4b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'code'\nprint(s.split('_'))\nprint(s.find('c'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'code'\nprint(s.split('_'))\nprint(s.find('c'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "4410732628b9925d", "answer": "['code']\n0\nedoc", "completion": " الناتج:\n```text\n['code']\n0\nedoc\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "tests": ["assert rec_prod(5) == 10", "assert rec_prod(5) == 10", "assert rec_prod(35) == 26", "assert rec_prod(32) == 53", "assert rec_prod(9) == 44", "assert rec_prod(14) == 48", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(5) == 10\nassert rec_prod(5) == 10\nassert rec_prod(35) == 26\nassert rec_prod(32) == 53\nassert rec_prod(9) == 44\nassert rec_prod(14) == 48\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(5)` يُرجع `10`.\nالجواب:", "qhash": "6c90c8059e306326"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['data', 'pixel', 'river', 'orange', 'banana']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['data', 'pixel', 'river', 'orange', 'banana']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "480327c6aeca61b9", "answer": "['data', 'pixel', 'river', 'orange', 'banana']\n['orange', 'banana', 'river']", "completion": " الناتج:\n```text\n['data', 'pixel', 'river', 'orange', 'banana']\n['orange', 'banana', 'river']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 40) == 1)", "tests": ["assert rel_prime_count(22) == 9", "assert rel_prime_count(52) == 21", "assert rel_prime_count(81) == 33", "assert rel_prime_count(33) == 14", "assert rel_prime_count(112) == 45", "assert rel_prime_count(105) == 42", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(22) == 9\nassert rel_prime_count(52) == 21\nassert rel_prime_count(81) == 33\nassert rel_prime_count(33) == 14\nassert rel_prime_count(112) == 45\nassert rel_prime_count(105) == 42\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, 40) == 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, 40) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 40، أي أن القاسم المشترك الأكبر لها مع 40 يساوي 1.\nمثال: `rel_prime_count(22)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "2d3003e9623d329b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=6):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(-8))\nprint(g(-8, -8))\nprint(g(g(-8), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=6):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(g(-8))\nprint(g(-8, -8))\nprint(g(g(-8), -8))\n```\nالجواب:", "qhash": "45d4100389354bae", "answer": "-14\n0\n-6", "completion": " الناتج:\n```text\n-14\n0\n-6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 4) == 1)", "tests": ["assert phi_upto(10) == 5", "assert phi_upto(82) == 41", "assert phi_upto(191) == 96", "assert phi_upto(33) == 17", "assert phi_upto(199) == 100", "assert phi_upto(167) == 84", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(10) == 5\nassert phi_upto(82) == 41\nassert phi_upto(191) == 96\nassert phi_upto(33) == 17\nassert phi_upto(199) == 100\nassert phi_upto(167) == 84\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, 4) == 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, 4) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 4، أي أن القاسم المشترك الأكبر لها مع 4 يساوي 1.\nمثال: `phi_upto(10)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "1b090d321b893d12"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'cet'}", "tests": ["assert tally('by by desert') == {'c': 0, 'e': 2, 't': 1}", "assert tally('on orange music is light') == {'c': 1, 'e': 1, 't': 1}", "assert tally('python by banana brain to') == {'c': 0, 'e': 0, 't': 2}", "assert tally('coffee signal signal') == {'c': 1, 'e': 2, 't': 0}", "assert tally('go') == {'c': 0, 'e': 0, 't': 0}", "assert tally('is') == {'c': 0, 'e': 0, 't': 0}", "assert tally('') == {'c': 0, 'e': 0, 't': 0}"], "test_code": "assert tally('by by desert') == {'c': 0, 'e': 2, 't': 1}\nassert tally('on orange music is light') == {'c': 1, 'e': 1, 't': 1}\nassert tally('python by banana brain to') == {'c': 0, 'e': 0, 't': 2}\nassert tally('coffee signal signal') == {'c': 1, 'e': 2, 't': 0}\nassert tally('go') == {'c': 0, 'e': 0, 't': 0}\nassert tally('is') == {'c': 0, 'e': 0, 't': 0}\nassert tally('') == {'c': 0, 'e': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'cet'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'cet'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'e'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('by by desert')` يُرجع `{'c': 0, 'e': 2, 't': 1}`.\nالجواب:", "qhash": "62fe0fd2eb9ff609"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 8 * x ** 2 + (5) * x + (-7)", "tests": ["assert evaluate(10) == 843", "assert evaluate(-2) == 15", "assert evaluate(-7) == 350", "assert evaluate(-11) == 906", "assert evaluate(10) == 843", "assert evaluate(-5) == 168", "assert evaluate(-4) == 101", "assert evaluate(0) == -7"], "test_code": "assert evaluate(10) == 843\nassert evaluate(-2) == 15\nassert evaluate(-7) == 350\nassert evaluate(-11) == 906\nassert evaluate(10) == 843\nassert evaluate(-5) == 168\nassert evaluate(-4) == 101\nassert evaluate(0) == -7", "answer": "def evaluate(x):\n return 8 * x ** 2 + (5) * x + (-7)", "completion": " ```python\ndef evaluate(x):\n return 8 * x ** 2 + (5) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 8x² + 5x - 7 عند العدد الصحيح x.\nمثال: `evaluate(10)` يجب أن تُرجع `843`.\nالجواب:", "qhash": "f6d720fcea7b6b52"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 6\nfor j in range(10, 14, 3):\n acc += j * 4\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 6\nfor j in range(10, 14, 3):\n acc += j * 4\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "c550701da0256ffe", "answer": "98\n13", "completion": " الناتج:\n```text\n98\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 24:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([11, 9, 11, 2, 7, 1, 13, 12, 14]) == [11, 20, 0, 2, 9, 10, 23, 0, 14]", "assert acc_reset([-7, 4, 10, 5, -9, 22, -4, 18, -8]) == [-7, -3, 7, 12, 3, 0, -4, 14, 6]", "assert acc_reset([2, 4]) == [2, 6]", "assert acc_reset([11, 2, 4, 13, 21, 4, 23, -4]) == [11, 13, 17, 0, 21, 0, 23, 19]", "assert acc_reset([1, 14, 19]) == [1, 15, 0]", "assert acc_reset([20]) == [20]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([11, 9, 11, 2, 7, 1, 13, 12, 14]) == [11, 20, 0, 2, 9, 10, 23, 0, 14]\nassert acc_reset([-7, 4, 10, 5, -9, 22, -4, 18, -8]) == [-7, -3, 7, 12, 3, 0, -4, 14, 6]\nassert acc_reset([2, 4]) == [2, 6]\nassert acc_reset([11, 2, 4, 13, 21, 4, 23, -4]) == [11, 13, 17, 0, 21, 0, 23, 19]\nassert acc_reset([1, 14, 19]) == [1, 15, 0]\nassert acc_reset([20]) == [20]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 24:\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 > 24:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 24 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([11, 9, 11, 2, 7, 1, 13, 12, 14])` يجب أن تُرجع `[11, 20, 0, 2, 9, 10, 23, 0, 14]`.\nالجواب:", "qhash": "07d8e8f48dc51290"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('python to brain camel data by') == 'data camel brain python'", "assert mirror_words('falcon camel of up') == 'camel falcon'", "assert mirror_words('we music of on of coffee') == 'coffee music'", "assert mirror_words('a apple cloud of') == 'cloud apple'", "assert mirror_words('to data orange go signal go music banana') == 'banana music signal orange data'", "assert mirror_words('planet table brain in a data') == 'data brain table planet'", "assert mirror_words('go cloud by pixel') == 'pixel cloud'"], "test_code": "assert mirror_words('python to brain camel data by') == 'data camel brain python'\nassert mirror_words('falcon camel of up') == 'camel falcon'\nassert mirror_words('we music of on of coffee') == 'coffee music'\nassert mirror_words('a apple cloud of') == 'cloud apple'\nassert mirror_words('to data orange go signal go music banana') == 'banana music signal orange data'\nassert mirror_words('planet table brain in a data') == 'data brain table planet'\nassert mirror_words('go cloud by pixel') == 'pixel cloud'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `mirror_words('python to brain camel data by')` يُرجع `'data camel brain python'`.\nالجواب:", "qhash": "ba01a5a2fe99a6e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('عربية علم سماء صحراء رمل') == 2", "assert count_letter('معلم برمجة تفاحة') == 1", "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('عربية علم سماء صحراء رمل') == 2\nassert count_letter('معلم برمجة تفاحة') == 1\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 'ع' 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": "e82f702aae7e1fcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 47", "tests": ["assert digits_mod(94319) == 26", "assert digits_mod(346678) == 34", "assert digits_mod(16655) == 23", "assert digits_mod(971887) == 40", "assert digits_mod(132630) == 15", "assert digits_mod(551229) == 24", "assert digits_mod(621752) == 23", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(94319) == 26\nassert digits_mod(346678) == 34\nassert digits_mod(16655) == 23\nassert digits_mod(971887) == 40\nassert digits_mod(132630) == 15\nassert digits_mod(551229) == 24\nassert digits_mod(621752) == 23\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 47", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 47.\nللتوضيح: الاستدعاء `digits_mod(94319)` يُرجع `26`.\nالجواب:", "qhash": "8c9262e16375ef1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'code_python'\nprint(text[-1:])\nprint(text.split('_'))\nprint(text.count('p'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'code_python'\nprint(text[-1:])\nprint(text.split('_'))\nprint(text.count('p'))\n```\nالجواب:", "qhash": "4e655ab133c5be51", "answer": "n\n['code', 'python']\n1", "completion": " الناتج:\n```text\nn\n['code', 'python']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 3:\n return 3\n return 3 * f(n - 1) + 1\n\nprint(f(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 3:\n return 3\n return 3 * f(n - 1) + 1\n\nprint(f(10))\n```\nالجواب:", "qhash": "d573263b60dcc4e1", "answer": "7654", "completion": " الناتج:\n```text\n7654\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([23, 86, 90, 29, 21, 31, 82]) == 0", "assert tally_div([31, 19, -27, 70, -21, 23, 43, -21]) == 0", "assert tally_div([66, 41, 82, 50, 24, -20]) == 0", "assert tally_div([-4, 61, -18]) == 0", "assert tally_div([51, 47, 13, 58, 37]) == 0", "assert tally_div([-16, 5, 82]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([23, 86, 90, 29, 21, 31, 82]) == 0\nassert tally_div([31, 19, -27, 70, -21, 23, 43, -21]) == 0\nassert tally_div([66, 41, 82, 50, 24, -20]) == 0\nassert tally_div([-4, 61, -18]) == 0\nassert tally_div([51, 47, 13, 58, 37]) == 0\nassert tally_div([-16, 5, 82]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 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 % 8 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([23, 86, 90, 29, 21, 31, 82])` يُرجع `0`.\nالجواب:", "qhash": "cb8b4f074dbc2d1b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -9 * x ** 2 + (2) * x + (-7)", "tests": ["assert quad(8) == -567", "assert quad(14) == -1743", "assert quad(9) == -718", "assert quad(7) == -434", "assert quad(-7) == -462", "assert quad(18) == -2887", "assert quad(7) == -434", "assert quad(0) == -7"], "test_code": "assert quad(8) == -567\nassert quad(14) == -1743\nassert quad(9) == -718\nassert quad(7) == -434\nassert quad(-7) == -462\nassert quad(18) == -2887\nassert quad(7) == -434\nassert quad(0) == -7", "answer": "def quad(x):\n return -9 * x ** 2 + (2) * x + (-7)", "completion": " ```python\ndef quad(x):\n return -9 * x ** 2 + (2) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -9x² + 2x - 7 عند العدد الصحيح x.\nمثال: `quad(8)` يجب أن تُرجع `-567`.\nالجواب:", "qhash": "c359bab8fb0822ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'شجرة علم'\nprint(s[-1])\nprint(s.find('ب'))\nprint(s.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'شجرة علم'\nprint(s[-1])\nprint(s.find('ب'))\nprint(s.count('ب'))\n```\nالجواب:", "qhash": "509b7506534ea527", "answer": "م\n-1\n0", "completion": " الناتج:\n```text\nم\n-1\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 12)", "tests": ["assert pick_between([-9, 8, 1, -12, -6, 14, -14, 9, -15, -15]) == [-48, -36, -24, 4, 32, 36]", "assert pick_between([3, 26, 7, 19, 7, -4, -16, 23]) == [-16, 12, 28, 28]", "assert pick_between([59]) == []", "assert pick_between([]) == []", "assert pick_between([-9, 38, 5, 13]) == [-36, 20]", "assert pick_between([0, -27, -8, 58, -23, 48, 37, 27]) == [-32, 0]", "assert pick_between([44, 40]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-9, 8, 1, -12, -6, 14, -14, 9, -15, -15]) == [-48, -36, -24, 4, 32, 36]\nassert pick_between([3, 26, 7, 19, 7, -4, -16, 23]) == [-16, 12, 28, 28]\nassert pick_between([59]) == []\nassert pick_between([]) == []\nassert pick_between([-9, 38, 5, 13]) == [-36, 20]\nassert pick_between([0, -27, -8, 58, -23, 48, 37, 27]) == [-32, 0]\nassert pick_between([44, 40]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 12)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -13 و12 (شاملًا الطرفين) في 4.\nمثال: `pick_between([-9, 8, 1, -12, -6, 14, -14, 9, -15, -15])` يجب أن تُرجع `[-48, -36, -24, 4, 32, 36]`.\nالجواب:", "qhash": "f9f2fcea57f5d14e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([43, 22, 30, 6, 78]) == [43, 65, 95, 101, 0]", "assert capped_cumsum([134, 70, 66, 80, -6, 151]) == [134, 0, 66, 146, 140, 0]", "assert capped_cumsum([76, 13, 12, 100, 116, 17, -6, 109, 6]) == [76, 89, 101, 0, 116, 133, 127, 0, 6]", "assert capped_cumsum([69, 77, 43, 46, 14, -6, 71, 62, 48, 36]) == [69, 146, 0, 46, 60, 54, 125, 0, 48, 84]", "assert capped_cumsum([84]) == [84]", "assert capped_cumsum([73, -4, 80, 130, 26]) == [73, 69, 149, 0, 26]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([43, 22, 30, 6, 78]) == [43, 65, 95, 101, 0]\nassert capped_cumsum([134, 70, 66, 80, -6, 151]) == [134, 0, 66, 146, 140, 0]\nassert capped_cumsum([76, 13, 12, 100, 116, 17, -6, 109, 6]) == [76, 89, 101, 0, 116, 133, 127, 0, 6]\nassert capped_cumsum([69, 77, 43, 46, 14, -6, 71, 62, 48, 36]) == [69, 146, 0, 46, 60, 54, 125, 0, 48, 84]\nassert capped_cumsum([84]) == [84]\nassert capped_cumsum([73, -4, 80, 130, 26]) == [73, 69, 149, 0, 26]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(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 capped_cumsum(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سؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 152 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([43, 22, 30, 6, 78])` يُرجع `[43, 65, 95, 101, 0]`.\nالجواب:", "qhash": "af775bae48f1c9d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "tests": ["assert sum_multiples(271) == 18360", "assert sum_multiples(200) == 9900", "assert sum_multiples(45) == 506", "assert sum_multiples(26) == 156", "assert sum_multiples(212) == 11130", "assert sum_multiples(48) == 552", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(271) == 18360\nassert sum_multiples(200) == 9900\nassert sum_multiples(45) == 506\nassert sum_multiples(26) == 156\nassert sum_multiples(212) == 11130\nassert sum_multiples(48) == 552\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 % 8 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(271)` يُرجع `18360`.\nالجواب:", "qhash": "bc38d936812a68c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 129:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([41, 15, 14, 9, 14, 60, 50]) == [41, 56, 70, 79, 93, 0, 50]", "assert capped_cumsum([59, 12, 4, 100, 44, 23, 87, 63, 57, 109]) == [59, 71, 75, 0, 44, 67, 0, 63, 120, 0]", "assert capped_cumsum([76, 41, 42, 29, 71, 127, 71, 22, 87, 45]) == [76, 117, 0, 29, 100, 0, 71, 93, 0, 45]", "assert capped_cumsum([81, 104, 115, 77, 129]) == [81, 0, 115, 0, 129]", "assert capped_cumsum([128, 61, 28, 6, -7]) == [128, 0, 28, 34, 27]", "assert capped_cumsum([-1, 16, 78, 87, 36, 4, 63, 115, 110, 33]) == [-1, 15, 93, 0, 36, 40, 103, 0, 110, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([41, 15, 14, 9, 14, 60, 50]) == [41, 56, 70, 79, 93, 0, 50]\nassert capped_cumsum([59, 12, 4, 100, 44, 23, 87, 63, 57, 109]) == [59, 71, 75, 0, 44, 67, 0, 63, 120, 0]\nassert capped_cumsum([76, 41, 42, 29, 71, 127, 71, 22, 87, 45]) == [76, 117, 0, 29, 100, 0, 71, 93, 0, 45]\nassert capped_cumsum([81, 104, 115, 77, 129]) == [81, 0, 115, 0, 129]\nassert capped_cumsum([128, 61, 28, 6, -7]) == [128, 0, 28, 34, 27]\nassert capped_cumsum([-1, 16, 78, 87, 36, 4, 63, 115, 110, 33]) == [-1, 15, 93, 0, 36, 40, 103, 0, 110, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 129:\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 > 129:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 129 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([41, 15, 14, 9, 14, 60, 50])` يُرجع `[41, 56, 70, 79, 93, 0, 50]`.\nالجواب:", "qhash": "a972d8c92c07c3be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 3 for x in xs if 9 <= x <= 35)", "tests": ["assert between_times([29, 30, 4, 33, 13, 35, 38, 18, 28, 40]) == [39, 54, 84, 87, 90, 99, 105]", "assert between_times([60, 34, -13, 53, 56, -5, 10, 42, 11, 27]) == [30, 33, 81, 102]", "assert between_times([20]) == [60]", "assert between_times([26, -16, -11, 37, -21]) == [78]", "assert between_times([0, -9, 19, 50, 57, -21, 60, 27, -16]) == [57, 81]", "assert between_times([6, 36, 27, 53, 58, -1, 47, 6, 33]) == [81, 99]", "assert between_times([41, 1, 46, 13, -30, -28]) == [39]", "assert between_times([]) == []"], "test_code": "assert between_times([29, 30, 4, 33, 13, 35, 38, 18, 28, 40]) == [39, 54, 84, 87, 90, 99, 105]\nassert between_times([60, 34, -13, 53, 56, -5, 10, 42, 11, 27]) == [30, 33, 81, 102]\nassert between_times([20]) == [60]\nassert between_times([26, -16, -11, 37, -21]) == [78]\nassert between_times([0, -9, 19, 50, 57, -21, 60, 27, -16]) == [57, 81]\nassert between_times([6, 36, 27, 53, 58, -1, 47, 6, 33]) == [81, 99]\nassert between_times([41, 1, 46, 13, -30, -28]) == [39]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 3 for x in xs if 9 <= x <= 35)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 3 for x in xs if 9 <= x <= 35)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 9 و35 (شاملًا الطرفين) في 3.\nمثال: `between_times([29, 30, 4, 33, 13, 35, 38, 18, 28, 40])` يجب أن تُرجع `[39, 54, 84, 87, 90, 99, 105]`.\nالجواب:", "qhash": "804eda78f27b503b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(435638065))\nprint(f(f(435638065)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(435638065))\nprint(f(f(435638065)))\n```\nالجواب:", "qhash": "7f3c18bb4934bae0", "answer": "40\n4", "completion": " الناتج:\n```text\n40\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 18\nfor j in range(9, 14, 1):\n result -= j * 6\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 18\nfor j in range(9, 14, 1):\n result -= j * 6\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "095a94a95cd49fb6", "answer": "-312\n13", "completion": " الناتج:\n```text\n-312\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert roll([5, 6, 32, 5, 26, 27]) == [27, 5, 6, 32, 5, 26]", "assert roll([29, -6, 48, 27, 9, 42, 28, 40, 48, 45, 35]) == [28, 40, 48, 45, 35, 29, -6, 48, 27, 9, 42]", "assert roll([-6, 45, 5, 50, 23, 27]) == [27, -6, 45, 5, 50, 23]", "assert roll([43, 27, 35, 9, -8]) == [35, 9, -8, 43, 27]", "assert roll([12]) == [12]", "assert roll([49, 25, 46, 43, 9, 28, 12]) == [43, 9, 28, 12, 49, 25, 46]", "assert roll([]) == []"], "test_code": "assert roll([5, 6, 32, 5, 26, 27]) == [27, 5, 6, 32, 5, 26]\nassert roll([29, -6, 48, 27, 9, 42, 28, 40, 48, 45, 35]) == [28, 40, 48, 45, 35, 29, -6, 48, 27, 9, 42]\nassert roll([-6, 45, 5, 50, 23, 27]) == [27, -6, 45, 5, 50, 23]\nassert roll([43, 27, 35, 9, -8]) == [35, 9, -8, 43, 27]\nassert roll([12]) == [12]\nassert roll([49, 25, 46, 43, 9, 28, 12]) == [43, 9, 28, 12, 49, 25, 46]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 17 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `roll([5, 6, 32, 5, 26, 27])` يُرجع `[27, 5, 6, 32, 5, 26]`.\nالجواب:", "qhash": "70a8608f83aeeda7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-14, 14, 49, -15, 48, -18]) == 48", "assert find_max_div([-6, -12, -24]) == -6", "assert find_max_div([1, 7, 13, 19]) == None", "assert find_max_div([-15]) == None", "assert find_max_div([-46, -48, -27]) == -48", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-14, 14, 49, -15, 48, -18]) == 48\nassert find_max_div([-6, -12, -24]) == -6\nassert find_max_div([1, 7, 13, 19]) == None\nassert find_max_div([-15]) == None\nassert find_max_div([-46, -48, -27]) == -48\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `find_max_div([-14, 14, 49, -15, 48, -18])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "3b353530c2fd664e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 81) == 1)", "tests": ["assert coprimes(53) == 36", "assert coprimes(162) == 108", "assert coprimes(148) == 99", "assert coprimes(197) == 132", "assert coprimes(82) == 55", "assert coprimes(118) == 79", "assert coprimes(1) == 1"], "test_code": "assert coprimes(53) == 36\nassert coprimes(162) == 108\nassert coprimes(148) == 99\nassert coprimes(197) == 132\nassert coprimes(82) == 55\nassert coprimes(118) == 79\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, 81) == 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, 81) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 81، أي أن القاسم المشترك الأكبر لها مع 81 يساوي 1.\nمثال: `coprimes(53)` يجب أن تُرجع `36`.\nالجواب:", "qhash": "20568cbb6d9d6acb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('سعيد', 26), ('هدى', 60), ('يوسف', 62), ('حسن', 47)]\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 = [('سعيد', 26), ('هدى', 60), ('يوسف', 62), ('حسن', 47)]\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": "6702d2b62b53fb85", "answer": "[('سعيد', 26), ('حسن', 47), ('هدى', 60), ('يوسف', 62)]\n['يوسف', 'هدى']", "completion": " الناتج:\n```text\n[('سعيد', 26), ('حسن', 47), ('هدى', 60), ('يوسف', 62)]\n['يوسف', 'هدى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 102:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([9, 56, 30, 15, 10, 50, 41]) == [9, 65, 95, 0, 10, 60, 101]", "assert capped_cumsum([-2, 94, 85]) == [-2, 92, 0]", "assert capped_cumsum([43, 18]) == [43, 61]", "assert capped_cumsum([29, 20, 5, 70, 91, 61]) == [29, 49, 54, 0, 91, 0]", "assert capped_cumsum([58, 73, 48, 16, 69, 73]) == [58, 0, 48, 64, 0, 73]", "assert capped_cumsum([87, 59, 82, 93, 8, 11, 29, 90]) == [87, 0, 82, 0, 8, 19, 48, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([9, 56, 30, 15, 10, 50, 41]) == [9, 65, 95, 0, 10, 60, 101]\nassert capped_cumsum([-2, 94, 85]) == [-2, 92, 0]\nassert capped_cumsum([43, 18]) == [43, 61]\nassert capped_cumsum([29, 20, 5, 70, 91, 61]) == [29, 49, 54, 0, 91, 0]\nassert capped_cumsum([58, 73, 48, 16, 69, 73]) == [58, 0, 48, 64, 0, 73]\nassert capped_cumsum([87, 59, 82, 93, 8, 11, 29, 90]) == [87, 0, 82, 0, 8, 19, 48, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 102:\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 > 102:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 102 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([9, 56, 30, 15, 10, 50, 41])` يجب أن تُرجع `[9, 65, 95, 0, 10, 60, 101]`.\nالجواب:", "qhash": "e64a2bda1ac32ee6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 1\nfor j in range(-2, 3, 1):\n acc += j * 9\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 1\nfor j in range(-2, 3, 1):\n acc += j * 9\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "cd361421d068ed43", "answer": "1\n2", "completion": " الناتج:\n```text\n1\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([47, 12, 40, 15]) == 12", "assert biggest_mult([-48, -24, -36]) == -24", "assert biggest_mult([1]) == None", "assert biggest_mult([-10, 3, 32, -29, -18]) == None", "assert biggest_mult([31, 14, 13]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([47, 12, 40, 15]) == 12\nassert biggest_mult([-48, -24, -36]) == -24\nassert biggest_mult([1]) == None\nassert biggest_mult([-10, 3, 32, -29, -18]) == None\nassert biggest_mult([31, 14, 13]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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للتوضيح: الاستدعاء `biggest_mult([47, 12, 40, 15])` يُرجع `12`.\nالجواب:", "qhash": "d3b917cd25118ab9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 5 + 4 for x in range(-2, 5) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 5 + 4 for x in range(-2, 5) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "6f900267fb6a8b57", "answer": "[-1, 24]\n2 23", "completion": " الناتج:\n```text\n[-1, 24]\n2 23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 105\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 = 105\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": "a04606b3eaf6d604", "answer": "38", "completion": " الناتج:\n```text\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_by([35, 12, 22, 44]) == [44, 35, 12, 22]", "assert rotate_by([-7, -1, 36, 44, 6, -9, 21, 35, 7, 18, -2, 3]) == [3, -7, -1, 36, 44, 6, -9, 21, 35, 7, 18, -2]", "assert rotate_by([22, 11, 38, 11]) == [11, 22, 11, 38]", "assert rotate_by([33, -5, 25, 3, 1, 39, -8, 46]) == [46, 33, -5, 25, 3, 1, 39, -8]", "assert rotate_by([48, 26, 20, 43, 48]) == [48, 48, 26, 20, 43]", "assert rotate_by([4, 24, 49, 4, 38, 28, 29, 50, 32]) == [32, 4, 24, 49, 4, 38, 28, 29, 50]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([35, 12, 22, 44]) == [44, 35, 12, 22]\nassert rotate_by([-7, -1, 36, 44, 6, -9, 21, 35, 7, 18, -2, 3]) == [3, -7, -1, 36, 44, 6, -9, 21, 35, 7, 18, -2]\nassert rotate_by([22, 11, 38, 11]) == [11, 22, 11, 38]\nassert rotate_by([33, -5, 25, 3, 1, 39, -8, 46]) == [46, 33, -5, 25, 3, 1, 39, -8]\nassert rotate_by([48, 26, 20, 43, 48]) == [48, 48, 26, 20, 43]\nassert rotate_by([4, 24, 49, 4, 38, 28, 29, 50, 32]) == [32, 4, 24, 49, 4, 38, 28, 29, 50]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 1 % len(xs)\n return ____\n```\nمثال: `rotate_by([35, 12, 22, 44])` يجب أن تُرجع `[44, 35, 12, 22]`.\nالجواب:", "qhash": "ccac3d787b23152a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 2) // 3 for x in range(-3, 8) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 2) // 3 for x in range(-3, 8) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "988ecc7ed07e7f67", "answer": "[0, 1, 2]\n3 3", "completion": " الناتج:\n```text\n[0, 1, 2]\n3 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert sum_div(269) == 5187", "assert sum_div(264) == 4921", "assert sum_div(20) == 21", "assert sum_div(66) == 315", "assert sum_div(159) == 1771", "assert sum_div(13) == 7", "assert sum_div(1) == 0"], "test_code": "assert sum_div(269) == 5187\nassert sum_div(264) == 4921\nassert sum_div(20) == 21\nassert sum_div(66) == 315\nassert sum_div(159) == 1771\nassert sum_div(13) == 7\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(269)` يُرجع `5187`.\nالجواب:", "qhash": "8b86ebdfd8b92847"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سفينة قلم برمجة مدرسة قلم') == 1", "assert words_starting('صديق عمل شمس نور بحر صديق') == 0", "assert words_starting('ليل مدرسة فجر مطر جبل صحراء ماء قمر') == 3", "assert words_starting('برمجة مدرسة رمل مدينة نور طالب') == 2", "assert words_starting('عربية طائرة طالب جمل صحراء') == 0", "assert words_starting('ماء مطر سماء عمل شجرة قهوة') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('سفينة قلم برمجة مدرسة قلم') == 1\nassert words_starting('صديق عمل شمس نور بحر صديق') == 0\nassert words_starting('ليل مدرسة فجر مطر جبل صحراء ماء قمر') == 3\nassert words_starting('برمجة مدرسة رمل مدينة نور طالب') == 2\nassert words_starting('عربية طائرة طالب جمل صحراء') == 0\nassert words_starting('ماء مطر سماء عمل شجرة قهوة') == 2\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('سفينة قلم برمجة مدرسة قلم')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "b6ce0ef52f59b843"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "words_starting", "reference": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('و'):\n count += 1\n return count", "tests": ["assert words_starting('سفينة وردة بيت حاسوب وردة قلم') == 2", "assert words_starting('فجر تفاحة علم ليل') == 0", "assert words_starting('قلم مدرسة قمر صحراء كتاب برمجة وردة وردة') == 2", "assert words_starting('وردة جبل لغة') == 1", "assert words_starting('مدينة قمر بيت وردة برمجة عمل معلم') == 1", "assert words_starting('وردة وردة نور شمس سلام كتاب') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('سفينة وردة بيت حاسوب وردة قلم') == 2\nassert words_starting('فجر تفاحة علم ليل') == 0\nassert words_starting('قلم مدرسة قمر صحراء كتاب برمجة وردة وردة') == 2\nassert words_starting('وردة جبل لغة') == 1\nassert words_starting('مدينة قمر بيت وردة برمجة عمل معلم') == 1\nassert words_starting('وردة وردة نور شمس سلام كتاب') == 2\nassert words_starting('') == 0", "answer": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('و'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('و'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(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 words_starting(sentence):\n count = 0\n for w in sentence.split():\n if 'و' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `words_starting('سفينة وردة بيت حاسوب وردة قلم')` يُرجع `2`.\nالجواب:", "qhash": "974b0489276385b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [-9, 1, 10, -7, 12, 7, 30]\nprint(nums[2:6])\nprint(nums[::3])\nprint(max(nums[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-9, 1, 10, -7, 12, 7, 30]\nprint(nums[2:6])\nprint(nums[::3])\nprint(max(nums[2:6]))\n```\nالجواب:", "qhash": "1fc2b4eac044b1ce", "answer": "[10, -7, 12, 7]\n[-9, -7, 30]\n12", "completion": " الناتج:\n```text\n[10, -7, 12, 7]\n[-9, -7, 30]\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_div([1, 10, 65, 25, 66, 19, 58, 4]) == 0", "assert count_div([8, 90, 32, 55, -5, 77, 30, 28, -34, -33, 22, 15]) == 2", "assert count_div([-30, 43, 43, 59, -10, 76, -22, -13, 86]) == 0", "assert count_div([-37]) == 0", "assert count_div([]) == 0", "assert count_div([5]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([1, 10, 65, 25, 66, 19, 58, 4]) == 0\nassert count_div([8, 90, 32, 55, -5, 77, 30, 28, -34, -33, 22, 15]) == 2\nassert count_div([-30, 43, 43, 59, -10, 76, -22, -13, 86]) == 0\nassert count_div([-37]) == 0\nassert count_div([]) == 0\nassert count_div([5]) == 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 % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([1, 10, 65, 25, 66, 19, 58, 4])` يُرجع `0`.\nالجواب:", "qhash": "d82fb3434ac78c8a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'رنا': 9, 'عمر': 23, 'منى': 16}\nd['رنا'] += 8\nd['حسن'] = 25\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 32])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'رنا': 9, 'عمر': 23, 'منى': 16}\nd['رنا'] += 8\nd['حسن'] = 25\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 32])\n```\nالجواب:", "qhash": "9c7c34c231b9df35", "answer": "4\nحسن\n81\n[]", "completion": " الناتج:\n```text\n4\nحسن\n81\n[]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'خبز سفينة'\nprint('ب' in text)\nprint(len(text.replace(' ', '')))\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'خبز سفينة'\nprint('ب' in text)\nprint(len(text.replace(' ', '')))\nprint(text[0])\n```\nالجواب:", "qhash": "20630f27e9639019", "answer": "True\n8\nخ", "completion": " الناتج:\n```text\nTrue\n8\nخ\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'apple'\nprint(word[-3:])\nprint(word.upper())\nprint(word.index('p') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'apple'\nprint(word[-3:])\nprint(word.upper())\nprint(word.index('p') + len(word))\n```\nالجواب:", "qhash": "4d20d043502bb946", "answer": "ple\nAPPLE\n6", "completion": " الناتج:\n```text\nple\nAPPLE\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(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([1, 17, 13, 10]) == [10, 1, 17, 13]", "assert rotate([37, 13, 19, 12]) == [12, 37, 13, 19]", "assert rotate([50, 31, 50]) == [31, 50, 50]", "assert rotate([14, -8, 34, -1, 46, 37, 26, 32]) == [32, 14, -8, 34, -1, 46, 37, 26]", "assert rotate([3, 4, 36, 48, 25, -1, 29, 19]) == [19, 3, 4, 36, 48, 25, -1, 29]", "assert rotate([39, -6, 32, 43, 44]) == [43, 44, 39, -6, 32]", "assert rotate([]) == []"], "test_code": "assert rotate([1, 17, 13, 10]) == [10, 1, 17, 13]\nassert rotate([37, 13, 19, 12]) == [12, 37, 13, 19]\nassert rotate([50, 31, 50]) == [31, 50, 50]\nassert rotate([14, -8, 34, -1, 46, 37, 26, 32]) == [32, 14, -8, 34, -1, 46, 37, 26]\nassert rotate([3, 4, 36, 48, 25, -1, 29, 19]) == [19, 3, 4, 36, 48, 25, -1, 29]\nassert rotate([39, -6, 32, 43, 44]) == [43, 44, 39, -6, 32]\nassert rotate([]) == []", "answer": "def rotate(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(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(lst):\n if not lst:\n return []\n k = 17 % len(lst)\n return ____\n```\nمثال: `rotate([1, 17, 13, 10])` يجب أن تُرجع `[10, 1, 17, 13]`.\nالجواب:", "qhash": "845a78271f7a43f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 6\nfor n in range(9, 32, 3):\n acc += n * 1\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 6\nfor n in range(9, 32, 3):\n acc += n * 1\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "05d7a82a092e5a95", "answer": "162\n30", "completion": " الناتج:\n```text\n162\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 73", "tests": ["assert rec_prod(9) == 69", "assert rec_prod(41) == 13", "assert rec_prod(38) == 27", "assert rec_prod(52) == 67", "assert rec_prod(37) == 19", "assert rec_prod(50) == 42", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(9) == 69\nassert rec_prod(41) == 13\nassert rec_prod(38) == 27\nassert rec_prod(52) == 67\nassert rec_prod(37) == 19\nassert rec_prod(50) == 42\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 73", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(9)` يُرجع `69`.\nالجواب:", "qhash": "8ba9a9ea36bc272a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_div(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 tally_div([15, 14, 51, 12, 25, 12, 71, 48, 8]) == 4", "assert tally_div([32, 37, 37, -32, 61, 72, 70, 34, -15]) == 3", "assert tally_div([]) == 0", "assert tally_div([-7]) == 0", "assert tally_div([48, 11, 81]) == 1", "assert tally_div([58, -4, 66, 24, -35]) == 2", "assert tally_div([]) == 0"], "test_code": "assert tally_div([15, 14, 51, 12, 25, 12, 71, 48, 8]) == 4\nassert tally_div([32, 37, 37, -32, 61, 72, 70, 34, -15]) == 3\nassert tally_div([]) == 0\nassert tally_div([-7]) == 0\nassert tally_div([48, 11, 81]) == 1\nassert tally_div([58, -4, 66, 24, -35]) == 2\nassert tally_div([]) == 0", "answer": "def tally_div(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 tally_div(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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `tally_div([15, 14, 51, 12, 25, 12, 71, 48, 8])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "e4e80f7e666bbe3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 1 * x ** 2 + (-4) * x + (-3)", "tests": ["assert eval_poly(2) == -7", "assert eval_poly(-7) == 74", "assert eval_poly(-1) == 2", "assert eval_poly(1) == -6", "assert eval_poly(17) == 218", "assert eval_poly(14) == 137", "assert eval_poly(11) == 74", "assert eval_poly(0) == -3"], "test_code": "assert eval_poly(2) == -7\nassert eval_poly(-7) == 74\nassert eval_poly(-1) == 2\nassert eval_poly(1) == -6\nassert eval_poly(17) == 218\nassert eval_poly(14) == 137\nassert eval_poly(11) == 74\nassert eval_poly(0) == -3", "answer": "def eval_poly(x):\n return 1 * x ** 2 + (-4) * x + (-3)", "completion": " ```python\ndef eval_poly(x):\n return 1 * x ** 2 + (-4) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 1x² - 4x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(2)` يُرجع `-7`.\nالجواب:", "qhash": "d02fbf1362ac2963"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (8) * x + (-8)", "tests": ["assert poly(10) == -228", "assert poly(-6) == -164", "assert poly(2) == -4", "assert poly(11) == -283", "assert poly(-12) == -536", "assert poly(-18) == -1124", "assert poly(9) == -179", "assert poly(0) == -8"], "test_code": "assert poly(10) == -228\nassert poly(-6) == -164\nassert poly(2) == -4\nassert poly(11) == -283\nassert poly(-12) == -536\nassert poly(-18) == -1124\nassert poly(9) == -179\nassert poly(0) == -8", "answer": "def poly(x):\n return -3 * x ** 2 + (8) * x + (-8)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (8) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار -3x² + 8x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(10)` يُرجع `-228`.\nالجواب:", "qhash": "db48b748f8fd0a9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)", "tests": ["assert add_multiples(252) == 14793", "assert add_multiples(125) == 3543", "assert add_multiples(108) == 2625", "assert add_multiples(218) == 11039", "assert add_multiples(201) == 9368", "assert add_multiples(175) == 7118", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(252) == 14793\nassert add_multiples(125) == 3543\nassert add_multiples(108) == 2625\nassert add_multiples(218) == 11039\nassert add_multiples(201) == 9368\nassert add_multiples(175) == 7118\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 % 5 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 5، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(252)` يُرجع `14793`.\nالجواب:", "qhash": "52650abaae6b493f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 2\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(12))", "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(12))\n```\nالجواب:", "qhash": "217037928ffb60ec", "answer": "610", "completion": " الناتج:\n```text\n610\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'dr'}", "tests": ["assert count_chars('cloud data') == {'d': 2, 'r': 0}", "assert count_chars('a winter vector orange we orange') == {'d': 0, 'r': 4}", "assert count_chars('engine at cloud orange') == {'d': 1, 'r': 1}", "assert count_chars('coffee apple go') == {'d': 0, 'r': 0}", "assert count_chars('at desert apple summer') == {'d': 1, 'r': 2}", "assert count_chars('by engine pixel') == {'d': 0, 'r': 0}", "assert count_chars('') == {'d': 0, 'r': 0}"], "test_code": "assert count_chars('cloud data') == {'d': 2, 'r': 0}\nassert count_chars('a winter vector orange we orange') == {'d': 0, 'r': 4}\nassert count_chars('engine at cloud orange') == {'d': 1, 'r': 1}\nassert count_chars('coffee apple go') == {'d': 0, 'r': 0}\nassert count_chars('at desert apple summer') == {'d': 1, 'r': 2}\nassert count_chars('by engine pixel') == {'d': 0, 'r': 0}\nassert count_chars('') == {'d': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'dr'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'dr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('cloud data')` يُرجع `{'d': 2, 'r': 0}`.\nالجواب:", "qhash": "5867a50ddf28aaee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 71) == 1)", "tests": ["assert rel_prime_count(78) == 77", "assert rel_prime_count(198) == 196", "assert rel_prime_count(30) == 30", "assert rel_prime_count(59) == 59", "assert rel_prime_count(200) == 198", "assert rel_prime_count(131) == 130", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(78) == 77\nassert rel_prime_count(198) == 196\nassert rel_prime_count(30) == 30\nassert rel_prime_count(59) == 59\nassert rel_prime_count(200) == 198\nassert rel_prime_count(131) == 130\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, 71) == 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, 71) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 71، أي أن القاسم المشترك الأكبر لها مع 71 يساوي 1.\nمثال: `rel_prime_count(78)` يجب أن تُرجع `77`.\nالجواب:", "qhash": "509863b3b56b2612"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=1):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(-7))\nprint(g(-7, 4))\nprint(g(g(4), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=1):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(g(-7))\nprint(g(-7, 4))\nprint(g(g(4), -7))\n```\nالجواب:", "qhash": "64ee9ad45e55fecc", "answer": "-6\n-3\n10", "completion": " الناتج:\n```text\n-6\n-3\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 7", "tests": ["assert rec_prod(7) == 0", "assert rec_prod(58) == 0", "assert rec_prod(21) == 0", "assert rec_prod(14) == 0", "assert rec_prod(36) == 0", "assert rec_prod(44) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(7) == 0\nassert rec_prod(58) == 0\nassert rec_prod(21) == 0\nassert rec_prod(14) == 0\nassert rec_prod(36) == 0\nassert rec_prod(44) == 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)) % 7", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(7)` يُرجع `0`.\nالجواب:", "qhash": "8adcc916b414b235"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 2 for x in xs if -18 <= x <= 0)", "tests": ["assert pick_between([5, -2, -22, -16, -7, -15]) == [-32, -30, -14, -4]", "assert pick_between([18, 27, 17, -8, 56, 32, 14, 26, -23, -1]) == [-16, -2]", "assert pick_between([-23, 27, 16, 12]) == []", "assert pick_between([57, 45, -14]) == [-28]", "assert pick_between([6, 49, 53, 56, -5, -21, 26]) == [-10]", "assert pick_between([35]) == []", "assert pick_between([57, -2, 14, -22, 52, 35, 40, 40]) == [-4]", "assert pick_between([]) == []"], "test_code": "assert pick_between([5, -2, -22, -16, -7, -15]) == [-32, -30, -14, -4]\nassert pick_between([18, 27, 17, -8, 56, 32, 14, 26, -23, -1]) == [-16, -2]\nassert pick_between([-23, 27, 16, 12]) == []\nassert pick_between([57, 45, -14]) == [-28]\nassert pick_between([6, 49, 53, 56, -5, -21, 26]) == [-10]\nassert pick_between([35]) == []\nassert pick_between([57, -2, 14, -22, 52, 35, 40, 40]) == [-4]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 2 for x in xs if -18 <= x <= 0)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 2 for x in xs if -18 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و0 (شاملًا الطرفين) في 2.\nمثال: `pick_between([5, -2, -22, -16, -7, -15])` يجب أن تُرجع `[-32, -30, -14, -4]`.\nالجواب:", "qhash": "0388b7bdc7735e00"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 5 + -9 for x in range(3, 17) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 5 + -9 for x in range(3, 17) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "47afd58b120b021d", "answer": "[21, 46, 71]\n3 138", "completion": " الناتج:\n```text\n[21, 46, 71]\n3 138\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(788349632))\nprint(rec(rec(788349632)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(788349632))\nprint(rec(rec(788349632)))\n```\nالجواب:", "qhash": "201809ae708c6d50", "answer": "50\n5", "completion": " الناتج:\n```text\n50\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "tests": ["assert sum_powers(5) == 3916", "assert sum_powers(0) == 0", "assert sum_powers(5) == 3916", "assert sum_powers(6) == 9100", "assert sum_powers(1) == 4", "assert sum_powers(1) == 4", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(5) == 3916\nassert sum_powers(0) == 0\nassert sum_powers(5) == 3916\nassert sum_powers(6) == 9100\nassert sum_powers(1) == 4\nassert sum_powers(1) == 4\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total\n```\n", "buggy": "def sum_powers(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 sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(5)` يُرجع `3916`.\nالجواب:", "qhash": "043b34e2fdff5a92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(933006161))\nprint(f(f(933006161)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(933006161))\nprint(f(f(933006161)))\n```\nالجواب:", "qhash": "5c4ba038b072b7fc", "answer": "29\n11", "completion": " الناتج:\n```text\n29\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'rocket'\nprint(s.count('t'))\nprint(s.index('t') + len(s))\nprint(s.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'rocket'\nprint(s.count('t'))\nprint(s.index('t') + len(s))\nprint(s.upper())\n```\nالجواب:", "qhash": "c524ed7ff2c609b0", "answer": "1\n11\nROCKET", "completion": " الناتج:\n```text\n1\n11\nROCKET\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 41", "tests": ["assert multi_fact(6) == 18", "assert multi_fact(12) == 17", "assert multi_fact(10) == 34", "assert multi_fact(50) == 0", "assert multi_fact(50) == 0", "assert multi_fact(0) == 1", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(6) == 18\nassert multi_fact(12) == 17\nassert multi_fact(10) == 34\nassert multi_fact(50) == 0\nassert multi_fact(50) == 0\nassert multi_fact(0) == 1\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 41", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(6)` يُرجع `18`.\nالجواب:", "qhash": "5569c55fffb27796"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('شجرة نهار طائرة ليل عمل')` يُرجع `0`.\nالجواب:", "qhash": "6b4fea874b6d9f10"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(14))\nprint(compute(14, -2))\nprint(compute(compute(-2), 14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(14))\nprint(compute(14, -2))\nprint(compute(compute(-2), 14))\n```\nالجواب:", "qhash": "cbd810ee3e18b466", "answer": "67\n72\n83", "completion": " الناتج:\n```text\n67\n72\n83\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [12, 33, 37, 35, 24, 28, -1, 28]\nprint(nums[0:1])\nprint(nums[::-2])\nprint(max(nums[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [12, 33, 37, 35, 24, 28, -1, 28]\nprint(nums[0:1])\nprint(nums[::-2])\nprint(max(nums[0:1]))\n```\nالجواب:", "qhash": "a828e912f5984177", "answer": "[12]\n[28, 28, 35, 33]\n12", "completion": " الناتج:\n```text\n[12]\n[28, 28, 35, 33]\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'table'\nprint(name.replace('a', '#'))\nprint(name[3:4])\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'table'\nprint(name.replace('a', '#'))\nprint(name[3:4])\nprint(name.split('_'))\n```\nالجواب:", "qhash": "6b67ee9973fcbab9", "answer": "t#ble\nl\n['table']", "completion": " الناتج:\n```text\nt#ble\nl\n['table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_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 count_div([19, 6, 11, 19, 43, 54, 72]) == 0", "assert count_div([-37, 32, -11, 17, 37, -7, 72, 3, 55]) == 0", "assert count_div([54, -1, 16, 25, 89, 57, 60, 32, 10]) == 0", "assert count_div([71, -25, -36, 11, -30, 85]) == 0", "assert count_div([31, -21, 23, 76]) == 0", "assert count_div([-15, -21, 77, -30, -38, 50, -28, -1, 76, -39, 61, 43]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([19, 6, 11, 19, 43, 54, 72]) == 0\nassert count_div([-37, 32, -11, 17, 37, -7, 72, 3, 55]) == 0\nassert count_div([54, -1, 16, 25, 89, 57, 60, 32, 10]) == 0\nassert count_div([71, -25, -36, 11, -30, 85]) == 0\nassert count_div([31, -21, 23, 76]) == 0\nassert count_div([-15, -21, 77, -30, -38, 50, -28, -1, 76, -39, 61, 43]) == 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 % 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 % 8 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([19, 6, 11, 19, 43, 54, 72])` يُرجع `0`.\nالجواب:", "qhash": "b2fe03fb90c95376"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('a planet desert') == 'o dzobsh rsgsfh'", "assert shift_text('orange data 2024') == 'cfobus roho 2024'", "assert shift_text('in pixel is') == 'wb dwlsz wg'", "assert shift_text('music orange vector up') == 'aigwq cfobus jsqhcf id'", "assert shift_text('matrix is camel') == 'aohfwl wg qoasz'", "assert shift_text('camel') == 'qoasz'", "assert shift_text('') == ''"], "test_code": "assert shift_text('a planet desert') == 'o dzobsh rsgsfh'\nassert shift_text('orange data 2024') == 'cfobus roho 2024'\nassert shift_text('in pixel is') == 'wb dwlsz wg'\nassert shift_text('music orange vector up') == 'aigwq cfobus jsqhcf id'\nassert shift_text('matrix is camel') == 'aohfwl wg qoasz'\nassert shift_text('camel') == 'qoasz'\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 + (14)) % 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 + (14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('a planet desert')` يجب أن تُرجع `'o dzobsh rsgsfh'`.\nالجواب:", "qhash": "a477999f98abb7b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('to') == 'vq'", "assert rotate_letters('is pixel of planet') == 'ku rkzgn qh rncpgv'", "assert rotate_letters('it orange table') == 'kv qtcpig vcdng'", "assert rotate_letters('stone vector river stone Hello') == 'uvqpg xgevqt tkxgt uvqpg Hgnnq'", "assert rotate_letters('table orange stone') == 'vcdng qtcpig uvqpg'", "assert rotate_letters('brain python window engine') == 'dtckp ravjqp ykpfqy gpikpg'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('to') == 'vq'\nassert rotate_letters('is pixel of planet') == 'ku rkzgn qh rncpgv'\nassert rotate_letters('it orange table') == 'kv qtcpig vcdng'\nassert rotate_letters('stone vector river stone Hello') == 'uvqpg xgevqt tkxgt uvqpg Hgnnq'\nassert rotate_letters('table orange stone') == 'vcdng qtcpig uvqpg'\nassert rotate_letters('brain python window engine') == 'dtckp ravjqp ykpfqy gpikpg'\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 + (-24)) % 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 + (-24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('to')` يُرجع `'vq'`.\nالجواب:", "qhash": "4f6a00971389df08"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'حاسوب'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'حاسوب'\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))\n```\nالجواب:", "qhash": "698fe597f142e495", "answer": "['حاسوب']\n5\n5", "completion": " الناتج:\n```text\n['حاسوب']\n5\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert sum_powers(6) == 18200", "assert sum_powers(9) == 122664", "assert sum_powers(12) == 485680", "assert sum_powers(1) == 8", "assert sum_powers(1) == 8", "assert sum_powers(1) == 8", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 18200\nassert sum_powers(9) == 122664\nassert sum_powers(12) == 485680\nassert sum_powers(1) == 8\nassert sum_powers(1) == 8\nassert sum_powers(1) == 8\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `18200`.\nالجواب:", "qhash": "99f43b77be5b3884"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'خالد': 17, 'سلمى': 49, 'باسل': 19}\nmarks['خالد'] += 13\nmarks['نور'] = 43\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 13])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'خالد': 17, 'سلمى': 49, 'باسل': 19}\nmarks['خالد'] += 13\nmarks['نور'] = 43\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 13])\n```\nالجواب:", "qhash": "b97074a30fdd4b2e", "answer": "4\nسلمى\n141\n['خالد', 'سلمى', 'باسل', 'نور']", "completion": " الناتج:\n```text\n4\nسلمى\n141\n['خالد', 'سلمى', 'باسل', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 20\nfor j in range(-5, 9, 3):\n acc += j * 4\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 20\nfor j in range(-5, 9, 3):\n acc += j * 4\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "18e763e35adc83b3", "answer": "40\n7", "completion": " الناتج:\n```text\n40\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 0 + 4 for x in range(3, 8) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 0 + 4 for x in range(3, 8) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "848331f4a225bd79", "answer": "[4]\n1 4", "completion": " الناتج:\n```text\n[4]\n1 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(16))\nprint(calc(16, -8))\nprint(calc(calc(-8), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(16))\nprint(calc(16, -8))\nprint(calc(calc(-8), 16))\n```\nالجواب:", "qhash": "a69baecd7f20b3e2", "answer": "47\n56\n43", "completion": " الناتج:\n```text\n47\n56\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= -3)", "tests": ["assert pick_between([-20, -12, -8, 4, -7, -5]) == [25, 35, 40, 60]", "assert pick_between([25, 40, 48, -12]) == [60]", "assert pick_between([-2, 47, 6, 55, -11]) == [55]", "assert pick_between([-29, 51, 41, 5, 40, 22, 54]) == []", "assert pick_between([32, -29, 46, 11, 40, 24, 50, 16, 8]) == []", "assert pick_between([9, 19, 21, -29, -17, -26, -24, -7, 35, 47]) == [35]", "assert pick_between([56, -13, 55, 28]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-20, -12, -8, 4, -7, -5]) == [25, 35, 40, 60]\nassert pick_between([25, 40, 48, -12]) == [60]\nassert pick_between([-2, 47, 6, 55, -11]) == [55]\nassert pick_between([-29, 51, 41, 5, 40, 22, 54]) == []\nassert pick_between([32, -29, 46, 11, 40, 24, 50, 16, 8]) == []\nassert pick_between([9, 19, 21, -29, -17, -26, -24, -7, 35, 47]) == [35]\nassert pick_between([56, -13, 55, 28]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= -3)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -5 for x in xs if -12 <= x <= -3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -12 ≤ x ≤ -3، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-20, -12, -8, 4, -7, -5])` يُرجع `[25, 35, 40, 60]`.\nالجواب:", "qhash": "8d86385b3d635ec1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 273\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 = 273\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": "5bbeb94424a4c357", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-12, 31, 34, -12, 18, -3, 25, -5]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-12, 31, 34, -12, 18, -3, 25, -5]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "9928445b14bd871b", "answer": "[-3, -5, -12, -12, 18, 25, 31, 34]\n[34, 31, 25]", "completion": " الناتج:\n```text\n[-3, -5, -12, -12, 18, 25, 31, 34]\n[34, 31, 25]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'مريم': 11, 'هشام': 50, 'حسن': 21}\nscores['هشام'] += 12\nscores['فيصل'] = 5\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'مريم': 11, 'هشام': 50, 'حسن': 21}\nscores['هشام'] += 12\nscores['فيصل'] = 5\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('سعيد', -1))\n```\nالجواب:", "qhash": "00c749098db3f78e", "answer": "4\nهشام\n99\n-1", "completion": " الناتج:\n```text\n4\nهشام\n99\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 32:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([11, 3, 19, 17, 4]) == [11, 14, 0, 17, 21]", "assert rolling_total([-10, 9, 5]) == [-10, -1, 4]", "assert rolling_total([-2, -3, 1, 16, 17, 18, -1, 9, 4]) == [-2, -5, -4, 12, 29, 0, -1, 8, 12]", "assert rolling_total([10, 28, 6, 10, 28, 24, -9, -5]) == [10, 0, 6, 16, 0, 24, 15, 10]", "assert rolling_total([20, 27, 26, -7, 16, 24, -1, 23, 3, -9]) == [20, 0, 26, 19, 0, 24, 23, 0, 3, -6]", "assert rolling_total([6, -6, -9, 15, 12, -5, 3, -9, 2, 14]) == [6, 0, -9, 6, 18, 13, 16, 7, 9, 23]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([11, 3, 19, 17, 4]) == [11, 14, 0, 17, 21]\nassert rolling_total([-10, 9, 5]) == [-10, -1, 4]\nassert rolling_total([-2, -3, 1, 16, 17, 18, -1, 9, 4]) == [-2, -5, -4, 12, 29, 0, -1, 8, 12]\nassert rolling_total([10, 28, 6, 10, 28, 24, -9, -5]) == [10, 0, 6, 16, 0, 24, 15, 10]\nassert rolling_total([20, 27, 26, -7, 16, 24, -1, 23, 3, -9]) == [20, 0, 26, 19, 0, 24, 23, 0, 3, -6]\nassert rolling_total([6, -6, -9, 15, 12, -5, 3, -9, 2, 14]) == [6, 0, -9, 6, 18, 13, 16, 7, 9, 23]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 32:\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 > 32:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 32 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([11, 3, 19, 17, 4])` يجب أن تُرجع `[11, 14, 0, 17, 21]`.\nالجواب:", "qhash": "59ca974d4a32dcbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 13", "tests": ["assert step_product(9) == 9", "assert step_product(13) == 0", "assert step_product(1) == 1", "assert step_product(47) == 0", "assert step_product(14) == 8", "assert step_product(43) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 9\nassert step_product(13) == 0\nassert step_product(1) == 1\nassert step_product(47) == 0\nassert step_product(14) == 8\nassert step_product(43) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 13", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(9)` يُرجع `9`.\nالجواب:", "qhash": "8f142e4347b327d1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(calc(5))\nprint(calc(5, 15))\nprint(calc(calc(15), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=4):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(calc(5))\nprint(calc(5, 15))\nprint(calc(calc(15), 5))\n```\nالجواب:", "qhash": "f1e4c2339fa73fba", "answer": "-9\n-10\n-24", "completion": " الناتج:\n```text\n-9\n-10\n-24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 4 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert game(13) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13']", "assert game(9) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic']", "assert game(14) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14']", "assert game(9) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic']", "assert game(16) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac']"], "test_code": "assert game(13) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13']\nassert game(9) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic']\nassert game(14) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14']\nassert game(9) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic']\nassert game(16) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac']", "answer": "def game(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 game(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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Tic'، وعلى 4 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(13)` يجب أن تُرجع `['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13']`.\nالجواب:", "qhash": "ef64d7a3c438dc91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if 'ي' in w)", "tests": ["assert count_ar('ميناء جبل شجرة عمل بيت ميناء') == 3", "assert count_ar('طائرة قمر') == 0", "assert count_ar('معلم حديقة طائرة سلام رمل قهوة سوق') == 1", "assert count_ar('حاسوب عربية وردة نهار برمجة') == 1", "assert count_ar('سوق مدينة سيارة نهار باب سفينة حاسوب') == 3", "assert count_ar('خبز حصان') == 0", "assert count_ar('صحراء ماء برمجة') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('ميناء جبل شجرة عمل بيت ميناء') == 3\nassert count_ar('طائرة قمر') == 0\nassert count_ar('معلم حديقة طائرة سلام رمل قهوة سوق') == 1\nassert count_ar('حاسوب عربية وردة نهار برمجة') == 1\nassert count_ar('سوق مدينة سيارة نهار باب سفينة حاسوب') == 3\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('ميناء جبل شجرة عمل بيت ميناء')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "37dade85c410ccf7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'هدى': 35, 'منى': 11, 'علي': 50}\npoints['علي'] += 19\npoints['سعيد'] = 46\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 17])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'هدى': 35, 'منى': 11, 'علي': 50}\npoints['علي'] += 19\npoints['سعيد'] = 46\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 17])\n```\nالجواب:", "qhash": "c4f8c7ddb4520d6c", "answer": "4\nعلي\n161\n['هدى', 'علي', 'سعيد']", "completion": " الناتج:\n```text\n4\nعلي\n161\n['هدى', 'علي', 'سعيد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('فيصل', 57), ('يوسف', 57), ('هشام', 11), ('هدى', 62)]\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 = [('فيصل', 57), ('يوسف', 57), ('هشام', 11), ('هدى', 62)]\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": "2813e9a73cc7bbfb", "answer": "[('هشام', 11), ('فيصل', 57), ('يوسف', 57), ('هدى', 62)]\n['هدى', 'فيصل']", "completion": " الناتج:\n```text\n[('هشام', 11), ('فيصل', 57), ('يوسف', 57), ('هدى', 62)]\n['هدى', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([45, 14, 40, 43, 21, 35]) == [45, 59, 0, 43, 64, 0]", "assert reset_sum([69, 25, 32, 68, 17, 12, -9]) == [69, 0, 32, 0, 17, 29, 20]", "assert reset_sum([]) == []", "assert reset_sum([52, 77, 39, 83, 32, 78]) == [52, 0, 39, 0, 32, 0]", "assert reset_sum([5, 41, 42, 55, 8, -4, 2]) == [5, 46, 0, 55, 63, 59, 61]", "assert reset_sum([-7, 46, 13, 84, 60]) == [-7, 39, 52, 0, 60]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([45, 14, 40, 43, 21, 35]) == [45, 59, 0, 43, 64, 0]\nassert reset_sum([69, 25, 32, 68, 17, 12, -9]) == [69, 0, 32, 0, 17, 29, 20]\nassert reset_sum([]) == []\nassert reset_sum([52, 77, 39, 83, 32, 78]) == [52, 0, 39, 0, 32, 0]\nassert reset_sum([5, 41, 42, 55, 8, -4, 2]) == [5, 46, 0, 55, 63, 59, 61]\nassert reset_sum([-7, 46, 13, 84, 60]) == [-7, 39, 52, 0, 60]\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 86 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([45, 14, 40, 43, 21, 35])` يجب أن تُرجع `[45, 59, 0, 43, 64, 0]`.\nالجواب:", "qhash": "986b53470ccacbee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'ليلى': 42, 'نور': 39, 'أحمد': 13}\nd['ليلى'] += 20\nd['حسن'] = 60\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 22])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'ليلى': 42, 'نور': 39, 'أحمد': 13}\nd['ليلى'] += 20\nd['حسن'] = 60\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 22])\n```\nالجواب:", "qhash": "7dbc7283c86d3e56", "answer": "4\nليلى\n174\n['ليلى', 'نور', 'حسن']", "completion": " الناتج:\n```text\n4\nليلى\n174\n['ليلى', 'نور', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)", "tests": ["assert in_range_scaled([9, 50, 15, 17, 46, 47]) == [-34, -30, -18]", "assert in_range_scaled([33, -8, 26]) == [-66, -52]", "assert in_range_scaled([35, 57, -15, 6, -29, -9, 33, 50]) == [-70, -66, -12]", "assert in_range_scaled([55]) == []", "assert in_range_scaled([4, 60, 26, 5, 22, 13]) == [-52, -44, -26, -10]", "assert in_range_scaled([22, 12, -6, 54, 15, 54]) == [-44, -30, -24]", "assert in_range_scaled([35, 56, 10, 54, 46]) == [-70, -20]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([9, 50, 15, 17, 46, 47]) == [-34, -30, -18]\nassert in_range_scaled([33, -8, 26]) == [-66, -52]\nassert in_range_scaled([35, 57, -15, 6, -29, -9, 33, 50]) == [-70, -66, -12]\nassert in_range_scaled([55]) == []\nassert in_range_scaled([4, 60, 26, 5, 22, 13]) == [-52, -44, -26, -10]\nassert in_range_scaled([22, 12, -6, 54, 15, 54]) == [-44, -30, -24]\nassert in_range_scaled([35, 56, 10, 54, 46]) == [-70, -20]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 5 ≤ x ≤ 41، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([9, 50, 15, 17, 46, 47])` يُرجع `[-34, -30, -18]`.\nالجواب:", "qhash": "f01285dcc22de86d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert turn_list([5, 18, 20, 49, 21, 8]) == [49, 21, 8, 5, 18, 20]", "assert turn_list([32, 13, 42, 46, 22]) == [32, 13, 42, 46, 22]", "assert turn_list([42, -4, 13, 0, 7, 43, 32, -8, 29, 17, 42, -7]) == [0, 7, 43, 32, -8, 29, 17, 42, -7, 42, -4, 13]", "assert turn_list([17, 20, 44, 44, 35, 13, 38, 35, 40]) == [38, 35, 40, 17, 20, 44, 44, 35, 13]", "assert turn_list([47, 45, 36, 23, 43, 45, 30, 30, 1, 37]) == [45, 30, 30, 1, 37, 47, 45, 36, 23, 43]", "assert turn_list([-9, 44, 38, 27, 25]) == [-9, 44, 38, 27, 25]", "assert turn_list([]) == []"], "test_code": "assert turn_list([5, 18, 20, 49, 21, 8]) == [49, 21, 8, 5, 18, 20]\nassert turn_list([32, 13, 42, 46, 22]) == [32, 13, 42, 46, 22]\nassert turn_list([42, -4, 13, 0, 7, 43, 32, -8, 29, 17, 42, -7]) == [0, 7, 43, 32, -8, 29, 17, 42, -7, 42, -4, 13]\nassert turn_list([17, 20, 44, 44, 35, 13, 38, 35, 40]) == [38, 35, 40, 17, 20, 44, 44, 35, 13]\nassert turn_list([47, 45, 36, 23, 43, 45, 30, 30, 1, 37]) == [45, 30, 30, 1, 37, 47, 45, 36, 23, 43]\nassert turn_list([-9, 44, 38, 27, 25]) == [-9, 44, 38, 27, 25]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nمثال: `turn_list([5, 18, 20, 49, 21, 8])` يجب أن تُرجع `[49, 21, 8, 5, 18, 20]`.\nالجواب:", "qhash": "f77d4df6e9c2b81e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['data', 'coffee', 'camel', 'rocket', 'banana']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['data', 'coffee', 'camel', 'rocket', 'banana']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "eb10b8e7504ed3d7", "answer": "['data', 'camel', 'coffee', 'rocket', 'banana']\n['rocket', 'coffee', 'banana']", "completion": " الناتج:\n```text\n['data', 'camel', 'coffee', 'rocket', 'banana']\n['rocket', 'coffee', 'banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [12, 26, 17, 40, 8, 22, -8, 4]\nprint(a[0:7])\nprint(a[::-1])\nprint(sum(a[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [12, 26, 17, 40, 8, 22, -8, 4]\nprint(a[0:7])\nprint(a[::-1])\nprint(sum(a[0:7]))\n```\nالجواب:", "qhash": "43ca7707a23c5281", "answer": "[12, 26, 17, 40, 8, 22, -8]\n[4, -8, 22, 8, 40, 17, 26, 12]\n117", "completion": " الناتج:\n```text\n[12, 26, 17, 40, 8, 22, -8]\n[4, -8, 22, 8, 40, 17, 26, 12]\n117\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'ms'}", "tests": ["assert tally('go summer desert stone table') == {'m': 2, 's': 3}", "assert tally('coffee window stone') == {'m': 0, 's': 1}", "assert tally('camel go it winter river') == {'m': 1, 's': 0}", "assert tally('orange vector') == {'m': 0, 's': 0}", "assert tally('up of pixel rocket') == {'m': 0, 's': 0}", "assert tally('matrix data code') == {'m': 1, 's': 0}", "assert tally('') == {'m': 0, 's': 0}"], "test_code": "assert tally('go summer desert stone table') == {'m': 2, 's': 3}\nassert tally('coffee window stone') == {'m': 0, 's': 1}\nassert tally('camel go it winter river') == {'m': 1, 's': 0}\nassert tally('orange vector') == {'m': 0, 's': 0}\nassert tally('up of pixel rocket') == {'m': 0, 's': 0}\nassert tally('matrix data code') == {'m': 1, 's': 0}\nassert tally('') == {'m': 0, 's': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'ms'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'ms'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'm'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('go summer desert stone table')` يجب أن تُرجع `{'m': 2, 's': 3}`.\nالجواب:", "qhash": "05c5a429dd3682d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 1\nfor n in range(-3, 1, 4):\n s += n * 8\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 1\nfor n in range(-3, 1, 4):\n s += n * 8\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "1a7c6eecc9320729", "answer": "-23\n-3", "completion": " الناتج:\n```text\n-23\n-3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if 'ا' in w)", "tests": ["assert letter_hits('نهار صديق صديق شجرة علم نهر تفاحة') == 2", "assert letter_hits('رمل نهر شجرة مدينة ليل جبل') == 0", "assert letter_hits('نهار جبل نور مكتبة سماء باب') == 3", "assert letter_hits('حصان برتقال سلام بيت معلم مكتبة') == 3", "assert letter_hits('عمل سماء ميناء فجر جبل برمجة بيت') == 2", "assert letter_hits('ماء شجرة حديقة') == 1", "assert letter_hits('قهوة تفاحة حاسوب دفتر مكتبة عمل') == 2", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('نهار صديق صديق شجرة علم نهر تفاحة') == 2\nassert letter_hits('رمل نهر شجرة مدينة ليل جبل') == 0\nassert letter_hits('نهار جبل نور مكتبة سماء باب') == 3\nassert letter_hits('حصان برتقال سلام بيت معلم مكتبة') == 3\nassert letter_hits('عمل سماء ميناء فجر جبل برمجة بيت') == 2\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('نهار صديق صديق شجرة علم نهر تفاحة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "2e6aa68cbcd54c47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'coffee'\nprint(len(name))\nprint(name.find('e'))\nprint(name[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'coffee'\nprint(len(name))\nprint(name.find('e'))\nprint(name[::-1])\n```\nالجواب:", "qhash": "9cf6ef2a3cde97f3", "answer": "6\n4\neeffoc", "completion": " الناتج:\n```text\n6\n4\neeffoc\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)", "tests": ["assert sum_div(278) == 12180", "assert sum_div(93) == 1387", "assert sum_div(109) == 1785", "assert sum_div(2) == 0", "assert sum_div(158) == 3901", "assert sum_div(146) == 3295", "assert sum_div(1) == 0"], "test_code": "assert sum_div(278) == 12180\nassert sum_div(93) == 1387\nassert sum_div(109) == 1785\nassert sum_div(2) == 0\nassert sum_div(158) == 3901\nassert sum_div(146) == 3295\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 7.\nمثال: `sum_div(278)` يجب أن تُرجع `12180`.\nالجواب:", "qhash": "140d3da26c8c4ad9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 54)", "tests": ["assert between_times([55, 55, 63, 58, 47, 42]) == [-235, -210]", "assert between_times([24, -7, 37, -30, 59, -8, 26, -4]) == [-185, -130, -120]", "assert between_times([-4, -18, 22, 29, -12, 56, 24]) == [-145, -120, -110]", "assert between_times([]) == []", "assert between_times([12, 9, 21, -16]) == [-105]", "assert between_times([24]) == [-120]", "assert between_times([24, 22, -11, -18, 2]) == [-120, -110]", "assert between_times([]) == []"], "test_code": "assert between_times([55, 55, 63, 58, 47, 42]) == [-235, -210]\nassert between_times([24, -7, 37, -30, 59, -8, 26, -4]) == [-185, -130, -120]\nassert between_times([-4, -18, 22, 29, -12, 56, 24]) == [-145, -120, -110]\nassert between_times([]) == []\nassert between_times([12, 9, 21, -16]) == [-105]\nassert between_times([24]) == [-120]\nassert between_times([24, 22, -11, -18, 2]) == [-120, -110]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 54)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if 16 <= x <= 54)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 16 و54 (شاملًا الطرفين) في -5.\nمثال: `between_times([55, 55, 63, 58, 47, 42])` يجب أن تُرجع `[-235, -210]`.\nالجواب:", "qhash": "40d7878c6bec110d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 181:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([56, 6, 22, 50, 8, 23, 66, 69, 91]) == [56, 62, 84, 134, 142, 165, 0, 69, 160]", "assert cumulative([141, 83, 91, 139, 66, 117, 158]) == [141, 0, 91, 0, 66, 0, 158]", "assert cumulative([]) == []", "assert cumulative([111, 107, 16, 144, 134, 17, 129, 16]) == [111, 0, 16, 160, 0, 17, 146, 162]", "assert cumulative([77, 75, 172, 95, 134, 168]) == [77, 152, 0, 95, 0, 168]", "assert cumulative([-1, 121]) == [-1, 120]", "assert cumulative([]) == []"], "test_code": "assert cumulative([56, 6, 22, 50, 8, 23, 66, 69, 91]) == [56, 62, 84, 134, 142, 165, 0, 69, 160]\nassert cumulative([141, 83, 91, 139, 66, 117, 158]) == [141, 0, 91, 0, 66, 0, 158]\nassert cumulative([]) == []\nassert cumulative([111, 107, 16, 144, 134, 17, 129, 16]) == [111, 0, 16, 160, 0, 17, 146, 162]\nassert cumulative([77, 75, 172, 95, 134, 168]) == [77, 152, 0, 95, 0, 168]\nassert cumulative([-1, 121]) == [-1, 120]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 181:\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 > 181:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 181 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([56, 6, 22, 50, 8, 23, 66, 69, 91])` يجب أن تُرجع `[56, 62, 84, 134, 142, 165, 0, 69, 160]`.\nالجواب:", "qhash": "e972c71b77af3488"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [40, 36, 21, -6, -5, -10, 12]\nprint(sorted(nums, key=lambda x: (abs(x - 26), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [40, 36, 21, -6, -5, -10, 12]\nprint(sorted(nums, key=lambda x: (abs(x - 26), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "2d16f375c82d23e4", "answer": "[21, 36, 12, 40, -5, -6, -10]\n[40, 36, 21]", "completion": " الناتج:\n```text\n[21, 36, 12, 40, -5, -6, -10]\n[40, 36, 21]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'صديق'\nprint(w[::-1])\nprint(w.split())\nprint(w.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'صديق'\nprint(w[::-1])\nprint(w.split())\nprint(w.replace(' ', '-'))\n```\nالجواب:", "qhash": "2d010ff3c03d1660", "answer": "قيدص\n['صديق']\nصديق", "completion": " الناتج:\n```text\nقيدص\n['صديق']\nصديق\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('a cloud summer stone music 2024') == 'm oxagp egyyqd efazq ygeuo 2024'", "assert shift_text('we') == 'iq'", "assert shift_text('in brain an it') == 'uz ndmuz mz uf'", "assert shift_text('table planet engine table pixel !') == 'fmnxq bxmzqf qzsuzq fmnxq bujqx !'", "assert shift_text('signal code A1') == 'euszmx oapq A1'", "assert shift_text('by is vector data 2024') == 'nk ue hqofad pmfm 2024'", "assert shift_text('') == ''"], "test_code": "assert shift_text('a cloud summer stone music 2024') == 'm oxagp egyyqd efazq ygeuo 2024'\nassert shift_text('we') == 'iq'\nassert shift_text('in brain an it') == 'uz ndmuz mz uf'\nassert shift_text('table planet engine table pixel !') == 'fmnxq bxmzqf qzsuzq fmnxq bujqx !'\nassert shift_text('signal code A1') == 'euszmx oapq A1'\nassert shift_text('by is vector data 2024') == 'nk ue hqofad pmfm 2024'\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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('a cloud summer stone music 2024')` يجب أن تُرجع `'m oxagp egyyqd efazq ygeuo 2024'`.\nالجواب:", "qhash": "95b5e6839f17423b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 19", "tests": ["assert rec_prod(12) == 10", "assert rec_prod(28) == 0", "assert rec_prod(18) == 18", "assert rec_prod(8) == 2", "assert rec_prod(12) == 10", "assert rec_prod(7) == 5", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 10\nassert rec_prod(28) == 0\nassert rec_prod(18) == 18\nassert rec_prod(8) == 2\nassert rec_prod(12) == 10\nassert rec_prod(7) == 5\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 19", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(12)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "82b606218ce86023"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 360\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 = 360\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": "d3b4879d31b56acc", "answer": "19", "completion": " الناتج:\n```text\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(20) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20']", "assert fizzbuzz(23) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red', '22', '23']", "assert fizzbuzz(0) == []", "assert fizzbuzz(25) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red', '22', '23', 'RedBlue', '25']", "assert fizzbuzz(5) == ['1', '2', 'Red', '4', '5']"], "test_code": "assert fizzbuzz(20) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20']\nassert fizzbuzz(23) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red', '22', '23']\nassert fizzbuzz(0) == []\nassert fizzbuzz(25) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red', '22', '23', 'RedBlue', '25']\nassert fizzbuzz(5) == ['1', '2', 'Red', '4', '5']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Red'\n if i % 6 == 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 % 3 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(20)` يُرجع `['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20']`.\nالجواب:", "qhash": "e1c5d93c32239c8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 1 for x in xs if -20 <= x <= 11)", "tests": ["assert filter_range([17, -4, -17, -22, 7, -7, 4, -5, 18, -25]) == [-17, -7, -5, -4, 4, 7]", "assert filter_range([24]) == []", "assert filter_range([1, 23]) == [1]", "assert filter_range([-1]) == [-1]", "assert filter_range([54, 16, 33, 40, 14, 6, 20, 19]) == [6]", "assert filter_range([-16, 43, 6, -23, 59, 28, 20, 59, 30, 1]) == [-16, 1, 6]", "assert filter_range([58, -4, -12, 50, -9]) == [-12, -9, -4]", "assert filter_range([]) == []"], "test_code": "assert filter_range([17, -4, -17, -22, 7, -7, 4, -5, 18, -25]) == [-17, -7, -5, -4, 4, 7]\nassert filter_range([24]) == []\nassert filter_range([1, 23]) == [1]\nassert filter_range([-1]) == [-1]\nassert filter_range([54, 16, 33, 40, 14, 6, 20, 19]) == [6]\nassert filter_range([-16, 43, 6, -23, 59, 28, 20, 59, 30, 1]) == [-16, 1, 6]\nassert filter_range([58, -4, -12, 50, -9]) == [-12, -9, -4]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 1 for x in xs if -20 <= x <= 11)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 1 for x in xs if -20 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -20 و11 (شاملًا الطرفين) في 1.\nمثال: `filter_range([17, -4, -17, -22, 7, -7, 4, -5, 18, -25])` يجب أن تُرجع `[-17, -7, -5, -4, 4, 7]`.\nالجواب:", "qhash": "2d8dd3cb67b01136"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'banana'\nprint(name.index('a') + len(name))\nprint(name.count('a'))\nprint(name.replace('a', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'banana'\nprint(name.index('a') + len(name))\nprint(name.count('a'))\nprint(name.replace('a', '#'))\n```\nالجواب:", "qhash": "7b6b31e2a376cd04", "answer": "7\n3\nb#n#n#", "completion": " الناتج:\n```text\n7\n3\nb#n#n#\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17", "tests": ["assert rec_prod(9) == 11", "assert rec_prod(13) == 7", "assert rec_prod(36) == 9", "assert rec_prod(4) == 4", "assert rec_prod(9) == 11", "assert rec_prod(56) == 9", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(9) == 11\nassert rec_prod(13) == 7\nassert rec_prod(36) == 9\nassert rec_prod(4) == 4\nassert rec_prod(9) == 11\nassert rec_prod(56) == 9\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(9)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "2440efe5cb6904a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=4):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(-2))\nprint(h(-2, 8))\nprint(h(h(8), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=4):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(-2))\nprint(h(-2, 8))\nprint(h(h(8), -2))\n```\nالجواب:", "qhash": "600219b2108e292b", "answer": "22\n46\n266", "completion": " الناتج:\n```text\n22\n46\n266\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 9 * x ** 2 + (9) * x + (-8)", "tests": ["assert eval_poly(4) == 172", "assert eval_poly(-3) == 46", "assert eval_poly(3) == 100", "assert eval_poly(-6) == 262", "assert eval_poly(19) == 3412", "assert eval_poly(-4) == 100", "assert eval_poly(-16) == 2152", "assert eval_poly(0) == -8"], "test_code": "assert eval_poly(4) == 172\nassert eval_poly(-3) == 46\nassert eval_poly(3) == 100\nassert eval_poly(-6) == 262\nassert eval_poly(19) == 3412\nassert eval_poly(-4) == 100\nassert eval_poly(-16) == 2152\nassert eval_poly(0) == -8", "answer": "def eval_poly(x):\n return 9 * x ** 2 + (9) * x + (-8)", "completion": " ```python\ndef eval_poly(x):\n return 9 * x ** 2 + (9) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 9x² + 9x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(4)` يُرجع `172`.\nالجواب:", "qhash": "dee6b1a97dbf0389"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 47)", "tests": ["assert between_times([37, 16, 15, 55, 14, 32, 24, 57]) == [56, 60, 64, 96, 128, 148]", "assert between_times([-16, 60, 38, 53, 41, 54]) == [152, 164]", "assert between_times([38, -16, 25, -10, 21, 37, -16, 19]) == [76, 84, 100, 148, 152]", "assert between_times([-10, 42, 18, 8, 18, 14, -16, 8, 59]) == [32, 32, 56, 72, 72, 168]", "assert between_times([-30]) == []", "assert between_times([16, -30, 21, 5, 34, 6, 5, 40]) == [64, 84, 136, 160]", "assert between_times([55, 39, -17, 22, 29, -15, 59, 30]) == [88, 116, 120, 156]", "assert between_times([]) == []"], "test_code": "assert between_times([37, 16, 15, 55, 14, 32, 24, 57]) == [56, 60, 64, 96, 128, 148]\nassert between_times([-16, 60, 38, 53, 41, 54]) == [152, 164]\nassert between_times([38, -16, 25, -10, 21, 37, -16, 19]) == [76, 84, 100, 148, 152]\nassert between_times([-10, 42, 18, 8, 18, 14, -16, 8, 59]) == [32, 32, 56, 72, 72, 168]\nassert between_times([-30]) == []\nassert between_times([16, -30, 21, 5, 34, 6, 5, 40]) == [64, 84, 136, 160]\nassert between_times([55, 39, -17, 22, 29, -15, 59, 30]) == [88, 116, 120, 156]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 47)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if 8 <= x <= 47)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 8 و47 (شاملًا الطرفين) في 4.\nمثال: `between_times([37, 16, 15, 55, 14, 32, 24, 57])` يجب أن تُرجع `[56, 60, 64, 96, 128, 148]`.\nالجواب:", "qhash": "c285b496f0aef153"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-1, 7))", "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(-1, 7))\n```\nالجواب:", "qhash": "8324cc24677370eb", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert play(20) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20']", "assert play(3) == ['1', '2', 'Sun']", "assert play(25) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20', 'SunMoon', '22', '23', 'Sun', '25']", "assert play(15) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun']", "assert play(16) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16']"], "test_code": "assert play(20) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20']\nassert play(3) == ['1', '2', 'Sun']\nassert play(25) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20', 'SunMoon', '22', '23', 'Sun', '25']\nassert play(15) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun']\nassert play(16) == ['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Sun'\n if i % 7 == 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 % 3 == 0:\n s += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Sun'، وإن قَبِلها على 7 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(20)` يُرجع `['1', '2', 'Sun', '4', '5', 'Sun', 'Moon', '8', 'Sun', '10', '11', 'Sun', '13', 'Moon', 'Sun', '16', '17', 'Sun', '19', '20']`.\nالجواب:", "qhash": "2619ca46e478027a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 30", "tests": ["assert digits_mod(20021) == 5", "assert digits_mod(549166) == 1", "assert digits_mod(818773) == 4", "assert digits_mod(421719) == 24", "assert digits_mod(440877) == 0", "assert digits_mod(610837) == 25", "assert digits_mod(135019) == 19", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(20021) == 5\nassert digits_mod(549166) == 1\nassert digits_mod(818773) == 4\nassert digits_mod(421719) == 24\nassert digits_mod(440877) == 0\nassert digits_mod(610837) == 25\nassert digits_mod(135019) == 19\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 30", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 30\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 30.\nمثال: `digits_mod(20021)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "d4ccc820237c67bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=0):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(16))\nprint(compute(16, 20))\nprint(compute(compute(20), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=0):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(16))\nprint(compute(16, 20))\nprint(compute(compute(20), 16))\n```\nالجواب:", "qhash": "2d65e58c515a813f", "answer": "-80\n-84\n-180", "completion": " الناتج:\n```text\n-80\n-84\n-180\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -4 * x ** 2 + (8) * x + (6)", "tests": ["assert eval_poly(7) == -134", "assert eval_poly(12) == -474", "assert eval_poly(-3) == -54", "assert eval_poly(8) == -186", "assert eval_poly(4) == -26", "assert eval_poly(2) == 6", "assert eval_poly(9) == -246", "assert eval_poly(0) == 6"], "test_code": "assert eval_poly(7) == -134\nassert eval_poly(12) == -474\nassert eval_poly(-3) == -54\nassert eval_poly(8) == -186\nassert eval_poly(4) == -26\nassert eval_poly(2) == 6\nassert eval_poly(9) == -246\nassert eval_poly(0) == 6", "answer": "def eval_poly(x):\n return -4 * x ** 2 + (8) * x + (6)", "completion": " ```python\ndef eval_poly(x):\n return -4 * x ** 2 + (8) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -4x² + 8x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(7)` يُرجع `-134`.\nالجواب:", "qhash": "f98648a3bd4dd50c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'نهار تفاحة'\nprint(kalima.replace(' ', '-'))\nprint(kalima.split())\nprint(kalima[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'نهار تفاحة'\nprint(kalima.replace(' ', '-'))\nprint(kalima.split())\nprint(kalima[0])\n```\nالجواب:", "qhash": "9d32047dec4e0216", "answer": "نهار-تفاحة\n['نهار', 'تفاحة']\nن", "completion": " الناتج:\n```text\nنهار-تفاحة\n['نهار', 'تفاحة']\nن\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'سلمى': 2, 'مريم': 11, 'خالد': 11, 'علي': 36}\nmarks['خالد'] += 6\nmarks['باسل'] = 46\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'سلمى': 2, 'مريم': 11, 'خالد': 11, 'علي': 36}\nmarks['خالد'] += 6\nmarks['باسل'] = 46\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))\n```\nالجواب:", "qhash": "7ba84d3aa441cc1d", "answer": "5\nباسل\n112\n-1", "completion": " الناتج:\n```text\n5\nباسل\n112\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'table'\nprint(s.split('_'))\nprint(s[-2:])\nprint(s.count('b'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'table'\nprint(s.split('_'))\nprint(s[-2:])\nprint(s.count('b'))\n```\nالجواب:", "qhash": "f847616ad4509c16", "answer": "['table']\nle\n1", "completion": " الناتج:\n```text\n['table']\nle\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 7", "tests": ["assert step_product(10) == 0", "assert step_product(43) == 0", "assert step_product(34) == 0", "assert step_product(60) == 0", "assert step_product(59) == 0", "assert step_product(35) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(10) == 0\nassert step_product(43) == 0\nassert step_product(34) == 0\nassert step_product(60) == 0\nassert step_product(59) == 0\nassert step_product(35) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 7", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(10)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "0c32916e1037ca8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'باسل': 26, 'يوسف': 21, 'منى': 36, 'رنا': 50}\nscores['منى'] += 8\nscores['سعيد'] = 23\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 = {'باسل': 26, 'يوسف': 21, 'منى': 36, 'رنا': 50}\nscores['منى'] += 8\nscores['سعيد'] = 23\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": "5415614e73f7b44a", "answer": "5\nرنا\n164\n[('يوسف', 21), ('سعيد', 23)]", "completion": " الناتج:\n```text\n5\nرنا\n164\n[('يوسف', 21), ('سعيد', 23)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "tests": ["assert digits_mod(81609) == 8", "assert digits_mod(264433) == 6", "assert digits_mod(912289) == 3", "assert digits_mod(738010) == 1", "assert digits_mod(633580) == 19", "assert digits_mod(92138) == 19", "assert digits_mod(309531) == 1", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(81609) == 8\nassert digits_mod(264433) == 6\nassert digits_mod(912289) == 3\nassert digits_mod(738010) == 1\nassert digits_mod(633580) == 19\nassert digits_mod(92138) == 19\nassert digits_mod(309531) == 1\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 22", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 22.\nمثال: `digits_mod(81609)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "8b3a84739556d003"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 79) == 1)", "tests": ["assert coprime_count(113) == 112", "assert coprime_count(106) == 105", "assert coprime_count(187) == 185", "assert coprime_count(99) == 98", "assert coprime_count(62) == 62", "assert coprime_count(198) == 196", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(113) == 112\nassert coprime_count(106) == 105\nassert coprime_count(187) == 185\nassert coprime_count(99) == 98\nassert coprime_count(62) == 62\nassert coprime_count(198) == 196\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, 79) == 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, 79) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 79، أي أن القاسم المشترك الأكبر لها مع 79 يساوي 1.\nمثال: `coprime_count(113)` يجب أن تُرجع `112`.\nالجواب:", "qhash": "25764cddb779c80f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(716503898))\nprint(calc(calc(716503898)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(716503898))\nprint(calc(calc(716503898)))\n```\nالجواب:", "qhash": "3f5571f009fdac21", "answer": "47\n11", "completion": " الناتج:\n```text\n47\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 95", "tests": ["assert digits_mod(77094) == 17", "assert digits_mod(722474) == 6", "assert digits_mod(659564) == 80", "assert digits_mod(9953) == 56", "assert digits_mod(693298) == 77", "assert digits_mod(315228) == 6", "assert digits_mod(63075) == 21", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(77094) == 17\nassert digits_mod(722474) == 6\nassert digits_mod(659564) == 80\nassert digits_mod(9953) == 56\nassert digits_mod(693298) == 77\nassert digits_mod(315228) == 6\nassert digits_mod(63075) == 21\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 95", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 95.\nمثال: `digits_mod(77094)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "41db1a3312188cfe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 16) == 1)", "tests": ["assert coprimes(130) == 65", "assert coprimes(60) == 30", "assert coprimes(3) == 2", "assert coprimes(182) == 91", "assert coprimes(170) == 85", "assert coprimes(17) == 9", "assert coprimes(1) == 1"], "test_code": "assert coprimes(130) == 65\nassert coprimes(60) == 30\nassert coprimes(3) == 2\nassert coprimes(182) == 91\nassert coprimes(170) == 85\nassert coprimes(17) == 9\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, 16) == 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, 16) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 16، أي أن القاسم المشترك الأكبر لها مع 16 يساوي 1.\nمثال: `coprimes(130)` يجب أن تُرجع `65`.\nالجواب:", "qhash": "759b778bc9735bff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 75) == 1)", "tests": ["assert coprime_count(30) == 16", "assert coprime_count(2) == 2", "assert coprime_count(127) == 68", "assert coprime_count(168) == 90", "assert coprime_count(164) == 88", "assert coprime_count(5) == 3", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(30) == 16\nassert coprime_count(2) == 2\nassert coprime_count(127) == 68\nassert coprime_count(168) == 90\nassert coprime_count(164) == 88\nassert coprime_count(5) == 3\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, 75) == 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, 75) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 75) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(30)` يُرجع `16`.\nالجواب:", "qhash": "65927bdf8f7c653b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 97", "tests": ["assert rec_prod(11) == 7", "assert rec_prod(17) == 17", "assert rec_prod(33) == 5", "assert rec_prod(47) == 87", "assert rec_prod(44) == 39", "assert rec_prod(19) == 81", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 7\nassert rec_prod(17) == 17\nassert rec_prod(33) == 5\nassert rec_prod(47) == 87\nassert rec_prod(44) == 39\nassert rec_prod(19) == 81\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 97", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `7`.\nالجواب:", "qhash": "e228015d14debbcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('is stone is table') == 'table|stone'", "assert rev_long_words('garden camel go') == 'camel|garden'", "assert rev_long_words('stone music river go banana coffee') == 'coffee|banana|river|music|stone'", "assert rev_long_words('rocket') == 'rocket'", "assert rev_long_words('on brain rocket cloud table python pixel') == 'pixel|python|table|cloud|rocket|brain'", "assert rev_long_words('in brain orange a desert is') == 'desert|orange|brain'", "assert rev_long_words('of rocket') == 'rocket'"], "test_code": "assert rev_long_words('is stone is table') == 'table|stone'\nassert rev_long_words('garden camel go') == 'camel|garden'\nassert rev_long_words('stone music river go banana coffee') == 'coffee|banana|river|music|stone'\nassert rev_long_words('rocket') == 'rocket'\nassert rev_long_words('on brain rocket cloud table python pixel') == 'pixel|python|table|cloud|rocket|brain'\nassert rev_long_words('in brain orange a desert is') == 'desert|orange|brain'\nassert rev_long_words('of rocket') == 'rocket'", "answer": "def rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_long_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `rev_long_words('is stone is table')` يجب أن تُرجع `'table|stone'`.\nالجواب:", "qhash": "057c56351f2e629d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 17\nfor x in range(5, 20, 2):\n total += x * 3\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 17\nfor x in range(5, 20, 2):\n total += x * 3\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "66f5c061f6c876c6", "answer": "305\n19", "completion": " الناتج:\n```text\n305\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\n return total", "tests": ["assert total_pow(8) == 17544", "assert total_pow(12) == 121420", "assert total_pow(8) == 17544", "assert total_pow(7) == 9352", "assert total_pow(6) == 4550", "assert total_pow(1) == 2", "assert total_pow(0) == 0"], "test_code": "assert total_pow(8) == 17544\nassert total_pow(12) == 121420\nassert total_pow(8) == 17544\nassert total_pow(7) == 9352\nassert total_pow(6) == 4550\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 ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 4\n return total\n```\nمثال: `total_pow(8)` يجب أن تُرجع `17544`.\nالجواب:", "qhash": "1f4da136da2d5819"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * -2 + -4 for x in range(1, 7) if x % 5 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * -2 + -4 for x in range(1, 7) if x % 5 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "cf1c061e67e893f0", "answer": "[-8]\n1 -8", "completion": " الناتج:\n```text\n[-8]\n1 -8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 240\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 = 240\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": "0e1d60801ea82c46", "answer": "21", "completion": " الناتج:\n```text\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('engine summer at planet code an garden') == 'garden code planet summer engine'", "assert rev_join('river rocket we window falcon light pixel') == 'pixel light falcon window rocket river'", "assert rev_join('we we a') == ''", "assert rev_join('table planet banana light table up') == 'table light banana planet table'", "assert rev_join('window apple we data at window in') == 'window data apple window'", "assert rev_join('') == ''", "assert rev_join('python banana we at on vector') == 'vector banana python'"], "test_code": "assert rev_join('engine summer at planet code an garden') == 'garden code planet summer engine'\nassert rev_join('river rocket we window falcon light pixel') == 'pixel light falcon window rocket river'\nassert rev_join('we we a') == ''\nassert rev_join('table planet banana light table up') == 'table light banana planet table'\nassert rev_join('window apple we data at window in') == 'window data apple window'\nassert rev_join('') == ''\nassert rev_join('python banana we at on vector') == 'vector banana python'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_join('engine summer at planet code an garden')` يُرجع `'garden code planet summer engine'`.\nالجواب:", "qhash": "93882cd6e8a29348"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([42, 16, 29, 21, 66, 3, 68, 60, 60]) == [42, 58, 87, 108, 0, 3, 71, 131, 0]", "assert capped_cumsum([131, 69, 12, -6, 15, 77, 13, -8]) == [131, 0, 12, 6, 21, 98, 111, 103]", "assert capped_cumsum([51, 18, 61, 133, 27, 16, 25, 120]) == [51, 69, 130, 0, 27, 43, 68, 0]", "assert capped_cumsum([63, 125, 90, 70]) == [63, 0, 90, 0]", "assert capped_cumsum([117, 43, 130, 77, 3, 80, 19]) == [117, 0, 130, 0, 3, 83, 102]", "assert capped_cumsum([21, 44, 83, 37]) == [21, 65, 0, 37]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([42, 16, 29, 21, 66, 3, 68, 60, 60]) == [42, 58, 87, 108, 0, 3, 71, 131, 0]\nassert capped_cumsum([131, 69, 12, -6, 15, 77, 13, -8]) == [131, 0, 12, 6, 21, 98, 111, 103]\nassert capped_cumsum([51, 18, 61, 133, 27, 16, 25, 120]) == [51, 69, 130, 0, 27, 43, 68, 0]\nassert capped_cumsum([63, 125, 90, 70]) == [63, 0, 90, 0]\nassert capped_cumsum([117, 43, 130, 77, 3, 80, 19]) == [117, 0, 130, 0, 3, 83, 102]\nassert capped_cumsum([21, 44, 83, 37]) == [21, 65, 0, 37]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 133:\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 > 133:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 133 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([42, 16, 29, 21, 66, 3, 68, 60, 60])` يجب أن تُرجع `[42, 58, 87, 108, 0, 3, 71, 131, 0]`.\nالجواب:", "qhash": "07607bb5d14e3fac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([9, -22, 55, -13, -6, -9, 6, 31]) == 55", "assert max_of_div([-55, -44, -33]) == -33", "assert max_of_div([1, 12, 23, 34]) == None", "assert max_of_div([]) == None", "assert max_of_div([39, 3, -36, -16, 33, 3, -45]) == 33", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([9, -22, 55, -13, -6, -9, 6, 31]) == 55\nassert max_of_div([-55, -44, -33]) == -33\nassert max_of_div([1, 12, 23, 34]) == None\nassert max_of_div([]) == None\nassert max_of_div([39, 3, -36, -16, 33, 3, -45]) == 33\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([9, -22, 55, -13, -6, -9, 6, 31])` يُرجع `55`.\nالجواب:", "qhash": "0eb0560fdc8d23e5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'alt'}", "tests": ["assert count_chars('brain camel to light garden it') == {'a': 3, 'l': 2, 't': 3}", "assert count_chars('apple data orange garden winter') == {'a': 5, 'l': 1, 't': 2}", "assert count_chars('falcon it up') == {'a': 1, 'l': 1, 't': 1}", "assert count_chars('desert camel') == {'a': 1, 'l': 1, 't': 1}", "assert count_chars('pixel orange data') == {'a': 3, 'l': 1, 't': 1}", "assert count_chars('code matrix') == {'a': 1, 'l': 0, 't': 1}", "assert count_chars('') == {'a': 0, 'l': 0, 't': 0}"], "test_code": "assert count_chars('brain camel to light garden it') == {'a': 3, 'l': 2, 't': 3}\nassert count_chars('apple data orange garden winter') == {'a': 5, 'l': 1, 't': 2}\nassert count_chars('falcon it up') == {'a': 1, 'l': 1, 't': 1}\nassert count_chars('desert camel') == {'a': 1, 'l': 1, 't': 1}\nassert count_chars('pixel orange data') == {'a': 3, 'l': 1, 't': 1}\nassert count_chars('code matrix') == {'a': 1, 'l': 0, 't': 1}\nassert count_chars('') == {'a': 0, 'l': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'alt'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'alt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'l'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('brain camel to light garden it')` يُرجع `{'a': 3, 'l': 2, 't': 3}`.\nالجواب:", "qhash": "95fbe90deb24c1bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('music apple summer of') == 'fnlbv tiiex lnffxk hy'", "assert shift_letters('falcon light falcon is brain 2024') == 'ytevhg ebzam ytevhg bl uktbg 2024'", "assert shift_letters('to camel data cloud signal A1') == 'mh vtfxe wtmt vehnw lbzgte A1'", "assert shift_letters('garden in up on up 2024') == 'ztkwxg bg ni hg ni 2024'", "assert shift_letters('at coffee music python') == 'tm vhyyxx fnlbv irmahg'", "assert shift_letters('in OK') == 'bg OK'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('music apple summer of') == 'fnlbv tiiex lnffxk hy'\nassert shift_letters('falcon light falcon is brain 2024') == 'ytevhg ebzam ytevhg bl uktbg 2024'\nassert shift_letters('to camel data cloud signal A1') == 'mh vtfxe wtmt vehnw lbzgte A1'\nassert shift_letters('garden in up on up 2024') == 'ztkwxg bg ni hg ni 2024'\nassert shift_letters('at coffee music python') == 'tm vhyyxx fnlbv irmahg'\nassert shift_letters('in OK') == 'bg OK'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('music apple summer of')` يجب أن تُرجع `'fnlbv tiiex lnffxk hy'`.\nالجواب:", "qhash": "5f79d11ac73ecb9f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'زينب': 36, 'ليلى': 32, 'مريم': 26}\nmarks['مريم'] += 16\nmarks['خالد'] = 53\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'زينب': 36, 'ليلى': 32, 'مريم': 26}\nmarks['مريم'] += 16\nmarks['خالد'] = 53\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('راشد', -1))\n```\nالجواب:", "qhash": "1fc632ae38981049", "answer": "4\nخالد\n163\n-1", "completion": " الناتج:\n```text\n4\nخالد\n163\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 70\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 = 70\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": "94b87ee68610f618", "answer": "14", "completion": " الناتج:\n```text\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'dsu'}", "tests": ["assert count_chars('python falcon we pixel light matrix') == {'d': 0, 's': 0, 'u': 0}", "assert count_chars('by is brain') == {'d': 0, 's': 1, 'u': 0}", "assert count_chars('desert rocket table to') == {'d': 1, 's': 1, 'u': 0}", "assert count_chars('to garden planet is') == {'d': 1, 's': 1, 'u': 0}", "assert count_chars('code coffee') == {'d': 1, 's': 0, 'u': 0}", "assert count_chars('engine orange camel') == {'d': 0, 's': 0, 'u': 0}", "assert count_chars('') == {'d': 0, 's': 0, 'u': 0}"], "test_code": "assert count_chars('python falcon we pixel light matrix') == {'d': 0, 's': 0, 'u': 0}\nassert count_chars('by is brain') == {'d': 0, 's': 1, 'u': 0}\nassert count_chars('desert rocket table to') == {'d': 1, 's': 1, 'u': 0}\nassert count_chars('to garden planet is') == {'d': 1, 's': 1, 'u': 0}\nassert count_chars('code coffee') == {'d': 1, 's': 0, 'u': 0}\nassert count_chars('engine orange camel') == {'d': 0, 's': 0, 'u': 0}\nassert count_chars('') == {'d': 0, 's': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'dsu'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'dsu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 's'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('python falcon we pixel light matrix')` يجب أن تُرجع `{'d': 0, 's': 0, 'u': 0}`.\nالجواب:", "qhash": "8914a4e43b34e8cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -4 for x in xs if -1 <= x <= 27)", "tests": ["assert select_range([33, 6, 37, 31, 10]) == [-40, -24]", "assert select_range([-15, 47, 9, -29]) == [-36]", "assert select_range([]) == []", "assert select_range([49, 59, 16, -25, 11, 43, 50, -8, -14]) == [-64, -44]", "assert select_range([13, 23, 8, -18, 25, 13]) == [-100, -92, -52, -52, -32]", "assert select_range([28, 33]) == []", "assert select_range([53, 11, -17, 29, -11]) == [-44]", "assert select_range([]) == []"], "test_code": "assert select_range([33, 6, 37, 31, 10]) == [-40, -24]\nassert select_range([-15, 47, 9, -29]) == [-36]\nassert select_range([]) == []\nassert select_range([49, 59, 16, -25, 11, 43, 50, -8, -14]) == [-64, -44]\nassert select_range([13, 23, 8, -18, 25, 13]) == [-100, -92, -52, -52, -32]\nassert select_range([28, 33]) == []\nassert select_range([53, 11, -17, 29, -11]) == [-44]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -4 for x in xs if -1 <= x <= 27)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -4 for x in xs if -1 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -1 و27 (شاملًا الطرفين) في -4.\nمثال: `select_range([33, 6, 37, 31, 10])` يجب أن تُرجع `[-40, -24]`.\nالجواب:", "qhash": "0c19c47157cb4f2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('باسل', 49), ('ليلى', 1), ('أحمد', 62), ('رنا', 6)]\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 = [('باسل', 49), ('ليلى', 1), ('أحمد', 62), ('رنا', 6)]\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": "d3d517a33a71d0b3", "answer": "[('ليلى', 1), ('رنا', 6), ('باسل', 49), ('أحمد', 62)]\n['أحمد', 'باسل']", "completion": " الناتج:\n```text\n[('ليلى', 1), ('رنا', 6), ('باسل', 49), ('أحمد', 62)]\n['أحمد', 'باسل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(13) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13']", "assert game(3) == ['1', '2', '3']", "assert game(11) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11']", "assert game(23) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22', '23']", "assert game(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22']"], "test_code": "assert game(13) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13']\nassert game(3) == ['1', '2', '3']\nassert game(11) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11']\nassert game(23) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22', '23']\nassert game(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13', 'Ping', '15', '16', '17', '18', '19', 'Pong', 'Ping', '22']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Ping'، وإن قَبِلها على 10 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(13)` يُرجع `['1', '2', '3', '4', '5', '6', 'Ping', '8', '9', 'Pong', '11', '12', '13']`.\nالجواب:", "qhash": "a6530d1e1d1f8ebd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_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 max_div([17, 38, 23, -17, -30, 48]) == 48", "assert max_div([-6, -2, -8]) == -2", "assert max_div([1, 3, 5]) == None", "assert max_div([-8, 8, -31, 24, 1, 14]) == 24", "assert max_div([-28, 44, -2, 16, -11, 45, 43, 30, 27]) == 44", "assert max_div([]) == None"], "test_code": "assert max_div([17, 38, 23, -17, -30, 48]) == 48\nassert max_div([-6, -2, -8]) == -2\nassert max_div([1, 3, 5]) == None\nassert max_div([-8, 8, -31, 24, 1, 14]) == 24\nassert max_div([-28, 44, -2, 16, -11, 45, 43, 30, 27]) == 44\nassert max_div([]) == None", "answer": "def max_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 max_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 max_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 max_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مثال: `max_div([17, 38, 23, -17, -30, 48])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "8cf739875d23e588"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [30, 1, 31, -19, -3, 32]\nprint(sorted(nums, key=lambda x: (abs(x - 30), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [30, 1, 31, -19, -3, 32]\nprint(sorted(nums, key=lambda x: (abs(x - 30), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "c8964fcf62636bb9", "answer": "[30, 31, 32, 1, -3, -19]\n[32, 31, 30]", "completion": " الناتج:\n```text\n[30, 31, 32, 1, -3, -19]\n[32, 31, 30]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 14\nfor n in range(-2, 14, 2):\n total += n * 2\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 14\nfor n in range(-2, 14, 2):\n total += n * 2\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "cc95d29e47ae5ecf", "answer": "94\n12", "completion": " الناتج:\n```text\n94\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(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_of_div([43, -23, 60, 30, -13, -12, 51]) == 60", "assert max_of_div([-5, -25, -25]) == -5", "assert max_of_div([1, 6]) == None", "assert max_of_div([31, 6, -40, -36, -31]) == -40", "assert max_of_div([-27, 7, -24, 32, -32, 7]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([43, -23, 60, 30, -13, -12, 51]) == 60\nassert max_of_div([-5, -25, -25]) == -5\nassert max_of_div([1, 6]) == None\nassert max_of_div([31, 6, -40, -36, -31]) == -40\nassert max_of_div([-27, 7, -24, 32, -32, 7]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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_of_div(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_of_div(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_of_div(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_of_div([43, -23, 60, 30, -13, -12, 51])` يُرجع `60`.\nالجواب:", "qhash": "98437e4f88c5ce1b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'هدى': 9, 'يوسف': 16, 'فيصل': 9}\nmarks['يوسف'] += 12\nmarks['أحمد'] = 42\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'هدى': 9, 'يوسف': 16, 'فيصل': 9}\nmarks['يوسف'] += 12\nmarks['أحمد'] = 42\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))\n```\nالجواب:", "qhash": "1d5372efe1bde683", "answer": "4\nأحمد\n88\n-1", "completion": " الناتج:\n```text\n4\nأحمد\n88\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('signal orange apple vector we summer python') == 'python,summer,we,vector,apple,orange,signal'", "assert rev_join('it light window brain it data table') == 'table,data,it,brain,window,light,it'", "assert rev_join('brain of cloud banana a') == 'banana,cloud,of,brain'", "assert rev_join('vector on garden') == 'garden,on,vector'", "assert rev_join('in window we engine') == 'engine,we,window,in'", "assert rev_join('orange coffee') == 'coffee,orange'", "assert rev_join('') == ''"], "test_code": "assert rev_join('signal orange apple vector we summer python') == 'python,summer,we,vector,apple,orange,signal'\nassert rev_join('it light window brain it data table') == 'table,data,it,brain,window,light,it'\nassert rev_join('brain of cloud banana a') == 'banana,cloud,of,brain'\nassert rev_join('vector on garden') == 'garden,on,vector'\nassert rev_join('in window we engine') == 'engine,we,window,in'\nassert rev_join('orange coffee') == 'coffee,orange'\nassert rev_join('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_join('signal orange apple vector we summer python')` يُرجع `'python,summer,we,vector,apple,orange,signal'`.\nالجواب:", "qhash": "c98ff7c945fef91b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [2, 35, 29, 24, 28, 40]\nprint(a[0:1])\nprint(a[::3])\nprint(len(a[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [2, 35, 29, 24, 28, 40]\nprint(a[0:1])\nprint(a[::3])\nprint(len(a[0:1]))\n```\nالجواب:", "qhash": "7e17e7c1b7760584", "answer": "[2]\n[2, 24]\n1", "completion": " الناتج:\n```text\n[2]\n[2, 24]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قلم مطر نهر وردة مدينة ميناء') == 3", "assert count_start('مطر خبز ليل صحراء مدرسة نهار') == 2", "assert count_start('معلم عمل مدينة حصان برمجة بيت نهار') == 2", "assert count_start('قمر جبل باب رمل') == 0", "assert count_start('جمل مطر عمل مطر فجر مكتبة') == 3", "assert count_start('لغة حديقة حاسوب مكتبة مكتبة نور') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('قلم مطر نهر وردة مدينة ميناء') == 3\nassert count_start('مطر خبز ليل صحراء مدرسة نهار') == 2\nassert count_start('معلم عمل مدينة حصان برمجة بيت نهار') == 2\nassert count_start('قمر جبل باب رمل') == 0\nassert count_start('جمل مطر عمل مطر فجر مكتبة') == 3\nassert count_start('لغة حديقة حاسوب مكتبة مكتبة نور') == 2\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:\n if w.startswith('م'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «م». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_start(line):\n count = 0\n for w in line:\n if w.startswith('م'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('قلم مطر نهر وردة مدينة ميناء')` يُرجع `3`.\nالجواب:", "qhash": "8b9aac068795c1d1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 64) == 1)", "tests": ["assert coprime_count(119) == 60", "assert coprime_count(44) == 22", "assert coprime_count(176) == 88", "assert coprime_count(10) == 5", "assert coprime_count(184) == 92", "assert coprime_count(12) == 6", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(119) == 60\nassert coprime_count(44) == 22\nassert coprime_count(176) == 88\nassert coprime_count(10) == 5\nassert coprime_count(184) == 92\nassert coprime_count(12) == 6\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, 64) == 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, 64) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 64، أي أن القاسم المشترك الأكبر لها مع 64 يساوي 1.\nمثال: `coprime_count(119)` يجب أن تُرجع `60`.\nالجواب:", "qhash": "064c939d9af4b309"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert tally_div([31, 49, 52, 77, 28, 67, 72, 45, 49, 63]) == 0", "assert tally_div([-24, 54, -7, 88, 42, 43]) == 0", "assert tally_div([-26, -37, 63, 49, -35, 32, 7, 4, 28, 31, -3, 78]) == 0", "assert tally_div([4, 87, 15, 32, 76, -18, -12]) == 0", "assert tally_div([]) == 0", "assert tally_div([78, 68, 46, 4, -1, -22, 81, 12, 14]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([31, 49, 52, 77, 28, 67, 72, 45, 49, 63]) == 0\nassert tally_div([-24, 54, -7, 88, 42, 43]) == 0\nassert tally_div([-26, -37, 63, 49, -35, 32, 7, 4, 28, 31, -3, 78]) == 0\nassert tally_div([4, 87, 15, 32, 76, -18, -12]) == 0\nassert tally_div([]) == 0\nassert tally_div([78, 68, 46, 4, -1, -22, 81, 12, 14]) == 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 % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 2، واكتب الدالة بعد إكمالها.\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([31, 49, 52, 77, 28, 67, 72, 45, 49, 63])` يُرجع `0`.\nالجواب:", "qhash": "48892372ece54d6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "tests": ["assert step_product(9) == 42", "assert step_product(59) == 0", "assert step_product(34) == 34", "assert step_product(44) == 1", "assert step_product(52) == 42", "assert step_product(36) == 20", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 42\nassert step_product(59) == 0\nassert step_product(34) == 34\nassert step_product(44) == 1\nassert step_product(52) == 42\nassert step_product(36) == 20\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(9)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "d70d63d06b2be62b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 6)", "tests": ["assert in_range_scaled([9, 8, -1, 11, 10, 13]) == [-5]", "assert in_range_scaled([4, 10, 33, 9, 38, -30]) == [20]", "assert in_range_scaled([25, 30, -8, 56, 55, 7, -23, 20, 52]) == []", "assert in_range_scaled([33]) == []", "assert in_range_scaled([-1, 37, -8, -20, 5, -12, -15, -8]) == [-5, 25]", "assert in_range_scaled([-16]) == []", "assert in_range_scaled([-19, -12, 32, 26, 36, -28, -9, 49, 50, 38]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([9, 8, -1, 11, 10, 13]) == [-5]\nassert in_range_scaled([4, 10, 33, 9, 38, -30]) == [20]\nassert in_range_scaled([25, 30, -8, 56, 55, 7, -23, 20, 52]) == []\nassert in_range_scaled([33]) == []\nassert in_range_scaled([-1, 37, -8, -20, 5, -12, -15, -8]) == [-5, 25]\nassert in_range_scaled([-16]) == []\nassert in_range_scaled([-19, -12, 32, 26, 36, -28, -9, 49, 50, 38]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 6)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و6 (شاملًا الطرفين) في 5.\nمثال: `in_range_scaled([9, 8, -1, 11, 10, 13])` يجب أن تُرجع `[-5]`.\nالجواب:", "qhash": "a02aa0761ba1fed1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(8))\n```\nالجواب:", "qhash": "c5fe95f6c068a1e1", "answer": "123", "completion": " الناتج:\n```text\n123\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'دفتر'\nprint(s[-1])\nprint(s[::-1])\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'دفتر'\nprint(s[-1])\nprint(s[::-1])\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "62de753c64ef8e30", "answer": "ر\nرتفد\nدفتر", "completion": " الناتج:\n```text\nر\nرتفد\nدفتر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert roll([5, 17, 48, 13, 35]) == [17, 48, 13, 35, 5]", "assert roll([-1, 29, 41, 31, 49, 31]) == [49, 31, -1, 29, 41, 31]", "assert roll([-6, -4, 24, 8, 35, 2, 11]) == [24, 8, 35, 2, 11, -6, -4]", "assert roll([38, -1, 6, 20, 0, 37, 24]) == [6, 20, 0, 37, 24, 38, -1]", "assert roll([47, 3, 33, 11, 17, 16, 46, -6, 30, 42]) == [46, -6, 30, 42, 47, 3, 33, 11, 17, 16]", "assert roll([-6, 46, 22]) == [46, 22, -6]", "assert roll([]) == []"], "test_code": "assert roll([5, 17, 48, 13, 35]) == [17, 48, 13, 35, 5]\nassert roll([-1, 29, 41, 31, 49, 31]) == [49, 31, -1, 29, 41, 31]\nassert roll([-6, -4, 24, 8, 35, 2, 11]) == [24, 8, 35, 2, 11, -6, -4]\nassert roll([38, -1, 6, 20, 0, 37, 24]) == [6, 20, 0, 37, 24, 38, -1]\nassert roll([47, 3, 33, 11, 17, 16, 46, -6, 30, 42]) == [46, -6, 30, 42, 47, 3, 33, 11, 17, 16]\nassert roll([-6, 46, 22]) == [46, 22, -6]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef roll(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return ____\n```\nمثال: `roll([5, 17, 48, 13, 35])` يجب أن تُرجع `[17, 48, 13, 35, 5]`.\nالجواب:", "qhash": "fc87345cd8501db8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(12) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']", "assert label_numbers(15) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi']", "assert label_numbers(22) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22']", "assert label_numbers(8) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8']", "assert label_numbers(9) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9']"], "test_code": "assert label_numbers(12) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']\nassert label_numbers(15) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi']\nassert label_numbers(22) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22']\nassert label_numbers(8) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8']\nassert label_numbers(9) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Hi'، وعلى 6 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(12)` يجب أن تُرجع `['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']`.\nالجواب:", "qhash": "b750cf2e3308a6e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 0:\n return 4\n return 2 * calc(n - 1) + 1\n\nprint(calc(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 0:\n return 4\n return 2 * calc(n - 1) + 1\n\nprint(calc(7))\n```\nالجواب:", "qhash": "39081d853107caaf", "answer": "639", "completion": " الناتج:\n```text\n639\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert cycle([44, 20, 47, 33, 49, 28, 6, 40]) == [20, 47, 33, 49, 28, 6, 40, 44]", "assert cycle([11, 16, 48, 40, 8, -7, -2, 10, 47, -2, 37, 43]) == [-2, 37, 43, 11, 16, 48, 40, 8, -7, -2, 10, 47]", "assert cycle([-3, 18, 5]) == [-3, 18, 5]", "assert cycle([11, 25, -1]) == [11, 25, -1]", "assert cycle([-9, 23]) == [23, -9]", "assert cycle([35, -6, 25, 4, 35, 2, -3, 7, -7, 8, 31, 26]) == [8, 31, 26, 35, -6, 25, 4, 35, 2, -3, 7, -7]", "assert cycle([]) == []"], "test_code": "assert cycle([44, 20, 47, 33, 49, 28, 6, 40]) == [20, 47, 33, 49, 28, 6, 40, 44]\nassert cycle([11, 16, 48, 40, 8, -7, -2, 10, 47, -2, 37, 43]) == [-2, 37, 43, 11, 16, 48, 40, 8, -7, -2, 10, 47]\nassert cycle([-3, 18, 5]) == [-3, 18, 5]\nassert cycle([11, 25, -1]) == [11, 25, -1]\nassert cycle([-9, 23]) == [23, -9]\nassert cycle([35, -6, 25, 4, 35, 2, -3, 7, -7, 8, 31, 26]) == [8, 31, 26, 35, -6, 25, 4, 35, 2, -3, 7, -7]\nassert cycle([]) == []", "answer": "def cycle(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef cycle(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 cycle(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return ____\n```\nمثال: `cycle([44, 20, 47, 33, 49, 28, 6, 40])` يجب أن تُرجع `[20, 47, 33, 49, 28, 6, 40, 44]`.\nالجواب:", "qhash": "d750c11c1e73df2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 121:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([47, 49, 28, 57, 42]) == [47, 96, 0, 57, 99]", "assert acc_reset([57, 11, 40, 59, 41, -8, 23, 109, 93]) == [57, 68, 108, 0, 41, 33, 56, 0, 93]", "assert acc_reset([120, 29, 104, 80, 54, 51]) == [120, 0, 104, 0, 54, 105]", "assert acc_reset([33, 114, 78, 114, 23, 13, 101, 18, 116]) == [33, 0, 78, 0, 23, 36, 0, 18, 0]", "assert acc_reset([]) == []", "assert acc_reset([73]) == [73]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([47, 49, 28, 57, 42]) == [47, 96, 0, 57, 99]\nassert acc_reset([57, 11, 40, 59, 41, -8, 23, 109, 93]) == [57, 68, 108, 0, 41, 33, 56, 0, 93]\nassert acc_reset([120, 29, 104, 80, 54, 51]) == [120, 0, 104, 0, 54, 105]\nassert acc_reset([33, 114, 78, 114, 23, 13, 101, 18, 116]) == [33, 0, 78, 0, 23, 36, 0, 18, 0]\nassert acc_reset([]) == []\nassert acc_reset([73]) == [73]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 121:\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 > 121:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 121 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([47, 49, 28, 57, 42])` يُرجع `[47, 96, 0, 57, 99]`.\nالجواب:", "qhash": "4561e5efc507f9b2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 39) == 1)", "tests": ["assert coprimes(97) == 60", "assert coprimes(112) == 69", "assert coprimes(124) == 77", "assert coprimes(85) == 53", "assert coprimes(67) == 41", "assert coprimes(66) == 40", "assert coprimes(1) == 1"], "test_code": "assert coprimes(97) == 60\nassert coprimes(112) == 69\nassert coprimes(124) == 77\nassert coprimes(85) == 53\nassert coprimes(67) == 41\nassert coprimes(66) == 40\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, 39) == 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, 39) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 39) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(97)` يُرجع `60`.\nالجواب:", "qhash": "170ee823038cfe2e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [20, 23, 11, 21, 33, 32]\nprint(xs[0:2])\nprint(xs[::-1])\nprint(min(xs[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [20, 23, 11, 21, 33, 32]\nprint(xs[0:2])\nprint(xs[::-1])\nprint(min(xs[0:2]))\n```\nالجواب:", "qhash": "36e77204594be186", "answer": "[20, 23]\n[32, 33, 21, 11, 23, 20]\n20", "completion": " الناتج:\n```text\n[20, 23]\n[32, 33, 21, 11, 23, 20]\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 20\nfor i in range(9, 34, 3):\n total -= i * 2\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 20\nfor i in range(9, 34, 3):\n total -= i * 2\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "9fdff47185d0679d", "answer": "-358\n33", "completion": " الناتج:\n```text\n-358\n33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(-9))\nprint(compute(-9, -6))\nprint(compute(compute(-6), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(compute(-9))\nprint(compute(-9, -6))\nprint(compute(compute(-6), -9))\n```\nالجواب:", "qhash": "4b08c9ac7a6578f1", "answer": "-4\n-15\n8", "completion": " الناتج:\n```text\n-4\n-15\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 2", "tests": ["assert digit_score(43990) == 1", "assert digit_score(869022) == 1", "assert digit_score(656202) == 1", "assert digit_score(771319) == 0", "assert digit_score(466705) == 0", "assert digit_score(67483) == 0", "assert digit_score(739113) == 0", "assert digit_score(0) == 0"], "test_code": "assert digit_score(43990) == 1\nassert digit_score(869022) == 1\nassert digit_score(656202) == 1\nassert digit_score(771319) == 0\nassert digit_score(466705) == 0\nassert digit_score(67483) == 0\nassert digit_score(739113) == 0\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 2", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 2\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 2.\nللتوضيح: الاستدعاء `digit_score(43990)` يُرجع `1`.\nالجواب:", "qhash": "4fd4515a2e2a6223"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'python'\nprint(s.replace('n', '*'))\nprint(s[::-1])\nprint(s.count('n'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'python'\nprint(s.replace('n', '*'))\nprint(s[::-1])\nprint(s.count('n'))\n```\nالجواب:", "qhash": "73fc468e4e631dbb", "answer": "pytho*\nnohtyp\n1", "completion": " الناتج:\n```text\npytho*\nnohtyp\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([31, 14, 13, 7, 14]) == [14, 13, 7, 14, 31]", "assert roll([9, -6, 21, 16, -5, 26, 46, -9, 21, 46, 16]) == [21, 16, -5, 26, 46, -9, 21, 46, 16, 9, -6]", "assert roll([13, 46]) == [46, 13]", "assert roll([17, -7]) == [-7, 17]", "assert roll([5, 22, 4, 45]) == [45, 5, 22, 4]", "assert roll([16, 49, -3, 0, 39, 15, 25, -9, 35]) == [16, 49, -3, 0, 39, 15, 25, -9, 35]", "assert roll([]) == []"], "test_code": "assert roll([31, 14, 13, 7, 14]) == [14, 13, 7, 14, 31]\nassert roll([9, -6, 21, 16, -5, 26, 46, -9, 21, 46, 16]) == [21, 16, -5, 26, 46, -9, 21, 46, 16, 9, -6]\nassert roll([13, 46]) == [46, 13]\nassert roll([17, -7]) == [-7, 17]\nassert roll([5, 22, 4, 45]) == [45, 5, 22, 4]\nassert roll([16, 49, -3, 0, 39, 15, 25, -9, 35]) == [16, 49, -3, 0, 39, 15, 25, -9, 35]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 9 % 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 = 9 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nمثال: `roll([31, 14, 13, 7, 14])` يجب أن تُرجع `[14, 13, 7, 14, 31]`.\nالجواب:", "qhash": "921e8dcf2ad09215"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -3 + 8 for x in range(-2, 8) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -3 + 8 for x in range(-2, 8) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "7348b0fba83c510e", "answer": "[11, -4]\n2 7", "completion": " الناتج:\n```text\n[11, -4]\n2 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "begin_count", "reference": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "tests": ["assert begin_count('جمل جمل قهوة بحر') == 2", "assert begin_count('ليل فجر ليل حاسوب عربية') == 0", "assert begin_count('جمل شجرة عمل جمل شجرة نهر جمل') == 3", "assert begin_count('نهر جمل مكتبة') == 1", "assert begin_count('سيارة برتقال تفاحة') == 0", "assert begin_count('كتاب دفتر ليل بحر جمل جمل') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('جمل جمل قهوة بحر') == 2\nassert begin_count('ليل فجر ليل حاسوب عربية') == 0\nassert begin_count('جمل شجرة عمل جمل شجرة نهر جمل') == 3\nassert begin_count('نهر جمل مكتبة') == 1\nassert begin_count('سيارة برتقال تفاحة') == 0\nassert begin_count('كتاب دفتر ليل بحر جمل جمل') == 2\nassert begin_count('') == 0", "answer": "def begin_count(text):\n count = 0\n for w in text.split():\n if w.startswith('ج'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(text):\n count = 0\n for w in text.split():\n if 'ج' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('جمل جمل قهوة بحر')` يُرجع `2`.\nالجواب:", "qhash": "5688035df64bde72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([13, 48, 2, -23, 4]) == 48", "assert max_of_div([-12, -6, -3]) == -3", "assert max_of_div([1, 4, 7, 10]) == None", "assert max_of_div([30, 8, -11, 0, 20, -17]) == 30", "assert max_of_div([-26, -35, -12, -13, -30]) == -12", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([13, 48, 2, -23, 4]) == 48\nassert max_of_div([-12, -6, -3]) == -3\nassert max_of_div([1, 4, 7, 10]) == None\nassert max_of_div([30, 8, -11, 0, 20, -17]) == 30\nassert max_of_div([-26, -35, -12, -13, -30]) == -12\nassert max_of_div([]) == None", "answer": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 3 == 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 % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 3 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(arr):\n best = None\n for x in arr:\n if x % 3 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_of_div([13, 48, 2, -23, 4])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "133bbf06d848ff67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "how_many", "reference": "def how_many(text):\n return text.count('ي')", "tests": ["assert how_many('معلم مدينة برتقال قهوة برمجة نهار معلم مدرسة') == 1", "assert how_many('معلم نهر عربية') == 1", "assert how_many('سفينة قلم بحر خبز') == 1", "assert how_many('') == 0", "assert how_many('معلم صديق') == 1", "assert how_many('ليل حاسوب ليل فجر رمل') == 2", "assert how_many('سلام حديقة خبز نهر سوق صحراء نور ماء') == 1", "assert how_many('') == 0"], "test_code": "assert how_many('معلم مدينة برتقال قهوة برمجة نهار معلم مدرسة') == 1\nassert how_many('معلم نهر عربية') == 1\nassert how_many('سفينة قلم بحر خبز') == 1\nassert how_many('') == 0\nassert how_many('معلم صديق') == 1\nassert how_many('ليل حاسوب ليل فجر رمل') == 2\nassert how_many('سلام حديقة خبز نهر سوق صحراء نور ماء') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ي» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('معلم مدينة برتقال قهوة برمجة نهار معلم مدرسة')` يُرجع `1`.\nالجواب:", "qhash": "d69bf150f22d6a46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(498216433))\nprint(calc(calc(498216433)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(498216433))\nprint(calc(calc(498216433)))\n```\nالجواب:", "qhash": "96bfd89c071619c4", "answer": "40\n4", "completion": " الناتج:\n```text\n40\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 2, 'راشد': 46, 'عمر': 39, 'سلمى': 32}\npoints['يوسف'] += 17\npoints['فيصل'] = 20\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 18])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 2, 'راشد': 46, 'عمر': 39, 'سلمى': 32}\npoints['يوسف'] += 17\npoints['فيصل'] = 20\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 18])\n```\nالجواب:", "qhash": "8317c1acbf147196", "answer": "5\nراشد\n156\n['يوسف', 'راشد', 'عمر', 'سلمى', 'فيصل']", "completion": " الناتج:\n```text\n5\nراشد\n156\n['يوسف', 'راشد', 'عمر', 'سلمى', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20', 'Foo', 'Bar', '23', '24', '25']", "assert game(0) == []", "assert game(17) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17']", "assert game(0) == []", "assert game(8) == ['1', '2', '3', '4', '5', '6', 'Foo', '8']"], "test_code": "assert game(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20', 'Foo', 'Bar', '23', '24', '25']\nassert game(0) == []\nassert game(17) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17']\nassert game(0) == []\nassert game(8) == ['1', '2', '3', '4', '5', '6', 'Foo', '8']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\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 % 7 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 11 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(25)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20', 'Foo', 'Bar', '23', '24', '25']`.\nالجواب:", "qhash": "8d3e28d6403bdb45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'engine'\nprint(s.capitalize())\nprint(s[::-1])\nprint(s.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'engine'\nprint(s.capitalize())\nprint(s[::-1])\nprint(s.upper())\n```\nالجواب:", "qhash": "12fd4f9f4b9d52fe", "answer": "Engine\nenigne\nENGINE", "completion": " الناتج:\n```text\nEngine\nenigne\nENGINE\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 12) == 1)", "tests": ["assert count_gcd1(59) == 20", "assert count_gcd1(154) == 51", "assert count_gcd1(19) == 7", "assert count_gcd1(112) == 37", "assert count_gcd1(29) == 10", "assert count_gcd1(174) == 58", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(59) == 20\nassert count_gcd1(154) == 51\nassert count_gcd1(19) == 7\nassert count_gcd1(112) == 37\nassert count_gcd1(29) == 10\nassert count_gcd1(174) == 58\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, 12) == 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, 12) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 12) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(59)` يُرجع `20`.\nالجواب:", "qhash": "150ecec2451f7efc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('ر')", "tests": ["assert tally_letter('قلم قمر مدرسة وردة') == 3", "assert tally_letter('جبل حاسوب سيارة حديقة لغة') == 1", "assert tally_letter('برمجة') == 1", "assert tally_letter('طائرة مدرسة دفتر سلام') == 3", "assert tally_letter('') == 0", "assert tally_letter('كتاب معلم قلم نهار مكتبة قهوة') == 1", "assert tally_letter('سيارة سفينة شمس عمل بيت حديقة') == 1", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('قلم قمر مدرسة وردة') == 3\nassert tally_letter('جبل حاسوب سيارة حديقة لغة') == 1\nassert tally_letter('برمجة') == 1\nassert tally_letter('طائرة مدرسة دفتر سلام') == 3\nassert tally_letter('') == 0\nassert tally_letter('كتاب معلم قلم نهار مكتبة قهوة') == 1\nassert tally_letter('سيارة سفينة شمس عمل بيت حديقة') == 1\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n return text.count('ر')", "completion": " ```python\ndef tally_letter(text):\n return text.count('ر')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `tally_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «ر» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('قلم قمر مدرسة وردة')` يُرجع `3`.\nالجواب:", "qhash": "8badaefb7ec1efa8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('رمل جمل ماء سيارة') == 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('رمل رمل ماء حاسوب') == 2\nassert lead_count('رمل جمل ماء سيارة') == 1\nassert lead_count('صديق برمجة معلم سلام سفينة نهر') == 0\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": "df330405ee0e86f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=7):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-7))\nprint(h(-7, -4))\nprint(h(h(-4), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=7):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-7))\nprint(h(-7, -4))\nprint(h(h(-4), -7))\n```\nالجواب:", "qhash": "809ac13dd14fba6e", "answer": "-28\n5\n-4", "completion": " الناتج:\n```text\n-28\n5\n-4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "tests": ["assert mult_sum(25) == 55", "assert mult_sum(268) == 7644", "assert mult_sum(41) == 183", "assert mult_sum(185) == 3549", "assert mult_sum(158) == 2694", "assert mult_sum(52) == 274", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(25) == 55\nassert mult_sum(268) == 7644\nassert mult_sum(41) == 183\nassert mult_sum(185) == 3549\nassert mult_sum(158) == 2694\nassert mult_sum(52) == 274\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 13.\nمثال: `mult_sum(25)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "eeaa5500290c6ad1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('on') == 'kj'", "assert encode('light rocket pixel') == 'hecdp nkygap letah'", "assert encode('it') == 'ep'", "assert encode('banana orange signal !') == 'xwjwjw knwjca oecjwh !'", "assert encode('banana') == 'xwjwjw'", "assert encode('up') == 'ql'", "assert encode('') == ''"], "test_code": "assert encode('on') == 'kj'\nassert encode('light rocket pixel') == 'hecdp nkygap letah'\nassert encode('it') == 'ep'\nassert encode('banana orange signal !') == 'xwjwjw knwjca oecjwh !'\nassert encode('banana') == 'xwjwjw'\nassert encode('up') == 'ql'\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 + (22)) % 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 + (22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('on')` يجب أن تُرجع `'kj'`.\nالجواب:", "qhash": "9abc608d7a6b8854"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 36", "tests": ["assert digit_power(15026) == 26", "assert digit_power(79404) == 12", "assert digit_power(329313) == 27", "assert digit_power(833923) == 34", "assert digit_power(814937) == 20", "assert digit_power(236374) == 1", "assert digit_power(417908) == 29", "assert digit_power(0) == 0"], "test_code": "assert digit_power(15026) == 26\nassert digit_power(79404) == 12\nassert digit_power(329313) == 27\nassert digit_power(833923) == 34\nassert digit_power(814937) == 20\nassert digit_power(236374) == 1\nassert digit_power(417908) == 29\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 36", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 36\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 36.\nمثال: `digit_power(15026)` يجب أن تُرجع `26`.\nالجواب:", "qhash": "73300f581e2e249c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(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 max_of_div([24, 48, 50, 58]) == 48", "assert max_of_div([-30, -12, -12]) == -12", "assert max_of_div([1, 7, 13, 19]) == None", "assert max_of_div([38, 23, -5, 39, 33]) == None", "assert max_of_div([-35, 22, 15, -8]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([24, 48, 50, 58]) == 48\nassert max_of_div([-30, -12, -12]) == -12\nassert max_of_div([1, 7, 13, 19]) == None\nassert max_of_div([38, 23, -5, 39, 33]) == None\nassert max_of_div([-35, 22, 15, -8]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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 max_of_div(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 max_of_div(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 max_of_div(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مثال: `max_of_div([24, 48, 50, 58])` يجب أن تُرجع `48`.\nالجواب:", "qhash": "3f2323c1a3fa3f07"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [35, 31, -7, 29, 16, 19, 32, 38, 30]\nprint(a[1:2])\nprint(a[::-1])\nprint(len(a[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [35, 31, -7, 29, 16, 19, 32, 38, 30]\nprint(a[1:2])\nprint(a[::-1])\nprint(len(a[1:2]))\n```\nالجواب:", "qhash": "fc446cf0003e1775", "answer": "[31]\n[30, 38, 32, 19, 16, 29, -7, 31, 35]\n1", "completion": " الناتج:\n```text\n[31]\n[30, 38, 32, 19, 16, 29, -7, 31, 35]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(0, 1))", "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(0, 1))\n```\nالجواب:", "qhash": "273f5039e292ec73", "answer": "0", "completion": " الناتج:\n```text\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert series(8) == 741312", "assert series(0) == 0", "assert series(3) == 3312", "assert series(5) == 53100", "assert series(9) == 1449900", "assert series(1) == 12", "assert series(0) == 0"], "test_code": "assert series(8) == 741312\nassert series(0) == 0\nassert series(3) == 3312\nassert series(5) == 53100\nassert series(9) == 1449900\nassert series(1) == 12\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 5\n return total\n```\nمثال: `series(8)` يجب أن تُرجع `741312`.\nالجواب:", "qhash": "8802ce6c68357956"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('is matrix winter apple planet on') == 'on planet apple winter matrix is'", "assert words_reversed('') == ''", "assert words_reversed('data vector to rocket') == 'rocket to vector data'", "assert words_reversed('of music') == 'music of'", "assert words_reversed('garden rocket signal go music an') == 'an music go signal rocket garden'", "assert words_reversed('an') == 'an'", "assert words_reversed('pixel desert') == 'desert pixel'"], "test_code": "assert words_reversed('is matrix winter apple planet on') == 'on planet apple winter matrix is'\nassert words_reversed('') == ''\nassert words_reversed('data vector to rocket') == 'rocket to vector data'\nassert words_reversed('of music') == 'music of'\nassert words_reversed('garden rocket signal go music an') == 'an music go signal rocket garden'\nassert words_reversed('an') == 'an'\nassert words_reversed('pixel desert') == 'desert pixel'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `words_reversed('is matrix winter apple planet on')` يُرجع `'on planet apple winter matrix is'`.\nالجواب:", "qhash": "6e150c6e0e66153b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert sum_powers(4) == 1100", "assert sum_powers(10) == 33275", "assert sum_powers(14) == 121275", "assert sum_powers(2) == 99", "assert sum_powers(9) == 22275", "assert sum_powers(1) == 11", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(4) == 1100\nassert sum_powers(10) == 33275\nassert sum_powers(14) == 121275\nassert sum_powers(2) == 99\nassert sum_powers(9) == 22275\nassert sum_powers(1) == 11\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 3\n return total\n```\nمثال: `sum_powers(4)` يجب أن تُرجع `1100`.\nالجواب:", "qhash": "9123d245858f4fa6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(246) == 6432", "assert total_multiples(80) == 714", "assert total_multiples(134) == 1896", "assert total_multiples(165) == 2940", "assert total_multiples(81) == 714", "assert total_multiples(60) == 368", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(246) == 6432\nassert total_multiples(80) == 714\nassert total_multiples(134) == 1896\nassert total_multiples(165) == 2940\nassert total_multiples(81) == 714\nassert total_multiples(60) == 368\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 14.\nمثال: `total_multiples(246)` يجب أن تُرجع `6432`.\nالجواب:", "qhash": "dd8648b0b0ca6cae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 254\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 = 254\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": "6f1027a4de57c9b0", "answer": "47", "completion": " الناتج:\n```text\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([49, 47, 3, 20]) == [49, 47, 3, 20]", "assert spin([35, -7, 31, -2, -9, 28, -2, 6, 43, 1]) == [43, 1, 35, -7, 31, -2, -9, 28, -2, 6]", "assert spin([10, 39, -6, 9, 26, -8, -9, 23, 10, 31, 18, 29]) == [10, 31, 18, 29, 10, 39, -6, 9, 26, -8, -9, 23]", "assert spin([23, -8, -2, 43, 45]) == [43, 45, 23, -8, -2]", "assert spin([21, -7]) == [21, -7]", "assert spin([-4, 12, -4, 30, 22, 36, 28, 44, 44, 17, 50]) == [44, 17, 50, -4, 12, -4, 30, 22, 36, 28, 44]", "assert spin([]) == []"], "test_code": "assert spin([49, 47, 3, 20]) == [49, 47, 3, 20]\nassert spin([35, -7, 31, -2, -9, 28, -2, 6, 43, 1]) == [43, 1, 35, -7, 31, -2, -9, 28, -2, 6]\nassert spin([10, 39, -6, 9, 26, -8, -9, 23, 10, 31, 18, 29]) == [10, 31, 18, 29, 10, 39, -6, 9, 26, -8, -9, 23]\nassert spin([23, -8, -2, 43, 45]) == [43, 45, 23, -8, -2]\nassert spin([21, -7]) == [21, -7]\nassert spin([-4, 12, -4, 30, 22, 36, 28, 44, 44, 17, 50]) == [44, 17, 50, -4, 12, -4, 30, 22, 36, 28, 44]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 8 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([49, 47, 3, 20])` يُرجع `[49, 47, 3, 20]`.\nالجواب:", "qhash": "5819a7d3cd0a1e6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('planet') == 'tperix'", "assert rot('code stone') == 'gshi wxsri'", "assert rot('music apple an') == 'qywmg ettpi er'", "assert rot('summer at window brain of') == 'wyqqiv ex amrhsa fvemr sj'", "assert rot('data signal 2024') == 'hexe wmkrep 2024'", "assert rot('river banana desert OK') == 'vmziv ferere hiwivx OK'", "assert rot('') == ''"], "test_code": "assert rot('planet') == 'tperix'\nassert rot('code stone') == 'gshi wxsri'\nassert rot('music apple an') == 'qywmg ettpi er'\nassert rot('summer at window brain of') == 'wyqqiv ex amrhsa fvemr sj'\nassert rot('data signal 2024') == 'hexe wmkrep 2024'\nassert rot('river banana desert OK') == 'vmziv ferere hiwivx OK'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('planet')` يجب أن تُرجع `'tperix'`.\nالجواب:", "qhash": "b87bf1462b56d5f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bgt'}", "tests": ["assert freq_of('rocket') == {'b': 0, 'g': 0, 't': 1}", "assert freq_of('in apple vector') == {'b': 0, 'g': 0, 't': 1}", "assert freq_of('an desert') == {'b': 0, 'g': 0, 't': 1}", "assert freq_of('planet garden light desert python') == {'b': 0, 'g': 2, 't': 4}", "assert freq_of('coffee light') == {'b': 0, 'g': 1, 't': 1}", "assert freq_of('light signal planet') == {'b': 0, 'g': 2, 't': 2}", "assert freq_of('') == {'b': 0, 'g': 0, 't': 0}"], "test_code": "assert freq_of('rocket') == {'b': 0, 'g': 0, 't': 1}\nassert freq_of('in apple vector') == {'b': 0, 'g': 0, 't': 1}\nassert freq_of('an desert') == {'b': 0, 'g': 0, 't': 1}\nassert freq_of('planet garden light desert python') == {'b': 0, 'g': 2, 't': 4}\nassert freq_of('coffee light') == {'b': 0, 'g': 1, 't': 1}\nassert freq_of('light signal planet') == {'b': 0, 'g': 2, 't': 2}\nassert freq_of('') == {'b': 0, 'g': 0, 't': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bgt'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bgt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'g'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('rocket')` يجب أن تُرجع `{'b': 0, 'g': 0, 't': 1}`.\nالجواب:", "qhash": "45bd27dc7a22943b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 20\nfor x in range(6, 22, 3):\n s -= x * 2\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 20\nfor x in range(6, 22, 3):\n s -= x * 2\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "a9093a3ea0350226", "answer": "-142\n21", "completion": " الناتج:\n```text\n-142\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'رمل نور'\nprint(text.split())\nprint(text.find('ا'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'رمل نور'\nprint(text.split())\nprint(text.find('ا'))\nprint(len(text))\n```\nالجواب:", "qhash": "b90fb11ba7ceb01d", "answer": "['رمل', 'نور']\n-1\n7", "completion": " الناتج:\n```text\n['رمل', 'نور']\n-1\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(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 capped_cumsum([57, 86, 41, 11, 80, 27, 15, 60, 24]) == [57, 143, 0, 11, 91, 118, 133, 0, 24]", "assert capped_cumsum([]) == []", "assert capped_cumsum([71, 175]) == [71, 0]", "assert capped_cumsum([54]) == [54]", "assert capped_cumsum([170, 144, 71, 0, 157, 129, -5]) == [170, 0, 71, 71, 0, 129, 124]", "assert capped_cumsum([97, 67, 138, 24, 89, 96, 72, 77, 67, 148]) == [97, 164, 0, 24, 113, 0, 72, 149, 0, 148]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([57, 86, 41, 11, 80, 27, 15, 60, 24]) == [57, 143, 0, 11, 91, 118, 133, 0, 24]\nassert capped_cumsum([]) == []\nassert capped_cumsum([71, 175]) == [71, 0]\nassert capped_cumsum([54]) == [54]\nassert capped_cumsum([170, 144, 71, 0, 157, 129, -5]) == [170, 0, 71, 71, 0, 129, 124]\nassert capped_cumsum([97, 67, 138, 24, 89, 96, 72, 77, 67, 148]) == [97, 164, 0, 24, 113, 0, 72, 149, 0, 148]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(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 capped_cumsum(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سؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 183 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([57, 86, 41, 11, 80, 27, 15, 60, 24])` يُرجع `[57, 143, 0, 11, 91, 118, 133, 0, 24]`.\nالجواب:", "qhash": "e9881f6319233e0c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(4))\nprint(f(4, 10))\nprint(f(f(10), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=0):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(4))\nprint(f(4, 10))\nprint(f(f(10), 4))\n```\nالجواب:", "qhash": "380bff48ebe816a0", "answer": "28\n74\n486", "completion": " الناتج:\n```text\n28\n74\n486\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "how_many", "reference": "def how_many(text):\n return text.count('س')", "tests": ["assert how_many('مدرسة قلم سفينة بيت كتاب') == 2", "assert how_many('صديق برتقال') == 0", "assert how_many('سوق') == 1", "assert how_many('سماء سوق صديق') == 2", "assert how_many('شمس') == 1", "assert how_many('لغة') == 0", "assert how_many('قهوة عربية بحر') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('مدرسة قلم سفينة بيت كتاب') == 2\nassert how_many('صديق برتقال') == 0\nassert how_many('سوق') == 1\nassert how_many('سماء سوق صديق') == 2\nassert how_many('شمس') == 1\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('مدرسة قلم سفينة بيت كتاب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "246f68cd88612747"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'eimn'}", "tests": ["assert letter_stats('cloud music an apple') == {'e': 1, 'i': 1, 'm': 1, 'n': 1}", "assert letter_stats('stone') == {'e': 1, 'i': 0, 'm': 0, 'n': 1}", "assert letter_stats('brain') == {'e': 0, 'i': 1, 'm': 0, 'n': 1}", "assert letter_stats('an python camel is') == {'e': 1, 'i': 1, 'm': 1, 'n': 2}", "assert letter_stats('apple a') == {'e': 1, 'i': 0, 'm': 0, 'n': 0}", "assert letter_stats('at') == {'e': 0, 'i': 0, 'm': 0, 'n': 0}", "assert letter_stats('') == {'e': 0, 'i': 0, 'm': 0, 'n': 0}"], "test_code": "assert letter_stats('cloud music an apple') == {'e': 1, 'i': 1, 'm': 1, 'n': 1}\nassert letter_stats('stone') == {'e': 1, 'i': 0, 'm': 0, 'n': 1}\nassert letter_stats('brain') == {'e': 0, 'i': 1, 'm': 0, 'n': 1}\nassert letter_stats('an python camel is') == {'e': 1, 'i': 1, 'm': 1, 'n': 2}\nassert letter_stats('apple a') == {'e': 1, 'i': 0, 'm': 0, 'n': 0}\nassert letter_stats('at') == {'e': 0, 'i': 0, 'm': 0, 'n': 0}\nassert letter_stats('') == {'e': 0, 'i': 0, 'm': 0, 'n': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'eimn'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'eimn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'i'، 'm'، 'n' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('cloud music an apple')` يُرجع `{'e': 1, 'i': 1, 'm': 1, 'n': 1}`.\nالجواب:", "qhash": "e00f15155367b502"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([53, -14, 19, -29, 48, 16, 26]) == None", "assert biggest_mult([-45, -9, -27]) == -9", "assert biggest_mult([1, 10, 19]) == None", "assert biggest_mult([-37, 17, 21, -7, 35, 36, 18, -30, 22]) == 36", "assert biggest_mult([10, 40, -12, 21, 27, 42, -13]) == 27", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([53, -14, 19, -29, 48, 16, 26]) == None\nassert biggest_mult([-45, -9, -27]) == -9\nassert biggest_mult([1, 10, 19]) == None\nassert biggest_mult([-37, 17, 21, -7, 35, 36, 18, -30, 22]) == 36\nassert biggest_mult([10, 40, -12, 21, 27, 42, -13]) == 27\nassert biggest_mult([]) == None", "answer": "def biggest_mult(values):\n best = None\n for x in values:\n if x % 9 == 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 % 9 == 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 % 9 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(values):\n best = None\n for x in values:\n if x % 9 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `biggest_mult([53, -14, 19, -29, 48, 16, 26])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "ef40ee8a0b7adbbe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 7\nfor x in range(5, 29, 2):\n acc -= x * 4\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 7\nfor x in range(5, 29, 2):\n acc -= x * 4\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "0fbca2861b2cf2e2", "answer": "-761\n27", "completion": " الناتج:\n```text\n-761\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'imo'}", "tests": ["assert char_freq('falcon orange') == {'i': 0, 'm': 0, 'o': 2}", "assert char_freq('in by') == {'i': 1, 'm': 0, 'o': 0}", "assert char_freq('planet of river') == {'i': 1, 'm': 0, 'o': 1}", "assert char_freq('planet apple table up banana coffee') == {'i': 0, 'm': 0, 'o': 1}", "assert char_freq('data python of rocket winter data') == {'i': 1, 'm': 0, 'o': 3}", "assert char_freq('stone we winter is it') == {'i': 3, 'm': 0, 'o': 1}", "assert char_freq('') == {'i': 0, 'm': 0, 'o': 0}"], "test_code": "assert char_freq('falcon orange') == {'i': 0, 'm': 0, 'o': 2}\nassert char_freq('in by') == {'i': 1, 'm': 0, 'o': 0}\nassert char_freq('planet of river') == {'i': 1, 'm': 0, 'o': 1}\nassert char_freq('planet apple table up banana coffee') == {'i': 0, 'm': 0, 'o': 1}\nassert char_freq('data python of rocket winter data') == {'i': 1, 'm': 0, 'o': 3}\nassert char_freq('stone we winter is it') == {'i': 3, 'm': 0, 'o': 1}\nassert char_freq('') == {'i': 0, 'm': 0, 'o': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'imo'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'imo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'i'، 'm'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('falcon orange')` يجب أن تُرجع `{'i': 0, 'm': 0, 'o': 2}`.\nالجواب:", "qhash": "0d2e01710f56a97e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 0 for x in range(-6, 7) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 0 for x in range(-6, 7) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d6150a51c06c69f5", "answer": "[36, 16, 4, 0, 4, 16, 36]\n7 112", "completion": " الناتج:\n```text\n[36, 16, 4, 0, 4, 16, 36]\n7 112\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'brain_falcon'\nprint(s[::-1])\nprint(len(s))\nprint(s.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'brain_falcon'\nprint(s[::-1])\nprint(len(s))\nprint(s.upper())\n```\nالجواب:", "qhash": "7094a947d497ab3b", "answer": "noclaf_niarb\n12\nBRAIN_FALCON", "completion": " الناتج:\n```text\nnoclaf_niarb\n12\nBRAIN_FALCON\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 12\nfor i in range(2, 9, 1):\n s -= i * 3\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 12\nfor i in range(2, 9, 1):\n s -= i * 3\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "8e9b37fac7d78b4c", "answer": "-93\n8", "completion": " الناتج:\n```text\n-93\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 15 == 0)", "tests": ["assert sum_div(198) == 5905", "assert sum_div(291) == 12762", "assert sum_div(41) == 265", "assert sum_div(147) == 3159", "assert sum_div(134) == 2604", "assert sum_div(123) == 2220", "assert sum_div(1) == 0"], "test_code": "assert sum_div(198) == 5905\nassert sum_div(291) == 12762\nassert sum_div(41) == 265\nassert sum_div(147) == 3159\nassert sum_div(134) == 2604\nassert sum_div(123) == 2220\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 % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 4 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(198)` يُرجع `5905`.\nالجواب:", "qhash": "222dddaa7b3346bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([82, 64, 15, 82, 85, 87, 80, 33, 14, 31, 85]) == 2", "assert tally_div([33, 33, 83, 16, 17, 21, 83, 70]) == 1", "assert tally_div([-1, -7, 81, 13, 42, 15]) == 0", "assert tally_div([50, 70, -6, 65, 86, 7, -1]) == 0", "assert tally_div([-14, -24, 45]) == 0", "assert tally_div([]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([82, 64, 15, 82, 85, 87, 80, 33, 14, 31, 85]) == 2\nassert tally_div([33, 33, 83, 16, 17, 21, 83, 70]) == 1\nassert tally_div([-1, -7, 81, 13, 42, 15]) == 0\nassert tally_div([50, 70, -6, 65, 86, 7, -1]) == 0\nassert tally_div([-14, -24, 45]) == 0\nassert tally_div([]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 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 % 8 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([82, 64, 15, 82, 85, 87, 80, 33, 14, 31, 85])` يُرجع `2`.\nالجواب:", "qhash": "40016accee5a87df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 37) == 1)", "tests": ["assert coprimes(74) == 72", "assert coprimes(53) == 52", "assert coprimes(175) == 171", "assert coprimes(105) == 103", "assert coprimes(78) == 76", "assert coprimes(84) == 82", "assert coprimes(1) == 1"], "test_code": "assert coprimes(74) == 72\nassert coprimes(53) == 52\nassert coprimes(175) == 171\nassert coprimes(105) == 103\nassert coprimes(78) == 76\nassert coprimes(84) == 82\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, 37) == 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, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 37، أي أن القاسم المشترك الأكبر لها مع 37 يساوي 1.\nمثال: `coprimes(74)` يجب أن تُرجع `72`.\nالجواب:", "qhash": "f36f220409e4abb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('matrix window we music it in code') == 'code in it music we window matrix'", "assert rev_join('of') == 'of'", "assert rev_join('') == ''", "assert rev_join('garden falcon') == 'falcon garden'", "assert rev_join('brain data signal banana up') == 'up banana signal data brain'", "assert rev_join('window') == 'window'", "assert rev_join('window by at light apple on') == 'on apple light at by window'"], "test_code": "assert rev_join('matrix window we music it in code') == 'code in it music we window matrix'\nassert rev_join('of') == 'of'\nassert rev_join('') == ''\nassert rev_join('garden falcon') == 'falcon garden'\nassert rev_join('brain data signal banana up') == 'up banana signal data brain'\nassert rev_join('window') == 'window'\nassert rev_join('window by at light apple on') == 'on apple light at by window'", "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('matrix window we music it in code')` يجب أن تُرجع `'code in it music we window matrix'`.\nالجواب:", "qhash": "b156f8815642a369"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_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 only_div([63, 60, 26, 74, 71, 18, 90, 74, 23]) == 0", "assert only_div([87, -28, 85, 30, 62, -30, 82, 31]) == 0", "assert only_div([83, -11, 78, 85, 71, 52, 9, 84, 35, -23, 66]) == 0", "assert only_div([-25, 49]) == 0", "assert only_div([63, 43, -16, 67, -3, 12, 40, 22, 54, 38]) == 2", "assert only_div([28, 72, -25, -37]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([63, 60, 26, 74, 71, 18, 90, 74, 23]) == 0\nassert only_div([87, -28, 85, 30, 62, -30, 82, 31]) == 0\nassert only_div([83, -11, 78, 85, 71, 52, 9, 84, 35, -23, 66]) == 0\nassert only_div([-25, 49]) == 0\nassert only_div([63, 43, -16, 67, -3, 12, 40, 22, 54, 38]) == 2\nassert only_div([28, 72, -25, -37]) == 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 % 7 != 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 % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 7، واكتب الدالة بعد إكمالها.\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([63, 60, 26, 74, 71, 18, 90, 74, 23])` يُرجع `0`.\nالجواب:", "qhash": "4f3f1b0a47d9a14b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total", "tests": ["assert power_sum(6) == 819", "assert power_sum(4) == 270", "assert power_sum(12) == 5850", "assert power_sum(0) == 0", "assert power_sum(9) == 2565", "assert power_sum(1) == 9", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 819\nassert power_sum(4) == 270\nassert power_sum(12) == 5850\nassert power_sum(0) == 0\nassert power_sum(9) == 2565\nassert power_sum(1) == 9\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 2\n return total\n```\nمثال: `power_sum(6)` يجب أن تُرجع `819`.\nالجواب:", "qhash": "262239efe933ef0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 26) == 1)", "tests": ["assert rel_prime_count(31) == 15", "assert rel_prime_count(136) == 63", "assert rel_prime_count(78) == 36", "assert rel_prime_count(196) == 90", "assert rel_prime_count(192) == 89", "assert rel_prime_count(196) == 90", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(31) == 15\nassert rel_prime_count(136) == 63\nassert rel_prime_count(78) == 36\nassert rel_prime_count(196) == 90\nassert rel_prime_count(192) == 89\nassert rel_prime_count(196) == 90\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, 26) == 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, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 26، أي أن القاسم المشترك الأكبر لها مع 26 يساوي 1.\nمثال: `rel_prime_count(31)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "073d4aea6446876e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -1 * x ** 2 + (0) * x + (3)", "tests": ["assert eval_poly(8) == -61", "assert eval_poly(-10) == -97", "assert eval_poly(6) == -33", "assert eval_poly(10) == -97", "assert eval_poly(12) == -141", "assert eval_poly(11) == -118", "assert eval_poly(3) == -6", "assert eval_poly(0) == 3"], "test_code": "assert eval_poly(8) == -61\nassert eval_poly(-10) == -97\nassert eval_poly(6) == -33\nassert eval_poly(10) == -97\nassert eval_poly(12) == -141\nassert eval_poly(11) == -118\nassert eval_poly(3) == -6\nassert eval_poly(0) == 3", "answer": "def eval_poly(x):\n return -1 * x ** 2 + (0) * x + (3)", "completion": " ```python\ndef eval_poly(x):\n return -1 * x ** 2 + (0) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -1x² + 0x + 3 عند العدد الصحيح x.\nمثال: `eval_poly(8)` يجب أن تُرجع `-61`.\nالجواب:", "qhash": "775308dbad662920"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'engine'\nprint(text.upper())\nprint(text.capitalize())\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'engine'\nprint(text.upper())\nprint(text.capitalize())\nprint(text[::-1])\n```\nالجواب:", "qhash": "68fbcc056419e86d", "answer": "ENGINE\nEngine\nenigne", "completion": " الناتج:\n```text\nENGINE\nEngine\nenigne\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'وردة ماء'\nprint(text.count('س'))\nprint(text.split())\nprint('س' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'وردة ماء'\nprint(text.count('س'))\nprint(text.split())\nprint('س' in text)\n```\nالجواب:", "qhash": "9fdac8e48baca71d", "answer": "0\n['وردة', 'ماء']\nFalse", "completion": " الناتج:\n```text\n0\n['وردة', 'ماء']\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'bclr'}", "tests": ["assert char_freq('winter by data river by go') == {'b': 2, 'c': 0, 'l': 0, 'r': 3}", "assert char_freq('a matrix up to we garden') == {'b': 0, 'c': 0, 'l': 0, 'r': 2}", "assert char_freq('in by at garden') == {'b': 1, 'c': 0, 'l': 0, 'r': 1}", "assert char_freq('brain of river vector') == {'b': 1, 'c': 1, 'l': 0, 'r': 4}", "assert char_freq('winter engine signal it') == {'b': 0, 'c': 0, 'l': 1, 'r': 1}", "assert char_freq('we an pixel we') == {'b': 0, 'c': 0, 'l': 1, 'r': 0}", "assert char_freq('') == {'b': 0, 'c': 0, 'l': 0, 'r': 0}"], "test_code": "assert char_freq('winter by data river by go') == {'b': 2, 'c': 0, 'l': 0, 'r': 3}\nassert char_freq('a matrix up to we garden') == {'b': 0, 'c': 0, 'l': 0, 'r': 2}\nassert char_freq('in by at garden') == {'b': 1, 'c': 0, 'l': 0, 'r': 1}\nassert char_freq('brain of river vector') == {'b': 1, 'c': 1, 'l': 0, 'r': 4}\nassert char_freq('winter engine signal it') == {'b': 0, 'c': 0, 'l': 1, 'r': 1}\nassert char_freq('we an pixel we') == {'b': 0, 'c': 0, 'l': 1, 'r': 0}\nassert char_freq('') == {'b': 0, 'c': 0, 'l': 0, 'r': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'bclr'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'bclr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c'، 'l'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('winter by data river by go')` يُرجع `{'b': 2, 'c': 0, 'l': 0, 'r': 3}`.\nالجواب:", "qhash": "f5dbbdd1bdcd6c34"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 1 * x ** 2 + (6) * x + (-5)", "tests": ["assert p(7) == 86", "assert p(-19) == 242", "assert p(-11) == 50", "assert p(-17) == 182", "assert p(-10) == 35", "assert p(9) == 130", "assert p(-11) == 50", "assert p(0) == -5"], "test_code": "assert p(7) == 86\nassert p(-19) == 242\nassert p(-11) == 50\nassert p(-17) == 182\nassert p(-10) == 35\nassert p(9) == 130\nassert p(-11) == 50\nassert p(0) == -5", "answer": "def p(x):\n return 1 * x ** 2 + (6) * x + (-5)", "completion": " ```python\ndef p(x):\n return 1 * x ** 2 + (6) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 1x² + 6x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(7)` يُرجع `86`.\nالجواب:", "qhash": "9dba23d4ceeb8d11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 9 for x in range(6, 21) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 9 for x in range(6, 21) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "143f30761683f8c4", "answer": "[27, 91, 187, 315]\n4 620", "completion": " الناتج:\n```text\n[27, 91, 187, 315]\n4 620\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'باسل': 19, 'خالد': 43, 'راشد': 29, 'علي': 34}\nscores['باسل'] += 6\nscores['أحمد'] = 25\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'باسل': 19, 'خالد': 43, 'راشد': 29, 'علي': 34}\nscores['باسل'] += 6\nscores['أحمد'] = 25\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))\n```\nالجواب:", "qhash": "c86f4cf55c49327d", "answer": "5\nخالد\n156\n34", "completion": " الناتج:\n```text\n5\nخالد\n156\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 3\n return total", "tests": ["assert scaled_powers(7) == 784", "assert scaled_powers(5) == 225", "assert scaled_powers(3) == 36", "assert scaled_powers(1) == 1", "assert scaled_powers(12) == 6084", "assert scaled_powers(1) == 1", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 784\nassert scaled_powers(5) == 225\nassert scaled_powers(3) == 36\nassert scaled_powers(1) == 1\nassert scaled_powers(12) == 6084\nassert scaled_powers(1) == 1\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(7)` يُرجع `784`.\nالجواب:", "qhash": "1b85f5fd8bc31f12"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 163:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([24, 8, 68, 23, 86, 67, 86, 77, 78]) == [24, 32, 100, 123, 0, 67, 153, 0, 78]", "assert capped_cumsum([74, 98, 0, 7, 101, 156, 159, 84, 17, 98]) == [74, 0, 0, 7, 108, 0, 159, 0, 17, 115]", "assert capped_cumsum([43, 18, 134, 103, 119, 134]) == [43, 61, 0, 103, 0, 134]", "assert capped_cumsum([-2, 71, 60]) == [-2, 69, 129]", "assert capped_cumsum([30, 42, 116, 89, 107, 45, 79, 155, 114, 89]) == [30, 72, 0, 89, 0, 45, 124, 0, 114, 0]", "assert capped_cumsum([43, 142, 37, 71]) == [43, 0, 37, 108]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([24, 8, 68, 23, 86, 67, 86, 77, 78]) == [24, 32, 100, 123, 0, 67, 153, 0, 78]\nassert capped_cumsum([74, 98, 0, 7, 101, 156, 159, 84, 17, 98]) == [74, 0, 0, 7, 108, 0, 159, 0, 17, 115]\nassert capped_cumsum([43, 18, 134, 103, 119, 134]) == [43, 61, 0, 103, 0, 134]\nassert capped_cumsum([-2, 71, 60]) == [-2, 69, 129]\nassert capped_cumsum([30, 42, 116, 89, 107, 45, 79, 155, 114, 89]) == [30, 72, 0, 89, 0, 45, 124, 0, 114, 0]\nassert capped_cumsum([43, 142, 37, 71]) == [43, 0, 37, 108]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 163:\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 > 163:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 163 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([24, 8, 68, 23, 86, 67, 86, 77, 78])` يجب أن تُرجع `[24, 32, 100, 123, 0, 67, 153, 0, 78]`.\nالجواب:", "qhash": "bd6c11eb78ba7533"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 7\nfor n in range(0, 10, 4):\n s -= n * 8\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 7\nfor n in range(0, 10, 4):\n s -= n * 8\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "67f72d4a4fa277b9", "answer": "-89\n8", "completion": " الناتج:\n```text\n-89\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if -4 <= x <= 26)", "tests": ["assert clip_scale([15, 27, -10, -5, 3, 10, 25, 29]) == [-50, -30, -20, -6]", "assert clip_scale([59]) == []", "assert clip_scale([49, 43, 25, -1]) == [-50, 2]", "assert clip_scale([31, 22, -13, 49, 5, -22]) == [-44, -10]", "assert clip_scale([-27, 27, 37, 9, 52, 30, 59, 54]) == [-18]", "assert clip_scale([]) == []", "assert clip_scale([53, 38, 20, -23, 21]) == [-42, -40]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([15, 27, -10, -5, 3, 10, 25, 29]) == [-50, -30, -20, -6]\nassert clip_scale([59]) == []\nassert clip_scale([49, 43, 25, -1]) == [-50, 2]\nassert clip_scale([31, 22, -13, 49, 5, -22]) == [-44, -10]\nassert clip_scale([-27, 27, 37, 9, 52, 30, 59, 54]) == [-18]\nassert clip_scale([]) == []\nassert clip_scale([53, 38, 20, -23, 21]) == [-42, -40]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if -4 <= x <= 26)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -2 for x in xs if -4 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -4 و26 (شاملًا الطرفين) في -2.\nمثال: `clip_scale([15, 27, -10, -5, 3, 10, 25, 29])` يجب أن تُرجع `[-50, -30, -20, -6]`.\nالجواب:", "qhash": "61faa90299a31e92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'ceou'}", "tests": ["assert count_chars('planet summer it') == {'c': 0, 'e': 2, 'o': 0, 'u': 1}", "assert count_chars('data') == {'c': 0, 'e': 0, 'o': 0, 'u': 0}", "assert count_chars('window rocket stone falcon table data') == {'c': 2, 'e': 3, 'o': 4, 'u': 0}", "assert count_chars('at planet desert planet camel up') == {'c': 1, 'e': 5, 'o': 0, 'u': 1}", "assert count_chars('stone') == {'c': 0, 'e': 1, 'o': 1, 'u': 0}", "assert count_chars('summer go in code') == {'c': 1, 'e': 2, 'o': 2, 'u': 1}", "assert count_chars('') == {'c': 0, 'e': 0, 'o': 0, 'u': 0}"], "test_code": "assert count_chars('planet summer it') == {'c': 0, 'e': 2, 'o': 0, 'u': 1}\nassert count_chars('data') == {'c': 0, 'e': 0, 'o': 0, 'u': 0}\nassert count_chars('window rocket stone falcon table data') == {'c': 2, 'e': 3, 'o': 4, 'u': 0}\nassert count_chars('at planet desert planet camel up') == {'c': 1, 'e': 5, 'o': 0, 'u': 1}\nassert count_chars('stone') == {'c': 0, 'e': 1, 'o': 1, 'u': 0}\nassert count_chars('summer go in code') == {'c': 1, 'e': 2, 'o': 2, 'u': 1}\nassert count_chars('') == {'c': 0, 'e': 0, 'o': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'ceou'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'ceou'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'e'، 'o'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('planet summer it')` يجب أن تُرجع `{'c': 0, 'e': 2, 'o': 0, 'u': 1}`.\nالجواب:", "qhash": "93316c53c961e270"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 2 * x ** 2 + (9) * x + (-9)", "tests": ["assert value_at(2) == 17", "assert value_at(20) == 971", "assert value_at(-20) == 611", "assert value_at(7) == 152", "assert value_at(-3) == -18", "assert value_at(-5) == -4", "assert value_at(-5) == -4", "assert value_at(0) == -9"], "test_code": "assert value_at(2) == 17\nassert value_at(20) == 971\nassert value_at(-20) == 611\nassert value_at(7) == 152\nassert value_at(-3) == -18\nassert value_at(-5) == -4\nassert value_at(-5) == -4\nassert value_at(0) == -9", "answer": "def value_at(x):\n return 2 * x ** 2 + (9) * x + (-9)", "completion": " ```python\ndef value_at(x):\n return 2 * x ** 2 + (9) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 2x² + 9x - 9 عند العدد الصحيح x.\nمثال: `value_at(2)` يجب أن تُرجع `17`.\nالجواب:", "qhash": "1479943e86878be8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 9) // 3 for x in range(6, 16) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 9) // 3 for x in range(6, 16) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "8ce9e4b9ae98681d", "answer": "[5, 6, 7, 8]\n4 26", "completion": " الناتج:\n```text\n[5, 6, 7, 8]\n4 26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 8 * x ** 2 + (9) * x + (4)", "tests": ["assert eval_poly(5) == 249", "assert eval_poly(-1) == 3", "assert eval_poly(-12) == 1048", "assert eval_poly(4) == 168", "assert eval_poly(-5) == 159", "assert eval_poly(-7) == 333", "assert eval_poly(5) == 249", "assert eval_poly(0) == 4"], "test_code": "assert eval_poly(5) == 249\nassert eval_poly(-1) == 3\nassert eval_poly(-12) == 1048\nassert eval_poly(4) == 168\nassert eval_poly(-5) == 159\nassert eval_poly(-7) == 333\nassert eval_poly(5) == 249\nassert eval_poly(0) == 4", "answer": "def eval_poly(x):\n return 8 * x ** 2 + (9) * x + (4)", "completion": " ```python\ndef eval_poly(x):\n return 8 * x ** 2 + (9) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 8x² + 9x + 4 عند العدد الصحيح x.\nمثال: `eval_poly(5)` يجب أن تُرجع `249`.\nالجواب:", "qhash": "2525a85dba792ee8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([18, 33, 49, 5, 16, 14]) == [5, 16, 14, 18, 33, 49]", "assert rotate_list([23, 10]) == [10, 23]", "assert rotate_list([15, 16, 8, 29, 35, 34, -2, -3]) == [16, 8, 29, 35, 34, -2, -3, 15]", "assert rotate_list([38, 14, 6, 25]) == [14, 6, 25, 38]", "assert rotate_list([3, -2, 19, 23, 37, 32, 25, 43]) == [-2, 19, 23, 37, 32, 25, 43, 3]", "assert rotate_list([5, 44, 39, 49]) == [44, 39, 49, 5]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([18, 33, 49, 5, 16, 14]) == [5, 16, 14, 18, 33, 49]\nassert rotate_list([23, 10]) == [10, 23]\nassert rotate_list([15, 16, 8, 29, 35, 34, -2, -3]) == [16, 8, 29, 35, 34, -2, -3, 15]\nassert rotate_list([38, 14, 6, 25]) == [14, 6, 25, 38]\nassert rotate_list([3, -2, 19, 23, 37, 32, 25, 43]) == [-2, 19, 23, 37, 32, 25, 43, 3]\nassert rotate_list([5, 44, 39, 49]) == [44, 39, 49, 5]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 15 % 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 = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nمثال: `rotate_list([18, 33, 49, 5, 16, 14])` يجب أن تُرجع `[5, 16, 14, 18, 33, 49]`.\nالجواب:", "qhash": "518a1cd644900ef9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(items):\n if not items:\n return []\n k = 1 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate([50, 50, 31, 8, 9, 14, 23, 24]) == [24, 50, 50, 31, 8, 9, 14, 23]", "assert rotate([29, 31, 11, 38, 27, 13, 11, 46, 3, 47]) == [47, 29, 31, 11, 38, 27, 13, 11, 46, 3]", "assert rotate([-8, 3, 28]) == [28, -8, 3]", "assert rotate([15, 42, 46, 15, 36, 8, -9, 25, 24]) == [24, 15, 42, 46, 15, 36, 8, -9, 25]", "assert rotate([21]) == [21]", "assert rotate([32, 7, 22, 1, 8, 8, 3, 18]) == [18, 32, 7, 22, 1, 8, 8, 3]", "assert rotate([]) == []"], "test_code": "assert rotate([50, 50, 31, 8, 9, 14, 23, 24]) == [24, 50, 50, 31, 8, 9, 14, 23]\nassert rotate([29, 31, 11, 38, 27, 13, 11, 46, 3, 47]) == [47, 29, 31, 11, 38, 27, 13, 11, 46, 3]\nassert rotate([-8, 3, 28]) == [28, -8, 3]\nassert rotate([15, 42, 46, 15, 36, 8, -9, 25, 24]) == [24, 15, 42, 46, 15, 36, 8, -9, 25]\nassert rotate([21]) == [21]\nassert rotate([32, 7, 22, 1, 8, 8, 3, 18]) == [18, 32, 7, 22, 1, 8, 8, 3]\nassert rotate([]) == []", "answer": "def rotate(items):\n if not items:\n return []\n k = 1 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef rotate(items):\n if not items:\n return []\n k = 1 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(items):\n if not items:\n return []\n k = 1 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([50, 50, 31, 8, 9, 14, 23, 24])` يُرجع `[24, 50, 50, 31, 8, 9, 14, 23]`.\nالجواب:", "qhash": "ad25b2ab61e903eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 13", "tests": ["assert multi_fact(12) == 7", "assert multi_fact(39) == 0", "assert multi_fact(52) == 0", "assert multi_fact(8) == 6", "assert multi_fact(24) == 5", "assert multi_fact(38) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(12) == 7\nassert multi_fact(39) == 0\nassert multi_fact(52) == 0\nassert multi_fact(8) == 6\nassert multi_fact(24) == 5\nassert multi_fact(38) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 13", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(12)` يُرجع `7`.\nالجواب:", "qhash": "981a46356810619b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(calc(-6))\nprint(calc(-6, -6))\nprint(calc(calc(-6), -6))", "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(-6))\nprint(calc(-6, -6))\nprint(calc(calc(-6), -6))\n```\nالجواب:", "qhash": "6560fb84839e0f34", "answer": "30\n-30\n126", "completion": " الناتج:\n```text\n30\n-30\n126\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'camel'\nprint(text[::-1])\nprint(text[3:4])\nprint(text[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'camel'\nprint(text[::-1])\nprint(text[3:4])\nprint(text[-1:])\n```\nالجواب:", "qhash": "0ce386d0ac12c470", "answer": "lemac\ne\nl", "completion": " الناتج:\n```text\nlemac\ne\nl\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 31", "tests": ["assert step_product(3) == 3", "assert step_product(2) == 2", "assert step_product(30) == 19", "assert step_product(22) == 20", "assert step_product(5) == 10", "assert step_product(5) == 10", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(2) == 2\nassert step_product(30) == 19\nassert step_product(22) == 20\nassert step_product(5) == 10\nassert step_product(5) == 10\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 31", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 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": "3d084c0e42142c77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return 1 * x ** 2 + (8) * x + (5)", "tests": ["assert p(2) == 25", "assert p(-16) == 133", "assert p(11) == 214", "assert p(-9) == 14", "assert p(-1) == -2", "assert p(9) == 158", "assert p(13) == 278", "assert p(0) == 5"], "test_code": "assert p(2) == 25\nassert p(-16) == 133\nassert p(11) == 214\nassert p(-9) == 14\nassert p(-1) == -2\nassert p(9) == 158\nassert p(13) == 278\nassert p(0) == 5", "answer": "def p(x):\n return 1 * x ** 2 + (8) * x + (5)", "completion": " ```python\ndef p(x):\n return 1 * x ** 2 + (8) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود 1x² + 8x + 5 عند العدد الصحيح x.\nمثال: `p(2)` يجب أن تُرجع `25`.\nالجواب:", "qhash": "c6df9630de87a92b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('لغة نهار علم مدينة لغة فجر رمل ليل') == 0", "assert letter_count('فجر صديق ماء قلم برتقال') == 1", "assert letter_count('معلم') == 0", "assert letter_count('حصان جبل حاسوب قلم ماء') == 1", "assert letter_count('') == 0"], "test_code": "assert letter_count('سماء وردة رمل مدرسة ميناء سوق صحراء') == 1\nassert letter_count('وردة علم باب سماء وردة') == 0\nassert letter_count('قمر صحراء') == 1\nassert letter_count('لغة نهار علم مدينة لغة فجر رمل ليل') == 0\nassert letter_count('فجر صديق ماء قلم برتقال') == 1\nassert letter_count('معلم') == 0\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": "e1079b0be506d4f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'لغة'\nprint(s.count('ر'))\nprint(s.find('ر'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'لغة'\nprint(s.count('ر'))\nprint(s.find('ر'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "b55bd9a15aa0f4cf", "answer": "0\n-1\nةغل", "completion": " الناتج:\n```text\n0\n-1\nةغل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('نور', 44), ('علي', 100), ('زينب', 57), ('خالد', 32)]\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 = [('نور', 44), ('علي', 100), ('زينب', 57), ('خالد', 32)]\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": "1f31461d2e4c9d34", "answer": "[('خالد', 32), ('نور', 44), ('زينب', 57), ('علي', 100)]\n['علي', 'زينب']", "completion": " الناتج:\n```text\n[('خالد', 32), ('نور', 44), ('زينب', 57), ('علي', 100)]\n['علي', 'زينب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'cds'}", "tests": ["assert char_freq('it on banana') == {'c': 0, 'd': 0, 's': 0}", "assert char_freq('winter code an') == {'c': 1, 'd': 1, 's': 0}", "assert char_freq('music to on engine') == {'c': 1, 'd': 0, 's': 1}", "assert char_freq('pixel') == {'c': 0, 'd': 0, 's': 0}", "assert char_freq('light music it go a') == {'c': 1, 'd': 0, 's': 1}", "assert char_freq('we go') == {'c': 0, 'd': 0, 's': 0}", "assert char_freq('') == {'c': 0, 'd': 0, 's': 0}"], "test_code": "assert char_freq('it on banana') == {'c': 0, 'd': 0, 's': 0}\nassert char_freq('winter code an') == {'c': 1, 'd': 1, 's': 0}\nassert char_freq('music to on engine') == {'c': 1, 'd': 0, 's': 1}\nassert char_freq('pixel') == {'c': 0, 'd': 0, 's': 0}\nassert char_freq('light music it go a') == {'c': 1, 'd': 0, 's': 1}\nassert char_freq('we go') == {'c': 0, 'd': 0, 's': 0}\nassert char_freq('') == {'c': 0, 'd': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'cds'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'cds'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'd'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('it on banana')` يُرجع `{'c': 0, 'd': 0, 's': 0}`.\nالجواب:", "qhash": "ec4871664830574f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 14\nfor i in range(-5, 16, 2):\n acc += i * 9\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 14\nfor i in range(-5, 16, 2):\n acc += i * 9\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "8ea1c4372cddb4e7", "answer": "509\n15", "completion": " الناتج:\n```text\n509\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'bc'}", "tests": ["assert tally('planet brain') == {'b': 1, 'c': 0}", "assert tally('banana desert stone pixel vector') == {'b': 1, 'c': 1}", "assert tally('vector') == {'b': 0, 'c': 1}", "assert tally('garden garden by python an') == {'b': 1, 'c': 0}", "assert tally('an planet to camel') == {'b': 0, 'c': 1}", "assert tally('go river') == {'b': 0, 'c': 0}", "assert tally('') == {'b': 0, 'c': 0}"], "test_code": "assert tally('planet brain') == {'b': 1, 'c': 0}\nassert tally('banana desert stone pixel vector') == {'b': 1, 'c': 1}\nassert tally('vector') == {'b': 0, 'c': 1}\nassert tally('garden garden by python an') == {'b': 1, 'c': 0}\nassert tally('an planet to camel') == {'b': 0, 'c': 1}\nassert tally('go river') == {'b': 0, 'c': 0}\nassert tally('') == {'b': 0, 'c': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'bc'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'bc'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'c' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('planet brain')` يُرجع `{'b': 1, 'c': 0}`.\nالجواب:", "qhash": "ae9a58ae80ad252d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [13, 33, 36, 6, 24, -4]\nprint(data[2:6])\nprint(data[::2])\nprint(min(data[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [13, 33, 36, 6, 24, -4]\nprint(data[2:6])\nprint(data[::2])\nprint(min(data[2:6]))\n```\nالجواب:", "qhash": "7230f8565f848919", "answer": "[36, 6, 24, -4]\n[13, 36, 24]\n-4", "completion": " الناتج:\n```text\n[36, 6, 24, -4]\n[13, 36, 24]\n-4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'صديق'\nprint(w[::-1])\nprint(w.find('ا'))\nprint(len(w.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'صديق'\nprint(w[::-1])\nprint(w.find('ا'))\nprint(len(w.replace(' ', '')))\n```\nالجواب:", "qhash": "96e288e6ba0053d0", "answer": "قيدص\n-1\n4", "completion": " الناتج:\n```text\nقيدص\n-1\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [14, 26, 7, 26, -6, 0]\nprint(data[0:1])\nprint(data[::3])\nprint(len(data[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [14, 26, 7, 26, -6, 0]\nprint(data[0:1])\nprint(data[::3])\nprint(len(data[0:1]))\n```\nالجواب:", "qhash": "d8ac7875ab903afb", "answer": "[14]\n[14, 26]\n1", "completion": " الناتج:\n```text\n[14]\n[14, 26]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [29, 35, 14, 10, 4, 29, 39]\nprint(nums[0:3])\nprint(nums[::2])\nprint(min(nums[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [29, 35, 14, 10, 4, 29, 39]\nprint(nums[0:3])\nprint(nums[::2])\nprint(min(nums[0:3]))\n```\nالجواب:", "qhash": "6c1589ead8eee575", "answer": "[29, 35, 14]\n[29, 14, 4, 39]\n14", "completion": " الناتج:\n```text\n[29, 35, 14]\n[29, 14, 4, 39]\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(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 fizz(22) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22']", "assert fizz(19) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19']", "assert fizz(1) == ['1']", "assert fizz(3) == ['1', '2', '3']", "assert fizz(2) == ['1', '2']"], "test_code": "assert fizz(22) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22']\nassert fizz(19) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19']\nassert fizz(1) == ['1']\nassert fizz(3) == ['1', '2', '3']\nassert fizz(2) == ['1', '2']", "answer": "def fizz(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 fizz(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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 10 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(22)` يجب أن تُرجع `['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22']`.\nالجواب:", "qhash": "2937845a8ad67abd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89", "tests": ["assert multi_fact(4) == 24", "assert multi_fact(28) == 83", "assert multi_fact(2) == 2", "assert multi_fact(27) == 57", "assert multi_fact(7) == 56", "assert multi_fact(57) == 84", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(4) == 24\nassert multi_fact(28) == 83\nassert multi_fact(2) == 2\nassert multi_fact(27) == 57\nassert multi_fact(7) == 56\nassert multi_fact(57) == 84\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(4)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "e79b310bd7df918b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([23, 42, 45, 39, 29, 49, 10, 2]) == [10, 2, 23, 42, 45, 39, 29, 49]", "assert shift_list([-1, 30, 32, -2, 33]) == [-1, 30, 32, -2, 33]", "assert shift_list([39, 26, 42, 48, 19, 50, 27]) == [19, 50, 27, 39, 26, 42, 48]", "assert shift_list([3, -4, -7, 0, 24, 45, 12, 33]) == [12, 33, 3, -4, -7, 0, 24, 45]", "assert shift_list([40, 8, 15]) == [15, 40, 8]", "assert shift_list([1, -3, 43, 36, 26, 34, 45, 24, 28, 29]) == [1, -3, 43, 36, 26, 34, 45, 24, 28, 29]", "assert shift_list([]) == []"], "test_code": "assert shift_list([23, 42, 45, 39, 29, 49, 10, 2]) == [10, 2, 23, 42, 45, 39, 29, 49]\nassert shift_list([-1, 30, 32, -2, 33]) == [-1, 30, 32, -2, 33]\nassert shift_list([39, 26, 42, 48, 19, 50, 27]) == [19, 50, 27, 39, 26, 42, 48]\nassert shift_list([3, -4, -7, 0, 24, 45, 12, 33]) == [12, 33, 3, -4, -7, 0, 24, 45]\nassert shift_list([40, 8, 15]) == [15, 40, 8]\nassert shift_list([1, -3, 43, 36, 26, 34, 45, 24, 28, 29]) == [1, -3, 43, 36, 26, 34, 45, 24, 28, 29]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 10 % 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 = 10 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return ____\n```\nمثال: `shift_list([23, 42, 45, 39, 29, 49, 10, 2])` يجب أن تُرجع `[10, 2, 23, 42, 45, 39, 29, 49]`.\nالجواب:", "qhash": "42e07e995bcc27ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 5 * x ** 2 + (-7) * x + (-2)", "tests": ["assert poly(2) == 4", "assert poly(14) == 880", "assert poly(-18) == 1744", "assert poly(-14) == 1076", "assert poly(-20) == 2138", "assert poly(-20) == 2138", "assert poly(16) == 1166", "assert poly(0) == -2"], "test_code": "assert poly(2) == 4\nassert poly(14) == 880\nassert poly(-18) == 1744\nassert poly(-14) == 1076\nassert poly(-20) == 2138\nassert poly(-20) == 2138\nassert poly(16) == 1166\nassert poly(0) == -2", "answer": "def poly(x):\n return 5 * x ** 2 + (-7) * x + (-2)", "completion": " ```python\ndef poly(x):\n return 5 * x ** 2 + (-7) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 5x² - 7x - 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(2)` يُرجع `4`.\nالجواب:", "qhash": "449eed0bbfa53db3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 93", "tests": ["assert digit_score(85054) == 82", "assert digit_score(988593) == 30", "assert digit_score(246704) == 44", "assert digit_score(566825) == 86", "assert digit_score(328891) == 22", "assert digit_score(194521) == 91", "assert digit_score(672857) == 59", "assert digit_score(0) == 0"], "test_code": "assert digit_score(85054) == 82\nassert digit_score(988593) == 30\nassert digit_score(246704) == 44\nassert digit_score(566825) == 86\nassert digit_score(328891) == 22\nassert digit_score(194521) == 91\nassert digit_score(672857) == 59\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 93", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 93\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 93.\nمثال: `digit_score(85054)` يجب أن تُرجع `82`.\nالجواب:", "qhash": "5230feb6fd2badf7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 2) // 3 for x in range(2, 15) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 2) // 3 for x in range(2, 15) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "8a2623ab5b0f26e0", "answer": "[1, 2, 3, 4]\n4 10", "completion": " الناتج:\n```text\n[1, 2, 3, 4]\n4 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 53", "tests": ["assert mfact(9) == 45", "assert mfact(23) == 48", "assert mfact(59) == 22", "assert mfact(26) == 41", "assert mfact(46) == 33", "assert mfact(21) == 25", "assert mfact(0) == 1"], "test_code": "assert mfact(9) == 45\nassert mfact(23) == 48\nassert mfact(59) == 22\nassert mfact(26) == 41\nassert mfact(46) == 33\nassert mfact(21) == 25\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 53", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(9)` يجب أن تُرجع `45`.\nالجواب:", "qhash": "93b52fe1c30f0834"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 5) // 2 for x in range(5, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 5) // 2 for x in range(5, 10) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "436820bd728c5ad2", "answer": "[5, 6]\n2 11", "completion": " الناتج:\n```text\n[5, 6]\n2 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (6) * x + (-4)", "tests": ["assert poly(8) == -148", "assert poly(-19) == -1201", "assert poly(8) == -148", "assert poly(-1) == -13", "assert poly(-11) == -433", "assert poly(-2) == -28", "assert poly(-18) == -1084", "assert poly(0) == -4"], "test_code": "assert poly(8) == -148\nassert poly(-19) == -1201\nassert poly(8) == -148\nassert poly(-1) == -13\nassert poly(-11) == -433\nassert poly(-2) == -28\nassert poly(-18) == -1084\nassert poly(0) == -4", "answer": "def poly(x):\n return -3 * x ** 2 + (6) * x + (-4)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (6) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -3x² + 6x - 4 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `-148`.\nالجواب:", "qhash": "c82a54d0be4c7312"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "tests": ["assert series(7) == 87024", "assert series(1) == 3", "assert series(1) == 3", "assert series(14) == 4619475", "assert series(9) == 362475", "assert series(1) == 3", "assert series(0) == 0"], "test_code": "assert series(7) == 87024\nassert series(1) == 3\nassert series(1) == 3\nassert series(14) == 4619475\nassert series(9) == 362475\nassert series(1) == 3\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `series(7)` يُرجع `87024`.\nالجواب:", "qhash": "c85a8133d62708b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return -1 * x ** 2 + (6) * x + (3)", "tests": ["assert quad(8) == -13", "assert quad(-2) == -13", "assert quad(8) == -13", "assert quad(-14) == -277", "assert quad(-20) == -517", "assert quad(5) == 8", "assert quad(9) == -24", "assert quad(0) == 3"], "test_code": "assert quad(8) == -13\nassert quad(-2) == -13\nassert quad(8) == -13\nassert quad(-14) == -277\nassert quad(-20) == -517\nassert quad(5) == 8\nassert quad(9) == -24\nassert quad(0) == 3", "answer": "def quad(x):\n return -1 * x ** 2 + (6) * x + (3)", "completion": " ```python\ndef quad(x):\n return -1 * x ** 2 + (6) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود -1x² + 6x + 3 عند العدد الصحيح x.\nمثال: `quad(8)` يجب أن تُرجع `-13`.\nالجواب:", "qhash": "ff2ea00ab9c88cd5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return -5 * x ** 2 + (-8) * x + (2)", "tests": ["assert poly(1) == -11", "assert poly(3) == -67", "assert poly(-4) == -46", "assert poly(-2) == -2", "assert poly(-14) == -866", "assert poly(8) == -382", "assert poly(-7) == -187", "assert poly(0) == 2"], "test_code": "assert poly(1) == -11\nassert poly(3) == -67\nassert poly(-4) == -46\nassert poly(-2) == -2\nassert poly(-14) == -866\nassert poly(8) == -382\nassert poly(-7) == -187\nassert poly(0) == 2", "answer": "def poly(x):\n return -5 * x ** 2 + (-8) * x + (2)", "completion": " ```python\ndef poly(x):\n return -5 * x ** 2 + (-8) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار -5x² - 8x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(1)` يُرجع `-11`.\nالجواب:", "qhash": "84168c94cb77b7d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)", "tests": ["assert total_multiples(229) == 8136", "assert total_multiples(144) == 3150", "assert total_multiples(110) == 1785", "assert total_multiples(242) == 9310", "assert total_multiples(77) == 880", "assert total_multiples(160) == 3901", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(229) == 8136\nassert total_multiples(144) == 3150\nassert total_multiples(110) == 1785\nassert total_multiples(242) == 9310\nassert total_multiples(77) == 880\nassert total_multiples(160) == 3901\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 % 7 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 7.\nمثال: `total_multiples(229)` يجب أن تُرجع `8136`.\nالجواب:", "qhash": "6cb75dcb207a78be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total", "tests": ["assert series(6) == 819", "assert series(1) == 9", "assert series(1) == 9", "assert series(14) == 9135", "assert series(1) == 9", "assert series(1) == 9", "assert series(0) == 0"], "test_code": "assert series(6) == 819\nassert series(1) == 9\nassert series(1) == 9\nassert series(14) == 9135\nassert series(1) == 9\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 ** 2\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `series(6)` يُرجع `819`.\nالجواب:", "qhash": "24cce9765620d2f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [-9, 6, 26, 22, 32, 39, 26, -4]\nprint(lst[2:5])\nprint(lst[::3])\nprint(len(lst[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [-9, 6, 26, 22, 32, 39, 26, -4]\nprint(lst[2:5])\nprint(lst[::3])\nprint(len(lst[2:5]))\n```\nالجواب:", "qhash": "24e7cc25a3a84c1b", "answer": "[26, 22, 32]\n[-9, 22, 26]\n3", "completion": " الناتج:\n```text\n[26, 22, 32]\n[-9, 22, 26]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [7, 33, 9, 9, 7, 26, -1, 7, 22]\nprint(nums[0:5])\nprint(nums[::-1])\nprint(max(nums[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [7, 33, 9, 9, 7, 26, -1, 7, 22]\nprint(nums[0:5])\nprint(nums[::-1])\nprint(max(nums[0:5]))\n```\nالجواب:", "qhash": "62ab2016d00d60e3", "answer": "[7, 33, 9, 9, 7]\n[22, 7, -1, 26, 7, 9, 9, 33, 7]\n33", "completion": " الناتج:\n```text\n[7, 33, 9, 9, 7]\n[22, 7, -1, 26, 7, 9, 9, 33, 7]\n33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.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('مدينة يمل سماء') == 1", "assert starts_count('سماء جمل يمل يمل') == 2", "assert starts_count('صديق لغة معلم حصان رمل') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('يمل بحر سلام قمر سوق يمل') == 2\nassert starts_count('كتاب مكتبة فجر يمل سماء خبز يمل') == 2\nassert starts_count('يمل وردة فجر يمل ليل رمل صديق معلم') == 2\nassert starts_count('مدينة يمل سماء') == 1\nassert starts_count('سماء جمل يمل يمل') == 2\nassert starts_count('صديق لغة معلم حصان رمل') == 0\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ي'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(sentence):\n count = 0\n for w in sentence.split():\n if 'ي' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('يمل بحر سلام قمر سوق يمل')` يُرجع `2`.\nالجواب:", "qhash": "80a67b56cdfd2435"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(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 game(14) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14']", "assert game(11) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11']", "assert game(10) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic']", "assert game(25) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', '24', 'Tic']", "assert game(12) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12']"], "test_code": "assert game(14) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14']\nassert game(11) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11']\nassert game(10) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic']\nassert game(25) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', '24', 'Tic']\nassert game(12) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12']", "answer": "def game(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 game(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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Tic'، وإن قَبِلها على 9 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(14)` يُرجع `['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14']`.\nالجواب:", "qhash": "49feff5bf5a716f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 56", "tests": ["assert pow_digits(65390) == 51", "assert pow_digits(251419) == 12", "assert pow_digits(917690) == 20", "assert pow_digits(357579) == 38", "assert pow_digits(610957) == 20", "assert pow_digits(522629) == 18", "assert pow_digits(75343) == 28", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(65390) == 51\nassert pow_digits(251419) == 12\nassert pow_digits(917690) == 20\nassert pow_digits(357579) == 38\nassert pow_digits(610957) == 20\nassert pow_digits(522629) == 18\nassert pow_digits(75343) == 28\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 56", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 56\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 56.\nمثال: `pow_digits(65390)` يجب أن تُرجع `51`.\nالجواب:", "qhash": "c8565fd24aab4b80"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -4 for x in xs if 3 <= x <= 28)", "tests": ["assert between_times([7, 29, 26, 15, 7, 13, 12, 13]) == [-104, -60, -52, -52, -48, -28, -28]", "assert between_times([41, 59, -15]) == []", "assert between_times([-22, -18, 46, 53, 58, -22]) == []", "assert between_times([24, 55, 11]) == [-96, -44]", "assert between_times([43, 17, 24, 51, 34, -22, 38, 53]) == [-96, -68]", "assert between_times([59, -15]) == []", "assert between_times([-23, -13, 46, 49, 8, 2, -14, 25]) == [-100, -32]", "assert between_times([]) == []"], "test_code": "assert between_times([7, 29, 26, 15, 7, 13, 12, 13]) == [-104, -60, -52, -52, -48, -28, -28]\nassert between_times([41, 59, -15]) == []\nassert between_times([-22, -18, 46, 53, 58, -22]) == []\nassert between_times([24, 55, 11]) == [-96, -44]\nassert between_times([43, 17, 24, 51, 34, -22, 38, 53]) == [-96, -68]\nassert between_times([59, -15]) == []\nassert between_times([-23, -13, 46, 49, 8, 2, -14, 25]) == [-100, -32]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -4 for x in xs if 3 <= x <= 28)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -4 for x in xs if 3 <= x <= 28)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 3 ≤ x ≤ 28، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([7, 29, 26, 15, 7, 13, 12, 13])` يُرجع `[-104, -60, -52, -52, -48, -28, -28]`.\nالجواب:", "qhash": "89af259a39e02511"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 8", "tests": ["assert digits_mod(58413) == 3", "assert digits_mod(154490) == 3", "assert digits_mod(869742) == 2", "assert digits_mod(31641) == 3", "assert digits_mod(856581) == 3", "assert digits_mod(449792) == 3", "assert digits_mod(733931) == 6", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(58413) == 3\nassert digits_mod(154490) == 3\nassert digits_mod(869742) == 2\nassert digits_mod(31641) == 3\nassert digits_mod(856581) == 3\nassert digits_mod(449792) == 3\nassert digits_mod(733931) == 6\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 8", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 8\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 8.\nمثال: `digits_mod(58413)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "114903e6f0eb05aa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 2) == 1)", "tests": ["assert rel_prime_count(105) == 53", "assert rel_prime_count(195) == 98", "assert rel_prime_count(131) == 66", "assert rel_prime_count(49) == 25", "assert rel_prime_count(83) == 42", "assert rel_prime_count(74) == 37", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(105) == 53\nassert rel_prime_count(195) == 98\nassert rel_prime_count(131) == 66\nassert rel_prime_count(49) == 25\nassert rel_prime_count(83) == 42\nassert rel_prime_count(74) == 37\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, 2) == 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, 2) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 2) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(105)` يُرجع `53`.\nالجواب:", "qhash": "7d83d93fc6554305"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 44)", "tests": ["assert filter_range([12, 36, 20, 8]) == [80, 144]", "assert filter_range([40, 42, -23, 22, 30, 40, 31]) == [88, 120, 124, 160, 160, 168]", "assert filter_range([22, 17, 24]) == [88, 96]", "assert filter_range([13, 35, 23, 47, 4, -21, 11]) == [92, 140]", "assert filter_range([-21, 34, 56, 42]) == [136, 168]", "assert filter_range([11, -6, 5, 26, -24]) == [104]", "assert filter_range([55, -25, 55, 58, 26, 15, 1, 47]) == [104]", "assert filter_range([]) == []"], "test_code": "assert filter_range([12, 36, 20, 8]) == [80, 144]\nassert filter_range([40, 42, -23, 22, 30, 40, 31]) == [88, 120, 124, 160, 160, 168]\nassert filter_range([22, 17, 24]) == [88, 96]\nassert filter_range([13, 35, 23, 47, 4, -21, 11]) == [92, 140]\nassert filter_range([-21, 34, 56, 42]) == [136, 168]\nassert filter_range([11, -6, 5, 26, -24]) == [104]\nassert filter_range([55, -25, 55, 58, 26, 15, 1, 47]) == [104]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 44)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 4 for x in xs if 18 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 18 و44 (شاملًا الطرفين) في 4.\nمثال: `filter_range([12, 36, 20, 8])` يجب أن تُرجع `[80, 144]`.\nالجواب:", "qhash": "5dd93683a7b46c49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(22) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue']", "assert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13']", "assert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue', '23']", "assert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9']", "assert label_numbers(25) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue', '23', '24', '25']"], "test_code": "assert label_numbers(22) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue']\nassert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13']\nassert label_numbers(23) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue', '23']\nassert label_numbers(9) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9']\nassert label_numbers(25) == ['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue', '23', '24', '25']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(22)` يُرجع `['1', '2', '3', '4', '5', '6', 'Red', '8', '9', '10', 'Blue', '12', '13', 'Red', '15', '16', '17', '18', '19', '20', 'Red', 'Blue']`.\nالجواب:", "qhash": "897433c74153cf7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 37", "tests": ["assert fact_mod(6) == 12", "assert fact_mod(28) == 18", "assert fact_mod(30) == 23", "assert fact_mod(22) == 20", "assert fact_mod(14) == 15", "assert fact_mod(55) == 19", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 12\nassert fact_mod(28) == 18\nassert fact_mod(30) == 23\nassert fact_mod(22) == 20\nassert fact_mod(14) == 15\nassert fact_mod(55) == 19\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 37", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(6)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "dbbe60e85902f6e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert only_div([37, 60, 59, 64, 29, 3, 63, 88]) == 1", "assert only_div([60, -22, 38, 73, 75, 3, 26, -31, 89, 42, 61, 69]) == 5", "assert only_div([-26, -30, 87, -29, 70, -20, -7, -33, 36, -31, -23, -20]) == 6", "assert only_div([75, 87, 78, -13, 61, 8, 41, 60, 86, -31]) == 3", "assert only_div([74, 18, 26, 85, -7, 39, 76, 80, 86, 5, 43, -6]) == 6", "assert only_div([46, 47, 6, -4, -38, 69, -26]) == 5", "assert only_div([]) == 0"], "test_code": "assert only_div([37, 60, 59, 64, 29, 3, 63, 88]) == 1\nassert only_div([60, -22, 38, 73, 75, 3, 26, -31, 89, 42, 61, 69]) == 5\nassert only_div([-26, -30, 87, -29, 70, -20, -7, -33, 36, -31, -23, -20]) == 6\nassert only_div([75, 87, 78, -13, 61, 8, 41, 60, 86, -31]) == 3\nassert only_div([74, 18, 26, 85, -7, 39, 76, 80, 86, 5, 43, -6]) == 6\nassert only_div([46, 47, 6, -4, -38, 69, -26]) == 5\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([37, 60, 59, 64, 29, 3, 63, 88])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "8d6b577c1540a392"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'garden'\nprint(word.find('a'))\nprint(len(word))\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'garden'\nprint(word.find('a'))\nprint(len(word))\nprint(word.split('_'))\n```\nالجواب:", "qhash": "09e888551adaf25f", "answer": "1\n6\n['garden']", "completion": " الناتج:\n```text\n1\n6\n['garden']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 7", "tests": ["assert rec_prod(8) == 4", "assert rec_prod(25) == 0", "assert rec_prod(8) == 4", "assert rec_prod(1) == 1", "assert rec_prod(42) == 0", "assert rec_prod(42) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(8) == 4\nassert rec_prod(25) == 0\nassert rec_prod(8) == 4\nassert rec_prod(1) == 1\nassert rec_prod(42) == 0\nassert rec_prod(42) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 7", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(8)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "5f67d1bb37114171"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('banana') == 'cbobob'", "assert rot('is an of apple garden Hello') == 'jt bo pg bqqmf hbsefo Hfmmp'", "assert rot('orange signal we') == 'psbohf tjhobm xf'", "assert rot('orange music code at A1') == 'psbohf nvtjd dpef bu A1'", "assert rot('in 2024') == 'jo 2024'", "assert rot('coffee A1') == 'dpggff A1'", "assert rot('') == ''"], "test_code": "assert rot('banana') == 'cbobob'\nassert rot('is an of apple garden Hello') == 'jt bo pg bqqmf hbsefo Hfmmp'\nassert rot('orange signal we') == 'psbohf tjhobm xf'\nassert rot('orange music code at A1') == 'psbohf nvtjd dpef bu A1'\nassert rot('in 2024') == 'jo 2024'\nassert rot('coffee A1') == 'dpggff 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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('banana')` يجب أن تُرجع `'cbobob'`.\nالجواب:", "qhash": "4cb1c344ff52d967"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 12\nfor j in range(4, 14, 2):\n total -= j * 7\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 12\nfor j in range(4, 14, 2):\n total -= j * 7\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "a080a5b73b0b7f46", "answer": "-268\n12", "completion": " الناتج:\n```text\n-268\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ل'):\n count += 1\n return count", "tests": ["assert begin_count('طائرة لغة جمل لغة سلام') == 2", "assert begin_count('جمل حصان لغة حديقة كتاب ليل رمل') == 2", "assert begin_count('نهر ليل علم نور ماء') == 1", "assert begin_count('قمر باب ليل علم') == 1", "assert begin_count('قهوة رمل برمجة لغة سفينة نهار') == 1", "assert begin_count('ليل رمل حاسوب جمل') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('طائرة لغة جمل لغة سلام') == 2\nassert begin_count('جمل حصان لغة حديقة كتاب ليل رمل') == 2\nassert begin_count('نهر ليل علم نور ماء') == 1\nassert begin_count('قمر باب ليل علم') == 1\nassert begin_count('قهوة رمل برمجة لغة سفينة نهار') == 1\nassert begin_count('ليل رمل حاسوب جمل') == 1\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ل'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(line):\n count = 0\n for w in line:\n if w.startswith('ل'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('طائرة لغة جمل لغة سلام')` يُرجع `2`.\nالجواب:", "qhash": "1bb8bd363f8bdb2d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'قلم'\nprint(len(w.replace(' ', '')))\nprint(w[0])\nprint(w.count('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'قلم'\nprint(len(w.replace(' ', '')))\nprint(w[0])\nprint(w.count('س'))\n```\nالجواب:", "qhash": "feec8f93730ddf94", "answer": "3\nق\n0", "completion": " الناتج:\n```text\n3\nق\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "tests": ["assert total_pow(3) == 276", "assert total_pow(15) == 2299200", "assert total_pow(0) == 0", "assert total_pow(12) == 630708", "assert total_pow(1) == 1", "assert total_pow(1) == 1", "assert total_pow(0) == 0"], "test_code": "assert total_pow(3) == 276\nassert total_pow(15) == 2299200\nassert total_pow(0) == 0\nassert total_pow(12) == 630708\nassert total_pow(1) == 1\nassert total_pow(1) == 1\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `total_pow(3)` يُرجع `276`.\nالجواب:", "qhash": "26f4f3f6afd76001"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 54086\nc = 0\nwhile m > 10:\n m = m // 4\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 54086\nc = 0\nwhile m > 10:\n m = m // 4\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "a3bb5d760ddddd81", "answer": "3 7", "completion": " الناتج:\n```text\n3 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'مدرسة معلم'\nprint(w.split())\nprint(w.replace(' ', '-'))\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'مدرسة معلم'\nprint(w.split())\nprint(w.replace(' ', '-'))\nprint(w[0])\n```\nالجواب:", "qhash": "5e195a85413798f4", "answer": "['مدرسة', 'معلم']\nمدرسة-معلم\nم", "completion": " الناتج:\n```text\n['مدرسة', 'معلم']\nمدرسة-معلم\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [27, 35, 28, 2, 20, 16, 4]\nprint(items[3:7])\nprint(items[::-1])\nprint(sum(items[3:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [27, 35, 28, 2, 20, 16, 4]\nprint(items[3:7])\nprint(items[::-1])\nprint(sum(items[3:7]))\n```\nالجواب:", "qhash": "14fd226cf28fb55e", "answer": "[2, 20, 16, 4]\n[4, 16, 20, 2, 28, 35, 27]\n42", "completion": " الناتج:\n```text\n[2, 20, 16, 4]\n[4, 16, 20, 2, 28, 35, 27]\n42\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 382\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 = 382\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": "1652e1a3a4f2e7b8", "answer": "45", "completion": " الناتج:\n```text\n45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']", "assert label_numbers(6) == ['1', '2', '3', '4', '5', '6']", "assert label_numbers(0) == []", "assert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13']", "assert label_numbers(8) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8']"], "test_code": "assert label_numbers(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']\nassert label_numbers(6) == ['1', '2', '3', '4', '5', '6']\nassert label_numbers(0) == []\nassert label_numbers(13) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13']\nassert label_numbers(8) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Fizz'، وإن قَبِلها على 10 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(15)` يُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15']`.\nالجواب:", "qhash": "391cdacdceefb031"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('عمل خبز مدرسة شمس برتقال سماء علم علم') == 1", "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('عمل خبز مدرسة شمس برتقال سماء علم علم') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ش»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('سفينة ماء فجر حصان برتقال برتقال')` يُرجع `0`.\nالجواب:", "qhash": "efeff182292eeda7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(items):\n if not items:\n return []\n k = 12 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert cycle([43, 0, 35]) == [43, 0, 35]", "assert cycle([30, 12, 0, 9, 1, 34, 10, 26, -8, 40]) == [-8, 40, 30, 12, 0, 9, 1, 34, 10, 26]", "assert cycle([-1, 35, 34, 34, 5, -3]) == [-1, 35, 34, 34, 5, -3]", "assert cycle([39]) == [39]", "assert cycle([-6, 31, 3, 34, 39, 45]) == [-6, 31, 3, 34, 39, 45]", "assert cycle([10, 41, 27, 11, 28, 22, -1, 12, 32, -9, -2]) == [-2, 10, 41, 27, 11, 28, 22, -1, 12, 32, -9]", "assert cycle([]) == []"], "test_code": "assert cycle([43, 0, 35]) == [43, 0, 35]\nassert cycle([30, 12, 0, 9, 1, 34, 10, 26, -8, 40]) == [-8, 40, 30, 12, 0, 9, 1, 34, 10, 26]\nassert cycle([-1, 35, 34, 34, 5, -3]) == [-1, 35, 34, 34, 5, -3]\nassert cycle([39]) == [39]\nassert cycle([-6, 31, 3, 34, 39, 45]) == [-6, 31, 3, 34, 39, 45]\nassert cycle([10, 41, 27, 11, 28, 22, -1, 12, 32, -9, -2]) == [-2, 10, 41, 27, 11, 28, 22, -1, 12, 32, -9]\nassert cycle([]) == []", "answer": "def cycle(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 cycle(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 cycle(items):\n if not items:\n return []\n k = 12 % len(items)\n return ____\n```\nمثال: `cycle([43, 0, 35])` يجب أن تُرجع `[43, 0, 35]`.\nالجواب:", "qhash": "8e1d6a48752e4d67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 8 * x ** 2 + (-7) * x + (2)", "tests": ["assert value_at(1) == 3", "assert value_at(17) == 2195", "assert value_at(-8) == 570", "assert value_at(-2) == 48", "assert value_at(1) == 3", "assert value_at(10) == 732", "assert value_at(5) == 167", "assert value_at(0) == 2"], "test_code": "assert value_at(1) == 3\nassert value_at(17) == 2195\nassert value_at(-8) == 570\nassert value_at(-2) == 48\nassert value_at(1) == 3\nassert value_at(10) == 732\nassert value_at(5) == 167\nassert value_at(0) == 2", "answer": "def value_at(x):\n return 8 * x ** 2 + (-7) * x + (2)", "completion": " ```python\ndef value_at(x):\n return 8 * x ** 2 + (-7) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 8x² - 7x + 2 عند العدد الصحيح x.\nمثال: `value_at(1)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "a1ff8482efad1afc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + -6 for x in range(-1, 13) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + -6 for x in range(-1, 13) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "f3c5e32ddc6facc5", "answer": "[-6, -6]\n2 -12", "completion": " الناتج:\n```text\n[-6, -6]\n2 -12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'وليد': 41, 'نور': 48, 'حسن': 42, 'عمر': 1, 'زينب': 16}\nmarks['عمر'] += 7\nmarks['هدى'] = 24\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 33])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'وليد': 41, 'نور': 48, 'حسن': 42, 'عمر': 1, 'زينب': 16}\nmarks['عمر'] += 7\nmarks['هدى'] = 24\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 33])\n```\nالجواب:", "qhash": "7c7dd9778a360133", "answer": "6\nنور\n179\n['وليد', 'نور', 'حسن']", "completion": " الناتج:\n```text\n6\nنور\n179\n['وليد', 'نور', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 177:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([44, 81, 49, 79, 22]) == [44, 125, 174, 0, 22]", "assert running_sum([61, 39, 83, 104, 79, 81]) == [61, 100, 0, 104, 0, 81]", "assert running_sum([81, 34, 32, 50, 51, 84, 25, 134]) == [81, 115, 147, 0, 51, 135, 160, 0]", "assert running_sum([83]) == [83]", "assert running_sum([]) == []", "assert running_sum([129, 89]) == [129, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([44, 81, 49, 79, 22]) == [44, 125, 174, 0, 22]\nassert running_sum([61, 39, 83, 104, 79, 81]) == [61, 100, 0, 104, 0, 81]\nassert running_sum([81, 34, 32, 50, 51, 84, 25, 134]) == [81, 115, 147, 0, 51, 135, 160, 0]\nassert running_sum([83]) == [83]\nassert running_sum([]) == []\nassert running_sum([129, 89]) == [129, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 177:\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 > 177:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 177 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([44, 81, 49, 79, 22])` يُرجع `[44, 125, 174, 0, 22]`.\nالجواب:", "qhash": "ee2f4c44af2d51e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -3 * x ** 2 + (-3) * x + (8)", "tests": ["assert poly(9) == -262", "assert poly(8) == -208", "assert poly(13) == -538", "assert poly(2) == -10", "assert poly(15) == -712", "assert poly(-2) == 2", "assert poly(5) == -82", "assert poly(0) == 8"], "test_code": "assert poly(9) == -262\nassert poly(8) == -208\nassert poly(13) == -538\nassert poly(2) == -10\nassert poly(15) == -712\nassert poly(-2) == 2\nassert poly(5) == -82\nassert poly(0) == 8", "answer": "def poly(x):\n return -3 * x ** 2 + (-3) * x + (8)", "completion": " ```python\ndef poly(x):\n return -3 * x ** 2 + (-3) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -3x² - 3x + 8 عند العدد الصحيح x.\nمثال: `poly(9)` يجب أن تُرجع `-262`.\nالجواب:", "qhash": "5f70be87f67eac85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate([49, 18, 9, 31, 9, 31]) == [9, 31, 49, 18, 9, 31]", "assert rotate([38, 4]) == [38, 4]", "assert rotate([-1, -2, -9, 26, 46, 16, 16, 42, 8, 48]) == [46, 16, 16, 42, 8, 48, -1, -2, -9, 26]", "assert rotate([40, 30]) == [40, 30]", "assert rotate([2, 23, 5, 25, 19, 13, -3]) == [19, 13, -3, 2, 23, 5, 25]", "assert rotate([10, 12, 42, 21, 5, 6, 8]) == [5, 6, 8, 10, 12, 42, 21]", "assert rotate([]) == []"], "test_code": "assert rotate([49, 18, 9, 31, 9, 31]) == [9, 31, 49, 18, 9, 31]\nassert rotate([38, 4]) == [38, 4]\nassert rotate([-1, -2, -9, 26, 46, 16, 16, 42, 8, 48]) == [46, 16, 16, 42, 8, 48, -1, -2, -9, 26]\nassert rotate([40, 30]) == [40, 30]\nassert rotate([2, 23, 5, 25, 19, 13, -3]) == [19, 13, -3, 2, 23, 5, 25]\nassert rotate([10, 12, 42, 21, 5, 6, 8]) == [5, 6, 8, 10, 12, 42, 21]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 4 % len(lst)\n return ____\n```\nمثال: `rotate([49, 18, 9, 31, 9, 31])` يجب أن تُرجع `[9, 31, 49, 18, 9, 31]`.\nالجواب:", "qhash": "b58f82ba3b7a862c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'نهار بحر'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ر'))\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'نهار بحر'\nprint(len(kalima.replace(' ', '')))\nprint(kalima.count('ر'))\nprint(kalima[-1])\n```\nالجواب:", "qhash": "3c5c83d8a9cf90c6", "answer": "7\n2\nر", "completion": " الناتج:\n```text\n7\n2\nر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'علم'\nprint(kalima.find('ب'))\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'علم'\nprint(kalima.find('ب'))\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ب'))\n```\nالجواب:", "qhash": "c3e4ba9fada63b99", "answer": "-1\nعلم\n0", "completion": " الناتج:\n```text\n-1\nعلم\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 17\nfor j in range(6, 13, 1):\n s += j * 6\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 17\nfor j in range(6, 13, 1):\n s += j * 6\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "237b7840acc187ab", "answer": "395\n12", "completion": " الناتج:\n```text\n395\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('summer rocket on we orange Hello') == 'hjbbtg gdrzti dc lt dgpcvt Htaad'", "assert cipher('falcon planet winter data Hello') == 'upardc eapcti lxcitg spip Htaad'", "assert cipher('brain garden light coffee OK') == 'qgpxc vpgstc axvwi rduutt OK'", "assert cipher('matrix table table winter A1') == 'bpigxm ipqat ipqat lxcitg A1'", "assert cipher('orange is !') == 'dgpcvt xh !'", "assert cipher('we stone river of coffee') == 'lt hidct gxktg du rduutt'", "assert cipher('') == ''"], "test_code": "assert cipher('summer rocket on we orange Hello') == 'hjbbtg gdrzti dc lt dgpcvt Htaad'\nassert cipher('falcon planet winter data Hello') == 'upardc eapcti lxcitg spip Htaad'\nassert cipher('brain garden light coffee OK') == 'qgpxc vpgstc axvwi rduutt OK'\nassert cipher('matrix table table winter A1') == 'bpigxm ipqat ipqat lxcitg A1'\nassert cipher('orange is !') == 'dgpcvt xh !'\nassert cipher('we stone river of coffee') == 'lt hidct gxktg du rduutt'\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 + (15)) % 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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('summer rocket on we orange Hello')` يُرجع `'hjbbtg gdrzti dc lt dgpcvt Htaad'`.\nالجواب:", "qhash": "ea0484778debc278"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 8\nfor i in range(-5, 6, 4):\n total += i * 9\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 8\nfor i in range(-5, 6, 4):\n total += i * 9\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "3ae2674661f3af3d", "answer": "-19\n3", "completion": " الناتج:\n```text\n-19\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total", "tests": ["assert scaled_powers(8) == 61404", "assert scaled_powers(2) == 119", "assert scaled_powers(7) == 32732", "assert scaled_powers(7) == 32732", "assert scaled_powers(11) == 279818", "assert scaled_powers(1) == 7", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(8) == 61404\nassert scaled_powers(2) == 119\nassert scaled_powers(7) == 32732\nassert scaled_powers(7) == 32732\nassert scaled_powers(11) == 279818\nassert scaled_powers(1) == 7\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 7 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 7 * i ** 4\n return total\n```\nمثال: `scaled_powers(8)` يجب أن تُرجع `61404`.\nالجواب:", "qhash": "981290f4528051d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 17) == 1)", "tests": ["assert phi_upto(39) == 37", "assert phi_upto(75) == 71", "assert phi_upto(58) == 55", "assert phi_upto(150) == 142", "assert phi_upto(3) == 3", "assert phi_upto(43) == 41", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(39) == 37\nassert phi_upto(75) == 71\nassert phi_upto(58) == 55\nassert phi_upto(150) == 142\nassert phi_upto(3) == 3\nassert phi_upto(43) == 41\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, 17) == 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, 17) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 17) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(39)` يُرجع `37`.\nالجواب:", "qhash": "ea8b7c8ba5de268a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(2))\nprint(h(2, 15))\nprint(h(h(15), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=2):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(2))\nprint(h(2, 15))\nprint(h(h(15), 2))\n```\nالجواب:", "qhash": "c5857646eea5d5f5", "answer": "18\n122\n942", "completion": " الناتج:\n```text\n18\n122\n942\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19", "tests": ["assert rec_prod(5) == 15", "assert rec_prod(14) == 13", "assert rec_prod(5) == 15", "assert rec_prod(4) == 8", "assert rec_prod(30) == 2", "assert rec_prod(47) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(5) == 15\nassert rec_prod(14) == 13\nassert rec_prod(5) == 15\nassert rec_prod(4) == 8\nassert rec_prod(30) == 2\nassert rec_prod(47) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(5)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "d5e0539cf4cba63f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'هدى': 46, 'باسل': 46, 'علي': 14, 'سعيد': 33, 'زينب': 20}\nscores['باسل'] += 4\nscores['وليد'] = 8\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 = {'هدى': 46, 'باسل': 46, 'علي': 14, 'سعيد': 33, 'زينب': 20}\nscores['باسل'] += 4\nscores['وليد'] = 8\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": "51bf2545173b9a08", "answer": "6\nباسل\n171\n[('وليد', 8), ('علي', 14)]", "completion": " الناتج:\n```text\n6\nباسل\n171\n[('وليد', 8), ('علي', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n <= 2:\n return 1\n return 2 * go(n - 1) + -3\n\nprint(go(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n <= 2:\n return 1\n return 2 * go(n - 1) + -3\n\nprint(go(4))\n```\nالجواب:", "qhash": "bd7cda1ef81c4b85", "answer": "-5", "completion": " الناتج:\n```text\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 14\nfor x in range(5, 24, 4):\n total -= x * 2\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 14\nfor x in range(5, 24, 4):\n total -= x * 2\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "50f325828fde0395", "answer": "-116\n21", "completion": " الناتج:\n```text\n-116\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\n return total", "tests": ["assert sum_terms(3) == 196", "assert sum_terms(6) == 4550", "assert sum_terms(6) == 4550", "assert sum_terms(2) == 34", "assert sum_terms(7) == 9352", "assert sum_terms(1) == 2", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 196\nassert sum_terms(6) == 4550\nassert sum_terms(6) == 4550\nassert sum_terms(2) == 34\nassert sum_terms(7) == 9352\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 ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\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 ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^4 لكل عدد صحيح 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 ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(3)` يُرجع `196`.\nالجواب:", "qhash": "57de44f546a6a426"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [17, -4, 1, 5, 10, -2, 36, 35]\nprint(items[1:4])\nprint(items[::2])\nprint(sum(items[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [17, -4, 1, 5, 10, -2, 36, 35]\nprint(items[1:4])\nprint(items[::2])\nprint(sum(items[1:4]))\n```\nالجواب:", "qhash": "17ed27c99f97956b", "answer": "[-4, 1, 5]\n[17, 1, 10, 36]\n2", "completion": " الناتج:\n```text\n[-4, 1, 5]\n[17, 1, 10, 36]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 8 for x in range(0, 7) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 8 for x in range(0, 7) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "c3157e16bfddd4ba", "answer": "[-7, 1, 17]\n3 11", "completion": " الناتج:\n```text\n[-7, 1, 17]\n3 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'garden_table'\nprint(name.replace('t', '*'))\nprint(len(name))\nprint(name[-3:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'garden_table'\nprint(name.replace('t', '*'))\nprint(len(name))\nprint(name[-3:])\n```\nالجواب:", "qhash": "fa2d827278481151", "answer": "garden_*able\n12\nble", "completion": " الناتج:\n```text\ngarden_*able\n12\nble\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 343\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 = 343\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": "e7a5f21d360464b5", "answer": "125", "completion": " الناتج:\n```text\n125\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'مطر'\nprint(s.count('ت'))\nprint(len(s.replace(' ', '')))\nprint(s[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'مطر'\nprint(s.count('ت'))\nprint(len(s.replace(' ', '')))\nprint(s[0])\n```\nالجواب:", "qhash": "c729da10669a19b9", "answer": "0\n3\nم", "completion": " الناتج:\n```text\n0\n3\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "tests": ["assert series(6) == 882", "assert series(1) == 2", "assert series(10) == 6050", "assert series(14) == 22050", "assert series(7) == 1568", "assert series(1) == 2", "assert series(0) == 0"], "test_code": "assert series(6) == 882\nassert series(1) == 2\nassert series(10) == 6050\nassert series(14) == 22050\nassert series(7) == 1568\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 ** 3\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 2 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 3\n return total\n```\nمثال: `series(6)` يجب أن تُرجع `882`.\nالجواب:", "qhash": "3610fb009e126c14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 4 * x ** 2 + (8) * x + (0)", "tests": ["assert quad(4) == 96", "assert quad(-15) == 780", "assert quad(0) == 0", "assert quad(2) == 32", "assert quad(-16) == 896", "assert quad(20) == 1760", "assert quad(1) == 12", "assert quad(0) == 0"], "test_code": "assert quad(4) == 96\nassert quad(-15) == 780\nassert quad(0) == 0\nassert quad(2) == 32\nassert quad(-16) == 896\nassert quad(20) == 1760\nassert quad(1) == 12\nassert quad(0) == 0", "answer": "def quad(x):\n return 4 * x ** 2 + (8) * x + (0)", "completion": " ```python\ndef quad(x):\n return 4 * x ** 2 + (8) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 4x² + 8x + 0 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(4)` يُرجع `96`.\nالجواب:", "qhash": "26d48b82584f3dcf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 3 for x in xs if -11 <= x <= 10)", "tests": ["assert pick_between([-15, 6, -7, -9, -12, -10, 11, 11]) == [-30, -27, -21, 18]", "assert pick_between([-2, -14, 38, -19, -3, 10, -30, -12]) == [-9, -6, 30]", "assert pick_between([39, 37, 10]) == [30]", "assert pick_between([44, 54, -10, 26, 36]) == [-30]", "assert pick_between([4, -25, 52]) == [12]", "assert pick_between([6, -12, 2, 33, -26, 35, 2, 59, 23, -25]) == [6, 6, 18]", "assert pick_between([]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-15, 6, -7, -9, -12, -10, 11, 11]) == [-30, -27, -21, 18]\nassert pick_between([-2, -14, 38, -19, -3, 10, -30, -12]) == [-9, -6, 30]\nassert pick_between([39, 37, 10]) == [30]\nassert pick_between([44, 54, -10, 26, 36]) == [-30]\nassert pick_between([4, -25, 52]) == [12]\nassert pick_between([6, -12, 2, 33, -26, 35, 2, 59, 23, -25]) == [6, 6, 18]\nassert pick_between([]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 3 for x in xs if -11 <= x <= 10)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 3 for x in xs if -11 <= x <= 10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -11 ≤ x ≤ 10، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-15, 6, -7, -9, -12, -10, 11, 11])` يُرجع `[-30, -27, -21, 18]`.\nالجواب:", "qhash": "ee3d0143f03c637e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([5, 4, 32, 43, 36, 31, 16, 19]) == [5, 9, 41, 84, 0, 31, 47, 66]", "assert acc_reset([-3]) == [-3]", "assert acc_reset([70, 30, 74, 70, 12, 49, 57]) == [70, 0, 74, 0, 12, 61, 0]", "assert acc_reset([]) == []", "assert acc_reset([53, 27, 81]) == [53, 80, 0]", "assert acc_reset([-8, 21, 46, -1, 75, 49, 56]) == [-8, 13, 59, 58, 0, 49, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([5, 4, 32, 43, 36, 31, 16, 19]) == [5, 9, 41, 84, 0, 31, 47, 66]\nassert acc_reset([-3]) == [-3]\nassert acc_reset([70, 30, 74, 70, 12, 49, 57]) == [70, 0, 74, 0, 12, 61, 0]\nassert acc_reset([]) == []\nassert acc_reset([53, 27, 81]) == [53, 80, 0]\nassert acc_reset([-8, 21, 46, -1, 75, 49, 56]) == [-8, 13, 59, 58, 0, 49, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\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 > 85:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 85 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([5, 4, 32, 43, 36, 31, 16, 19])` يُرجع `[5, 9, 41, 84, 0, 31, 47, 66]`.\nالجواب:", "qhash": "6ce22d85ef87f05c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 76", "tests": ["assert digit_score(86743) == 22", "assert digit_score(537463) == 34", "assert digit_score(988182) == 66", "assert digit_score(477830) == 9", "assert digit_score(351475) == 5", "assert digit_score(659294) == 19", "assert digit_score(539862) == 13", "assert digit_score(0) == 0"], "test_code": "assert digit_score(86743) == 22\nassert digit_score(537463) == 34\nassert digit_score(988182) == 66\nassert digit_score(477830) == 9\nassert digit_score(351475) == 5\nassert digit_score(659294) == 19\nassert digit_score(539862) == 13\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 76", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 5 for d in str(n)) % 76\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 76.\nللتوضيح: الاستدعاء `digit_score(86743)` يُرجع `22`.\nالجواب:", "qhash": "3f78c5c5d0b2ed5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'signal'\nprint(word.upper())\nprint(word[-3:])\nprint(word[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'signal'\nprint(word.upper())\nprint(word[-3:])\nprint(word[::-1])\n```\nالجواب:", "qhash": "61d7d07ad0b05ee9", "answer": "SIGNAL\nnal\nlangis", "completion": " الناتج:\n```text\nSIGNAL\nnal\nlangis\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 89) == 1)", "tests": ["assert count_gcd1(60) == 60", "assert count_gcd1(148) == 147", "assert count_gcd1(45) == 45", "assert count_gcd1(17) == 17", "assert count_gcd1(131) == 130", "assert count_gcd1(152) == 151", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(60) == 60\nassert count_gcd1(148) == 147\nassert count_gcd1(45) == 45\nassert count_gcd1(17) == 17\nassert count_gcd1(131) == 130\nassert count_gcd1(152) == 151\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, 89) == 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, 89) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 89، أي أن القاسم المشترك الأكبر لها مع 89 يساوي 1.\nمثال: `count_gcd1(60)` يجب أن تُرجع `60`.\nالجواب:", "qhash": "9d54264100048068"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert count_start('فجر مكتبة عمل') == 0", "assert count_start('سلام عربية بيت مطر بحر ميناء') == 2", "assert count_start('وردة ماء بيت برتقال برتقال') == 3", "assert count_start('برمجة عمل عمل ليل دفتر حاسوب') == 1", "assert count_start('تفاحة سفينة باب بحر قمر طالب') == 2", "assert count_start('بيت بيت برتقال جمل طالب علم نور عمل') == 3", "assert count_start('') == 0"], "test_code": "assert count_start('فجر مكتبة عمل') == 0\nassert count_start('سلام عربية بيت مطر بحر ميناء') == 2\nassert count_start('وردة ماء بيت برتقال برتقال') == 3\nassert count_start('برمجة عمل عمل ليل دفتر حاسوب') == 1\nassert count_start('تفاحة سفينة باب بحر قمر طالب') == 2\nassert count_start('بيت بيت برتقال جمل طالب علم نور عمل') == 3\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(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_start(s):\n count = 0\n for w in s:\n if w.startswith('ب'):\n count += 1\n return count\n```\nمثال: `count_start('فجر مكتبة عمل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "234dc3a160a04b06"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'نور': 34, 'زينب': 1, 'هشام': 18, 'خالد': 18, 'راشد': 26}\npoints['خالد'] += 3\npoints['علي'] = 28\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'نور': 34, 'زينب': 1, 'هشام': 18, 'خالد': 18, 'راشد': 26}\npoints['خالد'] += 3\npoints['علي'] = 28\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))\n```\nالجواب:", "qhash": "5d68b899a3c856ec", "answer": "6\nنور\n128\n-1", "completion": " الناتج:\n```text\n6\nنور\n128\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 2) // 4 for x in range(5, 20) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 2) // 4 for x in range(5, 20) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "b5f32eced5bf000c", "answer": "[1, 2, 3, 4]\n4 10", "completion": " الناتج:\n```text\n[1, 2, 3, 4]\n4 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'زينب': 10, 'سعيد': 26, 'نور': 33, 'أحمد': 7}\nd['نور'] += 13\nd['راشد'] = 8\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'زينب': 10, 'سعيد': 26, 'نور': 33, 'أحمد': 7}\nd['نور'] += 13\nd['راشد'] = 8\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))\n```\nالجواب:", "qhash": "c0fe3aa56f776dff", "answer": "5\nنور\n97\n-1", "completion": " الناتج:\n```text\n5\nنور\n97\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n <= 0:\n return 2\n return 3 * go(n - 1) + 2\n\nprint(go(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n <= 0:\n return 2\n return 3 * go(n - 1) + 2\n\nprint(go(7))\n```\nالجواب:", "qhash": "3419180e3fb96c12", "answer": "6560", "completion": " الناتج:\n```text\n6560\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(35) == 96", "assert total_multiples(295) == 7608", "assert total_multiples(74) == 534", "assert total_multiples(141) == 1724", "assert total_multiples(288) == 7026", "assert total_multiples(9) == 0", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(35) == 96\nassert total_multiples(295) == 7608\nassert total_multiples(74) == 534\nassert total_multiples(141) == 1724\nassert total_multiples(288) == 7026\nassert total_multiples(9) == 0\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 % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(35)` يُرجع `96`.\nالجواب:", "qhash": "dbaf8932de9f7fa8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "tests": ["assert sum_terms(6) == 25025", "assert sum_terms(9) == 168663", "assert sum_terms(9) == 168663", "assert sum_terms(0) == 0", "assert sum_terms(8) == 96492", "assert sum_terms(1) == 11", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(6) == 25025\nassert sum_terms(9) == 168663\nassert sum_terms(9) == 168663\nassert sum_terms(0) == 0\nassert sum_terms(8) == 96492\nassert sum_terms(1) == 11\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 4\n return total\n```\nمثال: `sum_terms(6)` يجب أن تُرجع `25025`.\nالجواب:", "qhash": "b3bf37c539c8a4ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=9):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(f(-5))\nprint(f(-5, -4))\nprint(f(f(-4), -5))", "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(-5))\nprint(f(-5, -4))\nprint(f(f(-4), -5))\n```\nالجواب:", "qhash": "14b162ee36e81d35", "answer": "31\n-21\n133", "completion": " الناتج:\n```text\n31\n-21\n133\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 1) // 5 for x in range(-6, 3) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 1) // 5 for x in range(-6, 3) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "1be374451b62abeb", "answer": "[-1]\n1 -1", "completion": " الناتج:\n```text\n[-1]\n1 -1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(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 max_of_div([-28, 42, -2, 32, -2, 52, -10, 3]) == 32", "assert max_of_div([-40, -40, -16]) == -16", "assert max_of_div([1]) == None", "assert max_of_div([11, 32, -37, -30, 19, 19, -30]) == 32", "assert max_of_div([41, -35, 34, -5]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-28, 42, -2, 32, -2, 52, -10, 3]) == 32\nassert max_of_div([-40, -40, -16]) == -16\nassert max_of_div([1]) == None\nassert max_of_div([11, 32, -37, -30, 19, 19, -30]) == 32\nassert max_of_div([41, -35, 34, -5]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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 max_of_div(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 max_of_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(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مثال: `max_of_div([-28, 42, -2, 32, -2, 52, -10, 3])` يجب أن تُرجع `32`.\nالجواب:", "qhash": "9693a234af73df81"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 389\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 = 389\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": "7fdd46185cceb81d", "answer": "120", "completion": " الناتج:\n```text\n120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'river'\nprint(name.find('v'))\nprint(name[0:2])\nprint(name.index('v') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'river'\nprint(name.find('v'))\nprint(name[0:2])\nprint(name.index('v') + len(name))\n```\nالجواب:", "qhash": "cee4bbaeb38e86db", "answer": "2\nri\n7", "completion": " الناتج:\n```text\n2\nri\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [9, -15, -9, 23, -8, 11]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [9, -15, -9, 23, -8, 11]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "d4a6d98fcb251a61", "answer": "[-8, -9, 9, -15, 11, 23]\n[23, 11, 9]", "completion": " الناتج:\n```text\n[-8, -9, 9, -15, 11, 23]\n[23, 11, 9]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ior'}", "tests": ["assert freq_of('we cloud brain engine') == {'i': 2, 'o': 1, 'r': 1}", "assert freq_of('garden to python orange') == {'i': 0, 'o': 3, 'r': 2}", "assert freq_of('garden code table pixel it to') == {'i': 2, 'o': 2, 'r': 1}", "assert freq_of('light') == {'i': 1, 'o': 0, 'r': 0}", "assert freq_of('is code matrix river code banana') == {'i': 3, 'o': 2, 'r': 3}", "assert freq_of('we stone') == {'i': 0, 'o': 1, 'r': 0}", "assert freq_of('') == {'i': 0, 'o': 0, 'r': 0}"], "test_code": "assert freq_of('we cloud brain engine') == {'i': 2, 'o': 1, 'r': 1}\nassert freq_of('garden to python orange') == {'i': 0, 'o': 3, 'r': 2}\nassert freq_of('garden code table pixel it to') == {'i': 2, 'o': 2, 'r': 1}\nassert freq_of('light') == {'i': 1, 'o': 0, 'r': 0}\nassert freq_of('is code matrix river code banana') == {'i': 3, 'o': 2, 'r': 3}\nassert freq_of('we stone') == {'i': 0, 'o': 1, 'r': 0}\nassert freq_of('') == {'i': 0, 'o': 0, 'r': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ior'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ior'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'i'، 'o'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('we cloud brain engine')` يُرجع `{'i': 2, 'o': 1, 'r': 1}`.\nالجواب:", "qhash": "809f3be24fde0a92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('up summer at python is camel engine') == 'engine/camel/is/python/at/summer/up'", "assert flip_words('') == ''", "assert flip_words('planet matrix go') == 'go/matrix/planet'", "assert flip_words('an go by garden by') == 'by/garden/by/go/an'", "assert flip_words('') == ''", "assert flip_words('code it python data garden') == 'garden/data/python/it/code'", "assert flip_words('stone light matrix light light vector camel is') == 'is/camel/vector/light/light/matrix/light/stone'"], "test_code": "assert flip_words('up summer at python is camel engine') == 'engine/camel/is/python/at/summer/up'\nassert flip_words('') == ''\nassert flip_words('planet matrix go') == 'go/matrix/planet'\nassert flip_words('an go by garden by') == 'by/garden/by/go/an'\nassert flip_words('') == ''\nassert flip_words('code it python data garden') == 'garden/data/python/it/code'\nassert flip_words('stone light matrix light light vector camel is') == 'is/camel/vector/light/light/matrix/light/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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `flip_words('up summer at python is camel engine')` يُرجع `'engine/camel/is/python/at/summer/up'`.\nالجواب:", "qhash": "1a24ebcd9f4318c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "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 % 4 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([15, 45, 39, 29, 72, 52, 12, 45, 83]) == 2", "assert how_many_div([-10]) == 0", "assert how_many_div([89, 0, 76, 26]) == 0", "assert how_many_div([-19, 64, 4, 69, 73, -12, 1, 12]) == 0", "assert how_many_div([73, 46, -25, 75, 51, 62, 50, 70]) == 0", "assert how_many_div([47, -17, 20, -31, 1, -34, 79, 28, 32, 36]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([15, 45, 39, 29, 72, 52, 12, 45, 83]) == 2\nassert how_many_div([-10]) == 0\nassert how_many_div([89, 0, 76, 26]) == 0\nassert how_many_div([-19, 64, 4, 69, 73, -12, 1, 12]) == 0\nassert how_many_div([73, 46, -25, 75, 51, 62, 50, 70]) == 0\nassert how_many_div([47, -17, 20, -31, 1, -34, 79, 28, 32, 36]) == 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 % 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 % 9 == 0 and x % 4 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([15, 45, 39, 29, 72, 52, 12, 45, 83])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "6a0cd997c54d2644"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'فيصل': 14, 'عمر': 5, 'هشام': 39, 'رنا': 46}\nmarks['فيصل'] += 15\nmarks['هدى'] = 43\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'فيصل': 14, 'عمر': 5, 'هشام': 39, 'رنا': 46}\nmarks['فيصل'] += 15\nmarks['هدى'] = 43\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('عمر', -1))\n```\nالجواب:", "qhash": "cabf6decf859eb6d", "answer": "5\nرنا\n162\n5", "completion": " الناتج:\n```text\n5\nرنا\n162\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('سعيد', 37), ('زينب', 24), ('نور', 39), ('خالد', 58)]\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 = [('سعيد', 37), ('زينب', 24), ('نور', 39), ('خالد', 58)]\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": "e450b00ee813f3d5", "answer": "[('زينب', 24), ('سعيد', 37), ('نور', 39), ('خالد', 58)]\n['خالد', 'نور']", "completion": " الناتج:\n```text\n[('زينب', 24), ('سعيد', 37), ('نور', 39), ('خالد', 58)]\n['خالد', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.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('يمل معلم برتقال رمل نهار كتاب مدرسة') == 1", "assert starts_count('مطر كتاب شمس يمل') == 1", "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('يمل معلم برتقال رمل نهار كتاب مدرسة') == 1\nassert starts_count('مطر كتاب شمس يمل') == 1\nassert starts_count('يمل نور بحر يمل') == 2\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ي'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ي'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('يمل يمل عمل عربية')` يُرجع `2`.\nالجواب:", "qhash": "ad5aeafb703b16f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "tests": ["assert total_multiples(127) == 1500", "assert total_multiples(199) == 3900", "assert total_multiples(185) == 3518", "assert total_multiples(45) == 180", "assert total_multiples(297) == 8854", "assert total_multiples(195) == 3900", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(127) == 1500\nassert total_multiples(199) == 3900\nassert total_multiples(185) == 3518\nassert total_multiples(45) == 180\nassert total_multiples(297) == 8854\nassert total_multiples(195) == 3900\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 % 10 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 10.\nمثال: `total_multiples(127)` يجب أن تُرجع `1500`.\nالجواب:", "qhash": "a78d22c609aa4e34"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('راشد', 11), ('خالد', 62), ('حسن', 42), ('سلمى', 39)]\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 = [('راشد', 11), ('خالد', 62), ('حسن', 42), ('سلمى', 39)]\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": "4bbc9dcebff665bb", "answer": "[('راشد', 11), ('سلمى', 39), ('حسن', 42), ('خالد', 62)]\n['خالد', 'حسن']", "completion": " الناتج:\n```text\n[('راشد', 11), ('سلمى', 39), ('حسن', 42), ('خالد', 62)]\n['خالد', 'حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'سلام'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'سلام'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ب'))\n```\nالجواب:", "qhash": "3c2ed4572b3e9a05", "answer": "م\nسلام\n0", "completion": " الناتج:\n```text\nم\nسلام\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 0 + 10 for x in range(-1, 6) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 0 + 10 for x in range(-1, 6) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "3e256fde5442b389", "answer": "[10, 10]\n2 20", "completion": " الناتج:\n```text\n[10, 10]\n2 20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -1 for x in xs if 14 <= x <= 26)", "tests": ["assert clip_scale([26, 33, 16, 34, 28, 27, 36, 36]) == [-26, -16]", "assert clip_scale([6, 14, -4, 18, 7, -20, 31]) == [-18, -14]", "assert clip_scale([25, 56, 0, 32, 60, 36]) == [-25]", "assert clip_scale([-28, -1, -4, 0, 59, -4, 8, -11, 15]) == [-15]", "assert clip_scale([]) == []", "assert clip_scale([-22, -8, 14, -7, 30, 23, 15, -18, -11, -28]) == [-23, -15, -14]", "assert clip_scale([42, -11, 16, 36, 27, -8, 1, -5]) == [-16]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([26, 33, 16, 34, 28, 27, 36, 36]) == [-26, -16]\nassert clip_scale([6, 14, -4, 18, 7, -20, 31]) == [-18, -14]\nassert clip_scale([25, 56, 0, 32, 60, 36]) == [-25]\nassert clip_scale([-28, -1, -4, 0, 59, -4, 8, -11, 15]) == [-15]\nassert clip_scale([]) == []\nassert clip_scale([-22, -8, 14, -7, 30, 23, 15, -18, -11, -28]) == [-23, -15, -14]\nassert clip_scale([42, -11, 16, 36, 27, -8, 1, -5]) == [-16]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -1 for x in xs if 14 <= x <= 26)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -1 for x in xs if 14 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 14 و26 (شاملًا الطرفين) في -1.\nمثال: `clip_scale([26, 33, 16, 34, 28, 27, 36, 36])` يجب أن تُرجع `[-26, -16]`.\nالجواب:", "qhash": "d0831464ffe89ac3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(92) == 2278", "assert total_multiples(13) == 42", "assert total_multiples(40) == 432", "assert total_multiples(209) == 11752", "assert total_multiples(277) == 20755", "assert total_multiples(7) == 12", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(92) == 2278\nassert total_multiples(13) == 42\nassert total_multiples(40) == 432\nassert total_multiples(209) == 11752\nassert total_multiples(277) == 20755\nassert total_multiples(7) == 12\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 % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(92)` يُرجع `2278`.\nالجواب:", "qhash": "92fe03f6eb2a4d8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([39, 53, 55, 30, 9]) == 9", "assert find_max_div([-27, -45, -36]) == -27", "assert find_max_div([1, 10]) == None", "assert find_max_div([37, -39, 8, -7, -26, 2, 8]) == None", "assert find_max_div([37, 0, -18, 3, 50, -25]) == 0", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([39, 53, 55, 30, 9]) == 9\nassert find_max_div([-27, -45, -36]) == -27\nassert find_max_div([1, 10]) == None\nassert find_max_div([37, -39, 8, -7, -26, 2, 8]) == None\nassert find_max_div([37, 0, -18, 3, 50, -25]) == 0\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\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(xs):\n best = None\n for x in xs:\n if x % 9 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 9 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `find_max_div([39, 53, 55, 30, 9])` يجب أن تُرجع `9`.\nالجواب:", "qhash": "0973f1c6033848f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -8 * x ** 2 + (4) * x + (-9)", "tests": ["assert p(6) == -273", "assert p(18) == -2529", "assert p(-11) == -1021", "assert p(-6) == -321", "assert p(-2) == -49", "assert p(9) == -621", "assert p(15) == -1749", "assert p(0) == -9"], "test_code": "assert p(6) == -273\nassert p(18) == -2529\nassert p(-11) == -1021\nassert p(-6) == -321\nassert p(-2) == -49\nassert p(9) == -621\nassert p(15) == -1749\nassert p(0) == -9", "answer": "def p(x):\n return -8 * x ** 2 + (4) * x + (-9)", "completion": " ```python\ndef p(x):\n return -8 * x ** 2 + (4) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -8x² + 4x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(6)` يُرجع `-273`.\nالجواب:", "qhash": "b18654b209d66d9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-4, 34, 32, 20, 5, 21, 15]\nprint(a[1:7])\nprint(a[::-2])\nprint(sum(a[1:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-4, 34, 32, 20, 5, 21, 15]\nprint(a[1:7])\nprint(a[::-2])\nprint(sum(a[1:7]))\n```\nالجواب:", "qhash": "8d73aa8442be6e14", "answer": "[34, 32, 20, 5, 21, 15]\n[15, 5, 32, -4]\n127", "completion": " الناتج:\n```text\n[34, 32, 20, 5, 21, 15]\n[15, 5, 32, -4]\n127\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(183) == 3921", "assert multiples_total(293) == 9877", "assert multiples_total(228) == 5973", "assert multiples_total(60) == 400", "assert multiples_total(76) == 663", "assert multiples_total(95) == 1006", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(183) == 3921\nassert multiples_total(293) == 9877\nassert multiples_total(228) == 5973\nassert multiples_total(60) == 400\nassert multiples_total(76) == 663\nassert multiples_total(95) == 1006\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 % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(183)` يُرجع `3921`.\nالجواب:", "qhash": "41e7c41408551361"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\nassert letter_count('') == 0", "answer": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('و'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «و».\nمثال: `letter_count('فجر لغة شمس سفينة علم لغة حاسوب')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "93a5b10afc5bd8a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 2 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_by([2, 29, 2, 9, 29, 12, 40]) == [12, 40, 2, 29, 2, 9, 29]", "assert rotate_by([36, 19]) == [36, 19]", "assert rotate_by([6, -2, 2, 33]) == [2, 33, 6, -2]", "assert rotate_by([-8, 39, 49, 43, 45]) == [43, 45, -8, 39, 49]", "assert rotate_by([19, 28]) == [19, 28]", "assert rotate_by([36, 26, 29, -2, 37, 8, 42, 39, 45, 25, 39, 15]) == [39, 15, 36, 26, 29, -2, 37, 8, 42, 39, 45, 25]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([2, 29, 2, 9, 29, 12, 40]) == [12, 40, 2, 29, 2, 9, 29]\nassert rotate_by([36, 19]) == [36, 19]\nassert rotate_by([6, -2, 2, 33]) == [2, 33, 6, -2]\nassert rotate_by([-8, 39, 49, 43, 45]) == [43, 45, -8, 39, 49]\nassert rotate_by([19, 28]) == [19, 28]\nassert rotate_by([36, 26, 29, -2, 37, 8, 42, 39, 45, 25, 39, 15]) == [39, 15, 36, 26, 29, -2, 37, 8, 42, 39, 45, 25]\nassert rotate_by([]) == []", "answer": "def rotate_by(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 rotate_by(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 rotate_by(xs):\n if not xs:\n return []\n k = 2 % len(xs)\n return ____\n```\nمثال: `rotate_by([2, 29, 2, 9, 29, 12, 40])` يجب أن تُرجع `[12, 40, 2, 29, 2, 9, 29]`.\nالجواب:", "qhash": "975abd4fb693d973"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 59", "tests": ["assert prod_mod(6) == 12", "assert prod_mod(4) == 24", "assert prod_mod(12) == 11", "assert prod_mod(51) == 26", "assert prod_mod(55) == 10", "assert prod_mod(20) == 26", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 12\nassert prod_mod(4) == 24\nassert prod_mod(12) == 11\nassert prod_mod(51) == 26\nassert prod_mod(55) == 10\nassert prod_mod(20) == 26\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 59", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(6)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "b5868ab36d677908"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(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 only_div([41, 16, 90, 7, 23, 22, 9, 12, 3]) == 1", "assert only_div([-22, 69, 76, 49, -17, 40, 20, 38]) == 0", "assert only_div([74, 21]) == 0", "assert only_div([]) == 0", "assert only_div([1]) == 0", "assert only_div([38, 20, 24, 67, 15, 80, -37]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([41, 16, 90, 7, 23, 22, 9, 12, 3]) == 1\nassert only_div([-22, 69, 76, 49, -17, 40, 20, 38]) == 0\nassert only_div([74, 21]) == 0\nassert only_div([]) == 0\nassert only_div([1]) == 0\nassert only_div([38, 20, 24, 67, 15, 80, -37]) == 1\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([41, 16, 90, 7, 23, 22, 9, 12, 3])` يُرجع `1`.\nالجواب:", "qhash": "d1430e6751c72ac1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([84, 8, 19, 33, 42, 7, 62, 34, 3, 4]) == 4", "assert count_matching([-8, -2, 14, 90, 50, 31, 8, -30, 83, 60, -22, -3]) == 4", "assert count_matching([73, 34, 86, 64, 12, -1, -6, 14, 38, 87, 16]) == 3", "assert count_matching([-1, 88, 64, 68, 29, 82, 71, 82]) == 0", "assert count_matching([15, -23, 1, 34, 6, -6, -15, -17, 41]) == 4", "assert count_matching([-39, 19, 9, 28, 86, 19, 71, -14]) == 2", "assert count_matching([]) == 0"], "test_code": "assert count_matching([84, 8, 19, 33, 42, 7, 62, 34, 3, 4]) == 4\nassert count_matching([-8, -2, 14, 90, 50, 31, 8, -30, 83, 60, -22, -3]) == 4\nassert count_matching([73, 34, 86, 64, 12, -1, -6, 14, 38, 87, 16]) == 3\nassert count_matching([-1, 88, 64, 68, 29, 82, 71, 82]) == 0\nassert count_matching([15, -23, 1, 34, 6, -6, -15, -17, 41]) == 4\nassert count_matching([-39, 19, 9, 28, 86, 19, 71, -14]) == 2\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([84, 8, 19, 33, 42, 7, 62, 34, 3, 4])` يُرجع `4`.\nالجواب:", "qhash": "9bd78e5f1506f97c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(9) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar']", "assert game(6) == ['1', '2', '3', '4', '5', '6']", "assert game(13) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13']", "assert game(22) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo', '22']", "assert game(21) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo']"], "test_code": "assert game(9) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar']\nassert game(6) == ['1', '2', '3', '4', '5', '6']\nassert game(13) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13']\nassert game(22) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo', '22']\nassert game(21) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar', '10', '11', '12', '13', 'Foo', '15', '16', '17', 'Bar', '19', '20', 'Foo']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 9 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(9)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', 'Bar']`.\nالجواب:", "qhash": "6dcde723bc70cb4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total", "tests": ["assert weighted_sum(6) == 1323", "assert weighted_sum(11) == 13068", "assert weighted_sum(8) == 3888", "assert weighted_sum(10) == 9075", "assert weighted_sum(3) == 108", "assert weighted_sum(1) == 3", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(6) == 1323\nassert weighted_sum(11) == 13068\nassert weighted_sum(8) == 3888\nassert weighted_sum(10) == 9075\nassert weighted_sum(3) == 108\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 ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 3\n return total\n```\nمثال: `weighted_sum(6)` يجب أن تُرجع `1323`.\nالجواب:", "qhash": "1ddb9d9467ea7fa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'bcst'}", "tests": ["assert count_chars('camel stone') == {'b': 0, 'c': 1, 's': 1, 't': 1}", "assert count_chars('code') == {'b': 0, 'c': 1, 's': 0, 't': 0}", "assert count_chars('music stone to vector on') == {'b': 0, 'c': 2, 's': 2, 't': 3}", "assert count_chars('we cloud code') == {'b': 0, 'c': 2, 's': 0, 't': 0}", "assert count_chars('vector brain is we') == {'b': 1, 'c': 1, 's': 1, 't': 1}", "assert count_chars('python falcon music camel') == {'b': 0, 'c': 3, 's': 1, 't': 1}", "assert count_chars('') == {'b': 0, 'c': 0, 's': 0, 't': 0}"], "test_code": "assert count_chars('camel stone') == {'b': 0, 'c': 1, 's': 1, 't': 1}\nassert count_chars('code') == {'b': 0, 'c': 1, 's': 0, 't': 0}\nassert count_chars('music stone to vector on') == {'b': 0, 'c': 2, 's': 2, 't': 3}\nassert count_chars('we cloud code') == {'b': 0, 'c': 2, 's': 0, 't': 0}\nassert count_chars('vector brain is we') == {'b': 1, 'c': 1, 's': 1, 't': 1}\nassert count_chars('python falcon music camel') == {'b': 0, 'c': 3, 's': 1, 't': 1}\nassert count_chars('') == {'b': 0, 'c': 0, 's': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'bcst'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'bcst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'c'، 's'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('camel stone')` يجب أن تُرجع `{'b': 0, 'c': 1, 's': 1, 't': 1}`.\nالجواب:", "qhash": "8989ee6993cd62ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12']", "assert game(25) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12', '13', 'Sun', '15', '16', '17', '18', '19', '20', 'Sun', 'Moon', '23', '24', '25']", "assert game(5) == ['1', '2', '3', '4', '5']", "assert game(16) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12', '13', 'Sun', '15', '16']", "assert game(6) == ['1', '2', '3', '4', '5', '6']"], "test_code": "assert game(12) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12']\nassert game(25) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12', '13', 'Sun', '15', '16', '17', '18', '19', '20', 'Sun', 'Moon', '23', '24', '25']\nassert game(5) == ['1', '2', '3', '4', '5']\nassert game(16) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12', '13', 'Sun', '15', '16']\nassert game(6) == ['1', '2', '3', '4', '5', '6']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Sun'\n if i % 11 == 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 % 7 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(12)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Sun', '8', '9', '10', 'Moon', '12']`.\nالجواب:", "qhash": "1139f5eab01f3d9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6", "tests": ["assert sum_digit_pow(89066) == 5", "assert sum_digit_pow(941206) == 4", "assert sum_digit_pow(832254) == 0", "assert sum_digit_pow(4993) == 1", "assert sum_digit_pow(792263) == 5", "assert sum_digit_pow(447578) == 5", "assert sum_digit_pow(331786) == 4", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(89066) == 5\nassert sum_digit_pow(941206) == 4\nassert sum_digit_pow(832254) == 0\nassert sum_digit_pow(4993) == 1\nassert sum_digit_pow(792263) == 5\nassert sum_digit_pow(447578) == 5\nassert sum_digit_pow(331786) == 4\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 6.\nللتوضيح: الاستدعاء `sum_digit_pow(89066)` يُرجع `5`.\nالجواب:", "qhash": "eb511e629f2924d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'دفتر'\nprint(text[::-1])\nprint(text.count('س'))\nprint(text.find('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'دفتر'\nprint(text[::-1])\nprint(text.count('س'))\nprint(text.find('س'))\n```\nالجواب:", "qhash": "bf941f08395e4c95", "answer": "رتفد\n0\n-1", "completion": " الناتج:\n```text\nرتفد\n0\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([-24, 10, 20, -26, 42, -10, -25, 42]) == 42", "assert max_of_div([-12, -24, -6]) == -6", "assert max_of_div([1]) == None", "assert max_of_div([-1, 25, 28, 34, -24, 20, -8, 8, -4]) == -24", "assert max_of_div([-37, -33, 27, 41, -30]) == -30", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-24, 10, 20, -26, 42, -10, -25, 42]) == 42\nassert max_of_div([-12, -24, -6]) == -6\nassert max_of_div([1]) == None\nassert max_of_div([-1, 25, 28, 34, -24, 20, -8, 8, -4]) == -24\nassert max_of_div([-37, -33, 27, 41, -30]) == -30\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 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 % 6 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(values):\n best = 0\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_of_div([-24, 10, 20, -26, 42, -10, -25, 42])` يجب أن تُرجع `42`.\nالجواب:", "qhash": "a191c6336c06faa1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'apple'\nprint(text.split('_'))\nprint(len(text))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'apple'\nprint(text.split('_'))\nprint(len(text))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "a938b751c59dbb90", "answer": "['apple']\n5\nApple", "completion": " الناتج:\n```text\n['apple']\n5\nApple\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([25, 25, 82, 44, 58, 27, 21, 86, 78]) == 2", "assert count_matching([-11, 21, 8, 86, -24, -38]) == 0", "assert count_matching([62, 52, 81, -30, 51, 59]) == 1", "assert count_matching([40, 65, 27]) == 1", "assert count_matching([-11, 28, 76, 82]) == 0", "assert count_matching([12]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([25, 25, 82, 44, 58, 27, 21, 86, 78]) == 2\nassert count_matching([-11, 21, 8, 86, -24, -38]) == 0\nassert count_matching([62, 52, 81, -30, 51, 59]) == 1\nassert count_matching([40, 65, 27]) == 1\nassert count_matching([-11, 28, 76, 82]) == 0\nassert count_matching([12]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([25, 25, 82, 44, 58, 27, 21, 86, 78])` يُرجع `2`.\nالجواب:", "qhash": "70f881e1a73ddd05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('stone winter') == 'dezyp htyepc'", "assert rotate_letters('a go') == 'l rz'", "assert rotate_letters('matrix data go matrix go') == 'xlecti olel rz xlecti rz'", "assert rotate_letters('cloud garden river garden window 2024') == 'nwzfo rlcopy ctgpc rlcopy htyozh 2024'", "assert rotate_letters('camel !') == 'nlxpw !'", "assert rotate_letters('at winter brain on Hello') == 'le htyepc mclty zy Hpwwz'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('stone winter') == 'dezyp htyepc'\nassert rotate_letters('a go') == 'l rz'\nassert rotate_letters('matrix data go matrix go') == 'xlecti olel rz xlecti rz'\nassert rotate_letters('cloud garden river garden window 2024') == 'nwzfo rlcopy ctgpc rlcopy htyozh 2024'\nassert rotate_letters('camel !') == 'nlxpw !'\nassert rotate_letters('at winter brain on Hello') == 'le htyepc mclty zy Hpwwz'\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 + (11)) % 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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('stone winter')` يجب أن تُرجع `'dezyp htyepc'`.\nالجواب:", "qhash": "2de75af84ec8fb67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('we light 2024') == 'px ebzam 2024'", "assert cipher('window cloud cloud an 2024') == 'pbgwhp vehnw vehnw tg 2024'", "assert cipher('signal on summer') == 'lbzgte hg lnffxk'", "assert cipher('engine music light on 2024') == 'xgzbgx fnlbv ebzam hg 2024'", "assert cipher('light stone camel') == 'ebzam lmhgx vtfxe'", "assert cipher('cloud desert of A1') == 'vehnw wxlxkm hy A1'", "assert cipher('') == ''"], "test_code": "assert cipher('we light 2024') == 'px ebzam 2024'\nassert cipher('window cloud cloud an 2024') == 'pbgwhp vehnw vehnw tg 2024'\nassert cipher('signal on summer') == 'lbzgte hg lnffxk'\nassert cipher('engine music light on 2024') == 'xgzbgx fnlbv ebzam hg 2024'\nassert cipher('light stone camel') == 'ebzam lmhgx vtfxe'\nassert cipher('cloud desert of A1') == 'vehnw wxlxkm hy 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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('we light 2024')` يجب أن تُرجع `'px ebzam 2024'`.\nالجواب:", "qhash": "5b3016b029f3713c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 2 <= x <= 37)", "tests": ["assert in_range_scaled([26, 41, 32, 21, 42, -2, 16, 39]) == [32, 42, 52, 64]", "assert in_range_scaled([-2, -6, 35, -30, -2, 1, 45, -14, 33]) == [66, 70]", "assert in_range_scaled([56]) == []", "assert in_range_scaled([40, 57]) == []", "assert in_range_scaled([-16, 28, 39, -23, 37, 25, -5, 10, 33]) == [20, 50, 56, 66, 74]", "assert in_range_scaled([6, 47, -17, -11]) == [12]", "assert in_range_scaled([-25, -13, -4]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([26, 41, 32, 21, 42, -2, 16, 39]) == [32, 42, 52, 64]\nassert in_range_scaled([-2, -6, 35, -30, -2, 1, 45, -14, 33]) == [66, 70]\nassert in_range_scaled([56]) == []\nassert in_range_scaled([40, 57]) == []\nassert in_range_scaled([-16, 28, 39, -23, 37, 25, -5, 10, 33]) == [20, 50, 56, 66, 74]\nassert in_range_scaled([6, 47, -17, -11]) == [12]\nassert in_range_scaled([-25, -13, -4]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 2 <= x <= 37)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 2 for x in xs if 2 <= x <= 37)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 2 ≤ x ≤ 37، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([26, 41, 32, 21, 42, -2, 16, 39])` يُرجع `[32, 42, 52, 64]`.\nالجواب:", "qhash": "bd56b5ad90abe246"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [13, 38, 28, 15, 5, 24, 24]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [13, 38, 28, 15, 5, 24, 24]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "6a60143795746282", "answer": "[5, 13, 15, 24, 24, 28, 38]\n[38, 28, 24]", "completion": " الناتج:\n```text\n[5, 13, 15, 24, 24, 28, 38]\n[38, 28, 24]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * -3 + -5 for x in range(-6, 1) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * -3 + -5 for x in range(-6, 1) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "f3bb1d9198962b53", "answer": "[10, 1]\n2 11", "completion": " الناتج:\n```text\n[10, 1]\n2 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'تفاحة'\nprint(len(kalima.replace(' ', '')))\nprint('ح' in kalima)\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'تفاحة'\nprint(len(kalima.replace(' ', '')))\nprint('ح' in kalima)\nprint(kalima[-1])\n```\nالجواب:", "qhash": "f1b97e1eb43e15b6", "answer": "5\nTrue\nة", "completion": " الناتج:\n```text\n5\nTrue\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(nums):\n best = None\n for x in nums:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([51, 43, 1, 14, -5, -12]) == None", "assert max_div([-10, -30, -10]) == -10", "assert max_div([1, 11, 21]) == None", "assert max_div([]) == None", "assert max_div([20, -50, 20, 21]) == 20", "assert max_div([]) == None"], "test_code": "assert max_div([51, 43, 1, 14, -5, -12]) == None\nassert max_div([-10, -30, -10]) == -10\nassert max_div([1, 11, 21]) == None\nassert max_div([]) == None\nassert max_div([20, -50, 20, 21]) == 20\nassert max_div([]) == None", "answer": "def max_div(nums):\n best = None\n for x in nums:\n if x % 10 == 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 % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(nums):\n best = None\n for x in nums:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(nums):\n best = None\n for x in nums:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([51, 43, 1, 14, -5, -12])` يُرجع `None`.\nالجواب:", "qhash": "460f78734116d602"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'فيصل': 18, 'حسن': 20, 'نور': 24, 'عمر': 21}\nd['فيصل'] += 2\nd['وليد'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('سلمى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'فيصل': 18, 'حسن': 20, 'نور': 24, 'عمر': 21}\nd['فيصل'] += 2\nd['وليد'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('سلمى', -1))\n```\nالجواب:", "qhash": "1a17f264338aa919", "answer": "5\nنور\n103\n-1", "completion": " الناتج:\n```text\n5\nنور\n103\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(items):\n if not items:\n return []\n k = 12 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert spin([39, 24, 25, 14]) == [39, 24, 25, 14]", "assert spin([38, -4, 1, 24, 26, 35]) == [38, -4, 1, 24, 26, 35]", "assert spin([23, 12, 28, 32, -5, 8, 46, 34, 27, 42]) == [27, 42, 23, 12, 28, 32, -5, 8, 46, 34]", "assert spin([-7, 30, 46, 40, 13, 43, 12, 50]) == [13, 43, 12, 50, -7, 30, 46, 40]", "assert spin([47, 29, 12, 32, 29, -1]) == [47, 29, 12, 32, 29, -1]", "assert spin([18, 48, 45, -1, 38]) == [-1, 38, 18, 48, 45]", "assert spin([]) == []"], "test_code": "assert spin([39, 24, 25, 14]) == [39, 24, 25, 14]\nassert spin([38, -4, 1, 24, 26, 35]) == [38, -4, 1, 24, 26, 35]\nassert spin([23, 12, 28, 32, -5, 8, 46, 34, 27, 42]) == [27, 42, 23, 12, 28, 32, -5, 8, 46, 34]\nassert spin([-7, 30, 46, 40, 13, 43, 12, 50]) == [13, 43, 12, 50, -7, 30, 46, 40]\nassert spin([47, 29, 12, 32, 29, -1]) == [47, 29, 12, 32, 29, -1]\nassert spin([18, 48, 45, -1, 38]) == [-1, 38, 18, 48, 45]\nassert spin([]) == []", "answer": "def spin(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 spin(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 spin(items):\n if not items:\n return []\n k = 12 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `spin([39, 24, 25, 14])` يُرجع `[39, 24, 25, 14]`.\nالجواب:", "qhash": "8403d65ba35d400d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_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 best_multiple([-1, 39, 27, 33]) == None", "assert best_multiple([-12, -12, -4]) == -4", "assert best_multiple([1, 5]) == None", "assert best_multiple([-34, 25, -8, -28]) == -8", "assert best_multiple([-15, 25, -35, -29, -49, 49, 3, -35, 40]) == 40", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-1, 39, 27, 33]) == None\nassert best_multiple([-12, -12, -4]) == -4\nassert best_multiple([1, 5]) == None\nassert best_multiple([-34, 25, -8, -28]) == -8\nassert best_multiple([-15, 25, -35, -29, -49, 49, 3, -35, 40]) == 40\nassert best_multiple([]) == None", "answer": "def best_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 best_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 best_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 best_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مثال: `best_multiple([-1, 39, 27, 33])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "7680076d7653f167"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['table', 'engine', 'desert', 'river', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['table', 'engine', 'desert', 'river', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3480eb7bab42af05", "answer": "['table', 'river', 'engine', 'desert', 'window']\n['window', 'engine', 'desert']", "completion": " الناتج:\n```text\n['table', 'river', 'engine', 'desert', 'window']\n['window', 'engine', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 8 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(26) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26']", "assert play(18) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18']", "assert play(16) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac']", "assert play(6) == ['1', '2', '3', '4', 'Tic', '6']", "assert play(15) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic']"], "test_code": "assert play(26) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26']\nassert play(18) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18']\nassert play(16) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac']\nassert play(6) == ['1', '2', '3', '4', 'Tic', '6']\nassert play(15) == ['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Tic'\n if i % 8 == 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 % 5 == 0:\n s += 'Tic'\n if i % 8 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Tic'، وإن قَبِلها على 8 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(26)` يُرجع `['1', '2', '3', '4', 'Tic', '6', '7', 'Tac', '9', 'Tic', '11', '12', '13', '14', 'Tic', 'Tac', '17', '18', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26']`.\nالجواب:", "qhash": "1b77e67522881ddb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=1):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(10))\nprint(h(10, 19))\nprint(h(h(19), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=1):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(h(10))\nprint(h(10, 19))\nprint(h(h(19), 10))\n```\nالجواب:", "qhash": "1b091922d823abd8", "answer": "39\n86\n290", "completion": " الناتج:\n```text\n39\n86\n290\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(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 cumulative([17, 2, 9, 3, 14, 21, 17, 18]) == [17, 19, 28, 31, 0, 21, 0, 18]", "assert cumulative([17, 13, 0, 12]) == [17, 30, 30, 0]", "assert cumulative([-8, 25, 9, 28, 0, 3]) == [-8, 17, 26, 0, 0, 3]", "assert cumulative([30, 30, -4, 32, 21, 24]) == [30, 0, -4, 28, 0, 24]", "assert cumulative([9, 12]) == [9, 21]", "assert cumulative([33]) == [33]", "assert cumulative([]) == []"], "test_code": "assert cumulative([17, 2, 9, 3, 14, 21, 17, 18]) == [17, 19, 28, 31, 0, 21, 0, 18]\nassert cumulative([17, 13, 0, 12]) == [17, 30, 30, 0]\nassert cumulative([-8, 25, 9, 28, 0, 3]) == [-8, 17, 26, 0, 0, 3]\nassert cumulative([30, 30, -4, 32, 21, 24]) == [30, 0, -4, 28, 0, 24]\nassert cumulative([9, 12]) == [9, 21]\nassert cumulative([33]) == [33]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 35 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([17, 2, 9, 3, 14, 21, 17, 18])` يُرجع `[17, 19, 28, 31, 0, 21, 0, 18]`.\nالجواب:", "qhash": "90582016993d0b22"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 2:\n return 1\n return 2 * f(n - 1) + 1\n\nprint(f(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 2:\n return 1\n return 2 * f(n - 1) + 1\n\nprint(f(7))\n```\nالجواب:", "qhash": "db0fdd63025cba02", "answer": "63", "completion": " الناتج:\n```text\n63\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'هدى': 8, 'يوسف': 2, 'نور': 23, 'فيصل': 9, 'عمر': 50}\npoints['عمر'] += 19\npoints['مريم'] = 37\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 22])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'هدى': 8, 'يوسف': 2, 'نور': 23, 'فيصل': 9, 'عمر': 50}\npoints['عمر'] += 19\npoints['مريم'] = 37\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 22])\n```\nالجواب:", "qhash": "78646eba7ad997c4", "answer": "6\nعمر\n148\n['نور', 'عمر', 'مريم']", "completion": " الناتج:\n```text\n6\nعمر\n148\n['نور', 'عمر', 'مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert roll([13, 14, 28, 20, 5, 35, 26, 24]) == [13, 14, 28, 20, 5, 35, 26, 24]", "assert roll([0, -1, 26, 42]) == [0, -1, 26, 42]", "assert roll([13, 8, -2, 39, 5]) == [8, -2, 39, 5, 13]", "assert roll([16, 15, 31, 29, 31, 38, 6, -3, 32, -2]) == [6, -3, 32, -2, 16, 15, 31, 29, 31, 38]", "assert roll([28]) == [28]", "assert roll([23]) == [23]", "assert roll([]) == []"], "test_code": "assert roll([13, 14, 28, 20, 5, 35, 26, 24]) == [13, 14, 28, 20, 5, 35, 26, 24]\nassert roll([0, -1, 26, 42]) == [0, -1, 26, 42]\nassert roll([13, 8, -2, 39, 5]) == [8, -2, 39, 5, 13]\nassert roll([16, 15, 31, 29, 31, 38, 6, -3, 32, -2]) == [6, -3, 32, -2, 16, 15, 31, 29, 31, 38]\nassert roll([28]) == [28]\nassert roll([23]) == [23]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nمثال: `roll([13, 14, 28, 20, 5, 35, 26, 24])` يجب أن تُرجع `[13, 14, 28, 20, 5, 35, 26, 24]`.\nالجواب:", "qhash": "5191b517fd94d5f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('stone signal') == 'klgfw kayfsd'", "assert rotate_letters('coffee by OK') == 'ugxxww tq OK'", "assert rotate_letters('brain matrix 2024') == 'tjsaf esljap 2024'", "assert rotate_letters('light') == 'dayzl'", "assert rotate_letters('light to window data up Hello') == 'dayzl lg oafvgo vsls mh Hwddg'", "assert rotate_letters('desert') == 'vwkwjl'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('stone signal') == 'klgfw kayfsd'\nassert rotate_letters('coffee by OK') == 'ugxxww tq OK'\nassert rotate_letters('brain matrix 2024') == 'tjsaf esljap 2024'\nassert rotate_letters('light') == 'dayzl'\nassert rotate_letters('light to window data up Hello') == 'dayzl lg oafvgo vsls mh Hwddg'\nassert rotate_letters('desert') == 'vwkwjl'\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 + (-8)) % 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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('stone signal')` يجب أن تُرجع `'klgfw kayfsd'`.\nالجواب:", "qhash": "b70992aa59eaa319"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'رنا': 48, 'زينب': 28, 'عمر': 22, 'هشام': 31}\nd['زينب'] += 1\nd['سعيد'] = 7\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 35])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'رنا': 48, 'زينب': 28, 'عمر': 22, 'هشام': 31}\nd['زينب'] += 1\nd['سعيد'] = 7\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 35])\n```\nالجواب:", "qhash": "8335c62275dd65b6", "answer": "5\nرنا\n137\n['رنا']", "completion": " الناتج:\n```text\n5\nرنا\n137\n['رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 1:\n return 3\n return 3 * rec(n - 1) + 3\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 1:\n return 3\n return 3 * rec(n - 1) + 3\n\nprint(rec(5))\n```\nالجواب:", "qhash": "2f591ce03068ee5d", "answer": "363", "completion": " الناتج:\n```text\n363\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([-27, -10, 16, 28, 39, -25, 17]) == None", "assert best_multiple([-11, -22, -33]) == -11", "assert best_multiple([1]) == None", "assert best_multiple([21, 38, 24, 37, 4, -8, -36, 22]) == 22", "assert best_multiple([-45, -26, -16, -22]) == -22", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-27, -10, 16, 28, 39, -25, 17]) == None\nassert best_multiple([-11, -22, -33]) == -11\nassert best_multiple([1]) == None\nassert best_multiple([21, 38, 24, 37, 4, -8, -36, 22]) == 22\nassert best_multiple([-45, -26, -16, -22]) == -22\nassert best_multiple([]) == None", "answer": "def best_multiple(values):\n best = None\n for x in values:\n if x % 11 == 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 % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def best_multiple(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `best_multiple([-27, -10, 16, 28, 39, -25, 17])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "a15c32e577de4d4f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(22) == 114", "assert add_multiples(76) == 1165", "assert add_multiples(17) == 55", "assert add_multiples(61) == 750", "assert add_multiples(41) == 343", "assert add_multiples(104) == 2155", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(22) == 114\nassert add_multiples(76) == 1165\nassert add_multiples(17) == 55\nassert add_multiples(61) == 750\nassert add_multiples(41) == 343\nassert add_multiples(104) == 2155\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 % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `add_multiples(22)` يجب أن تُرجع `114`.\nالجواب:", "qhash": "987a5b4508ea02ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 9 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19']", "assert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17']", "assert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']", "assert fizz(6) == ['1', '2', '3', '4', '5', '6']", "assert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19', '20', 'Tic', '22', '23', '24']"], "test_code": "assert fizz(19) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19']\nassert fizz(17) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17']\nassert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10']\nassert fizz(6) == ['1', '2', '3', '4', '5', '6']\nassert fizz(24) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19', '20', 'Tic', '22', '23', '24']", "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 % 9 == 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 % 9 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Tic'، وإن قَبِلها على 9 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(19)` يُرجع `['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19']`.\nالجواب:", "qhash": "44850f7335a6aa0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_in_text", "reference": "def count_in_text(text):\n return text.count('ر')", "tests": ["assert count_in_text('حديقة مدينة قمر ليل') == 1", "assert count_in_text('لغة') == 0", "assert count_in_text('وردة علم ماء') == 1", "assert count_in_text('فجر مدرسة طالب مكتبة صديق') == 2", "assert count_in_text('سيارة معلم سوق سلام') == 1", "assert count_in_text('وردة سوق صحراء سماء باب صحراء بيت شمس') == 3", "assert count_in_text('باب') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('حديقة مدينة قمر ليل') == 1\nassert count_in_text('لغة') == 0\nassert count_in_text('وردة علم ماء') == 1\nassert count_in_text('فجر مدرسة طالب مكتبة صديق') == 2\nassert count_in_text('سيارة معلم سوق سلام') == 1\nassert count_in_text('وردة سوق صحراء سماء باب صحراء بيت شمس') == 3\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)` بحيث تُعيد عدد مرات ظهور الحرف «ر» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('حديقة مدينة قمر ليل')` يُرجع `1`.\nالجواب:", "qhash": "36ea50d2be0bb729"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('coffee data falcon') == 'zlccbb axqx cxizlk'", "assert caesar('signal OK') == 'pfdkxi OK'", "assert caesar('engine python falcon') == 'bkdfkb mvqelk cxizlk'", "assert caesar('it go Hello') == 'fq dl Hbiil'", "assert caesar('brain engine winter winter to 2024') == 'yoxfk bkdfkb tfkqbo tfkqbo ql 2024'", "assert caesar('at stone python') == 'xq pqlkb mvqelk'", "assert caesar('') == ''"], "test_code": "assert caesar('coffee data falcon') == 'zlccbb axqx cxizlk'\nassert caesar('signal OK') == 'pfdkxi OK'\nassert caesar('engine python falcon') == 'bkdfkb mvqelk cxizlk'\nassert caesar('it go Hello') == 'fq dl Hbiil'\nassert caesar('brain engine winter winter to 2024') == 'yoxfk bkdfkb tfkqbo tfkqbo ql 2024'\nassert caesar('at stone python') == 'xq pqlkb mvqelk'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('coffee data falcon')` يُرجع `'zlccbb axqx cxizlk'`.\nالجواب:", "qhash": "a45f6fc11b122955"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [29, 22, 18, 23, 19]\nprint(lst[2:3])\nprint(lst[::-1])\nprint(len(lst[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [29, 22, 18, 23, 19]\nprint(lst[2:3])\nprint(lst[::-1])\nprint(len(lst[2:3]))\n```\nالجواب:", "qhash": "91cde4b87bfb869d", "answer": "[18]\n[19, 23, 18, 22, 29]\n1", "completion": " الناتج:\n```text\n[18]\n[19, 23, 18, 22, 29]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "tests": ["assert mult_sum(119) == 2064", "assert mult_sum(88) == 1125", "assert mult_sum(142) == 2840", "assert mult_sum(2) == 0", "assert mult_sum(233) == 7655", "assert mult_sum(47) == 315", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(119) == 2064\nassert mult_sum(88) == 1125\nassert mult_sum(142) == 2840\nassert mult_sum(2) == 0\nassert mult_sum(233) == 7655\nassert mult_sum(47) == 315\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 % 9 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(119)` يُرجع `2064`.\nالجواب:", "qhash": "0d54012540ea7aeb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'صحراء'\nprint(text[-1])\nprint(text[::-1])\nprint('ر' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'صحراء'\nprint(text[-1])\nprint(text[::-1])\nprint('ر' in text)\n```\nالجواب:", "qhash": "98948e9301e107a3", "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_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 5", "tests": ["assert pow_digits(19016) == 2", "assert pow_digits(798548) == 1", "assert pow_digits(22469) == 3", "assert pow_digits(761582) == 4", "assert pow_digits(29309) == 3", "assert pow_digits(260806) == 2", "assert pow_digits(235072) == 4", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(19016) == 2\nassert pow_digits(798548) == 1\nassert pow_digits(22469) == 3\nassert pow_digits(761582) == 4\nassert pow_digits(29309) == 3\nassert pow_digits(260806) == 2\nassert pow_digits(235072) == 4\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 5", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 5.\nمثال: `pow_digits(19016)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "a5c3584b20846890"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 81683\nc = 0\nwhile x > 4:\n x = x // 7\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 81683\nc = 0\nwhile x > 4:\n x = x // 7\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "734a9489c581a109", "answer": "4 5", "completion": " الناتج:\n```text\n4 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('up vector on OK') == 'lg mvtkfi fe OK'", "assert shift_letters('table go engine we brain Hello') == 'krscv xf vexzev nv sirze Hvccf'", "assert shift_letters('brain on garden') == 'sirze fe xriuve'", "assert shift_letters('in in code we') == 'ze ze tfuv nv'", "assert shift_letters('coffee engine by !') == 'tfwwvv vexzev sp !'", "assert shift_letters('matrix by banana signal it') == 'drkizo sp srerer jzxerc zk'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('up vector on OK') == 'lg mvtkfi fe OK'\nassert shift_letters('table go engine we brain Hello') == 'krscv xf vexzev nv sirze Hvccf'\nassert shift_letters('brain on garden') == 'sirze fe xriuve'\nassert shift_letters('in in code we') == 'ze ze tfuv nv'\nassert shift_letters('coffee engine by !') == 'tfwwvv vexzev sp !'\nassert shift_letters('matrix by banana signal it') == 'drkizo sp srerer jzxerc zk'\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 + (17)) % 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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('up vector on OK')` يُرجع `'lg mvtkfi fe OK'`.\nالجواب:", "qhash": "3eeccf4ada5fb05c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('نور', 23), ('زينب', 62), ('سلمى', 18), ('هشام', 40)]\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 = [('نور', 23), ('زينب', 62), ('سلمى', 18), ('هشام', 40)]\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": "6023fd2bc7e408c1", "answer": "[('سلمى', 18), ('نور', 23), ('هشام', 40), ('زينب', 62)]\n['زينب', 'هشام']", "completion": " الناتج:\n```text\n[('سلمى', 18), ('نور', 23), ('هشام', 40), ('زينب', 62)]\n['زينب', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total", "tests": ["assert sum_terms(3) == 1656", "assert sum_terms(6) == 73206", "assert sum_terms(3) == 1656", "assert sum_terms(2) == 198", "assert sum_terms(10) == 1324950", "assert sum_terms(1) == 6", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 1656\nassert sum_terms(6) == 73206\nassert sum_terms(3) == 1656\nassert sum_terms(2) == 198\nassert sum_terms(10) == 1324950\nassert sum_terms(1) == 6\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 6 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 5\n return total\n```\nمثال: `sum_terms(3)` يجب أن تُرجع `1656`.\nالجواب:", "qhash": "c1d725a8e45bede6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(5))\nprint(h(5, 5))\nprint(h(h(5), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(5))\nprint(h(5, 5))\nprint(h(h(5), 5))\n```\nالجواب:", "qhash": "e1b273cef26444d8", "answer": "26\n20\n73", "completion": " الناتج:\n```text\n26\n20\n73\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(11))\nprint(h(11, -10))\nprint(h(h(-10), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(11))\nprint(h(11, -10))\nprint(h(h(-10), 11))\n```\nالجواب:", "qhash": "a8052d00034d8c9f", "answer": "-25\n-12\n-38", "completion": " الناتج:\n```text\n-25\n-12\n-38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'ae'}", "tests": ["assert char_counts('in') == {'a': 0, 'e': 0}", "assert char_counts('rocket an coffee') == {'a': 1, 'e': 3}", "assert char_counts('desert summer') == {'a': 0, 'e': 3}", "assert char_counts('signal to to an') == {'a': 2, 'e': 0}", "assert char_counts('window cloud') == {'a': 0, 'e': 0}", "assert char_counts('data window orange a') == {'a': 4, 'e': 1}", "assert char_counts('') == {'a': 0, 'e': 0}"], "test_code": "assert char_counts('in') == {'a': 0, 'e': 0}\nassert char_counts('rocket an coffee') == {'a': 1, 'e': 3}\nassert char_counts('desert summer') == {'a': 0, 'e': 3}\nassert char_counts('signal to to an') == {'a': 2, 'e': 0}\nassert char_counts('window cloud') == {'a': 0, 'e': 0}\nassert char_counts('data window orange a') == {'a': 4, 'e': 1}\nassert char_counts('') == {'a': 0, 'e': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'ae'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'ae'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'e' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('in')` يجب أن تُرجع `{'a': 0, 'e': 0}`.\nالجواب:", "qhash": "0a0ed947a0f04200"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'نور': 9, 'أحمد': 15, 'منى': 33, 'هدى': 14}\nd['منى'] += 19\nd['هشام'] = 54\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 40])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'نور': 9, 'أحمد': 15, 'منى': 33, 'هدى': 14}\nd['منى'] += 19\nd['هشام'] = 54\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 40])\n```\nالجواب:", "qhash": "e5753c80d0fad72c", "answer": "5\nهشام\n144\n['منى', 'هشام']", "completion": " الناتج:\n```text\n5\nهشام\n144\n['منى', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total", "tests": ["assert power_sum(4) == 110", "assert power_sum(0) == 0", "assert power_sum(5) == 165", "assert power_sum(5) == 165", "assert power_sum(12) == 858", "assert power_sum(1) == 11", "assert power_sum(0) == 0"], "test_code": "assert power_sum(4) == 110\nassert power_sum(0) == 0\nassert power_sum(5) == 165\nassert power_sum(5) == 165\nassert power_sum(12) == 858\nassert power_sum(1) == 11\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `power_sum(4)` يُرجع `110`.\nالجواب:", "qhash": "81b9937eaa9d985f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'بحر شمس'\nprint(s.split())\nprint(len(s))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'بحر شمس'\nprint(s.split())\nprint(len(s))\nprint(s[-1])\n```\nالجواب:", "qhash": "df4c9794424ec89e", "answer": "['بحر', 'شمس']\n7\nس", "completion": " الناتج:\n```text\n['بحر', 'شمس']\n7\nس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(12))\nprint(g(12, -5))\nprint(g(g(-5), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(g(12))\nprint(g(12, -5))\nprint(g(g(-5), 12))\n```\nالجواب:", "qhash": "6874cb30bfc277fa", "answer": "91\n101\n268", "completion": " الناتج:\n```text\n91\n101\n268\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=5):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(15))\nprint(compute(15, -4))\nprint(compute(compute(-4), 15))", "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(15))\nprint(compute(15, -4))\nprint(compute(compute(-4), 15))\n```\nالجواب:", "qhash": "40fffc6bd9b44145", "answer": "40\n49\n56", "completion": " الناتج:\n```text\n40\n49\n56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'bdu'}", "tests": ["assert char_freq('in') == {'b': 0, 'd': 0, 'u': 0}", "assert char_freq('garden data banana an rocket by') == {'b': 2, 'd': 2, 'u': 0}", "assert char_freq('desert desert orange music') == {'b': 0, 'd': 2, 'u': 1}", "assert char_freq('in garden falcon winter') == {'b': 0, 'd': 1, 'u': 0}", "assert char_freq('winter an to rocket we') == {'b': 0, 'd': 0, 'u': 0}", "assert char_freq('up engine pixel stone of at') == {'b': 0, 'd': 0, 'u': 1}", "assert char_freq('') == {'b': 0, 'd': 0, 'u': 0}"], "test_code": "assert char_freq('in') == {'b': 0, 'd': 0, 'u': 0}\nassert char_freq('garden data banana an rocket by') == {'b': 2, 'd': 2, 'u': 0}\nassert char_freq('desert desert orange music') == {'b': 0, 'd': 2, 'u': 1}\nassert char_freq('in garden falcon winter') == {'b': 0, 'd': 1, 'u': 0}\nassert char_freq('winter an to rocket we') == {'b': 0, 'd': 0, 'u': 0}\nassert char_freq('up engine pixel stone of at') == {'b': 0, 'd': 0, 'u': 1}\nassert char_freq('') == {'b': 0, 'd': 0, 'u': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'bdu'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'bdu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'd'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('in')` يجب أن تُرجع `{'b': 0, 'd': 0, 'u': 0}`.\nالجواب:", "qhash": "d1e55479621a20ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'قلم ماء'\nprint(w[::-1])\nprint(w[-1])\nprint(w.count('ل'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'قلم ماء'\nprint(w[::-1])\nprint(w[-1])\nprint(w.count('ل'))\n```\nالجواب:", "qhash": "284cb75ec34f164a", "answer": "ءام ملق\nء\n1", "completion": " الناتج:\n```text\nءام ملق\nء\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([47, -23, 26, 58, 28, -29, 40]) == 40", "assert max_of_div([-10, -40, -40]) == -10", "assert max_of_div([1]) == None", "assert max_of_div([-34, 25, -16, -5, -11]) == None", "assert max_of_div([16, -5, 47, -32, -11, -18, 3, 6, -2]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([47, -23, 26, 58, 28, -29, 40]) == 40\nassert max_of_div([-10, -40, -40]) == -10\nassert max_of_div([1]) == None\nassert max_of_div([-34, 25, -16, -5, -11]) == None\nassert max_of_div([16, -5, 47, -32, -11, -18, 3, 6, -2]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_of_div(xs):\n best = None\n for x in xs:\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(xs):\n best = None\n for x in xs:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_of_div([47, -23, 26, 58, 28, -29, 40])` يجب أن تُرجع `40`.\nالجواب:", "qhash": "c6327c87ce9e1d7c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'وليد': 2, 'هدى': 41, 'ليلى': 23}\nd['ليلى'] += 16\nd['يوسف'] = 43\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 = {'وليد': 2, 'هدى': 41, 'ليلى': 23}\nd['ليلى'] += 16\nd['يوسف'] = 43\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": "ae1ea7450ae0b26e", "answer": "4\nيوسف\n125\n[('وليد', 2), ('ليلى', 39)]", "completion": " الناتج:\n```text\n4\nيوسف\n125\n[('وليد', 2), ('ليلى', 39)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 3) // 2 for x in range(0, 5) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 3) // 2 for x in range(0, 5) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "f077a7bb8975d841", "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": "math", "template": "w_coprime#1", "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, 35) == 1)", "tests": ["assert count_gcd1(11) == 8", "assert count_gcd1(176) == 121", "assert count_gcd1(82) == 57", "assert count_gcd1(23) == 16", "assert count_gcd1(191) == 131", "assert count_gcd1(58) == 40", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(11) == 8\nassert count_gcd1(176) == 121\nassert count_gcd1(82) == 57\nassert count_gcd1(23) == 16\nassert count_gcd1(191) == 131\nassert count_gcd1(58) == 40\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, 35) == 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, 35) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 35) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(11)` يُرجع `8`.\nالجواب:", "qhash": "08e9ee4ffff56721"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سلام قهوة معلم بحر لغة') == 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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('نهر سماء مدرسة')` يُرجع `0`.\nالجواب:", "qhash": "5724aa83351e7b8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(428707972))\nprint(rec(rec(428707972)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(428707972))\nprint(rec(rec(428707972)))\n```\nالجواب:", "qhash": "8601f6ea45b6ef16", "answer": "46\n10", "completion": " الناتج:\n```text\n46\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'نور': 41, 'منى': 33, 'سعيد': 18, 'أحمد': 27}\nmarks['أحمد'] += 18\nmarks['رنا'] = 24\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, 'منى': 33, 'سعيد': 18, 'أحمد': 27}\nmarks['أحمد'] += 18\nmarks['رنا'] = 24\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": "f509f034e1988a00", "answer": "5\nأحمد\n161\n[('سعيد', 18), ('رنا', 24)]", "completion": " الناتج:\n```text\n5\nأحمد\n161\n[('سعيد', 18), ('رنا', 24)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('vector brain up camel engine winter') == 'winter/engine/camel/brain/vector'", "assert rev_long_words('go data a an pixel on') == 'pixel/data'", "assert rev_long_words('orange') == 'orange'", "assert rev_long_words('cloud engine orange is an vector') == 'vector/orange/engine/cloud'", "assert rev_long_words('') == ''", "assert rev_long_words('brain to signal an music go is') == 'music/signal/brain'", "assert rev_long_words('coffee light table river pixel') == 'pixel/river/table/light/coffee'"], "test_code": "assert rev_long_words('vector brain up camel engine winter') == 'winter/engine/camel/brain/vector'\nassert rev_long_words('go data a an pixel on') == 'pixel/data'\nassert rev_long_words('orange') == 'orange'\nassert rev_long_words('cloud engine orange is an vector') == 'vector/orange/engine/cloud'\nassert rev_long_words('') == ''\nassert rev_long_words('brain to signal an music go is') == 'music/signal/brain'\nassert rev_long_words('coffee light table river pixel') == 'pixel/river/table/light/coffee'", "answer": "def rev_long_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_long_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `rev_long_words('vector brain up camel engine winter')` يُرجع `'winter/engine/camel/brain/vector'`.\nالجواب:", "qhash": "9d34b000d1945c70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 6 * x ** 2 + (8) * x + (3)", "tests": ["assert eval_poly(9) == 561", "assert eval_poly(-5) == 113", "assert eval_poly(-18) == 1803", "assert eval_poly(-15) == 1233", "assert eval_poly(-20) == 2243", "assert eval_poly(-5) == 113", "assert eval_poly(-17) == 1601", "assert eval_poly(0) == 3"], "test_code": "assert eval_poly(9) == 561\nassert eval_poly(-5) == 113\nassert eval_poly(-18) == 1803\nassert eval_poly(-15) == 1233\nassert eval_poly(-20) == 2243\nassert eval_poly(-5) == 113\nassert eval_poly(-17) == 1601\nassert eval_poly(0) == 3", "answer": "def eval_poly(x):\n return 6 * x ** 2 + (8) * x + (3)", "completion": " ```python\ndef eval_poly(x):\n return 6 * x ** 2 + (8) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 6x² + 8x + 3 عند العدد الصحيح x.\nمثال: `eval_poly(9)` يجب أن تُرجع `561`.\nالجواب:", "qhash": "1040f9a320389066"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'alt'}", "tests": ["assert char_freq('a by falcon') == {'a': 2, 'l': 1, 't': 0}", "assert char_freq('is desert river signal python') == {'a': 1, 'l': 1, 't': 2}", "assert char_freq('falcon') == {'a': 1, 'l': 1, 't': 0}", "assert char_freq('it on code stone is orange') == {'a': 1, 'l': 0, 't': 2}", "assert char_freq('python window up engine') == {'a': 0, 'l': 0, 't': 1}", "assert char_freq('rocket desert on stone desert') == {'a': 0, 'l': 0, 't': 4}", "assert char_freq('') == {'a': 0, 'l': 0, 't': 0}"], "test_code": "assert char_freq('a by falcon') == {'a': 2, 'l': 1, 't': 0}\nassert char_freq('is desert river signal python') == {'a': 1, 'l': 1, 't': 2}\nassert char_freq('falcon') == {'a': 1, 'l': 1, 't': 0}\nassert char_freq('it on code stone is orange') == {'a': 1, 'l': 0, 't': 2}\nassert char_freq('python window up engine') == {'a': 0, 'l': 0, 't': 1}\nassert char_freq('rocket desert on stone desert') == {'a': 0, 'l': 0, 't': 4}\nassert char_freq('') == {'a': 0, 'l': 0, 't': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'alt'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'alt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'l'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('a by falcon')` يجب أن تُرجع `{'a': 2, 'l': 1, 't': 0}`.\nالجواب:", "qhash": "6ddafb0bdf331354"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('banana music an desert Hello') == 'ihuhuh tbzpj hu klzlya Hlssv'", "assert shift_text('brain music pixel') == 'iyhpu tbzpj wpels'", "assert shift_text('python of') == 'wfaovu vm'", "assert shift_text('pixel stone music we desert') == 'wpels zavul tbzpj dl klzlya'", "assert shift_text('coffee by desert data') == 'jvmmll if klzlya khah'", "assert shift_text('camel a is engine !') == 'jhtls h pz lunpul !'", "assert shift_text('') == ''"], "test_code": "assert shift_text('banana music an desert Hello') == 'ihuhuh tbzpj hu klzlya Hlssv'\nassert shift_text('brain music pixel') == 'iyhpu tbzpj wpels'\nassert shift_text('python of') == 'wfaovu vm'\nassert shift_text('pixel stone music we desert') == 'wpels zavul tbzpj dl klzlya'\nassert shift_text('coffee by desert data') == 'jvmmll if klzlya khah'\nassert shift_text('camel a is engine !') == 'jhtls h pz lunpul !'\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 + (7)) % 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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('banana music an desert Hello')` يجب أن تُرجع `'ihuhuh tbzpj hu klzlya Hlssv'`.\nالجواب:", "qhash": "543afa326a8b3431"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert scaled_powers(6) == 18200", "assert scaled_powers(3) == 784", "assert scaled_powers(5) == 7832", "assert scaled_powers(9) == 122664", "assert scaled_powers(7) == 37408", "assert scaled_powers(1) == 8", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 18200\nassert scaled_powers(3) == 784\nassert scaled_powers(5) == 7832\nassert scaled_powers(9) == 122664\nassert scaled_powers(7) == 37408\nassert scaled_powers(1) == 8\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(6)` يُرجع `18200`.\nالجواب:", "qhash": "191253c432dba70a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([43, 24, 42, -21]) == 42", "assert top_divisible([-12, -24, -18]) == -12", "assert top_divisible([1, 7, 13]) == None", "assert top_divisible([-36, -22, -9]) == -36", "assert top_divisible([26, -27, 8, 41, -38]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([43, 24, 42, -21]) == 42\nassert top_divisible([-12, -24, -18]) == -12\nassert top_divisible([1, 7, 13]) == None\nassert top_divisible([-36, -22, -9]) == -36\nassert top_divisible([26, -27, 8, 41, -38]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef top_divisible(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([43, 24, 42, -21])` يُرجع `42`.\nالجواب:", "qhash": "d6ebf2876806d0e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 21)", "tests": ["assert filter_range([9, 14, 11, 20, 10, 17, 18, 16]) == [10, 11, 14, 16, 17, 18, 20]", "assert filter_range([31, 28, 42, -26, 26, 13, 55, 20]) == [13, 20]", "assert filter_range([-6, 37, 51, 45, -13, -17, -4, -6]) == []", "assert filter_range([-26, 20, 0, 24]) == [20]", "assert filter_range([45]) == []", "assert filter_range([-30, -18, -13, 19, 36]) == [19]", "assert filter_range([6, 58]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([9, 14, 11, 20, 10, 17, 18, 16]) == [10, 11, 14, 16, 17, 18, 20]\nassert filter_range([31, 28, 42, -26, 26, 13, 55, 20]) == [13, 20]\nassert filter_range([-6, 37, 51, 45, -13, -17, -4, -6]) == []\nassert filter_range([-26, 20, 0, 24]) == [20]\nassert filter_range([45]) == []\nassert filter_range([-30, -18, -13, 19, 36]) == [19]\nassert filter_range([6, 58]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 21)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 21)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 10 ≤ x ≤ 21، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([9, 14, 11, 20, 10, 17, 18, 16])` يُرجع `[10, 11, 14, 16, 17, 18, 20]`.\nالجواب:", "qhash": "b4805f7b45be3220"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'gnst'}", "tests": ["assert count_chars('we') == {'g': 0, 'n': 0, 's': 0, 't': 0}", "assert count_chars('orange in orange at signal table') == {'g': 3, 'n': 4, 's': 1, 't': 2}", "assert count_chars('an camel on') == {'g': 0, 'n': 2, 's': 0, 't': 0}", "assert count_chars('garden by desert apple of') == {'g': 1, 'n': 1, 's': 1, 't': 1}", "assert count_chars('a go banana to') == {'g': 1, 'n': 2, 's': 0, 't': 1}", "assert count_chars('brain it up') == {'g': 0, 'n': 1, 's': 0, 't': 1}", "assert count_chars('') == {'g': 0, 'n': 0, 's': 0, 't': 0}"], "test_code": "assert count_chars('we') == {'g': 0, 'n': 0, 's': 0, 't': 0}\nassert count_chars('orange in orange at signal table') == {'g': 3, 'n': 4, 's': 1, 't': 2}\nassert count_chars('an camel on') == {'g': 0, 'n': 2, 's': 0, 't': 0}\nassert count_chars('garden by desert apple of') == {'g': 1, 'n': 1, 's': 1, 't': 1}\nassert count_chars('a go banana to') == {'g': 1, 'n': 2, 's': 0, 't': 1}\nassert count_chars('brain it up') == {'g': 0, 'n': 1, 's': 0, 't': 1}\nassert count_chars('') == {'g': 0, 'n': 0, 's': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'gnst'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'gnst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'n'، 's'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('we')` يجب أن تُرجع `{'g': 0, 'n': 0, 's': 0, 't': 0}`.\nالجواب:", "qhash": "7b7a3de9e2f9b10f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "tests": ["assert sum_terms(3) == 2484", "assert sum_terms(14) == 13858425", "assert sum_terms(13) == 9018009", "assert sum_terms(5) == 39825", "assert sum_terms(10) == 1987425", "assert sum_terms(1) == 9", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 2484\nassert sum_terms(14) == 13858425\nassert sum_terms(13) == 9018009\nassert sum_terms(5) == 39825\nassert sum_terms(10) == 1987425\nassert sum_terms(1) == 9\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(3)` يُرجع `2484`.\nالجواب:", "qhash": "51689d6b341edb63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(936690463))\nprint(go(go(936690463)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(936690463))\nprint(go(go(936690463)))\n```\nالجواب:", "qhash": "660b22fab9cbea4e", "answer": "46\n10", "completion": " الناتج:\n```text\n46\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(188) == 3645", "assert multiples_total(128) == 1773", "assert multiples_total(38) == 177", "assert multiples_total(96) == 889", "assert multiples_total(137) == 2038", "assert multiples_total(95) == 889", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(188) == 3645\nassert multiples_total(128) == 1773\nassert multiples_total(38) == 177\nassert multiples_total(96) == 889\nassert multiples_total(137) == 2038\nassert multiples_total(95) == 889\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 12، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(188)` يُرجع `3645`.\nالجواب:", "qhash": "95dcd9a610addee7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 9 == 0)", "tests": ["assert total_multiples(212) == 7455", "assert total_multiples(15) == 30", "assert total_multiples(254) == 10710", "assert total_multiples(45) == 315", "assert total_multiples(150) == 3675", "assert total_multiples(277) == 12834", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(212) == 7455\nassert total_multiples(15) == 30\nassert total_multiples(254) == 10710\nassert total_multiples(45) == 315\nassert total_multiples(150) == 3675\nassert total_multiples(277) == 12834\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 % 9 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(212)` يُرجع `7455`.\nالجواب:", "qhash": "4038473b199aea40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'هشام': 3, 'ليلى': 46, 'زينب': 22, 'فيصل': 27, 'علي': 26}\nscores['هشام'] += 1\nscores['عمر'] = 51\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 = {'هشام': 3, 'ليلى': 46, 'زينب': 22, 'فيصل': 27, 'علي': 26}\nscores['هشام'] += 1\nscores['عمر'] = 51\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": "a4c0f13e33388daa", "answer": "6\nعمر\n176\n[('هشام', 4), ('زينب', 22)]", "completion": " الناتج:\n```text\n6\nعمر\n176\n[('هشام', 4), ('زينب', 22)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 7)", "tests": ["assert filter_range([16, -9, -1, -3, 3]) == [-3, 1, 3, 9]", "assert filter_range([-12, 30, 58, -4, 48, 39]) == [4]", "assert filter_range([38, 2, -21, 22, -27, -17, 28, -8]) == [-2, 8]", "assert filter_range([28, 44, -1, 23, 44, 14]) == [1]", "assert filter_range([36, 26]) == []", "assert filter_range([4, 27, 33, 42]) == [-4]", "assert filter_range([54, 37, -17, 9, -12, -11, 38, 24, 26]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([16, -9, -1, -3, 3]) == [-3, 1, 3, 9]\nassert filter_range([-12, 30, 58, -4, 48, 39]) == [4]\nassert filter_range([38, 2, -21, 22, -27, -17, 28, -8]) == [-2, 8]\nassert filter_range([28, 44, -1, 23, 44, 14]) == [1]\nassert filter_range([36, 26]) == []\nassert filter_range([4, 27, 33, 42]) == [-4]\nassert filter_range([54, 37, -17, 9, -12, -11, 38, 24, 26]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 7)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -9 ≤ x ≤ 7، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([16, -9, -1, -3, 3])` يُرجع `[-3, 1, 3, 9]`.\nالجواب:", "qhash": "e574bddbd647a0c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'علم عربية'\nprint(len(w))\nprint(len(w.replace(' ', '')))\nprint(w.count('م'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'علم عربية'\nprint(len(w))\nprint(len(w.replace(' ', '')))\nprint(w.count('م'))\n```\nالجواب:", "qhash": "3c3f9e9f91060b85", "answer": "9\n8\n1", "completion": " الناتج:\n```text\n9\n8\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('garden code vector') == 'vpgstc rdst ktridg'", "assert caesar('to') == 'id'", "assert caesar('summer at') == 'hjbbtg pi'", "assert caesar('apple') == 'peeat'", "assert caesar('on') == 'dc'", "assert caesar('vector coffee go winter matrix') == 'ktridg rduutt vd lxcitg bpigxm'", "assert caesar('') == ''"], "test_code": "assert caesar('garden code vector') == 'vpgstc rdst ktridg'\nassert caesar('to') == 'id'\nassert caesar('summer at') == 'hjbbtg pi'\nassert caesar('apple') == 'peeat'\nassert caesar('on') == 'dc'\nassert caesar('vector coffee go winter matrix') == 'ktridg rduutt vd lxcitg bpigxm'\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 + (-11)) % 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 + (-11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('garden code vector')` يُرجع `'vpgstc rdst ktridg'`.\nالجواب:", "qhash": "d7abe3aa29477ef4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(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 cumulative([24, 46, 29, 23, 20, 53]) == [24, 70, 99, 0, 20, 73]", "assert cumulative([1, 113, 90, 2, 5]) == [1, 0, 90, 92, 97]", "assert cumulative([16, 79, 68, 21, 45, 105, 23]) == [16, 95, 0, 21, 66, 0, 23]", "assert cumulative([91, 63, 20, 106, 97, 62, 50, 81, -6, 90]) == [91, 0, 20, 0, 97, 0, 50, 0, -6, 84]", "assert cumulative([109]) == [109]", "assert cumulative([20, 25, 86, 64, 81, 32, 70, 57, 51, 56]) == [20, 45, 0, 64, 0, 32, 102, 0, 51, 107]", "assert cumulative([]) == []"], "test_code": "assert cumulative([24, 46, 29, 23, 20, 53]) == [24, 70, 99, 0, 20, 73]\nassert cumulative([1, 113, 90, 2, 5]) == [1, 0, 90, 92, 97]\nassert cumulative([16, 79, 68, 21, 45, 105, 23]) == [16, 95, 0, 21, 66, 0, 23]\nassert cumulative([91, 63, 20, 106, 97, 62, 50, 81, -6, 90]) == [91, 0, 20, 0, 97, 0, 50, 0, -6, 84]\nassert cumulative([109]) == [109]\nassert cumulative([20, 25, 86, 64, 81, 32, 70, 57, 51, 56]) == [20, 45, 0, 64, 0, 32, 102, 0, 51, 107]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 113 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([24, 46, 29, 23, 20, 53])` يجب أن تُرجع `[24, 70, 99, 0, 20, 73]`.\nالجواب:", "qhash": "93105148e30133ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('صحراء شجرة دفتر سوق سماء تفاحة نور') == 1", "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('صحراء شجرة دفتر سوق سماء تفاحة نور') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «د»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('باب معلم رمل قهوة')` يُرجع `0`.\nالجواب:", "qhash": "224273a8f616d758"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 3:\n return 4\n return 2 * calc(n - 1) + 2\n\nprint(calc(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 3:\n return 4\n return 2 * calc(n - 1) + 2\n\nprint(calc(13))\n```\nالجواب:", "qhash": "0f44e215807c8543", "answer": "6142", "completion": " الناتج:\n```text\n6142\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 69:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([15, 10, 24, 28, 8, 34]) == [15, 25, 49, 0, 8, 42]", "assert acc_reset([45, 61, -9, 18, 55, 3, 3, -10]) == [45, 0, -9, 9, 64, 67, 0, -10]", "assert acc_reset([51, 38]) == [51, 0]", "assert acc_reset([28, 8, 30, 14, 60, 69, 50, 7]) == [28, 36, 66, 0, 60, 0, 50, 57]", "assert acc_reset([3]) == [3]", "assert acc_reset([11, -9, -10, 64, 29, 11, 32, 21, 64]) == [11, 2, -8, 56, 0, 11, 43, 64, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([15, 10, 24, 28, 8, 34]) == [15, 25, 49, 0, 8, 42]\nassert acc_reset([45, 61, -9, 18, 55, 3, 3, -10]) == [45, 0, -9, 9, 64, 67, 0, -10]\nassert acc_reset([51, 38]) == [51, 0]\nassert acc_reset([28, 8, 30, 14, 60, 69, 50, 7]) == [28, 36, 66, 0, 60, 0, 50, 57]\nassert acc_reset([3]) == [3]\nassert acc_reset([11, -9, -10, 64, 29, 11, 32, 21, 64]) == [11, 2, -8, 56, 0, 11, 43, 64, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 69:\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 > 69:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 69 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([15, 10, 24, 28, 8, 34])` يجب أن تُرجع `[15, 25, 49, 0, 8, 42]`.\nالجواب:", "qhash": "28165e8d216314ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('برمجة يمل سيارة يمل') == 2", "assert count_prefix('يمل جبل يمل مكتبة حديقة ميناء مطر') == 2", "assert count_prefix('ليل سوق سيارة قهوة مدينة عمل') == 0", "assert count_prefix('بحر نهار') == 0", "assert count_prefix('عربية طائرة يمل شمس شمس لغة قلم') == 1", "assert count_prefix('قهوة حصان ليل طالب') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('برمجة يمل سيارة يمل') == 2\nassert count_prefix('يمل جبل يمل مكتبة حديقة ميناء مطر') == 2\nassert count_prefix('ليل سوق سيارة قهوة مدينة عمل') == 0\nassert count_prefix('بحر نهار') == 0\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('برمجة يمل سيارة يمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "07721f4e8eefc6d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 92", "tests": ["assert digit_score(62524) == 1", "assert digit_score(866712) == 90", "assert digit_score(103829) == 83", "assert digit_score(721465) == 87", "assert digit_score(286121) == 90", "assert digit_score(768994) == 11", "assert digit_score(452793) == 4", "assert digit_score(0) == 0"], "test_code": "assert digit_score(62524) == 1\nassert digit_score(866712) == 90\nassert digit_score(103829) == 83\nassert digit_score(721465) == 87\nassert digit_score(286121) == 90\nassert digit_score(768994) == 11\nassert digit_score(452793) == 4\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 92", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 92\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 92.\nمثال: `digit_score(62524)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "379ee412dcb47f44"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 40) == 1)", "tests": ["assert phi_upto(80) == 32", "assert phi_upto(120) == 48", "assert phi_upto(32) == 13", "assert phi_upto(12) == 5", "assert phi_upto(16) == 6", "assert phi_upto(82) == 33", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(80) == 32\nassert phi_upto(120) == 48\nassert phi_upto(32) == 13\nassert phi_upto(12) == 5\nassert phi_upto(16) == 6\nassert phi_upto(82) == 33\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, 40) == 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, 40) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 40) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(80)` يُرجع `32`.\nالجواب:", "qhash": "4fa0b3cda90bc809"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67", "tests": ["assert dig_pow_mod(36075) == 12", "assert dig_pow_mod(865823) == 64", "assert dig_pow_mod(484646) == 3", "assert dig_pow_mod(646470) == 36", "assert dig_pow_mod(227175) == 21", "assert dig_pow_mod(681967) == 26", "assert dig_pow_mod(585236) == 35", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(36075) == 12\nassert dig_pow_mod(865823) == 64\nassert dig_pow_mod(484646) == 3\nassert dig_pow_mod(646470) == 36\nassert dig_pow_mod(227175) == 21\nassert dig_pow_mod(681967) == 26\nassert dig_pow_mod(585236) == 35\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 67.\nمثال: `dig_pow_mod(36075)` يجب أن تُرجع `12`.\nالجواب:", "qhash": "7fab33defb6067b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 3 for x in xs if 1 <= x <= 14)", "tests": ["assert between_times([19, -5, 13, 10, 6, -8, -8]) == [18, 30, 39]", "assert between_times([-11, -19, 31, 46, -18]) == []", "assert between_times([]) == []", "assert between_times([30, 36, -25]) == []", "assert between_times([44, 55, -24]) == []", "assert between_times([-21, 28]) == []", "assert between_times([7, 1, 6, 36, 58, 18, 46, 0, -16, -30]) == [3, 18, 21]", "assert between_times([]) == []"], "test_code": "assert between_times([19, -5, 13, 10, 6, -8, -8]) == [18, 30, 39]\nassert between_times([-11, -19, 31, 46, -18]) == []\nassert between_times([]) == []\nassert between_times([30, 36, -25]) == []\nassert between_times([44, 55, -24]) == []\nassert between_times([-21, 28]) == []\nassert between_times([7, 1, 6, 36, 58, 18, 46, 0, -16, -30]) == [3, 18, 21]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 3 for x in xs if 1 <= x <= 14)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 3 for x in xs if 1 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 1 و14 (شاملًا الطرفين) في 3.\nمثال: `between_times([19, -5, 13, 10, 6, -8, -8])` يجب أن تُرجع `[18, 30, 39]`.\nالجواب:", "qhash": "ef98ac39f9ec174c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert game(22) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22']", "assert game(1) == ['1']", "assert game(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13']", "assert game(16) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz']", "assert game(24) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz']"], "test_code": "assert game(22) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22']\nassert game(1) == ['1']\nassert game(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13']\nassert game(16) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz']\nassert game(24) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22', '23', 'FizzBuzz']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\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 % 4 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(22)` يُرجع `['1', '2', '3', 'Fizz', '5', '6', '7', 'FizzBuzz', '9', '10', '11', 'Fizz', '13', '14', '15', 'FizzBuzz', '17', '18', '19', 'Fizz', '21', '22']`.\nالجواب:", "qhash": "1b99a14f68c44e92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_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 best_multiple([-10, 33, 7, -9, -25, 19, 43, 52, 24]) == 7", "assert best_multiple([-28, -28, -7]) == -7", "assert best_multiple([1]) == None", "assert best_multiple([-34, -8, -14, 33, 0, -10, -12, -9, 24]) == 0", "assert best_multiple([30, 27, -40, -48, -35, 21, -8, -45]) == 21", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-10, 33, 7, -9, -25, 19, 43, 52, 24]) == 7\nassert best_multiple([-28, -28, -7]) == -7\nassert best_multiple([1]) == None\nassert best_multiple([-34, -8, -14, 33, 0, -10, -12, -9, 24]) == 0\nassert best_multiple([30, 27, -40, -48, -35, 21, -8, -45]) == 21\nassert best_multiple([]) == None", "answer": "def best_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 best_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 best_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 best_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مثال: `best_multiple([-10, 33, 7, -9, -25, 19, 43, 52, 24])` يجب أن تُرجع `7`.\nالجواب:", "qhash": "d45f983a2c8281cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 393\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 = 393\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": "8040f1c70d509bfd", "answer": "58", "completion": " الناتج:\n```text\n58\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert turn_list([36, 41, 3, 32, 28, 16, 40, 45]) == [36, 41, 3, 32, 28, 16, 40, 45]", "assert turn_list([6, 43, 19, 47, 42, 20, 25, 16, 11, 41, 32, 24]) == [11, 41, 32, 24, 6, 43, 19, 47, 42, 20, 25, 16]", "assert turn_list([-3, 6, -1, 14, 43, 13, 12, -1, 40, 31, 24]) == [12, -1, 40, 31, 24, -3, 6, -1, 14, 43, 13]", "assert turn_list([34, 35]) == [34, 35]", "assert turn_list([-2, 6, -4, -6, 2, 0, 49, 18, 0, 39, -1]) == [49, 18, 0, 39, -1, -2, 6, -4, -6, 2, 0]", "assert turn_list([38, 4, 19, -3]) == [38, 4, 19, -3]", "assert turn_list([]) == []"], "test_code": "assert turn_list([36, 41, 3, 32, 28, 16, 40, 45]) == [36, 41, 3, 32, 28, 16, 40, 45]\nassert turn_list([6, 43, 19, 47, 42, 20, 25, 16, 11, 41, 32, 24]) == [11, 41, 32, 24, 6, 43, 19, 47, 42, 20, 25, 16]\nassert turn_list([-3, 6, -1, 14, 43, 13, 12, -1, 40, 31, 24]) == [12, -1, 40, 31, 24, -3, 6, -1, 14, 43, 13]\nassert turn_list([34, 35]) == [34, 35]\nassert turn_list([-2, 6, -4, -6, 2, 0, 49, 18, 0, 39, -1]) == [49, 18, 0, 39, -1, -2, 6, -4, -6, 2, 0]\nassert turn_list([38, 4, 19, -3]) == [38, 4, 19, -3]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 16 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([36, 41, 3, 32, 28, 16, 40, 45])` يُرجع `[36, 41, 3, 32, 28, 16, 40, 45]`.\nالجواب:", "qhash": "a1f90431aa07a1e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=8):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(f(13))\nprint(f(13, 9))\nprint(f(f(9), 13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=8):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(f(13))\nprint(f(13, 9))\nprint(f(f(9), 13))\n```\nالجواب:", "qhash": "a71e5b226471aba2", "answer": "109\n108\n644", "completion": " الناتج:\n```text\n109\n108\n644\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 31", "tests": ["assert multi_fact(11) == 14", "assert multi_fact(42) == 5", "assert multi_fact(49) == 12", "assert multi_fact(50) == 30", "assert multi_fact(10) == 27", "assert multi_fact(19) == 22", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(11) == 14\nassert multi_fact(42) == 5\nassert multi_fact(49) == 12\nassert multi_fact(50) == 30\nassert multi_fact(10) == 27\nassert multi_fact(19) == 22\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 31", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(11)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "451a4a2d0ad82fa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'hir'}", "tests": ["assert char_counts('code matrix garden at matrix') == {'h': 0, 'i': 2, 'r': 3}", "assert char_counts('falcon at') == {'h': 0, 'i': 0, 'r': 0}", "assert char_counts('by camel') == {'h': 0, 'i': 0, 'r': 0}", "assert char_counts('camel on rocket') == {'h': 0, 'i': 0, 'r': 1}", "assert char_counts('garden matrix to river matrix') == {'h': 0, 'i': 3, 'r': 5}", "assert char_counts('a go window winter coffee') == {'h': 0, 'i': 2, 'r': 1}", "assert char_counts('') == {'h': 0, 'i': 0, 'r': 0}"], "test_code": "assert char_counts('code matrix garden at matrix') == {'h': 0, 'i': 2, 'r': 3}\nassert char_counts('falcon at') == {'h': 0, 'i': 0, 'r': 0}\nassert char_counts('by camel') == {'h': 0, 'i': 0, 'r': 0}\nassert char_counts('camel on rocket') == {'h': 0, 'i': 0, 'r': 1}\nassert char_counts('garden matrix to river matrix') == {'h': 0, 'i': 3, 'r': 5}\nassert char_counts('a go window winter coffee') == {'h': 0, 'i': 2, 'r': 1}\nassert char_counts('') == {'h': 0, 'i': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'hir'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'hir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'h'، 'i'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('code matrix garden at matrix')` يُرجع `{'h': 0, 'i': 2, 'r': 3}`.\nالجواب:", "qhash": "ab4999800ffed908"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 65660\nc = 0\nwhile m > 8:\n m = m // 5\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 65660\nc = 0\nwhile m > 8:\n m = m // 5\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "c25c81f8604c7184", "answer": "4 6", "completion": " الناتج:\n```text\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * -1 + 8 for x in range(-5, 7) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * -1 + 8 for x in range(-5, 7) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "0b5e66422573e36d", "answer": "[13, 10, 7, 4]\n4 34", "completion": " الناتج:\n```text\n[13, 10, 7, 4]\n4 34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(146) == 2184", "assert mult_sum(30) == 84", "assert mult_sum(242) == 5889", "assert mult_sum(185) == 3330", "assert mult_sum(223) == 4960", "assert mult_sum(38) == 150", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(146) == 2184\nassert mult_sum(30) == 84\nassert mult_sum(242) == 5889\nassert mult_sum(185) == 3330\nassert mult_sum(223) == 4960\nassert mult_sum(38) == 150\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 10.\nمثال: `mult_sum(146)` يجب أن تُرجع `2184`.\nالجواب:", "qhash": "36026411225b6fe9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -3 * x ** 2 + (-7) * x + (-3)", "tests": ["assert value_at(8) == -251", "assert value_at(-9) == -183", "assert value_at(14) == -689", "assert value_at(10) == -373", "assert value_at(-16) == -659", "assert value_at(7) == -199", "assert value_at(8) == -251", "assert value_at(0) == -3"], "test_code": "assert value_at(8) == -251\nassert value_at(-9) == -183\nassert value_at(14) == -689\nassert value_at(10) == -373\nassert value_at(-16) == -659\nassert value_at(7) == -199\nassert value_at(8) == -251\nassert value_at(0) == -3", "answer": "def value_at(x):\n return -3 * x ** 2 + (-7) * x + (-3)", "completion": " ```python\ndef value_at(x):\n return -3 * x ** 2 + (-7) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -3x² - 7x - 3 عند العدد الصحيح x.\nمثال: `value_at(8)` يجب أن تُرجع `-251`.\nالجواب:", "qhash": "b0ec82b865725854"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('in cloud signal cloud light is on') == 'on|is|light|cloud|signal|cloud|in'", "assert rev_long_words('a rocket summer at') == 'at|summer|rocket'", "assert rev_long_words('desert table engine in apple an') == 'an|apple|in|engine|table|desert'", "assert rev_long_words('in code') == 'code|in'", "assert rev_long_words('a camel we cloud light') == 'light|cloud|we|camel'", "assert rev_long_words('banana table of') == 'of|table|banana'", "assert rev_long_words('river music signal winter light garden cloud python') == 'python|cloud|garden|light|winter|signal|music|river'"], "test_code": "assert rev_long_words('in cloud signal cloud light is on') == 'on|is|light|cloud|signal|cloud|in'\nassert rev_long_words('a rocket summer at') == 'at|summer|rocket'\nassert rev_long_words('desert table engine in apple an') == 'an|apple|in|engine|table|desert'\nassert rev_long_words('in code') == 'code|in'\nassert rev_long_words('a camel we cloud light') == 'light|cloud|we|camel'\nassert rev_long_words('banana table of') == 'of|table|banana'\nassert rev_long_words('river music signal winter light garden cloud python') == 'python|cloud|garden|light|winter|signal|music|river'", "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('in cloud signal cloud light is on')` يجب أن تُرجع `'on|is|light|cloud|signal|cloud|in'`.\nالجواب:", "qhash": "9221694a9f6cf18c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 18 <= x <= 51)", "tests": ["assert in_range_scaled([30, 59, 44, 20, 18, 24, 22, 26, 32, 12]) == [-176, -128, -120, -104, -96, -88, -80, -72]", "assert in_range_scaled([8, -22, 54, -17, -22, 23, 17, 0, -6]) == [-92]", "assert in_range_scaled([-7, 8, -17, 22, 24, 31]) == [-124, -96, -88]", "assert in_range_scaled([51]) == [-204]", "assert in_range_scaled([59]) == []", "assert in_range_scaled([-28, -27, -21, -25, -3, 9, 11, 2, -4]) == []", "assert in_range_scaled([47]) == [-188]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([30, 59, 44, 20, 18, 24, 22, 26, 32, 12]) == [-176, -128, -120, -104, -96, -88, -80, -72]\nassert in_range_scaled([8, -22, 54, -17, -22, 23, 17, 0, -6]) == [-92]\nassert in_range_scaled([-7, 8, -17, 22, 24, 31]) == [-124, -96, -88]\nassert in_range_scaled([51]) == [-204]\nassert in_range_scaled([59]) == []\nassert in_range_scaled([-28, -27, -21, -25, -3, 9, 11, 2, -4]) == []\nassert in_range_scaled([47]) == [-188]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 18 <= x <= 51)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -4 for x in xs if 18 <= x <= 51)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 18 و51 (شاملًا الطرفين) في -4.\nمثال: `in_range_scaled([30, 59, 44, 20, 18, 24, 22, 26, 32, 12])` يجب أن تُرجع `[-176, -128, -120, -104, -96, -88, -80, -72]`.\nالجواب:", "qhash": "8d669f43102fa90f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)", "tests": ["assert multiples_total(26) == 75", "assert multiples_total(228) == 5741", "assert multiples_total(258) == 7446", "assert multiples_total(124) == 1707", "assert multiples_total(120) == 1587", "assert multiples_total(109) == 1358", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(26) == 75\nassert multiples_total(228) == 5741\nassert multiples_total(258) == 7446\nassert multiples_total(124) == 1707\nassert multiples_total(120) == 1587\nassert multiples_total(109) == 1358\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 % 9 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 9.\nمثال: `multiples_total(26)` يجب أن تُرجع `75`.\nالجواب:", "qhash": "e4b87ef1bd9da98e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 14\nfor x in range(6, 23, 3):\n total += x * 3\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 14\nfor x in range(6, 23, 3):\n total += x * 3\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "a224f1f5f5bb8cfa", "answer": "257\n21", "completion": " الناتج:\n```text\n257\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(items):\n if not items:\n return []\n k = 18 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([37, 40, 35, 23]) == [35, 23, 37, 40]", "assert rotate_by([16, 18, 16, 9, 35, -3, 18]) == [9, 35, -3, 18, 16, 18, 16]", "assert rotate_by([8, -9]) == [8, -9]", "assert rotate_by([34, 40]) == [34, 40]", "assert rotate_by([45]) == [45]", "assert rotate_by([42, 50, 21, 13, 16, 1]) == [42, 50, 21, 13, 16, 1]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([37, 40, 35, 23]) == [35, 23, 37, 40]\nassert rotate_by([16, 18, 16, 9, 35, -3, 18]) == [9, 35, -3, 18, 16, 18, 16]\nassert rotate_by([8, -9]) == [8, -9]\nassert rotate_by([34, 40]) == [34, 40]\nassert rotate_by([45]) == [45]\nassert rotate_by([42, 50, 21, 13, 16, 1]) == [42, 50, 21, 13, 16, 1]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n if not items:\n return []\n k = 18 % 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 = 18 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(items):\n if not items:\n return []\n k = 18 % len(items)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([37, 40, 35, 23])` يُرجع `[35, 23, 37, 40]`.\nالجواب:", "qhash": "0723c1dbd624083b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "31b1cad71e2a5450"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -5 * x ** 2 + (7) * x + (-1)", "tests": ["assert p(2) == -7", "assert p(-1) == -13", "assert p(18) == -1495", "assert p(2) == -7", "assert p(20) == -1861", "assert p(-12) == -805", "assert p(-13) == -937", "assert p(0) == -1"], "test_code": "assert p(2) == -7\nassert p(-1) == -13\nassert p(18) == -1495\nassert p(2) == -7\nassert p(20) == -1861\nassert p(-12) == -805\nassert p(-13) == -937\nassert p(0) == -1", "answer": "def p(x):\n return -5 * x ** 2 + (7) * x + (-1)", "completion": " ```python\ndef p(x):\n return -5 * x ** 2 + (7) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -5x² + 7x - 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(2)` يُرجع `-7`.\nالجواب:", "qhash": "5adf61f5cae10c2c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('حديقة سفينة قلم وردة مطر سفينة') == 1", "assert count_in_text('حاسوب بحر') == 1", "assert count_in_text('جمل عربية وردة') == 1", "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('حديقة سفينة قلم وردة مطر سفينة') == 1\nassert count_in_text('حاسوب بحر') == 1\nassert count_in_text('جمل عربية وردة') == 1\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('حديقة سفينة قلم وردة مطر سفينة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "9e5d63303770bf24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(27) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red', '16', '17', 'Red', '19', '20', 'Red', 'Blue', '23', 'Red', '25', '26', 'Red']", "assert label_numbers(15) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red']", "assert label_numbers(15) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red']", "assert label_numbers(19) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red', '16', '17', 'Red', '19']", "assert label_numbers(12) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red']"], "test_code": "assert label_numbers(27) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red', '16', '17', 'Red', '19', '20', 'Red', 'Blue', '23', 'Red', '25', '26', 'Red']\nassert label_numbers(15) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red']\nassert label_numbers(15) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red']\nassert label_numbers(19) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red', '16', '17', 'Red', '19']\nassert label_numbers(12) == ['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 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 % 3 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(27)` يُرجع `['1', '2', 'Red', '4', '5', 'Red', '7', '8', 'Red', '10', 'Blue', 'Red', '13', '14', 'Red', '16', '17', 'Red', '19', '20', 'Red', 'Blue', '23', 'Red', '25', '26', 'Red']`.\nالجواب:", "qhash": "b8a286212ccdbde0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 26) == 1)", "tests": ["assert count_coprime(44) == 20", "assert count_coprime(75) == 35", "assert count_coprime(44) == 20", "assert count_coprime(168) == 78", "assert count_coprime(61) == 29", "assert count_coprime(84) == 39", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(44) == 20\nassert count_coprime(75) == 35\nassert count_coprime(44) == 20\nassert count_coprime(168) == 78\nassert count_coprime(61) == 29\nassert count_coprime(84) == 39\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, 26) == 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, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 26، أي أن القاسم المشترك الأكبر لها مع 26 يساوي 1.\nمثال: `count_coprime(44)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "9fcdcfaf339a4db7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([34, 28, 81, 34, 69, 31, 56]) == 1", "assert only_div([-13, 11]) == 0", "assert only_div([17, 70, 37, -33, 42, 72, 8, 29, 3, 24]) == 0", "assert only_div([-21, 57, 7, -23, -16, -4, 48]) == 0", "assert only_div([65]) == 0", "assert only_div([]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([34, 28, 81, 34, 69, 31, 56]) == 1\nassert only_div([-13, 11]) == 0\nassert only_div([17, 70, 37, -33, 42, 72, 8, 29, 3, 24]) == 0\nassert only_div([-21, 57, 7, -23, -16, -4, 48]) == 0\nassert only_div([65]) == 0\nassert only_div([]) == 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 % 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 % 9 == 0 and x % 4 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([34, 28, 81, 34, 69, 31, 56])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "c1ea8563f5411abc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 4 for x in range(3, 18) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 4 for x in range(3, 18) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "e55f85766bdefd06", "answer": "[5, 32, 77, 140, 221]\n5 475", "completion": " الناتج:\n```text\n[5, 32, 77, 140, 221]\n5 475\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 20 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert spin([44, 50, 7, 46, 1, 32, 39]) == [50, 7, 46, 1, 32, 39, 44]", "assert spin([-3, 3, 9, 29, 37, 18, 25, 46]) == [37, 18, 25, 46, -3, 3, 9, 29]", "assert spin([3, 38, 45, 22, 17]) == [3, 38, 45, 22, 17]", "assert spin([50, 1, 14, 5, -6]) == [50, 1, 14, 5, -6]", "assert spin([5, 49, 28, 46, 43, 46, 48, 19, 45, 20]) == [5, 49, 28, 46, 43, 46, 48, 19, 45, 20]", "assert spin([25, 18, 37, 40]) == [25, 18, 37, 40]", "assert spin([]) == []"], "test_code": "assert spin([44, 50, 7, 46, 1, 32, 39]) == [50, 7, 46, 1, 32, 39, 44]\nassert spin([-3, 3, 9, 29, 37, 18, 25, 46]) == [37, 18, 25, 46, -3, 3, 9, 29]\nassert spin([3, 38, 45, 22, 17]) == [3, 38, 45, 22, 17]\nassert spin([50, 1, 14, 5, -6]) == [50, 1, 14, 5, -6]\nassert spin([5, 49, 28, 46, 43, 46, 48, 19, 45, 20]) == [5, 49, 28, 46, 43, 46, 48, 19, 45, 20]\nassert spin([25, 18, 37, 40]) == [25, 18, 37, 40]\nassert spin([]) == []", "answer": "def spin(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 spin(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 spin(arr):\n if not arr:\n return []\n k = 20 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([44, 50, 7, 46, 1, 32, 39])` يُرجع `[50, 7, 46, 1, 32, 39, 44]`.\nالجواب:", "qhash": "9c975b571abf14a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ج')", "tests": ["assert count_letter('ليل معلم طالب جمل وردة سفينة قلم') == 1", "assert count_letter('') == 0", "assert count_letter('سفينة تفاحة سوق شجرة سماء وردة طالب كتاب') == 1", "assert count_letter('حصان سوق ليل معلم دفتر ميناء شجرة صحراء') == 1", "assert count_letter('طائرة نهار علم مدرسة سلام طالب ميناء') == 0", "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('سفينة تفاحة سوق شجرة سماء وردة طالب كتاب') == 1\nassert count_letter('حصان سوق ليل معلم دفتر ميناء شجرة صحراء') == 1\nassert count_letter('طائرة نهار علم مدرسة سلام طالب ميناء') == 0\nassert count_letter('نهر كتاب عربية') == 0\nassert count_letter('سوق نهار تفاحة باب مدرسة عربية صديق') == 0\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('ليل معلم طالب جمل وردة سفينة قلم')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "0883c6d7a4ed6df0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 21", "tests": ["assert digit_score(27267) == 15", "assert digit_score(214003) == 16", "assert digit_score(313794) == 15", "assert digit_score(311956) == 7", "assert digit_score(279890) == 11", "assert digit_score(764317) == 7", "assert digit_score(748204) == 4", "assert digit_score(0) == 0"], "test_code": "assert digit_score(27267) == 15\nassert digit_score(214003) == 16\nassert digit_score(313794) == 15\nassert digit_score(311956) == 7\nassert digit_score(279890) == 11\nassert digit_score(764317) == 7\nassert digit_score(748204) == 4\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 21", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 21\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 21.\nللتوضيح: الاستدعاء `digit_score(27267)` يُرجع `15`.\nالجواب:", "qhash": "e4daab891d91bc16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + -9 for x in range(6, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + -9 for x in range(6, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "b6fbb7db27f8748a", "answer": "[-9, -9]\n2 -18", "completion": " الناتج:\n```text\n[-9, -9]\n2 -18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'rocket'\nprint(len(text))\nprint(text[0:5])\nprint(text.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'rocket'\nprint(len(text))\nprint(text[0:5])\nprint(text.upper())\n```\nالجواب:", "qhash": "11893c09d991031c", "answer": "6\nrocke\nROCKET", "completion": " الناتج:\n```text\n6\nrocke\nROCKET\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate_by([39, 31, 35, 27]) == [39, 31, 35, 27]", "assert rotate_by([15, 6, 50, 14, 42, 37, 46, -1]) == [42, 37, 46, -1, 15, 6, 50, 14]", "assert rotate_by([15, 50, 1]) == [15, 50, 1]", "assert rotate_by([12, 23, 14, 25, 5, 25, 17, 19, -3, 31]) == [-3, 31, 12, 23, 14, 25, 5, 25, 17, 19]", "assert rotate_by([-1, 41, 15, 18, 3]) == [18, 3, -1, 41, 15]", "assert rotate_by([-3, 6, 49, 43, -4, 47, 7, 12, -2, 13, -3]) == [-3, -3, 6, 49, 43, -4, 47, 7, 12, -2, 13]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([39, 31, 35, 27]) == [39, 31, 35, 27]\nassert rotate_by([15, 6, 50, 14, 42, 37, 46, -1]) == [42, 37, 46, -1, 15, 6, 50, 14]\nassert rotate_by([15, 50, 1]) == [15, 50, 1]\nassert rotate_by([12, 23, 14, 25, 5, 25, 17, 19, -3, 31]) == [-3, 31, 12, 23, 14, 25, 5, 25, 17, 19]\nassert rotate_by([-1, 41, 15, 18, 3]) == [18, 3, -1, 41, 15]\nassert rotate_by([-3, 6, 49, 43, -4, 47, 7, 12, -2, 13, -3]) == [-3, -3, 6, 49, 43, -4, 47, 7, 12, -2, 13]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return ____\n```\nمثال: `rotate_by([39, 31, 35, 27])` يجب أن تُرجع `[39, 31, 35, 27]`.\nالجواب:", "qhash": "9fabe7ffad2a1668"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'amo'}", "tests": ["assert letter_stats('python up') == {'a': 0, 'm': 0, 'o': 1}", "assert letter_stats('vector') == {'a': 0, 'm': 0, 'o': 1}", "assert letter_stats('river on camel code table orange') == {'a': 3, 'm': 1, 'o': 3}", "assert letter_stats('engine falcon window desert') == {'a': 1, 'm': 0, 'o': 2}", "assert letter_stats('in light to desert code planet') == {'a': 1, 'm': 0, 'o': 2}", "assert letter_stats('signal garden python cloud') == {'a': 2, 'm': 0, 'o': 2}", "assert letter_stats('') == {'a': 0, 'm': 0, 'o': 0}"], "test_code": "assert letter_stats('python up') == {'a': 0, 'm': 0, 'o': 1}\nassert letter_stats('vector') == {'a': 0, 'm': 0, 'o': 1}\nassert letter_stats('river on camel code table orange') == {'a': 3, 'm': 1, 'o': 3}\nassert letter_stats('engine falcon window desert') == {'a': 1, 'm': 0, 'o': 2}\nassert letter_stats('in light to desert code planet') == {'a': 1, 'm': 0, 'o': 2}\nassert letter_stats('signal garden python cloud') == {'a': 2, 'm': 0, 'o': 2}\nassert letter_stats('') == {'a': 0, 'm': 0, 'o': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'amo'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'amo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'm'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('python up')` يجب أن تُرجع `{'a': 0, 'm': 0, 'o': 1}`.\nالجواب:", "qhash": "8c45a4e19cfeb876"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert roll([4, 40, 48, 1]) == [48, 1, 4, 40]", "assert roll([24, 14, 28]) == [14, 28, 24]", "assert roll([-7, 48]) == [-7, 48]", "assert roll([19]) == [19]", "assert roll([19, 44, 3, 39, 7, 41, -3, 13, 44, 4]) == [19, 44, 3, 39, 7, 41, -3, 13, 44, 4]", "assert roll([37, 2, 21, 20]) == [21, 20, 37, 2]", "assert roll([]) == []"], "test_code": "assert roll([4, 40, 48, 1]) == [48, 1, 4, 40]\nassert roll([24, 14, 28]) == [14, 28, 24]\nassert roll([-7, 48]) == [-7, 48]\nassert roll([19]) == [19]\nassert roll([19, 44, 3, 39, 7, 41, -3, 13, 44, 4]) == [19, 44, 3, 39, 7, 41, -3, 13, 44, 4]\nassert roll([37, 2, 21, 20]) == [21, 20, 37, 2]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([4, 40, 48, 1])` يُرجع `[48, 1, 4, 40]`.\nالجواب:", "qhash": "b85c91622ea568d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "tests": ["assert sum_powers(6) == 97608", "assert sum_powers(15) == 18393600", "assert sum_powers(9) == 966600", "assert sum_powers(5) == 35400", "assert sum_powers(7) == 232064", "assert sum_powers(1) == 8", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 97608\nassert sum_powers(15) == 18393600\nassert sum_powers(9) == 966600\nassert sum_powers(5) == 35400\nassert sum_powers(7) == 232064\nassert sum_powers(1) == 8\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(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 sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 8 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `97608`.\nالجواب:", "qhash": "aeeb6f33dda96e8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 10007", "tests": ["assert mfact(5) == 10", "assert mfact(17) == 9300", "assert mfact(54) == 3872", "assert mfact(44) == 3139", "assert mfact(13) == 3640", "assert mfact(52) == 368", "assert mfact(0) == 1"], "test_code": "assert mfact(5) == 10\nassert mfact(17) == 9300\nassert mfact(54) == 3872\nassert mfact(44) == 3139\nassert mfact(13) == 3640\nassert mfact(52) == 368\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 10007", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(5)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "a919e945234fcf1e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('planet light in falcon music OK') == 'zvkxod vsqrd sx pkvmyx wecsm OK'", "assert shift_letters('a vector brain 2024') == 'k fomdyb lbksx 2024'", "assert shift_letters('up garden garden winter') == 'ez qkbnox qkbnox gsxdob'", "assert shift_letters('winter an apple') == 'gsxdob kx kzzvo'", "assert shift_letters('summer on data A1') == 'cewwob yx nkdk A1'", "assert shift_letters('planet at') == 'zvkxod kd'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet light in falcon music OK') == 'zvkxod vsqrd sx pkvmyx wecsm OK'\nassert shift_letters('a vector brain 2024') == 'k fomdyb lbksx 2024'\nassert shift_letters('up garden garden winter') == 'ez qkbnox qkbnox gsxdob'\nassert shift_letters('winter an apple') == 'gsxdob kx kzzvo'\nassert shift_letters('summer on data A1') == 'cewwob yx nkdk A1'\nassert shift_letters('planet at') == 'zvkxod kd'\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 + (-16)) % 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 + (-16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('planet light in falcon music OK')` يُرجع `'zvkxod vsqrd sx pkvmyx wecsm OK'`.\nالجواب:", "qhash": "f62c120257cf2fdf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 23758\nc = 0\nwhile m > 0:\n m = m // 8\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 23758\nc = 0\nwhile m > 0:\n m = m // 8\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "a44cb16396e254ff", "answer": "0 5", "completion": " الناتج:\n```text\n0 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=5):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(12))\nprint(compute(12, 9))\nprint(compute(compute(9), 12))", "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(12))\nprint(compute(12, 9))\nprint(compute(compute(9), 12))\n```\nالجواب:", "qhash": "0aaec04e52ac7b7d", "answer": "31\n27\n54", "completion": " الناتج:\n```text\n31\n27\n54\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'مريم': 40, 'زينب': 18, 'هشام': 12, 'عمر': 43}\npoints['مريم'] += 5\npoints['منى'] = 25\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'مريم': 40, 'زينب': 18, 'هشام': 12, 'عمر': 43}\npoints['مريم'] += 5\npoints['منى'] = 25\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 25])\n```\nالجواب:", "qhash": "b6a2db456512d088", "answer": "5\nمريم\n143\n['مريم', 'عمر']", "completion": " الناتج:\n```text\n5\nمريم\n143\n['مريم', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'banana'\nprint(s.index('b') + len(s))\nprint(s.upper())\nprint(s.replace('b', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'banana'\nprint(s.index('b') + len(s))\nprint(s.upper())\nprint(s.replace('b', '#'))\n```\nالجواب:", "qhash": "181c0c40118a59ea", "answer": "6\nBANANA\n#anana", "completion": " الناتج:\n```text\n6\nBANANA\n#anana\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 41", "tests": ["assert digits_mod(74770) == 40", "assert digits_mod(673292) == 19", "assert digits_mod(250757) == 29", "assert digits_mod(594895) == 5", "assert digits_mod(856746) == 21", "assert digits_mod(647554) == 3", "assert digits_mod(990102) == 3", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(74770) == 40\nassert digits_mod(673292) == 19\nassert digits_mod(250757) == 29\nassert digits_mod(594895) == 5\nassert digits_mod(856746) == 21\nassert digits_mod(647554) == 3\nassert digits_mod(990102) == 3\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 41", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 41.\nللتوضيح: الاستدعاء `digits_mod(74770)` يُرجع `40`.\nالجواب:", "qhash": "c65e4fef7525b901"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [8, -5, 39, -4, 34, 1, 26, 6, 31]\nprint(nums[2:6])\nprint(nums[::-2])\nprint(max(nums[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [8, -5, 39, -4, 34, 1, 26, 6, 31]\nprint(nums[2:6])\nprint(nums[::-2])\nprint(max(nums[2:6]))\n```\nالجواب:", "qhash": "1bee515d30c67a0a", "answer": "[39, -4, 34, 1]\n[31, 26, 34, 39, 8]\n39", "completion": " الناتج:\n```text\n[39, -4, 34, 1]\n[31, 26, 34, 39, 8]\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=1):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(-2))\nprint(compute(-2, 3))\nprint(compute(compute(3), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(-2))\nprint(compute(-2, 3))\nprint(compute(compute(3), -2))\n```\nالجواب:", "qhash": "bcca4e53d191365c", "answer": "6\n22\n186", "completion": " الناتج:\n```text\n6\n22\n186\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(7))\nprint(calc(7, 5))\nprint(calc(calc(5), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(7))\nprint(calc(7, 5))\nprint(calc(calc(5), 7))\n```\nالجواب:", "qhash": "451509b60558e9f8", "answer": "-41\n-40\n-60", "completion": " الناتج:\n```text\n-41\n-40\n-60\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'عمر': 38, 'علي': 17, 'هشام': 14, 'رنا': 49}\nd['عمر'] += 14\nd['نور'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 22])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'عمر': 38, 'علي': 17, 'هشام': 14, 'رنا': 49}\nd['عمر'] += 14\nd['نور'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 22])\n```\nالجواب:", "qhash": "83400874d2c3a058", "answer": "5\nعمر\n178\n['عمر', 'رنا', 'نور']", "completion": " الناتج:\n```text\n5\nعمر\n178\n['عمر', 'رنا', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 1 for x in xs if 3 <= x <= 33)", "tests": ["assert in_range_scaled([13, 38, 8, 32, 40, -2, 10, -1, 8, 16]) == [8, 8, 10, 13, 16, 32]", "assert in_range_scaled([17, 41, 24, 10, -17, 50, 4, 30, 28, 21]) == [4, 10, 17, 21, 24, 28, 30]", "assert in_range_scaled([39, 19, 35, -30, -14, 60, -26, 30]) == [19, 30]", "assert in_range_scaled([38]) == []", "assert in_range_scaled([43, -25]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([53, -25]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([13, 38, 8, 32, 40, -2, 10, -1, 8, 16]) == [8, 8, 10, 13, 16, 32]\nassert in_range_scaled([17, 41, 24, 10, -17, 50, 4, 30, 28, 21]) == [4, 10, 17, 21, 24, 28, 30]\nassert in_range_scaled([39, 19, 35, -30, -14, 60, -26, 30]) == [19, 30]\nassert in_range_scaled([38]) == []\nassert in_range_scaled([43, -25]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([53, -25]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 1 for x in xs if 3 <= x <= 33)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 1 for x in xs if 3 <= x <= 33)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 3 ≤ x ≤ 33، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([13, 38, 8, 32, 40, -2, 10, -1, 8, 16])` يُرجع `[8, 8, 10, 13, 16, 32]`.\nالجواب:", "qhash": "88e4a0cf6b22b892"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('to to coffee window on') == 'cx cx lxoonn frwmxf xw'", "assert decode('to 2024') == 'cx 2024'", "assert decode('at falcon pixel signal') == 'jc ojulxw yrgnu brpwju'", "assert decode('by camel brain a of') == 'kh ljvnu kajrw j xo'", "assert decode('planet Hello') == 'yujwnc Hnuux'", "assert decode('data summer matrix vector rocket !') == 'mjcj bdvvna vjcarg enlcxa axltnc !'", "assert decode('') == ''"], "test_code": "assert decode('to to coffee window on') == 'cx cx lxoonn frwmxf xw'\nassert decode('to 2024') == 'cx 2024'\nassert decode('at falcon pixel signal') == 'jc ojulxw yrgnu brpwju'\nassert decode('by camel brain a of') == 'kh ljvnu kajrw j xo'\nassert decode('planet Hello') == 'yujwnc Hnuux'\nassert decode('data summer matrix vector rocket !') == 'mjcj bdvvna vjcarg enlcxa axltnc !'\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 + (-17)) % 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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('to to coffee window on')` يُرجع `'cx cx lxoonn frwmxf xw'`.\nالجواب:", "qhash": "f3f6a3163e775777"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(-1, 7))", "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(-1, 7))\n```\nالجواب:", "qhash": "512c60df031fe199", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 5 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(8) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8']", "assert game(5) == ['1', '2', 'Sun', '4', 'Moon']", "assert game(4) == ['1', '2', 'Sun', '4']", "assert game(5) == ['1', '2', 'Sun', '4', 'Moon']", "assert game(14) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14']"], "test_code": "assert game(8) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8']\nassert game(5) == ['1', '2', 'Sun', '4', 'Moon']\nassert game(4) == ['1', '2', 'Sun', '4']\nassert game(5) == ['1', '2', 'Sun', '4', 'Moon']\nassert game(14) == ['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8', 'Sun', 'Moon', '11', 'Sun', '13', '14']", "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 % 5 == 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 % 5 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Sun'، وإن قَبِلها على 5 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(8)` يُرجع `['1', '2', 'Sun', '4', 'Moon', 'Sun', '7', '8']`.\nالجواب:", "qhash": "588eed927e2ad901"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(24) == 54", "assert multiples_total(152) == 2328", "assert multiples_total(54) == 278", "assert multiples_total(161) == 2640", "assert multiples_total(136) == 1758", "assert multiples_total(237) == 5640", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(24) == 54\nassert multiples_total(152) == 2328\nassert multiples_total(54) == 278\nassert multiples_total(161) == 2640\nassert multiples_total(136) == 1758\nassert multiples_total(237) == 5640\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 % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 10.\nمثال: `multiples_total(24)` يجب أن تُرجع `54`.\nالجواب:", "qhash": "6ed65be5b0c60300"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 4 for x in xs if -9 <= x <= 3)", "tests": ["assert select_range([-14, -11, -5, -3, -17, 12, 10, -10, 13]) == [-20, -12]", "assert select_range([8, 44]) == []", "assert select_range([-12, 7, 13]) == []", "assert select_range([-15, 47, -12, 2, 19, 24]) == [8]", "assert select_range([-27, -16, 38, 46, 5, 29, 45, -22, -4]) == [-16]", "assert select_range([13, 39]) == []", "assert select_range([-30, 57, 53, 1, 12, -10, -29]) == [4]", "assert select_range([]) == []"], "test_code": "assert select_range([-14, -11, -5, -3, -17, 12, 10, -10, 13]) == [-20, -12]\nassert select_range([8, 44]) == []\nassert select_range([-12, 7, 13]) == []\nassert select_range([-15, 47, -12, 2, 19, 24]) == [8]\nassert select_range([-27, -16, 38, 46, 5, 29, 45, -22, -4]) == [-16]\nassert select_range([13, 39]) == []\nassert select_range([-30, 57, 53, 1, 12, -10, -29]) == [4]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 4 for x in xs if -9 <= x <= 3)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 4 for x in xs if -9 <= x <= 3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و3 (شاملًا الطرفين) في 4.\nمثال: `select_range([-14, -11, -5, -3, -17, 12, 10, -10, 13])` يجب أن تُرجع `[-20, -12]`.\nالجواب:", "qhash": "3126829836546795"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(278) == 10450", "assert total_multiples(27) == 108", "assert total_multiples(268) == 9905", "assert total_multiples(120) == 1820", "assert total_multiples(205) == 5651", "assert total_multiples(266) == 9905", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(278) == 10450\nassert total_multiples(27) == 108\nassert total_multiples(268) == 9905\nassert total_multiples(120) == 1820\nassert total_multiples(205) == 5651\nassert total_multiples(266) == 9905\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 % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(278)` يُرجع `10450`.\nالجواب:", "qhash": "6a0dde4ed98c6c9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert roll([8, 10, 19, 25]) == [25, 8, 10, 19]", "assert roll([-1, -2, 34, 4, -3, 26]) == [-2, 34, 4, -3, 26, -1]", "assert roll([33, -3, -5, 36, 3, 15, 19, 6, 22, 26]) == [26, 33, -3, -5, 36, 3, 15, 19, 6, 22]", "assert roll([3, 10, 2, 43, 36, 3, 43]) == [3, 43, 3, 10, 2, 43, 36]", "assert roll([19, -8, 20, 50, -5]) == [-5, 19, -8, 20, 50]", "assert roll([-7, -2, 15, 40, 41, 47, 1, 21, 13, -2, 45]) == [13, -2, 45, -7, -2, 15, 40, 41, 47, 1, 21]", "assert roll([]) == []"], "test_code": "assert roll([8, 10, 19, 25]) == [25, 8, 10, 19]\nassert roll([-1, -2, 34, 4, -3, 26]) == [-2, 34, 4, -3, 26, -1]\nassert roll([33, -3, -5, 36, 3, 15, 19, 6, 22, 26]) == [26, 33, -3, -5, 36, 3, 15, 19, 6, 22]\nassert roll([3, 10, 2, 43, 36, 3, 43]) == [3, 43, 3, 10, 2, 43, 36]\nassert roll([19, -8, 20, 50, -5]) == [-5, 19, -8, 20, 50]\nassert roll([-7, -2, 15, 40, 41, 47, 1, 21, 13, -2, 45]) == [13, -2, 45, -7, -2, 15, 40, 41, 47, 1, 21]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef roll(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `roll([8, 10, 19, 25])` يُرجع `[25, 8, 10, 19]`.\nالجواب:", "qhash": "c08d6ef1bc120e49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 66", "tests": ["assert digit_score(8138) == 6", "assert digit_score(740555) == 8", "assert digit_score(783706) == 9", "assert digit_score(807530) == 15", "assert digit_score(448289) == 47", "assert digit_score(614125) == 17", "assert digit_score(125353) == 7", "assert digit_score(0) == 0"], "test_code": "assert digit_score(8138) == 6\nassert digit_score(740555) == 8\nassert digit_score(783706) == 9\nassert digit_score(807530) == 15\nassert digit_score(448289) == 47\nassert digit_score(614125) == 17\nassert digit_score(125353) == 7\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 66", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 66\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 66.\nمثال: `digit_score(8138)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "ccd4be57855e687f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 19\nfor n in range(3, 15, 4):\n s += n * 8\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 19\nfor n in range(3, 15, 4):\n s += n * 8\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "8d305614b63283f2", "answer": "187\n11", "completion": " الناتج:\n```text\n187\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_join('falcon brain music banana up light') == 'light_banana_music_brain_falcon'", "assert rev_join('planet python') == 'python_planet'", "assert rev_join('stone orange on window an an') == 'window_orange_stone'", "assert rev_join('is matrix apple to window') == 'window_apple_matrix'", "assert rev_join('window at banana table') == 'table_banana_window'", "assert rev_join('go code music in in table') == 'table_music_code'", "assert rev_join('on falcon up apple') == 'apple_falcon'"], "test_code": "assert rev_join('falcon brain music banana up light') == 'light_banana_music_brain_falcon'\nassert rev_join('planet python') == 'python_planet'\nassert rev_join('stone orange on window an an') == 'window_orange_stone'\nassert rev_join('is matrix apple to window') == 'window_apple_matrix'\nassert rev_join('window at banana table') == 'table_banana_window'\nassert rev_join('go code music in in table') == 'table_music_code'\nassert rev_join('on falcon up apple') == 'apple_falcon'", "answer": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_join('falcon brain music banana up light')` يُرجع `'light_banana_music_brain_falcon'`.\nالجواب:", "qhash": "cfe22fdebc43529e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('we signal falcon river engine') == 'engine_river_falcon_signal'", "assert rev_long_words('engine matrix stone engine engine') == 'engine_engine_stone_matrix_engine'", "assert rev_long_words('go music') == 'music'", "assert rev_long_words('') == ''", "assert rev_long_words('') == ''", "assert rev_long_words('to go music engine') == 'engine_music'", "assert rev_long_words('orange in stone python') == 'python_stone_orange'"], "test_code": "assert rev_long_words('we signal falcon river engine') == 'engine_river_falcon_signal'\nassert rev_long_words('engine matrix stone engine engine') == 'engine_engine_stone_matrix_engine'\nassert rev_long_words('go music') == 'music'\nassert rev_long_words('') == ''\nassert rev_long_words('') == ''\nassert rev_long_words('to go music engine') == 'engine_music'\nassert rev_long_words('orange in stone python') == 'python_stone_orange'", "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('we signal falcon river engine')` يجب أن تُرجع `'engine_river_falcon_signal'`.\nالجواب:", "qhash": "d1296705ac52cf77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('rocket on a is') == 'olzhbq lk x fp'", "assert decode('matrix python go matrix') == 'jxqofu mvqelk dl jxqofu'", "assert decode('at matrix in') == 'xq jxqofu fk'", "assert decode('summer by river window') == 'prjjbo yv ofsbo tfkalt'", "assert decode('river an up stone') == 'ofsbo xk rm pqlkb'", "assert decode('go it pixel') == 'dl fq mfubi'", "assert decode('') == ''"], "test_code": "assert decode('rocket on a is') == 'olzhbq lk x fp'\nassert decode('matrix python go matrix') == 'jxqofu mvqelk dl jxqofu'\nassert decode('at matrix in') == 'xq jxqofu fk'\nassert decode('summer by river window') == 'prjjbo yv ofsbo tfkalt'\nassert decode('river an up stone') == 'ofsbo xk rm pqlkb'\nassert decode('go it pixel') == 'dl fq mfubi'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('rocket on a is')` يُرجع `'olzhbq lk x fp'`.\nالجواب:", "qhash": "6a28a2a66ce10ea2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 57", "tests": ["assert digit_score(68731) == 25", "assert digit_score(497975) == 41", "assert digit_score(677985) == 42", "assert digit_score(613047) == 21", "assert digit_score(107107) == 16", "assert digit_score(817533) == 27", "assert digit_score(694253) == 29", "assert digit_score(0) == 0"], "test_code": "assert digit_score(68731) == 25\nassert digit_score(497975) == 41\nassert digit_score(677985) == 42\nassert digit_score(613047) == 21\nassert digit_score(107107) == 16\nassert digit_score(817533) == 27\nassert digit_score(694253) == 29\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 57", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 1 for d in str(n)) % 57\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 57.\nمثال: `digit_score(68731)` يجب أن تُرجع `25`.\nالجواب:", "qhash": "9765714eb047031d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([-14, 20, -13, 60]) == None", "assert max_of_div([-27, -45, -27]) == -27", "assert max_of_div([1, 10]) == None", "assert max_of_div([34, -37, -22, 11, 21]) == None", "assert max_of_div([29, -14, -36, 39, 6, -3, -25, -34, -34]) == -36", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-14, 20, -13, 60]) == None\nassert max_of_div([-27, -45, -27]) == -27\nassert max_of_div([1, 10]) == None\nassert max_of_div([34, -37, -22, 11, 21]) == None\nassert max_of_div([29, -14, -36, 39, 6, -3, -25, -34, -34]) == -36\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 9 == 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 % 9 == 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 % 9 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_of_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_of_div([-14, 20, -13, 60])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "8d8837bd2f7d2a91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'dgu'}", "tests": ["assert char_counts('in') == {'d': 0, 'g': 0, 'u': 0}", "assert char_counts('it in up signal is') == {'d': 0, 'g': 1, 'u': 1}", "assert char_counts('falcon garden banana apple at') == {'d': 1, 'g': 1, 'u': 0}", "assert char_counts('table falcon rocket signal rocket desert') == {'d': 1, 'g': 1, 'u': 0}", "assert char_counts('garden a by') == {'d': 1, 'g': 1, 'u': 0}", "assert char_counts('music stone an up') == {'d': 0, 'g': 0, 'u': 2}", "assert char_counts('') == {'d': 0, 'g': 0, 'u': 0}"], "test_code": "assert char_counts('in') == {'d': 0, 'g': 0, 'u': 0}\nassert char_counts('it in up signal is') == {'d': 0, 'g': 1, 'u': 1}\nassert char_counts('falcon garden banana apple at') == {'d': 1, 'g': 1, 'u': 0}\nassert char_counts('table falcon rocket signal rocket desert') == {'d': 1, 'g': 1, 'u': 0}\nassert char_counts('garden a by') == {'d': 1, 'g': 1, 'u': 0}\nassert char_counts('music stone an up') == {'d': 0, 'g': 0, 'u': 2}\nassert char_counts('') == {'d': 0, 'g': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'dgu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'dgu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'd'، 'g'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('in')` يُرجع `{'d': 0, 'g': 0, 'u': 0}`.\nالجواب:", "qhash": "f5c22eb1779548ea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 48901\nc = 0\nwhile n > 18:\n n = n // 5\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 48901\nc = 0\nwhile n > 18:\n n = n // 5\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "936611d460ce24d0", "answer": "15 5", "completion": " الناتج:\n```text\n15 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 56", "tests": ["assert digit_score(7441) == 24", "assert digit_score(419801) == 19", "assert digit_score(978830) == 51", "assert digit_score(331178) == 15", "assert digit_score(9606) == 41", "assert digit_score(538021) == 1", "assert digit_score(768212) == 24", "assert digit_score(0) == 0"], "test_code": "assert digit_score(7441) == 24\nassert digit_score(419801) == 19\nassert digit_score(978830) == 51\nassert digit_score(331178) == 15\nassert digit_score(9606) == 41\nassert digit_score(538021) == 1\nassert digit_score(768212) == 24\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 56", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 56\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 56.\nمثال: `digit_score(7441)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "70cdd69b3c0cf933"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عربية ميناء فجر فجر عربية كتاب سماء') == 2", "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('عربية ميناء فجر فجر عربية كتاب سماء') == 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 w.endswith('ف'):\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 w.endswith('ف'):\n count += 1\n return count\n```\nمثال: `prefix_hits('مطر فجر فجر قمر برمجة نور حاسوب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "4d29ac47429c52d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'باسل': 37, 'وليد': 41, 'سعيد': 19}\nd['سعيد'] += 2\nd['خالد'] = 57\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 = {'باسل': 37, 'وليد': 41, 'سعيد': 19}\nd['سعيد'] += 2\nd['خالد'] = 57\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": "5d34fe4ca0609077", "answer": "4\nخالد\n156\n[('سعيد', 21), ('باسل', 37)]", "completion": " الناتج:\n```text\n4\nخالد\n156\n[('سعيد', 21), ('باسل', 37)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 29\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 = 29\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": "7ed2ff0929f0012b", "answer": "18", "completion": " الناتج:\n```text\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(75) == 1406", "assert add_multiples(224) == 12432", "assert add_multiples(77) == 1482", "assert add_multiples(298) == 22052", "assert add_multiples(8) == 12", "assert add_multiples(48) == 552", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(75) == 1406\nassert add_multiples(224) == 12432\nassert add_multiples(77) == 1482\nassert add_multiples(298) == 22052\nassert add_multiples(8) == 12\nassert add_multiples(48) == 552\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 14.\nمثال: `add_multiples(75)` يجب أن تُرجع `1406`.\nالجواب:", "qhash": "e356729a5a12dd29"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-3))\nprint(h(-3, -10))\nprint(h(h(-10), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(-3))\nprint(h(-3, -10))\nprint(h(h(-10), -3))\n```\nالجواب:", "qhash": "525e5a88276d6937", "answer": "-24\n19\n-22", "completion": " الناتج:\n```text\n-24\n19\n-22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'dn'}", "tests": ["assert freq_of('up') == {'d': 0, 'n': 0}", "assert freq_of('code') == {'d': 1, 'n': 0}", "assert freq_of('vector matrix planet table on') == {'d': 0, 'n': 2}", "assert freq_of('table we cloud') == {'d': 1, 'n': 0}", "assert freq_of('light rocket apple of winter signal') == {'d': 0, 'n': 2}", "assert freq_of('we music to falcon') == {'d': 0, 'n': 1}", "assert freq_of('') == {'d': 0, 'n': 0}"], "test_code": "assert freq_of('up') == {'d': 0, 'n': 0}\nassert freq_of('code') == {'d': 1, 'n': 0}\nassert freq_of('vector matrix planet table on') == {'d': 0, 'n': 2}\nassert freq_of('table we cloud') == {'d': 1, 'n': 0}\nassert freq_of('light rocket apple of winter signal') == {'d': 0, 'n': 2}\nassert freq_of('we music to falcon') == {'d': 0, 'n': 1}\nassert freq_of('') == {'d': 0, 'n': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'dn'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'dn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('up')` يجب أن تُرجع `{'d': 0, 'n': 0}`.\nالجواب:", "qhash": "983555543c7d8eaa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('شجرة سلام مدينة ماء لغة') == 1", "assert letter_count('حصان قلم قهوة عربية سيارة خبز مطر') == 3", "assert letter_count('ماء دفتر لغة معلم برتقال') == 2", "assert letter_count('نهار لغة فجر') == 2", "assert letter_count('') == 0"], "test_code": "assert letter_count('سلام حاسوب ليل طالب قلم جبل عربية قهوة') == 1\nassert letter_count('عمل') == 0\nassert letter_count('قهوة') == 0\nassert letter_count('شجرة سلام مدينة ماء لغة') == 1\nassert letter_count('حصان قلم قهوة عربية سيارة خبز مطر') == 3\nassert letter_count('ماء دفتر لغة معلم برتقال') == 2\nassert letter_count('نهار لغة فجر') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ر» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('سلام حاسوب ليل طالب قلم جبل عربية قهوة')` يُرجع `1`.\nالجواب:", "qhash": "f7945411443a057f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total", "tests": ["assert weighted_sum(4) == 354", "assert weighted_sum(14) == 127687", "assert weighted_sum(3) == 98", "assert weighted_sum(7) == 4676", "assert weighted_sum(9) == 15333", "assert weighted_sum(1) == 1", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 354\nassert weighted_sum(14) == 127687\nassert weighted_sum(3) == 98\nassert weighted_sum(7) == 4676\nassert weighted_sum(9) == 15333\nassert weighted_sum(1) == 1\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(4)` يُرجع `354`.\nالجواب:", "qhash": "ea56c8bc1439cc56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)", "tests": ["assert mult_sum(176) == 4900", "assert mult_sum(98) == 1482", "assert mult_sum(172) == 4725", "assert mult_sum(294) == 13322", "assert mult_sum(210) == 6825", "assert mult_sum(200) == 6217", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(176) == 4900\nassert mult_sum(98) == 1482\nassert mult_sum(172) == 4725\nassert mult_sum(294) == 13322\nassert mult_sum(210) == 6825\nassert mult_sum(200) == 6217\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 % 7 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 7.\nمثال: `mult_sum(176)` يجب أن تُرجع `4900`.\nالجواب:", "qhash": "5b8393e4fa2e08a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([63, 37, 51, 48, 9, 20]) == [63, 100, 0, 48, 57, 77]", "assert acc_reset([127, 112, 69, 79, 84, 114]) == [127, 0, 69, 0, 84, 0]", "assert acc_reset([114, 120]) == [114, 0]", "assert acc_reset([106, -6, 73]) == [106, 100, 0]", "assert acc_reset([-10, 122, 130]) == [-10, 112, 0]", "assert acc_reset([]) == []", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([63, 37, 51, 48, 9, 20]) == [63, 100, 0, 48, 57, 77]\nassert acc_reset([127, 112, 69, 79, 84, 114]) == [127, 0, 69, 0, 84, 0]\nassert acc_reset([114, 120]) == [114, 0]\nassert acc_reset([106, -6, 73]) == [106, 100, 0]\nassert acc_reset([-10, 122, 130]) == [-10, 112, 0]\nassert acc_reset([]) == []\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 147 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([63, 37, 51, 48, 9, 20])` يُرجع `[63, 100, 0, 48, 57, 77]`.\nالجواب:", "qhash": "ade53e7aa0e95aa6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'منى': 50, 'عمر': 28, 'أحمد': 35}\npoints['أحمد'] += 14\npoints['حسن'] = 15\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, 'عمر': 28, 'أحمد': 35}\npoints['أحمد'] += 14\npoints['حسن'] = 15\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": "4882fef5b556ebf4", "answer": "4\nمنى\n142\n[('حسن', 15), ('عمر', 28)]", "completion": " الناتج:\n```text\n4\nمنى\n142\n[('حسن', 15), ('عمر', 28)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -3 for x in xs if -10 <= x <= 27)", "tests": ["assert select_range([18, 26, 31, -16, 33, -19, -4, -13, 22, 28]) == [-78, -66, -54, 12]", "assert select_range([54, 46, 23, -23, 34, 17]) == [-69, -51]", "assert select_range([27, 3, 59, -6, 0]) == [-81, -9, 0, 18]", "assert select_range([19, 13]) == [-57, -39]", "assert select_range([45, 33, -1, -2, 2, 60]) == [-6, 3, 6]", "assert select_range([-30, 21, 26, -13, -29]) == [-78, -63]", "assert select_range([-19, 22, -6, 23, -1, 23]) == [-69, -69, -66, 3, 18]", "assert select_range([]) == []"], "test_code": "assert select_range([18, 26, 31, -16, 33, -19, -4, -13, 22, 28]) == [-78, -66, -54, 12]\nassert select_range([54, 46, 23, -23, 34, 17]) == [-69, -51]\nassert select_range([27, 3, 59, -6, 0]) == [-81, -9, 0, 18]\nassert select_range([19, 13]) == [-57, -39]\nassert select_range([45, 33, -1, -2, 2, 60]) == [-6, 3, 6]\nassert select_range([-30, 21, 26, -13, -29]) == [-78, -63]\nassert select_range([-19, 22, -6, 23, -1, 23]) == [-69, -69, -66, 3, 18]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -3 for x in xs if -10 <= x <= 27)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -3 for x in xs if -10 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -10 ≤ x ≤ 27، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([18, 26, 31, -16, 33, -19, -4, -13, 22, 28])` يُرجع `[-78, -66, -54, 12]`.\nالجواب:", "qhash": "f14db3d0dba672cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'apple'\nprint(word.find('p'))\nprint(word.split('_'))\nprint(word.replace('p', 'X'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'apple'\nprint(word.find('p'))\nprint(word.split('_'))\nprint(word.replace('p', 'X'))\n```\nالجواب:", "qhash": "88a67b14df0e9ed6", "answer": "1\n['apple']\naXXle", "completion": " الناتج:\n```text\n1\n['apple']\naXXle\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 2", "tests": ["assert sum_digit_pow(67664) == 1", "assert sum_digit_pow(273963) == 0", "assert sum_digit_pow(762484) == 1", "assert sum_digit_pow(577717) == 0", "assert sum_digit_pow(671) == 0", "assert sum_digit_pow(393996) == 1", "assert sum_digit_pow(727868) == 0", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(67664) == 1\nassert sum_digit_pow(273963) == 0\nassert sum_digit_pow(762484) == 1\nassert sum_digit_pow(577717) == 0\nassert sum_digit_pow(671) == 0\nassert sum_digit_pow(393996) == 1\nassert sum_digit_pow(727868) == 0\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 2", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 2\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 2.\nللتوضيح: الاستدعاء `sum_digit_pow(67664)` يُرجع `1`.\nالجواب:", "qhash": "6c1dbb0529255f56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(11) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo']", "assert fizzbuzz(6) == ['1', '2', '3', 'Hi', '5', '6']", "assert fizzbuzz(18) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18']", "assert fizzbuzz(11) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo']", "assert fizzbuzz(18) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18']"], "test_code": "assert fizzbuzz(11) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo']\nassert fizzbuzz(6) == ['1', '2', '3', 'Hi', '5', '6']\nassert fizzbuzz(18) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18']\nassert fizzbuzz(11) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo']\nassert fizzbuzz(18) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 11 == 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 % 4 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Hi'، وعلى 11 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(11)` يجب أن تُرجع `['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo']`.\nالجواب:", "qhash": "11db085209702879"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_sel([84, 49, 51, 31, 10, 90, 42, 27, 87, 17]) == 0", "assert count_sel([36, 36, -13, 11, 78, 3, 66, -13, -30, -10, 16]) == 0", "assert count_sel([-20, 18, 74, 18]) == 0", "assert count_sel([]) == 0", "assert count_sel([77, -26, -9, 36, -24, 12, 79, -32, 25, -11, -39, 42]) == 0", "assert count_sel([68, 34, 72, 67, 82, 51, 75, 43]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([84, 49, 51, 31, 10, 90, 42, 27, 87, 17]) == 0\nassert count_sel([36, 36, -13, 11, 78, 3, 66, -13, -30, -10, 16]) == 0\nassert count_sel([-20, 18, 74, 18]) == 0\nassert count_sel([]) == 0\nassert count_sel([77, -26, -9, 36, -24, 12, 79, -32, 25, -11, -39, 42]) == 0\nassert count_sel([68, 34, 72, 67, 82, 51, 75, 43]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([84, 49, 51, 31, 10, 90, 42, 27, 87, 17])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "4bf58663cd93c4f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'شمس علم'\nprint('ب' in s)\nprint(s[-1])\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'شمس علم'\nprint('ب' in s)\nprint(s[-1])\nprint(s.split())\n```\nالجواب:", "qhash": "8bedf2ee3f963551", "answer": "False\nم\n['شمس', 'علم']", "completion": " الناتج:\n```text\nFalse\nم\n['شمس', 'علم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 206\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 = 206\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": "11db18fd6e67a99c", "answer": "88", "completion": " الناتج:\n```text\n88\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'نور': 5, 'أحمد': 3, 'راشد': 43, 'حسن': 45, 'خالد': 33}\nmarks['خالد'] += 19\nmarks['يوسف'] = 7\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 = {'نور': 5, 'أحمد': 3, 'راشد': 43, 'حسن': 45, 'خالد': 33}\nmarks['خالد'] += 19\nmarks['يوسف'] = 7\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": "9d548a977c78b073", "answer": "6\nخالد\n155\n[('أحمد', 3), ('نور', 5)]", "completion": " الناتج:\n```text\n6\nخالد\n155\n[('أحمد', 3), ('نور', 5)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('winter music to at !') == 'cotzkx sayoi zu gz !'", "assert cipher('coffee falcon at desert music OK') == 'iullkk lgriut gz jkykxz sayoi OK'", "assert cipher('by apple engine OK') == 'he gvvrk ktmotk OK'", "assert cipher('banana matrix table desert') == 'hgtgtg sgzxod zghrk jkykxz'", "assert cipher('data light by rocket planet') == 'jgzg romnz he xuiqkz vrgtkz'", "assert cipher('code table OK') == 'iujk zghrk OK'", "assert cipher('') == ''"], "test_code": "assert cipher('winter music to at !') == 'cotzkx sayoi zu gz !'\nassert cipher('coffee falcon at desert music OK') == 'iullkk lgriut gz jkykxz sayoi OK'\nassert cipher('by apple engine OK') == 'he gvvrk ktmotk OK'\nassert cipher('banana matrix table desert') == 'hgtgtg sgzxod zghrk jkykxz'\nassert cipher('data light by rocket planet') == 'jgzg romnz he xuiqkz vrgtkz'\nassert cipher('code table OK') == 'iujk zghrk OK'\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 + (-20)) % 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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('winter music to at !')` يُرجع `'cotzkx sayoi zu gz !'`.\nالجواب:", "qhash": "db54f96660fb7799"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'مدينة وردة'\nprint(w[::-1])\nprint(len(w))\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'مدينة وردة'\nprint(w[::-1])\nprint(len(w))\nprint(w[0])\n```\nالجواب:", "qhash": "146e3b77a5ce9cbe", "answer": "ةدرو ةنيدم\n10\nم", "completion": " الناتج:\n```text\nةدرو ةنيدم\n10\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'راشد': 6, 'حسن': 7, 'مريم': 3, 'أحمد': 27}\nd['مريم'] += 9\nd['خالد'] = 16\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 31])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'راشد': 6, 'حسن': 7, 'مريم': 3, 'أحمد': 27}\nd['مريم'] += 9\nd['خالد'] = 16\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 31])\n```\nالجواب:", "qhash": "525022381fead490", "answer": "5\nأحمد\n68\n[]", "completion": " الناتج:\n```text\n5\nأحمد\n68\n[]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_matching([64, 2, 39, 12, 35, 6]) == 0", "assert count_matching([-15, 45, 24, 55, -11, 2, 35, -25, 73, -13]) == 1", "assert count_matching([58, -24, -35, 78, 34, -34, -6, -19]) == 0", "assert count_matching([6, -11, 51, 57, -14, 66]) == 0", "assert count_matching([83, 34, 64, 67, -15, 25]) == 0", "assert count_matching([]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([64, 2, 39, 12, 35, 6]) == 0\nassert count_matching([-15, 45, 24, 55, -11, 2, 35, -25, 73, -13]) == 1\nassert count_matching([58, -24, -35, 78, 34, -34, -6, -19]) == 0\nassert count_matching([6, -11, 51, 57, -14, 66]) == 0\nassert count_matching([83, 34, 64, 67, -15, 25]) == 0\nassert count_matching([]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([64, 2, 39, 12, 35, 6])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "a3679ebf0fe9cd86"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة برتقال مكتبة') == 1", "assert prefix_hits('صحراء رمل برمجة') == 1", "assert prefix_hits('كتاب قهوة شمس خبز') == 0", "assert prefix_hits('كتاب شمس تفاحة حاسوب حاسوب برمجة') == 1", "assert prefix_hits('نهر ماء صحراء عربية فجر نهر') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('باب صديق علم') == 1\nassert prefix_hits('قهوة برتقال مكتبة') == 1\nassert prefix_hits('صحراء رمل برمجة') == 1\nassert prefix_hits('كتاب قهوة شمس خبز') == 0\nassert prefix_hits('كتاب شمس تفاحة حاسوب حاسوب برمجة') == 1\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.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": "81f03880c5f69b5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(36030672))\nprint(f(f(36030672)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(36030672))\nprint(f(f(36030672)))\n```\nالجواب:", "qhash": "61ca47033b051190", "answer": "27\n9", "completion": " الناتج:\n```text\n27\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert sum_powers(6) == 146412", "assert sum_powers(11) == 4582512", "assert sum_powers(0) == 0", "assert sum_powers(8) == 741312", "assert sum_powers(12) == 7568496", "assert sum_powers(1) == 12", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 146412\nassert sum_powers(11) == 4582512\nassert sum_powers(0) == 0\nassert sum_powers(8) == 741312\nassert sum_powers(12) == 7568496\nassert sum_powers(1) == 12\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 12 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `146412`.\nالجواب:", "qhash": "906d73f9735fd706"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(27) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26', '27']", "assert label_numbers(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24']", "assert label_numbers(4) == ['1', '2', '3', '4']", "assert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']", "assert label_numbers(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22']"], "test_code": "assert label_numbers(27) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26', '27']\nassert label_numbers(24) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24']\nassert label_numbers(4) == ['1', '2', '3', '4']\nassert label_numbers(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']\nassert label_numbers(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Fizz'، وإن قَبِلها على 10 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(27)` يُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26', '27']`.\nالجواب:", "qhash": "7868d95299febacd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n, k):\n if k == 0:\n return 1\n return n * go(n, k - 1)\n\nprint(go(-1, 7))", "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(-1, 7))\n```\nالجواب:", "qhash": "d91beb7321586aed", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=2):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(compute(6))\nprint(compute(6, -7))\nprint(compute(compute(-7), 6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=2):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(compute(6))\nprint(compute(6, -7))\nprint(compute(compute(-7), 6))\n```\nالجواب:", "qhash": "e06f491c895df8c7", "answer": "-2\n7\n-7", "completion": " الناتج:\n```text\n-2\n7\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([44, 28, 37, 15, 45, 7, 34]) == [15, 45, 7, 34, 44, 28, 37]", "assert shift_list([15, 47, 30, 41, 47, 22, 17, 18, -8, -3, 9, 7]) == [9, 7, 15, 47, 30, 41, 47, 22, 17, 18, -8, -3]", "assert shift_list([24, 26, -8, 13, 26, -7, 35]) == [13, 26, -7, 35, 24, 26, -8]", "assert shift_list([48]) == [48]", "assert shift_list([6, 10, 22, 31, 30, 39, 21]) == [31, 30, 39, 21, 6, 10, 22]", "assert shift_list([49, 17, -6, 48, 3, 25, 50]) == [48, 3, 25, 50, 49, 17, -6]", "assert shift_list([]) == []"], "test_code": "assert shift_list([44, 28, 37, 15, 45, 7, 34]) == [15, 45, 7, 34, 44, 28, 37]\nassert shift_list([15, 47, 30, 41, 47, 22, 17, 18, -8, -3, 9, 7]) == [9, 7, 15, 47, 30, 41, 47, 22, 17, 18, -8, -3]\nassert shift_list([24, 26, -8, 13, 26, -7, 35]) == [13, 26, -7, 35, 24, 26, -8]\nassert shift_list([48]) == [48]\nassert shift_list([6, 10, 22, 31, 30, 39, 21]) == [31, 30, 39, 21, 6, 10, 22]\nassert shift_list([49, 17, -6, 48, 3, 25, 50]) == [48, 3, 25, 50, 49, 17, -6]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 10 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([44, 28, 37, 15, 45, 7, 34])` يُرجع `[15, 45, 7, 34, 44, 28, 37]`.\nالجواب:", "qhash": "d7cf0c0bcbdea7a6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 26", "tests": ["assert dig_pow_mod(4740) == 3", "assert dig_pow_mod(884350) == 18", "assert dig_pow_mod(582116) == 5", "assert dig_pow_mod(517541) == 9", "assert dig_pow_mod(715639) == 11", "assert dig_pow_mod(573815) == 15", "assert dig_pow_mod(10921) == 11", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(4740) == 3\nassert dig_pow_mod(884350) == 18\nassert dig_pow_mod(582116) == 5\nassert dig_pow_mod(517541) == 9\nassert dig_pow_mod(715639) == 11\nassert dig_pow_mod(573815) == 15\nassert dig_pow_mod(10921) == 11\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 26", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 26\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 26.\nمثال: `dig_pow_mod(4740)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "d81c3878fe080796"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=2):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(14))\nprint(calc(14, 5))\nprint(calc(calc(5), 14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=2):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(14))\nprint(calc(14, 5))\nprint(calc(calc(5), 14))\n```\nالجواب:", "qhash": "9cf6d8d3643c2656", "answer": "-72\n-75\n-97", "completion": " الناتج:\n```text\n-72\n-75\n-97\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 31", "tests": ["assert prod_mod(7) == 18", "assert prod_mod(56) == 0", "assert prod_mod(3) == 6", "assert prod_mod(45) == 0", "assert prod_mod(44) == 0", "assert prod_mod(12) == 16", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(7) == 18\nassert prod_mod(56) == 0\nassert prod_mod(3) == 6\nassert prod_mod(45) == 0\nassert prod_mod(44) == 0\nassert prod_mod(12) == 16\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 31", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(7)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "0311dcec7376833b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 1 + -2 for x in range(-1, 9) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 1 + -2 for x in range(-1, 9) if x % 5 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "712d15b6c38555e6", "answer": "[1, 6]\n2 7", "completion": " الناتج:\n```text\n[1, 6]\n2 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 5\n return total", "tests": ["assert total_pow(5) == 30975", "assert total_pow(13) == 7014007", "assert total_pow(11) == 2673132", "assert total_pow(10) == 1545775", "assert total_pow(10) == 1545775", "assert total_pow(1) == 7", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 30975\nassert total_pow(13) == 7014007\nassert total_pow(11) == 2673132\nassert total_pow(10) == 1545775\nassert total_pow(10) == 1545775\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 ** 5\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 5\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `total_pow(5)` يُرجع `30975`.\nالجواب:", "qhash": "c05d19c2bbdfcccd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)", "tests": ["assert multiples_total(142) == 3384", "assert multiples_total(180) == 5310", "assert multiples_total(275) == 12558", "assert multiples_total(193) == 6240", "assert multiples_total(62) == 630", "assert multiples_total(109) == 1998", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(142) == 3384\nassert multiples_total(180) == 5310\nassert multiples_total(275) == 12558\nassert multiples_total(193) == 6240\nassert multiples_total(62) == 630\nassert multiples_total(109) == 1998\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 % 6 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 6.\nمثال: `multiples_total(142)` يجب أن تُرجع `3384`.\nالجواب:", "qhash": "c176fcc6d217da6e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([-30, 24, 21, 33, 28, 15, 7, 13, -28]) == 28", "assert find_max_div([-21, -28, -21]) == -21", "assert find_max_div([1, 8]) == None", "assert find_max_div([-9, -20]) == None", "assert find_max_div([39, 39, 23, 26, 28, -18, 11, 17, -16]) == 28", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-30, 24, 21, 33, 28, 15, 7, 13, -28]) == 28\nassert find_max_div([-21, -28, -21]) == -21\nassert find_max_div([1, 8]) == None\nassert find_max_div([-9, -20]) == None\nassert find_max_div([39, 39, 23, 26, 28, -18, 11, 17, -16]) == 28\nassert find_max_div([]) == None", "answer": "def find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(nums):\n best = None\n for x in nums:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([-30, 24, 21, 33, 28, 15, 7, 13, -28])` يُرجع `28`.\nالجواب:", "qhash": "cfb7cd9d59621b7e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(191) == 3146", "assert sum_multiples(23) == 38", "assert sum_multiples(158) == 2276", "assert sum_multiples(0) == 0", "assert sum_multiples(116) == 1176", "assert sum_multiples(63) == 308", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(191) == 3146\nassert sum_multiples(23) == 38\nassert sum_multiples(158) == 2276\nassert sum_multiples(0) == 0\nassert sum_multiples(116) == 1176\nassert sum_multiples(63) == 308\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(191)` يُرجع `3146`.\nالجواب:", "qhash": "3a42d29143e43649"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 43950\ncount = 0\nwhile m > 10:\n m = m // 8\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 43950\ncount = 0\nwhile m > 10:\n m = m // 8\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "2fb95f9a41fdf874", "answer": "10 4", "completion": " الناتج:\n```text\n10 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 9) // 5 for x in range(3, 8) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 9) // 5 for x in range(3, 8) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "7d8c7ba10e6fb342", "answer": "[3]\n1 3", "completion": " الناتج:\n```text\n[3]\n1 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['desert', 'cloud', 'table', 'light', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['desert', 'cloud', 'table', 'light', 'window']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "223bf7ab0a6cf9be", "answer": "['cloud', 'table', 'light', 'desert', 'window']\n['window', 'desert', 'table']", "completion": " الناتج:\n```text\n['cloud', 'table', 'light', 'desert', 'window']\n['window', 'desert', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'desert'\nprint(text.count('e'))\nprint(text[::-1])\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'desert'\nprint(text.count('e'))\nprint(text[::-1])\nprint(text.capitalize())\n```\nالجواب:", "qhash": "e7f6000a1f8fe4ac", "answer": "2\ntresed\nDesert", "completion": " الناتج:\n```text\n2\ntresed\nDesert\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert div_not([19, 50, 15, 31, 20, 29, 84, 29]) == 2", "assert div_not([6, 13, 6]) == 2", "assert div_not([86, -10, 1, 32, 49, 44, 11, -25, 9, 70]) == 1", "assert div_not([36, -28, -3, -27]) == 3", "assert div_not([18, 34, 71, 21, 12]) == 3", "assert div_not([20, 8, 7, 77, -22, 61, -23, 29, 74]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([19, 50, 15, 31, 20, 29, 84, 29]) == 2\nassert div_not([6, 13, 6]) == 2\nassert div_not([86, -10, 1, 32, 49, 44, 11, -25, 9, 70]) == 1\nassert div_not([36, -28, -3, -27]) == 3\nassert div_not([18, 34, 71, 21, 12]) == 3\nassert div_not([20, 8, 7, 77, -22, 61, -23, 29, 74]) == 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 % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 8، واكتب الدالة بعد إكمالها.\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([19, 50, 15, 31, 20, 29, 84, 29])` يُرجع `2`.\nالجواب:", "qhash": "519153a8943dea48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -18 <= x <= 9)", "tests": ["assert filter_range([8, -3, 18, 15, 6]) == [-32, -24, 12]", "assert filter_range([-1]) == [4]", "assert filter_range([27]) == []", "assert filter_range([6, -19, 37, -7, 26, -9, -25, -2, 28]) == [-24, 8, 28, 36]", "assert filter_range([31, 33, -14, 59, -16, 6, -2]) == [-24, 8, 56, 64]", "assert filter_range([]) == []", "assert filter_range([41, -2, 4]) == [-16, 8]", "assert filter_range([]) == []"], "test_code": "assert filter_range([8, -3, 18, 15, 6]) == [-32, -24, 12]\nassert filter_range([-1]) == [4]\nassert filter_range([27]) == []\nassert filter_range([6, -19, 37, -7, 26, -9, -25, -2, 28]) == [-24, 8, 28, 36]\nassert filter_range([31, 33, -14, 59, -16, 6, -2]) == [-24, 8, 56, 64]\nassert filter_range([]) == []\nassert filter_range([41, -2, 4]) == [-16, 8]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -4 for x in xs if -18 <= x <= 9)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -4 for x in xs if -18 <= x <= 9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -18 ≤ x ≤ 9، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([8, -3, 18, 15, 6])` يُرجع `[-32, -24, 12]`.\nالجواب:", "qhash": "36d74d212fd7c676"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 4 + 10 for x in range(0, 11) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 4 + 10 for x in range(0, 11) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "8ee74477ea49efae", "answer": "[10, 26, 42]\n3 78", "completion": " الناتج:\n```text\n[10, 26, 42]\n3 78\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 3 * x ** 2 + (9) * x + (7)", "tests": ["assert evaluate(4) == 91", "assert evaluate(5) == 127", "assert evaluate(15) == 817", "assert evaluate(2) == 37", "assert evaluate(11) == 469", "assert evaluate(11) == 469", "assert evaluate(-20) == 1027", "assert evaluate(0) == 7"], "test_code": "assert evaluate(4) == 91\nassert evaluate(5) == 127\nassert evaluate(15) == 817\nassert evaluate(2) == 37\nassert evaluate(11) == 469\nassert evaluate(11) == 469\nassert evaluate(-20) == 1027\nassert evaluate(0) == 7", "answer": "def evaluate(x):\n return 3 * x ** 2 + (9) * x + (7)", "completion": " ```python\ndef evaluate(x):\n return 3 * x ** 2 + (9) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 3x² + 9x + 7 عند العدد الصحيح x.\nمثال: `evaluate(4)` يجب أن تُرجع `91`.\nالجواب:", "qhash": "e00b216f7232d5ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['stone', 'table', 'camel', 'garden', 'falcon']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['stone', 'table', 'camel', 'garden', 'falcon']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "88a563f7e1df2c68", "answer": "['stone', 'table', 'camel', 'garden', 'falcon']\n['garden', 'falcon', 'table']", "completion": " الناتج:\n```text\n['stone', 'table', 'camel', 'garden', 'falcon']\n['garden', 'falcon', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'river'\nprint(text.upper())\nprint(text.split('_'))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'river'\nprint(text.upper())\nprint(text.split('_'))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "4807a1537cef4cdd", "answer": "RIVER\n['river']\nRiver", "completion": " الناتج:\n```text\nRIVER\n['river']\nRiver\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('د')", "tests": ["assert letter_hits('وردة نهار مطر برمجة') == 1", "assert letter_hits('بيت معلم مدينة تفاحة خبز') == 1", "assert letter_hits('دفتر سفينة سماء') == 1", "assert letter_hits('نهر جبل مطر نهار خبز حاسوب') == 0", "assert letter_hits('برمجة سماء تفاحة') == 0", "assert letter_hits('بحر') == 0", "assert letter_hits('حصان ميناء طالب وردة كتاب حاسوب صديق خبز') == 2", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('وردة نهار مطر برمجة') == 1\nassert letter_hits('بيت معلم مدينة تفاحة خبز') == 1\nassert letter_hits('دفتر سفينة سماء') == 1\nassert letter_hits('نهر جبل مطر نهار خبز حاسوب') == 0\nassert letter_hits('برمجة سماء تفاحة') == 0\nassert letter_hits('بحر') == 0\nassert letter_hits('حصان ميناء طالب وردة كتاب حاسوب صديق خبز') == 2\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)` بحيث تُعيد عدد مرات ظهور الحرف «د» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('وردة نهار مطر برمجة')` يُرجع `1`.\nالجواب:", "qhash": "f8f42d07c189ceeb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'banana'\nprint(word.capitalize())\nprint(len(word))\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'banana'\nprint(word.capitalize())\nprint(len(word))\nprint(word.split('_'))\n```\nالجواب:", "qhash": "bd46336fb3a587e8", "answer": "Banana\n6\n['banana']", "completion": " الناتج:\n```text\nBanana\n6\n['banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "tests": ["assert total_pow(3) == 144", "assert total_pow(6) == 1764", "assert total_pow(8) == 5184", "assert total_pow(12) == 24336", "assert total_pow(0) == 0", "assert total_pow(1) == 4", "assert total_pow(0) == 0"], "test_code": "assert total_pow(3) == 144\nassert total_pow(6) == 1764\nassert total_pow(8) == 5184\nassert total_pow(12) == 24336\nassert total_pow(0) == 0\nassert total_pow(1) == 4\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 3\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 3\n return total\n```\nمثال: `total_pow(3)` يجب أن تُرجع `144`.\nالجواب:", "qhash": "eae753d9aeb52cad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [17, -7, -20, -15, -1, 10, -11, -13]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [17, -7, -20, -15, -1, 10, -11, -13]\nprint(sorted(nums, key=lambda x: (abs(x - 27), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ea370bd85ee5b556", "answer": "[17, 10, -1, -7, -11, -13, -15, -20]\n[17, 10, -1]", "completion": " الناتج:\n```text\n[17, 10, -1, -7, -11, -13, -15, -20]\n[17, 10, -1]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "tests": ["assert sum_powers(3) == 14", "assert sum_powers(14) == 1015", "assert sum_powers(14) == 1015", "assert sum_powers(12) == 650", "assert sum_powers(13) == 819", "assert sum_powers(1) == 1", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 14\nassert sum_powers(14) == 1015\nassert sum_powers(14) == 1015\nassert sum_powers(12) == 650\nassert sum_powers(13) == 819\nassert sum_powers(1) == 1\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 2\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 1 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(3)` يُرجع `14`.\nالجواب:", "qhash": "d5383d879690edad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('صحراء امل قلم برمجة') == 1", "assert count_start('قمر شجرة قمر علم مدرسة') == 0", "assert count_start('امل كتاب كتاب سيارة مطر ميناء مدرسة') == 1", "assert count_start('سماء عمل برمجة بحر صحراء عربية') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('دفتر امل حاسوب امل') == 2\nassert count_start('سماء صديق شجرة امل سفينة مدرسة') == 1\nassert count_start('صحراء امل قلم برمجة') == 1\nassert count_start('قمر شجرة قمر علم مدرسة') == 0\nassert count_start('امل كتاب كتاب سيارة مطر ميناء مدرسة') == 1\nassert count_start('سماء عمل برمجة بحر صحراء عربية') == 0\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.split():\n if w.endswith('ا'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ا»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(text):\n count = 0\n for w in text.split():\n if w.endswith('ا'):\n count += 1\n return count\n```\nمثال: `count_start('دفتر امل حاسوب امل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "5cd01629c316b720"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 89", "tests": ["assert step_product(9) == 73", "assert step_product(15) == 57", "assert step_product(19) == 23", "assert step_product(58) == 11", "assert step_product(47) == 63", "assert step_product(25) == 12", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 73\nassert step_product(15) == 57\nassert step_product(19) == 23\nassert step_product(58) == 11\nassert step_product(47) == 63\nassert step_product(25) == 12\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 89", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(9)` يجب أن تُرجع `73`.\nالجواب:", "qhash": "6d8a33248233b0cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= -1)", "tests": ["assert select_range([-9, -8, -12, 3, -9, 8, -1, -6, -14]) == [-9, -9, -8, -6, -1]", "assert select_range([57, 33, -14, 31, 27, -22, -24]) == []", "assert select_range([16, 47, 1, 38, -8, -28, 59, 28]) == [-8]", "assert select_range([-23, 17, -20, 21, -8, -1, 27, -20]) == [-8, -1]", "assert select_range([56, 58, 5, 40, 52, 9, -3, 24, -16]) == [-3]", "assert select_range([-26, -28, 17]) == []", "assert select_range([60, 13, 43, -23, 55, 14, 5, -17, 39]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-9, -8, -12, 3, -9, 8, -1, -6, -14]) == [-9, -9, -8, -6, -1]\nassert select_range([57, 33, -14, 31, 27, -22, -24]) == []\nassert select_range([16, 47, 1, 38, -8, -28, 59, 28]) == [-8]\nassert select_range([-23, 17, -20, 21, -8, -1, 27, -20]) == [-8, -1]\nassert select_range([56, 58, 5, 40, 52, 9, -3, 24, -16]) == [-3]\nassert select_range([-26, -28, 17]) == []\nassert select_range([60, 13, 43, -23, 55, 14, 5, -17, 39]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= -1)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 1 for x in xs if -9 <= x <= -1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و-1 (شاملًا الطرفين) في 1.\nمثال: `select_range([-9, -8, -12, 3, -9, 8, -1, -6, -14])` يجب أن تُرجع `[-9, -9, -8, -6, -1]`.\nالجواب:", "qhash": "341dcc9324465da1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([15, 22, 9, 6, 8, 17, 9]) == [15, 37, 0, 6, 14, 31, 0]", "assert rolling_total([6, 38, 17, 33, -2, 22, 25, 32, -9, 29]) == [6, 0, 17, 0, -2, 20, 0, 32, 23, 0]", "assert rolling_total([33]) == [33]", "assert rolling_total([]) == []", "assert rolling_total([23, 35, 22, 14, 12, -1]) == [23, 0, 22, 36, 0, -1]", "assert rolling_total([-5, 14, 23, -7, 3]) == [-5, 9, 32, 25, 28]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([15, 22, 9, 6, 8, 17, 9]) == [15, 37, 0, 6, 14, 31, 0]\nassert rolling_total([6, 38, 17, 33, -2, 22, 25, 32, -9, 29]) == [6, 0, 17, 0, -2, 20, 0, 32, 23, 0]\nassert rolling_total([33]) == [33]\nassert rolling_total([]) == []\nassert rolling_total([23, 35, 22, 14, 12, -1]) == [23, 0, 22, 36, 0, -1]\nassert rolling_total([-5, 14, 23, -7, 3]) == [-5, 9, 32, 25, 28]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\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 > 39:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 39 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([15, 22, 9, 6, 8, 17, 9])` يُرجع `[15, 37, 0, 6, 14, 31, 0]`.\nالجواب:", "qhash": "4de5aa657d52b791"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert cycle([36, 4, 9, 37, 36, 42, 22, 44]) == [44, 36, 4, 9, 37, 36, 42, 22]", "assert cycle([24, 41, 9, 42, 0, -2]) == [41, 9, 42, 0, -2, 24]", "assert cycle([36, -7]) == [-7, 36]", "assert cycle([41, 41, 9]) == [41, 9, 41]", "assert cycle([44, 10, 33]) == [10, 33, 44]", "assert cycle([36]) == [36]", "assert cycle([]) == []"], "test_code": "assert cycle([36, 4, 9, 37, 36, 42, 22, 44]) == [44, 36, 4, 9, 37, 36, 42, 22]\nassert cycle([24, 41, 9, 42, 0, -2]) == [41, 9, 42, 0, -2, 24]\nassert cycle([36, -7]) == [-7, 36]\nassert cycle([41, 41, 9]) == [41, 9, 41]\nassert cycle([44, 10, 33]) == [10, 33, 44]\nassert cycle([36]) == [36]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 7 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([36, 4, 9, 37, 36, 42, 22, 44])` يُرجع `[44, 36, 4, 9, 37, 36, 42, 22]`.\nالجواب:", "qhash": "319d0aa4f03cff9f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert count_initial('بيت خبز امل مطر') == 1", "assert count_initial('باب امل كتاب صحراء') == 1", "assert count_initial('مطر مكتبة نهر برمجة كتاب') == 0", "assert count_initial('رمل عربية امل امل') == 2", "assert count_initial('تفاحة قهوة علم امل تفاحة علم') == 1", "assert count_initial('حاسوب امل حصان') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('بيت خبز امل مطر') == 1\nassert count_initial('باب امل كتاب صحراء') == 1\nassert count_initial('مطر مكتبة نهر برمجة كتاب') == 0\nassert count_initial('رمل عربية امل امل') == 2\nassert count_initial('تفاحة قهوة علم امل تفاحة علم') == 1\nassert count_initial('حاسوب امل حصان') == 1\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(line):\n count = 0\n for w in line.split():\n if w.endswith('ا'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('بيت خبز امل مطر')` يُرجع `1`.\nالجواب:", "qhash": "b83b1bcadf254aa6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'سيارة دفتر'\nprint(text.split())\nprint('ر' in text)\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'سيارة دفتر'\nprint(text.split())\nprint('ر' in text)\nprint(text[0])\n```\nالجواب:", "qhash": "fd398525c25ccf23", "answer": "['سيارة', 'دفتر']\nTrue\nس", "completion": " الناتج:\n```text\n['سيارة', 'دفتر']\nTrue\nس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_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 largest_div([19, 28, 44, 34, 9, 55]) == 55", "assert largest_div([-5, -20, -10]) == -5", "assert largest_div([1, 6]) == None", "assert largest_div([11, 5, -9, 25, -16, -14, -8]) == 25", "assert largest_div([-28, 10, 47, -17, 34]) == 10", "assert largest_div([]) == None"], "test_code": "assert largest_div([19, 28, 44, 34, 9, 55]) == 55\nassert largest_div([-5, -20, -10]) == -5\nassert largest_div([1, 6]) == None\nassert largest_div([11, 5, -9, 25, -16, -14, -8]) == 25\nassert largest_div([-28, 10, 47, -17, 34]) == 10\nassert largest_div([]) == None", "answer": "def largest_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 largest_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 largest_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_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مثال: `largest_div([19, 28, 44, 34, 9, 55])` يجب أن تُرجع `55`.\nالجواب:", "qhash": "5f068d6c975bf40b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'winter_data'\nprint(text.count('t'))\nprint(text[::-1])\nprint(text[1:5])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'winter_data'\nprint(text.count('t'))\nprint(text[::-1])\nprint(text[1:5])\n```\nالجواب:", "qhash": "32a6abf7d0d88dc6", "answer": "2\natad_retniw\ninte", "completion": " الناتج:\n```text\n2\natad_retniw\ninte\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 53) == 1)", "tests": ["assert count_gcd1(116) == 114", "assert count_gcd1(135) == 133", "assert count_gcd1(152) == 150", "assert count_gcd1(77) == 76", "assert count_gcd1(147) == 145", "assert count_gcd1(50) == 50", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(116) == 114\nassert count_gcd1(135) == 133\nassert count_gcd1(152) == 150\nassert count_gcd1(77) == 76\nassert count_gcd1(147) == 145\nassert count_gcd1(50) == 50\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, 53) == 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, 53) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 53، أي أن القاسم المشترك الأكبر لها مع 53 يساوي 1.\nمثال: `count_gcd1(116)` يجب أن تُرجع `114`.\nالجواب:", "qhash": "8a82e39e8531b9ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [9, 37, 26, 31, 1, 24, 23, 26, 7]\nprint(lst[2:8])\nprint(lst[::-2])\nprint(sum(lst[2:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [9, 37, 26, 31, 1, 24, 23, 26, 7]\nprint(lst[2:8])\nprint(lst[::-2])\nprint(sum(lst[2:8]))\n```\nالجواب:", "qhash": "b06a66940962ba08", "answer": "[26, 31, 1, 24, 23, 26]\n[7, 23, 1, 26, 9]\n131", "completion": " الناتج:\n```text\n[26, 31, 1, 24, 23, 26]\n[7, 23, 1, 26, 9]\n131\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 1\nfor x in range(7, 27, 1):\n acc -= x * 3\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 1\nfor x in range(7, 27, 1):\n acc -= x * 3\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "84b3ce3105fff730", "answer": "-989\n26", "completion": " الناتج:\n```text\n-989\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(5, 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(5, 8))\n```\nالجواب:", "qhash": "e6cc8272950c4025", "answer": "390625", "completion": " الناتج:\n```text\n390625\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(17) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17']", "assert label_numbers(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21']", "assert label_numbers(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21']", "assert label_numbers(17) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17']", "assert label_numbers(6) == ['1', '2', '3', '4', '5', 'Foo']"], "test_code": "assert label_numbers(17) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17']\nassert label_numbers(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21']\nassert label_numbers(21) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17', 'Foo', '19', '20', '21']\nassert label_numbers(17) == ['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17']\nassert label_numbers(6) == ['1', '2', '3', '4', '5', 'Foo']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 11 == 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 % 6 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Foo'، وعلى 11 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(17)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Foo', '7', '8', '9', '10', 'Bar', 'Foo', '13', '14', '15', '16', '17']`.\nالجواب:", "qhash": "7ed286618266e084"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 64", "tests": ["assert pow_digits(68176) == 2", "assert pow_digits(766403) == 18", "assert pow_digits(810735) == 36", "assert pow_digits(101759) == 53", "assert pow_digits(798601) == 19", "assert pow_digits(847720) == 18", "assert pow_digits(437123) == 20", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(68176) == 2\nassert pow_digits(766403) == 18\nassert pow_digits(810735) == 36\nassert pow_digits(101759) == 53\nassert pow_digits(798601) == 19\nassert pow_digits(847720) == 18\nassert pow_digits(437123) == 20\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 64", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 64\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 64.\nللتوضيح: الاستدعاء `pow_digits(68176)` يُرجع `2`.\nالجواب:", "qhash": "6cef633aa0486d23"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 4) // 2 for x in range(1, 9) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 4) // 2 for x in range(1, 9) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "8d35e1a319542f92", "answer": "[2, 3, 4, 5]\n4 14", "completion": " الناتج:\n```text\n[2, 3, 4, 5]\n4 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 1 for x in xs if -16 <= x <= 18)", "tests": ["assert between_times([-7, 4, 22, 1, 27, 10]) == [-7, 1, 4, 10]", "assert between_times([-1, -23, 22, 18]) == [-1, 18]", "assert between_times([47, -9, 47]) == [-9]", "assert between_times([21, 12, -29, 49, -28, 55]) == [12]", "assert between_times([37]) == []", "assert between_times([40, -15, -12, 50, -22, 52, -9]) == [-15, -12, -9]", "assert between_times([0, 52, 48, -5]) == [-5, 0]", "assert between_times([]) == []"], "test_code": "assert between_times([-7, 4, 22, 1, 27, 10]) == [-7, 1, 4, 10]\nassert between_times([-1, -23, 22, 18]) == [-1, 18]\nassert between_times([47, -9, 47]) == [-9]\nassert between_times([21, 12, -29, 49, -28, 55]) == [12]\nassert between_times([37]) == []\nassert between_times([40, -15, -12, 50, -22, 52, -9]) == [-15, -12, -9]\nassert between_times([0, 52, 48, -5]) == [-5, 0]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 1 for x in xs if -16 <= x <= 18)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 1 for x in xs if -16 <= x <= 18)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -16 و18 (شاملًا الطرفين) في 1.\nمثال: `between_times([-7, 4, 22, 1, 27, 10])` يجب أن تُرجع `[-7, 1, 4, 10]`.\nالجواب:", "qhash": "ccb4bd692b2f827c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(15) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15']", "assert fizz(1) == ['1']", "assert fizz(18) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', 'Fizz', '17', '18']", "assert fizz(6) == ['1', '2', '3', 'Fizz', '5', '6']", "assert fizz(21) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', 'Fizz', '17', '18', '19', 'Fizz', 'Buzz']"], "test_code": "assert fizz(15) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15']\nassert fizz(1) == ['1']\nassert fizz(18) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', 'Fizz', '17', '18']\nassert fizz(6) == ['1', '2', '3', 'Fizz', '5', '6']\nassert fizz(21) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15', 'Fizz', '17', '18', '19', 'Fizz', 'Buzz']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 7 == 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 % 4 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Fizz'، وإن قَبِلها على 7 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(15)` يُرجع `['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz', '13', 'Buzz', '15']`.\nالجواب:", "qhash": "b45fdfd3e2b95596"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 37", "tests": ["assert fact_mod(7) == 31", "assert fact_mod(31) == 10", "assert fact_mod(0) == 1", "assert fact_mod(44) == 1", "assert fact_mod(35) == 6", "assert fact_mod(29) == 23", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 31\nassert fact_mod(31) == 10\nassert fact_mod(0) == 1\nassert fact_mod(44) == 1\nassert fact_mod(35) == 6\nassert fact_mod(29) == 23\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 37", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(7)` يُرجع `31`.\nالجواب:", "qhash": "39c758c6cfa480bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 71548\nc = 0\nwhile x > 5:\n x = x // 4\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 71548\nc = 0\nwhile x > 5:\n x = x // 4\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "0dc517865742212a", "answer": "4 7", "completion": " الناتج:\n```text\n4 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 39", "tests": ["assert pow_digits(53457) == 10", "assert pow_digits(498028) == 10", "assert pow_digits(419868) == 4", "assert pow_digits(183004) == 27", "assert pow_digits(789080) == 33", "assert pow_digits(581284) == 3", "assert pow_digits(552567) == 11", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(53457) == 10\nassert pow_digits(498028) == 10\nassert pow_digits(419868) == 4\nassert pow_digits(183004) == 27\nassert pow_digits(789080) == 33\nassert pow_digits(581284) == 3\nassert pow_digits(552567) == 11\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 39", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 39\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 39.\nللتوضيح: الاستدعاء `pow_digits(53457)` يُرجع `10`.\nالجواب:", "qhash": "0f8a7840be67bbd3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 3 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(8) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping']", "assert fizzbuzz(9) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong']", "assert fizzbuzz(14) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong', 'Ping', '11', 'PingPong', '13', 'Ping']", "assert fizzbuzz(7) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7']", "assert fizzbuzz(20) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong', 'Ping', '11', 'PingPong', '13', 'Ping', 'Pong', 'Ping', '17', 'PingPong', '19', 'Ping']"], "test_code": "assert fizzbuzz(8) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping']\nassert fizzbuzz(9) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong']\nassert fizzbuzz(14) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong', 'Ping', '11', 'PingPong', '13', 'Ping']\nassert fizzbuzz(7) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7']\nassert fizzbuzz(20) == ['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping', 'Pong', 'Ping', '11', 'PingPong', '13', 'Ping', 'Pong', 'Ping', '17', 'PingPong', '19', 'Ping']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 3 == 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 % 2 == 0:\n s += 'Ping'\n if i % 3 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Ping'، وإن قَبِلها على 3 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(8)` يُرجع `['1', 'Ping', 'Pong', 'Ping', '5', 'PingPong', '7', 'Ping']`.\nالجواب:", "qhash": "500fbf8bc691c4f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('نور دفتر نهار سيارة بحر وردة') == 1", "assert begin_count('وردة ميناء عمل نور مكتبة ليل عمل') == 1", "assert begin_count('وردة باب وردة وردة') == 3", "assert begin_count('رمل شمس مطر لغة حصان معلم') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('فجر سفينة ماء وردة ميناء') == 1\nassert begin_count('جمل جمل باب صحراء قمر صحراء') == 0\nassert begin_count('نور دفتر نهار سيارة بحر وردة') == 1\nassert begin_count('وردة ميناء عمل نور مكتبة ليل عمل') == 1\nassert begin_count('وردة باب وردة وردة') == 3\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 w.endswith('و'):\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 w.endswith('و'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('فجر سفينة ماء وردة ميناء')` يُرجع `1`.\nالجواب:", "qhash": "65d2800b4c156437"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert scaled_powers(3) == 180", "assert scaled_powers(10) == 15125", "assert scaled_powers(13) == 41405", "assert scaled_powers(13) == 41405", "assert scaled_powers(6) == 2205", "assert scaled_powers(1) == 5", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(3) == 180\nassert scaled_powers(10) == 15125\nassert scaled_powers(13) == 41405\nassert scaled_powers(13) == 41405\nassert scaled_powers(6) == 2205\nassert scaled_powers(1) == 5\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total\n```\nمثال: `scaled_powers(3)` يجب أن تُرجع `180`.\nالجواب:", "qhash": "9e90a1a0e28a8ad0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "label_numbers", "reference": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(9) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9']", "assert label_numbers(15) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15']", "assert label_numbers(24) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21', '22', '23', 'FooBar']", "assert label_numbers(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21']", "assert label_numbers(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21']"], "test_code": "assert label_numbers(9) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9']\nassert label_numbers(15) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15']\nassert label_numbers(24) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21', '22', '23', 'FooBar']\nassert label_numbers(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21']\nassert label_numbers(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9', '10', '11', 'Foo', '13', '14', '15', 'FooBar', '17', '18', '19', 'Foo', '21']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 8 == 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 % 4 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Foo'، وعلى 8 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(9)` يجب أن تُرجع `['1', '2', '3', 'Foo', '5', '6', '7', 'FooBar', '9']`.\nالجواب:", "qhash": "6e81457b4ad8585a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * -2 + 3 for x in range(0, 9) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * -2 + 3 for x in range(0, 9) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ebab4a1d91f642d3", "answer": "[1, -9]\n2 -8", "completion": " الناتج:\n```text\n[1, -9]\n2 -8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_special([28, 64, 90, 81, 35, 73, 38, 37, 52, 51, 40]) == 2", "assert count_special([76, 73, 80, 75, 62, 36, 47, 77, -31, 7, 14]) == 2", "assert count_special([9, 53, 9, 52, -16, 9, 39]) == 0", "assert count_special([14, -39, 57, -6, 14, 61]) == 0", "assert count_special([2, -13, 27, 20, 55, 89]) == 2", "assert count_special([19, 84, 21, -20, 55, 51, 66, 83, 90]) == 2", "assert count_special([]) == 0"], "test_code": "assert count_special([28, 64, 90, 81, 35, 73, 38, 37, 52, 51, 40]) == 2\nassert count_special([76, 73, 80, 75, 62, 36, 47, 77, -31, 7, 14]) == 2\nassert count_special([9, 53, 9, 52, -16, 9, 39]) == 0\nassert count_special([14, -39, 57, -6, 14, 61]) == 0\nassert count_special([2, -13, 27, 20, 55, 89]) == 2\nassert count_special([19, 84, 21, -20, 55, 51, 66, 83, 90]) == 2\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، ثم اكتب الدالة كاملة.\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([28, 64, 90, 81, 35, 73, 38, 37, 52, 51, 40])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "6335d86b0bc022cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 46)", "tests": ["assert in_range_scaled([34, 10, 44, 42, 41]) == [-44, -42, -41, -34]", "assert in_range_scaled([-29, 8, -12, -14]) == []", "assert in_range_scaled([52, 37, -13]) == [-37]", "assert in_range_scaled([60, 21, 25, -3, 57, -18, 32, 36, 32, 49]) == [-36, -32, -32, -25, -21]", "assert in_range_scaled([-2, 50, 25, 40, 32, 55, 26]) == [-40, -32, -26, -25]", "assert in_range_scaled([57, 42, 8, -18, 1, -15, -21, 57, -13]) == [-42]", "assert in_range_scaled([26, 28, -5, 55, -6, 53, -23, 20, 16]) == [-28, -26, -20, -16]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([34, 10, 44, 42, 41]) == [-44, -42, -41, -34]\nassert in_range_scaled([-29, 8, -12, -14]) == []\nassert in_range_scaled([52, 37, -13]) == [-37]\nassert in_range_scaled([60, 21, 25, -3, 57, -18, 32, 36, 32, 49]) == [-36, -32, -32, -25, -21]\nassert in_range_scaled([-2, 50, 25, 40, 32, 55, 26]) == [-40, -32, -26, -25]\nassert in_range_scaled([57, 42, 8, -18, 1, -15, -21, 57, -13]) == [-42]\nassert in_range_scaled([26, 28, -5, 55, -6, 53, -23, 20, 16]) == [-28, -26, -20, -16]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 46)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -1 for x in xs if 15 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 15 و46 (شاملًا الطرفين) في -1.\nمثال: `in_range_scaled([34, 10, 44, 42, 41])` يجب أن تُرجع `[-44, -42, -41, -34]`.\nالجواب:", "qhash": "a5c5b8460613a331"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('برمجة رمل لغة نهر باب وردة') == 1", "assert count_initial('عربية ميناء رمل نهر عربية') == 1", "assert count_initial('سلام ليل نور رمل سماء سماء رمل كتاب') == 2", "assert count_initial('سوق سيارة باب رمل') == 1", "assert count_initial('برمجة سماء مدرسة لغة') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('جمل رمل فجر تفاحة سماء رمل سماء') == 2\nassert count_initial('برمجة رمل لغة نهر باب وردة') == 1\nassert count_initial('عربية ميناء رمل نهر عربية') == 1\nassert count_initial('سلام ليل نور رمل سماء سماء رمل كتاب') == 2\nassert count_initial('سوق سيارة باب رمل') == 1\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.split():\n if 'ر' in w:\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 'ر' in w:\n count += 1\n return count\n```\nمثال: `count_initial('جمل رمل فجر تفاحة سماء رمل سماء')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "4fc5306385a53e0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 7", "tests": ["assert prod_mod(11) == 5", "assert prod_mod(39) == 0", "assert prod_mod(48) == 0", "assert prod_mod(42) == 0", "assert prod_mod(42) == 0", "assert prod_mod(56) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(11) == 5\nassert prod_mod(39) == 0\nassert prod_mod(48) == 0\nassert prod_mod(42) == 0\nassert prod_mod(42) == 0\nassert prod_mod(56) == 0\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 7", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(11)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "d3e213d09ca93415"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)", "tests": ["assert mult_sum(202) == 10991", "assert mult_sum(97) == 2528", "assert mult_sum(150) == 6089", "assert mult_sum(16) == 67", "assert mult_sum(28) == 193", "assert mult_sum(297) == 23911", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(202) == 10991\nassert mult_sum(97) == 2528\nassert mult_sum(150) == 6089\nassert mult_sum(16) == 67\nassert mult_sum(28) == 193\nassert mult_sum(297) == 23911\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(202)` يُرجع `10991`.\nالجواب:", "qhash": "d46cf87f4f2ce592"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('ليل عربية قهوة') == 0", "assert count_start('وردة سلام قلم معلم') == 1", "assert count_start('ماء ليل باب سيارة علم ماء') == 0", "assert count_start('وردة بيت سماء') == 1", "assert count_start('وردة جمل خبز وردة تفاحة مطر') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('مدينة كتاب وردة فجر وردة مدينة') == 2\nassert count_start('ليل عربية قهوة') == 0\nassert count_start('وردة سلام قلم معلم') == 1\nassert count_start('ماء ليل باب سيارة علم ماء') == 0\nassert count_start('وردة بيت سماء') == 1\nassert count_start('وردة جمل خبز وردة تفاحة مطر') == 2\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 w.endswith('و'):\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 w.endswith('و'):\n count += 1\n return count\n```\nمثال: `count_start('مدينة كتاب وردة فجر وردة مدينة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "332de7423bc83b8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('معلم صحراء معلم مطر حصان') == 3", "assert count_initial('عمل سلام مكتبة ميناء ميناء سماء') == 3", "assert count_initial('معلم ليل برتقال سيارة') == 1", "assert count_initial('خبز شمس قلم مدرسة معلم مطر رمل') == 3", "assert count_initial('مطر ليل صديق معلم عربية سيارة') == 2", "assert count_initial('باب ماء حديقة مدرسة طائرة طائرة بيت') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('معلم صحراء معلم مطر حصان') == 3\nassert count_initial('عمل سلام مكتبة ميناء ميناء سماء') == 3\nassert count_initial('معلم ليل برتقال سيارة') == 1\nassert count_initial('خبز شمس قلم مدرسة معلم مطر رمل') == 3\nassert count_initial('مطر ليل صديق معلم عربية سيارة') == 2\nassert count_initial('باب ماء حديقة مدرسة طائرة طائرة بيت') == 2\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('معلم صحراء معلم مطر حصان')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "1bd9bf224f4f9dfc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [6, 9, 27, -2, 20, 40, -9, 37]\nprint(items[1:6])\nprint(items[::2])\nprint(max(items[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [6, 9, 27, -2, 20, 40, -9, 37]\nprint(items[1:6])\nprint(items[::2])\nprint(max(items[1:6]))\n```\nالجواب:", "qhash": "0adb412e36b0016d", "answer": "[9, 27, -2, 20, 40]\n[6, 27, 20, -9]\n40", "completion": " الناتج:\n```text\n[9, 27, -2, 20, 40]\n[6, 27, 20, -9]\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 119\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 = 119\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": "8b393589300068b9", "answer": "33", "completion": " الناتج:\n```text\n33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "tests": ["assert power_sum(6) == 21", "assert power_sum(8) == 36", "assert power_sum(14) == 105", "assert power_sum(15) == 120", "assert power_sum(11) == 66", "assert power_sum(1) == 1", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 21\nassert power_sum(8) == 36\nassert power_sum(14) == 105\nassert power_sum(15) == 120\nassert power_sum(11) == 66\nassert power_sum(1) == 1\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 1 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total\n```\nمثال: `power_sum(6)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "ac00ba9871b33f66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [16, 20, 3, -8, 40, 8]\nprint(items[1:3])\nprint(items[::-1])\nprint(len(items[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [16, 20, 3, -8, 40, 8]\nprint(items[1:3])\nprint(items[::-1])\nprint(len(items[1:3]))\n```\nالجواب:", "qhash": "5d06aa3313d8c5bb", "answer": "[20, 3]\n[8, 40, -8, 3, 20, 16]\n2", "completion": " الناتج:\n```text\n[20, 3]\n[8, 40, -8, 3, 20, 16]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('camel signal cloud planet on') == 'pnzry fvtany pybhq cynarg ba'", "assert cipher('desert of') == 'qrfreg bs'", "assert cipher('light') == 'yvtug'", "assert cipher('data a python is A1') == 'qngn n clguba vf A1'", "assert cipher('data') == 'qngn'", "assert cipher('python camel up !') == 'clguba pnzry hc !'", "assert cipher('') == ''"], "test_code": "assert cipher('camel signal cloud planet on') == 'pnzry fvtany pybhq cynarg ba'\nassert cipher('desert of') == 'qrfreg bs'\nassert cipher('light') == 'yvtug'\nassert cipher('data a python is A1') == 'qngn n clguba vf A1'\nassert cipher('data') == 'qngn'\nassert cipher('python camel up !') == 'clguba pnzry hc !'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('camel signal cloud planet on')` يجب أن تُرجع `'pnzry fvtany pybhq cynarg ba'`.\nالجواب:", "qhash": "84dd805a4eb80cae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('is in we') == 'fp fk tb'", "assert cipher('it') == 'fq'", "assert cipher('stone') == 'pqlkb'", "assert cipher('pixel desert vector planet to A1') == 'mfubi abpboq sbzqlo mixkbq ql A1'", "assert cipher('garden light winter an') == 'dxoabk ifdeq tfkqbo xk'", "assert cipher('orange table banana') == 'loxkdb qxyib yxkxkx'", "assert cipher('') == ''"], "test_code": "assert cipher('is in we') == 'fp fk tb'\nassert cipher('it') == 'fq'\nassert cipher('stone') == 'pqlkb'\nassert cipher('pixel desert vector planet to A1') == 'mfubi abpboq sbzqlo mixkbq ql A1'\nassert cipher('garden light winter an') == 'dxoabk ifdeq tfkqbo xk'\nassert cipher('orange table banana') == 'loxkdb qxyib yxkxkx'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('is in we')` يجب أن تُرجع `'fp fk tb'`.\nالجواب:", "qhash": "8a3ec3544a34fa5b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(27) == 182", "assert add_multiples(31) == 240", "assert add_multiples(0) == 0", "assert add_multiples(103) == 2652", "assert add_multiples(265) == 17556", "assert add_multiples(285) == 20306", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(27) == 182\nassert add_multiples(31) == 240\nassert add_multiples(0) == 0\nassert add_multiples(103) == 2652\nassert add_multiples(265) == 17556\nassert add_multiples(285) == 20306\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 14.\nمثال: `add_multiples(27)` يجب أن تُرجع `182`.\nالجواب:", "qhash": "11c494aae88ab57b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([20, 13, 14, 29, 50, 15, 49, 48]) == [13, 14, 29, 50, 15, 49, 48, 20]", "assert spin([25, -2, -7, 50, 5, 27, 43]) == [-2, -7, 50, 5, 27, 43, 25]", "assert spin([32, 5, 18, 43, 23, -6, 38, 23, 28, 23]) == [5, 18, 43, 23, -6, 38, 23, 28, 23, 32]", "assert spin([46, 4, -3, 46, 10, 15, -4, 29, 36, -9, 39]) == [4, -3, 46, 10, 15, -4, 29, 36, -9, 39, 46]", "assert spin([50]) == [50]", "assert spin([32, 35, 15, 44, 15, 1, 8, 13]) == [35, 15, 44, 15, 1, 8, 13, 32]", "assert spin([]) == []"], "test_code": "assert spin([20, 13, 14, 29, 50, 15, 49, 48]) == [13, 14, 29, 50, 15, 49, 48, 20]\nassert spin([25, -2, -7, 50, 5, 27, 43]) == [-2, -7, 50, 5, 27, 43, 25]\nassert spin([32, 5, 18, 43, 23, -6, 38, 23, 28, 23]) == [5, 18, 43, 23, -6, 38, 23, 28, 23, 32]\nassert spin([46, 4, -3, 46, 10, 15, -4, 29, 36, -9, 39]) == [4, -3, 46, 10, 15, -4, 29, 36, -9, 39, 46]\nassert spin([50]) == [50]\nassert spin([32, 35, 15, 44, 15, 1, 8, 13]) == [35, 15, 44, 15, 1, 8, 13, 32]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 1 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([20, 13, 14, 29, 50, 15, 49, 48])` يُرجع `[13, 14, 29, 50, 15, 49, 48, 20]`.\nالجواب:", "qhash": "da957c0263a04fcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(406859101))\nprint(f(f(406859101)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(406859101))\nprint(f(f(406859101)))\n```\nالجواب:", "qhash": "bf73a227363c1bbf", "answer": "34\n7", "completion": " الناتج:\n```text\n34\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'bt'}", "tests": ["assert freq_of('garden data winter') == {'b': 0, 't': 2}", "assert freq_of('of desert a is go') == {'b': 0, 't': 1}", "assert freq_of('vector signal') == {'b': 0, 't': 1}", "assert freq_of('matrix in we up') == {'b': 0, 't': 1}", "assert freq_of('in desert desert data engine camel') == {'b': 0, 't': 3}", "assert freq_of('matrix we we signal') == {'b': 0, 't': 1}", "assert freq_of('') == {'b': 0, 't': 0}"], "test_code": "assert freq_of('garden data winter') == {'b': 0, 't': 2}\nassert freq_of('of desert a is go') == {'b': 0, 't': 1}\nassert freq_of('vector signal') == {'b': 0, 't': 1}\nassert freq_of('matrix in we up') == {'b': 0, 't': 1}\nassert freq_of('in desert desert data engine camel') == {'b': 0, 't': 3}\nassert freq_of('matrix we we signal') == {'b': 0, 't': 1}\nassert freq_of('') == {'b': 0, 't': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'bt'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'bt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('garden data winter')` يُرجع `{'b': 0, 't': 2}`.\nالجواب:", "qhash": "41084124d21a4712"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 93:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([1, 4, 15, 22, 43, 31, 10, 14]) == [1, 5, 20, 42, 85, 0, 10, 24]", "assert rolling_total([72, 14, 43, 20, 47, 12, 90, 30, 88, 7]) == [72, 86, 0, 20, 67, 79, 0, 30, 0, 7]", "assert rolling_total([81, 3, -7, 45, 82]) == [81, 84, 77, 0, 82]", "assert rolling_total([60, -4, 23]) == [60, 56, 79]", "assert rolling_total([73]) == [73]", "assert rolling_total([92, 86, -6, 24, 79]) == [92, 0, -6, 18, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([1, 4, 15, 22, 43, 31, 10, 14]) == [1, 5, 20, 42, 85, 0, 10, 24]\nassert rolling_total([72, 14, 43, 20, 47, 12, 90, 30, 88, 7]) == [72, 86, 0, 20, 67, 79, 0, 30, 0, 7]\nassert rolling_total([81, 3, -7, 45, 82]) == [81, 84, 77, 0, 82]\nassert rolling_total([60, -4, 23]) == [60, 56, 79]\nassert rolling_total([73]) == [73]\nassert rolling_total([92, 86, -6, 24, 79]) == [92, 0, -6, 18, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 93:\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 > 93:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 93 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([1, 4, 15, 22, 43, 31, 10, 14])` يجب أن تُرجع `[1, 5, 20, 42, 85, 0, 10, 24]`.\nالجواب:", "qhash": "aa5c137ce5dce330"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [(x + 5) // 3 for x in range(-3, 6) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [(x + 5) // 3 for x in range(-3, 6) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "fcdfdec9bdfade80", "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": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [20, -5, 19, 24, -5]\nprint(items[0:1])\nprint(items[::3])\nprint(max(items[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [20, -5, 19, 24, -5]\nprint(items[0:1])\nprint(items[::3])\nprint(max(items[0:1]))\n```\nالجواب:", "qhash": "3af03a5c0ad64380", "answer": "[20]\n[20, 24]\n20", "completion": " الناتج:\n```text\n[20]\n[20, 24]\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -3 for x in xs if 16 <= x <= 38)", "tests": ["assert between_times([20, 27, 38, 17]) == [-114, -81, -60, -51]", "assert between_times([]) == []", "assert between_times([59]) == []", "assert between_times([40]) == []", "assert between_times([46, 19, -11, 32, -23, 30, -1, -22]) == [-96, -90, -57]", "assert between_times([59]) == []", "assert between_times([-23, 45, -25, 13, 51, 35, 54, -8, -14]) == [-105]", "assert between_times([]) == []"], "test_code": "assert between_times([20, 27, 38, 17]) == [-114, -81, -60, -51]\nassert between_times([]) == []\nassert between_times([59]) == []\nassert between_times([40]) == []\nassert between_times([46, 19, -11, 32, -23, 30, -1, -22]) == [-96, -90, -57]\nassert between_times([59]) == []\nassert between_times([-23, 45, -25, 13, 51, 35, 54, -8, -14]) == [-105]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -3 for x in xs if 16 <= x <= 38)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -3 for x in xs if 16 <= x <= 38)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 16 ≤ x ≤ 38، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([20, 27, 38, 17])` يُرجع `[-114, -81, -60, -51]`.\nالجواب:", "qhash": "8dfa13f17ffe9319"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('زينب', 11), ('باسل', 86), ('أحمد', 73), ('مريم', 54)]\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 = [('زينب', 11), ('باسل', 86), ('أحمد', 73), ('مريم', 54)]\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": "d3a68e410d454deb", "answer": "[('زينب', 11), ('مريم', 54), ('أحمد', 73), ('باسل', 86)]\n['باسل', 'أحمد']", "completion": " الناتج:\n```text\n[('زينب', 11), ('مريم', 54), ('أحمد', 73), ('باسل', 86)]\n['باسل', 'أحمد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [20, -2, 4, -6, 13, 24, 0, -2]\nprint(lst[2:6])\nprint(lst[::2])\nprint(min(lst[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [20, -2, 4, -6, 13, 24, 0, -2]\nprint(lst[2:6])\nprint(lst[::2])\nprint(min(lst[2:6]))\n```\nالجواب:", "qhash": "dc72e58238d8f462", "answer": "[4, -6, 13, 24]\n[20, 4, 13, 0]\n-6", "completion": " الناتج:\n```text\n[4, -6, 13, 24]\n[20, 4, 13, 0]\n-6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 67) == 1)", "tests": ["assert coprime_count(73) == 72", "assert coprime_count(192) == 190", "assert coprime_count(130) == 129", "assert coprime_count(78) == 77", "assert coprime_count(76) == 75", "assert coprime_count(171) == 169", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(73) == 72\nassert coprime_count(192) == 190\nassert coprime_count(130) == 129\nassert coprime_count(78) == 77\nassert coprime_count(76) == 75\nassert coprime_count(171) == 169\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, 67) == 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, 67) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 67) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(73)` يُرجع `72`.\nالجواب:", "qhash": "6c0abd08c4a53c08"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'و' in w)", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «و» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('برمجة مدينة نهر خبز لغة')` يُرجع `0`.\nالجواب:", "qhash": "3c8afd098e5a9fc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 5", "tests": ["assert digits_mod(96451) == 4", "assert digits_mod(838812) == 1", "assert digits_mod(813813) == 1", "assert digits_mod(459342) == 0", "assert digits_mod(396427) == 1", "assert digits_mod(557348) == 4", "assert digits_mod(605405) == 2", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(96451) == 4\nassert digits_mod(838812) == 1\nassert digits_mod(813813) == 1\nassert digits_mod(459342) == 0\nassert digits_mod(396427) == 1\nassert digits_mod(557348) == 4\nassert digits_mod(605405) == 2\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 5", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 5\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 5.\nللتوضيح: الاستدعاء `digits_mod(96451)` يُرجع `4`.\nالجواب:", "qhash": "4484c6dec1bc5585"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-7, 29, 21, 26, 10, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-7, 29, 21, 26, 10, 35]\nprint(sorted(nums, key=lambda x: (abs(x - 4), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "c11da9313b7513cb", "answer": "[10, -7, 21, 26, 29, 35]\n[35, 29, 26]", "completion": " الناتج:\n```text\n[10, -7, 21, 26, 29, 35]\n[35, 29, 26]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'light'\nprint(name.upper())\nprint(name.find('l'))\nprint(name.index('l') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'light'\nprint(name.upper())\nprint(name.find('l'))\nprint(name.index('l') + len(name))\n```\nالجواب:", "qhash": "ee8b01aefa80c992", "answer": "LIGHT\n0\n5", "completion": " الناتج:\n```text\nLIGHT\n0\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([70, 57, 37, 60, 65, 87, 81]) == 1", "assert how_many_div([-29, 24, 90, 26, 11, 53, -3, 40]) == 0", "assert how_many_div([-40, -40, 81, 86, -12, 49, -29, 17, 18, 69, 25]) == 1", "assert how_many_div([38, 74, 17, 0, 35, 81, 84, 27]) == 1", "assert how_many_div([40, 58, -36, 1, 13, -40, 86, -40, 30]) == 0", "assert how_many_div([44, 42, -35, -30, 56, -7, 6, 76, 34]) == 1", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([70, 57, 37, 60, 65, 87, 81]) == 1\nassert how_many_div([-29, 24, 90, 26, 11, 53, -3, 40]) == 0\nassert how_many_div([-40, -40, 81, 86, -12, 49, -29, 17, 18, 69, 25]) == 1\nassert how_many_div([38, 74, 17, 0, 35, 81, 84, 27]) == 1\nassert how_many_div([40, 58, -36, 1, 13, -40, 86, -40, 30]) == 0\nassert how_many_div([44, 42, -35, -30, 56, -7, 6, 76, 34]) == 1\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 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 % 5 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 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([70, 57, 37, 60, 65, 87, 81])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "7902ba951968d406"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 142\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 = 142\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": "3cf4fd3de75f6d04", "answer": "103", "completion": " الناتج:\n```text\n103\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 41", "tests": ["assert multi_fact(5) == 15", "assert multi_fact(51) == 0", "assert multi_fact(36) == 3", "assert multi_fact(27) == 8", "assert multi_fact(54) == 32", "assert multi_fact(13) == 40", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(5) == 15\nassert multi_fact(51) == 0\nassert multi_fact(36) == 3\nassert multi_fact(27) == 8\nassert multi_fact(54) == 32\nassert multi_fact(13) == 40\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 41", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(5)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "fc3feaa2c148761a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18']", "assert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20']", "assert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15']", "assert fizz(6) == ['1', '2', '3', '4', '5', '6']", "assert fizz(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20', 'Foo', 'Bar', '23', '24', '25']"], "test_code": "assert fizz(18) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18']\nassert fizz(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20']\nassert fizz(15) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15']\nassert fizz(6) == ['1', '2', '3', '4', '5', '6']\nassert fizz(25) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18', '19', '20', 'Foo', 'Bar', '23', '24', '25']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Foo'\n if i % 11 == 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 % 7 == 0:\n s += 'Foo'\n if i % 11 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Foo'، وإن قَبِلها على 11 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(18)` يُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', '10', 'Bar', '12', '13', 'Foo', '15', '16', '17', '18']`.\nالجواب:", "qhash": "6d33898886c09cc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 26475\nsteps = 0\nwhile x > 16:\n x = x // 3\n steps += 1\nprint(x, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 26475\nsteps = 0\nwhile x > 16:\n x = x // 3\n steps += 1\nprint(x, steps)\n```\nالجواب:", "qhash": "f53fd50ae17a68ff", "answer": "12 7", "completion": " الناتج:\n```text\n12 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(compute(-1))\nprint(compute(-1, -3))\nprint(compute(compute(-3), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(compute(-1))\nprint(compute(-1, -3))\nprint(compute(compute(-3), -1))\n```\nالجواب:", "qhash": "7482991ca9951cc8", "answer": "-7\n5\n-7", "completion": " الناتج:\n```text\n-7\n5\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 46", "tests": ["assert digit_score(6474) == 43", "assert digit_score(206235) == 16", "assert digit_score(997040) == 25", "assert digit_score(901357) == 29", "assert digit_score(522731) == 6", "assert digit_score(785025) == 9", "assert digit_score(331969) == 27", "assert digit_score(0) == 0"], "test_code": "assert digit_score(6474) == 43\nassert digit_score(206235) == 16\nassert digit_score(997040) == 25\nassert digit_score(901357) == 29\nassert digit_score(522731) == 6\nassert digit_score(785025) == 9\nassert digit_score(331969) == 27\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 46", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 46\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 46.\nمثال: `digit_score(6474)` يجب أن تُرجع `43`.\nالجواب:", "qhash": "fd11780181e378c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 33:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([3, 12, 3, 1, 19, 11, 11, 12]) == [3, 15, 18, 19, 0, 11, 22, 0]", "assert cumulative([24, -8, 22, 10, 7, 27]) == [24, 16, 0, 10, 17, 0]", "assert cumulative([17, 29, 16, 30, 20, -4, 16, 8, 20]) == [17, 0, 16, 0, 20, 16, 32, 0, 20]", "assert cumulative([5, 10, -1, -10, 19, 27]) == [5, 15, 14, 4, 23, 0]", "assert cumulative([0]) == [0]", "assert cumulative([-4, -10, 27, -4, 30, 21, 29, 26, 29, 33]) == [-4, -14, 13, 9, 0, 21, 0, 26, 0, 33]", "assert cumulative([]) == []"], "test_code": "assert cumulative([3, 12, 3, 1, 19, 11, 11, 12]) == [3, 15, 18, 19, 0, 11, 22, 0]\nassert cumulative([24, -8, 22, 10, 7, 27]) == [24, 16, 0, 10, 17, 0]\nassert cumulative([17, 29, 16, 30, 20, -4, 16, 8, 20]) == [17, 0, 16, 0, 20, 16, 32, 0, 20]\nassert cumulative([5, 10, -1, -10, 19, 27]) == [5, 15, 14, 4, 23, 0]\nassert cumulative([0]) == [0]\nassert cumulative([-4, -10, 27, -4, 30, 21, 29, 26, 29, 33]) == [-4, -14, 13, 9, 0, 21, 0, 26, 0, 33]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 33:\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 > 33:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 33 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([3, 12, 3, 1, 19, 11, 11, 12])` يجب أن تُرجع `[3, 15, 18, 19, 0, 11, 22, 0]`.\nالجواب:", "qhash": "aef3522b4ada49d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('banana up') == 'zylyly sn'", "assert rotate_letters('code code !') == 'ambc ambc !'", "assert rotate_letters('coffee A1') == 'amddcc A1'", "assert rotate_letters('cloud a !') == 'ajmsb y !'", "assert rotate_letters('planet orange') == 'njylcr mpylec'", "assert rotate_letters('light camel we vector OK') == 'jgefr aykcj uc tcarmp OK'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('banana up') == 'zylyly sn'\nassert rotate_letters('code code !') == 'ambc ambc !'\nassert rotate_letters('coffee A1') == 'amddcc A1'\nassert rotate_letters('cloud a !') == 'ajmsb y !'\nassert rotate_letters('planet orange') == 'njylcr mpylec'\nassert rotate_letters('light camel we vector OK') == 'jgefr aykcj uc tcarmp 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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('banana up')` يجب أن تُرجع `'zylyly sn'`.\nالجواب:", "qhash": "150738792bdc7175"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 59", "tests": ["assert sum_digit_pow(39470) == 37", "assert sum_digit_pow(397564) == 39", "assert sum_digit_pow(412368) == 12", "assert sum_digit_pow(80542) == 50", "assert sum_digit_pow(790151) == 39", "assert sum_digit_pow(305400) == 50", "assert sum_digit_pow(763548) == 22", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(39470) == 37\nassert sum_digit_pow(397564) == 39\nassert sum_digit_pow(412368) == 12\nassert sum_digit_pow(80542) == 50\nassert sum_digit_pow(790151) == 39\nassert sum_digit_pow(305400) == 50\nassert sum_digit_pow(763548) == 22\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 59", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 59.\nللتوضيح: الاستدعاء `sum_digit_pow(39470)` يُرجع `37`.\nالجواب:", "qhash": "8d253c51166389a9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 37", "tests": ["assert multi_fact(6) == 18", "assert multi_fact(37) == 0", "assert multi_fact(16) == 2", "assert multi_fact(7) == 28", "assert multi_fact(42) == 34", "assert multi_fact(52) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(6) == 18\nassert multi_fact(37) == 0\nassert multi_fact(16) == 2\nassert multi_fact(7) == 28\nassert multi_fact(42) == 34\nassert multi_fact(52) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 37", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(6)` يُرجع `18`.\nالجواب:", "qhash": "89aa727d870802f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 1 for x in range(0, 6) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 1 for x in range(0, 6) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "87ec070e7d265cdf", "answer": "[-1, 15]\n2 14", "completion": " الناتج:\n```text\n[-1, 15]\n2 14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_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 how_many_div([33, 90, 7, 61, 3, 18]) == 2", "assert how_many_div([52, -1]) == 0", "assert how_many_div([37, 37]) == 0", "assert how_many_div([24, 7, 58, 40, 59]) == 0", "assert how_many_div([46, 9, 35, 82]) == 0", "assert how_many_div([15, 8, -19]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([33, 90, 7, 61, 3, 18]) == 2\nassert how_many_div([52, -1]) == 0\nassert how_many_div([37, 37]) == 0\nassert how_many_div([24, 7, 58, 40, 59]) == 0\nassert how_many_div([46, 9, 35, 82]) == 0\nassert how_many_div([15, 8, -19]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_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 how_many_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 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([33, 90, 7, 61, 3, 18])` يُرجع `2`.\nالجواب:", "qhash": "abf9e2974d1b87a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= -13)", "tests": ["assert in_range_scaled([-22, -4, -15, -20, -10, -28]) == [75]", "assert in_range_scaled([32, 58, 14]) == []", "assert in_range_scaled([2, -12, -1, -12, 32, 26, 28]) == []", "assert in_range_scaled([39, 29, 19, 55, -4]) == []", "assert in_range_scaled([18, -24, -19, -24, 34, -24, -1]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([-28, 25, -22]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-22, -4, -15, -20, -10, -28]) == [75]\nassert in_range_scaled([32, 58, 14]) == []\nassert in_range_scaled([2, -12, -1, -12, 32, 26, 28]) == []\nassert in_range_scaled([39, 29, 19, 55, -4]) == []\nassert in_range_scaled([18, -24, -19, -24, 34, -24, -1]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([-28, 25, -22]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= -13)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -18 <= x <= -13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -18 ≤ x ≤ -13، اضرب كلًا منها في -5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([-22, -4, -15, -20, -10, -28])` يُرجع `[75]`.\nالجواب:", "qhash": "55dcf9c874ff6186"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 16)", "tests": ["assert filter_range([-14, 3, 4, -20, 14, 20, -10]) == [-42, -30, 9, 12, 42]", "assert filter_range([6, 0, -26]) == [0, 18]", "assert filter_range([-23, 19, 19, 25, -16, 3, 0]) == [-48, 0, 9]", "assert filter_range([43, 36, -25, -11, 13, 22]) == [-33, 39]", "assert filter_range([13]) == [39]", "assert filter_range([-10, 31, -12]) == [-36, -30]", "assert filter_range([-25, 16, 0, 5, 14, -9, -6, 27, -17]) == [-51, -27, -18, 0, 15, 42, 48]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-14, 3, 4, -20, 14, 20, -10]) == [-42, -30, 9, 12, 42]\nassert filter_range([6, 0, -26]) == [0, 18]\nassert filter_range([-23, 19, 19, 25, -16, 3, 0]) == [-48, 0, 9]\nassert filter_range([43, 36, -25, -11, 13, 22]) == [-33, 39]\nassert filter_range([13]) == [39]\nassert filter_range([-10, 31, -12]) == [-36, -30]\nassert filter_range([-25, 16, 0, 5, 14, -9, -6, 27, -17]) == [-51, -27, -18, 0, 15, 42, 48]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 16)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if -18 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و16 (شاملًا الطرفين) في 3.\nمثال: `filter_range([-14, 3, 4, -20, 14, 20, -10])` يجب أن تُرجع `[-42, -30, 9, 12, 42]`.\nالجواب:", "qhash": "9ddac28c01cfec65"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('تفاحة يمل يمل ماء بيت') == 2", "assert lead_count('قلم حصان سفينة قهوة رمل ماء') == 0", "assert lead_count('صحراء يمل شجرة فجر مطر علم شجرة') == 1", "assert lead_count('يمل شجرة شمس رمل') == 1", "assert lead_count('فجر جبل يمل') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('لغة سماء تفاحة يمل سلام') == 1\nassert lead_count('تفاحة يمل يمل ماء بيت') == 2\nassert lead_count('قلم حصان سفينة قهوة رمل ماء') == 0\nassert lead_count('صحراء يمل شجرة فجر مطر علم شجرة') == 1\nassert lead_count('يمل شجرة شمس رمل') == 1\nassert lead_count('فجر جبل يمل') == 1\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 'ي' in w:\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 'ي' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('لغة سماء تفاحة يمل سلام')` يُرجع `1`.\nالجواب:", "qhash": "e3a8d868b4de2ba9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ج'):\n count += 1\n return count", "tests": ["assert count_start('لغة مدرسة مدرسة خبز') == 0", "assert count_start('جبل جمل بحر مطر ليل') == 2", "assert count_start('مكتبة تفاحة جبل طائرة جبل تفاحة') == 2", "assert count_start('سوق حصان') == 0", "assert count_start('جبل قهوة حاسوب جمل') == 2", "assert count_start('جمل حاسوب جبل صحراء ماء') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('لغة مدرسة مدرسة خبز') == 0\nassert count_start('جبل جمل بحر مطر ليل') == 2\nassert count_start('مكتبة تفاحة جبل طائرة جبل تفاحة') == 2\nassert count_start('سوق حصان') == 0\nassert count_start('جبل قهوة حاسوب جمل') == 2\nassert count_start('جمل حاسوب جبل صحراء ماء') == 2\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ج'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(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_start(s):\n count = 0\n for w in s.split():\n if w.endswith('ج'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('لغة مدرسة مدرسة خبز')` يُرجع `0`.\nالجواب:", "qhash": "f80b3c73239ec4cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('desert banana orange in light OK') == 'sthtgi qpcpcp dgpcvt xc axvwi OK'", "assert caesar('up OK') == 'je OK'", "assert caesar('up garden orange is') == 'je vpgstc dgpcvt xh'", "assert caesar('brain orange') == 'qgpxc dgpcvt'", "assert caesar('an code we on') == 'pc rdst lt dc'", "assert caesar('of Hello') == 'du Htaad'", "assert caesar('') == ''"], "test_code": "assert caesar('desert banana orange in light OK') == 'sthtgi qpcpcp dgpcvt xc axvwi OK'\nassert caesar('up OK') == 'je OK'\nassert caesar('up garden orange is') == 'je vpgstc dgpcvt xh'\nassert caesar('brain orange') == 'qgpxc dgpcvt'\nassert caesar('an code we on') == 'pc rdst lt dc'\nassert caesar('of Hello') == 'du Htaad'\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 + (15)) % 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 + (15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('desert banana orange in light OK')` يجب أن تُرجع `'sthtgi qpcpcp dgpcvt xc axvwi OK'`.\nالجواب:", "qhash": "e623ccac93ad82a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=5):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(f(15))\nprint(f(15, -9))\nprint(f(f(-9), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=5):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(f(15))\nprint(f(15, -9))\nprint(f(f(-9), 15))\n```\nالجواب:", "qhash": "493934875243277d", "answer": "-65\n-51\n-89", "completion": " الناتج:\n```text\n-65\n-51\n-89\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['cloud', 'summer', 'desert', 'orange', 'light']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['cloud', 'summer', 'desert', 'orange', 'light']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "d8fa9d13fd1374d8", "answer": "['cloud', 'light', 'summer', 'desert', 'orange']\n['summer', 'orange', 'desert']", "completion": " الناتج:\n```text\n['cloud', 'light', 'summer', 'desert', 'orange']\n['summer', 'orange', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 50", "tests": ["assert dig_pow_mod(44064) == 8", "assert dig_pow_mod(610680) == 45", "assert dig_pow_mod(914671) == 4", "assert dig_pow_mod(417724) == 23", "assert dig_pow_mod(699455) == 38", "assert dig_pow_mod(907199) == 31", "assert dig_pow_mod(382242) == 27", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(44064) == 8\nassert dig_pow_mod(610680) == 45\nassert dig_pow_mod(914671) == 4\nassert dig_pow_mod(417724) == 23\nassert dig_pow_mod(699455) == 38\nassert dig_pow_mod(907199) == 31\nassert dig_pow_mod(382242) == 27\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 50", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 50\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 50.\nللتوضيح: الاستدعاء `dig_pow_mod(44064)` يُرجع `8`.\nالجواب:", "qhash": "cce880013077700b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'hs'}", "tests": ["assert char_freq('an river') == {'h': 0, 's': 0}", "assert char_freq('code light in up garden cloud') == {'h': 1, 's': 0}", "assert char_freq('it is garden an') == {'h': 0, 's': 1}", "assert char_freq('matrix up vector window garden pixel') == {'h': 0, 's': 0}", "assert char_freq('stone code banana') == {'h': 0, 's': 1}", "assert char_freq('on') == {'h': 0, 's': 0}", "assert char_freq('') == {'h': 0, 's': 0}"], "test_code": "assert char_freq('an river') == {'h': 0, 's': 0}\nassert char_freq('code light in up garden cloud') == {'h': 1, 's': 0}\nassert char_freq('it is garden an') == {'h': 0, 's': 1}\nassert char_freq('matrix up vector window garden pixel') == {'h': 0, 's': 0}\nassert char_freq('stone code banana') == {'h': 0, 's': 1}\nassert char_freq('on') == {'h': 0, 's': 0}\nassert char_freq('') == {'h': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'hs'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'hs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('an river')` يجب أن تُرجع `{'h': 0, 's': 0}`.\nالجواب:", "qhash": "f12ab7b22d726932"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 2:\n return n + 3\n return go(n - 1) + go(n - 2)\n\nprint(go(6))\n```\nالجواب:", "qhash": "6c30f56dd48c49d3", "answer": "47", "completion": " الناتج:\n```text\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('منى', 24), ('أحمد', 17), ('علي', 20), ('مريم', 51)]\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 = [('منى', 24), ('أحمد', 17), ('علي', 20), ('مريم', 51)]\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": "d6788ed257e43cbd", "answer": "[('أحمد', 17), ('علي', 20), ('منى', 24), ('مريم', 51)]\n['مريم', 'منى']", "completion": " الناتج:\n```text\n[('أحمد', 17), ('علي', 20), ('منى', 24), ('مريم', 51)]\n['مريم', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سلام جبل بيت علم بيت') == 1", "assert count_in_text('سيارة مطر مطر وردة تفاحة مدرسة نور') == 0", "assert count_in_text('دفتر سوق جمل عمل معلم ميناء ماء قهوة') == 2", "assert count_in_text('حاسوب طالب شمس سماء حاسوب نهر') == 0", "assert count_in_text('سماء ميناء نهر سيارة طالب ليل') == 0", "assert count_in_text('رمل ميناء معلم') == 1", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('حاسوب شجرة وردة خبز باب طائرة حديقة') == 0\nassert count_in_text('سلام جبل بيت علم بيت') == 1\nassert count_in_text('سيارة مطر مطر وردة تفاحة مدرسة نور') == 0\nassert count_in_text('دفتر سوق جمل عمل معلم ميناء ماء قهوة') == 2\nassert count_in_text('حاسوب طالب شمس سماء حاسوب نهر') == 0\nassert count_in_text('سماء ميناء نهر سيارة طالب ليل') == 0\nassert count_in_text('رمل ميناء معلم') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ع» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('حاسوب شجرة وردة خبز باب طائرة حديقة')` يُرجع `0`.\nالجواب:", "qhash": "f01aa1bc7237ab1b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "tests": ["assert scaled_powers(4) == 3894", "assert scaled_powers(2) == 187", "assert scaled_powers(12) == 667810", "assert scaled_powers(1) == 11", "assert scaled_powers(14) == 1404557", "assert scaled_powers(1) == 11", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(4) == 3894\nassert scaled_powers(2) == 187\nassert scaled_powers(12) == 667810\nassert scaled_powers(1) == 11\nassert scaled_powers(14) == 1404557\nassert scaled_powers(1) == 11\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 4\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 4\n return total\n```\nمثال: `scaled_powers(4)` يجب أن تُرجع `3894`.\nالجواب:", "qhash": "ec545416ff743524"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سيارة سفينة'\nprint(text.find('ب'))\nprint('ب' in text)\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سيارة سفينة'\nprint(text.find('ب'))\nprint('ب' in text)\nprint(text[0])\n```\nالجواب:", "qhash": "8b8b22eedace3c97", "answer": "-1\nFalse\nس", "completion": " الناتج:\n```text\n-1\nFalse\nس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=5):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(-8))\nprint(g(-8, -7))\nprint(g(g(-7), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=5):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(-8))\nprint(g(-8, -7))\nprint(g(g(-7), -8))\n```\nالجواب:", "qhash": "87dec244d2b44ba3", "answer": "-18\n6\n-1", "completion": " الناتج:\n```text\n-18\n6\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -9 * x ** 2 + (4) * x + (4)", "tests": ["assert quad(9) == -689", "assert quad(0) == 4", "assert quad(5) == -201", "assert quad(-10) == -936", "assert quad(14) == -1704", "assert quad(-7) == -465", "assert quad(-17) == -2665", "assert quad(0) == 4"], "test_code": "assert quad(9) == -689\nassert quad(0) == 4\nassert quad(5) == -201\nassert quad(-10) == -936\nassert quad(14) == -1704\nassert quad(-7) == -465\nassert quad(-17) == -2665\nassert quad(0) == 4", "answer": "def quad(x):\n return -9 * x ** 2 + (4) * x + (4)", "completion": " ```python\ndef quad(x):\n return -9 * x ** 2 + (4) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -9x² + 4x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(9)` يُرجع `-689`.\nالجواب:", "qhash": "a6e0a66cb9dff586"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('هشام', 67), ('ليلى', 95), ('رنا', 94), ('أحمد', 28)]\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 = [('هشام', 67), ('ليلى', 95), ('رنا', 94), ('أحمد', 28)]\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": "d9de6a83a88b2c84", "answer": "[('أحمد', 28), ('هشام', 67), ('رنا', 94), ('ليلى', 95)]\n['ليلى', 'رنا']", "completion": " الناتج:\n```text\n[('أحمد', 28), ('هشام', 67), ('رنا', 94), ('ليلى', 95)]\n['ليلى', 'رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([-16, 16, 40, -4, 35, -4]) == None", "assert find_max_div([-48, -60, -60]) == -48", "assert find_max_div([1, 13, 25, 37]) == None", "assert find_max_div([6, 30]) == None", "assert find_max_div([31, -49, -11, -46]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-16, 16, 40, -4, 35, -4]) == None\nassert find_max_div([-48, -60, -60]) == -48\nassert find_max_div([1, 13, 25, 37]) == None\nassert find_max_div([6, 30]) == None\nassert find_max_div([31, -49, -11, -46]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef find_max_div(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مثال: `find_max_div([-16, 16, 40, -4, 35, -4])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "e0d99bb73024b701"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(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_div([52, 63, 6, 25, 13, 29, 53]) == 1", "assert count_div([25, 52, -13, 64, -31, 16, -38, 20]) == 4", "assert count_div([]) == 0", "assert count_div([29]) == 0", "assert count_div([57, 12]) == 1", "assert count_div([77, -25, 40, -39, 44]) == 2", "assert count_div([]) == 0"], "test_code": "assert count_div([52, 63, 6, 25, 13, 29, 53]) == 1\nassert count_div([25, 52, -13, 64, -31, 16, -38, 20]) == 4\nassert count_div([]) == 0\nassert count_div([29]) == 0\nassert count_div([57, 12]) == 1\nassert count_div([77, -25, 40, -39, 44]) == 2\nassert count_div([]) == 0", "answer": "def count_div(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_div(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_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_div([52, 63, 6, 25, 13, 29, 53])` يُرجع `1`.\nالجواب:", "qhash": "bb7969d40ea92959"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([20, 42, 8, 52, 3, 42, 60]) == [20, 62, 70, 122, 125, 167, 0]", "assert capped_cumsum([70, 148, 15, 166, 124, 113]) == [70, 0, 15, 181, 0, 113]", "assert capped_cumsum([14, 99, 111]) == [14, 113, 0]", "assert capped_cumsum([83, 74, 131, 118, 18]) == [83, 157, 0, 118, 136]", "assert capped_cumsum([17, 113, 177, -1, 163, -7]) == [17, 130, 0, -1, 162, 155]", "assert capped_cumsum([152, 12]) == [152, 164]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([20, 42, 8, 52, 3, 42, 60]) == [20, 62, 70, 122, 125, 167, 0]\nassert capped_cumsum([70, 148, 15, 166, 124, 113]) == [70, 0, 15, 181, 0, 113]\nassert capped_cumsum([14, 99, 111]) == [14, 113, 0]\nassert capped_cumsum([83, 74, 131, 118, 18]) == [83, 157, 0, 118, 136]\nassert capped_cumsum([17, 113, 177, -1, 163, -7]) == [17, 130, 0, -1, 162, 155]\nassert capped_cumsum([152, 12]) == [152, 164]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 182:\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 > 182:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 182 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([20, 42, 8, 52, 3, 42, 60])` يُرجع `[20, 62, 70, 122, 125, 167, 0]`.\nالجواب:", "qhash": "318118d93686e9a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 31) == 1)", "tests": ["assert count_coprime(30) == 30", "assert count_coprime(53) == 52", "assert count_coprime(133) == 129", "assert count_coprime(143) == 139", "assert count_coprime(177) == 172", "assert count_coprime(104) == 101", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(30) == 30\nassert count_coprime(53) == 52\nassert count_coprime(133) == 129\nassert count_coprime(143) == 139\nassert count_coprime(177) == 172\nassert count_coprime(104) == 101\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, 31) == 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, 31) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 31) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(30)` يُرجع `30`.\nالجواب:", "qhash": "9e57809414cfe1e7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert rotate([33, 49, 12, 19, 26, 17]) == [49, 12, 19, 26, 17, 33]", "assert rotate([18, 0, 40, 30, 41, 18]) == [0, 40, 30, 41, 18, 18]", "assert rotate([9, 8, 31, 27, 47, 5, 16, 2, 37, 8, -5, 13]) == [2, 37, 8, -5, 13, 9, 8, 31, 27, 47, 5, 16]", "assert rotate([3, -4, 6, 12, 48, -4, -9, 8, 18, 10]) == [10, 3, -4, 6, 12, 48, -4, -9, 8, 18]", "assert rotate([0, 1, 42, 40, 9, 1, 38, 44, 38, 46]) == [46, 0, 1, 42, 40, 9, 1, 38, 44, 38]", "assert rotate([39, 50, 43, 36]) == [36, 39, 50, 43]", "assert rotate([]) == []"], "test_code": "assert rotate([33, 49, 12, 19, 26, 17]) == [49, 12, 19, 26, 17, 33]\nassert rotate([18, 0, 40, 30, 41, 18]) == [0, 40, 30, 41, 18, 18]\nassert rotate([9, 8, 31, 27, 47, 5, 16, 2, 37, 8, -5, 13]) == [2, 37, 8, -5, 13, 9, 8, 31, 27, 47, 5, 16]\nassert rotate([3, -4, 6, 12, 48, -4, -9, 8, 18, 10]) == [10, 3, -4, 6, 12, 48, -4, -9, 8, 18]\nassert rotate([0, 1, 42, 40, 9, 1, 38, 44, 38, 46]) == [46, 0, 1, 42, 40, 9, 1, 38, 44, 38]\nassert rotate([39, 50, 43, 36]) == [36, 39, 50, 43]\nassert rotate([]) == []", "answer": "def rotate(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(arr):\n if not arr:\n return []\n k = 19 % len(arr)\n return ____\n```\nمثال: `rotate([33, 49, 12, 19, 26, 17])` يجب أن تُرجع `[49, 12, 19, 26, 17, 33]`.\nالجواب:", "qhash": "d81cfbe0ea9594db"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('window data planet vector an') == 'an vector planet data window'", "assert mirror_words('a') == 'a'", "assert mirror_words('by an winter go pixel coffee') == 'coffee pixel go winter an by'", "assert mirror_words('it go brain an') == 'an brain go it'", "assert mirror_words('coffee') == 'coffee'", "assert mirror_words('') == ''", "assert mirror_words('') == ''"], "test_code": "assert mirror_words('window data planet vector an') == 'an vector planet data window'\nassert mirror_words('a') == 'a'\nassert mirror_words('by an winter go pixel coffee') == 'coffee pixel go winter an by'\nassert mirror_words('it go brain an') == 'an brain go it'\nassert mirror_words('coffee') == 'coffee'\nassert mirror_words('') == ''\nassert mirror_words('') == ''", "answer": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `mirror_words('window data planet vector an')` يُرجع `'an vector planet data window'`.\nالجواب:", "qhash": "546034e7fbeed2e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [33, 29, -4, 35, 10, 22]\nprint(xs[2:5])\nprint(xs[::2])\nprint(sum(xs[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [33, 29, -4, 35, 10, 22]\nprint(xs[2:5])\nprint(xs[::2])\nprint(sum(xs[2:5]))\n```\nالجواب:", "qhash": "ba75b7a9e5897901", "answer": "[-4, 35, 10]\n[33, -4, 10]\n41", "completion": " الناتج:\n```text\n[-4, 35, 10]\n[33, -4, 10]\n41\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 44", "tests": ["assert sum_digit_pow(53550) == 26", "assert sum_digit_pow(282359) == 33", "assert sum_digit_pow(396865) == 33", "assert sum_digit_pow(792637) == 42", "assert sum_digit_pow(813159) == 15", "assert sum_digit_pow(926474) == 0", "assert sum_digit_pow(461736) == 11", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(53550) == 26\nassert sum_digit_pow(282359) == 33\nassert sum_digit_pow(396865) == 33\nassert sum_digit_pow(792637) == 42\nassert sum_digit_pow(813159) == 15\nassert sum_digit_pow(926474) == 0\nassert sum_digit_pow(461736) == 11\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 44", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 5 for d in str(n)) % 44\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 44.\nللتوضيح: الاستدعاء `sum_digit_pow(53550)` يُرجع `26`.\nالجواب:", "qhash": "fad18875116739b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(-2))\nprint(compute(-2, -10))\nprint(compute(compute(-10), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(compute(-2))\nprint(compute(-2, -10))\nprint(compute(compute(-10), -2))\n```\nالجواب:", "qhash": "63a00711fdda1557", "answer": "-7\n20\n-5", "completion": " الناتج:\n```text\n-7\n20\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 5790\nc = 0\nwhile n > 8:\n n = n // 8\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 5790\nc = 0\nwhile n > 8:\n n = n // 8\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "16abb3cb3f24655b", "answer": "1 4", "completion": " الناتج:\n```text\n1 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'lou'}", "tests": ["assert count_chars('signal') == {'l': 1, 'o': 0, 'u': 0}", "assert count_chars('camel desert code engine on') == {'l': 1, 'o': 2, 'u': 0}", "assert count_chars('table at up music') == {'l': 1, 'o': 0, 'u': 2}", "assert count_chars('it rocket stone apple a coffee') == {'l': 1, 'o': 3, 'u': 0}", "assert count_chars('by apple of brain go engine') == {'l': 1, 'o': 2, 'u': 0}", "assert count_chars('it banana in falcon') == {'l': 1, 'o': 1, 'u': 0}", "assert count_chars('') == {'l': 0, 'o': 0, 'u': 0}"], "test_code": "assert count_chars('signal') == {'l': 1, 'o': 0, 'u': 0}\nassert count_chars('camel desert code engine on') == {'l': 1, 'o': 2, 'u': 0}\nassert count_chars('table at up music') == {'l': 1, 'o': 0, 'u': 2}\nassert count_chars('it rocket stone apple a coffee') == {'l': 1, 'o': 3, 'u': 0}\nassert count_chars('by apple of brain go engine') == {'l': 1, 'o': 2, 'u': 0}\nassert count_chars('it banana in falcon') == {'l': 1, 'o': 1, 'u': 0}\nassert count_chars('') == {'l': 0, 'o': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'lou'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'lou'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'l'، 'o'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('signal')` يُرجع `{'l': 1, 'o': 0, 'u': 0}`.\nالجواب:", "qhash": "c654bf5ac15ea282"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 9) // 2 for x in range(-1, 13) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 9) // 2 for x in range(-1, 13) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "5a950ce2e1572b52", "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_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(257) == 13135", "assert mult_sum(284) == 16105", "assert mult_sum(148) == 4425", "assert mult_sum(187) == 6939", "assert mult_sum(71) == 1018", "assert mult_sum(270) == 14445", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(257) == 13135\nassert mult_sum(284) == 16105\nassert mult_sum(148) == 4425\nassert mult_sum(187) == 6939\nassert mult_sum(71) == 1018\nassert mult_sum(270) == 14445\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `mult_sum(257)` يجب أن تُرجع `13135`.\nالجواب:", "qhash": "99487d991591402c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "tests": ["assert sum_multiples(226) == 8553", "assert sum_multiples(232) == 8781", "assert sum_multiples(221) == 8104", "assert sum_multiples(56) == 517", "assert sum_multiples(37) == 234", "assert sum_multiples(232) == 8781", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(226) == 8553\nassert sum_multiples(232) == 8781\nassert sum_multiples(221) == 8104\nassert sum_multiples(56) == 517\nassert sum_multiples(37) == 234\nassert sum_multiples(232) == 8781\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 % 9 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 9.\nمثال: `sum_multiples(226)` يجب أن تُرجع `8553`.\nالجواب:", "qhash": "0eaf058f630f38c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'music'\nprint(name[3:4])\nprint(name.replace('c', '*'))\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'music'\nprint(name[3:4])\nprint(name.replace('c', '*'))\nprint(name.capitalize())\n```\nالجواب:", "qhash": "8bcdf590d81bc9d8", "answer": "i\nmusi*\nMusic", "completion": " الناتج:\n```text\ni\nmusi*\nMusic\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 2:\n return 2\n return 2 * rec(n - 1) + -1\n\nprint(rec(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 2:\n return 2\n return 2 * rec(n - 1) + -1\n\nprint(rec(11))\n```\nالجواب:", "qhash": "9a3213d83458a246", "answer": "513", "completion": " الناتج:\n```text\n513\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('banana coffee stone garden signal Hello') == 'dcpcpc eqhhgg uvqpg ictfgp ukipcn Hgnnq'", "assert encode('matrix planet') == 'ocvtkz rncpgv'", "assert encode('brain banana go desert by') == 'dtckp dcpcpc iq fgugtv da'", "assert encode('a') == 'c'", "assert encode('summer in river an go') == 'uwoogt kp tkxgt cp iq'", "assert encode('an orange matrix matrix we 2024') == 'cp qtcpig ocvtkz ocvtkz yg 2024'", "assert encode('') == ''"], "test_code": "assert encode('banana coffee stone garden signal Hello') == 'dcpcpc eqhhgg uvqpg ictfgp ukipcn Hgnnq'\nassert encode('matrix planet') == 'ocvtkz rncpgv'\nassert encode('brain banana go desert by') == 'dtckp dcpcpc iq fgugtv da'\nassert encode('a') == 'c'\nassert encode('summer in river an go') == 'uwoogt kp tkxgt cp iq'\nassert encode('an orange matrix matrix we 2024') == 'cp qtcpig ocvtkz ocvtkz yg 2024'\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 + (2)) % 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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('banana coffee stone garden signal Hello')` يُرجع `'dcpcpc eqhhgg uvqpg ictfgp ukipcn Hgnnq'`.\nالجواب:", "qhash": "92be5f68658dc667"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 1 for x in xs if 8 <= x <= 40)", "tests": ["assert select_range([18, 26, 38, 12]) == [12, 18, 26, 38]", "assert select_range([44]) == []", "assert select_range([22, -13, 29, -4, 24]) == [22, 24, 29]", "assert select_range([51, -12, 17]) == [17]", "assert select_range([57, 4, 51, -27, 55, 47, -22, 56, 52]) == []", "assert select_range([15, 56, 17, 21, -27]) == [15, 17, 21]", "assert select_range([59, -11, -30, -6, -1, 17, -12, 51, 6, -18]) == [17]", "assert select_range([]) == []"], "test_code": "assert select_range([18, 26, 38, 12]) == [12, 18, 26, 38]\nassert select_range([44]) == []\nassert select_range([22, -13, 29, -4, 24]) == [22, 24, 29]\nassert select_range([51, -12, 17]) == [17]\nassert select_range([57, 4, 51, -27, 55, 47, -22, 56, 52]) == []\nassert select_range([15, 56, 17, 21, -27]) == [15, 17, 21]\nassert select_range([59, -11, -30, -6, -1, 17, -12, 51, 6, -18]) == [17]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 1 for x in xs if 8 <= x <= 40)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 1 for x in xs if 8 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 8 ≤ x ≤ 40، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([18, 26, 38, 12])` يُرجع `[12, 18, 26, 38]`.\nالجواب:", "qhash": "d6325cdb0c2231af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(-1))\nprint(compute(-1, 7))\nprint(compute(compute(7), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=4):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(compute(-1))\nprint(compute(-1, 7))\nprint(compute(compute(7), -1))\n```\nالجواب:", "qhash": "c031309ae30da367", "answer": "19\n34\n156", "completion": " الناتج:\n```text\n19\n34\n156\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 65) == 1)", "tests": ["assert count_gcd1(141) == 105", "assert count_gcd1(62) == 46", "assert count_gcd1(108) == 80", "assert count_gcd1(89) == 67", "assert count_gcd1(147) == 109", "assert count_gcd1(161) == 119", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(141) == 105\nassert count_gcd1(62) == 46\nassert count_gcd1(108) == 80\nassert count_gcd1(89) == 67\nassert count_gcd1(147) == 109\nassert count_gcd1(161) == 119\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, 65) == 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, 65) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 65) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(141)` يُرجع `105`.\nالجواب:", "qhash": "a169f6428053b9fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('مكتبة سلام سلام باب لغة طالب جمل') == 5", "assert letter_count('نهر طائرة برمجة عربية خبز حديقة') == 0", "assert letter_count('عربية فجر شمس تفاحة علم دفتر') == 1", "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('مكتبة سلام سلام باب لغة طالب جمل') == 5\nassert letter_count('نهر طائرة برمجة عربية خبز حديقة') == 0\nassert letter_count('عربية فجر شمس تفاحة علم دفتر') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ل» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('بيت طائرة علم')` يُرجع `1`.\nالجواب:", "qhash": "00f46f103db7c963"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([59, -21, 54, 12, 56, -3, 44, 7, 50]) == 50", "assert max_div([-20, -30, -30]) == -20", "assert max_div([1, 11]) == None", "assert max_div([-5, -30, -13, -33, -29, -3, 3]) == -30", "assert max_div([16, 4, -9, -15]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([59, -21, 54, 12, 56, -3, 44, 7, 50]) == 50\nassert max_div([-20, -30, -30]) == -20\nassert max_div([1, 11]) == None\nassert max_div([-5, -30, -13, -33, -29, -3, 3]) == -30\nassert max_div([16, 4, -9, -15]) == None\nassert max_div([]) == None", "answer": "def max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `max_div([59, -21, 54, 12, 56, -3, 44, 7, 50])` يجب أن تُرجع `50`.\nالجواب:", "qhash": "b94f4ed2c99ad7c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert game(9) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9']", "assert game(11) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11']", "assert game(16) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz']", "assert game(6) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz']", "assert game(12) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz']"], "test_code": "assert game(9) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9']\nassert game(11) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11']\nassert game(16) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz', '13', 'Fizz', 'Buzz', 'Fizz']\nassert game(6) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz']\nassert game(12) == ['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9', 'FizzBuzz', '11', 'Fizz']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\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 += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Fizz'، وعلى 5 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(9)` يجب أن تُرجع `['1', 'Fizz', '3', 'Fizz', 'Buzz', 'Fizz', '7', 'Fizz', '9']`.\nالجواب:", "qhash": "4af06d79077961cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return 3 * x ** 2 + (8) * x + (-5)", "tests": ["assert value_at(9) == 310", "assert value_at(-11) == 270", "assert value_at(-17) == 726", "assert value_at(-6) == 55", "assert value_at(-10) == 215", "assert value_at(1) == 6", "assert value_at(6) == 151", "assert value_at(0) == -5"], "test_code": "assert value_at(9) == 310\nassert value_at(-11) == 270\nassert value_at(-17) == 726\nassert value_at(-6) == 55\nassert value_at(-10) == 215\nassert value_at(1) == 6\nassert value_at(6) == 151\nassert value_at(0) == -5", "answer": "def value_at(x):\n return 3 * x ** 2 + (8) * x + (-5)", "completion": " ```python\ndef value_at(x):\n return 3 * x ** 2 + (8) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود 3x² + 8x - 5 عند العدد الصحيح x.\nمثال: `value_at(9)` يجب أن تُرجع `310`.\nالجواب:", "qhash": "62dd27d4eda21ddd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_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 best_multiple([0, 52, -2, 7, 45, 36]) == 7", "assert best_multiple([-28, -7, -14]) == -7", "assert best_multiple([1]) == None", "assert best_multiple([-22, -33, 8, -26, -13, 15, 14]) == 14", "assert best_multiple([-46, 45, 37, 9, -4]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([0, 52, -2, 7, 45, 36]) == 7\nassert best_multiple([-28, -7, -14]) == -7\nassert best_multiple([1]) == None\nassert best_multiple([-22, -33, 8, -26, -13, 15, 14]) == 14\nassert best_multiple([-46, 45, 37, 9, -4]) == None\nassert best_multiple([]) == None", "answer": "def best_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 best_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 best_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 best_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للتوضيح: الاستدعاء `best_multiple([0, 52, -2, 7, 45, 36])` يُرجع `7`.\nالجواب:", "qhash": "0b5bd70294ef4bb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 49:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([13, 16, 6, 25, 17, 20, 22]) == [13, 29, 35, 0, 17, 37, 0]", "assert rolling_total([37]) == [37]", "assert rolling_total([28, 21, -5, 7, 18, 44, 8, 21, 35]) == [28, 49, 44, 0, 18, 0, 8, 29, 0]", "assert rolling_total([37, 22, 37, 33, 27, -8, 41, 23, 28]) == [37, 0, 37, 0, 27, 19, 0, 23, 0]", "assert rolling_total([10, -6]) == [10, 4]", "assert rolling_total([40, 24, 19, 13, 42, 33]) == [40, 0, 19, 32, 0, 33]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([13, 16, 6, 25, 17, 20, 22]) == [13, 29, 35, 0, 17, 37, 0]\nassert rolling_total([37]) == [37]\nassert rolling_total([28, 21, -5, 7, 18, 44, 8, 21, 35]) == [28, 49, 44, 0, 18, 0, 8, 29, 0]\nassert rolling_total([37, 22, 37, 33, 27, -8, 41, 23, 28]) == [37, 0, 37, 0, 27, 19, 0, 23, 0]\nassert rolling_total([10, -6]) == [10, 4]\nassert rolling_total([40, 24, 19, 13, 42, 33]) == [40, 0, 19, 32, 0, 33]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 49:\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 > 49:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 49 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([13, 16, 6, 25, 17, 20, 22])` يجب أن تُرجع `[13, 29, 35, 0, 17, 37, 0]`.\nالجواب:", "qhash": "16964069bcffdf2c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 3 * x ** 2 + (3) * x + (-5)", "tests": ["assert quad(8) == 211", "assert quad(6) == 121", "assert quad(-7) == 121", "assert quad(10) == 325", "assert quad(14) == 625", "assert quad(-3) == 13", "assert quad(-13) == 463", "assert quad(0) == -5"], "test_code": "assert quad(8) == 211\nassert quad(6) == 121\nassert quad(-7) == 121\nassert quad(10) == 325\nassert quad(14) == 625\nassert quad(-3) == 13\nassert quad(-13) == 463\nassert quad(0) == -5", "answer": "def quad(x):\n return 3 * x ** 2 + (3) * x + (-5)", "completion": " ```python\ndef quad(x):\n return 3 * x ** 2 + (3) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 3x² + 3x - 5 عند العدد الصحيح x.\nمثال: `quad(8)` يجب أن تُرجع `211`.\nالجواب:", "qhash": "f4fb8bc78fff13c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 4 * x ** 2 + (0) * x + (-8)", "tests": ["assert quad(7) == 188", "assert quad(13) == 668", "assert quad(9) == 316", "assert quad(-9) == 316", "assert quad(1) == -4", "assert quad(-11) == 476", "assert quad(-10) == 392", "assert quad(0) == -8"], "test_code": "assert quad(7) == 188\nassert quad(13) == 668\nassert quad(9) == 316\nassert quad(-9) == 316\nassert quad(1) == -4\nassert quad(-11) == 476\nassert quad(-10) == 392\nassert quad(0) == -8", "answer": "def quad(x):\n return 4 * x ** 2 + (0) * x + (-8)", "completion": " ```python\ndef quad(x):\n return 4 * x ** 2 + (0) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 4x² + 0x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(7)` يُرجع `188`.\nالجواب:", "qhash": "1ae5e0a09b487c47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101", "tests": ["assert multi_fact(7) == 4", "assert multi_fact(21) == 88", "assert multi_fact(19) == 9", "assert multi_fact(57) == 46", "assert multi_fact(59) == 88", "assert multi_fact(4) == 8", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(7) == 4\nassert multi_fact(21) == 88\nassert multi_fact(19) == 9\nassert multi_fact(57) == 46\nassert multi_fact(59) == 88\nassert multi_fact(4) == 8\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(7)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "aaddedc00499a83c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('دفتر سلام حصان رمل فجر شمس') == 1", "assert count_prefix('سفينة قهوة دفتر') == 0", "assert count_prefix('طائرة تفاحة رمل') == 0", "assert count_prefix('طالب حديقة قلم فجر') == 1", "assert count_prefix('حاسوب بحر فجر فجر') == 2", "assert count_prefix('مدرسة حصان لغة فجر فجر حصان ليل') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('دفتر سلام حصان رمل فجر شمس') == 1\nassert count_prefix('سفينة قهوة دفتر') == 0\nassert count_prefix('طائرة تفاحة رمل') == 0\nassert count_prefix('طالب حديقة قلم فجر') == 1\nassert count_prefix('حاسوب بحر فجر فجر') == 2\nassert count_prefix('مدرسة حصان لغة فجر فجر حصان ليل') == 2\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 'ف' in w:\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 'ف' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('دفتر سلام حصان رمل فجر شمس')` يُرجع `1`.\nالجواب:", "qhash": "7cce293f3f77ee5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 20 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([7, 5, 11, 44, 37]) == [7, 5, 11, 44, 37]", "assert rotate_list([16, 40, -8, 14, 28]) == [16, 40, -8, 14, 28]", "assert rotate_list([2, 36, 13, 14, 36, 45, 13, 9]) == [36, 45, 13, 9, 2, 36, 13, 14]", "assert rotate_list([36, 13, 43, -6, 34, 2, -6, 46, 14]) == [46, 14, 36, 13, 43, -6, 34, 2, -6]", "assert rotate_list([42, 21, 45, -6, 2, 18, 19, 17, 12]) == [17, 12, 42, 21, 45, -6, 2, 18, 19]", "assert rotate_list([16, 4, 38, 12, 28, 46, 28, 8, -3, 36, 15]) == [38, 12, 28, 46, 28, 8, -3, 36, 15, 16, 4]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([7, 5, 11, 44, 37]) == [7, 5, 11, 44, 37]\nassert rotate_list([16, 40, -8, 14, 28]) == [16, 40, -8, 14, 28]\nassert rotate_list([2, 36, 13, 14, 36, 45, 13, 9]) == [36, 45, 13, 9, 2, 36, 13, 14]\nassert rotate_list([36, 13, 43, -6, 34, 2, -6, 46, 14]) == [46, 14, 36, 13, 43, -6, 34, 2, -6]\nassert rotate_list([42, 21, 45, -6, 2, 18, 19, 17, 12]) == [17, 12, 42, 21, 45, -6, 2, 18, 19]\nassert rotate_list([16, 4, 38, 12, 28, 46, 28, 8, -3, 36, 15]) == [38, 12, 28, 46, 28, 8, -3, 36, 15, 16, 4]\nassert rotate_list([]) == []", "answer": "def rotate_list(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 rotate_list(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 rotate_list(lst):\n if not lst:\n return []\n k = 20 % len(lst)\n return ____\n```\nمثال: `rotate_list([7, 5, 11, 44, 37])` يجب أن تُرجع `[7, 5, 11, 44, 37]`.\nالجواب:", "qhash": "8badcd49c443b429"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [-4, 20, 25, 31, -8, 24, 14, 36]\nprint(a[0:2])\nprint(a[::-2])\nprint(min(a[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [-4, 20, 25, 31, -8, 24, 14, 36]\nprint(a[0:2])\nprint(a[::-2])\nprint(min(a[0:2]))\n```\nالجواب:", "qhash": "db3142ead0dd1066", "answer": "[-4, 20]\n[36, 24, 31, 20]\n-4", "completion": " الناتج:\n```text\n[-4, 20]\n[36, 24, 31, 20]\n-4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 73", "tests": ["assert multi_fact(5) == 15", "assert multi_fact(40) == 58", "assert multi_fact(48) == 68", "assert multi_fact(4) == 8", "assert multi_fact(9) == 69", "assert multi_fact(49) == 41", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(5) == 15\nassert multi_fact(40) == 58\nassert multi_fact(48) == 68\nassert multi_fact(4) == 8\nassert multi_fact(9) == 69\nassert multi_fact(49) == 41\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 73", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(5)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "5eec3eb1f01d85ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([21, 12, 22, 12, 49]) == [21, 33, 55, 67, 116]", "assert cumulative([44, 28, 20, 110, 103, 102, 50, -1, 123, 54]) == [44, 72, 92, 0, 103, 0, 50, 49, 0, 54]", "assert cumulative([52, -4, 44, 108, 1, 126, 114, 64]) == [52, 48, 92, 0, 1, 127, 0, 64]", "assert cumulative([-8, 114, 47, 22, 124]) == [-8, 106, 0, 22, 0]", "assert cumulative([37, 35, 9, 58, 35]) == [37, 72, 81, 0, 35]", "assert cumulative([57]) == [57]", "assert cumulative([]) == []"], "test_code": "assert cumulative([21, 12, 22, 12, 49]) == [21, 33, 55, 67, 116]\nassert cumulative([44, 28, 20, 110, 103, 102, 50, -1, 123, 54]) == [44, 72, 92, 0, 103, 0, 50, 49, 0, 54]\nassert cumulative([52, -4, 44, 108, 1, 126, 114, 64]) == [52, 48, 92, 0, 1, 127, 0, 64]\nassert cumulative([-8, 114, 47, 22, 124]) == [-8, 106, 0, 22, 0]\nassert cumulative([37, 35, 9, 58, 35]) == [37, 72, 81, 0, 35]\nassert cumulative([57]) == [57]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 128:\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 > 128:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 128 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([21, 12, 22, 12, 49])` يُرجع `[21, 33, 55, 67, 116]`.\nالجواب:", "qhash": "ab8871d0cee06766"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'أحمد': 43, 'وليد': 45, 'فيصل': 46}\nd['وليد'] += 10\nd['مريم'] = 4\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'أحمد': 43, 'وليد': 45, 'فيصل': 46}\nd['وليد'] += 10\nd['مريم'] = 4\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('عمر', -1))\n```\nالجواب:", "qhash": "99e67745f3a764e4", "answer": "4\nوليد\n148\n-1", "completion": " الناتج:\n```text\n4\nوليد\n148\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43", "tests": ["assert mfact(3) == 3", "assert mfact(55) == 0", "assert mfact(45) == 42", "assert mfact(2) == 2", "assert mfact(18) == 22", "assert mfact(15) == 6", "assert mfact(0) == 1"], "test_code": "assert mfact(3) == 3\nassert mfact(55) == 0\nassert mfact(45) == 42\nassert mfact(2) == 2\nassert mfact(18) == 22\nassert mfact(15) == 6\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(3)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "a933d37471128e77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 36", "tests": ["assert pow_digits(61506) == 18", "assert pow_digits(985566) == 15", "assert pow_digits(763839) == 18", "assert pow_digits(252111) == 0", "assert pow_digits(453971) == 29", "assert pow_digits(227944) == 28", "assert pow_digits(308229) == 24", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(61506) == 18\nassert pow_digits(985566) == 15\nassert pow_digits(763839) == 18\nassert pow_digits(252111) == 0\nassert pow_digits(453971) == 29\nassert pow_digits(227944) == 28\nassert pow_digits(308229) == 24\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 36", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 36\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 36.\nمثال: `pow_digits(61506)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "eb645b61bd2dc8f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('a vector apple of it') == 'it of apple vector'", "assert words_reversed('go rocket by stone planet') == 'planet stone by rocket go'", "assert words_reversed('a pixel to') == 'to pixel'", "assert words_reversed('light') == 'light'", "assert words_reversed('pixel an table cloud falcon it up') == 'up it falcon cloud table an pixel'", "assert words_reversed('summer vector') == 'vector summer'", "assert words_reversed('banana desert in signal garden by banana') == 'banana by garden signal in desert banana'"], "test_code": "assert words_reversed('a vector apple of it') == 'it of apple vector'\nassert words_reversed('go rocket by stone planet') == 'planet stone by rocket go'\nassert words_reversed('a pixel to') == 'to pixel'\nassert words_reversed('light') == 'light'\nassert words_reversed('pixel an table cloud falcon it up') == 'up it falcon cloud table an pixel'\nassert words_reversed('summer vector') == 'vector summer'\nassert words_reversed('banana desert in signal garden by banana') == 'banana by garden signal in desert banana'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `words_reversed('a vector apple of it')` يُرجع `'it of apple vector'`.\nالجواب:", "qhash": "1afc9db650c2503e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(94) == 766", "assert total_multiples(65) == 372", "assert total_multiples(176) == 2604", "assert total_multiples(183) == 2962", "assert total_multiples(191) == 3146", "assert total_multiples(269) == 6588", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(94) == 766\nassert total_multiples(65) == 372\nassert total_multiples(176) == 2604\nassert total_multiples(183) == 2962\nassert total_multiples(191) == 3146\nassert total_multiples(269) == 6588\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 % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 14.\nمثال: `total_multiples(94)` يجب أن تُرجع `766`.\nالجواب:", "qhash": "d1b4fb7e56cce893"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(666850025))\nprint(f(f(666850025)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(666850025))\nprint(f(f(666850025)))\n```\nالجواب:", "qhash": "02b5d0512e7a09c7", "answer": "38\n11", "completion": " الناتج:\n```text\n38\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('برتقال مطر شمس') == 0", "assert prefix_hits('جبل دفتر قلم جمل شجرة مطر') == 1", "assert prefix_hits('لغة طائرة قهوة') == 1", "assert prefix_hits('قمر دفتر نور سوق قلم') == 2", "assert prefix_hits('عمل تفاحة شجرة باب رمل سلام') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صديق باب قلم') == 1\nassert prefix_hits('برتقال مطر شمس') == 0\nassert prefix_hits('جبل دفتر قلم جمل شجرة مطر') == 1\nassert prefix_hits('لغة طائرة قهوة') == 1\nassert prefix_hits('قمر دفتر نور سوق قلم') == 2\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 'ق' in w:\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 'ق' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('صديق باب قلم')` يُرجع `1`.\nالجواب:", "qhash": "973166e2ba8a6994"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 25)", "tests": ["assert pick_between([9, 28, -13, 8, 26, 11, 29, -15, -15, -11]) == [40, 45, 55]", "assert pick_between([55]) == []", "assert pick_between([5, 56, 4]) == [20, 25]", "assert pick_between([22, -22, 34, 29, -19, 53, 24, 36, -16, 28]) == [110, 120]", "assert pick_between([33, -29, 8, 4, -20, 16, 38, 26, 50, 59]) == [20, 40, 80]", "assert pick_between([22, 31, 38, 32, 17]) == [85, 110]", "assert pick_between([58, 2, 28, 37, -1, 5, 36, 30, 9, -17]) == [-5, 10, 25, 45]", "assert pick_between([]) == []"], "test_code": "assert pick_between([9, 28, -13, 8, 26, 11, 29, -15, -15, -11]) == [40, 45, 55]\nassert pick_between([55]) == []\nassert pick_between([5, 56, 4]) == [20, 25]\nassert pick_between([22, -22, 34, 29, -19, 53, 24, 36, -16, 28]) == [110, 120]\nassert pick_between([33, -29, 8, 4, -20, 16, 38, 26, 50, 59]) == [20, 40, 80]\nassert pick_between([22, 31, 38, 32, 17]) == [85, 110]\nassert pick_between([58, 2, 28, 37, -1, 5, 36, 30, 9, -17]) == [-5, 10, 25, 45]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 25)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 5 for x in xs if -7 <= x <= 25)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و25 (شاملًا الطرفين) في 5.\nمثال: `pick_between([9, 28, -13, 8, 26, 11, 29, -15, -15, -11])` يجب أن تُرجع `[40, 45, 55]`.\nالجواب:", "qhash": "3579210da09ab8f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return text.count('ف')", "tests": ["assert letter_hits('وردة جبل برتقال باب معلم دفتر سيارة حديقة') == 1", "assert letter_hits('نهر بيت لغة سماء') == 0", "assert letter_hits('برمجة عربية كتاب مكتبة طالب قمر') == 0", "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('نهر بيت لغة سماء') == 0\nassert letter_hits('برمجة عربية كتاب مكتبة طالب قمر') == 0\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 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": "fe23ddcdcb9460f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo', 'Hi']", "assert play(21) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo', 'Hi', '13', 'Hi', '15', 'Hi', '17', 'Hi', '19', 'Hi', '21']", "assert play(11) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo']", "assert play(10) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi']", "assert play(10) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi']"], "test_code": "assert play(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo', 'Hi']\nassert play(21) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo', 'Hi', '13', 'Hi', '15', 'Hi', '17', 'Hi', '19', 'Hi', '21']\nassert play(11) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo']\nassert play(10) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi']\nassert play(10) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Hi'، وعلى 11 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(12)` يجب أن تُرجع `['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'Hi', '9', 'Hi', 'Yo', 'Hi']`.\nالجواب:", "qhash": "8c1da1cc99e4b41c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 3 for x in range(-4, 2) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 3 for x in range(-4, 2) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "2cf1c19b26350e09", "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": "for_loop", "template": "p_loop#1", "code": "s = 9\nfor n in range(4, 19, 1):\n s -= n * 1\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 9\nfor n in range(4, 19, 1):\n s -= n * 1\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "d1385fed0d368311", "answer": "-156\n18", "completion": " الناتج:\n```text\n-156\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 172:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([30, 43, 36, 86, 29, 31, 3, 15, 44]) == [30, 73, 109, 0, 29, 60, 63, 78, 122]", "assert rolling_total([15, 70, 157]) == [15, 85, 0]", "assert rolling_total([57, 45, 160, 136]) == [57, 102, 0, 136]", "assert rolling_total([33, 29, 41, 146, -7, 48, 70, 117, 4]) == [33, 62, 103, 0, -7, 41, 111, 0, 4]", "assert rolling_total([145, 44, 17, 67]) == [145, 0, 17, 84]", "assert rolling_total([36, 0, 35, 44, 142]) == [36, 36, 71, 115, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([30, 43, 36, 86, 29, 31, 3, 15, 44]) == [30, 73, 109, 0, 29, 60, 63, 78, 122]\nassert rolling_total([15, 70, 157]) == [15, 85, 0]\nassert rolling_total([57, 45, 160, 136]) == [57, 102, 0, 136]\nassert rolling_total([33, 29, 41, 146, -7, 48, 70, 117, 4]) == [33, 62, 103, 0, -7, 41, 111, 0, 4]\nassert rolling_total([145, 44, 17, 67]) == [145, 0, 17, 84]\nassert rolling_total([36, 0, 35, 44, 142]) == [36, 36, 71, 115, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 172:\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 > 172:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 172 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([30, 43, 36, 86, 29, 31, 3, 15, 44])` يجب أن تُرجع `[30, 73, 109, 0, 29, 60, 63, 78, 122]`.\nالجواب:", "qhash": "79d20bde778b0d77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'nst'}", "tests": ["assert tally('an rocket up vector in') == {'n': 2, 's': 0, 't': 2}", "assert tally('is we we an') == {'n': 1, 's': 1, 't': 0}", "assert tally('stone planet') == {'n': 2, 's': 1, 't': 2}", "assert tally('orange we of') == {'n': 1, 's': 0, 't': 0}", "assert tally('data at music stone a') == {'n': 1, 's': 2, 't': 3}", "assert tally('coffee light') == {'n': 0, 's': 0, 't': 1}", "assert tally('') == {'n': 0, 's': 0, 't': 0}"], "test_code": "assert tally('an rocket up vector in') == {'n': 2, 's': 0, 't': 2}\nassert tally('is we we an') == {'n': 1, 's': 1, 't': 0}\nassert tally('stone planet') == {'n': 2, 's': 1, 't': 2}\nassert tally('orange we of') == {'n': 1, 's': 0, 't': 0}\nassert tally('data at music stone a') == {'n': 1, 's': 2, 't': 3}\nassert tally('coffee light') == {'n': 0, 's': 0, 't': 1}\nassert tally('') == {'n': 0, 's': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'nst'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'nst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'n'، 's'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('an rocket up vector in')` يُرجع `{'n': 2, 's': 0, 't': 2}`.\nالجواب:", "qhash": "d518eb0ff2c139b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert roll([10, 13, 34, 22, 39]) == [39, 10, 13, 34, 22]", "assert roll([11, 2, 49, 36, 0]) == [0, 11, 2, 49, 36]", "assert roll([12, 24]) == [12, 24]", "assert roll([50, 44, 21, 39, 42, 19, -7, -4, 37, 19, -7]) == [39, 42, 19, -7, -4, 37, 19, -7, 50, 44, 21]", "assert roll([0, 35, 19, 1, 21, 35, 24]) == [0, 35, 19, 1, 21, 35, 24]", "assert roll([26, 48, 17, 42, 49, 37, 32, 18, 2, 23, 36]) == [42, 49, 37, 32, 18, 2, 23, 36, 26, 48, 17]", "assert roll([]) == []"], "test_code": "assert roll([10, 13, 34, 22, 39]) == [39, 10, 13, 34, 22]\nassert roll([11, 2, 49, 36, 0]) == [0, 11, 2, 49, 36]\nassert roll([12, 24]) == [12, 24]\nassert roll([50, 44, 21, 39, 42, 19, -7, -4, 37, 19, -7]) == [39, 42, 19, -7, -4, 37, 19, -7, 50, 44, 21]\nassert roll([0, 35, 19, 1, 21, 35, 24]) == [0, 35, 19, 1, 21, 35, 24]\nassert roll([26, 48, 17, 42, 49, 37, 32, 18, 2, 23, 36]) == [42, 49, 37, 32, 18, 2, 23, 36, 26, 48, 17]\nassert roll([]) == []", "answer": "def roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(lst):\n if not lst:\n return []\n k = 14 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `roll([10, 13, 34, 22, 39])` يُرجع `[39, 10, 13, 34, 22]`.\nالجواب:", "qhash": "b67949a43f93268a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(20))\nprint(compute(20, 15))\nprint(compute(compute(15), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=1):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(20))\nprint(compute(20, 15))\nprint(compute(compute(15), 20))\n```\nالجواب:", "qhash": "02502941b2265eeb", "answer": "59\n45\n112", "completion": " الناتج:\n```text\n59\n45\n112\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 190:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([95, 8, 19, 29, 48, 78, 32, 12]) == [95, 103, 122, 151, 0, 78, 110, 122]", "assert running_sum([92, 129, 177, 85, 95, 183, 110, 52, 38]) == [92, 0, 177, 0, 95, 0, 110, 162, 0]", "assert running_sum([54, 29, 100, 75, 7, 19]) == [54, 83, 183, 0, 7, 26]", "assert running_sum([190, 140, 85]) == [190, 0, 85]", "assert running_sum([188, 159, 126]) == [188, 0, 126]", "assert running_sum([75, 171, 166, 133]) == [75, 0, 166, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([95, 8, 19, 29, 48, 78, 32, 12]) == [95, 103, 122, 151, 0, 78, 110, 122]\nassert running_sum([92, 129, 177, 85, 95, 183, 110, 52, 38]) == [92, 0, 177, 0, 95, 0, 110, 162, 0]\nassert running_sum([54, 29, 100, 75, 7, 19]) == [54, 83, 183, 0, 7, 26]\nassert running_sum([190, 140, 85]) == [190, 0, 85]\nassert running_sum([188, 159, 126]) == [188, 0, 126]\nassert running_sum([75, 171, 166, 133]) == [75, 0, 166, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 190:\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 > 190:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 190 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([95, 8, 19, 29, 48, 78, 32, 12])` يجب أن تُرجع `[95, 103, 122, 151, 0, 78, 110, 122]`.\nالجواب:", "qhash": "7a155a49896806bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 4 for x in xs if 5 <= x <= 16)", "tests": ["assert filter_range([3, 3, 8, 2, 21, 11, -3, 20, 5]) == [20, 32, 44]", "assert filter_range([-26, 17, 58, 18, -6, 9]) == [36]", "assert filter_range([19]) == []", "assert filter_range([35, 42]) == []", "assert filter_range([4, -4, 41, 39, 6, -21, 47, -18, 14]) == [24, 56]", "assert filter_range([26, 42, 60, 53, 35, -30, 24, 20, -29]) == []", "assert filter_range([22, 50, 17, 51]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([3, 3, 8, 2, 21, 11, -3, 20, 5]) == [20, 32, 44]\nassert filter_range([-26, 17, 58, 18, -6, 9]) == [36]\nassert filter_range([19]) == []\nassert filter_range([35, 42]) == []\nassert filter_range([4, -4, 41, 39, 6, -21, 47, -18, 14]) == [24, 56]\nassert filter_range([26, 42, 60, 53, 35, -30, 24, 20, -29]) == []\nassert filter_range([22, 50, 17, 51]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 4 for x in xs if 5 <= x <= 16)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 4 for x in xs if 5 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 5 ≤ x ≤ 16، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([3, 3, 8, 2, 21, 11, -3, 20, 5])` يُرجع `[20, 32, 44]`.\nالجواب:", "qhash": "5518d36efc53a2fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -5 <= x <= 2)", "tests": ["assert pick_between([-1, -11, -4, -4]) == [-4, -4, -1]", "assert pick_between([-11, -27, 36, 36, -1, -8]) == [-1]", "assert pick_between([-7, -23, 14, 58, -15, 28, -23, 16, 45, 6]) == []", "assert pick_between([51, -3, -2, 39, -5]) == [-5, -3, -2]", "assert pick_between([58, -9, 26, 48, 49]) == []", "assert pick_between([]) == []", "assert pick_between([29]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-1, -11, -4, -4]) == [-4, -4, -1]\nassert pick_between([-11, -27, 36, 36, -1, -8]) == [-1]\nassert pick_between([-7, -23, 14, 58, -15, 28, -23, 16, 45, 6]) == []\nassert pick_between([51, -3, -2, 39, -5]) == [-5, -3, -2]\nassert pick_between([58, -9, 26, 48, 49]) == []\nassert pick_between([]) == []\nassert pick_between([29]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 1 for x in xs if -5 <= x <= 2)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 1 for x in xs if -5 <= x <= 2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -5 و2 (شاملًا الطرفين) في 1.\nمثال: `pick_between([-1, -11, -4, -4])` يجب أن تُرجع `[-4, -4, -1]`.\nالجواب:", "qhash": "f3bcfdb806460f2a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قلم سلام لغة') == 1", "assert count_start('كتاب فجر ليل لغة ميناء جبل') == 2", "assert count_start('سلام جمل') == 0", "assert count_start('خبز مدرسة ليل') == 1", "assert count_start('بحر مطر برتقال بحر لغة لغة نهار') == 2", "assert count_start('ليل معلم شجرة') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('قلم سلام لغة') == 1\nassert count_start('كتاب فجر ليل لغة ميناء جبل') == 2\nassert count_start('سلام جمل') == 0\nassert count_start('خبز مدرسة ليل') == 1\nassert count_start('بحر مطر برتقال بحر لغة لغة نهار') == 2\nassert count_start('ليل معلم شجرة') == 1\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('قلم سلام لغة')` يُرجع `1`.\nالجواب:", "qhash": "a15543921d0449e5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 53", "tests": ["assert mfact(11) == 7", "assert mfact(22) == 41", "assert mfact(1) == 1", "assert mfact(49) == 38", "assert mfact(0) == 1", "assert mfact(46) == 51", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 7\nassert mfact(22) == 41\nassert mfact(1) == 1\nassert mfact(49) == 38\nassert mfact(0) == 1\nassert mfact(46) == 51\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 53", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(11)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "462c80ca58bcd6c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('by python banana a') == 'banana_python'", "assert invert_words('camel matrix at it engine apple we') == 'engine_matrix'", "assert invert_words('') == ''", "assert invert_words('an music music') == ''", "assert invert_words('falcon table music data matrix orange apple') == 'orange_matrix_falcon'", "assert invert_words('') == ''", "assert invert_words('') == ''"], "test_code": "assert invert_words('by python banana a') == 'banana_python'\nassert invert_words('camel matrix at it engine apple we') == 'engine_matrix'\nassert invert_words('') == ''\nassert invert_words('an music music') == ''\nassert invert_words('falcon table music data matrix orange apple') == 'orange_matrix_falcon'\nassert invert_words('') == ''\nassert invert_words('') == ''", "answer": "def invert_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `invert_words('by python banana a')` يُرجع `'banana_python'`.\nالجواب:", "qhash": "966ff7649ef1a783"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([-28, 3, 51, 42, 27, 19]) == -28", "assert max_div([-8, -20, -16]) == -8", "assert max_div([1]) == None", "assert max_div([-18, -31, 40]) == 40", "assert max_div([-4, -13, -24, 7, -12, 9, 13, 29, -8]) == -4", "assert max_div([]) == None"], "test_code": "assert max_div([-28, 3, 51, 42, 27, 19]) == -28\nassert max_div([-8, -20, -16]) == -8\nassert max_div([1]) == None\nassert max_div([-18, -31, 40]) == 40\nassert max_div([-4, -13, -24, 7, -12, 9, 13, 29, -8]) == -4\nassert max_div([]) == None", "answer": "def max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 4 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([-28, 3, 51, 42, 27, 19])` يُرجع `-28`.\nالجواب:", "qhash": "aecf77e98a28ece5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [-8, 16, -2, 22, 10, 25, 32, 39, 40]\nprint(lst[0:7])\nprint(lst[::-2])\nprint(max(lst[0:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [-8, 16, -2, 22, 10, 25, 32, 39, 40]\nprint(lst[0:7])\nprint(lst[::-2])\nprint(max(lst[0:7]))\n```\nالجواب:", "qhash": "84b8bedf589ff3d5", "answer": "[-8, 16, -2, 22, 10, 25, 32]\n[40, 32, 10, -2, -8]\n32", "completion": " الناتج:\n```text\n[-8, 16, -2, 22, 10, 25, 32]\n[40, 32, 10, -2, -8]\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -7 * x ** 2 + (2) * x + (-5)", "tests": ["assert p(7) == -334", "assert p(7) == -334", "assert p(-17) == -2062", "assert p(-3) == -74", "assert p(2) == -29", "assert p(-17) == -2062", "assert p(-14) == -1405", "assert p(0) == -5"], "test_code": "assert p(7) == -334\nassert p(7) == -334\nassert p(-17) == -2062\nassert p(-3) == -74\nassert p(2) == -29\nassert p(-17) == -2062\nassert p(-14) == -1405\nassert p(0) == -5", "answer": "def p(x):\n return -7 * x ** 2 + (2) * x + (-5)", "completion": " ```python\ndef p(x):\n return -7 * x ** 2 + (2) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -7x² + 2x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(7)` يُرجع `-334`.\nالجواب:", "qhash": "3807671b28ad7e78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'يوسف': 6, 'سعيد': 19, 'أحمد': 5, 'وليد': 25}\nmarks['سعيد'] += 8\nmarks['نور'] = 8\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 24])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'يوسف': 6, 'سعيد': 19, 'أحمد': 5, 'وليد': 25}\nmarks['سعيد'] += 8\nmarks['نور'] = 8\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 24])\n```\nالجواب:", "qhash": "fc76d53dc28c5414", "answer": "5\nسعيد\n71\n['سعيد', 'وليد']", "completion": " الناتج:\n```text\n5\nسعيد\n71\n['سعيد', 'وليد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 26) == 1)", "tests": ["assert count_coprime(98) == 45", "assert count_coprime(175) == 81", "assert count_coprime(66) == 30", "assert count_coprime(23) == 11", "assert count_coprime(123) == 57", "assert count_coprime(52) == 24", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(98) == 45\nassert count_coprime(175) == 81\nassert count_coprime(66) == 30\nassert count_coprime(23) == 11\nassert count_coprime(123) == 57\nassert count_coprime(52) == 24\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, 26) == 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, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 26) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(98)` يُرجع `45`.\nالجواب:", "qhash": "cef7ce591a359b35"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(7, 4))", "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, 4))\n```\nالجواب:", "qhash": "104030882921348c", "answer": "2401", "completion": " الناتج:\n```text\n2401\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 2:\n return 4\n return 1 * f(n - 1) + 3\n\nprint(f(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 2:\n return 4\n return 1 * f(n - 1) + 3\n\nprint(f(8))\n```\nالجواب:", "qhash": "c3fc93407248b89d", "answer": "22", "completion": " الناتج:\n```text\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(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_multiple([45, 37, 6, 31, 46]) == None", "assert max_multiple([-20, -30, -40]) == -20", "assert max_multiple([1, 11, 21]) == None", "assert max_multiple([]) == None", "assert max_multiple([-15, 6, -20, -14, -47, -7, 3, 49]) == -20", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([45, 37, 6, 31, 46]) == None\nassert max_multiple([-20, -30, -40]) == -20\nassert max_multiple([1, 11, 21]) == None\nassert max_multiple([]) == None\nassert max_multiple([-15, 6, -20, -14, -47, -7, 3, 49]) == -20\nassert max_multiple([]) == None", "answer": "def max_multiple(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_multiple(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_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(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مثال: `max_multiple([45, 37, 6, 31, 46])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "f8fa9a1d44349bf3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'قمر عربية'\nprint(text.replace(' ', '-'))\nprint(text.split())\nprint(text.find('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'قمر عربية'\nprint(text.replace(' ', '-'))\nprint(text.split())\nprint(text.find('ت'))\n```\nالجواب:", "qhash": "ef74ab244de5563f", "answer": "قمر-عربية\n['قمر', 'عربية']\n-1", "completion": " الناتج:\n```text\nقمر-عربية\n['قمر', 'عربية']\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 5 * x ** 2 + (2) * x + (1)", "tests": ["assert poly(10) == 521", "assert poly(-13) == 820", "assert poly(7) == 260", "assert poly(3) == 52", "assert poly(-5) == 116", "assert poly(5) == 136", "assert poly(-18) == 1585", "assert poly(0) == 1"], "test_code": "assert poly(10) == 521\nassert poly(-13) == 820\nassert poly(7) == 260\nassert poly(3) == 52\nassert poly(-5) == 116\nassert poly(5) == 136\nassert poly(-18) == 1585\nassert poly(0) == 1", "answer": "def poly(x):\n return 5 * x ** 2 + (2) * x + (1)", "completion": " ```python\ndef poly(x):\n return 5 * x ** 2 + (2) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 5x² + 2x + 1 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(10)` يُرجع `521`.\nالجواب:", "qhash": "8b902f279080964a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 226\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 = 226\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": "87af8a3cf19993df", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 17 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([47, 33, 16, 1, 16, 20]) == [33, 16, 1, 16, 20, 47]", "assert shift_list([50, -7, -4, -5]) == [-5, 50, -7, -4]", "assert shift_list([-7, 16]) == [16, -7]", "assert shift_list([41, 5, 7, 18, 11, 44, -6, 18]) == [18, 41, 5, 7, 18, 11, 44, -6]", "assert shift_list([23, 43, 4, 48]) == [48, 23, 43, 4]", "assert shift_list([29, 42, 13, 11, 2, 43, 47, 47, -6, -5, 3]) == [43, 47, 47, -6, -5, 3, 29, 42, 13, 11, 2]", "assert shift_list([]) == []"], "test_code": "assert shift_list([47, 33, 16, 1, 16, 20]) == [33, 16, 1, 16, 20, 47]\nassert shift_list([50, -7, -4, -5]) == [-5, 50, -7, -4]\nassert shift_list([-7, 16]) == [16, -7]\nassert shift_list([41, 5, 7, 18, 11, 44, -6, 18]) == [18, 41, 5, 7, 18, 11, 44, -6]\nassert shift_list([23, 43, 4, 48]) == [48, 23, 43, 4]\nassert shift_list([29, 42, 13, 11, 2, 43, 47, 47, -6, -5, 3]) == [43, 47, 47, -6, -5, 3, 29, 42, 13, 11, 2]\nassert shift_list([]) == []", "answer": "def shift_list(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 shift_list(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 shift_list(items):\n if not items:\n return []\n k = 17 % len(items)\n return ____\n```\nمثال: `shift_list([47, 33, 16, 1, 16, 20])` يجب أن تُرجع `[33, 16, 1, 16, 20, 47]`.\nالجواب:", "qhash": "246a7fdae78f58e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 2:\n return 2\n return 1 * f(n - 1) + 4\n\nprint(f(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 2:\n return 2\n return 1 * f(n - 1) + 4\n\nprint(f(8))\n```\nالجواب:", "qhash": "e70cc1d25af7aaf7", "answer": "26", "completion": " الناتج:\n```text\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11']", "assert fizz(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz']", "assert fizz(1) == ['1']", "assert fizz(4) == ['1', 'Fizz', '3', 'Fizz']", "assert fizz(7) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7']"], "test_code": "assert fizz(11) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11']\nassert fizz(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz']\nassert fizz(1) == ['1']\nassert fizz(4) == ['1', 'Fizz', '3', 'Fizz']\nassert fizz(7) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 8 == 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 % 2 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(11)` يُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11']`.\nالجواب:", "qhash": "cc30633d210fda46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 52) == 1)", "tests": ["assert count_coprime(120) == 55", "assert count_coprime(129) == 60", "assert count_coprime(171) == 79", "assert count_coprime(11) == 6", "assert count_coprime(173) == 80", "assert count_coprime(56) == 26", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(120) == 55\nassert count_coprime(129) == 60\nassert count_coprime(171) == 79\nassert count_coprime(11) == 6\nassert count_coprime(173) == 80\nassert count_coprime(56) == 26\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, 52) == 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, 52) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 52، أي أن القاسم المشترك الأكبر لها مع 52 يساوي 1.\nمثال: `count_coprime(120)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "bc94106f95d9deed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('نور طائرة قلم') == 1", "assert count_hits('برتقال حصان شمس') == 0", "assert count_hits('ميناء علم دفتر مدرسة بيت شمس معلم ميناء') == 0", "assert count_hits('برتقال نور صحراء كتاب لغة بيت') == 1", "assert count_hits('') == 0"], "test_code": "assert 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('برتقال نور صحراء كتاب لغة بيت') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ن»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('برمجة مطر قمر')` يُرجع `0`.\nالجواب:", "qhash": "706b84b42b714c67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('رمل حاسوب يمل يمل باب') == 2", "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('رمل حاسوب يمل يمل باب') == 2\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.split():\n if w.endswith('ي'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ي». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef lead_count(line):\n count = 0\n for w in line.split():\n if w.endswith('ي'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('يمل شجرة يمل صديق سيارة')` يُرجع `2`.\nالجواب:", "qhash": "2ec7d7ffd440691b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Ping'\n if i % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12']", "assert game(0) == []", "assert game(18) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12', '13', 'Ping', '15', 'Pong', '17', '18']", "assert game(8) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong']", "assert game(24) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12', '13', 'Ping', '15', 'Pong', '17', '18', '19', '20', 'Ping', '22', '23', 'Pong']"], "test_code": "assert game(12) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12']\nassert game(0) == []\nassert game(18) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12', '13', 'Ping', '15', 'Pong', '17', '18']\nassert game(8) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong']\nassert game(24) == ['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12', '13', 'Ping', '15', 'Pong', '17', '18', '19', '20', 'Ping', '22', '23', 'Pong']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 0:\n s += 'Ping'\n if i % 8 == 0:\n s += 'Pong'\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 % 7 == 0:\n s += 'Ping'\n if i % 8 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Ping'، وإن قَبِلها على 8 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(12)` يُرجع `['1', '2', '3', '4', '5', '6', 'Ping', 'Pong', '9', '10', '11', '12']`.\nالجواب:", "qhash": "b9dcfc2ae210acfc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('winter data in music') == 'winter'", "assert flip_words('in by winter by on data rocket desert') == 'desert,rocket,winter'", "assert flip_words('winter') == 'winter'", "assert flip_words('engine stone music banana') == 'banana,engine'", "assert flip_words('data we go') == ''", "assert flip_words('') == ''", "assert flip_words('light cloud table garden engine is matrix') == 'matrix,engine,garden'"], "test_code": "assert flip_words('winter data in music') == 'winter'\nassert flip_words('in by winter by on data rocket desert') == 'desert,rocket,winter'\nassert flip_words('winter') == 'winter'\nassert flip_words('engine stone music banana') == 'banana,engine'\nassert flip_words('data we go') == ''\nassert flip_words('') == ''\nassert flip_words('light cloud table garden engine is matrix') == 'matrix,engine,garden'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `flip_words('winter data in music')` يُرجع `'winter'`.\nالجواب:", "qhash": "736a8a23eb438663"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('to vector it music engine code') == 'engine-vector'", "assert flip_words('it up camel on stone') == ''", "assert flip_words('winter brain it banana a light matrix on') == 'matrix-banana-winter'", "assert flip_words('at of it') == ''", "assert flip_words('camel it banana summer summer to banana') == 'banana-summer-summer-banana'", "assert flip_words('we planet we') == 'planet'", "assert flip_words('at up window falcon camel engine river orange') == 'orange-engine-falcon-window'"], "test_code": "assert flip_words('to vector it music engine code') == 'engine-vector'\nassert flip_words('it up camel on stone') == ''\nassert flip_words('winter brain it banana a light matrix on') == 'matrix-banana-winter'\nassert flip_words('at of it') == ''\nassert flip_words('camel it banana summer summer to banana') == 'banana-summer-summer-banana'\nassert flip_words('we planet we') == 'planet'\nassert flip_words('at up window falcon camel engine river orange') == 'orange-engine-falcon-window'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `flip_words('to vector it music engine code')` يُرجع `'engine-vector'`.\nالجواب:", "qhash": "7f2724c0c7afd1de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert div_not([48, 71, 3, 4, 21, 16, 41, 60, 88, 38, 22, 84]) == 0", "assert div_not([83, -35, -15, -23, -10, 21]) == 0", "assert div_not([11, 81, -38, -5, 24, 22, 78, -14, 24, 82, -20]) == 1", "assert div_not([56, -33, 66, 17, 67, 3]) == 0", "assert div_not([0, -27, -17, -33, 31, 47]) == 1", "assert div_not([5, -9, 33, 10, 46, -1]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([48, 71, 3, 4, 21, 16, 41, 60, 88, 38, 22, 84]) == 0\nassert div_not([83, -35, -15, -23, -10, 21]) == 0\nassert div_not([11, 81, -38, -5, 24, 22, 78, -14, 24, 82, -20]) == 1\nassert div_not([56, -33, 66, 17, 67, 3]) == 0\nassert div_not([0, -27, -17, -33, 31, 47]) == 1\nassert div_not([5, -9, 33, 10, 46, -1]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 9 == 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 % 9 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([48, 71, 3, 4, 21, 16, 41, 60, 88, 38, 22, 84])` يُرجع `0`.\nالجواب:", "qhash": "14049adeb60a9c02"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('to stone coffee brain') == 'hc ghcbs qcttss pfowb'", "assert decode('to stone on summer') == 'hc ghcbs cb giaasf'", "assert decode('apple OK') == 'oddzs OK'", "assert decode('data summer Hello') == 'roho giaasf Hszzc'", "assert decode('it it light OK') == 'wh wh zwuvh OK'", "assert decode('coffee winter winter signal signal Hello') == 'qcttss kwbhsf kwbhsf gwuboz gwuboz Hszzc'", "assert decode('') == ''"], "test_code": "assert decode('to stone coffee brain') == 'hc ghcbs qcttss pfowb'\nassert decode('to stone on summer') == 'hc ghcbs cb giaasf'\nassert decode('apple OK') == 'oddzs OK'\nassert decode('data summer Hello') == 'roho giaasf Hszzc'\nassert decode('it it light OK') == 'wh wh zwuvh OK'\nassert decode('coffee winter winter signal signal Hello') == 'qcttss kwbhsf kwbhsf gwuboz gwuboz Hszzc'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('to stone coffee brain')` يجب أن تُرجع `'hc ghcbs qcttss pfowb'`.\nالجواب:", "qhash": "9eb756c9c2992ca9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'br'}", "tests": ["assert count_chars('by') == {'b': 1, 'r': 0}", "assert count_chars('by planet camel') == {'b': 1, 'r': 0}", "assert count_chars('we python') == {'b': 0, 'r': 0}", "assert count_chars('pixel') == {'b': 0, 'r': 0}", "assert count_chars('summer it falcon') == {'b': 0, 'r': 1}", "assert count_chars('river to') == {'b': 0, 'r': 2}", "assert count_chars('') == {'b': 0, 'r': 0}"], "test_code": "assert count_chars('by') == {'b': 1, 'r': 0}\nassert count_chars('by planet camel') == {'b': 1, 'r': 0}\nassert count_chars('we python') == {'b': 0, 'r': 0}\nassert count_chars('pixel') == {'b': 0, 'r': 0}\nassert count_chars('summer it falcon') == {'b': 0, 'r': 1}\nassert count_chars('river to') == {'b': 0, 'r': 2}\nassert count_chars('') == {'b': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'br'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'br'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('by')` يجب أن تُرجع `{'b': 1, 'r': 0}`.\nالجواب:", "qhash": "e93a77cc88f8cb09"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 14\nfor j in range(2, 18, 4):\n total -= j * 3\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 14\nfor j in range(2, 18, 4):\n total -= j * 3\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "aeaa6e01c9f3569f", "answer": "-82\n14", "completion": " الناتج:\n```text\n-82\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=8):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(16))\nprint(f(16, 3))\nprint(f(f(3), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=8):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(16))\nprint(f(16, 3))\nprint(f(f(3), 16))\n```\nالجواب:", "qhash": "6308293891becdbc", "answer": "8\n13\n27", "completion": " الناتج:\n```text\n8\n13\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'رنا': 45, 'ليلى': 48, 'باسل': 3}\nd['رنا'] += 19\nd['يوسف'] = 53\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('مريم', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'رنا': 45, 'ليلى': 48, 'باسل': 3}\nd['رنا'] += 19\nd['يوسف'] = 53\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('مريم', -1))\n```\nالجواب:", "qhash": "18b99e3603676721", "answer": "4\nرنا\n168\n-1", "completion": " الناتج:\n```text\n4\nرنا\n168\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -6 * x ** 2 + (-1) * x + (3)", "tests": ["assert value_at(3) == -54", "assert value_at(7) == -298", "assert value_at(-1) == -2", "assert value_at(-1) == -2", "assert value_at(0) == 3", "assert value_at(-11) == -712", "assert value_at(-9) == -474", "assert value_at(0) == 3"], "test_code": "assert value_at(3) == -54\nassert value_at(7) == -298\nassert value_at(-1) == -2\nassert value_at(-1) == -2\nassert value_at(0) == 3\nassert value_at(-11) == -712\nassert value_at(-9) == -474\nassert value_at(0) == 3", "answer": "def value_at(x):\n return -6 * x ** 2 + (-1) * x + (3)", "completion": " ```python\ndef value_at(x):\n return -6 * x ** 2 + (-1) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -6x² - 1x + 3 عند العدد الصحيح x.\nمثال: `value_at(3)` يجب أن تُرجع `-54`.\nالجواب:", "qhash": "38e0cccb270d85a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert play(17) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17']", "assert play(21) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21']", "assert play(11) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon']", "assert play(24) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21', 'Moon', '23', 'Sun']", "assert play(25) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21', 'Moon', '23', 'Sun', '25']"], "test_code": "assert play(17) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17']\nassert play(21) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21']\nassert play(11) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon']\nassert play(24) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21', 'Moon', '23', 'Sun']\nassert play(25) == ['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17', 'Sun', '19', '20', '21', 'Moon', '23', 'Sun', '25']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Sun'\n if i % 11 == 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 % 6 == 0:\n s += 'Sun'\n if i % 11 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Sun'، وعلى 11 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(17)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Sun', '7', '8', '9', '10', 'Moon', 'Sun', '13', '14', '15', '16', '17']`.\nالجواب:", "qhash": "90a444ba857d9508"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(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 max_div([-20, -29, 44, -17, 43, 42]) == 44", "assert max_div([-8, -8, -8]) == -8", "assert max_div([1, 5, 9]) == None", "assert max_div([5, 0, 16, 39, -3, -40]) == 16", "assert max_div([50, 19, 50, 1, 42, 18, 37, 15]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([-20, -29, 44, -17, 43, 42]) == 44\nassert max_div([-8, -8, -8]) == -8\nassert max_div([1, 5, 9]) == None\nassert max_div([5, 0, 16, 39, -3, -40]) == 16\nassert max_div([50, 19, 50, 1, 42, 18, 37, 15]) == None\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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 max_div(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مثال: `max_div([-20, -29, 44, -17, 43, 42])` يجب أن تُرجع `44`.\nالجواب:", "qhash": "677fedf2cda2749f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('مريم', 8), ('نور', 57), ('حسن', 63), ('ليلى', 27)]\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 = [('مريم', 8), ('نور', 57), ('حسن', 63), ('ليلى', 27)]\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": "454f93652b403f53", "answer": "[('مريم', 8), ('ليلى', 27), ('نور', 57), ('حسن', 63)]\n['حسن', 'نور']", "completion": " الناتج:\n```text\n[('مريم', 8), ('ليلى', 27), ('نور', 57), ('حسن', 63)]\n['حسن', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(12) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz']", "assert fizzbuzz(9) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9']", "assert fizzbuzz(12) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz']", "assert fizzbuzz(10) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10']", "assert fizzbuzz(9) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9']"], "test_code": "assert fizzbuzz(12) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz']\nassert fizzbuzz(9) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9']\nassert fizzbuzz(12) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz']\nassert fizzbuzz(10) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10']\nassert fizzbuzz(9) == ['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Fizz'\n if i % 7 == 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 % 4 == 0:\n s += 'Fizz'\n if i % 7 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Fizz'، وعلى 7 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(12)` يجب أن تُرجع `['1', '2', '3', 'Fizz', '5', '6', 'Buzz', 'Fizz', '9', '10', '11', 'Fizz']`.\nالجواب:", "qhash": "e5551955d01a752a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert only_div([60, 74, 74, 35, 11, 54, 80, 43]) == 0", "assert only_div([1, 75, 31, -15, 64, 14]) == 0", "assert only_div([41, 64, 4, 86, 47, 35]) == 0", "assert only_div([-19, 69, -7, 52, 9, 81, 72, -34, -5, -24, 67]) == 0", "assert only_div([21, 68, 52, 31, 18, 19]) == 0", "assert only_div([-32, 4, 30, 19, 0]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([60, 74, 74, 35, 11, 54, 80, 43]) == 0\nassert only_div([1, 75, 31, -15, 64, 14]) == 0\nassert only_div([41, 64, 4, 86, 47, 35]) == 0\nassert only_div([-19, 69, -7, 52, 9, 81, 72, -34, -5, -24, 67]) == 0\nassert only_div([21, 68, 52, 31, 18, 19]) == 0\nassert only_div([-32, 4, 30, 19, 0]) == 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 % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([60, 74, 74, 35, 11, 54, 80, 43])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f4a991a32bb1f2ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ahmn'}", "tests": ["assert freq_of('planet') == {'a': 1, 'h': 0, 'm': 0, 'n': 1}", "assert freq_of('garden python') == {'a': 1, 'h': 1, 'm': 0, 'n': 2}", "assert freq_of('to pixel') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}", "assert freq_of('go engine a river camel pixel') == {'a': 2, 'h': 0, 'm': 1, 'n': 2}", "assert freq_of('rocket rocket') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}", "assert freq_of('go engine') == {'a': 0, 'h': 0, 'm': 0, 'n': 2}", "assert freq_of('') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}"], "test_code": "assert freq_of('planet') == {'a': 1, 'h': 0, 'm': 0, 'n': 1}\nassert freq_of('garden python') == {'a': 1, 'h': 1, 'm': 0, 'n': 2}\nassert freq_of('to pixel') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}\nassert freq_of('go engine a river camel pixel') == {'a': 2, 'h': 0, 'm': 1, 'n': 2}\nassert freq_of('rocket rocket') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}\nassert freq_of('go engine') == {'a': 0, 'h': 0, 'm': 0, 'n': 2}\nassert freq_of('') == {'a': 0, 'h': 0, 'm': 0, 'n': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ahmn'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ahmn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'h'، 'm'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('planet')` يجب أن تُرجع `{'a': 1, 'h': 0, 'm': 0, 'n': 1}`.\nالجواب:", "qhash": "6967b2db486f0a67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('it garden go') == 'zk xriuve xf'", "assert caesar('signal') == 'jzxerc'", "assert caesar('table an coffee desert OK') == 'krscv re tfwwvv uvjvik OK'", "assert caesar('window in') == 'nzeufn ze'", "assert caesar('planet light an banana up') == 'gcrevk czxyk re srerer lg'", "assert caesar('python camel we') == 'gpkyfe trdvc nv'", "assert caesar('') == ''"], "test_code": "assert caesar('it garden go') == 'zk xriuve xf'\nassert caesar('signal') == 'jzxerc'\nassert caesar('table an coffee desert OK') == 'krscv re tfwwvv uvjvik OK'\nassert caesar('window in') == 'nzeufn ze'\nassert caesar('planet light an banana up') == 'gcrevk czxyk re srerer lg'\nassert caesar('python camel we') == 'gpkyfe trdvc nv'\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 + (-9)) % 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 + (-9)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('it garden go')` يُرجع `'zk xriuve xf'`.\nالجواب:", "qhash": "6f29c9eed58b4f53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('كتاب وردة لغة سلام') == 0", "assert prefix_hits('قلم مطر جمل طائرة عمل شجرة') == 0", "assert prefix_hits('برتقال نهر مدرسة نهر معلم علم ماء برتقال') == 2", "assert prefix_hits('بحر برتقال معلم') == 0", "assert prefix_hits('فجر مدرسة نهار شجرة قلم') == 1", "assert prefix_hits('طالب مطر دفتر قمر تفاحة نهر') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('كتاب وردة لغة سلام') == 0\nassert prefix_hits('قلم مطر جمل طائرة عمل شجرة') == 0\nassert prefix_hits('برتقال نهر مدرسة نهر معلم علم ماء برتقال') == 2\nassert prefix_hits('بحر برتقال معلم') == 0\nassert prefix_hits('فجر مدرسة نهار شجرة قلم') == 1\nassert prefix_hits('طالب مطر دفتر قمر تفاحة نهر') == 1\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('كتاب وردة لغة سلام')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "d795db56549e4ef9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Foo'\n if i % 9 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13', '14', '15', 'Foo', '17', 'Bar', '19', 'Foo', '21']", "assert game(25) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13', '14', '15', 'Foo', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Foo', '25']", "assert game(10) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10']", "assert game(13) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13']", "assert game(2) == ['1', '2']"], "test_code": "assert game(21) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13', '14', '15', 'Foo', '17', 'Bar', '19', 'Foo', '21']\nassert game(25) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13', '14', '15', 'Foo', '17', 'Bar', '19', 'Foo', '21', '22', '23', 'Foo', '25']\nassert game(10) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10']\nassert game(13) == ['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13']\nassert game(2) == ['1', '2']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Foo'، وإن قَبِلها على 9 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(21)` يُرجع `['1', '2', '3', 'Foo', '5', '6', '7', 'Foo', 'Bar', '10', '11', 'Foo', '13', '14', '15', 'Foo', '17', 'Bar', '19', 'Foo', '21']`.\nالجواب:", "qhash": "0976f66608dd491c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 45", "tests": ["assert digit_power(30349) == 4", "assert digit_power(526063) == 29", "assert digit_power(125552) == 18", "assert digit_power(539911) == 15", "assert digit_power(640346) == 35", "assert digit_power(388292) == 16", "assert digit_power(17010) == 18", "assert digit_power(0) == 0"], "test_code": "assert digit_power(30349) == 4\nassert digit_power(526063) == 29\nassert digit_power(125552) == 18\nassert digit_power(539911) == 15\nassert digit_power(640346) == 35\nassert digit_power(388292) == 16\nassert digit_power(17010) == 18\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 45", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 45\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 45.\nمثال: `digit_power(30349)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "d1c94b22f15cbf6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'matrix'\nprint(text.upper())\nprint(text[::-1])\nprint(text.index('x') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'matrix'\nprint(text.upper())\nprint(text[::-1])\nprint(text.index('x') + len(text))\n```\nالجواب:", "qhash": "c78038834ab70bf4", "answer": "MATRIX\nxirtam\n11", "completion": " الناتج:\n```text\nMATRIX\nxirtam\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([10, 4, 40, 32, 3]) == [10, 14, 54, 0, 3]", "assert rolling_total([1, 54, 34, 44]) == [1, 55, 0, 44]", "assert rolling_total([70, 38, 1, 8, 30, 58, 66]) == [70, 0, 1, 9, 39, 0, 66]", "assert rolling_total([22, 49, -6, 54, 23, 61, 67, 25, 42]) == [22, 71, 65, 0, 23, 0, 67, 0, 42]", "assert rolling_total([55, 30, -3, 8, -3]) == [55, 0, -3, 5, 2]", "assert rolling_total([-9]) == [-9]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([10, 4, 40, 32, 3]) == [10, 14, 54, 0, 3]\nassert rolling_total([1, 54, 34, 44]) == [1, 55, 0, 44]\nassert rolling_total([70, 38, 1, 8, 30, 58, 66]) == [70, 0, 1, 9, 39, 0, 66]\nassert rolling_total([22, 49, -6, 54, 23, 61, 67, 25, 42]) == [22, 71, 65, 0, 23, 0, 67, 0, 42]\nassert rolling_total([55, 30, -3, 8, -3]) == [55, 0, -3, 5, 2]\nassert rolling_total([-9]) == [-9]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\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 > 72:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 72 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([10, 4, 40, 32, 3])` يجب أن تُرجع `[10, 14, 54, 0, 3]`.\nالجواب:", "qhash": "176ba66c7cc7efc2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(26) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon', '17', 'Sun', '19', '20', '21', '22', '23', 'SunMoon', '25', '26']", "assert fizz(16) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon']", "assert fizz(7) == ['1', '2', '3', '4', '5', 'Sun', '7']", "assert fizz(16) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon']", "assert fizz(11) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11']"], "test_code": "assert fizz(26) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon', '17', 'Sun', '19', '20', '21', '22', '23', 'SunMoon', '25', '26']\nassert fizz(16) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon']\nassert fizz(7) == ['1', '2', '3', '4', '5', 'Sun', '7']\nassert fizz(16) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon']\nassert fizz(11) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\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 += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Sun'، وإن قَبِلها على 8 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(26)` يُرجع `['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon', '17', 'Sun', '19', '20', '21', '22', '23', 'SunMoon', '25', '26']`.\nالجواب:", "qhash": "f3f516f8ebd96434"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'برتقال'\nprint(kalima.split())\nprint(kalima[::-1])\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'برتقال'\nprint(kalima.split())\nprint(kalima[::-1])\nprint(kalima[-1])\n```\nالجواب:", "qhash": "b581c22098e7a5b5", "answer": "['برتقال']\nلاقترب\nل", "completion": " الناتج:\n```text\n['برتقال']\nلاقترب\nل\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'أحمد': 47, 'مريم': 12, 'هشام': 9, 'زينب': 46}\nmarks['زينب'] += 1\nmarks['رنا'] = 40\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'أحمد': 47, 'مريم': 12, 'هشام': 9, 'زينب': 46}\nmarks['زينب'] += 1\nmarks['رنا'] = 40\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))\n```\nالجواب:", "qhash": "5a72b4e0d4d75852", "answer": "5\nأحمد\n155\n-1", "completion": " الناتج:\n```text\n5\nأحمد\n155\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if w.startswith('و'))", "tests": ["assert count_ar('سوق شمس كتاب وردة') == 1", "assert count_ar('وردة مدرسة ميناء كتاب سلام') == 1", "assert count_ar('قلم تفاحة نور حاسوب سوق حاسوب وردة عمل') == 1", "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('سوق شمس كتاب وردة') == 1\nassert count_ar('وردة مدرسة ميناء كتاب سلام') == 1\nassert count_ar('قلم تفاحة نور حاسوب سوق حاسوب وردة عمل') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «و»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('سوق شمس كتاب وردة')` يُرجع `1`.\nالجواب:", "qhash": "7bb1258efe7fd345"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([82, 23, 91, 77, 23, 94, 74, 72, 92, 85]) == [82, 105, 0, 77, 100, 0, 74, 146, 0, 85]", "assert rolling_total([148, 140, 178, -8, 55, 93]) == [148, 0, 178, 170, 0, 93]", "assert rolling_total([105, 165, 106, 72, 156, 88, 33]) == [105, 0, 106, 178, 0, 88, 121]", "assert rolling_total([]) == []", "assert rolling_total([123, 157, 95, 64]) == [123, 0, 95, 159]", "assert rolling_total([70, 50, 96, 147, 63, 138, 46]) == [70, 120, 0, 147, 0, 138, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([82, 23, 91, 77, 23, 94, 74, 72, 92, 85]) == [82, 105, 0, 77, 100, 0, 74, 146, 0, 85]\nassert rolling_total([148, 140, 178, -8, 55, 93]) == [148, 0, 178, 170, 0, 93]\nassert rolling_total([105, 165, 106, 72, 156, 88, 33]) == [105, 0, 106, 178, 0, 88, 121]\nassert rolling_total([]) == []\nassert rolling_total([123, 157, 95, 64]) == [123, 0, 95, 159]\nassert rolling_total([70, 50, 96, 147, 63, 138, 46]) == [70, 120, 0, 147, 0, 138, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\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 > 178:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 178 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([82, 23, 91, 77, 23, 94, 74, 72, 92, 85])` يجب أن تُرجع `[82, 105, 0, 77, 100, 0, 74, 146, 0, 85]`.\nالجواب:", "qhash": "c4e10cba6c369715"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 2:\n return n + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef go(n):\n if n < 2:\n return n + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(16))\n```\nالجواب:", "qhash": "4a5f66e6d59f0127", "answer": "2584", "completion": " الناتج:\n```text\n2584\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [34, 32, 37, -20, -12, -6, 18, 10]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [34, 32, 37, -20, -12, -6, 18, 10]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "d837c5c5a9d130ee", "answer": "[18, 32, 34, 37, 10, -6, -12, -20]\n[37, 34, 32]", "completion": " الناتج:\n```text\n[18, 32, 34, 37, 10, -6, -12, -20]\n[37, 34, 32]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 11\nfor n in range(10, 16, 4):\n acc -= n * 7\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 11\nfor n in range(10, 16, 4):\n acc -= n * 7\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "91a9146e78225bb4", "answer": "-157\n14", "completion": " الناتج:\n```text\n-157\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('it we banana we an') == 'do rz wviviv rz vi'", "assert encode('brain') == 'wmvdi'", "assert encode('stone garden of code at Hello') == 'nojiz bvmyzi ja xjyz vo Hzggj'", "assert encode('data signal matrix we') == 'yvov ndbivg hvomds rz'", "assert encode('an desert of A1') == 'vi yznzmo ja A1'", "assert encode('window') == 'rdiyjr'", "assert encode('') == ''"], "test_code": "assert encode('it we banana we an') == 'do rz wviviv rz vi'\nassert encode('brain') == 'wmvdi'\nassert encode('stone garden of code at Hello') == 'nojiz bvmyzi ja xjyz vo Hzggj'\nassert encode('data signal matrix we') == 'yvov ndbivg hvomds rz'\nassert encode('an desert of A1') == 'vi yznzmo ja A1'\nassert encode('window') == 'rdiyjr'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('it we banana we an')` يُرجع `'do rz wviviv rz vi'`.\nالجواب:", "qhash": "a64e37eb375e783b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "tests": ["assert total_pow(8) == 679536", "assert total_pow(9) == 1329075", "assert total_pow(1) == 11", "assert total_pow(1) == 11", "assert total_pow(11) == 4200636", "assert total_pow(1) == 11", "assert total_pow(0) == 0"], "test_code": "assert total_pow(8) == 679536\nassert total_pow(9) == 1329075\nassert total_pow(1) == 11\nassert total_pow(1) == 11\nassert total_pow(11) == 4200636\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 ** 5\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 5\n return total\n```\nمثال: `total_pow(8)` يجب أن تُرجع `679536`.\nالجواب:", "qhash": "28d177f692cb18e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 17\nfor n in range(3, 8, 1):\n result -= n * 7\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 17\nfor n in range(3, 8, 1):\n result -= n * 7\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "062f3dbb3fde4ffe", "answer": "-158\n7", "completion": " الناتج:\n```text\n-158\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([-20, 32, 12, -16, 45, 45, 14, -8, 8]) == None", "assert find_max_div([-44, -22, -33]) == -22", "assert find_max_div([1, 12, 23, 34]) == None", "assert find_max_div([]) == None", "assert find_max_div([-35, 32, 28]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-20, 32, 12, -16, 45, 45, 14, -8, 8]) == None\nassert find_max_div([-44, -22, -33]) == -22\nassert find_max_div([1, 12, 23, 34]) == None\nassert find_max_div([]) == None\nassert find_max_div([-35, 32, 28]) == None\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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للتوضيح: الاستدعاء `find_max_div([-20, 32, 12, -16, 45, 45, 14, -8, 8])` يُرجع `None`.\nالجواب:", "qhash": "4ceaea88053ac1f9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)", "tests": ["assert sum_multiples(29) == 174", "assert sum_multiples(82) == 1290", "assert sum_multiples(87) == 1374", "assert sum_multiples(39) == 273", "assert sum_multiples(174) == 5752", "assert sum_multiples(280) == 15024", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(29) == 174\nassert sum_multiples(82) == 1290\nassert sum_multiples(87) == 1374\nassert sum_multiples(39) == 273\nassert sum_multiples(174) == 5752\nassert sum_multiples(280) == 15024\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 % 13 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(29)` يُرجع `174`.\nالجواب:", "qhash": "61baa7f61c3bf5de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 40", "tests": ["assert digit_score(32031) == 23", "assert digit_score(109408) == 26", "assert digit_score(504827) == 12", "assert digit_score(117017) == 9", "assert digit_score(531694) == 2", "assert digit_score(385023) == 19", "assert digit_score(549258) == 3", "assert digit_score(0) == 0"], "test_code": "assert digit_score(32031) == 23\nassert digit_score(109408) == 26\nassert digit_score(504827) == 12\nassert digit_score(117017) == 9\nassert digit_score(531694) == 2\nassert digit_score(385023) == 19\nassert digit_score(549258) == 3\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 40", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 3 for d in str(n)) % 40\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 40.\nللتوضيح: الاستدعاء `digit_score(32031)` يُرجع `23`.\nالجواب:", "qhash": "d5077d6a45614bb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'is'}", "tests": ["assert char_freq('camel camel code up at') == {'i': 0, 's': 0}", "assert char_freq('an') == {'i': 0, 's': 0}", "assert char_freq('banana rocket we summer') == {'i': 0, 's': 1}", "assert char_freq('at engine on brain') == {'i': 2, 's': 0}", "assert char_freq('data of of data up') == {'i': 0, 's': 0}", "assert char_freq('camel desert python python') == {'i': 0, 's': 1}", "assert char_freq('') == {'i': 0, 's': 0}"], "test_code": "assert char_freq('camel camel code up at') == {'i': 0, 's': 0}\nassert char_freq('an') == {'i': 0, 's': 0}\nassert char_freq('banana rocket we summer') == {'i': 0, 's': 1}\nassert char_freq('at engine on brain') == {'i': 2, 's': 0}\nassert char_freq('data of of data up') == {'i': 0, 's': 0}\nassert char_freq('camel desert python python') == {'i': 0, 's': 1}\nassert char_freq('') == {'i': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'is'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'is'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'i'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('camel camel code up at')` يُرجع `{'i': 0, 's': 0}`.\nالجواب:", "qhash": "e83461d765909fe9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 79", "tests": ["assert prod_mod(10) == 41", "assert prod_mod(30) == 27", "assert prod_mod(50) == 25", "assert prod_mod(45) == 30", "assert prod_mod(42) == 73", "assert prod_mod(14) == 21", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(10) == 41\nassert prod_mod(30) == 27\nassert prod_mod(50) == 25\nassert prod_mod(45) == 30\nassert prod_mod(42) == 73\nassert prod_mod(14) == 21\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 79", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 4)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(10)` يجب أن تُرجع `41`.\nالجواب:", "qhash": "4aac9805d2584369"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "tests": ["assert weighted_sum(4) == 1300", "assert weighted_sum(6) == 12201", "assert weighted_sum(0) == 0", "assert weighted_sum(15) == 2299200", "assert weighted_sum(9) == 120825", "assert weighted_sum(1) == 1", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 1300\nassert weighted_sum(6) == 12201\nassert weighted_sum(0) == 0\nassert weighted_sum(15) == 2299200\nassert weighted_sum(9) == 120825\nassert weighted_sum(1) == 1\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 1 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 5\n return total\n```\nمثال: `weighted_sum(4)` يجب أن تُرجع `1300`.\nالجواب:", "qhash": "8958582ede35025d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'زينب': 6, 'رنا': 50, 'فيصل': 50, 'علي': 33, 'خالد': 6}\npoints['زينب'] += 14\npoints['هدى'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('مريم', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'زينب': 6, 'رنا': 50, 'فيصل': 50, 'علي': 33, 'خالد': 6}\npoints['زينب'] += 14\npoints['هدى'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('مريم', -1))\n```\nالجواب:", "qhash": "c2fa2f56b6bd8efe", "answer": "6\nرنا\n161\n-1", "completion": " الناتج:\n```text\n6\nرنا\n161\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 68:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([22, 21, 25, 25, 4, 18, 35]) == [22, 43, 68, 0, 4, 22, 57]", "assert reset_sum([34, 58, 11, 55, 14, 60, 41, 2, 47, 14]) == [34, 0, 11, 66, 0, 60, 0, 2, 49, 63]", "assert reset_sum([19, 20, 43, 5, 6, 11, 9, 2, -1, 57]) == [19, 39, 0, 5, 11, 22, 31, 33, 32, 0]", "assert reset_sum([18, 17, 57, -8, 13, 53, 54, 13]) == [18, 35, 0, -8, 5, 58, 0, 13]", "assert reset_sum([]) == []", "assert reset_sum([]) == []", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([22, 21, 25, 25, 4, 18, 35]) == [22, 43, 68, 0, 4, 22, 57]\nassert reset_sum([34, 58, 11, 55, 14, 60, 41, 2, 47, 14]) == [34, 0, 11, 66, 0, 60, 0, 2, 49, 63]\nassert reset_sum([19, 20, 43, 5, 6, 11, 9, 2, -1, 57]) == [19, 39, 0, 5, 11, 22, 31, 33, 32, 0]\nassert reset_sum([18, 17, 57, -8, 13, 53, 54, 13]) == [18, 35, 0, -8, 5, 58, 0, 13]\nassert reset_sum([]) == []\nassert reset_sum([]) == []\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 68:\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 > 68:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 68 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([22, 21, 25, 25, 4, 18, 35])` يُرجع `[22, 43, 68, 0, 4, 22, 57]`.\nالجواب:", "qhash": "cac4cf0532516e38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (-1) * x + (4)", "tests": ["assert evaluate(9) == 76", "assert evaluate(-19) == 384", "assert evaluate(14) == 186", "assert evaluate(-16) == 276", "assert evaluate(3) == 10", "assert evaluate(15) == 214", "assert evaluate(0) == 4", "assert evaluate(0) == 4"], "test_code": "assert evaluate(9) == 76\nassert evaluate(-19) == 384\nassert evaluate(14) == 186\nassert evaluate(-16) == 276\nassert evaluate(3) == 10\nassert evaluate(15) == 214\nassert evaluate(0) == 4\nassert evaluate(0) == 4", "answer": "def evaluate(x):\n return 1 * x ** 2 + (-1) * x + (4)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (-1) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 1x² - 1x + 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(9)` يُرجع `76`.\nالجواب:", "qhash": "4984e00ccda8adb1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('python by rocket pixel') == 'qzuipo cz spdlfu qjyfm'", "assert caesar('a') == 'b'", "assert caesar('go to') == 'hp up'", "assert caesar('data') == 'ebub'", "assert caesar('to garden on is A1') == 'up hbsefo po jt A1'", "assert caesar('winter planet stone garden go OK') == 'xjoufs qmbofu tupof hbsefo hp OK'", "assert caesar('') == ''"], "test_code": "assert caesar('python by rocket pixel') == 'qzuipo cz spdlfu qjyfm'\nassert caesar('a') == 'b'\nassert caesar('go to') == 'hp up'\nassert caesar('data') == 'ebub'\nassert caesar('to garden on is A1') == 'up hbsefo po jt A1'\nassert caesar('winter planet stone garden go OK') == 'xjoufs qmbofu tupof hbsefo hp OK'\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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('python by rocket pixel')` يُرجع `'qzuipo cz spdlfu qjyfm'`.\nالجواب:", "qhash": "4a12c3ed79b67128"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (-1) * x + (-6)", "tests": ["assert evaluate(10) == 84", "assert evaluate(-5) == 24", "assert evaluate(19) == 336", "assert evaluate(-7) == 50", "assert evaluate(16) == 234", "assert evaluate(11) == 104", "assert evaluate(-13) == 176", "assert evaluate(0) == -6"], "test_code": "assert evaluate(10) == 84\nassert evaluate(-5) == 24\nassert evaluate(19) == 336\nassert evaluate(-7) == 50\nassert evaluate(16) == 234\nassert evaluate(11) == 104\nassert evaluate(-13) == 176\nassert evaluate(0) == -6", "answer": "def evaluate(x):\n return 1 * x ** 2 + (-1) * x + (-6)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (-1) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 1x² - 1x - 6 عند العدد الصحيح x.\nمثال: `evaluate(10)` يجب أن تُرجع `84`.\nالجواب:", "qhash": "bc20f88ae11352f9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(819352269))\nprint(rec(rec(819352269)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(819352269))\nprint(rec(rec(819352269)))\n```\nالجواب:", "qhash": "d42771ee879dae9f", "answer": "45\n9", "completion": " الناتج:\n```text\n45\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(12) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun']", "assert label_numbers(12) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun']", "assert label_numbers(17) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon', '17']", "assert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15']", "assert label_numbers(0) == []"], "test_code": "assert label_numbers(12) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun']\nassert label_numbers(12) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun']\nassert label_numbers(17) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15', 'Moon', '17']\nassert label_numbers(15) == ['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun', '13', '14', '15']\nassert label_numbers(0) == []", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Sun'\n if i % 8 == 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 % 6 == 0:\n s += 'Sun'\n if i % 8 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Sun'، وإن قَبِلها على 8 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(12)` يُرجع `['1', '2', '3', '4', '5', 'Sun', '7', 'Moon', '9', '10', '11', 'Sun']`.\nالجواب:", "qhash": "f2d34c13093cdd83"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([32, 82, 48, 61, 26]) == [32, 114, 162, 0, 26]", "assert rolling_total([177, 93, 173, 178, 27, 56, 181, 1, 177]) == [177, 0, 173, 0, 27, 83, 0, 1, 178]", "assert rolling_total([137, 73, 61, 124, -5, 149, 122, 140, 46]) == [137, 0, 61, 0, -5, 144, 0, 140, 0]", "assert rolling_total([110]) == [110]", "assert rolling_total([152, 89, 120, 138, 38, 83, 130, 24, 179]) == [152, 0, 120, 0, 38, 121, 0, 24, 0]", "assert rolling_total([21, 168, 57, 10, 75, 131, 5, 35, 88, 146]) == [21, 0, 57, 67, 142, 0, 5, 40, 128, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([32, 82, 48, 61, 26]) == [32, 114, 162, 0, 26]\nassert rolling_total([177, 93, 173, 178, 27, 56, 181, 1, 177]) == [177, 0, 173, 0, 27, 83, 0, 1, 178]\nassert rolling_total([137, 73, 61, 124, -5, 149, 122, 140, 46]) == [137, 0, 61, 0, -5, 144, 0, 140, 0]\nassert rolling_total([110]) == [110]\nassert rolling_total([152, 89, 120, 138, 38, 83, 130, 24, 179]) == [152, 0, 120, 0, 38, 121, 0, 24, 0]\nassert rolling_total([21, 168, 57, 10, 75, 131, 5, 35, 88, 146]) == [21, 0, 57, 67, 142, 0, 5, 40, 128, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 183 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([32, 82, 48, 61, 26])` يجب أن تُرجع `[32, 114, 162, 0, 26]`.\nالجواب:", "qhash": "36e3f0e6b1d5f0cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 10) // 2 for x in range(0, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 10) // 2 for x in range(0, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "baa33ddc4df29e23", "answer": "[5, 6, 7, 8, 9, 10]\n6 45", "completion": " الناتج:\n```text\n[5, 6, 7, 8, 9, 10]\n6 45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'سماء'\nprint(len(kalima))\nprint(kalima[0])\nprint('م' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'سماء'\nprint(len(kalima))\nprint(kalima[0])\nprint('م' in kalima)\n```\nالجواب:", "qhash": "175ca587122ad912", "answer": "4\nس\nTrue", "completion": " الناتج:\n```text\n4\nس\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('يوسف', 43), ('رنا', 32), ('سعيد', 50), ('عمر', 49)]\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 = [('يوسف', 43), ('رنا', 32), ('سعيد', 50), ('عمر', 49)]\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": "b1b712ccbf108311", "answer": "[('رنا', 32), ('يوسف', 43), ('عمر', 49), ('سعيد', 50)]\n['سعيد', 'عمر']", "completion": " الناتج:\n```text\n[('رنا', 32), ('يوسف', 43), ('عمر', 49), ('سعيد', 50)]\n['سعيد', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['winter', 'coffee', 'pixel', 'cloud', 'python']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['winter', 'coffee', 'pixel', 'cloud', 'python']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3c5577793da2b716", "answer": "['pixel', 'cloud', 'winter', 'coffee', 'python']\n['winter', 'python', 'coffee']", "completion": " الناتج:\n```text\n['pixel', 'cloud', 'winter', 'coffee', 'python']\n['winter', 'python', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(268) == 6906", "assert total_multiples(80) == 633", "assert total_multiples(197) == 3856", "assert total_multiples(83) == 713", "assert total_multiples(153) == 2274", "assert total_multiples(216) == 4264", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(268) == 6906\nassert total_multiples(80) == 633\nassert total_multiples(197) == 3856\nassert total_multiples(83) == 713\nassert total_multiples(153) == 2274\nassert total_multiples(216) == 4264\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 % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 13.\nمثال: `total_multiples(268)` يجب أن تُرجع `6906`.\nالجواب:", "qhash": "9ecb76b8d3b072e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "tests": ["assert sum_terms(8) == 70176", "assert sum_terms(6) == 18200", "assert sum_terms(1) == 8", "assert sum_terms(11) == 319792", "assert sum_terms(1) == 8", "assert sum_terms(1) == 8", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(8) == 70176\nassert sum_terms(6) == 18200\nassert sum_terms(1) == 8\nassert sum_terms(11) == 319792\nassert sum_terms(1) == 8\nassert sum_terms(1) == 8\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(8)` يُرجع `70176`.\nالجواب:", "qhash": "b7cd3ac31de6269f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 1009", "tests": ["assert multi_fact(8) == 80", "assert multi_fact(44) == 37", "assert multi_fact(37) == 423", "assert multi_fact(15) == 908", "assert multi_fact(1) == 1", "assert multi_fact(12) == 935", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(8) == 80\nassert multi_fact(44) == 37\nassert multi_fact(37) == 423\nassert multi_fact(15) == 908\nassert multi_fact(1) == 1\nassert multi_fact(12) == 935\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 1009", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(8)` يُرجع `80`.\nالجواب:", "qhash": "c69f225cfa807be1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 8 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert play(9) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9']", "assert play(8) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue']", "assert play(18) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18']", "assert play(7) == ['1', '2', '3', '4', '5', '6', 'Red']", "assert play(9) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9']"], "test_code": "assert play(9) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9']\nassert play(8) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue']\nassert play(18) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18']\nassert play(7) == ['1', '2', '3', '4', '5', '6', 'Red']\nassert play(9) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Red'، وإن قَبِلها على 8 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(9)` يُرجع `['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9']`.\nالجواب:", "qhash": "121b648acc589ade"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 67) == 1)", "tests": ["assert coprime_count(71) == 70", "assert coprime_count(96) == 95", "assert coprime_count(43) == 43", "assert coprime_count(141) == 139", "assert coprime_count(86) == 85", "assert coprime_count(132) == 131", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(71) == 70\nassert coprime_count(96) == 95\nassert coprime_count(43) == 43\nassert coprime_count(141) == 139\nassert coprime_count(86) == 85\nassert coprime_count(132) == 131\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, 67) == 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, 67) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 67) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(71)` يُرجع `70`.\nالجواب:", "qhash": "2ff937caa8fb5c47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert pow_total(3) == 154", "assert pow_total(8) == 2244", "assert pow_total(5) == 605", "assert pow_total(2) == 55", "assert pow_total(2) == 55", "assert pow_total(1) == 11", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 154\nassert pow_total(8) == 2244\nassert pow_total(5) == 605\nassert pow_total(2) == 55\nassert pow_total(2) == 55\nassert pow_total(1) == 11\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 11 * i ** 2\n return total\n```\nمثال: `pow_total(3)` يجب أن تُرجع `154`.\nالجواب:", "qhash": "10b1f4e318ced291"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 3 * x ** 2 + (-3) * x + (-5)", "tests": ["assert poly(8) == 163", "assert poly(-10) == 325", "assert poly(-13) == 541", "assert poly(-15) == 715", "assert poly(13) == 463", "assert poly(5) == 55", "assert poly(-19) == 1135", "assert poly(0) == -5"], "test_code": "assert poly(8) == 163\nassert poly(-10) == 325\nassert poly(-13) == 541\nassert poly(-15) == 715\nassert poly(13) == 463\nassert poly(5) == 55\nassert poly(-19) == 1135\nassert poly(0) == -5", "answer": "def poly(x):\n return 3 * x ** 2 + (-3) * x + (-5)", "completion": " ```python\ndef poly(x):\n return 3 * x ** 2 + (-3) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 3x² - 3x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(8)` يُرجع `163`.\nالجواب:", "qhash": "0f3cb785131583bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(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 cumulative([93, 58, 16, 79, 95, 21, 38]) == [93, 151, 167, 0, 95, 116, 154]", "assert cumulative([61, 129, 145, 29, 138, 175, 91]) == [61, 0, 145, 174, 0, 175, 0]", "assert cumulative([101, 155]) == [101, 0]", "assert cumulative([]) == []", "assert cumulative([22, 155, 151, 175]) == [22, 177, 0, 175]", "assert cumulative([114, -6, 79, 146]) == [114, 108, 187, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([93, 58, 16, 79, 95, 21, 38]) == [93, 151, 167, 0, 95, 116, 154]\nassert cumulative([61, 129, 145, 29, 138, 175, 91]) == [61, 0, 145, 174, 0, 175, 0]\nassert cumulative([101, 155]) == [101, 0]\nassert cumulative([]) == []\nassert cumulative([22, 155, 151, 175]) == [22, 177, 0, 175]\nassert cumulative([114, -6, 79, 146]) == [114, 108, 187, 0]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 188 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([93, 58, 16, 79, 95, 21, 38])` يُرجع `[93, 151, 167, 0, 95, 116, 154]`.\nالجواب:", "qhash": "4f4723131ae34301"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 329\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 = 329\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": "ff2a3e794dc5d67b", "answer": "50", "completion": " الناتج:\n```text\n50\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * 4 + -8 for x in range(5, 20) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * 4 + -8 for x in range(5, 20) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "52d6441b7d81c1cb", "answer": "[24, 44, 64]\n3 132", "completion": " الناتج:\n```text\n[24, 44, 64]\n3 132\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [7, 5, 14, -4, 18, 21, 15, 13, 32]\nprint(xs[3:6])\nprint(xs[::-2])\nprint(len(xs[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [7, 5, 14, -4, 18, 21, 15, 13, 32]\nprint(xs[3:6])\nprint(xs[::-2])\nprint(len(xs[3:6]))\n```\nالجواب:", "qhash": "257a4b704df77eec", "answer": "[-4, 18, 21]\n[32, 15, 18, 14, 7]\n3", "completion": " الناتج:\n```text\n[-4, 18, 21]\n[32, 15, 18, 14, 7]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 19", "tests": ["assert multi_fact(9) == 7", "assert multi_fact(50) == 0", "assert multi_fact(7) == 2", "assert multi_fact(18) == 11", "assert multi_fact(40) == 17", "assert multi_fact(15) == 7", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(9) == 7\nassert multi_fact(50) == 0\nassert multi_fact(7) == 2\nassert multi_fact(18) == 11\nassert multi_fact(40) == 17\nassert multi_fact(15) == 7\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 19", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(9)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "5488a7e29e5c5c2f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 15\nfor n in range(9, 28, 1):\n acc += n * 5\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 15\nfor n in range(9, 28, 1):\n acc += n * 5\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "f7e10a8c846da8e5", "answer": "1725\n27", "completion": " الناتج:\n```text\n1725\n27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 10 for x in range(4, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 10 for x in range(4, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "42d7b655855755c2", "answer": "[15, 39, 71]\n3 125", "completion": " الناتج:\n```text\n[15, 39, 71]\n3 125\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 9\nfor j in range(7, 21, 4):\n s -= j * 4\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 9\nfor j in range(7, 21, 4):\n s -= j * 4\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "3caa026fb309116c", "answer": "-199\n19", "completion": " الناتج:\n```text\n-199\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([22, 15, -29, 50, 12, 9, 39, 35, 12]) == 50", "assert largest_div([-4, -2, -2]) == -2", "assert largest_div([1, 3, 5]) == None", "assert largest_div([22, 6, -25, 16, -2, -12, 30, 22]) == 30", "assert largest_div([-20, 23, 14]) == 14", "assert largest_div([]) == None"], "test_code": "assert largest_div([22, 15, -29, 50, 12, 9, 39, 35, 12]) == 50\nassert largest_div([-4, -2, -2]) == -2\nassert largest_div([1, 3, 5]) == None\nassert largest_div([22, 6, -25, 16, -2, -12, 30, 22]) == 30\nassert largest_div([-20, 23, 14]) == 14\nassert largest_div([]) == None", "answer": "def largest_div(nums):\n best = None\n for x in nums:\n if x % 2 == 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 % 2 == 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 % 2 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(nums):\n best = None\n for x in nums:\n if x % 2 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([22, 15, -29, 50, 12, 9, 39, 35, 12])` يُرجع `50`.\nالجواب:", "qhash": "d799ce17432dc058"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([57, -20, 5, -15, 27, 9, -23, 39, 6]) == 6", "assert biggest_mult([-30, -30, -12]) == -12", "assert biggest_mult([1, 7]) == None", "assert biggest_mult([38, 9, 21, -29, -39, 37, 14]) == None", "assert biggest_mult([34, 7, -41, -47, -34, 26, 10]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([57, -20, 5, -15, 27, 9, -23, 39, 6]) == 6\nassert biggest_mult([-30, -30, -12]) == -12\nassert biggest_mult([1, 7]) == None\nassert biggest_mult([38, 9, 21, -29, -39, 37, 14]) == None\nassert biggest_mult([34, 7, -41, -47, -34, 26, 10]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(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للتوضيح: الاستدعاء `biggest_mult([57, -20, 5, -15, 27, 9, -23, 39, 6])` يُرجع `6`.\nالجواب:", "qhash": "5688c221197b1523"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return text.count('ل')", "tests": ["assert letter_count('سماء معلم قهوة خبز') == 1", "assert letter_count('طالب سماء جبل قهوة صحراء نهار قمر كتاب') == 2", "assert letter_count('سيارة نهار سفينة سفينة حصان') == 0", "assert letter_count('باب صحراء سوق باب خبز قهوة') == 0", "assert letter_count('حديقة مكتبة ماء برتقال مطر قهوة حاسوب لغة') == 2", "assert letter_count('تفاحة تفاحة ميناء مدرسة حاسوب') == 0", "assert letter_count('تفاحة قمر') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('سماء معلم قهوة خبز') == 1\nassert letter_count('طالب سماء جبل قهوة صحراء نهار قمر كتاب') == 2\nassert letter_count('سيارة نهار سفينة سفينة حصان') == 0\nassert letter_count('باب صحراء سوق باب خبز قهوة') == 0\nassert letter_count('حديقة مكتبة ماء برتقال مطر قهوة حاسوب لغة') == 2\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": "74b035544f832c4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert weighted_sum(4) == 70", "assert weighted_sum(1) == 7", "assert weighted_sum(13) == 637", "assert weighted_sum(7) == 196", "assert weighted_sum(1) == 7", "assert weighted_sum(1) == 7", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 70\nassert weighted_sum(1) == 7\nassert weighted_sum(13) == 637\nassert weighted_sum(7) == 196\nassert weighted_sum(1) == 7\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 ** 1\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(4)` يُرجع `70`.\nالجواب:", "qhash": "28564e4b8bda13ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'زينب': 8, 'فيصل': 18, 'حسن': 35, 'نور': 21}\nd['زينب'] += 8\nd['منى'] = 21\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 = {'زينب': 8, 'فيصل': 18, 'حسن': 35, 'نور': 21}\nd['زينب'] += 8\nd['منى'] = 21\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": "199c86805df5f850", "answer": "5\nحسن\n111\n['حسن']", "completion": " الناتج:\n```text\n5\nحسن\n111\n['حسن']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('ب')", "tests": ["assert tally_letter('دفتر طائرة عمل عمل نور نور') == 0", "assert tally_letter('شجرة قمر') == 0", "assert tally_letter('سفينة حديقة جمل مطر حاسوب') == 1", "assert tally_letter('جبل شجرة نهار') == 1", "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('سفينة حديقة جمل مطر حاسوب') == 1\nassert tally_letter('جبل شجرة نهار') == 1\nassert tally_letter('') == 0\nassert tally_letter('') == 0\nassert tally_letter('مدينة مطر مطر') == 0\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n return text.count('ب')", "completion": " ```python\ndef tally_letter(text):\n return text.count('ب')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `tally_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «ب» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('دفتر طائرة عمل عمل نور نور')` يُرجع `0`.\nالجواب:", "qhash": "12144333c1866970"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 9 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert play(19) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19']", "assert play(4) == ['1', '2', '3', '4']", "assert play(3) == ['1', '2', '3']", "assert play(18) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue']", "assert play(19) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19']"], "test_code": "assert play(19) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19']\nassert play(4) == ['1', '2', '3', '4']\nassert play(3) == ['1', '2', '3']\nassert play(18) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue']\nassert play(19) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19']", "answer": "def play(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 play(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سؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Red'، وإن قَبِلها على 9 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(19)` يُرجع `['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19']`.\nالجواب:", "qhash": "867286d04d163e66"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 9 for x in range(1, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 9 for x in range(1, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "5e82e653a9475bd0", "answer": "[-5, 7, 27, 55, 91]\n5 175", "completion": " الناتج:\n```text\n[-5, 7, 27, 55, 91]\n5 175\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_div([53, 11, 59, 79, 61, 30]) == 1", "assert count_div([14, 11, -24, -16, 74, 68, 23, 12]) == 1", "assert count_div([69, 80, 65, -30, -2]) == 1", "assert count_div([72, 56, 69, 55, -14, 39, 26]) == 0", "assert count_div([-13, -25, -29, 8, 5, -14, -13, -21, 31, 37, 26, 13]) == 0", "assert count_div([69, 25, 39, 5, 27, 80, 26, 90, -34, 25]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([53, 11, 59, 79, 61, 30]) == 1\nassert count_div([14, 11, -24, -16, 74, 68, 23, 12]) == 1\nassert count_div([69, 80, 65, -30, -2]) == 1\nassert count_div([72, 56, 69, 55, -14, 39, 26]) == 0\nassert count_div([-13, -25, -29, 8, 5, -14, -13, -21, 31, 37, 26, 13]) == 0\nassert count_div([69, 25, 39, 5, 27, 80, 26, 90, -34, 25]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 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 % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([53, 11, 59, 79, 61, 30])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "58c67a7c81d3133c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 4 <= x <= 13)", "tests": ["assert filter_range([23, 12, 4, 6, 15]) == [-36, -18, -12]", "assert filter_range([-16, 10, 12, 41, 54]) == [-36, -30]", "assert filter_range([-25, 29, -20, 27, 20, 52]) == []", "assert filter_range([49, 36]) == []", "assert filter_range([20, -25, -17, 38, 14, -20, -3, -19, -12]) == []", "assert filter_range([27, 43, 54, 57, 6, 2]) == [-18]", "assert filter_range([41, 3, 36, -7, -2]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([23, 12, 4, 6, 15]) == [-36, -18, -12]\nassert filter_range([-16, 10, 12, 41, 54]) == [-36, -30]\nassert filter_range([-25, 29, -20, 27, 20, 52]) == []\nassert filter_range([49, 36]) == []\nassert filter_range([20, -25, -17, 38, 14, -20, -3, -19, -12]) == []\nassert filter_range([27, 43, 54, 57, 6, 2]) == [-18]\nassert filter_range([41, 3, 36, -7, -2]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 4 <= x <= 13)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -3 for x in xs if 4 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 4 و13 (شاملًا الطرفين) في -3.\nمثال: `filter_range([23, 12, 4, 6, 15])` يجب أن تُرجع `[-36, -18, -12]`.\nالجواب:", "qhash": "7374dff9ad4b3681"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([40, 31, 25, 2, 4, 34, 3]) == [2, 4, 34, 3, 40, 31, 25]", "assert rotate_by([20, 27, 47, 13, 12, 30, -7, -6, -9, 49]) == [20, 27, 47, 13, 12, 30, -7, -6, -9, 49]", "assert rotate_by([39, 20]) == [39, 20]", "assert rotate_by([37, -5, 3, -1]) == [3, -1, 37, -5]", "assert rotate_by([15, 46, 15, 27, -9, 47]) == [-9, 47, 15, 46, 15, 27]", "assert rotate_by([39]) == [39]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([40, 31, 25, 2, 4, 34, 3]) == [2, 4, 34, 3, 40, 31, 25]\nassert rotate_by([20, 27, 47, 13, 12, 30, -7, -6, -9, 49]) == [20, 27, 47, 13, 12, 30, -7, -6, -9, 49]\nassert rotate_by([39, 20]) == [39, 20]\nassert rotate_by([37, -5, 3, -1]) == [3, -1, 37, -5]\nassert rotate_by([15, 46, 15, 27, -9, 47]) == [-9, 47, 15, 46, 15, 27]\nassert rotate_by([39]) == [39]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return ____\n```\nمثال: `rotate_by([40, 31, 25, 2, 4, 34, 3])` يجب أن تُرجع `[2, 4, 34, 3, 40, 31, 25]`.\nالجواب:", "qhash": "f04f41287bf535f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "tests": ["assert weighted_sum(6) == 97608", "assert weighted_sum(11) == 3055008", "assert weighted_sum(14) == 12318600", "assert weighted_sum(6) == 97608", "assert weighted_sum(5) == 35400", "assert weighted_sum(1) == 8", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(6) == 97608\nassert weighted_sum(11) == 3055008\nassert weighted_sum(14) == 12318600\nassert weighted_sum(6) == 97608\nassert weighted_sum(5) == 35400\nassert weighted_sum(1) == 8\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 5\n return total", "completion": " ```python\ndef weighted_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 weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 5\n return total\n```\nمثال: `weighted_sum(6)` يجب أن تُرجع `97608`.\nالجواب:", "qhash": "d7ec3fe71d1fdd78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -7 * x ** 2 + (-6) * x + (-7)", "tests": ["assert quad(4) == -143", "assert quad(-6) == -223", "assert quad(1) == -20", "assert quad(8) == -503", "assert quad(0) == -7", "assert quad(-15) == -1492", "assert quad(-20) == -2687", "assert quad(0) == -7"], "test_code": "assert quad(4) == -143\nassert quad(-6) == -223\nassert quad(1) == -20\nassert quad(8) == -503\nassert quad(0) == -7\nassert quad(-15) == -1492\nassert quad(-20) == -2687\nassert quad(0) == -7", "answer": "def quad(x):\n return -7 * x ** 2 + (-6) * x + (-7)", "completion": " ```python\ndef quad(x):\n return -7 * x ** 2 + (-6) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -7x² - 6x - 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(4)` يُرجع `-143`.\nالجواب:", "qhash": "65c5d2dbdc97b825"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -5 * x ** 2 + (-7) * x + (9)", "tests": ["assert evaluate(1) == -3", "assert evaluate(8) == -367", "assert evaluate(-10) == -421", "assert evaluate(17) == -1555", "assert evaluate(-7) == -187", "assert evaluate(-3) == -15", "assert evaluate(-5) == -81", "assert evaluate(0) == 9"], "test_code": "assert evaluate(1) == -3\nassert evaluate(8) == -367\nassert evaluate(-10) == -421\nassert evaluate(17) == -1555\nassert evaluate(-7) == -187\nassert evaluate(-3) == -15\nassert evaluate(-5) == -81\nassert evaluate(0) == 9", "answer": "def evaluate(x):\n return -5 * x ** 2 + (-7) * x + (9)", "completion": " ```python\ndef evaluate(x):\n return -5 * x ** 2 + (-7) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -5x² - 7x + 9 عند العدد الصحيح x.\nمثال: `evaluate(1)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "f5db8806c6831d7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(291126909))\nprint(calc(calc(291126909)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(291126909))\nprint(calc(calc(291126909)))\n```\nالجواب:", "qhash": "30285ed137869ab0", "answer": "39\n12", "completion": " الناتج:\n```text\n39\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(26) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25', '26']", "assert play(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']", "assert play(11) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11']", "assert play(10) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10']", "assert play(10) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10']"], "test_code": "assert play(26) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25', '26']\nassert play(25) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25']\nassert play(11) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11']\nassert play(10) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10']\nassert play(10) == ['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10']", "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 % 7 == 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 % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Tic'، وإن قَبِلها على 7 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(26)` يُرجع `['1', '2', '3', '4', '5', 'Tic', 'Tac', '8', '9', '10', '11', 'Tic', '13', 'Tac', '15', '16', '17', 'Tic', '19', '20', 'Tac', '22', '23', 'Tic', '25', '26']`.\nالجواب:", "qhash": "073227544a397511"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([16, 1, 7, 11, 4, 3, 6, 5]) == [16, 17, 24, 35, 39, 42, 48, 53]", "assert acc_reset([24, 71, 37]) == [24, 0, 37]", "assert acc_reset([71, -6, 30, 32, 36, 66, 56, 69]) == [71, 65, 0, 32, 68, 0, 56, 0]", "assert acc_reset([42]) == [42]", "assert acc_reset([-8, 46, 56, 65, 31]) == [-8, 38, 0, 65, 0]", "assert acc_reset([25, 62, -1, 46, 36]) == [25, 0, -1, 45, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([16, 1, 7, 11, 4, 3, 6, 5]) == [16, 17, 24, 35, 39, 42, 48, 53]\nassert acc_reset([24, 71, 37]) == [24, 0, 37]\nassert acc_reset([71, -6, 30, 32, 36, 66, 56, 69]) == [71, 65, 0, 32, 68, 0, 56, 0]\nassert acc_reset([42]) == [42]\nassert acc_reset([-8, 46, 56, 65, 31]) == [-8, 38, 0, 65, 0]\nassert acc_reset([25, 62, -1, 46, 36]) == [25, 0, -1, 45, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 72:\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 > 72:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 72 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([16, 1, 7, 11, 4, 3, 6, 5])` يُرجع `[16, 17, 24, 35, 39, 42, 48, 53]`.\nالجواب:", "qhash": "1643a2be1e99bd9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 1 + -8 for x in range(1, 13) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 1 + -8 for x in range(1, 13) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "097b28ddf625440a", "answer": "[-6, -3, 0, 3]\n4 -6", "completion": " الناتج:\n```text\n[-6, -3, 0, 3]\n4 -6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert game(12) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']", "assert game(0) == []", "assert game(4) == ['1', '2', '3', '4']", "assert game(24) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', 'Yo']", "assert game(3) == ['1', '2', '3']"], "test_code": "assert game(12) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']\nassert game(0) == []\nassert game(4) == ['1', '2', '3', '4']\nassert game(24) == ['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo', '13', '14', 'Hi', '16', '17', 'Yo', '19', 'Hi', '21', '22', '23', 'Yo']\nassert game(3) == ['1', '2', '3']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\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 % 5 == 0:\n s += 'Hi'\n if i % 6 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Hi'، وعلى 6 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(12)` يجب أن تُرجع `['1', '2', '3', '4', 'Hi', 'Yo', '7', '8', '9', 'Hi', '11', 'Yo']`.\nالجواب:", "qhash": "bef582e03f5a58b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(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 largest_div([12, -23, 10, 38, -5, 13, 11]) == 38", "assert largest_div([-8, -10, -6]) == -6", "assert largest_div([1, 3, 5, 7]) == None", "assert largest_div([-38]) == -38", "assert largest_div([-32, 48, -3, -34, -34, -17, -6, 24, 4]) == 48", "assert largest_div([]) == None"], "test_code": "assert largest_div([12, -23, 10, 38, -5, 13, 11]) == 38\nassert largest_div([-8, -10, -6]) == -6\nassert largest_div([1, 3, 5, 7]) == None\nassert largest_div([-38]) == -38\nassert largest_div([-32, 48, -3, -34, -34, -17, -6, 24, 4]) == 48\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(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 largest_div(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مثال: `largest_div([12, -23, 10, 38, -5, 13, 11])` يجب أن تُرجع `38`.\nالجواب:", "qhash": "8a32c8504a1032d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ls'}", "tests": ["assert freq_of('of by') == {'l': 0, 's': 0}", "assert freq_of('matrix orange garden go') == {'l': 0, 's': 0}", "assert freq_of('python coffee summer') == {'l': 0, 's': 1}", "assert freq_of('table a table to winter') == {'l': 2, 's': 0}", "assert freq_of('river rocket signal to') == {'l': 1, 's': 1}", "assert freq_of('it camel go engine vector') == {'l': 1, 's': 0}", "assert freq_of('') == {'l': 0, 's': 0}"], "test_code": "assert freq_of('of by') == {'l': 0, 's': 0}\nassert freq_of('matrix orange garden go') == {'l': 0, 's': 0}\nassert freq_of('python coffee summer') == {'l': 0, 's': 1}\nassert freq_of('table a table to winter') == {'l': 2, 's': 0}\nassert freq_of('river rocket signal to') == {'l': 1, 's': 1}\nassert freq_of('it camel go engine vector') == {'l': 1, 's': 0}\nassert freq_of('') == {'l': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ls'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ls'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'l'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('of by')` يجب أن تُرجع `{'l': 0, 's': 0}`.\nالجواب:", "qhash": "8d685e95ee61596b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71", "tests": ["assert mfact(3) == 3", "assert mfact(24) == 64", "assert mfact(41) == 7", "assert mfact(53) == 64", "assert mfact(1) == 1", "assert mfact(18) == 65", "assert mfact(0) == 1"], "test_code": "assert mfact(3) == 3\nassert mfact(24) == 64\nassert mfact(41) == 7\nassert mfact(53) == 64\nassert mfact(1) == 1\nassert mfact(18) == 65\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(3)` يجب أن تُرجع `3`.\nالجواب:", "qhash": "40c11b2e301b7eff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 73) == 1)", "tests": ["assert coprimes(20) == 20", "assert coprimes(42) == 42", "assert coprimes(88) == 87", "assert coprimes(69) == 69", "assert coprimes(90) == 89", "assert coprimes(146) == 144", "assert coprimes(1) == 1"], "test_code": "assert coprimes(20) == 20\nassert coprimes(42) == 42\nassert coprimes(88) == 87\nassert coprimes(69) == 69\nassert coprimes(90) == 89\nassert coprimes(146) == 144\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, 73) == 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, 73) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 73) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(20)` يُرجع `20`.\nالجواب:", "qhash": "1569b34c280ebc19"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([9, 32, 2, 2, -28]) == None", "assert biggest_mult([-10, -40, -10]) == -10", "assert biggest_mult([1, 11, 21, 31]) == None", "assert biggest_mult([-34, -10, -31]) == -10", "assert biggest_mult([33, -19, -45, -24, 3]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([9, 32, 2, 2, -28]) == None\nassert biggest_mult([-10, -40, -10]) == -10\nassert biggest_mult([1, 11, 21, 31]) == None\nassert biggest_mult([-34, -10, -31]) == -10\nassert biggest_mult([33, -19, -45, -24, 3]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 == 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 % 10 == 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 % 10 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(nums):\n best = None\n for x in nums:\n if x % 10 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `biggest_mult([9, 32, 2, 2, -28])` يُرجع `None`.\nالجواب:", "qhash": "8acd0c82aa96f65f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(19))\nprint(h(19, -6))\nprint(h(h(-6), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=1):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(h(19))\nprint(h(19, -6))\nprint(h(h(-6), 19))\n```\nالجواب:", "qhash": "b2a1645edf9a64a8", "answer": "-58\n-51\n-66", "completion": " الناتج:\n```text\n-58\n-51\n-66\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('rocket up camel data stone code an falcon') == 'falcon,an,code,stone,data,camel,up,rocket'", "assert rev_join('signal') == 'signal'", "assert rev_join('') == ''", "assert rev_join('vector river') == 'river,vector'", "assert rev_join('is up garden on it banana') == 'banana,it,on,garden,up,is'", "assert rev_join('planet cloud vector up banana pixel') == 'pixel,banana,up,vector,cloud,planet'", "assert rev_join('go pixel code an rocket signal camel cloud') == 'cloud,camel,signal,rocket,an,code,pixel,go'"], "test_code": "assert rev_join('rocket up camel data stone code an falcon') == 'falcon,an,code,stone,data,camel,up,rocket'\nassert rev_join('signal') == 'signal'\nassert rev_join('') == ''\nassert rev_join('vector river') == 'river,vector'\nassert rev_join('is up garden on it banana') == 'banana,it,on,garden,up,is'\nassert rev_join('planet cloud vector up banana pixel') == 'pixel,banana,up,vector,cloud,planet'\nassert rev_join('go pixel code an rocket signal camel cloud') == 'cloud,camel,signal,rocket,an,code,pixel,go'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_join('rocket up camel data stone code an falcon')` يُرجع `'falcon,an,code,stone,data,camel,up,rocket'`.\nالجواب:", "qhash": "d221a3eab4f5c61d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ا')", "tests": ["assert count_letter('مكتبة تفاحة مطر رمل خبز سوق حصان قلم') == 2", "assert count_letter('طائرة سفينة نهر طائرة حاسوب قلم وردة مدينة') == 3", "assert count_letter('مطر دفتر فجر حديقة علم شمس قلم') == 0", "assert count_letter('نهر مدرسة صديق') == 0", "assert count_letter('جبل باب علم نور') == 1", "assert count_letter('سيارة دفتر') == 1", "assert count_letter('تفاحة طائرة وردة بحر حاسوب طالب') == 4", "assert count_letter('') == 0"], "test_code": "assert count_letter('مكتبة تفاحة مطر رمل خبز سوق حصان قلم') == 2\nassert count_letter('طائرة سفينة نهر طائرة حاسوب قلم وردة مدينة') == 3\nassert count_letter('مطر دفتر فجر حديقة علم شمس قلم') == 0\nassert count_letter('نهر مدرسة صديق') == 0\nassert count_letter('جبل باب علم نور') == 1\nassert count_letter('سيارة دفتر') == 1\nassert count_letter('تفاحة طائرة وردة بحر حاسوب طالب') == 4\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)` بحيث تُعيد عدد مرات ظهور الحرف «ا» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('مكتبة تفاحة مطر رمل خبز سوق حصان قلم')` يُرجع `2`.\nالجواب:", "qhash": "88161dda5792905a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -1 * x ** 2 + (-5) * x + (-3)", "tests": ["assert poly(3) == -27", "assert poly(1) == -9", "assert poly(14) == -269", "assert poly(-2) == 3", "assert poly(18) == -417", "assert poly(-3) == 3", "assert poly(15) == -303", "assert poly(0) == -3"], "test_code": "assert poly(3) == -27\nassert poly(1) == -9\nassert poly(14) == -269\nassert poly(-2) == 3\nassert poly(18) == -417\nassert poly(-3) == 3\nassert poly(15) == -303\nassert poly(0) == -3", "answer": "def poly(x):\n return -1 * x ** 2 + (-5) * x + (-3)", "completion": " ```python\ndef poly(x):\n return -1 * x ** 2 + (-5) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -1x² - 5x - 3 عند العدد الصحيح x.\nمثال: `poly(3)` يجب أن تُرجع `-27`.\nالجواب:", "qhash": "c2d73e131d868229"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(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_matching([70, 10, 29, 45, 6, 8]) == 1", "assert count_matching([90, 60, -1, 83, 68, 45, -33, 3, -35, -4, -7]) == 3", "assert count_matching([22, 45]) == 1", "assert count_matching([21, 7, -16, 60, 28, 71, -36, 70, 66, 14, 40]) == 1", "assert count_matching([33, 10, 39, 66, 82]) == 2", "assert count_matching([34, 9, 38, 63, -8, -28]) == 2", "assert count_matching([]) == 0"], "test_code": "assert count_matching([70, 10, 29, 45, 6, 8]) == 1\nassert count_matching([90, 60, -1, 83, 68, 45, -33, 3, -35, -4, -7]) == 3\nassert count_matching([22, 45]) == 1\nassert count_matching([21, 7, -16, 60, 28, 71, -36, 70, 66, 14, 40]) == 1\nassert count_matching([33, 10, 39, 66, 82]) == 2\nassert count_matching([34, 9, 38, 63, -8, -28]) == 2\nassert count_matching([]) == 0", "answer": "def count_matching(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_matching(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_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_matching([70, 10, 29, 45, 6, 8])` يُرجع `1`.\nالجواب:", "qhash": "ab0ead8fd61bb003"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'ليلى': 45, 'سلمى': 29, 'مريم': 10}\nscores['سلمى'] += 5\nscores['خالد'] = 39\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 19])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'ليلى': 45, 'سلمى': 29, 'مريم': 10}\nscores['سلمى'] += 5\nscores['خالد'] = 39\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 19])\n```\nالجواب:", "qhash": "72c0b04a2d29643f", "answer": "4\nليلى\n128\n['ليلى', 'سلمى', 'خالد']", "completion": " الناتج:\n```text\n4\nليلى\n128\n['ليلى', 'سلمى', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([31, 1, 43, 41, -10, 49, 48, 11, 1]) == 48", "assert top_divisible([-15, -9, -12]) == -9", "assert top_divisible([1, 4]) == None", "assert top_divisible([13, 25, 0, 23, 16, 21, -34]) == 21", "assert top_divisible([-7, -11, -5, -19, 23]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([31, 1, 43, 41, -10, 49, 48, 11, 1]) == 48\nassert top_divisible([-15, -9, -12]) == -9\nassert top_divisible([1, 4]) == None\nassert top_divisible([13, 25, 0, 23, 16, 21, -34]) == 21\nassert top_divisible([-7, -11, -5, -19, 23]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([31, 1, 43, 41, -10, 49, 48, 11, 1])` يُرجع `48`.\nالجواب:", "qhash": "db417e7ddd376657"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([-5, 39, 31, 53, -14, 1, 39]) == -14", "assert top_divisible([-35, -14, -28]) == -14", "assert top_divisible([1, 8]) == None", "assert top_divisible([-13, -18, -28]) == -28", "assert top_divisible([6, 38, 24, 2]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-5, 39, 31, 53, -14, 1, 39]) == -14\nassert top_divisible([-35, -14, -28]) == -14\nassert top_divisible([1, 8]) == None\nassert top_divisible([-13, -18, -28]) == -28\nassert top_divisible([6, 38, 24, 2]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 7 == 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 % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(xs):\n best = 0\n for x in xs:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `top_divisible([-5, 39, 31, 53, -14, 1, 39])` يجب أن تُرجع `-14`.\nالجواب:", "qhash": "b476f72139bcdc39"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([27, 3, 30, 8, 4, 8, 31]) == [27, 30, 0, 8, 12, 20, 51]", "assert reset_sum([27, 30, -9, 50, -5, -5, 16, 34, 33]) == [27, 0, -9, 41, 36, 31, 47, 0, 33]", "assert reset_sum([12, 43, 12, 2, 49, 49, 48, 37, 36]) == [12, 0, 12, 14, 0, 49, 0, 37, 0]", "assert reset_sum([26, 29, -2, 43, 49, 21, 12]) == [26, 0, -2, 41, 0, 21, 33]", "assert reset_sum([1]) == [1]", "assert reset_sum([36, 5, 19, 31, 23, -9, 0, 0]) == [36, 41, 0, 31, 0, -9, -9, -9]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([27, 3, 30, 8, 4, 8, 31]) == [27, 30, 0, 8, 12, 20, 51]\nassert reset_sum([27, 30, -9, 50, -5, -5, 16, 34, 33]) == [27, 0, -9, 41, 36, 31, 47, 0, 33]\nassert reset_sum([12, 43, 12, 2, 49, 49, 48, 37, 36]) == [12, 0, 12, 14, 0, 49, 0, 37, 0]\nassert reset_sum([26, 29, -2, 43, 49, 21, 12]) == [26, 0, -2, 41, 0, 21, 33]\nassert reset_sum([1]) == [1]\nassert reset_sum([36, 5, 19, 31, 23, -9, 0, 0]) == [36, 41, 0, 31, 0, -9, -9, -9]\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 52 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([27, 3, 30, 8, 4, 8, 31])` يُرجع `[27, 30, 0, 8, 12, 20, 51]`.\nالجواب:", "qhash": "eb00b4c7ab4bd38d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return sum(1 for w in text.split() if w.startswith('ك'))", "tests": ["assert count_letter('طالب فجر كتاب شجرة نهار ليل قهوة كتاب') == 2", "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('طالب فجر كتاب شجرة نهار ليل قهوة كتاب') == 2\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('طالب فجر كتاب شجرة نهار ليل قهوة كتاب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "5f0af3c92482a64d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'planet'\nprint(text.capitalize())\nprint(text.split('_'))\nprint(text.find('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'planet'\nprint(text.capitalize())\nprint(text.split('_'))\nprint(text.find('l'))\n```\nالجواب:", "qhash": "5d0c86ea20958973", "answer": "Planet\n['planet']\n1", "completion": " الناتج:\n```text\nPlanet\n['planet']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 19593\ncount = 0\nwhile n > 20:\n n = n // 7\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 19593\ncount = 0\nwhile n > 20:\n n = n // 7\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "01269c6eca13ae40", "answer": "8 4", "completion": " الناتج:\n```text\n8 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(5, 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(5, 3))\n```\nالجواب:", "qhash": "7f6e152c692f39eb", "answer": "125", "completion": " الناتج:\n```text\n125\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'ens'}", "tests": ["assert count_chars('desert by code desert') == {'e': 5, 'n': 0, 's': 2}", "assert count_chars('pixel planet coffee an to window') == {'e': 4, 'n': 3, 's': 0}", "assert count_chars('code pixel rocket by pixel engine') == {'e': 6, 'n': 2, 's': 0}", "assert count_chars('banana summer brain planet river on') == {'e': 3, 'n': 5, 's': 1}", "assert count_chars('falcon pixel') == {'e': 1, 'n': 1, 's': 0}", "assert count_chars('falcon to') == {'e': 0, 'n': 1, 's': 0}", "assert count_chars('') == {'e': 0, 'n': 0, 's': 0}"], "test_code": "assert count_chars('desert by code desert') == {'e': 5, 'n': 0, 's': 2}\nassert count_chars('pixel planet coffee an to window') == {'e': 4, 'n': 3, 's': 0}\nassert count_chars('code pixel rocket by pixel engine') == {'e': 6, 'n': 2, 's': 0}\nassert count_chars('banana summer brain planet river on') == {'e': 3, 'n': 5, 's': 1}\nassert count_chars('falcon pixel') == {'e': 1, 'n': 1, 's': 0}\nassert count_chars('falcon to') == {'e': 0, 'n': 1, 's': 0}\nassert count_chars('') == {'e': 0, 'n': 0, 's': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'ens'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'ens'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'n'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('desert by code desert')` يُرجع `{'e': 5, 'n': 0, 's': 2}`.\nالجواب:", "qhash": "cec321c83a77230e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'matrix'\nprint(s.replace('r', 'X'))\nprint(s[0:2])\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'matrix'\nprint(s.replace('r', 'X'))\nprint(s[0:2])\nprint(s[::-1])\n```\nالجواب:", "qhash": "c0e4cdb09ba85fda", "answer": "matXix\nma\nxirtam", "completion": " الناتج:\n```text\nmatXix\nma\nxirtam\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)", "tests": ["assert sum_div(145) == 2281", "assert sum_div(107) == 1135", "assert sum_div(286) == 8087", "assert sum_div(38) == 146", "assert sum_div(273) == 7532", "assert sum_div(260) == 6996", "assert sum_div(1) == 0"], "test_code": "assert sum_div(145) == 2281\nassert sum_div(107) == 1135\nassert sum_div(286) == 8087\nassert sum_div(38) == 146\nassert sum_div(273) == 7532\nassert sum_div(260) == 6996\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 11.\nمثال: `sum_div(145)` يجب أن تُرجع `2281`.\nالجواب:", "qhash": "a6ed5164623ab3f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 31) == 1)", "tests": ["assert coprime_count(93) == 90", "assert coprime_count(165) == 160", "assert coprime_count(182) == 177", "assert coprime_count(151) == 147", "assert coprime_count(162) == 157", "assert coprime_count(79) == 77", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(93) == 90\nassert coprime_count(165) == 160\nassert coprime_count(182) == 177\nassert coprime_count(151) == 147\nassert coprime_count(162) == 157\nassert coprime_count(79) == 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, 31) == 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, 31) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 31) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(93)` يُرجع `90`.\nالجواب:", "qhash": "60cea004a6e6fe9b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(6))\n```\nالجواب:", "qhash": "cb517c37f23d4d4f", "answer": "21", "completion": " الناتج:\n```text\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'garden'\nprint(word.split('_'))\nprint(word.count('a'))\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'garden'\nprint(word.split('_'))\nprint(word.count('a'))\nprint(len(word))\n```\nالجواب:", "qhash": "e215f9eed67505ff", "answer": "['garden']\n1\n6", "completion": " الناتج:\n```text\n['garden']\n1\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('ليل صحراء صديق') == 2", "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('باب بيت نور معلم') == 0\nassert how_many('') == 0\nassert how_many('ليل صحراء صديق') == 2\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 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ص»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('باب بيت نور معلم')` يُرجع `0`.\nالجواب:", "qhash": "b5c484f50454945e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'قلم علم'\nprint(text.find('ع'))\nprint(len(text.replace(' ', '')))\nprint('ع' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'قلم علم'\nprint(text.find('ع'))\nprint(len(text.replace(' ', '')))\nprint('ع' in text)\n```\nالجواب:", "qhash": "12621a70250fcf1e", "answer": "4\n6\nTrue", "completion": " الناتج:\n```text\n4\n6\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('data apple on summer') == 'summer_apple_data'", "assert mirror_words('is stone it signal apple') == 'apple_signal_stone'", "assert mirror_words('is at coffee engine falcon python signal up') == 'signal_python_falcon_engine_coffee'", "assert mirror_words('table music camel') == 'camel_music_table'", "assert mirror_words('table is river it winter coffee on') == 'coffee_winter_river_table'", "assert mirror_words('light summer go of') == 'summer_light'", "assert mirror_words('camel it') == 'camel'"], "test_code": "assert mirror_words('data apple on summer') == 'summer_apple_data'\nassert mirror_words('is stone it signal apple') == 'apple_signal_stone'\nassert mirror_words('is at coffee engine falcon python signal up') == 'signal_python_falcon_engine_coffee'\nassert mirror_words('table music camel') == 'camel_music_table'\nassert mirror_words('table is river it winter coffee on') == 'coffee_winter_river_table'\nassert mirror_words('light summer go of') == 'summer_light'\nassert mirror_words('camel it') == 'camel'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `mirror_words('data apple on summer')` يُرجع `'summer_apple_data'`.\nالجواب:", "qhash": "2bccca567dbf501a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حديقة باب شجرة نور صحراء مطر حاسوب') == 2", "assert count_start('طائرة سيارة') == 0", "assert count_start('حديقة حديقة سيارة طالب نهار قمر') == 2", "assert count_start('برتقال صحراء برمجة فجر') == 0", "assert count_start('ليل رمل حصان علم معلم نهر باب') == 1", "assert count_start('تفاحة باب حاسوب نور حاسوب حاسوب معلم') == 3", "assert count_start('') == 0"], "test_code": "assert count_start('حديقة باب شجرة نور صحراء مطر حاسوب') == 2\nassert count_start('طائرة سيارة') == 0\nassert count_start('حديقة حديقة سيارة طالب نهار قمر') == 2\nassert count_start('برتقال صحراء برمجة فجر') == 0\nassert count_start('ليل رمل حصان علم معلم نهر باب') == 1\nassert count_start('تفاحة باب حاسوب نور حاسوب حاسوب معلم') == 3\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('حديقة باب شجرة نور صحراء مطر حاسوب')` يُرجع `2`.\nالجواب:", "qhash": "0da139307bfd9e95"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(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_of_div([22, 50, 58, -8]) == -8", "assert max_of_div([-32, -24, -40]) == -24", "assert max_of_div([1]) == None", "assert max_of_div([23, 11, -36, -3, 40, 36]) == 40", "assert max_of_div([33, 23, 20, 28, 10]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([22, 50, 58, -8]) == -8\nassert max_of_div([-32, -24, -40]) == -24\nassert max_of_div([1]) == None\nassert max_of_div([23, 11, -36, -3, 40, 36]) == 40\nassert max_of_div([33, 23, 20, 28, 10]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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_of_div(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_of_div(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_of_div(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_of_div([22, 50, 58, -8])` يجب أن تُرجع `-8`.\nالجواب:", "qhash": "ab0dc6664e719f9f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'فيصل': 40, 'باسل': 15, 'رنا': 13, 'وليد': 20}\nmarks['باسل'] += 11\nmarks['عمر'] = 46\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'فيصل': 40, 'باسل': 15, 'رنا': 13, 'وليد': 20}\nmarks['باسل'] += 11\nmarks['عمر'] = 46\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 16])\n```\nالجواب:", "qhash": "d108c54d42527e53", "answer": "5\nعمر\n145\n['فيصل', 'باسل', 'وليد', 'عمر']", "completion": " الناتج:\n```text\n5\nعمر\n145\n['فيصل', 'باسل', 'وليد', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'حصان'\nprint(w.split())\nprint(w.count('س'))\nprint(w.find('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'حصان'\nprint(w.split())\nprint(w.count('س'))\nprint(w.find('س'))\n```\nالجواب:", "qhash": "27704aa62f84820e", "answer": "['حصان']\n0\n-1", "completion": " الناتج:\n```text\n['حصان']\n0\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 17\nfor x in range(2, 6, 3):\n s -= x * 5\nprint(s)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 17\nfor x in range(2, 6, 3):\n s -= x * 5\nprint(s)\nprint(x)\n```\nالجواب:", "qhash": "e75bb84ad784a992", "answer": "-18\n5", "completion": " الناتج:\n```text\n-18\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'كتاب'\nprint(len(text.replace(' ', '')))\nprint(text[::-1])\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'كتاب'\nprint(len(text.replace(' ', '')))\nprint(text[::-1])\nprint(len(text))\n```\nالجواب:", "qhash": "43bd73f26b03d523", "answer": "4\nباتك\n4", "completion": " الناتج:\n```text\n4\nباتك\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -17 <= x <= -7)", "tests": ["assert filter_range([2, -13, -13, -10, -19]) == [-39, -39, -30]", "assert filter_range([5, 5, 23, 58, -3]) == []", "assert filter_range([10, 30, 56, -11, -21, -11, 60, -21, 57]) == [-33, -33]", "assert filter_range([21]) == []", "assert filter_range([-29, 7, 60, 7, 42, 30, -22, 28, 2, 10]) == []", "assert filter_range([2, -25, -29, 30, 33, 16]) == []", "assert filter_range([1, -27, -3]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([2, -13, -13, -10, -19]) == [-39, -39, -30]\nassert filter_range([5, 5, 23, 58, -3]) == []\nassert filter_range([10, 30, 56, -11, -21, -11, 60, -21, 57]) == [-33, -33]\nassert filter_range([21]) == []\nassert filter_range([-29, 7, 60, 7, 42, 30, -22, 28, 2, 10]) == []\nassert filter_range([2, -25, -29, 30, 33, 16]) == []\nassert filter_range([1, -27, -3]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 3 for x in xs if -17 <= x <= -7)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 3 for x in xs if -17 <= x <= -7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -17 ≤ x ≤ -7، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([2, -13, -13, -10, -19])` يُرجع `[-39, -39, -30]`.\nالجواب:", "qhash": "0f52435e0cf7fc60"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 73", "tests": ["assert rec_prod(11) == 4", "assert rec_prod(8) == 7", "assert rec_prod(47) == 33", "assert rec_prod(52) == 69", "assert rec_prod(45) == 68", "assert rec_prod(26) == 37", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 4\nassert rec_prod(8) == 7\nassert rec_prod(47) == 33\nassert rec_prod(52) == 69\nassert rec_prod(45) == 68\nassert rec_prod(26) == 37\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 73", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `4`.\nالجواب:", "qhash": "5f086bfef3c8d5fe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 4 for x in range(-4, 3) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 4 for x in range(-4, 3) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "723e7b082731d9b8", "answer": "[5, 0]\n2 5", "completion": " الناتج:\n```text\n[5, 0]\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 14\nfor x in range(-2, 11, 2):\n acc -= x * 7\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 14\nfor x in range(-2, 11, 2):\n acc -= x * 7\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "195cb5048ef20c1a", "answer": "-182\n10", "completion": " الناتج:\n```text\n-182\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 42", "tests": ["assert sum_digit_pow(15013) == 36", "assert sum_digit_pow(223356) == 15", "assert sum_digit_pow(680980) == 5", "assert sum_digit_pow(576390) == 2", "assert sum_digit_pow(859935) == 27", "assert sum_digit_pow(599201) == 30", "assert sum_digit_pow(654545) == 29", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(15013) == 36\nassert sum_digit_pow(223356) == 15\nassert sum_digit_pow(680980) == 5\nassert sum_digit_pow(576390) == 2\nassert sum_digit_pow(859935) == 27\nassert sum_digit_pow(599201) == 30\nassert sum_digit_pow(654545) == 29\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 42", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 42\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 42.\nمثال: `sum_digit_pow(15013)` يجب أن تُرجع `36`.\nالجواب:", "qhash": "540390a4ba2d0765"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([58, 66, 27, 9, 79, 76, 13, 35]) == 2", "assert only_div([-33, 57, 69, -4, 4, 55, -3, -1, 37, 16]) == 4", "assert only_div([-3, -14, 60, 66, 41, 73, -27, 5, 1, -12, 21]) == 3", "assert only_div([-2]) == 0", "assert only_div([-22, 36, 47, 53, -24, 72, 65, -1, -36, 21]) == 1", "assert only_div([69, -21, 75, 24, -23, -32, 65, 24, 68, 24]) == 3", "assert only_div([]) == 0"], "test_code": "assert only_div([58, 66, 27, 9, 79, 76, 13, 35]) == 2\nassert only_div([-33, 57, 69, -4, 4, 55, -3, -1, 37, 16]) == 4\nassert only_div([-3, -14, 60, 66, 41, 73, -27, 5, 1, -12, 21]) == 3\nassert only_div([-2]) == 0\nassert only_div([-22, 36, 47, 53, -24, 72, 65, -1, -36, 21]) == 1\nassert only_div([69, -21, 75, 24, -23, -32, 65, 24, 68, 24]) == 3\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([58, 66, 27, 9, 79, 76, 13, 35])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d1d6997c239af5ee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(7) == ['1', '2', '3', '4', '5', 'Hi', 'Yo']", "assert fizzbuzz(13) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13']", "assert fizzbuzz(14) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13', 'Yo']", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13', 'Yo', '15']", "assert fizzbuzz(8) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8']"], "test_code": "assert fizzbuzz(7) == ['1', '2', '3', '4', '5', 'Hi', 'Yo']\nassert fizzbuzz(13) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13']\nassert fizzbuzz(14) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13', 'Yo']\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8', '9', '10', '11', 'Hi', '13', 'Yo', '15']\nassert fizzbuzz(8) == ['1', '2', '3', '4', '5', 'Hi', 'Yo', '8']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 7 == 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 % 6 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Hi'، وإن قَبِلها على 7 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(7)` يُرجع `['1', '2', '3', '4', '5', 'Hi', 'Yo']`.\nالجواب:", "qhash": "e30f056e6b50cf6e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'نور طائرة'\nprint(kalima[::-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ن'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'نور طائرة'\nprint(kalima[::-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima.count('ن'))\n```\nالجواب:", "qhash": "6a8c42b67f31bf9e", "answer": "ةرئاط رون\nنور-طائرة\n1", "completion": " الناتج:\n```text\nةرئاط رون\nنور-طائرة\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'camel'\nprint(text[2:5])\nprint(text.split('_'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'camel'\nprint(text[2:5])\nprint(text.split('_'))\nprint(len(text))\n```\nالجواب:", "qhash": "458f72de8a965ad3", "answer": "mel\n['camel']\n5", "completion": " الناتج:\n```text\nmel\n['camel']\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'سعيد': 44, 'هشام': 0, 'حسن': 39, 'علي': 32}\nscores['سعيد'] += 3\nscores['خالد'] = 14\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 21])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'سعيد': 44, 'هشام': 0, 'حسن': 39, 'علي': 32}\nscores['سعيد'] += 3\nscores['خالد'] = 14\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 21])\n```\nالجواب:", "qhash": "f8f4467e85337146", "answer": "5\nسعيد\n132\n['سعيد', 'حسن', 'علي']", "completion": " الناتج:\n```text\n5\nسعيد\n132\n['سعيد', 'حسن', 'علي']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 1) // 2 for x in range(5, 20) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 1) // 2 for x in range(5, 20) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "6d6bf95da35baae7", "answer": "[3, 4, 5, 6, 7, 8, 9]\n7 42", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7, 8, 9]\n7 42\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 1 * x ** 2 + (-5) * x + (6)", "tests": ["assert poly(8) == 30", "assert poly(-4) == 42", "assert poly(-6) == 72", "assert poly(-4) == 42", "assert poly(-7) == 90", "assert poly(13) == 110", "assert poly(-6) == 72", "assert poly(0) == 6"], "test_code": "assert poly(8) == 30\nassert poly(-4) == 42\nassert poly(-6) == 72\nassert poly(-4) == 42\nassert poly(-7) == 90\nassert poly(13) == 110\nassert poly(-6) == 72\nassert poly(0) == 6", "answer": "def poly(x):\n return 1 * x ** 2 + (-5) * x + (6)", "completion": " ```python\ndef poly(x):\n return 1 * x ** 2 + (-5) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 1x² - 5x + 6 عند العدد الصحيح x.\nمثال: `poly(8)` يجب أن تُرجع `30`.\nالجواب:", "qhash": "64ead7cebef9dd06"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([31, 20, -29, 45, -19, 45, 18]) == 45", "assert best_multiple([-25, -5, -20]) == -5", "assert best_multiple([1]) == None", "assert best_multiple([4, -25, 12]) == -25", "assert best_multiple([-38, 16, 21]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([31, 20, -29, 45, -19, 45, 18]) == 45\nassert best_multiple([-25, -5, -20]) == -5\nassert best_multiple([1]) == None\nassert best_multiple([4, -25, 12]) == -25\nassert best_multiple([-38, 16, 21]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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مثال: `best_multiple([31, 20, -29, 45, -19, 45, 18])` يجب أن تُرجع `45`.\nالجواب:", "qhash": "8fca4e4a964cb8b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([23, 20, 19, 10, 10, 8, 11, 6, 12, 18]) == [23, 0, 19, 29, 39, 0, 11, 17, 29, 0]", "assert capped_cumsum([11, -1, 23]) == [11, 10, 33]", "assert capped_cumsum([11, 20, 2, 9, 36, -2, 29, -9, 24]) == [11, 31, 33, 0, 36, 34, 0, -9, 15]", "assert capped_cumsum([]) == []", "assert capped_cumsum([26, -10, 20]) == [26, 16, 36]", "assert capped_cumsum([2, 33, 26, 5, 2]) == [2, 35, 0, 5, 7]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([23, 20, 19, 10, 10, 8, 11, 6, 12, 18]) == [23, 0, 19, 29, 39, 0, 11, 17, 29, 0]\nassert capped_cumsum([11, -1, 23]) == [11, 10, 33]\nassert capped_cumsum([11, 20, 2, 9, 36, -2, 29, -9, 24]) == [11, 31, 33, 0, 36, 34, 0, -9, 15]\nassert capped_cumsum([]) == []\nassert capped_cumsum([26, -10, 20]) == [26, 16, 36]\nassert capped_cumsum([2, 33, 26, 5, 2]) == [2, 35, 0, 5, 7]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 39:\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 > 39:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 39 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([23, 20, 19, 10, 10, 8, 11, 6, 12, 18])` يُرجع `[23, 0, 19, 29, 39, 0, 11, 17, 29, 0]`.\nالجواب:", "qhash": "abf956ddc24336cd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 13)", "tests": ["assert filter_range([-14, 3, 9, 22, -1, 8]) == [-9, -8, -3, 1]", "assert filter_range([60, 36, -16, -11, 15, 22]) == []", "assert filter_range([24, 39, -7, 33, -29, 22, -2, -22]) == [2, 7]", "assert filter_range([-13, 24]) == []", "assert filter_range([18, -19, 34, 19, 8, 35, 51, -2, 22]) == [-8, 2]", "assert filter_range([21, -21, 47]) == []", "assert filter_range([14, -9]) == [9]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-14, 3, 9, 22, -1, 8]) == [-9, -8, -3, 1]\nassert filter_range([60, 36, -16, -11, 15, 22]) == []\nassert filter_range([24, 39, -7, 33, -29, 22, -2, -22]) == [2, 7]\nassert filter_range([-13, 24]) == []\nassert filter_range([18, -19, 34, 19, 8, 35, 51, -2, 22]) == [-8, 2]\nassert filter_range([21, -21, 47]) == []\nassert filter_range([14, -9]) == [9]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 13)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if -9 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -9 ≤ x ≤ 13، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([-14, 3, 9, 22, -1, 8])` يُرجع `[-9, -8, -3, 1]`.\nالجواب:", "qhash": "79e3603592e51f9f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(10))\nprint(f(10, 7))\nprint(f(f(7), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(10))\nprint(f(10, 7))\nprint(f(f(7), 10))\n```\nالجواب:", "qhash": "7400abbc232e1645", "answer": "-15\n-17\n-22", "completion": " الناتج:\n```text\n-15\n-17\n-22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 2 for x in xs if 16 <= x <= 33)", "tests": ["assert between_times([35, 6, 6, 24, 36, 23, 29, 8]) == [46, 48, 58]", "assert between_times([18, -15, 27, 32, -23, 44, -6, 17, 27, 14]) == [34, 36, 54, 54, 64]", "assert between_times([]) == []", "assert between_times([-18, 15, -17, 59, 57, 0, 15, 23]) == [46]", "assert between_times([]) == []", "assert between_times([4, -21, 10, -4, 6, -11, -27, 4, -16, 9]) == []", "assert between_times([]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([35, 6, 6, 24, 36, 23, 29, 8]) == [46, 48, 58]\nassert between_times([18, -15, 27, 32, -23, 44, -6, 17, 27, 14]) == [34, 36, 54, 54, 64]\nassert between_times([]) == []\nassert between_times([-18, 15, -17, 59, 57, 0, 15, 23]) == [46]\nassert between_times([]) == []\nassert between_times([4, -21, 10, -4, 6, -11, -27, 4, -16, 9]) == []\nassert between_times([]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 2 for x in xs if 16 <= x <= 33)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 2 for x in xs if 16 <= x <= 33)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 16 و33 (شاملًا الطرفين) في 2.\nمثال: `between_times([35, 6, 6, 24, 36, 23, 29, 8])` يجب أن تُرجع `[46, 48, 58]`.\nالجواب:", "qhash": "a78a75ad50ea5ab3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 10) // 3 for x in range(-3, 4) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 10) // 3 for x in range(-3, 4) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "580854a1d930c917", "answer": "[2, 3]\n2 5", "completion": " الناتج:\n```text\n[2, 3]\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'رمل'\nprint(len(w))\nprint(w[::-1])\nprint('ل' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'رمل'\nprint(len(w))\nprint(w[::-1])\nprint('ل' in w)\n```\nالجواب:", "qhash": "a0f4886d0e1bc2db", "answer": "3\nلمر\nTrue", "completion": " الناتج:\n```text\n3\nلمر\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']", "assert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23', 'Red', '25']", "assert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15']", "assert fizzbuzz(4) == ['1', '2', '3', '4']", "assert fizzbuzz(0) == []"], "test_code": "assert fizzbuzz(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']\nassert fizzbuzz(25) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23', 'Red', '25']\nassert fizzbuzz(15) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15']\nassert fizzbuzz(4) == ['1', '2', '3', '4']\nassert fizzbuzz(0) == []", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Red'، وعلى 11 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(23)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23']`.\nالجواب:", "qhash": "62e710d249c86ef7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert spin([44, 31, 39, 47, 7, 11, 43]) == [7, 11, 43, 44, 31, 39, 47]", "assert spin([45, 15, 40, 4, 34, 25, 7, -7, 46, 22]) == [15, 40, 4, 34, 25, 7, -7, 46, 22, 45]", "assert spin([27, 50, 43]) == [43, 27, 50]", "assert spin([-4, -5, 8, 41, 39, -5, 15, 30, 15, 41, 47, 40]) == [40, -4, -5, 8, 41, 39, -5, 15, 30, 15, 41, 47]", "assert spin([50, 33, 48, 29, 48, 27, 36, 34, 42, 49, 12]) == [50, 33, 48, 29, 48, 27, 36, 34, 42, 49, 12]", "assert spin([26, 2, 27, 27, 16]) == [2, 27, 27, 16, 26]", "assert spin([]) == []"], "test_code": "assert spin([44, 31, 39, 47, 7, 11, 43]) == [7, 11, 43, 44, 31, 39, 47]\nassert spin([45, 15, 40, 4, 34, 25, 7, -7, 46, 22]) == [15, 40, 4, 34, 25, 7, -7, 46, 22, 45]\nassert spin([27, 50, 43]) == [43, 27, 50]\nassert spin([-4, -5, 8, 41, 39, -5, 15, 30, 15, 41, 47, 40]) == [40, -4, -5, 8, 41, 39, -5, 15, 30, 15, 41, 47]\nassert spin([50, 33, 48, 29, 48, 27, 36, 34, 42, 49, 12]) == [50, 33, 48, 29, 48, 27, 36, 34, 42, 49, 12]\nassert spin([26, 2, 27, 27, 16]) == [2, 27, 27, 16, 26]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(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 spin(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `spin([44, 31, 39, 47, 7, 11, 43])` يُرجع `[7, 11, 43, 44, 31, 39, 47]`.\nالجواب:", "qhash": "0fd4129d0a7173d4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "best_multiple", "reference": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([47, 60, 42, 20, -22]) == 60", "assert best_multiple([-20, -10, -50]) == -10", "assert best_multiple([1, 11]) == None", "assert best_multiple([23, -7, 13, -28, -28]) == None", "assert best_multiple([-2, 2, -2]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([47, 60, 42, 20, -22]) == 60\nassert best_multiple([-20, -10, -50]) == -10\nassert best_multiple([1, 11]) == None\nassert best_multiple([23, -7, 13, -28, -28]) == None\nassert best_multiple([-2, 2, -2]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 == 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 % 10 == 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 % 10 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef best_multiple(arr):\n best = None\n for x in arr:\n if x % 10 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `best_multiple([47, 60, 42, 20, -22])` يجب أن تُرجع `60`.\nالجواب:", "qhash": "5ba5d7fb49f81f55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_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 only_div([66, 33, 43, 49, 8, 33, 40, 24, 67]) == 0", "assert only_div([-13, 62, 12, 53, 52, 58, 17]) == 0", "assert only_div([12, 50, 1, -1, 74, 52, -8, 52, -35]) == 0", "assert only_div([-18, -4, 90]) == 0", "assert only_div([51, 66, 67, 72, 13, -40]) == 0", "assert only_div([-39, 46, 82, -19, 34]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([66, 33, 43, 49, 8, 33, 40, 24, 67]) == 0\nassert only_div([-13, 62, 12, 53, 52, 58, 17]) == 0\nassert only_div([12, 50, 1, -1, 74, 52, -8, 52, -35]) == 0\nassert only_div([-18, -4, 90]) == 0\nassert only_div([51, 66, 67, 72, 13, -40]) == 0\nassert only_div([-39, 46, 82, -19, 34]) == 0\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([66, 33, 43, 49, 8, 33, 40, 24, 67])` يُرجع `0`.\nالجواب:", "qhash": "9bed840eeccb0305"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 5 for x in range(-6, 2) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 5 for x in range(-6, 2) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "0804d871c7f544f5", "answer": "[11, -5]\n2 6", "completion": " الناتج:\n```text\n[11, -5]\n2 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 10) // 4 for x in range(0, 12) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 10) // 4 for x in range(0, 12) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "9beaae60eb247887", "answer": "[2, 3, 4]\n3 9", "completion": " الناتج:\n```text\n[2, 3, 4]\n3 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('we go') == 'rz bj'", "assert rot('of to planet a engine') == 'ja oj kgvizo v zibdiz'", "assert rot('apple stone to planet to !') == 'vkkgz nojiz oj kgvizo oj !'", "assert rot('music a') == 'hpndx v'", "assert rot('it an planet to') == 'do vi kgvizo oj'", "assert rot('planet orange by table a Hello') == 'kgvizo jmvibz wt ovwgz v Hzggj'", "assert rot('') == ''"], "test_code": "assert rot('we go') == 'rz bj'\nassert rot('of to planet a engine') == 'ja oj kgvizo v zibdiz'\nassert rot('apple stone to planet to !') == 'vkkgz nojiz oj kgvizo oj !'\nassert rot('music a') == 'hpndx v'\nassert rot('it an planet to') == 'do vi kgvizo oj'\nassert rot('planet orange by table a Hello') == 'kgvizo jmvibz wt ovwgz v Hzggj'\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 + (-5)) % 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 + (-5)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('we go')` يُرجع `'rz bj'`.\nالجواب:", "qhash": "2423b5e9e3409ba7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=9):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(f(5))\nprint(f(5, -5))\nprint(f(f(-5), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=9):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(f(5))\nprint(f(5, -5))\nprint(f(f(-5), 5))\n```\nالجواب:", "qhash": "0843730837ee6012", "answer": "77\n45\n531", "completion": " الناتج:\n```text\n77\n45\n531\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=2):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(0))\nprint(compute(0, -8))\nprint(compute(compute(-8), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=2):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(compute(0))\nprint(compute(0, -8))\nprint(compute(compute(-8), 0))\n```\nالجواب:", "qhash": "caa644d07a19c188", "answer": "-6\n8\n-14", "completion": " الناتج:\n```text\n-6\n8\n-14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 7 for x in range(-1, 12) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 7 for x in range(-1, 12) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "d2de3451b3b1efc1", "answer": "[-6, 2, 42, 114]\n4 152", "completion": " الناتج:\n```text\n[-6, 2, 42, 114]\n4 152\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [17, 35, 12, 12, -4, 14, 8, 20, -2]\nprint(data[3:9])\nprint(data[::2])\nprint(sum(data[3:9]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [17, 35, 12, 12, -4, 14, 8, 20, -2]\nprint(data[3:9])\nprint(data[::2])\nprint(sum(data[3:9]))\n```\nالجواب:", "qhash": "86bd435561d04447", "answer": "[12, -4, 14, 8, 20, -2]\n[17, 12, -4, 8, -2]\n48", "completion": " الناتج:\n```text\n[12, -4, 14, 8, 20, -2]\n[17, 12, -4, 8, -2]\n48\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 6) == 1)", "tests": ["assert count_coprime(134) == 45", "assert count_coprime(188) == 63", "assert count_coprime(81) == 27", "assert count_coprime(35) == 12", "assert count_coprime(172) == 57", "assert count_coprime(17) == 6", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(134) == 45\nassert count_coprime(188) == 63\nassert count_coprime(81) == 27\nassert count_coprime(35) == 12\nassert count_coprime(172) == 57\nassert count_coprime(17) == 6\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, 6) == 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, 6) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 6، أي أن القاسم المشترك الأكبر لها مع 6 يساوي 1.\nمثال: `count_coprime(134)` يجب أن تُرجع `45`.\nالجواب:", "qhash": "87db98e05c69e68a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('orange table a cloud matrix on') == 'matrix-orange'", "assert invert_words('window river go') == 'window'", "assert invert_words('by vector') == 'vector'", "assert invert_words('on') == ''", "assert invert_words('it engine light') == 'engine'", "assert invert_words('light table window code cloud in') == 'window'", "assert invert_words('camel is music engine apple of') == 'engine'"], "test_code": "assert invert_words('orange table a cloud matrix on') == 'matrix-orange'\nassert invert_words('window river go') == 'window'\nassert invert_words('by vector') == 'vector'\nassert invert_words('on') == ''\nassert invert_words('it engine light') == 'engine'\nassert invert_words('light table window code cloud in') == 'window'\nassert invert_words('camel is music engine apple of') == 'engine'", "answer": "def invert_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `invert_words('orange table a cloud matrix on')` يُرجع `'matrix-orange'`.\nالجواب:", "qhash": "7529a8481972a459"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert turn_list([1, 5, 46, 26, 45]) == [46, 26, 45, 1, 5]", "assert turn_list([13, 13, 25, 4]) == [25, 4, 13, 13]", "assert turn_list([48, 9, 10, 46, 33, 8]) == [10, 46, 33, 8, 48, 9]", "assert turn_list([28, 14, 17, 38, 50, 23, 10, 24, 7, 27]) == [17, 38, 50, 23, 10, 24, 7, 27, 28, 14]", "assert turn_list([-4, 20, 38, -8, 21, 3, 4, -2, 23, 48, 22]) == [38, -8, 21, 3, 4, -2, 23, 48, 22, -4, 20]", "assert turn_list([39, 0, 50, 33, 9]) == [50, 33, 9, 39, 0]", "assert turn_list([]) == []"], "test_code": "assert turn_list([1, 5, 46, 26, 45]) == [46, 26, 45, 1, 5]\nassert turn_list([13, 13, 25, 4]) == [25, 4, 13, 13]\nassert turn_list([48, 9, 10, 46, 33, 8]) == [10, 46, 33, 8, 48, 9]\nassert turn_list([28, 14, 17, 38, 50, 23, 10, 24, 7, 27]) == [17, 38, 50, 23, 10, 24, 7, 27, 28, 14]\nassert turn_list([-4, 20, 38, -8, 21, 3, 4, -2, 23, 48, 22]) == [38, -8, 21, 3, 4, -2, 23, 48, 22, -4, 20]\nassert turn_list([39, 0, 50, 33, 9]) == [50, 33, 9, 39, 0]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return ____\n```\nمثال: `turn_list([1, 5, 46, 26, 45])` يجب أن تُرجع `[46, 26, 45, 1, 5]`.\nالجواب:", "qhash": "5a322017f44258e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -2 + 6 for x in range(-3, 5) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -2 + 6 for x in range(-3, 5) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "bf6076f5496f6f43", "answer": "[10, 6, 2, -2]\n4 16", "completion": " الناتج:\n```text\n[10, 6, 2, -2]\n4 16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 82", "tests": ["assert dig_pow_mod(73194) == 34", "assert dig_pow_mod(418868) == 65", "assert dig_pow_mod(961143) == 78", "assert dig_pow_mod(527062) == 8", "assert dig_pow_mod(514672) == 3", "assert dig_pow_mod(193047) == 34", "assert dig_pow_mod(892694) == 8", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(73194) == 34\nassert dig_pow_mod(418868) == 65\nassert dig_pow_mod(961143) == 78\nassert dig_pow_mod(527062) == 8\nassert dig_pow_mod(514672) == 3\nassert dig_pow_mod(193047) == 34\nassert dig_pow_mod(892694) == 8\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 82", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 82\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 82.\nمثال: `dig_pow_mod(73194)` يجب أن تُرجع `34`.\nالجواب:", "qhash": "7663d54d593e78bc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert sum_div(178) == 2275", "assert sum_div(93) == 637", "assert sum_div(68) == 315", "assert sum_div(114) == 952", "assert sum_div(197) == 2842", "assert sum_div(66) == 315", "assert sum_div(1) == 0"], "test_code": "assert sum_div(178) == 2275\nassert sum_div(93) == 637\nassert sum_div(68) == 315\nassert sum_div(114) == 952\nassert sum_div(197) == 2842\nassert sum_div(66) == 315\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 14.\nمثال: `sum_div(178)` يجب أن تُرجع `2275`.\nالجواب:", "qhash": "a60696ed5fc5fa45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'يوسف': 38, 'باسل': 9, 'خالد': 37}\npoints['يوسف'] += 20\npoints['وليد'] = 10\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'يوسف': 38, 'باسل': 9, 'خالد': 37}\npoints['يوسف'] += 20\npoints['وليد'] = 10\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('باسل', -1))\n```\nالجواب:", "qhash": "0a4971c7cc7ff67e", "answer": "4\nيوسف\n114\n9", "completion": " الناتج:\n```text\n4\nيوسف\n114\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('music apple A1') == 'pxvlf dssoh A1'", "assert rot('apple python it to') == 'dssoh sbwkrq lw wr'", "assert rot('in music table it A1') == 'lq pxvlf wdeoh lw A1'", "assert rot('garden rocket banana winter A1') == 'jdughq urfnhw edqdqd zlqwhu A1'", "assert rot('banana in to of') == 'edqdqd lq wr ri'", "assert rot('is python is garden table') == 'lv sbwkrq lv jdughq wdeoh'", "assert rot('') == ''"], "test_code": "assert rot('music apple A1') == 'pxvlf dssoh A1'\nassert rot('apple python it to') == 'dssoh sbwkrq lw wr'\nassert rot('in music table it A1') == 'lq pxvlf wdeoh lw A1'\nassert rot('garden rocket banana winter A1') == 'jdughq urfnhw edqdqd zlqwhu A1'\nassert rot('banana in to of') == 'edqdqd lq wr ri'\nassert rot('is python is garden table') == 'lv sbwkrq lv jdughq wdeoh'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('music apple A1')` يجب أن تُرجع `'pxvlf dssoh A1'`.\nالجواب:", "qhash": "7f9286516a323ff7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "tests": ["assert pow_total(6) == 11375", "assert pow_total(8) == 43860", "assert pow_total(8) == 43860", "assert pow_total(3) == 490", "assert pow_total(1) == 5", "assert pow_total(1) == 5", "assert pow_total(0) == 0"], "test_code": "assert pow_total(6) == 11375\nassert pow_total(8) == 43860\nassert pow_total(8) == 43860\nassert pow_total(3) == 490\nassert pow_total(1) == 5\nassert pow_total(1) == 5\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 4\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `pow_total(6)` يُرجع `11375`.\nالجواب:", "qhash": "87275a0e0e9e99ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'سلمى': 15, 'رنا': 28, 'ليلى': 35, 'علي': 1}\nd['ليلى'] += 17\nd['أحمد'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 39])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'سلمى': 15, 'رنا': 28, 'ليلى': 35, 'علي': 1}\nd['ليلى'] += 17\nd['أحمد'] = 5\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 39])\n```\nالجواب:", "qhash": "a9948d3ea4b22928", "answer": "5\nليلى\n101\n['ليلى']", "completion": " الناتج:\n```text\n5\nليلى\n101\n['ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('table banana desert music python up') == 'python|music|desert|banana|table'", "assert rev_long_words('table') == 'table'", "assert rev_long_words('python code a') == 'code|python'", "assert rev_long_words('it apple to') == 'apple'", "assert rev_long_words('matrix code music up a cloud') == 'cloud|music|code|matrix'", "assert rev_long_words('code brain rocket') == 'rocket|brain|code'", "assert rev_long_words('python on') == 'python'"], "test_code": "assert rev_long_words('table banana desert music python up') == 'python|music|desert|banana|table'\nassert rev_long_words('table') == 'table'\nassert rev_long_words('python code a') == 'code|python'\nassert rev_long_words('it apple to') == 'apple'\nassert rev_long_words('matrix code music up a cloud') == 'cloud|music|code|matrix'\nassert rev_long_words('code brain rocket') == 'rocket|brain|code'\nassert rev_long_words('python on') == 'python'", "answer": "def rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_long_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `rev_long_words('table banana desert music python up')` يجب أن تُرجع `'python|music|desert|banana|table'`.\nالجواب:", "qhash": "8e103de01a858fc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert reverse_words('to at pixel at stone') == 'stone_at_pixel_at_to'", "assert reverse_words('we') == 'we'", "assert reverse_words('in by window') == 'window_by_in'", "assert reverse_words('matrix a river') == 'river_a_matrix'", "assert reverse_words('stone in signal by at by') == 'by_at_by_signal_in_stone'", "assert reverse_words('light it falcon go light') == 'light_go_falcon_it_light'", "assert reverse_words('cloud window matrix planet') == 'planet_matrix_window_cloud'"], "test_code": "assert reverse_words('to at pixel at stone') == 'stone_at_pixel_at_to'\nassert reverse_words('we') == 'we'\nassert reverse_words('in by window') == 'window_by_in'\nassert reverse_words('matrix a river') == 'river_a_matrix'\nassert reverse_words('stone in signal by at by') == 'by_at_by_signal_in_stone'\nassert reverse_words('light it falcon go light') == 'light_go_falcon_it_light'\nassert reverse_words('cloud window matrix planet') == 'planet_matrix_window_cloud'", "answer": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reverse_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `reverse_words('to at pixel at stone')` يجب أن تُرجع `'stone_at_pixel_at_to'`.\nالجواب:", "qhash": "21ebcfd722551dd5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [31, 11, 35, 38, 26]\nprint(sorted(nums, key=lambda x: (abs(x - -8), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [31, 11, 35, 38, 26]\nprint(sorted(nums, key=lambda x: (abs(x - -8), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "f99afe7d84c01ffc", "answer": "[11, 26, 31, 35, 38]\n[38, 35, 31]", "completion": " الناتج:\n```text\n[11, 26, 31, 35, 38]\n[38, 35, 31]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 23", "tests": ["assert rec_prod(11) == 6", "assert rec_prod(36) == 13", "assert rec_prod(34) == 4", "assert rec_prod(50) == 0", "assert rec_prod(47) == 0", "assert rec_prod(39) == 1", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 6\nassert rec_prod(36) == 13\nassert rec_prod(34) == 4\nassert rec_prod(50) == 0\nassert rec_prod(47) == 0\nassert rec_prod(39) == 1\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 23", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `6`.\nالجواب:", "qhash": "531ae629b1ee7df4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 9\nfor i in range(-5, 2, 1):\n acc += i * 4\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 9\nfor i in range(-5, 2, 1):\n acc += i * 4\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "4535f1f376ab301d", "answer": "-47\n1", "completion": " الناتج:\n```text\n-47\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 4) == 1)", "tests": ["assert count_gcd1(79) == 40", "assert count_gcd1(193) == 97", "assert count_gcd1(167) == 84", "assert count_gcd1(37) == 19", "assert count_gcd1(72) == 36", "assert count_gcd1(112) == 56", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(79) == 40\nassert count_gcd1(193) == 97\nassert count_gcd1(167) == 84\nassert count_gcd1(37) == 19\nassert count_gcd1(72) == 36\nassert count_gcd1(112) == 56\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, 4) == 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, 4) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 4، أي أن القاسم المشترك الأكبر لها مع 4 يساوي 1.\nمثال: `count_gcd1(79)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "e0f8845061b0a1bd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([34, 25, 51, 46, 58, 43, 38, 72, 13, 64, 51, 77]) == 3", "assert only_div([11, 23, 37, -28, 72, 39, 24, 46, 88, 54, 55, 18]) == 5", "assert only_div([-20, 17, 5, -15, 46]) == 0", "assert only_div([9, 45, -38, -17]) == 1", "assert only_div([-18, 76]) == 1", "assert only_div([38]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([34, 25, 51, 46, 58, 43, 38, 72, 13, 64, 51, 77]) == 3\nassert only_div([11, 23, 37, -28, 72, 39, 24, 46, 88, 54, 55, 18]) == 5\nassert only_div([-20, 17, 5, -15, 46]) == 0\nassert only_div([9, 45, -38, -17]) == 1\nassert only_div([-18, 76]) == 1\nassert only_div([38]) == 0\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([34, 25, 51, 46, 58, 43, 38, 72, 13, 64, 51, 77])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "0759e6a29e066460"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 241\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 = 241\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": "005ddd276afbb7e9", "answer": "21", "completion": " الناتج:\n```text\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert series(5) == 605", "assert series(9) == 3135", "assert series(1) == 11", "assert series(4) == 330", "assert series(13) == 9009", "assert series(1) == 11", "assert series(0) == 0"], "test_code": "assert series(5) == 605\nassert series(9) == 3135\nassert series(1) == 11\nassert series(4) == 330\nassert series(13) == 9009\nassert series(1) == 11\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 11 * i ** 2\n return total\n```\nمثال: `series(5)` يجب أن تُرجع `605`.\nالجواب:", "qhash": "8406c25aa80c9b25"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل حصان سلام ميناء') == 0", "assert prefix_hits('كتاب قهوة دفتر مدرسة') == 1", "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('كتاب قهوة دفتر مدرسة') == 1\nassert prefix_hits('كتاب حديقة وردة برتقال كتاب') == 2\nassert prefix_hits('علم تفاحة مدينة') == 0\nassert prefix_hits('فجر سوق نهار') == 0\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": "079d6a8c9c9d45e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [4, 2, 1, 9, 34]\nprint(nums[0:5])\nprint(nums[::-1])\nprint(sum(nums[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [4, 2, 1, 9, 34]\nprint(nums[0:5])\nprint(nums[::-1])\nprint(sum(nums[0:5]))\n```\nالجواب:", "qhash": "5f1eb5dd2b2b31f3", "answer": "[4, 2, 1, 9, 34]\n[34, 9, 1, 2, 4]\n50", "completion": " الناتج:\n```text\n[4, 2, 1, 9, 34]\n[34, 9, 1, 2, 4]\n50\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('شمس مدينة قمر ميناء') == 2", "assert count_prefix('سيارة باب شمس وردة شجرة ماء سماء') == 1", "assert count_prefix('خبز سيارة حديقة مكتبة') == 1", "assert count_prefix('علم مكتبة قهوة مطر تفاحة حصان ماء حاسوب') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('نهار صديق مكتبة حاسوب مدرسة مطر صديق') == 3\nassert count_prefix('سيارة برتقال معلم') == 1\nassert count_prefix('شمس مدينة قمر ميناء') == 2\nassert count_prefix('سيارة باب شمس وردة شجرة ماء سماء') == 1\nassert count_prefix('خبز سيارة حديقة مكتبة') == 1\nassert count_prefix('علم مكتبة قهوة مطر تفاحة حصان ماء حاسوب') == 3\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": "48da91bd1c619489"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('لغة قهوة قمر عمل') == 2", "assert count_hits('برمجة برتقال نور') == 1", "assert count_hits('دفتر سوق') == 1", "assert count_hits('قمر لغة دفتر سيارة عمل سلام') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('كتاب صديق نهر بحر') == 1\nassert count_hits('') == 0\nassert count_hits('نهر مكتبة') == 0\nassert count_hits('لغة قهوة قمر عمل') == 2\nassert count_hits('برمجة برتقال نور') == 1\nassert count_hits('دفتر سوق') == 1\nassert count_hits('قمر لغة دفتر سيارة عمل سلام') == 1\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": "cde4b894532b6ca5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert mirror_words('banana signal orange brain music window desert camel') == 'camel-desert-window-music-brain-orange-signal-banana'", "assert mirror_words('planet camel apple garden coffee signal') == 'signal-coffee-garden-apple-camel-planet'", "assert mirror_words('orange an engine') == 'engine-orange'", "assert mirror_words('coffee a') == 'coffee'", "assert mirror_words('of code at signal coffee summer banana') == 'banana-summer-coffee-signal'", "assert mirror_words('is an rocket rocket data planet engine pixel') == 'pixel-engine-planet-rocket-rocket'", "assert mirror_words('window falcon banana garden by python falcon') == 'falcon-python-garden-banana-falcon-window'"], "test_code": "assert mirror_words('banana signal orange brain music window desert camel') == 'camel-desert-window-music-brain-orange-signal-banana'\nassert mirror_words('planet camel apple garden coffee signal') == 'signal-coffee-garden-apple-camel-planet'\nassert mirror_words('orange an engine') == 'engine-orange'\nassert mirror_words('coffee a') == 'coffee'\nassert mirror_words('of code at signal coffee summer banana') == 'banana-summer-coffee-signal'\nassert mirror_words('is an rocket rocket data planet engine pixel') == 'pixel-engine-planet-rocket-rocket'\nassert mirror_words('window falcon banana garden by python falcon') == 'falcon-python-garden-banana-falcon-window'", "answer": "def mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `mirror_words('banana signal orange brain music window desert camel')` يُرجع `'camel-desert-window-music-brain-orange-signal-banana'`.\nالجواب:", "qhash": "f8f9f5677ffa48de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([31, 15, 8, 47, 41, 42, 27]) == [8, 47, 41, 42, 27, 31, 15]", "assert shift_list([1, 45, -4]) == [45, -4, 1]", "assert shift_list([32, -9, -6, 18, 38, 13, 22]) == [-6, 18, 38, 13, 22, 32, -9]", "assert shift_list([14, 49, -8, 1, 7, 43, -2, 23, 7]) == [23, 7, 14, 49, -8, 1, 7, 43, -2]", "assert shift_list([49, -6, 11, 50, 47, 22, 42]) == [11, 50, 47, 22, 42, 49, -6]", "assert shift_list([7, 27, 21, 5, 10, 45, -7]) == [21, 5, 10, 45, -7, 7, 27]", "assert shift_list([]) == []"], "test_code": "assert shift_list([31, 15, 8, 47, 41, 42, 27]) == [8, 47, 41, 42, 27, 31, 15]\nassert shift_list([1, 45, -4]) == [45, -4, 1]\nassert shift_list([32, -9, -6, 18, 38, 13, 22]) == [-6, 18, 38, 13, 22, 32, -9]\nassert shift_list([14, 49, -8, 1, 7, 43, -2, 23, 7]) == [23, 7, 14, 49, -8, 1, 7, 43, -2]\nassert shift_list([49, -6, 11, 50, 47, 22, 42]) == [11, 50, 47, 22, 42, 49, -6]\nassert shift_list([7, 27, 21, 5, 10, 45, -7]) == [21, 5, 10, 45, -7, 7, 27]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nمثال: `shift_list([31, 15, 8, 47, 41, 42, 27])` يجب أن تُرجع `[8, 47, 41, 42, 27, 31, 15]`.\nالجواب:", "qhash": "d46102bb895d639f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'go'}", "tests": ["assert count_chars('camel summer') == {'g': 0, 'o': 0}", "assert count_chars('code of garden go of') == {'g': 2, 'o': 4}", "assert count_chars('winter code brain matrix') == {'g': 0, 'o': 1}", "assert count_chars('camel to we garden code') == {'g': 1, 'o': 2}", "assert count_chars('falcon garden in window is') == {'g': 1, 'o': 2}", "assert count_chars('apple rocket we river') == {'g': 0, 'o': 1}", "assert count_chars('') == {'g': 0, 'o': 0}"], "test_code": "assert count_chars('camel summer') == {'g': 0, 'o': 0}\nassert count_chars('code of garden go of') == {'g': 2, 'o': 4}\nassert count_chars('winter code brain matrix') == {'g': 0, 'o': 1}\nassert count_chars('camel to we garden code') == {'g': 1, 'o': 2}\nassert count_chars('falcon garden in window is') == {'g': 1, 'o': 2}\nassert count_chars('apple rocket we river') == {'g': 0, 'o': 1}\nassert count_chars('') == {'g': 0, 'o': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'go'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'go'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('camel summer')` يُرجع `{'g': 0, 'o': 0}`.\nالجواب:", "qhash": "d615e89d01c533c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [25, -2, 33, 17, 12, 22, 4]\nprint(nums[1:6])\nprint(nums[::-1])\nprint(min(nums[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [25, -2, 33, 17, 12, 22, 4]\nprint(nums[1:6])\nprint(nums[::-1])\nprint(min(nums[1:6]))\n```\nالجواب:", "qhash": "6dba236e82e5b315", "answer": "[-2, 33, 17, 12, 22]\n[4, 22, 12, 17, 33, -2, 25]\n-2", "completion": " الناتج:\n```text\n[-2, 33, 17, 12, 22]\n[4, 22, 12, 17, 33, -2, 25]\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 49) == 1)", "tests": ["assert coprimes(17) == 15", "assert coprimes(9) == 8", "assert coprimes(95) == 82", "assert coprimes(127) == 109", "assert coprimes(71) == 61", "assert coprimes(4) == 4", "assert coprimes(1) == 1"], "test_code": "assert coprimes(17) == 15\nassert coprimes(9) == 8\nassert coprimes(95) == 82\nassert coprimes(127) == 109\nassert coprimes(71) == 61\nassert coprimes(4) == 4\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, 49) == 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, 49) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 49، أي أن القاسم المشترك الأكبر لها مع 49 يساوي 1.\nمثال: `coprimes(17)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "d5f926108d2a52d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * -3 + -7 for x in range(-5, 0) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * -3 + -7 for x in range(-5, 0) if x % 4 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "f9c10fa3fee9287d", "answer": "[2]\n1 2", "completion": " الناتج:\n```text\n[2]\n1 2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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(25) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tic', '25']", "assert play(7) == ['1', '2', '3', 'Tic', '5', '6', '7']", "assert play(21) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21']", "assert play(18) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac']", "assert play(24) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tic']"], "test_code": "assert play(25) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tic', '25']\nassert play(7) == ['1', '2', '3', 'Tic', '5', '6', '7']\nassert play(21) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21']\nassert play(18) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac']\nassert play(24) == ['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tic']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 % 4 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Tic'، وعلى 9 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(25)` يجب أن تُرجع `['1', '2', '3', 'Tic', '5', '6', '7', 'Tic', 'Tac', '10', '11', 'Tic', '13', '14', '15', 'Tic', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tic', '25']`.\nالجواب:", "qhash": "8f701e30432b0a55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('up') == 'to'", "assert encode('in A1') == 'hm A1'", "assert encode('river') == 'qhudq'", "assert encode('data coffee banana') == 'czsz bneedd azmzmz'", "assert encode('matrix banana pixel') == 'lzsqhw azmzmz ohwdk'", "assert encode('on orange in is by') == 'nm nqzmfd hm hr ax'", "assert encode('') == ''"], "test_code": "assert encode('up') == 'to'\nassert encode('in A1') == 'hm A1'\nassert encode('river') == 'qhudq'\nassert encode('data coffee banana') == 'czsz bneedd azmzmz'\nassert encode('matrix banana pixel') == 'lzsqhw azmzmz ohwdk'\nassert encode('on orange in is by') == 'nm nqzmfd hm hr ax'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('up')` يُرجع `'to'`.\nالجواب:", "qhash": "000e1f2d191cdea1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-12, 11, -16, -5, -9, 0]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-12, 11, -16, -5, -9, 0]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "0aacb49ff64b7188", "answer": "[11, 0, -5, -9, -12, -16]\n[11, 0, -5]", "completion": " الناتج:\n```text\n[11, 0, -5, -9, -12, -16]\n[11, 0, -5]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def go(n):\n if n < 2:\n return n + 1\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 + 1\n return go(n - 1) + go(n - 2)\n\nprint(go(18))\n```\nالجواب:", "qhash": "3bb2d8ba3c21c661", "answer": "6765", "completion": " الناتج:\n```text\n6765\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert tally_div([33, 11, 2, 70, 54, 24, 3, 88, 2, 53, 85]) == 2", "assert tally_div([69, 55, -12, 37, -14, 52, 28, -8, -36]) == 1", "assert tally_div([-3]) == 0", "assert tally_div([67]) == 0", "assert tally_div([-2, 39, -16, 86]) == 0", "assert tally_div([31, 30, -40, 50, 1, 24, 63]) == 2", "assert tally_div([]) == 0"], "test_code": "assert tally_div([33, 11, 2, 70, 54, 24, 3, 88, 2, 53, 85]) == 2\nassert tally_div([69, 55, -12, 37, -14, 52, 28, -8, -36]) == 1\nassert tally_div([-3]) == 0\nassert tally_div([67]) == 0\nassert tally_div([-2, 39, -16, 86]) == 0\nassert tally_div([31, 30, -40, 50, 1, 24, 63]) == 2\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 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 % 5 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 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([33, 11, 2, 70, 54, 24, 3, 88, 2, 53, 85])` يُرجع `2`.\nالجواب:", "qhash": "429aed775b973681"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'garden'\nprint(s[::-1])\nprint(s.count('d'))\nprint(s[-3:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'garden'\nprint(s[::-1])\nprint(s.count('d'))\nprint(s[-3:])\n```\nالجواب:", "qhash": "1e191bd94f945e7e", "answer": "nedrag\n1\nden", "completion": " الناتج:\n```text\nnedrag\n1\nden\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 7 <= x <= 32)", "tests": ["assert filter_range([38, 1, 20, 18, 19, 22]) == [-66, -60, -57, -54]", "assert filter_range([-5, -30, 11, 38, -12]) == [-33]", "assert filter_range([-3, -8, 7, -9, 17, -6, 41, 49]) == [-51, -21]", "assert filter_range([-19, 25, 55, -27, 5]) == [-75]", "assert filter_range([7, 14, 36, -24, 20, 16]) == [-60, -48, -42, -21]", "assert filter_range([43]) == []", "assert filter_range([-9]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([38, 1, 20, 18, 19, 22]) == [-66, -60, -57, -54]\nassert filter_range([-5, -30, 11, 38, -12]) == [-33]\nassert filter_range([-3, -8, 7, -9, 17, -6, 41, 49]) == [-51, -21]\nassert filter_range([-19, 25, 55, -27, 5]) == [-75]\nassert filter_range([7, 14, 36, -24, 20, 16]) == [-60, -48, -42, -21]\nassert filter_range([43]) == []\nassert filter_range([-9]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 7 <= x <= 32)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -3 for x in xs if 7 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 7 ≤ x ≤ 32، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([38, 1, 20, 18, 19, 22])` يُرجع `[-66, -60, -57, -54]`.\nالجواب:", "qhash": "750395437aa8278c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -8 * x ** 2 + (-3) * x + (-6)", "tests": ["assert poly(5) == -221", "assert poly(18) == -2652", "assert poly(13) == -1397", "assert poly(-12) == -1122", "assert poly(16) == -2102", "assert poly(-3) == -69", "assert poly(-13) == -1319", "assert poly(0) == -6"], "test_code": "assert poly(5) == -221\nassert poly(18) == -2652\nassert poly(13) == -1397\nassert poly(-12) == -1122\nassert poly(16) == -2102\nassert poly(-3) == -69\nassert poly(-13) == -1319\nassert poly(0) == -6", "answer": "def poly(x):\n return -8 * x ** 2 + (-3) * x + (-6)", "completion": " ```python\ndef poly(x):\n return -8 * x ** 2 + (-3) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -8x² - 3x - 6 عند العدد الصحيح x.\nمثال: `poly(5)` يجب أن تُرجع `-221`.\nالجواب:", "qhash": "2548d5997b67bbc1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 9 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(16) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16']", "assert play(14) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic']", "assert play(0) == []", "assert play(23) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19', '20', 'Tic', '22', '23']", "assert play(14) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic']"], "test_code": "assert play(16) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16']\nassert play(14) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic']\nassert play(0) == []\nassert play(23) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16', '17', 'Tac', '19', '20', 'Tic', '22', '23']\nassert play(14) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Tic'، وإن قَبِلها على 9 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(16)` يُرجع `['1', '2', '3', '4', '5', '6', 'Tic', '8', 'Tac', '10', '11', '12', '13', 'Tic', '15', '16']`.\nالجواب:", "qhash": "1089c11efcec93f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('حصان حاسوب برمجة') == 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('حاسوب قهوة بيت') == 1\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 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": "eb9618362fb49c47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(9, 1))", "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(9, 1))\n```\nالجواب:", "qhash": "917c29091b792ef4", "answer": "9", "completion": " الناتج:\n```text\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [6, 19, 4, -7, 17, 26, -1, 14, 33]\nprint(items[2:3])\nprint(items[::-1])\nprint(min(items[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [6, 19, 4, -7, 17, 26, -1, 14, 33]\nprint(items[2:3])\nprint(items[::-1])\nprint(min(items[2:3]))\n```\nالجواب:", "qhash": "66217ad387f9c78f", "answer": "[4]\n[33, 14, -1, 26, 17, -7, 4, 19, 6]\n4", "completion": " الناتج:\n```text\n[4]\n[33, 14, -1, 26, 17, -7, 4, 19, 6]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 6 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(18) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz']", "assert fizzbuzz(11) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11']", "assert fizzbuzz(18) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz']", "assert fizzbuzz(11) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11']", "assert fizzbuzz(2) == ['1', '2']"], "test_code": "assert fizzbuzz(18) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz']\nassert fizzbuzz(11) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11']\nassert fizzbuzz(18) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz']\nassert fizzbuzz(11) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11']\nassert fizzbuzz(2) == ['1', '2']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Fizz'\n if i % 6 == 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 % 5 == 0:\n s += 'Fizz'\n if i % 6 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Fizz'، وعلى 6 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(18)` يجب أن تُرجع `['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz']`.\nالجواب:", "qhash": "78681a4708106215"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [31, -16, -1, 29, -18, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [31, -16, -1, 29, -18, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "22ccc7ef8d1aa1bd", "answer": "[29, 31, -1, -9, -16, -18]\n[31, 29, -1]", "completion": " الناتج:\n```text\n[29, 31, -1, -9, -16, -18]\n[31, 29, -1]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'باب'\nprint('ت' in w)\nprint(w[-1])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'باب'\nprint('ت' in w)\nprint(w[-1])\nprint(w.split())\n```\nالجواب:", "qhash": "0d0ed91e412963cb", "answer": "False\nب\n['باب']", "completion": " الناتج:\n```text\nFalse\nب\n['باب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 101", "tests": ["assert mfact(10) == 78", "assert mfact(55) == 10", "assert mfact(8) == 80", "assert mfact(1) == 1", "assert mfact(60) == 3", "assert mfact(11) == 72", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 78\nassert mfact(55) == 10\nassert mfact(8) == 80\nassert mfact(1) == 1\nassert mfact(60) == 3\nassert mfact(11) == 72\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 101", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(10)` يجب أن تُرجع `78`.\nالجواب:", "qhash": "d52d0d8b40473235"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('vector on winter on to up summer') == 'summer_winter_vector'", "assert rev_long_words('at') == ''", "assert rev_long_words('') == ''", "assert rev_long_words('coffee') == 'coffee'", "assert rev_long_words('summer matrix is pixel coffee on a pixel') == 'pixel_coffee_pixel_matrix_summer'", "assert rev_long_words('an') == ''", "assert rev_long_words('river garden matrix to a light signal by') == 'signal_light_matrix_garden_river'"], "test_code": "assert rev_long_words('vector on winter on to up summer') == 'summer_winter_vector'\nassert rev_long_words('at') == ''\nassert rev_long_words('') == ''\nassert rev_long_words('coffee') == 'coffee'\nassert rev_long_words('summer matrix is pixel coffee on a pixel') == 'pixel_coffee_pixel_matrix_summer'\nassert rev_long_words('an') == ''\nassert rev_long_words('river garden matrix to a light signal by') == 'signal_light_matrix_garden_river'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_long_words('vector on winter on to up summer')` يُرجع `'summer_winter_vector'`.\nالجواب:", "qhash": "49b417f891332dbb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "tests": ["assert total_multiples(171) == 3192", "assert total_multiples(263) == 7378", "assert total_multiples(268) == 7644", "assert total_multiples(160) == 2694", "assert total_multiples(268) == 7644", "assert total_multiples(34) == 109", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(171) == 3192\nassert total_multiples(263) == 7378\nassert total_multiples(268) == 7644\nassert total_multiples(160) == 2694\nassert total_multiples(268) == 7644\nassert total_multiples(34) == 109\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 7 أو على 13.\nمثال: `total_multiples(171)` يجب أن تُرجع `3192`.\nالجواب:", "qhash": "8ead80cc086e134b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'طائرة برمجة'\nprint(w.split())\nprint(w[-1])\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'طائرة برمجة'\nprint(w.split())\nprint(w[-1])\nprint(w[0])\n```\nالجواب:", "qhash": "0c265a955de0c72b", "answer": "['طائرة', 'برمجة']\nة\nط", "completion": " الناتج:\n```text\n['طائرة', 'برمجة']\nة\nط\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 9 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(30) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', '24', 'Ping', '26', 'Pong', '28', '29', 'Ping']", "assert label_numbers(12) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12']", "assert label_numbers(10) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping']", "assert label_numbers(16) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14', 'Ping', '16']", "assert label_numbers(14) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14']"], "test_code": "assert label_numbers(30) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', '24', 'Ping', '26', 'Pong', '28', '29', 'Ping']\nassert label_numbers(12) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12']\nassert label_numbers(10) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping']\nassert label_numbers(16) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14', 'Ping', '16']\nassert label_numbers(14) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14']", "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 % 9 == 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 % 9 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Ping'، وإن قَبِلها على 9 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(30)` يُرجع `['1', '2', '3', '4', 'Ping', '6', '7', '8', 'Pong', 'Ping', '11', '12', '13', '14', 'Ping', '16', '17', 'Pong', '19', 'Ping', '21', '22', '23', '24', 'Ping', '26', 'Pong', '28', '29', 'Ping']`.\nالجواب:", "qhash": "a028d6e224f53417"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([90, 52, 25, 1, 88, 69, 47, 69, 24, 76, 15]) == 0", "assert only_div([36, -17, 19, 25, -38, 76, -19, -20, 69, 27, -10]) == 0", "assert only_div([]) == 0", "assert only_div([10, -11, -12, 21, 71, 31]) == 1", "assert only_div([-1, -37, -18, 30, 71]) == 0", "assert only_div([46, -11, -19, 36, 86, 20, 7, 38, -25, 30, 79]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([90, 52, 25, 1, 88, 69, 47, 69, 24, 76, 15]) == 0\nassert only_div([36, -17, 19, 25, -38, 76, -19, -20, 69, 27, -10]) == 0\nassert only_div([]) == 0\nassert only_div([10, -11, -12, 21, 71, 31]) == 1\nassert only_div([-1, -37, -18, 30, 71]) == 0\nassert only_div([46, -11, -19, 36, 86, 20, 7, 38, -25, 30, 79]) == 1\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([90, 52, 25, 1, 88, 69, 47, 69, 24, 76, 15])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "ca660154a1011d3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('planet at Hello') == 'fbqduj qj Hubbe'", "assert shift_letters('is camel !') == 'yi sqcub !'", "assert shift_letters('at') == 'qj'", "assert shift_letters('an') == 'qd'", "assert shift_letters('on') == 'ed'", "assert shift_letters('of') == 'ev'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet at Hello') == 'fbqduj qj Hubbe'\nassert shift_letters('is camel !') == 'yi sqcub !'\nassert shift_letters('at') == 'qj'\nassert shift_letters('an') == 'qd'\nassert shift_letters('on') == 'ed'\nassert shift_letters('of') == 'ev'\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 + (-10)) % 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 + (-10)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 10 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('planet at Hello')` يُرجع `'fbqduj qj Hubbe'`.\nالجواب:", "qhash": "057f5605581db670"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(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 running_sum([7, 47, 4, 42, 53, 17, 17]) == [7, 54, 58, 100, 0, 17, 34]", "assert running_sum([69, 2, 10, 84, 64, 111, 62, 65, 16]) == [69, 71, 81, 0, 64, 0, 62, 0, 16]", "assert running_sum([90, 58, -9, 20, 15, 22, 29]) == [90, 0, -9, 11, 26, 48, 77]", "assert running_sum([93, 55, 41]) == [93, 0, 41]", "assert running_sum([-6, 40]) == [-6, 34]", "assert running_sum([48, 28, 81, 20, 40, 3, 34, 83, 40]) == [48, 76, 0, 20, 60, 63, 97, 0, 40]", "assert running_sum([]) == []"], "test_code": "assert running_sum([7, 47, 4, 42, 53, 17, 17]) == [7, 54, 58, 100, 0, 17, 34]\nassert running_sum([69, 2, 10, 84, 64, 111, 62, 65, 16]) == [69, 71, 81, 0, 64, 0, 62, 0, 16]\nassert running_sum([90, 58, -9, 20, 15, 22, 29]) == [90, 0, -9, 11, 26, 48, 77]\nassert running_sum([93, 55, 41]) == [93, 0, 41]\nassert running_sum([-6, 40]) == [-6, 34]\nassert running_sum([48, 28, 81, 20, 40, 3, 34, 83, 40]) == [48, 76, 0, 20, 60, 63, 97, 0, 40]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 113 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([7, 47, 4, 42, 53, 17, 17])` يُرجع `[7, 54, 58, 100, 0, 17, 34]`.\nالجواب:", "qhash": "01d966f634c94f99"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'برمجة قلم'\nprint('ر' in s)\nprint(s.count('ر'))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'برمجة قلم'\nprint('ر' in s)\nprint(s.count('ر'))\nprint(s[-1])\n```\nالجواب:", "qhash": "78c2417bf8787060", "answer": "True\n1\nم", "completion": " الناتج:\n```text\nTrue\n1\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 10007", "tests": ["assert step_product(9) == 2628", "assert step_product(50) == 3235", "assert step_product(9) == 2628", "assert step_product(20) == 8707", "assert step_product(29) == 8412", "assert step_product(2) == 2", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 2628\nassert step_product(50) == 3235\nassert step_product(9) == 2628\nassert step_product(20) == 8707\nassert step_product(29) == 8412\nassert step_product(2) == 2\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 10007", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(9)` يُرجع `2628`.\nالجواب:", "qhash": "863ac0af1d2a957e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('راشد', 58), ('عمر', 52), ('سلمى', 81), ('ليلى', 59)]\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 = [('راشد', 58), ('عمر', 52), ('سلمى', 81), ('ليلى', 59)]\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": "0e1ca72f12e79774", "answer": "[('عمر', 52), ('راشد', 58), ('ليلى', 59), ('سلمى', 81)]\n['سلمى', 'ليلى']", "completion": " الناتج:\n```text\n[('عمر', 52), ('راشد', 58), ('ليلى', 59), ('سلمى', 81)]\n['سلمى', 'ليلى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 88:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([32, 38, 7, 27, 13, 24, 18, 7, 6]) == [32, 70, 77, 0, 13, 37, 55, 62, 68]", "assert cumulative([38, 50, 69, 15, -10, 30, 68]) == [38, 88, 0, 15, 5, 35, 0]", "assert cumulative([31, 33, 36, 30, 52, 42, 16, 74, 57, 35]) == [31, 64, 0, 30, 82, 0, 16, 0, 57, 0]", "assert cumulative([47]) == [47]", "assert cumulative([74]) == [74]", "assert cumulative([64, 77, 76, -1]) == [64, 0, 76, 75]", "assert cumulative([]) == []"], "test_code": "assert cumulative([32, 38, 7, 27, 13, 24, 18, 7, 6]) == [32, 70, 77, 0, 13, 37, 55, 62, 68]\nassert cumulative([38, 50, 69, 15, -10, 30, 68]) == [38, 88, 0, 15, 5, 35, 0]\nassert cumulative([31, 33, 36, 30, 52, 42, 16, 74, 57, 35]) == [31, 64, 0, 30, 82, 0, 16, 0, 57, 0]\nassert cumulative([47]) == [47]\nassert cumulative([74]) == [74]\nassert cumulative([64, 77, 76, -1]) == [64, 0, 76, 75]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 88:\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 > 88:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 88 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([32, 38, 7, 27, 13, 24, 18, 7, 6])` يجب أن تُرجع `[32, 70, 77, 0, 13, 37, 55, 62, 68]`.\nالجواب:", "qhash": "14c2b511ad7099ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -20 <= x <= 20)", "tests": ["assert pick_between([-2, 7, -29, 11, 14, 21, 21]) == [-28, -22, -14, 4]", "assert pick_between([-22, 49, 53, -28, -27]) == []", "assert pick_between([11]) == [-22]", "assert pick_between([3]) == [-6]", "assert pick_between([-28, 36, -23, -10]) == [20]", "assert pick_between([40, -10, 30]) == [20]", "assert pick_between([-26, -19, -21, 36, 30, 56, 37]) == [38]", "assert pick_between([]) == []"], "test_code": "assert pick_between([-2, 7, -29, 11, 14, 21, 21]) == [-28, -22, -14, 4]\nassert pick_between([-22, 49, 53, -28, -27]) == []\nassert pick_between([11]) == [-22]\nassert pick_between([3]) == [-6]\nassert pick_between([-28, 36, -23, -10]) == [20]\nassert pick_between([40, -10, 30]) == [20]\nassert pick_between([-26, -19, -21, 36, 30, 56, 37]) == [38]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -20 <= x <= 20)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -2 for x in xs if -20 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -20 ≤ x ≤ 20، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-2, 7, -29, 11, 14, 21, 21])` يُرجع `[-28, -22, -14, 4]`.\nالجواب:", "qhash": "fe38a06557f54557"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 34) == 1)", "tests": ["assert count_gcd1(83) == 40", "assert count_gcd1(112) == 53", "assert count_gcd1(11) == 6", "assert count_gcd1(105) == 50", "assert count_gcd1(144) == 68", "assert count_gcd1(25) == 12", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(83) == 40\nassert count_gcd1(112) == 53\nassert count_gcd1(11) == 6\nassert count_gcd1(105) == 50\nassert count_gcd1(144) == 68\nassert count_gcd1(25) == 12\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, 34) == 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, 34) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 34، أي أن القاسم المشترك الأكبر لها مع 34 يساوي 1.\nمثال: `count_gcd1(83)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "d622e3fb845bc8d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)", "tests": ["assert clip_scale([43, 6, 11, 31, 16, 33]) == [-66, -62, -32, -22, -12]", "assert clip_scale([17, 15, 27, 35, -29]) == [-70, -54, -34, -30]", "assert clip_scale([-16, -30, 21, 52, 16, 37, -10]) == [-74, -42, -32]", "assert clip_scale([11]) == [-22]", "assert clip_scale([]) == []", "assert clip_scale([40, 44, -24, 13, -20]) == [-80, -26]", "assert clip_scale([11, 40, 11, 0]) == [-80, -22, -22]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([43, 6, 11, 31, 16, 33]) == [-66, -62, -32, -22, -12]\nassert clip_scale([17, 15, 27, 35, -29]) == [-70, -54, -34, -30]\nassert clip_scale([-16, -30, 21, 52, 16, 37, -10]) == [-74, -42, -32]\nassert clip_scale([11]) == [-22]\nassert clip_scale([]) == []\nassert clip_scale([40, 44, -24, 13, -20]) == [-80, -26]\nassert clip_scale([11, 40, 11, 0]) == [-80, -22, -22]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -2 for x in xs if 5 <= x <= 41)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 5 و41 (شاملًا الطرفين) في -2.\nمثال: `clip_scale([43, 6, 11, 31, 16, 33])` يجب أن تُرجع `[-66, -62, -32, -22, -12]`.\nالجواب:", "qhash": "9db101821ae4cb6b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 48", "tests": ["assert digit_power(78770) == 5", "assert digit_power(993273) == 39", "assert digit_power(55889) == 35", "assert digit_power(658428) == 45", "assert digit_power(167022) == 0", "assert digit_power(918896) == 11", "assert digit_power(639649) == 13", "assert digit_power(0) == 0"], "test_code": "assert digit_power(78770) == 5\nassert digit_power(993273) == 39\nassert digit_power(55889) == 35\nassert digit_power(658428) == 45\nassert digit_power(167022) == 0\nassert digit_power(918896) == 11\nassert digit_power(639649) == 13\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 48", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 48\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 48.\nمثال: `digit_power(78770)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "cef5acce792203bb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'ه' in w)", "tests": ["assert letter_count('ليل جمل دفتر قمر حاسوب جمل قلم') == 0", "assert letter_count('') == 0", "assert letter_count('عمل خبز دفتر نهار تفاحة جبل ماء') == 1", "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('ليل جمل دفتر قمر حاسوب جمل قلم') == 0\nassert letter_count('') == 0\nassert letter_count('عمل خبز دفتر نهار تفاحة جبل ماء') == 1\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('ليل جمل دفتر قمر حاسوب جمل قلم')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "1442c56a6a8c5052"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('طائرة كتاب صحراء علم فجر') == 0", "assert prefix_hits('باب يمل يمل نهار') == 2", "assert prefix_hits('يمل مدينة علم يمل') == 2", "assert prefix_hits('سلام ميناء خبز مدرسة عمل') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حديقة يمل سيارة حديقة جمل') == 1\nassert prefix_hits('يمل صحراء ماء مكتبة يمل ليل عمل') == 2\nassert prefix_hits('طائرة كتاب صحراء علم فجر') == 0\nassert prefix_hits('باب يمل يمل نهار') == 2\nassert prefix_hits('يمل مدينة علم يمل') == 2\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.split():\n if 'ي' in w:\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 'ي' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `prefix_hits('حديقة يمل سيارة حديقة جمل')` يُرجع `1`.\nالجواب:", "qhash": "9d683acc5f5e33ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=4):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(-4))\nprint(calc(-4, 20))\nprint(calc(calc(20), -4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=4):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(-4))\nprint(calc(-4, 20))\nprint(calc(calc(20), -4))\n```\nالجواب:", "qhash": "823e4a4a58ee9c90", "answer": "-20\n-84\n-68", "completion": " الناتج:\n```text\n-20\n-84\n-68\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert sum_div(181) == 3287", "assert sum_div(178) == 3107", "assert sum_div(253) == 6140", "assert sum_div(206) == 3861", "assert sum_div(287) == 8028", "assert sum_div(75) == 555", "assert sum_div(1) == 0"], "test_code": "assert sum_div(181) == 3287\nassert sum_div(178) == 3107\nassert sum_div(253) == 6140\nassert sum_div(206) == 3861\nassert sum_div(287) == 8028\nassert sum_div(75) == 555\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 11.\nمثال: `sum_div(181)` يجب أن تُرجع `3287`.\nالجواب:", "qhash": "657b35e386a540cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سماء برمجة خبز مطر ليل حصان كتاب') == 1", "assert count_prefix('نهار لغة مطر طائرة قهوة') == 0", "assert count_prefix('قلم برمجة قمر مكتبة نهار') == 1", "assert count_prefix('مدينة مدرسة باب') == 1", "assert count_prefix('بحر باب برتقال فجر') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('فجر حاسوب سيارة باب سماء') == 1\nassert count_prefix('سماء برمجة خبز مطر ليل حصان كتاب') == 1\nassert count_prefix('نهار لغة مطر طائرة قهوة') == 0\nassert count_prefix('قلم برمجة قمر مكتبة نهار') == 1\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:\n if w.startswith('ب'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ب»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_prefix(line):\n count = 0\n for w in line:\n if w.startswith('ب'):\n count += 1\n return count\n```\nمثال: `count_prefix('فجر حاسوب سيارة باب سماء')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "9033b8e846620d9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([-19, 10, 34, 2, 35, -8, -11]) == None", "assert biggest_mult([-18, -24, -18]) == -18", "assert biggest_mult([1, 7]) == None", "assert biggest_mult([6, -5, 35, 40, -18]) == 6", "assert biggest_mult([-16, 13, 41, 27]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-19, 10, 34, 2, 35, -8, -11]) == None\nassert biggest_mult([-18, -24, -18]) == -18\nassert biggest_mult([1, 7]) == None\nassert biggest_mult([6, -5, 35, 40, -18]) == 6\nassert biggest_mult([-16, 13, 41, 27]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 6 == 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 % 6 == 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 % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `biggest_mult([-19, 10, 34, 2, 35, -8, -11])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "e42e102151530c40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -11 <= x <= 0)", "tests": ["assert filter_range([-13, -3, -20, -2, -17]) == [-15, -10]", "assert filter_range([]) == []", "assert filter_range([-21, 3, -13, 20, 23]) == []", "assert filter_range([40]) == []", "assert filter_range([36, -21, -17, 50, -16, -29, -2]) == [-10]", "assert filter_range([19, -13, 14]) == []", "assert filter_range([41, -24, 3, 26, 9, -10, 49, 33]) == [-50]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-13, -3, -20, -2, -17]) == [-15, -10]\nassert filter_range([]) == []\nassert filter_range([-21, 3, -13, 20, 23]) == []\nassert filter_range([40]) == []\nassert filter_range([36, -21, -17, 50, -16, -29, -2]) == [-10]\nassert filter_range([19, -13, 14]) == []\nassert filter_range([41, -24, 3, 26, 9, -10, 49, 33]) == [-50]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 5 for x in xs if -11 <= x <= 0)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 5 for x in xs if -11 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -11 و0 (شاملًا الطرفين) في 5.\nمثال: `filter_range([-13, -3, -20, -2, -17])` يجب أن تُرجع `[-15, -10]`.\nالجواب:", "qhash": "517bbd43cc505ff4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 10) == 1)", "tests": ["assert phi_upto(117) == 47", "assert phi_upto(0) == 0", "assert phi_upto(27) == 11", "assert phi_upto(101) == 41", "assert phi_upto(135) == 54", "assert phi_upto(119) == 48", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(117) == 47\nassert phi_upto(0) == 0\nassert phi_upto(27) == 11\nassert phi_upto(101) == 41\nassert phi_upto(135) == 54\nassert phi_upto(119) == 48\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, 10) == 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, 10) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 10، أي أن القاسم المشترك الأكبر لها مع 10 يساوي 1.\nمثال: `phi_upto(117)` يجب أن تُرجع `47`.\nالجواب:", "qhash": "bc7abd61f987a028"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قلم وردة قهوة سلام مطر شجرة فجر') == 1", "assert count_initial('نهار تفاحة جبل جبل جمل شمس') == 0", "assert count_initial('سماء فجر حصان فجر') == 2", "assert count_initial('سفينة وردة سلام رمل') == 0", "assert count_initial('علم فجر فجر معلم') == 2", "assert count_initial('نور رمل فجر بيت') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('قلم وردة قهوة سلام مطر شجرة فجر') == 1\nassert count_initial('نهار تفاحة جبل جبل جمل شمس') == 0\nassert count_initial('سماء فجر حصان فجر') == 2\nassert count_initial('سفينة وردة سلام رمل') == 0\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('قلم وردة قهوة سلام مطر شجرة فجر')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "4381f78851cbbdfe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=2):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(f(-3))\nprint(f(-3, -6))\nprint(f(f(-6), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=2):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(f(-3))\nprint(f(-3, -6))\nprint(f(f(-6), -3))\n```\nالجواب:", "qhash": "27a575751174e716", "answer": "-13\n21\n-1", "completion": " الناتج:\n```text\n-13\n21\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)", "tests": ["assert multiples_total(138) == 1994", "assert multiples_total(63) == 389", "assert multiples_total(236) == 5757", "assert multiples_total(21) == 35", "assert multiples_total(282) == 8087", "assert multiples_total(76) == 591", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(138) == 1994\nassert multiples_total(63) == 389\nassert multiples_total(236) == 5757\nassert multiples_total(21) == 35\nassert multiples_total(282) == 8087\nassert multiples_total(76) == 591\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 % 11 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(138)` يُرجع `1994`.\nالجواب:", "qhash": "ddffdefb681a4e57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert play(19) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19']", "assert play(0) == []", "assert play(4) == ['1', 'Ping', '3', 'Ping']", "assert play(1) == ['1']", "assert play(16) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping']"], "test_code": "assert play(19) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19']\nassert play(0) == []\nassert play(4) == ['1', 'Ping', '3', 'Ping']\nassert play(1) == ['1']\nassert play(16) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Ping'، وعلى 10 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(19)` يجب أن تُرجع `['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', '9', 'PingPong', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'Ping', '19']`.\nالجواب:", "qhash": "1eebedbacce42f07"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "tests": ["assert sum_div(41) == 141", "assert sum_div(133) == 1758", "assert sum_div(132) == 1626", "assert sum_div(134) == 1758", "assert sum_div(291) == 8556", "assert sum_div(50) == 276", "assert sum_div(1) == 0"], "test_code": "assert sum_div(41) == 141\nassert sum_div(133) == 1758\nassert sum_div(132) == 1626\nassert sum_div(134) == 1758\nassert sum_div(291) == 8556\nassert sum_div(50) == 276\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 15.\nمثال: `sum_div(41)` يجب أن تُرجع `141`.\nالجواب:", "qhash": "eeadf7f611722173"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([43, 3, 44, 24, 21, 27, 17]) == [44, 24, 21, 27, 17, 43, 3]", "assert shift_list([-8]) == [-8]", "assert shift_list([-9, 31, 32, 28]) == [31, 32, 28, -9]", "assert shift_list([0, -5, -5, 2, 36, -1, 32, 50, 36]) == [36, 0, -5, -5, 2, 36, -1, 32, 50]", "assert shift_list([26, 41, 14, 36, 8, 38, 11]) == [14, 36, 8, 38, 11, 26, 41]", "assert shift_list([13, 9, 14, 44, -2, 23, 35, 3, -5, 16]) == [9, 14, 44, -2, 23, 35, 3, -5, 16, 13]", "assert shift_list([]) == []"], "test_code": "assert shift_list([43, 3, 44, 24, 21, 27, 17]) == [44, 24, 21, 27, 17, 43, 3]\nassert shift_list([-8]) == [-8]\nassert shift_list([-9, 31, 32, 28]) == [31, 32, 28, -9]\nassert shift_list([0, -5, -5, 2, 36, -1, 32, 50, 36]) == [36, 0, -5, -5, 2, 36, -1, 32, 50]\nassert shift_list([26, 41, 14, 36, 8, 38, 11]) == [14, 36, 8, 38, 11, 26, 41]\nassert shift_list([13, 9, 14, 44, -2, 23, 35, 3, -5, 16]) == [9, 14, 44, -2, 23, 35, 3, -5, 16, 13]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n if not items:\n return []\n k = 19 % 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 = 19 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(items):\n if not items:\n return []\n k = 19 % len(items)\n return ____\n```\nمثال: `shift_list([43, 3, 44, 24, 21, 27, 17])` يجب أن تُرجع `[44, 24, 21, 27, 17, 43, 3]`.\nالجواب:", "qhash": "35124c4dabf7e946"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total", "tests": ["assert power_sum(5) == 165", "assert power_sum(11) == 726", "assert power_sum(4) == 110", "assert power_sum(6) == 231", "assert power_sum(2) == 33", "assert power_sum(1) == 11", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 165\nassert power_sum(11) == 726\nassert power_sum(4) == 110\nassert power_sum(6) == 231\nassert power_sum(2) == 33\nassert power_sum(1) == 11\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 1\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 11 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 11 * i ** 1\n return total\n```\nمثال: `power_sum(5)` يجب أن تُرجع `165`.\nالجواب:", "qhash": "e3e888faefeeb3b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 1 <= x <= 8)", "tests": ["assert pick_between([9, 9, -8, -6, 12, -2, 3, -4, 15]) == [12]", "assert pick_between([44, 17, -20, 47, -12, 3, 32, -1, 60, -22]) == [12]", "assert pick_between([60, -28, 59, 32, 40, -18, -7, 21, -19]) == []", "assert pick_between([]) == []", "assert pick_between([36]) == []", "assert pick_between([-10]) == []", "assert pick_between([37, -4]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([9, 9, -8, -6, 12, -2, 3, -4, 15]) == [12]\nassert pick_between([44, 17, -20, 47, -12, 3, 32, -1, 60, -22]) == [12]\nassert pick_between([60, -28, 59, 32, 40, -18, -7, 21, -19]) == []\nassert pick_between([]) == []\nassert pick_between([36]) == []\nassert pick_between([-10]) == []\nassert pick_between([37, -4]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if 1 <= x <= 8)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if 1 <= x <= 8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 1 ≤ x ≤ 8، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([9, 9, -8, -6, 12, -2, 3, -4, 15])` يُرجع `[12]`.\nالجواب:", "qhash": "6edc62e48bfefd57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([19, 39, 72, 18, 20, 60, 55, 2, 78]) == 2", "assert div_not([34, 17, -4, -12]) == 0", "assert div_not([34]) == 0", "assert div_not([-7, 25, 23, 80, -29, 28, 81]) == 2", "assert div_not([-22, 32]) == 0", "assert div_not([-32, -24, 64, 11, -3, 38, 48, 50, -4, 76]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([19, 39, 72, 18, 20, 60, 55, 2, 78]) == 2\nassert div_not([34, 17, -4, -12]) == 0\nassert div_not([34]) == 0\nassert div_not([-7, 25, 23, 80, -29, 28, 81]) == 2\nassert div_not([-22, 32]) == 0\nassert div_not([-32, -24, 64, 11, -3, 38, 48, 50, -4, 76]) == 1\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([19, 39, 72, 18, 20, 60, 55, 2, 78])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d2026057ecc6407f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 6 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(7) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7']", "assert fizzbuzz(4) == ['1', 'Sun', '3', 'Sun']", "assert fizzbuzz(13) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7', 'Sun', '9', 'Sun', '11', 'SunMoon', '13']", "assert fizzbuzz(3) == ['1', 'Sun', '3']", "assert fizzbuzz(12) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7', 'Sun', '9', 'Sun', '11', 'SunMoon']"], "test_code": "assert fizzbuzz(7) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7']\nassert fizzbuzz(4) == ['1', 'Sun', '3', 'Sun']\nassert fizzbuzz(13) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7', 'Sun', '9', 'Sun', '11', 'SunMoon', '13']\nassert fizzbuzz(3) == ['1', 'Sun', '3']\nassert fizzbuzz(12) == ['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7', 'Sun', '9', 'Sun', '11', 'SunMoon']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 % 2 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Sun'، وإن قَبِلها على 6 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(7)` يُرجع `['1', 'Sun', '3', 'Sun', '5', 'SunMoon', '7']`.\nالجواب:", "qhash": "39d2dc8fa4dacf1f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'brain'\nprint(s.capitalize())\nprint(s.split('_'))\nprint(s.replace('b', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'brain'\nprint(s.capitalize())\nprint(s.split('_'))\nprint(s.replace('b', '#'))\n```\nالجواب:", "qhash": "d591682ff19952d7", "answer": "Brain\n['brain']\n#rain", "completion": " الناتج:\n```text\nBrain\n['brain']\n#rain\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n <= 2:\n return 2\n return 1 * calc(n - 1) + 1\n\nprint(calc(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n <= 2:\n return 2\n return 1 * calc(n - 1) + 1\n\nprint(calc(10))\n```\nالجواب:", "qhash": "6b0ecb8876fc09f9", "answer": "10", "completion": " الناتج:\n```text\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'desert'\nprint(text.upper())\nprint(text.count('s'))\nprint(text.find('s'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'desert'\nprint(text.upper())\nprint(text.count('s'))\nprint(text.find('s'))\n```\nالجواب:", "qhash": "d35a96c20cd259f7", "answer": "DESERT\n1\n2", "completion": " الناتج:\n```text\nDESERT\n1\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('فيصل', 41), ('علي', 16), ('منى', 93), ('نور', 82)]\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), ('علي', 16), ('منى', 93), ('نور', 82)]\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": "5d36cdb666bcc8cb", "answer": "[('علي', 16), ('فيصل', 41), ('نور', 82), ('منى', 93)]\n['منى', 'نور']", "completion": " الناتج:\n```text\n[('علي', 16), ('فيصل', 41), ('نور', 82), ('منى', 93)]\n['منى', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 79", "tests": ["assert fact_mod(4) == 4", "assert fact_mod(3) == 3", "assert fact_mod(12) == 48", "assert fact_mod(48) == 4", "assert fact_mod(53) == 37", "assert fact_mod(22) == 75", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(4) == 4\nassert fact_mod(3) == 3\nassert fact_mod(12) == 48\nassert fact_mod(48) == 4\nassert fact_mod(53) == 37\nassert fact_mod(22) == 75\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 79", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(4)` يُرجع `4`.\nالجواب:", "qhash": "8619e36e312bb796"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26']", "assert fizz(16) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16']", "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']", "assert fizz(4) == ['1', '2', '3', '4']"], "test_code": "assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26']\nassert fizz(16) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16']\nassert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Fizz']\nassert fizz(4) == ['1', '2', '3', '4']", "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 % 10 == 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 % 10 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 10 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(26)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', 'Buzz', '11', '12', '13', 'Fizz', '15', '16', '17', '18', '19', 'Buzz', 'Fizz', '22', '23', '24', '25', '26']`.\nالجواب:", "qhash": "20fcd93f2273c1c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'coru'}", "tests": ["assert freq_of('garden code') == {'c': 1, 'o': 1, 'r': 1, 'u': 0}", "assert freq_of('coffee falcon') == {'c': 2, 'o': 2, 'r': 0, 'u': 0}", "assert freq_of('on on code') == {'c': 1, 'o': 3, 'r': 0, 'u': 0}", "assert freq_of('apple summer banana window stone garden') == {'c': 0, 'o': 2, 'r': 2, 'u': 1}", "assert freq_of('engine code up up apple of') == {'c': 1, 'o': 2, 'r': 0, 'u': 2}", "assert freq_of('light up in banana we') == {'c': 0, 'o': 0, 'r': 0, 'u': 1}", "assert freq_of('') == {'c': 0, 'o': 0, 'r': 0, 'u': 0}"], "test_code": "assert freq_of('garden code') == {'c': 1, 'o': 1, 'r': 1, 'u': 0}\nassert freq_of('coffee falcon') == {'c': 2, 'o': 2, 'r': 0, 'u': 0}\nassert freq_of('on on code') == {'c': 1, 'o': 3, 'r': 0, 'u': 0}\nassert freq_of('apple summer banana window stone garden') == {'c': 0, 'o': 2, 'r': 2, 'u': 1}\nassert freq_of('engine code up up apple of') == {'c': 1, 'o': 2, 'r': 0, 'u': 2}\nassert freq_of('light up in banana we') == {'c': 0, 'o': 0, 'r': 0, 'u': 1}\nassert freq_of('') == {'c': 0, 'o': 0, 'r': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'coru'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'coru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'o'، 'r'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('garden code')` يجب أن تُرجع `{'c': 1, 'o': 1, 'r': 1, 'u': 0}`.\nالجواب:", "qhash": "badd8b61388c8bfe"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 29", "tests": ["assert multi_fact(3) == 3", "assert multi_fact(46) == 14", "assert multi_fact(9) == 17", "assert multi_fact(3) == 3", "assert multi_fact(14) == 24", "assert multi_fact(4) == 4", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(3) == 3\nassert multi_fact(46) == 14\nassert multi_fact(9) == 17\nassert multi_fact(3) == 3\nassert multi_fact(14) == 24\nassert multi_fact(4) == 4\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 29", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(3)` يُرجع `3`.\nالجواب:", "qhash": "7e121c08ade8454c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 298\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 = 298\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": "6e913fe61811bdeb", "answer": "24", "completion": " الناتج:\n```text\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(4))\nprint(compute(4, -10))\nprint(compute(compute(-10), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(compute(4))\nprint(compute(4, -10))\nprint(compute(compute(-10), 4))\n```\nالجواب:", "qhash": "bba60696493ad9c9", "answer": "28\n22\n38", "completion": " الناتج:\n```text\n28\n22\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ن»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('سيارة شمس رمل')` يُرجع `0`.\nالجواب:", "qhash": "c1d0eba5bb5bb189"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «و»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('سوق حصان صديق سوق شمس معلم')` يُرجع `0`.\nالجواب:", "qhash": "145af660899eb3c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'راشد': 15, 'نور': 23, 'خالد': 50, 'عمر': 27, 'باسل': 50}\nscores['خالد'] += 5\nscores['أحمد'] = 21\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 = {'راشد': 15, 'نور': 23, 'خالد': 50, 'عمر': 27, 'باسل': 50}\nscores['خالد'] += 5\nscores['أحمد'] = 21\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": "98a9b89ea3578cb8", "answer": "6\nخالد\n191\n[('راشد', 15), ('أحمد', 21)]", "completion": " الناتج:\n```text\n6\nخالد\n191\n[('راشد', 15), ('أحمد', 21)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 51)", "tests": ["assert pick_between([50, 60, 11, 32, 42]) == [-200, -168, -128]", "assert pick_between([48, 26, 2, 52]) == [-192, -104]", "assert pick_between([-17, 23, -16, -6, 23, 29, 11, 56]) == [-116, -92, -92]", "assert pick_between([43, 11, 30, 55, 7, 19]) == [-172, -120]", "assert pick_between([29, 43, 24, 35]) == [-172, -140, -116, -96]", "assert pick_between([27, 47, -29, 4, -5]) == [-188, -108]", "assert pick_between([56, -15, 41, 56, 4, 33, 17]) == [-164, -132]", "assert pick_between([]) == []"], "test_code": "assert pick_between([50, 60, 11, 32, 42]) == [-200, -168, -128]\nassert pick_between([48, 26, 2, 52]) == [-192, -104]\nassert pick_between([-17, 23, -16, -6, 23, 29, 11, 56]) == [-116, -92, -92]\nassert pick_between([43, 11, 30, 55, 7, 19]) == [-172, -120]\nassert pick_between([29, 43, 24, 35]) == [-172, -140, -116, -96]\nassert pick_between([27, 47, -29, 4, -5]) == [-188, -108]\nassert pick_between([56, -15, 41, 56, 4, 33, 17]) == [-164, -132]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 51)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -4 for x in xs if 20 <= x <= 51)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 51، اضرب كلًا منها في -4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([50, 60, 11, 32, 42])` يُرجع `[-200, -168, -128]`.\nالجواب:", "qhash": "98235c6e999d189b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert shift_list([36, 7, 36, 38]) == [36, 38, 36, 7]", "assert shift_list([-9, -7, 11, 46, 1, 6, -8, 6, 10, 3]) == [-8, 6, 10, 3, -9, -7, 11, 46, 1, 6]", "assert shift_list([42, 35]) == [42, 35]", "assert shift_list([26, 2, 3, 3, 46, 41, 11, 7, 23, 34]) == [11, 7, 23, 34, 26, 2, 3, 3, 46, 41]", "assert shift_list([30, 41, 20, 7, 11, 35]) == [30, 41, 20, 7, 11, 35]", "assert shift_list([1, 47, 26, -9, -8, 24]) == [1, 47, 26, -9, -8, 24]", "assert shift_list([]) == []"], "test_code": "assert shift_list([36, 7, 36, 38]) == [36, 38, 36, 7]\nassert shift_list([-9, -7, 11, 46, 1, 6, -8, 6, 10, 3]) == [-8, 6, 10, 3, -9, -7, 11, 46, 1, 6]\nassert shift_list([42, 35]) == [42, 35]\nassert shift_list([26, 2, 3, 3, 46, 41, 11, 7, 23, 34]) == [11, 7, 23, 34, 26, 2, 3, 3, 46, 41]\nassert shift_list([30, 41, 20, 7, 11, 35]) == [30, 41, 20, 7, 11, 35]\nassert shift_list([1, 47, 26, -9, -8, 24]) == [1, 47, 26, -9, -8, 24]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([36, 7, 36, 38])` يُرجع `[36, 38, 36, 7]`.\nالجواب:", "qhash": "0fd571e2e9cf8502"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'باسل': 12, 'مريم': 39, 'سعيد': 16}\nmarks['مريم'] += 19\nmarks['عمر'] = 18\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 32])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'باسل': 12, 'مريم': 39, 'سعيد': 16}\nmarks['مريم'] += 19\nmarks['عمر'] = 18\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 32])\n```\nالجواب:", "qhash": "4bcc50880d8e42da", "answer": "4\nمريم\n104\n['مريم']", "completion": " الناتج:\n```text\n4\nمريم\n104\n['مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "tests": ["assert weighted_sum(5) == 1350", "assert weighted_sum(15) == 86400", "assert weighted_sum(5) == 1350", "assert weighted_sum(15) == 86400", "assert weighted_sum(11) == 26136", "assert weighted_sum(1) == 6", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 1350\nassert weighted_sum(15) == 86400\nassert weighted_sum(5) == 1350\nassert weighted_sum(15) == 86400\nassert weighted_sum(11) == 26136\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 ** 3\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 6 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `1350`.\nالجواب:", "qhash": "21e542d671257632"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'gst'}", "tests": ["assert letter_stats('music engine it signal up river') == {'g': 2, 's': 2, 't': 1}", "assert letter_stats('an') == {'g': 0, 's': 0, 't': 0}", "assert letter_stats('it winter at river desert coffee') == {'g': 0, 's': 1, 't': 4}", "assert letter_stats('orange window apple brain of of') == {'g': 1, 's': 0, 't': 0}", "assert letter_stats('stone data go apple') == {'g': 1, 's': 1, 't': 2}", "assert letter_stats('cloud orange') == {'g': 1, 's': 0, 't': 0}", "assert letter_stats('') == {'g': 0, 's': 0, 't': 0}"], "test_code": "assert letter_stats('music engine it signal up river') == {'g': 2, 's': 2, 't': 1}\nassert letter_stats('an') == {'g': 0, 's': 0, 't': 0}\nassert letter_stats('it winter at river desert coffee') == {'g': 0, 's': 1, 't': 4}\nassert letter_stats('orange window apple brain of of') == {'g': 1, 's': 0, 't': 0}\nassert letter_stats('stone data go apple') == {'g': 1, 's': 1, 't': 2}\nassert letter_stats('cloud orange') == {'g': 1, 's': 0, 't': 0}\nassert letter_stats('') == {'g': 0, 's': 0, 't': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'gst'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'gst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 's'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('music engine it signal up river')` يجب أن تُرجع `{'g': 2, 's': 2, 't': 1}`.\nالجواب:", "qhash": "b2ce8dc37433489c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 56) == 1)", "tests": ["assert count_gcd1(26) == 11", "assert count_gcd1(92) == 39", "assert count_gcd1(50) == 21", "assert count_gcd1(198) == 85", "assert count_gcd1(77) == 33", "assert count_gcd1(173) == 75", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(26) == 11\nassert count_gcd1(92) == 39\nassert count_gcd1(50) == 21\nassert count_gcd1(198) == 85\nassert count_gcd1(77) == 33\nassert count_gcd1(173) == 75\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, 56) == 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, 56) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 56، أي أن القاسم المشترك الأكبر لها مع 56 يساوي 1.\nمثال: `count_gcd1(26)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "f4449641b6d18087"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "tests": ["assert power_sum(6) == 122010", "assert power_sum(13) == 10020010", "assert power_sum(1) == 10", "assert power_sum(3) == 2760", "assert power_sum(12) == 6307080", "assert power_sum(1) == 10", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 122010\nassert power_sum(13) == 10020010\nassert power_sum(1) == 10\nassert power_sum(3) == 2760\nassert power_sum(12) == 6307080\nassert power_sum(1) == 10\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * 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 = 10 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 10 × 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 = 10 * i ** 5\n return total\n```\nمثال: `power_sum(6)` يجب أن تُرجع `122010`.\nالجواب:", "qhash": "c0290387b72ae9b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79", "tests": ["assert prod_mod(4) == 4", "assert prod_mod(3) == 3", "assert prod_mod(34) == 3", "assert prod_mod(37) == 32", "assert prod_mod(42) == 6", "assert prod_mod(5) == 10", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(4) == 4\nassert prod_mod(3) == 3\nassert prod_mod(34) == 3\nassert prod_mod(37) == 32\nassert prod_mod(42) == 6\nassert prod_mod(5) == 10\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 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": "0b750ec05dc3980b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'cloud_winter'\nprint(text.index('i') + len(text))\nprint(text.split('_'))\nprint(text.count('i'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'cloud_winter'\nprint(text.index('i') + len(text))\nprint(text.split('_'))\nprint(text.count('i'))\n```\nالجواب:", "qhash": "b0ce6587e7dac724", "answer": "19\n['cloud', 'winter']\n1", "completion": " الناتج:\n```text\n19\n['cloud', 'winter']\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'ليل طائرة'\nprint(kalima.replace(' ', '-'))\nprint('ب' in kalima)\nprint(kalima[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'ليل طائرة'\nprint(kalima.replace(' ', '-'))\nprint('ب' in kalima)\nprint(kalima[-1])\n```\nالجواب:", "qhash": "47843633e00470d2", "answer": "ليل-طائرة\nFalse\nة", "completion": " الناتج:\n```text\nليل-طائرة\nFalse\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'شمس حديقة'\nprint(s[-1])\nprint(len(s.replace(' ', '')))\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'شمس حديقة'\nprint(s[-1])\nprint(len(s.replace(' ', '')))\nprint(s.split())\n```\nالجواب:", "qhash": "731419f167d5df60", "answer": "ة\n8\n['شمس', 'حديقة']", "completion": " الناتج:\n```text\nة\n8\n['شمس', 'حديقة']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 1) // 2 for x in range(6, 14) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 1) // 2 for x in range(6, 14) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "cdfac557af4b7727", "answer": "[4, 5, 6, 7]\n4 22", "completion": " الناتج:\n```text\n[4, 5, 6, 7]\n4 22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(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 count_sel([44, 80, 86, 53, 52, 13, 74, 90, 52, 55, 30]) == 2", "assert count_sel([44, -1, -10, 33, 34, 72, 78, 77, 14, -14, -22, 51]) == 1", "assert count_sel([88, -16, 37, -23, 18, -10, 85, 66, 11, 17, -15, 86]) == 2", "assert count_sel([73, -6]) == 0", "assert count_sel([]) == 0", "assert count_sel([19, -22, 90, -13, 46, -4, 66, -39, 82, 12, -5]) == 1", "assert count_sel([]) == 0"], "test_code": "assert count_sel([44, 80, 86, 53, 52, 13, 74, 90, 52, 55, 30]) == 2\nassert count_sel([44, -1, -10, 33, 34, 72, 78, 77, 14, -14, -22, 51]) == 1\nassert count_sel([88, -16, 37, -23, 18, -10, 85, 66, 11, 17, -15, 86]) == 2\nassert count_sel([73, -6]) == 0\nassert count_sel([]) == 0\nassert count_sel([19, -22, 90, -13, 46, -4, 66, -39, 82, 12, -5]) == 1\nassert count_sel([]) == 0", "answer": "def count_sel(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 count_sel(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 count_sel(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_sel([44, 80, 86, 53, 52, 13, 74, 90, 52, 55, 30])` يُرجع `2`.\nالجواب:", "qhash": "785ea063a76bff33"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'عمر': 12, 'باسل': 35, 'مريم': 28, 'زينب': 43, 'ليلى': 47}\npoints['عمر'] += 13\npoints['سلمى'] = 56\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'عمر': 12, 'باسل': 35, 'مريم': 28, 'زينب': 43, 'ليلى': 47}\npoints['عمر'] += 13\npoints['سلمى'] = 56\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('حسن', -1))\n```\nالجواب:", "qhash": "e9bbc7f7b974846a", "answer": "6\nسلمى\n234\n-1", "completion": " الناتج:\n```text\n6\nسلمى\n234\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('ليل حاسوب بحر حديقة نهر دفتر') == 0", "assert count_prefix('قهوة حديقة طالب حاسوب قمر') == 2", "assert count_prefix('ميناء معلم') == 0", "assert count_prefix('حصان ماء قمر ليل نهار') == 1", "assert count_prefix('برتقال جمل قهوة') == 1", "assert count_prefix('سفينة علم') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('ليل حاسوب بحر حديقة نهر دفتر') == 0\nassert count_prefix('قهوة حديقة طالب حاسوب قمر') == 2\nassert count_prefix('ميناء معلم') == 0\nassert count_prefix('حصان ماء قمر ليل نهار') == 1\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('ليل حاسوب بحر حديقة نهر دفتر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "419a30577e2870cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(0))\nprint(h(0, 14))\nprint(h(h(14), 0))", "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(0))\nprint(h(0, 14))\nprint(h(h(14), 0))\n```\nالجواب:", "qhash": "b32420cad53b17d0", "answer": "-2\n-28\n-29", "completion": " الناتج:\n```text\n-2\n-28\n-29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 29", "tests": ["assert rec_prod(10) == 1", "assert rec_prod(15) == 6", "assert rec_prod(57) == 0", "assert rec_prod(53) == 0", "assert rec_prod(37) == 0", "assert rec_prod(16) == 9", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(10) == 1\nassert rec_prod(15) == 6\nassert rec_prod(57) == 0\nassert rec_prod(53) == 0\nassert rec_prod(37) == 0\nassert rec_prod(16) == 9\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 29", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(10)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "f8c9e74fb67ea131"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "tests": ["assert mult_sum(149) == 2126", "assert mult_sum(212) == 4277", "assert mult_sum(41) == 156", "assert mult_sum(26) == 60", "assert mult_sum(79) == 632", "assert mult_sum(120) == 1325", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(149) == 2126\nassert mult_sum(212) == 4277\nassert mult_sum(41) == 156\nassert mult_sum(26) == 60\nassert mult_sum(79) == 632\nassert mult_sum(120) == 1325\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(149)` يُرجع `2126`.\nالجواب:", "qhash": "4e137811d31f37a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'مريم': 19, 'أحمد': 9, 'راشد': 31}\nscores['راشد'] += 18\nscores['هدى'] = 50\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هشام', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'مريم': 19, 'أحمد': 9, 'راشد': 31}\nscores['راشد'] += 18\nscores['هدى'] = 50\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هشام', -1))\n```\nالجواب:", "qhash": "79c7c62484a2a040", "answer": "4\nهدى\n127\n-1", "completion": " الناتج:\n```text\n4\nهدى\n127\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(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 find_max_div([43, -10, -7, 13, 54]) == 54", "assert find_max_div([-6, -8, -10]) == -6", "assert find_max_div([1]) == None", "assert find_max_div([-6, 23, -21, -40, -33, -36, -27, 32, 29]) == 32", "assert find_max_div([-11, 31, 27, -21, 36, -40, 40, 12]) == 40", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([43, -10, -7, 13, 54]) == 54\nassert find_max_div([-6, -8, -10]) == -6\nassert find_max_div([1]) == None\nassert find_max_div([-6, 23, -21, -40, -33, -36, -27, 32, 29]) == 32\nassert find_max_div([-11, 31, 27, -21, 36, -40, 40, 12]) == 40\nassert find_max_div([]) == None", "answer": "def find_max_div(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 find_max_div(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 find_max_div(arr):\n best = 0\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 find_max_div(arr):\n best = 0\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للتوضيح: الاستدعاء `find_max_div([43, -10, -7, 13, 54])` يُرجع `54`.\nالجواب:", "qhash": "45106477880187a0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 5 * x ** 2 + (-7) * x + (1)", "tests": ["assert eval_poly(9) == 343", "assert eval_poly(1) == -1", "assert eval_poly(-13) == 937", "assert eval_poly(7) == 197", "assert eval_poly(3) == 25", "assert eval_poly(-1) == 13", "assert eval_poly(7) == 197", "assert eval_poly(0) == 1"], "test_code": "assert eval_poly(9) == 343\nassert eval_poly(1) == -1\nassert eval_poly(-13) == 937\nassert eval_poly(7) == 197\nassert eval_poly(3) == 25\nassert eval_poly(-1) == 13\nassert eval_poly(7) == 197\nassert eval_poly(0) == 1", "answer": "def eval_poly(x):\n return 5 * x ** 2 + (-7) * x + (1)", "completion": " ```python\ndef eval_poly(x):\n return 5 * x ** 2 + (-7) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 5x² - 7x + 1 عند العدد الصحيح x.\nمثال: `eval_poly(9)` يجب أن تُرجع `343`.\nالجواب:", "qhash": "58cb1be78fe16599"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(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_div([-2, 56, -7, -20, 26, 30, 57, 49, 5]) == 56", "assert max_div([-8, -32, -16]) == -8", "assert max_div([1, 9]) == None", "assert max_div([31, -13, 39, -13, -39, 38, -16]) == -16", "assert max_div([-15, 46, 11, -43, -28, -36, -27]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([-2, 56, -7, -20, 26, 30, 57, 49, 5]) == 56\nassert max_div([-8, -32, -16]) == -8\nassert max_div([1, 9]) == None\nassert max_div([31, -13, 39, -13, -39, 38, -16]) == -16\nassert max_div([-15, 46, 11, -43, -28, -36, -27]) == None\nassert max_div([]) == None", "answer": "def max_div(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_div(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_div(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_div(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_div([-2, 56, -7, -20, 26, 30, 57, 49, 5])` يُرجع `56`.\nالجواب:", "qhash": "cf8738117165791d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cm'}", "tests": ["assert freq_of('data table light cloud of') == {'c': 1, 'm': 0}", "assert freq_of('summer') == {'c': 0, 'm': 2}", "assert freq_of('coffee apple apple') == {'c': 1, 'm': 0}", "assert freq_of('table signal it cloud matrix camel') == {'c': 2, 'm': 2}", "assert freq_of('matrix') == {'c': 0, 'm': 1}", "assert freq_of('python garden data') == {'c': 0, 'm': 0}", "assert freq_of('') == {'c': 0, 'm': 0}"], "test_code": "assert freq_of('data table light cloud of') == {'c': 1, 'm': 0}\nassert freq_of('summer') == {'c': 0, 'm': 2}\nassert freq_of('coffee apple apple') == {'c': 1, 'm': 0}\nassert freq_of('table signal it cloud matrix camel') == {'c': 2, 'm': 2}\nassert freq_of('matrix') == {'c': 0, 'm': 1}\nassert freq_of('python garden data') == {'c': 0, 'm': 0}\nassert freq_of('') == {'c': 0, 'm': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cm'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'm' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('data table light cloud of')` يُرجع `{'c': 1, 'm': 0}`.\nالجواب:", "qhash": "fefe3d564acc2f0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ت'):\n count += 1\n return count", "tests": ["assert starts_count('مكتبة كتاب قلم جبل دفتر تفاحة') == 1", "assert starts_count('مكتبة ليل') == 0", "assert starts_count('شجرة برمجة قلم دفتر صديق وردة') == 0", "assert starts_count('حديقة تفاحة جمل') == 1", "assert starts_count('جمل تفاحة عمل') == 1", "assert starts_count('عربية برمجة نهار لغة تفاحة') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('مكتبة كتاب قلم جبل دفتر تفاحة') == 1\nassert starts_count('مكتبة ليل') == 0\nassert starts_count('شجرة برمجة قلم دفتر صديق وردة') == 0\nassert starts_count('حديقة تفاحة جمل') == 1\nassert starts_count('جمل تفاحة عمل') == 1\nassert starts_count('عربية برمجة نهار لغة تفاحة') == 1\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ت'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(sentence):\n count = 0\n for w in sentence:\n if w.startswith('ت'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('مكتبة كتاب قلم جبل دفتر تفاحة')` يُرجع `1`.\nالجواب:", "qhash": "76c9702bbfa059c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert game(10) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8', 'Foo', '10']", "assert game(15) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8', 'Foo', '10', '11', 'Foo', '13', 'Bar', 'Foo']", "assert game(6) == ['1', '2', 'Foo', '4', '5', 'Foo']", "assert game(8) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8']", "assert game(2) == ['1', '2']"], "test_code": "assert game(10) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8', 'Foo', '10']\nassert game(15) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8', 'Foo', '10', '11', 'Foo', '13', 'Bar', 'Foo']\nassert game(6) == ['1', '2', 'Foo', '4', '5', 'Foo']\nassert game(8) == ['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8']\nassert game(2) == ['1', '2']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Foo'، وإن قَبِلها على 7 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(10)` يُرجع `['1', '2', 'Foo', '4', '5', 'Foo', 'Bar', '8', 'Foo', '10']`.\nالجواب:", "qhash": "8191b3108c7b361b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 9 * x ** 2 + (1) * x + (6)", "tests": ["assert p(4) == 154", "assert p(-12) == 1290", "assert p(8) == 590", "assert p(-13) == 1514", "assert p(-15) == 2016", "assert p(-6) == 324", "assert p(-11) == 1084", "assert p(0) == 6"], "test_code": "assert p(4) == 154\nassert p(-12) == 1290\nassert p(8) == 590\nassert p(-13) == 1514\nassert p(-15) == 2016\nassert p(-6) == 324\nassert p(-11) == 1084\nassert p(0) == 6", "answer": "def p(x):\n return 9 * x ** 2 + (1) * x + (6)", "completion": " ```python\ndef p(x):\n return 9 * x ** 2 + (1) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 9x² + 1x + 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(4)` يُرجع `154`.\nالجواب:", "qhash": "d173d3723936ea2c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\n return total", "tests": ["assert sum_terms(7) == 348096", "assert sum_terms(13) == 12024012", "assert sum_terms(3) == 3312", "assert sum_terms(7) == 348096", "assert sum_terms(8) == 741312", "assert sum_terms(1) == 12", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 348096\nassert sum_terms(13) == 12024012\nassert sum_terms(3) == 3312\nassert sum_terms(7) == 348096\nassert sum_terms(8) == 741312\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 ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 5\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 ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^5 لكل عدد صحيح 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 ** 5\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(7)` يُرجع `348096`.\nالجواب:", "qhash": "3518ad040d8d66b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 71", "tests": ["assert prod_mod(6) == 18", "assert prod_mod(33) == 64", "assert prod_mod(8) == 9", "assert prod_mod(45) == 29", "assert prod_mod(49) == 23", "assert prod_mod(3) == 3", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 18\nassert prod_mod(33) == 64\nassert prod_mod(8) == 9\nassert prod_mod(45) == 29\nassert prod_mod(49) == 23\nassert prod_mod(3) == 3\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 71", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 3)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(6)` يجب أن تُرجع `18`.\nالجواب:", "qhash": "652436774290b893"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "tests": ["assert roll([32, 47, 44, 32, 38]) == [32, 47, 44, 32, 38]", "assert roll([34, 48, 3, 20, 26, 50, 17, 18, -9, 32, 11, 5]) == [50, 17, 18, -9, 32, 11, 5, 34, 48, 3, 20, 26]", "assert roll([-8, 29, 21, -7, 21, 12, 21]) == [12, 21, -8, 29, 21, -7, 21]", "assert roll([17, 14, 31, -8, -6, -3, 3, 36, -4, -9, -8]) == [-3, 3, 36, -4, -9, -8, 17, 14, 31, -8, -6]", "assert roll([10, 42, 30, 19, 31, -8, 21]) == [-8, 21, 10, 42, 30, 19, 31]", "assert roll([7, -1, 9, 13, 40, -3, 10, 10, 34, 22, 31, 16]) == [-3, 10, 10, 34, 22, 31, 16, 7, -1, 9, 13, 40]", "assert roll([]) == []"], "test_code": "assert roll([32, 47, 44, 32, 38]) == [32, 47, 44, 32, 38]\nassert roll([34, 48, 3, 20, 26, 50, 17, 18, -9, 32, 11, 5]) == [50, 17, 18, -9, 32, 11, 5, 34, 48, 3, 20, 26]\nassert roll([-8, 29, 21, -7, 21, 12, 21]) == [12, 21, -8, 29, 21, -7, 21]\nassert roll([17, 14, 31, -8, -6, -3, 3, 36, -4, -9, -8]) == [-3, 3, 36, -4, -9, -8, 17, 14, 31, -8, -6]\nassert roll([10, 42, 30, 19, 31, -8, 21]) == [-8, 21, 10, 42, 30, 19, 31]\nassert roll([7, -1, 9, 13, 40, -3, 10, 10, 34, 22, 31, 16]) == [-3, 10, 10, 34, 22, 31, 16, 7, -1, 9, 13, 40]\nassert roll([]) == []", "answer": "def roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef roll(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 roll(items):\n if not items:\n return []\n k = 5 % len(items)\n return ____\n```\nمثال: `roll([32, 47, 44, 32, 38])` يجب أن تُرجع `[32, 47, 44, 32, 38]`.\nالجواب:", "qhash": "bf61f232334c79a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(215) == 9065", "assert sum_multiples(156) == 4803", "assert sum_multiples(288) == 16353", "assert sum_multiples(43) == 348", "assert sum_multiples(154) == 4649", "assert sum_multiples(154) == 4649", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(215) == 9065\nassert sum_multiples(156) == 4803\nassert sum_multiples(288) == 16353\nassert sum_multiples(43) == 348\nassert sum_multiples(154) == 4649\nassert sum_multiples(154) == 4649\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 % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 11.\nمثال: `sum_multiples(215)` يجب أن تُرجع `9065`.\nالجواب:", "qhash": "f517258b8c4e3783"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(28) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'HiYo', '21', '22', '23', '24', 'Hi', '26', '27', '28']", "assert play(15) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi']", "assert play(8) == ['1', '2', '3', '4', 'Hi', '6', '7', '8']", "assert play(4) == ['1', '2', '3', '4']", "assert play(7) == ['1', '2', '3', '4', 'Hi', '6', '7']"], "test_code": "assert play(28) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'HiYo', '21', '22', '23', '24', 'Hi', '26', '27', '28']\nassert play(15) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi']\nassert play(8) == ['1', '2', '3', '4', 'Hi', '6', '7', '8']\nassert play(4) == ['1', '2', '3', '4']\nassert play(7) == ['1', '2', '3', '4', 'Hi', '6', '7']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Hi'، وإن قَبِلها على 10 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(28)` يُرجع `['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'HiYo', '21', '22', '23', '24', 'Hi', '26', '27', '28']`.\nالجواب:", "qhash": "9738f43d7fb19573"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert only_div([72, 12, 80, 79, 35, 82, 87, 62]) == 0", "assert only_div([76]) == 0", "assert only_div([13, 88, -12, 61, 74, -40, -31, 71, 71]) == 0", "assert only_div([-13, 86, -33, -11, -18, -23, -29, -28, 84]) == 0", "assert only_div([16, -19, -2, 68, 57, -8, 43, 70]) == 0", "assert only_div([-1, -5, -4]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([72, 12, 80, 79, 35, 82, 87, 62]) == 0\nassert only_div([76]) == 0\nassert only_div([13, 88, -12, 61, 74, -40, -31, 71, 71]) == 0\nassert only_div([-13, 86, -33, -11, -18, -23, -29, -28, 84]) == 0\nassert only_div([16, -19, -2, 68, 57, -8, 43, 70]) == 0\nassert only_div([-1, -5, -4]) == 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 % 2 != 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 % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 2، ثم اكتب الدالة كاملة.\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([72, 12, 80, 79, 35, 82, 87, 62])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "c7f8124b7a3f58a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 263\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 = 263\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": "3491e7888e4bce08", "answer": "78", "completion": " الناتج:\n```text\n78\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 20 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([22, 21, 14, 30, 41, 13, 50, 25]) == [41, 13, 50, 25, 22, 21, 14, 30]", "assert roll([31, 45, 32]) == [45, 32, 31]", "assert roll([39]) == [39]", "assert roll([9, 6]) == [9, 6]", "assert roll([39, 29, 19, 29, 2, 21, 50, 26, 30, -3]) == [39, 29, 19, 29, 2, 21, 50, 26, 30, -3]", "assert roll([-4, -4, 44, 9, 45, 1]) == [45, 1, -4, -4, 44, 9]", "assert roll([]) == []"], "test_code": "assert roll([22, 21, 14, 30, 41, 13, 50, 25]) == [41, 13, 50, 25, 22, 21, 14, 30]\nassert roll([31, 45, 32]) == [45, 32, 31]\nassert roll([39]) == [39]\nassert roll([9, 6]) == [9, 6]\nassert roll([39, 29, 19, 29, 2, 21, 50, 26, 30, -3]) == [39, 29, 19, 29, 2, 21, 50, 26, 30, -3]\nassert roll([-4, -4, 44, 9, 45, 1]) == [45, 1, -4, -4, 44, 9]\nassert roll([]) == []", "answer": "def roll(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 roll(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 roll(arr):\n if not arr:\n return []\n k = 20 % len(arr)\n return ____\n```\nمثال: `roll([22, 21, 14, 30, 41, 13, 50, 25])` يجب أن تُرجع `[41, 13, 50, 25, 22, 21, 14, 30]`.\nالجواب:", "qhash": "58cb98522ca65ac5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 79", "tests": ["assert mfact(12) == 68", "assert mfact(3) == 3", "assert mfact(47) == 72", "assert mfact(0) == 1", "assert mfact(4) == 4", "assert mfact(60) == 65", "assert mfact(0) == 1"], "test_code": "assert mfact(12) == 68\nassert mfact(3) == 3\nassert mfact(47) == 72\nassert mfact(0) == 1\nassert mfact(4) == 4\nassert mfact(60) == 65\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 79", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 79\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 79 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(12)` يُرجع `68`.\nالجواب:", "qhash": "ff5f99e8d84d3600"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 63) == 1)", "tests": ["assert rel_prime_count(53) == 31", "assert rel_prime_count(109) == 63", "assert rel_prime_count(150) == 86", "assert rel_prime_count(184) == 105", "assert rel_prime_count(200) == 115", "assert rel_prime_count(6) == 4", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(53) == 31\nassert rel_prime_count(109) == 63\nassert rel_prime_count(150) == 86\nassert rel_prime_count(184) == 105\nassert rel_prime_count(200) == 115\nassert rel_prime_count(6) == 4\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, 63) == 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, 63) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 63) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(53)` يُرجع `31`.\nالجواب:", "qhash": "3eb33a187fc2cc35"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 19", "tests": ["assert rec_prod(3) == 3", "assert rec_prod(60) == 0", "assert rec_prod(45) == 2", "assert rec_prod(59) == 0", "assert rec_prod(15) == 14", "assert rec_prod(49) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 3\nassert rec_prod(60) == 0\nassert rec_prod(45) == 2\nassert rec_prod(59) == 0\nassert rec_prod(15) == 14\nassert rec_prod(49) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 19", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 19\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 19 في كل خطوة (وتُرجع 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": "adb38609e6a622cc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "flip_words", "reference": "def flip_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert flip_words('winter cloud an light desert camel camel data') == 'data/camel/camel/desert/light/cloud/winter'", "assert flip_words('rocket music table engine camel desert data is') == 'data/desert/camel/engine/table/music/rocket'", "assert flip_words('by vector we cloud code winter data') == 'data/winter/code/cloud/vector'", "assert flip_words('is cloud music engine up matrix') == 'matrix/engine/music/cloud'", "assert flip_words('stone') == 'stone'", "assert flip_words('') == ''", "assert flip_words('data light of is banana on is camel') == 'camel/banana/light/data'"], "test_code": "assert flip_words('winter cloud an light desert camel camel data') == 'data/camel/camel/desert/light/cloud/winter'\nassert flip_words('rocket music table engine camel desert data is') == 'data/desert/camel/engine/table/music/rocket'\nassert flip_words('by vector we cloud code winter data') == 'data/winter/code/cloud/vector'\nassert flip_words('is cloud music engine up matrix') == 'matrix/engine/music/cloud'\nassert flip_words('stone') == 'stone'\nassert flip_words('') == ''\nassert flip_words('data light of is banana on is camel') == 'camel/banana/light/data'", "answer": "def flip_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef flip_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `flip_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `flip_words('winter cloud an light desert camel camel data')` يُرجع `'data/camel/camel/desert/light/cloud/winter'`.\nالجواب:", "qhash": "89370a2aa668b313"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-17, 34, 11, 24, 35, 32, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 3), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-17, 34, 11, 24, 35, 32, -10]\nprint(sorted(nums, key=lambda x: (abs(x - 3), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "6dcfb502b106f7be", "answer": "[11, -10, -17, 24, 32, 34, 35]\n[35, 34, 32]", "completion": " الناتج:\n```text\n[11, -10, -17, 24, 32, 34, 35]\n[35, 34, 32]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 4 + 9 for x in range(0, 7) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 4 + 9 for x in range(0, 7) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "19706883411504eb", "answer": "[17, 33]\n2 50", "completion": " الناتج:\n```text\n[17, 33]\n2 50\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 162:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([54, 35, 52, 25, 6]) == [54, 89, 141, 0, 6]", "assert acc_reset([27, 152, 151, 136, 35, 125, 119, 48]) == [27, 0, 151, 0, 35, 160, 0, 48]", "assert acc_reset([41, 139, 120]) == [41, 0, 120]", "assert acc_reset([155, 92, -8]) == [155, 0, -8]", "assert acc_reset([56]) == [56]", "assert acc_reset([45, 48, 118, 111, 19, 41, 147]) == [45, 93, 0, 111, 130, 0, 147]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([54, 35, 52, 25, 6]) == [54, 89, 141, 0, 6]\nassert acc_reset([27, 152, 151, 136, 35, 125, 119, 48]) == [27, 0, 151, 0, 35, 160, 0, 48]\nassert acc_reset([41, 139, 120]) == [41, 0, 120]\nassert acc_reset([155, 92, -8]) == [155, 0, -8]\nassert acc_reset([56]) == [56]\nassert acc_reset([45, 48, 118, 111, 19, 41, 147]) == [45, 93, 0, 111, 130, 0, 147]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 162:\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 > 162:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 162 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([54, 35, 52, 25, 6])` يُرجع `[54, 89, 141, 0, 6]`.\nالجواب:", "qhash": "9d4078e25caba423"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['river', 'coffee', 'falcon', 'orange', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['river', 'coffee', 'falcon', 'orange', 'summer']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "62f2a5606fe4a1a4", "answer": "['river', 'coffee', 'falcon', 'orange', 'summer']\n['summer', 'orange', 'falcon']", "completion": " الناتج:\n```text\n['river', 'coffee', 'falcon', 'orange', 'summer']\n['summer', 'orange', 'falcon']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_join('is light window banana stone go') == 'banana window'", "assert rev_join('a summer a cloud code') == 'summer'", "assert rev_join('desert go light window') == 'window desert'", "assert rev_join('to go engine data') == 'engine'", "assert rev_join('data falcon brain by matrix brain') == 'matrix falcon'", "assert rev_join('river signal winter') == 'winter signal'", "assert rev_join('we coffee camel') == 'coffee'"], "test_code": "assert rev_join('is light window banana stone go') == 'banana window'\nassert rev_join('a summer a cloud code') == 'summer'\nassert rev_join('desert go light window') == 'window desert'\nassert rev_join('to go engine data') == 'engine'\nassert rev_join('data falcon brain by matrix brain') == 'matrix falcon'\nassert rev_join('river signal winter') == 'winter signal'\nassert rev_join('we coffee camel') == 'coffee'", "answer": "def rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_join(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ' '.\nمثال: `rev_join('is light window banana stone go')` يجب أن تُرجع `'banana window'`.\nالجواب:", "qhash": "4a30712a5acf1d57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def compute(x, y=8):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(0))\nprint(compute(0, 1))\nprint(compute(compute(1), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef compute(x, y=8):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(compute(0))\nprint(compute(0, 1))\nprint(compute(compute(1), 0))\n```\nالجواب:", "qhash": "5cbd465fbca7594a", "answer": "56\n7\n399", "completion": " الناتج:\n```text\n56\n7\n399\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -9 * x ** 2 + (-2) * x + (-3)", "tests": ["assert value_at(4) == -155", "assert value_at(14) == -1795", "assert value_at(-3) == -78", "assert value_at(18) == -2955", "assert value_at(-13) == -1498", "assert value_at(2) == -43", "assert value_at(9) == -750", "assert value_at(0) == -3"], "test_code": "assert value_at(4) == -155\nassert value_at(14) == -1795\nassert value_at(-3) == -78\nassert value_at(18) == -2955\nassert value_at(-13) == -1498\nassert value_at(2) == -43\nassert value_at(9) == -750\nassert value_at(0) == -3", "answer": "def value_at(x):\n return -9 * x ** 2 + (-2) * x + (-3)", "completion": " ```python\ndef value_at(x):\n return -9 * x ** 2 + (-2) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -9x² - 2x - 3 عند العدد الصحيح x.\nمثال: `value_at(4)` يجب أن تُرجع `-155`.\nالجواب:", "qhash": "d287e422034b411b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [7, -5, -8, -7, 13, 11, 14]\nprint(items[2:5])\nprint(items[::2])\nprint(min(items[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [7, -5, -8, -7, 13, 11, 14]\nprint(items[2:5])\nprint(items[::2])\nprint(min(items[2:5]))\n```\nالجواب:", "qhash": "89640facdaf1820e", "answer": "[-8, -7, 13]\n[7, -8, 13, 14]\n-8", "completion": " الناتج:\n```text\n[-8, -7, 13]\n[7, -8, 13, 14]\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'منى': 18, 'زينب': 8, 'نور': 37, 'هشام': 18, 'حسن': 14}\nscores['نور'] += 5\nscores['فيصل'] = 11\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 = {'منى': 18, 'زينب': 8, 'نور': 37, 'هشام': 18, 'حسن': 14}\nscores['نور'] += 5\nscores['فيصل'] = 11\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": "29b72d2e65acee3f", "answer": "6\nنور\n111\n[('زينب', 8), ('فيصل', 11)]", "completion": " الناتج:\n```text\n6\nنور\n111\n[('زينب', 8), ('فيصل', 11)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "marks = {'زينب': 5, 'فيصل': 27, 'منى': 4, 'عمر': 9}\nmarks['زينب'] += 3\nmarks['نور'] = 10\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 40])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nmarks = {'زينب': 5, 'فيصل': 27, 'منى': 4, 'عمر': 9}\nmarks['زينب'] += 3\nmarks['نور'] = 10\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 40])\n```\nالجواب:", "qhash": "64ae110f4aa3cef1", "answer": "5\nفيصل\n58\n[]", "completion": " الناتج:\n```text\n5\nفيصل\n58\n[]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([4, 17, 3, 14, 15, 13, 2, 17, 13, 20]) == [4, 21, 24, 0, 15, 28, 30, 0, 13, 0]", "assert acc_reset([]) == []", "assert acc_reset([1]) == [1]", "assert acc_reset([21, 11, 3, -10, 12, 15]) == [21, 0, 3, -7, 5, 20]", "assert acc_reset([22, 4, 16, -5]) == [22, 26, 0, -5]", "assert acc_reset([23, -10, -4, 25, 10, 6, 4, 1]) == [23, 13, 9, 0, 10, 16, 20, 21]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([4, 17, 3, 14, 15, 13, 2, 17, 13, 20]) == [4, 21, 24, 0, 15, 28, 30, 0, 13, 0]\nassert acc_reset([]) == []\nassert acc_reset([1]) == [1]\nassert acc_reset([21, 11, 3, -10, 12, 15]) == [21, 0, 3, -7, 5, 20]\nassert acc_reset([22, 4, 16, -5]) == [22, 26, 0, -5]\nassert acc_reset([23, -10, -4, 25, 10, 6, 4, 1]) == [23, 13, 9, 0, 10, 16, 20, 21]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\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 > 30:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 30 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([4, 17, 3, 14, 15, 13, 2, 17, 13, 20])` يجب أن تُرجع `[4, 21, 24, 0, 15, 28, 30, 0, 13, 0]`.\nالجواب:", "qhash": "d3f5dcf5d8457c8c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total", "tests": ["assert series(6) == 61005", "assert series(4) == 6500", "assert series(0) == 0", "assert series(1) == 5", "assert series(15) == 11496000", "assert series(1) == 5", "assert series(0) == 0"], "test_code": "assert series(6) == 61005\nassert series(4) == 6500\nassert series(0) == 0\nassert series(1) == 5\nassert series(15) == 11496000\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 ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 5\n return total\n```\nمثال: `series(6)` يجب أن تُرجع `61005`.\nالجواب:", "qhash": "03be60529ac8131c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('لغة معلم فجر') == 0", "assert starts_count('نهر ماء نهر مدينة باب باب خبز') == 2", "assert starts_count('علم دفتر حديقة نهار رمل') == 1", "assert starts_count('رمل شمس نهار نهر باب') == 2", "assert starts_count('نور وردة نهار برتقال') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('قهوة ميناء سماء') == 0\nassert starts_count('لغة معلم فجر') == 0\nassert starts_count('نهر ماء نهر مدينة باب باب خبز') == 2\nassert starts_count('علم دفتر حديقة نهار رمل') == 1\nassert starts_count('رمل شمس نهار نهر باب') == 2\nassert starts_count('نور وردة نهار برتقال') == 2\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 'ن' in w:\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 'ن' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('قهوة ميناء سماء')` يُرجع `0`.\nالجواب:", "qhash": "923ec307a42c3f94"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total", "tests": ["assert series(3) == 12", "assert series(6) == 42", "assert series(2) == 6", "assert series(12) == 156", "assert series(8) == 72", "assert series(1) == 2", "assert series(0) == 0"], "test_code": "assert series(3) == 12\nassert series(6) == 42\nassert series(2) == 6\nassert series(12) == 156\nassert series(8) == 72\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 ** 1\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 1\n return total\n```\n", "buggy": "def series(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 series(n):\n total = 0\n for i in range(1, n + 1):\n total = 2 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `series(3)` يُرجع `12`.\nالجواب:", "qhash": "933f19eb481e8066"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "cycle", "reference": "def cycle(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert cycle([11, 21, 7, 22, 40, 25]) == [21, 7, 22, 40, 25, 11]", "assert cycle([35, 33, -2, 49, 36, 33, 43, 31, 32, 45]) == [45, 35, 33, -2, 49, 36, 33, 43, 31, 32]", "assert cycle([-2, 4, 12, 12, -7, 1, 19]) == [12, -7, 1, 19, -2, 4, 12]", "assert cycle([16, 4, 12, 17, 28, 32]) == [4, 12, 17, 28, 32, 16]", "assert cycle([-6, 6, 1]) == [6, 1, -6]", "assert cycle([39, 21, 8, 4, 7, 24]) == [21, 8, 4, 7, 24, 39]", "assert cycle([]) == []"], "test_code": "assert cycle([11, 21, 7, 22, 40, 25]) == [21, 7, 22, 40, 25, 11]\nassert cycle([35, 33, -2, 49, 36, 33, 43, 31, 32, 45]) == [45, 35, 33, -2, 49, 36, 33, 43, 31, 32]\nassert cycle([-2, 4, 12, 12, -7, 1, 19]) == [12, -7, 1, 19, -2, 4, 12]\nassert cycle([16, 4, 12, 17, 28, 32]) == [4, 12, 17, 28, 32, 16]\nassert cycle([-6, 6, 1]) == [6, 1, -6]\nassert cycle([39, 21, 8, 4, 7, 24]) == [21, 8, 4, 7, 24, 39]\nassert cycle([]) == []", "answer": "def cycle(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef cycle(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef cycle(arr):\n if not arr:\n return []\n k = 11 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `cycle([11, 21, 7, 22, 40, 25])` يُرجع `[21, 7, 22, 40, 25, 11]`.\nالجواب:", "qhash": "8ef497f5f9102d40"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 12 == 0)", "tests": ["assert total_multiples(30) == 135", "assert total_multiples(118) == 2340", "assert total_multiples(88) == 1305", "assert total_multiples(204) == 6834", "assert total_multiples(158) == 4134", "assert total_multiples(211) == 7455", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(30) == 135\nassert total_multiples(118) == 2340\nassert total_multiples(88) == 1305\nassert total_multiples(204) == 6834\nassert total_multiples(158) == 4134\nassert total_multiples(211) == 7455\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 % 12 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 12.\nمثال: `total_multiples(30)` يجب أن تُرجع `135`.\nالجواب:", "qhash": "16ecf633ec3dcf6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "tests": ["assert sum_powers(7) == 8624", "assert sum_powers(3) == 396", "assert sum_powers(2) == 99", "assert sum_powers(10) == 33275", "assert sum_powers(5) == 2475", "assert sum_powers(1) == 11", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(7) == 8624\nassert sum_powers(3) == 396\nassert sum_powers(2) == 99\nassert sum_powers(10) == 33275\nassert sum_powers(5) == 2475\nassert sum_powers(1) == 11\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 11 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 3\n return total\n```\nمثال: `sum_powers(7)` يجب أن تُرجع `8624`.\nالجواب:", "qhash": "f3f94b3c639fbde7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=2):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(3))\nprint(calc(3, -5))\nprint(calc(calc(-5), 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=2):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(calc(3))\nprint(calc(3, -5))\nprint(calc(calc(-5), 3))\n```\nالجواب:", "qhash": "6c9afedb7e9fbafd", "answer": "25\n32\n114", "completion": " الناتج:\n```text\n25\n32\n114\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bs'}", "tests": ["assert letter_stats('cloud rocket river') == {'b': 0, 's': 0}", "assert letter_stats('rocket table on in is by') == {'b': 2, 's': 1}", "assert letter_stats('summer in up') == {'b': 0, 's': 1}", "assert letter_stats('in music vector a cloud') == {'b': 0, 's': 1}", "assert letter_stats('music is') == {'b': 0, 's': 2}", "assert letter_stats('camel') == {'b': 0, 's': 0}", "assert letter_stats('') == {'b': 0, 's': 0}"], "test_code": "assert letter_stats('cloud rocket river') == {'b': 0, 's': 0}\nassert letter_stats('rocket table on in is by') == {'b': 2, 's': 1}\nassert letter_stats('summer in up') == {'b': 0, 's': 1}\nassert letter_stats('in music vector a cloud') == {'b': 0, 's': 1}\nassert letter_stats('music is') == {'b': 0, 's': 2}\nassert letter_stats('camel') == {'b': 0, 's': 0}\nassert letter_stats('') == {'b': 0, 's': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bs'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('cloud rocket river')` يجب أن تُرجع `{'b': 0, 's': 0}`.\nالجواب:", "qhash": "44d7bb380076d327"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=8):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(-3))\nprint(calc(-3, -9))\nprint(calc(calc(-9), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=8):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(-3))\nprint(calc(-3, -9))\nprint(calc(calc(-9), -3))\n```\nالجواب:", "qhash": "45659d7237e0e937", "answer": "-35\n21\n-29", "completion": " الناتج:\n```text\n-35\n21\n-29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'سعيد': 13, 'فيصل': 15, 'يوسف': 10, 'حسن': 35}\nmarks['فيصل'] += 13\nmarks['علي'] = 3\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'سعيد': 13, 'فيصل': 15, 'يوسف': 10, 'حسن': 35}\nmarks['فيصل'] += 13\nmarks['علي'] = 3\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('علي', -1))\n```\nالجواب:", "qhash": "7ee4eda119c67178", "answer": "5\nحسن\n89\n3", "completion": " الناتج:\n```text\n5\nحسن\n89\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 63) == 1)", "tests": ["assert phi_upto(20) == 12", "assert phi_upto(46) == 27", "assert phi_upto(137) == 79", "assert phi_upto(31) == 18", "assert phi_upto(199) == 114", "assert phi_upto(152) == 88", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(20) == 12\nassert phi_upto(46) == 27\nassert phi_upto(137) == 79\nassert phi_upto(31) == 18\nassert phi_upto(199) == 114\nassert phi_upto(152) == 88\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, 63) == 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, 63) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 63) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(20)` يُرجع `12`.\nالجواب:", "qhash": "ba8ee0cee6c03930"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [(x + 8) // 2 for x in range(1, 9) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [(x + 8) // 2 for x in range(1, 9) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "70bdf7632d7b80f0", "answer": "[5, 6, 7, 8]\n4 26", "completion": " الناتج:\n```text\n[5, 6, 7, 8]\n4 26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -4 * x ** 2 + (5) * x + (8)", "tests": ["assert p(10) == -342", "assert p(7) == -153", "assert p(-6) == -166", "assert p(-10) == -442", "assert p(-12) == -628", "assert p(-5) == -117", "assert p(-2) == -18", "assert p(0) == 8"], "test_code": "assert p(10) == -342\nassert p(7) == -153\nassert p(-6) == -166\nassert p(-10) == -442\nassert p(-12) == -628\nassert p(-5) == -117\nassert p(-2) == -18\nassert p(0) == 8", "answer": "def p(x):\n return -4 * x ** 2 + (5) * x + (8)", "completion": " ```python\ndef p(x):\n return -4 * x ** 2 + (5) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -4x² + 5x + 8 عند العدد الصحيح x.\nمثال: `p(10)` يجب أن تُرجع `-342`.\nالجواب:", "qhash": "730acc1b0d08cfc4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(623085934))\nprint(rec(rec(623085934)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(623085934))\nprint(rec(rec(623085934)))\n```\nالجواب:", "qhash": "478b57b7048a5c11", "answer": "40\n4", "completion": " الناتج:\n```text\n40\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 1695\ncount = 0\nwhile n > 17:\n n = n // 9\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 1695\ncount = 0\nwhile n > 17:\n n = n // 9\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "b5dfc9681bb5de48", "answer": "2 3", "completion": " الناتج:\n```text\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=4):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(f(19))\nprint(f(19, -1))\nprint(f(f(-1), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=4):\n if x > y:\n return x * -3 - y\n return x + y * -3\n\nprint(f(19))\nprint(f(19, -1))\nprint(f(f(-1), 19))\n```\nالجواب:", "qhash": "8fe2f33dc2f767a3", "answer": "-61\n-56\n-70", "completion": " الناتج:\n```text\n-61\n-56\n-70\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 9 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(10) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping']", "assert game(7) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7']", "assert game(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong']", "assert game(7) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7']", "assert game(25) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong', '19', 'Ping', '21', 'Ping', '23', 'Ping', '25']"], "test_code": "assert game(10) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping']\nassert game(7) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7']\nassert game(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong']\nassert game(7) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7']\nassert game(25) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong', '19', 'Ping', '21', 'Ping', '23', 'Ping', '25']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Ping'، وعلى 9 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(10)` يجب أن تُرجع `['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping']`.\nالجواب:", "qhash": "ef2d3cfe3930dc09"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [15, 21, 1, 22, 25, 30]\nprint(data[0:4])\nprint(data[::-2])\nprint(min(data[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [15, 21, 1, 22, 25, 30]\nprint(data[0:4])\nprint(data[::-2])\nprint(min(data[0:4]))\n```\nالجواب:", "qhash": "7d4f1057669c707a", "answer": "[15, 21, 1, 22]\n[30, 22, 21]\n1", "completion": " الناتج:\n```text\n[15, 21, 1, 22]\n[30, 22, 21]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-9, 40, 24, 7, 6, 38, 22]\nprint(a[3:6])\nprint(a[::-1])\nprint(min(a[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-9, 40, 24, 7, 6, 38, 22]\nprint(a[3:6])\nprint(a[::-1])\nprint(min(a[3:6]))\n```\nالجواب:", "qhash": "30625b13a1b31b04", "answer": "[7, 6, 38]\n[22, 38, 6, 7, 24, 40, -9]\n6", "completion": " الناتج:\n```text\n[7, 6, 38]\n[22, 38, 6, 7, 24, 40, -9]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if -6 <= x <= 12)", "tests": ["assert between_times([-3, 15, 0, 5]) == [-12, 0, 20]", "assert between_times([-6, 54, 31]) == [-24]", "assert between_times([56, -29, 60, -19, 29, 38, 11, -7, 25, -18]) == [44]", "assert between_times([]) == []", "assert between_times([-11, 35, 32, 14, 0, -20]) == [0]", "assert between_times([13, 46]) == []", "assert between_times([-24, 48, 18, 60, 51, -11, 56]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([-3, 15, 0, 5]) == [-12, 0, 20]\nassert between_times([-6, 54, 31]) == [-24]\nassert between_times([56, -29, 60, -19, 29, 38, 11, -7, 25, -18]) == [44]\nassert between_times([]) == []\nassert between_times([-11, 35, 32, 14, 0, -20]) == [0]\nassert between_times([13, 46]) == []\nassert between_times([-24, 48, 18, 60, 51, -11, 56]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if -6 <= x <= 12)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if -6 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و12 (شاملًا الطرفين) في 4.\nمثال: `between_times([-3, 15, 0, 5])` يجب أن تُرجع `[-12, 0, 20]`.\nالجواب:", "qhash": "d06e52facc3cbb47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([5, 18, 30, 3, 26]) == 30", "assert biggest_mult([-5, -5, -25]) == -5", "assert biggest_mult([1, 6]) == None", "assert biggest_mult([-24, -9, 6, -28]) == None", "assert biggest_mult([9, 40, -33, 50, -5, 42, -50, -39, 19]) == 50", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([5, 18, 30, 3, 26]) == 30\nassert biggest_mult([-5, -5, -25]) == -5\nassert biggest_mult([1, 6]) == None\nassert biggest_mult([-24, -9, 6, -28]) == None\nassert biggest_mult([9, 40, -33, 50, -5, 42, -50, -39, 19]) == 50\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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مثال: `biggest_mult([5, 18, 30, 3, 26])` يجب أن تُرجع `30`.\nالجواب:", "qhash": "7c81e544f81a25bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 13\nfor j in range(-1, 14, 1):\n result += j * 7\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 13\nfor j in range(-1, 14, 1):\n result += j * 7\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "923320f64f35baa9", "answer": "643\n13", "completion": " الناتج:\n```text\n643\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('طالب ليل قمر صديق') == 1", "assert words_starting('شجرة نور قمر خبز قلم جبل نهار') == 2", "assert words_starting('جبل فجر مكتبة كتاب معلم قمر نور') == 1", "assert words_starting('نور صحراء جمل لغة') == 0", "assert words_starting('طائرة ليل خبز') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('شجرة فجر سلام كتاب قهوة سيارة سماء قهوة') == 2\nassert words_starting('طالب ليل قمر صديق') == 1\nassert words_starting('شجرة نور قمر خبز قلم جبل نهار') == 2\nassert words_starting('جبل فجر مكتبة كتاب معلم قمر نور') == 1\nassert words_starting('نور صحراء جمل لغة') == 0\nassert words_starting('طائرة ليل خبز') == 0\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": "e3fb277d168104e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 9\nfor x in range(5, 23, 3):\n total -= x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 9\nfor x in range(5, 23, 3):\n total -= x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "bc26e96bb4d56890", "answer": "-666\n20", "completion": " الناتج:\n```text\n-666\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('at a up to on') == ''", "assert words_reversed('banana matrix in it stone apple is up') == 'apple,stone,matrix,banana'", "assert words_reversed('winter') == 'winter'", "assert words_reversed('garden vector') == 'vector,garden'", "assert words_reversed('we data garden on banana a an to') == 'banana,garden,data'", "assert words_reversed('is') == ''", "assert words_reversed('camel summer music go coffee') == 'coffee,music,summer,camel'"], "test_code": "assert words_reversed('at a up to on') == ''\nassert words_reversed('banana matrix in it stone apple is up') == 'apple,stone,matrix,banana'\nassert words_reversed('winter') == 'winter'\nassert words_reversed('garden vector') == 'vector,garden'\nassert words_reversed('we data garden on banana a an to') == 'banana,garden,data'\nassert words_reversed('is') == ''\nassert words_reversed('camel summer music go coffee') == 'coffee,music,summer,camel'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `words_reversed('at a up to on')` يُرجع `''`.\nالجواب:", "qhash": "29ae7169c079dc74"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert words_reversed('code rocket camel it by summer at river') == 'river/summer/camel/rocket/code'", "assert words_reversed('river brain at camel') == 'camel/brain/river'", "assert words_reversed('a summer pixel river data music coffee') == 'coffee/music/data/river/pixel/summer'", "assert words_reversed('table table') == 'table/table'", "assert words_reversed('on in python up on') == 'python'", "assert words_reversed('coffee signal rocket coffee python') == 'python/coffee/rocket/signal/coffee'", "assert words_reversed('vector python engine stone up cloud') == 'cloud/stone/engine/python/vector'"], "test_code": "assert words_reversed('code rocket camel it by summer at river') == 'river/summer/camel/rocket/code'\nassert words_reversed('river brain at camel') == 'camel/brain/river'\nassert words_reversed('a summer pixel river data music coffee') == 'coffee/music/data/river/pixel/summer'\nassert words_reversed('table table') == 'table/table'\nassert words_reversed('on in python up on') == 'python'\nassert words_reversed('coffee signal rocket coffee python') == 'python/coffee/rocket/signal/coffee'\nassert words_reversed('vector python engine stone up cloud') == 'cloud/stone/engine/python/vector'", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('code rocket camel it by summer at river')` يُرجع `'river/summer/camel/rocket/code'`.\nالجواب:", "qhash": "e67dcf8ef5dfa7e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 34)", "tests": ["assert clip_scale([35, 42, 42, 12, 44]) == []", "assert clip_scale([]) == []", "assert clip_scale([2, 11, -19, 28, 5, 15, 22, -11, 2]) == [44, 56]", "assert clip_scale([28, 58, -7, 0, -12, 21, -27, 40, -17]) == [42, 56]", "assert clip_scale([26, 7, 10]) == [52]", "assert clip_scale([30, 46, 32, 23, 14]) == [46, 60, 64]", "assert clip_scale([-25, -18, 58, -19]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([35, 42, 42, 12, 44]) == []\nassert clip_scale([]) == []\nassert clip_scale([2, 11, -19, 28, 5, 15, 22, -11, 2]) == [44, 56]\nassert clip_scale([28, 58, -7, 0, -12, 21, -27, 40, -17]) == [42, 56]\nassert clip_scale([26, 7, 10]) == [52]\nassert clip_scale([30, 46, 32, 23, 14]) == [46, 60, 64]\nassert clip_scale([-25, -18, 58, -19]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 34)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 34)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 20 و34 (شاملًا الطرفين) في 2.\nمثال: `clip_scale([35, 42, 42, 12, 44])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "83e0f2d4c9b6b4e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 40)", "tests": ["assert in_range_scaled([22, 24, 10, 39, -1]) == [-78, -48, -44, -20]", "assert in_range_scaled([59, 11, 23, -1]) == [-46, -22]", "assert in_range_scaled([48, -13, -7]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([13, -19, 41, 11, 25, -11]) == [-50, -26, -22]", "assert in_range_scaled([-28, 17, -14]) == [-34]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([22, 24, 10, 39, -1]) == [-78, -48, -44, -20]\nassert in_range_scaled([59, 11, 23, -1]) == [-46, -22]\nassert in_range_scaled([48, -13, -7]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([13, -19, 41, 11, 25, -11]) == [-50, -26, -22]\nassert in_range_scaled([-28, 17, -14]) == [-34]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 40)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 4 و40 (شاملًا الطرفين) في -2.\nمثال: `in_range_scaled([22, 24, 10, 39, -1])` يجب أن تُرجع `[-78, -48, -44, -20]`.\nالجواب:", "qhash": "8ef068631c468115"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('stone river brain matrix of') == 'zavul ypcly iyhpu thaype vm'", "assert encode('we') == 'dl'", "assert encode('apple on brain !') == 'hwwsl vu iyhpu !'", "assert encode('falcon summer code Hello') == 'mhsjvu zbttly jvkl Hlssv'", "assert encode('winter it river window') == 'dpualy pa ypcly dpukvd'", "assert encode('up apple code !') == 'bw hwwsl jvkl !'", "assert encode('') == ''"], "test_code": "assert encode('stone river brain matrix of') == 'zavul ypcly iyhpu thaype vm'\nassert encode('we') == 'dl'\nassert encode('apple on brain !') == 'hwwsl vu iyhpu !'\nassert encode('falcon summer code Hello') == 'mhsjvu zbttly jvkl Hlssv'\nassert encode('winter it river window') == 'dpualy pa ypcly dpukvd'\nassert encode('up apple code !') == 'bw hwwsl jvkl !'\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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('stone river brain matrix of')` يُرجع `'zavul ypcly iyhpu thaype vm'`.\nالجواب:", "qhash": "8a37d9edfcb002ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert total_multiples(27) == 182", "assert total_multiples(173) == 7482", "assert total_multiples(19) == 90", "assert total_multiples(208) == 10712", "assert total_multiples(129) == 4160", "assert total_multiples(16) == 56", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(27) == 182\nassert total_multiples(173) == 7482\nassert total_multiples(19) == 90\nassert total_multiples(208) == 10712\nassert total_multiples(129) == 4160\nassert total_multiples(16) == 56\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 % 14 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 14.\nمثال: `total_multiples(27)` يجب أن تُرجع `182`.\nالجواب:", "qhash": "90bf79363bc283cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -2 * x ** 2 + (9) * x + (3)", "tests": ["assert p(9) == -78", "assert p(0) == 3", "assert p(-9) == -240", "assert p(9) == -78", "assert p(19) == -548", "assert p(1) == 10", "assert p(3) == 12", "assert p(0) == 3"], "test_code": "assert p(9) == -78\nassert p(0) == 3\nassert p(-9) == -240\nassert p(9) == -78\nassert p(19) == -548\nassert p(1) == 10\nassert p(3) == 12\nassert p(0) == 3", "answer": "def p(x):\n return -2 * x ** 2 + (9) * x + (3)", "completion": " ```python\ndef p(x):\n return -2 * x ** 2 + (9) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -2x² + 9x + 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(9)` يُرجع `-78`.\nالجواب:", "qhash": "d96018abc70a909e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('خبز قهوة مدينة علم بيت') == 0", "assert tally_letter('') == 0", "assert tally_letter('حاسوب معلم') == 0", "assert tally_letter('طالب حديقة سوق بحر') == 0", "assert tally_letter('مطر مطر طائرة طائرة مطر مدرسة شجرة شمس') == 2", "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('مطر مطر طائرة طائرة مطر مدرسة شجرة شمس') == 2\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": "7411e71bb5a7d07f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 37) == 1)", "tests": ["assert count_gcd1(20) == 20", "assert count_gcd1(183) == 179", "assert count_gcd1(116) == 113", "assert count_gcd1(89) == 87", "assert count_gcd1(17) == 17", "assert count_gcd1(72) == 71", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(20) == 20\nassert count_gcd1(183) == 179\nassert count_gcd1(116) == 113\nassert count_gcd1(89) == 87\nassert count_gcd1(17) == 17\nassert count_gcd1(72) == 71\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, 37) == 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, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 37، أي أن القاسم المشترك الأكبر لها مع 37 يساوي 1.\nمثال: `count_gcd1(20)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "f82fb07a4701d0e3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(57) == 319", "assert multiples_total(205) == 3720", "assert multiples_total(210) == 4135", "assert multiples_total(223) == 4572", "assert multiples_total(200) == 3720", "assert multiples_total(115) == 1170", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(57) == 319\nassert multiples_total(205) == 3720\nassert multiples_total(210) == 4135\nassert multiples_total(223) == 4572\nassert multiples_total(200) == 3720\nassert multiples_total(115) == 1170\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 13.\nمثال: `multiples_total(57)` يجب أن تُرجع `319`.\nالجواب:", "qhash": "d277193b848c6b92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n <= 2:\n return 3\n return 1 * calc(n - 1) + 1\n\nprint(calc(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n <= 2:\n return 3\n return 1 * calc(n - 1) + 1\n\nprint(calc(5))\n```\nالجواب:", "qhash": "1980098448c7dd74", "answer": "6", "completion": " الناتج:\n```text\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "tests": ["assert sum_terms(4) == 1416", "assert sum_terms(6) == 9100", "assert sum_terms(6) == 9100", "assert sum_terms(13) == 357084", "assert sum_terms(10) == 101332", "assert sum_terms(1) == 4", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 1416\nassert sum_terms(6) == 9100\nassert sum_terms(6) == 9100\nassert sum_terms(13) == 357084\nassert sum_terms(10) == 101332\nassert sum_terms(1) == 4\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `1416`.\nالجواب:", "qhash": "421e42d35affbe42"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 312\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 = 312\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": "5aab3bd6488549f9", "answer": "37", "completion": " الناتج:\n```text\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 31", "tests": ["assert rec_prod(3) == 6", "assert rec_prod(49) == 0", "assert rec_prod(18) == 29", "assert rec_prod(4) == 24", "assert rec_prod(19) == 24", "assert rec_prod(22) == 17", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 6\nassert rec_prod(49) == 0\nassert rec_prod(18) == 29\nassert rec_prod(4) == 24\nassert rec_prod(19) == 24\nassert rec_prod(22) == 17\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 31", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "df288e8e153ed709"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 13) == 1)", "tests": ["assert phi_upto(110) == 102", "assert phi_upto(82) == 76", "assert phi_upto(34) == 32", "assert phi_upto(41) == 38", "assert phi_upto(85) == 79", "assert phi_upto(96) == 89", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(110) == 102\nassert phi_upto(82) == 76\nassert phi_upto(34) == 32\nassert phi_upto(41) == 38\nassert phi_upto(85) == 79\nassert phi_upto(96) == 89\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, 13) == 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, 13) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 13) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(110)` يُرجع `102`.\nالجواب:", "qhash": "b1434efcfbaab7e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total", "tests": ["assert sum_powers(3) == 36", "assert sum_powers(12) == 468", "assert sum_powers(9) == 270", "assert sum_powers(10) == 330", "assert sum_powers(8) == 216", "assert sum_powers(1) == 6", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 36\nassert sum_powers(12) == 468\nassert sum_powers(9) == 270\nassert sum_powers(10) == 330\nassert sum_powers(8) == 216\nassert sum_powers(1) == 6\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(3)` يُرجع `36`.\nالجواب:", "qhash": "4cbed989e94f13fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_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 max_of_div([17, 12, 22, 13, 59]) == 22", "assert max_of_div([-22, -11, -44]) == -11", "assert max_of_div([1]) == None", "assert max_of_div([-8, -21, 16, -33, -5, 0, -3, -20, 40]) == 0", "assert max_of_div([-40, -27, 1, 26, 49, 37]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([17, 12, 22, 13, 59]) == 22\nassert max_of_div([-22, -11, -44]) == -11\nassert max_of_div([1]) == None\nassert max_of_div([-8, -21, 16, -33, -5, 0, -3, -20, 40]) == 0\nassert max_of_div([-40, -27, 1, 26, 49, 37]) == None\nassert max_of_div([]) == None", "answer": "def max_of_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 max_of_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 max_of_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 max_of_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مثال: `max_of_div([17, 12, 22, 13, 59])` يجب أن تُرجع `22`.\nالجواب:", "qhash": "7becb8b80469eb16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 84:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([46, 16, 31, 22, 30, 29, 4, 14]) == [46, 62, 0, 22, 52, 81, 0, 14]", "assert acc_reset([-7, 10, 35, 22, 80, -4, 67]) == [-7, 3, 38, 60, 0, -4, 63]", "assert acc_reset([66, 75, 43, 41, 10, 67]) == [66, 0, 43, 84, 0, 67]", "assert acc_reset([2, 72, 54, 52, 55, 19]) == [2, 74, 0, 52, 0, 19]", "assert acc_reset([]) == []", "assert acc_reset([27, 48, 30, 29, 18, 76, 39, -2, 38]) == [27, 75, 0, 29, 47, 0, 39, 37, 75]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([46, 16, 31, 22, 30, 29, 4, 14]) == [46, 62, 0, 22, 52, 81, 0, 14]\nassert acc_reset([-7, 10, 35, 22, 80, -4, 67]) == [-7, 3, 38, 60, 0, -4, 63]\nassert acc_reset([66, 75, 43, 41, 10, 67]) == [66, 0, 43, 84, 0, 67]\nassert acc_reset([2, 72, 54, 52, 55, 19]) == [2, 74, 0, 52, 0, 19]\nassert acc_reset([]) == []\nassert acc_reset([27, 48, 30, 29, 18, 76, 39, -2, 38]) == [27, 75, 0, 29, 47, 0, 39, 37, 75]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 84:\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 > 84:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 84 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([46, 16, 31, 22, 30, 29, 4, 14])` يُرجع `[46, 62, 0, 22, 52, 81, 0, 14]`.\nالجواب:", "qhash": "b0f06451f66ff998"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [22, 38, -1, -5, -2, 19, 30]\nprint(xs[1:5])\nprint(xs[::-2])\nprint(max(xs[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [22, 38, -1, -5, -2, 19, 30]\nprint(xs[1:5])\nprint(xs[::-2])\nprint(max(xs[1:5]))\n```\nالجواب:", "qhash": "44443979c63519d1", "answer": "[38, -1, -5, -2]\n[30, -2, -1, 22]\n38", "completion": " الناتج:\n```text\n[38, -1, -5, -2]\n[30, -2, -1, 22]\n38\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_sel", "reference": "def count_sel(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_sel([84, 8, 11, 10, 43, 9, 88]) == 2", "assert count_sel([-22, -1, 34, -13, 66, 35]) == 0", "assert count_sel([47, -23, 32, -8, 6, 36]) == 2", "assert count_sel([6, 28, 47, 55, 90, 37, -32, 51, 30, 31]) == 2", "assert count_sel([55, -22, 39, 39]) == 0", "assert count_sel([]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([84, 8, 11, 10, 43, 9, 88]) == 2\nassert count_sel([-22, -1, 34, -13, 66, 35]) == 0\nassert count_sel([47, -23, 32, -8, 6, 36]) == 2\nassert count_sel([6, 28, 47, 55, 90, 37, -32, 51, 30, 31]) == 2\nassert count_sel([55, -22, 39, 39]) == 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 % 3 != 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 % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([84, 8, 11, 10, 43, 9, 88])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "0cf16d7a338cc705"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'emo'}", "tests": ["assert char_counts('table code by banana go river') == {'e': 3, 'm': 0, 'o': 2}", "assert char_counts('rocket light an desert') == {'e': 3, 'm': 0, 'o': 1}", "assert char_counts('pixel up banana rocket summer') == {'e': 3, 'm': 2, 'o': 1}", "assert char_counts('data') == {'e': 0, 'm': 0, 'o': 0}", "assert char_counts('river desert it on summer') == {'e': 4, 'm': 2, 'o': 1}", "assert char_counts('signal music camel up winter') == {'e': 2, 'm': 2, 'o': 0}", "assert char_counts('') == {'e': 0, 'm': 0, 'o': 0}"], "test_code": "assert char_counts('table code by banana go river') == {'e': 3, 'm': 0, 'o': 2}\nassert char_counts('rocket light an desert') == {'e': 3, 'm': 0, 'o': 1}\nassert char_counts('pixel up banana rocket summer') == {'e': 3, 'm': 2, 'o': 1}\nassert char_counts('data') == {'e': 0, 'm': 0, 'o': 0}\nassert char_counts('river desert it on summer') == {'e': 4, 'm': 2, 'o': 1}\nassert char_counts('signal music camel up winter') == {'e': 2, 'm': 2, 'o': 0}\nassert char_counts('') == {'e': 0, 'm': 0, 'o': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'emo'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'emo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'm'، 'o' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('table code by banana go river')` يجب أن تُرجع `{'e': 3, 'm': 0, 'o': 2}`.\nالجواب:", "qhash": "4b32751cad480e85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([-4, -16, -24, -26, 7, 50, -23, 41]) == None", "assert top_divisible([-11, -55, -22]) == -11", "assert top_divisible([1, 12, 23]) == None", "assert top_divisible([-35, -16, -10, -20, 19, 12, -3]) == None", "assert top_divisible([25, -17, -26, -2, 27, 5, -17, -49, 31]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-4, -16, -24, -26, 7, 50, -23, 41]) == None\nassert top_divisible([-11, -55, -22]) == -11\nassert top_divisible([1, 12, 23]) == None\nassert top_divisible([-35, -16, -10, -20, 19, 12, -3]) == None\nassert top_divisible([25, -17, -26, -2, 27, 5, -17, -49, 31]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 11 == 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 % 11 == 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 % 11 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(arr):\n best = None\n for x in arr:\n if x % 11 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([-4, -16, -24, -26, 7, 50, -23, 41])` يُرجع `None`.\nالجواب:", "qhash": "84c2a863d85fb16a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 5\nfor j in range(9, 18, 3):\n total -= j * 6\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 5\nfor j in range(9, 18, 3):\n total -= j * 6\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "04f89ade66fafe2d", "answer": "-211\n15", "completion": " الناتج:\n```text\n-211\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(215285713))\nprint(f(f(215285713)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(215285713))\nprint(f(f(215285713)))\n```\nالجواب:", "qhash": "d6b0929c90cd1051", "answer": "34\n7", "completion": " الناتج:\n```text\n34\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('by engine river signal rocket cloud it river') == 'river,cloud,rocket,signal,river,engine'", "assert words_reversed('up desert camel') == 'camel,desert'", "assert words_reversed('winter garden') == 'garden,winter'", "assert words_reversed('at banana on') == 'banana'", "assert words_reversed('brain') == 'brain'", "assert words_reversed('is at matrix to data') == 'data,matrix'", "assert words_reversed('of an garden is up planet of') == 'planet,garden'"], "test_code": "assert words_reversed('by engine river signal rocket cloud it river') == 'river,cloud,rocket,signal,river,engine'\nassert words_reversed('up desert camel') == 'camel,desert'\nassert words_reversed('winter garden') == 'garden,winter'\nassert words_reversed('at banana on') == 'banana'\nassert words_reversed('brain') == 'brain'\nassert words_reversed('is at matrix to data') == 'data,matrix'\nassert words_reversed('of an garden is up planet of') == 'planet,garden'", "answer": "def words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل ','.\nمثال: `words_reversed('by engine river signal rocket cloud it river')` يجب أن تُرجع `'river,cloud,rocket,signal,river,engine'`.\nالجواب:", "qhash": "bc8adfd125f83442"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('تفاحة سلام') == 1", "assert count_letter('كتاب وردة جبل برتقال نهار') == 0", "assert count_letter('قهوة مدرسة') == 0", "assert count_letter('قمر صديق سيارة شمس طالب') == 1", "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('قمر صديق سيارة شمس طالب') == 1\nassert count_letter('سلام لغة لغة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «س»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('باب كتاب حاسوب عمل قمر نهار')` يُرجع `0`.\nالجواب:", "qhash": "96d756296b792566"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'noru'}", "tests": ["assert tally('by garden falcon') == {'n': 2, 'o': 1, 'r': 1, 'u': 0}", "assert tally('table signal a go in summer') == {'n': 2, 'o': 1, 'r': 1, 'u': 1}", "assert tally('an') == {'n': 1, 'o': 0, 'r': 0, 'u': 0}", "assert tally('window') == {'n': 1, 'o': 1, 'r': 0, 'u': 0}", "assert tally('banana planet') == {'n': 3, 'o': 0, 'r': 0, 'u': 0}", "assert tally('window') == {'n': 1, 'o': 1, 'r': 0, 'u': 0}", "assert tally('') == {'n': 0, 'o': 0, 'r': 0, 'u': 0}"], "test_code": "assert tally('by garden falcon') == {'n': 2, 'o': 1, 'r': 1, 'u': 0}\nassert tally('table signal a go in summer') == {'n': 2, 'o': 1, 'r': 1, 'u': 1}\nassert tally('an') == {'n': 1, 'o': 0, 'r': 0, 'u': 0}\nassert tally('window') == {'n': 1, 'o': 1, 'r': 0, 'u': 0}\nassert tally('banana planet') == {'n': 3, 'o': 0, 'r': 0, 'u': 0}\nassert tally('window') == {'n': 1, 'o': 1, 'r': 0, 'u': 0}\nassert tally('') == {'n': 0, 'o': 0, 'r': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'noru'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'noru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'n'، 'o'، 'r'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('by garden falcon')` يُرجع `{'n': 2, 'o': 1, 'r': 1, 'u': 0}`.\nالجواب:", "qhash": "42de5f4f6ea6f89e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'عمر': 6, 'علي': 27, 'فيصل': 15}\nd['فيصل'] += 5\nd['راشد'] = 14\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('حسن', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'عمر': 6, 'علي': 27, 'فيصل': 15}\nd['فيصل'] += 5\nd['راشد'] = 14\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('حسن', -1))\n```\nالجواب:", "qhash": "88a2a555a690f574", "answer": "4\nعلي\n67\n-1", "completion": " الناتج:\n```text\n4\nعلي\n67\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['planet', 'matrix', 'music', 'rocket', 'orange']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['planet', 'matrix', 'music', 'rocket', 'orange']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "8433ec0999d1760c", "answer": "['music', 'planet', 'matrix', 'rocket', 'orange']\n['rocket', 'planet', 'orange']", "completion": " الناتج:\n```text\n['music', 'planet', 'matrix', 'rocket', 'orange']\n['rocket', 'planet', 'orange']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)", "tests": ["assert mult_sum(212) == 10395", "assert mult_sum(88) == 1845", "assert mult_sum(153) == 5325", "assert mult_sum(173) == 6944", "assert mult_sum(33) == 225", "assert mult_sum(247) == 14294", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(212) == 10395\nassert mult_sum(88) == 1845\nassert mult_sum(153) == 5325\nassert mult_sum(173) == 6944\nassert mult_sum(33) == 225\nassert mult_sum(247) == 14294\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 5.\nمثال: `mult_sum(212)` يجب أن تُرجع `10395`.\nالجواب:", "qhash": "b303f0cf6988f892"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 2) == 1)", "tests": ["assert phi_upto(48) == 24", "assert phi_upto(78) == 39", "assert phi_upto(190) == 95", "assert phi_upto(65) == 33", "assert phi_upto(97) == 49", "assert phi_upto(11) == 6", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(48) == 24\nassert phi_upto(78) == 39\nassert phi_upto(190) == 95\nassert phi_upto(65) == 33\nassert phi_upto(97) == 49\nassert phi_upto(11) == 6\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, 2) == 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, 2) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 2، أي أن القاسم المشترك الأكبر لها مع 2 يساوي 1.\nمثال: `phi_upto(48)` يجب أن تُرجع `24`.\nالجواب:", "qhash": "26c86e8a4133959b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(11))\nprint(h(11, 4))\nprint(h(h(4), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(h(11))\nprint(h(11, 4))\nprint(h(h(4), 11))\n```\nالجواب:", "qhash": "8a45d592e6ede85a", "answer": "6\n7\n20", "completion": " الناتج:\n```text\n6\n7\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=6):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(g(20))\nprint(g(20, 4))\nprint(g(g(4), 20))", "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(20))\nprint(g(20, 4))\nprint(g(g(4), 20))\n```\nالجواب:", "qhash": "647dcf34d49fa403", "answer": "-86\n-84\n-100", "completion": " الناتج:\n```text\n-86\n-84\n-100\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'سيارة'\nprint(w.find('س'))\nprint(len(w.replace(' ', '')))\nprint(w.count('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'سيارة'\nprint(w.find('س'))\nprint(len(w.replace(' ', '')))\nprint(w.count('س'))\n```\nالجواب:", "qhash": "5875aed4c641ec25", "answer": "0\n5\n1", "completion": " الناتج:\n```text\n0\n5\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 2 + 10 for x in range(4, 18) if x % 5 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 2 + 10 for x in range(4, 18) if x % 5 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "d07853440d4edc87", "answer": "[20, 30, 40]\n3 90", "completion": " الناتج:\n```text\n[20, 30, 40]\n3 90\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('coffee falcon winter music in stone cloud go') == 'cloud_stone_music_winter_falcon_coffee'", "assert flip_words('up banana garden engine') == 'engine_garden_banana'", "assert flip_words('') == ''", "assert flip_words('vector up at stone of go camel') == 'camel_stone_vector'", "assert flip_words('cloud falcon we') == 'falcon_cloud'", "assert flip_words('banana') == 'banana'", "assert flip_words('code is') == 'code'"], "test_code": "assert flip_words('coffee falcon winter music in stone cloud go') == 'cloud_stone_music_winter_falcon_coffee'\nassert flip_words('up banana garden engine') == 'engine_garden_banana'\nassert flip_words('') == ''\nassert flip_words('vector up at stone of go camel') == 'camel_stone_vector'\nassert flip_words('cloud falcon we') == 'falcon_cloud'\nassert flip_words('banana') == 'banana'\nassert flip_words('code is') == 'code'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `flip_words('coffee falcon winter music in stone cloud go')` يُرجع `'cloud_stone_music_winter_falcon_coffee'`.\nالجواب:", "qhash": "239197c7ebbe21c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'عمر': 8, 'مريم': 43, 'رنا': 11, 'سعيد': 13, 'منى': 22}\npoints['سعيد'] += 9\npoints['سلمى'] = 45\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'عمر': 8, 'مريم': 43, 'رنا': 11, 'سعيد': 13, 'منى': 22}\npoints['سعيد'] += 9\npoints['سلمى'] = 45\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('خالد', -1))\n```\nالجواب:", "qhash": "17851449ba3038e2", "answer": "6\nسلمى\n151\n-1", "completion": " الناتج:\n```text\n6\nسلمى\n151\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 11) == 1)", "tests": ["assert rel_prime_count(24) == 22", "assert rel_prime_count(57) == 52", "assert rel_prime_count(110) == 100", "assert rel_prime_count(91) == 83", "assert rel_prime_count(165) == 150", "assert rel_prime_count(175) == 160", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(24) == 22\nassert rel_prime_count(57) == 52\nassert rel_prime_count(110) == 100\nassert rel_prime_count(91) == 83\nassert rel_prime_count(165) == 150\nassert rel_prime_count(175) == 160\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, 11) == 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, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 11، أي أن القاسم المشترك الأكبر لها مع 11 يساوي 1.\nمثال: `rel_prime_count(24)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "6da1539d1b291816"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 54) == 1)", "tests": ["assert count_coprime(109) == 37", "assert count_coprime(60) == 20", "assert count_coprime(105) == 35", "assert count_coprime(98) == 33", "assert count_coprime(180) == 60", "assert count_coprime(10) == 3", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(109) == 37\nassert count_coprime(60) == 20\nassert count_coprime(105) == 35\nassert count_coprime(98) == 33\nassert count_coprime(180) == 60\nassert count_coprime(10) == 3\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 54) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(109)` يُرجع `37`.\nالجواب:", "qhash": "13a84791cabeaf8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(16) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16']", "assert fizz(0) == []", "assert fizz(24) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'HiYo', '21', '22', '23', '24']", "assert fizz(16) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16']", "assert fizz(18) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18']"], "test_code": "assert fizz(16) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16']\nassert fizz(0) == []\nassert fizz(24) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'HiYo', '21', '22', '23', '24']\nassert fizz(16) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16']\nassert fizz(18) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16', '17', '18']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Hi'، وإن قَبِلها على 10 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(16)` يُرجع `['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'HiYo', '11', '12', '13', '14', 'Hi', '16']`.\nالجواب:", "qhash": "a70fc1c9a28aa12c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 97778\nc = 0\nwhile x > 15:\n x = x // 8\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nx = 97778\nc = 0\nwhile x > 15:\n x = x // 8\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "d1e57848b3be3412", "answer": "2 5", "completion": " الناتج:\n```text\n2 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('music') == 'ygeuo'", "assert cipher('summer go on engine planet') == 'egyyqd sa az qzsuzq bxmzqf'", "assert cipher('coffee at music data up') == 'oarrqq mf ygeuo pmfm gb'", "assert cipher('window music code') == 'iuzpai ygeuo oapq'", "assert cipher('coffee we OK') == 'oarrqq iq OK'", "assert cipher('river light cloud') == 'duhqd xustf oxagp'", "assert cipher('') == ''"], "test_code": "assert cipher('music') == 'ygeuo'\nassert cipher('summer go on engine planet') == 'egyyqd sa az qzsuzq bxmzqf'\nassert cipher('coffee at music data up') == 'oarrqq mf ygeuo pmfm gb'\nassert cipher('window music code') == 'iuzpai ygeuo oapq'\nassert cipher('coffee we OK') == 'oarrqq iq OK'\nassert cipher('river light cloud') == 'duhqd xustf oxagp'\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 + (12)) % 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 + (12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('music')` يُرجع `'ygeuo'`.\nالجواب:", "qhash": "30e09cade766f2de"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -2 * x ** 2 + (5) * x + (0)", "tests": ["assert value_at(3) == -3", "assert value_at(-3) == -33", "assert value_at(-19) == -817", "assert value_at(-17) == -663", "assert value_at(17) == -493", "assert value_at(16) == -432", "assert value_at(6) == -42", "assert value_at(0) == 0"], "test_code": "assert value_at(3) == -3\nassert value_at(-3) == -33\nassert value_at(-19) == -817\nassert value_at(-17) == -663\nassert value_at(17) == -493\nassert value_at(16) == -432\nassert value_at(6) == -42\nassert value_at(0) == 0", "answer": "def value_at(x):\n return -2 * x ** 2 + (5) * x + (0)", "completion": " ```python\ndef value_at(x):\n return -2 * x ** 2 + (5) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -2x² + 5x + 0 عند العدد الصحيح x.\nمثال: `value_at(3)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "a2deddd6b2337827"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(582798049))\nprint(go(go(582798049)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(582798049))\nprint(go(go(582798049)))\n```\nالجواب:", "qhash": "9a35a2e67adf7b36", "answer": "52\n7", "completion": " الناتج:\n```text\n52\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 5 <= x <= 40)", "tests": ["assert clip_scale([5, 38, 14, 19, 20, 2, 16]) == [5, 14, 16, 19, 20, 38]", "assert clip_scale([-5, 48, -3, 14]) == [14]", "assert clip_scale([-10, 21]) == [21]", "assert clip_scale([53, -2, -12, -23, 50, 25, 24, 25, 54]) == [24, 25, 25]", "assert clip_scale([1, 51, -13, 54, -19, -4, -2, 53, 33]) == [33]", "assert clip_scale([51, 46, 52, 55, 17]) == [17]", "assert clip_scale([7]) == [7]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([5, 38, 14, 19, 20, 2, 16]) == [5, 14, 16, 19, 20, 38]\nassert clip_scale([-5, 48, -3, 14]) == [14]\nassert clip_scale([-10, 21]) == [21]\nassert clip_scale([53, -2, -12, -23, 50, 25, 24, 25, 54]) == [24, 25, 25]\nassert clip_scale([1, 51, -13, 54, -19, -4, -2, 53, 33]) == [33]\nassert clip_scale([51, 46, 52, 55, 17]) == [17]\nassert clip_scale([7]) == [7]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 5 <= x <= 40)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if 5 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 5 ≤ x ≤ 40، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([5, 38, 14, 19, 20, 2, 16])` يُرجع `[5, 14, 16, 19, 20, 38]`.\nالجواب:", "qhash": "8db8ef7a57f21b92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 60162\ncount = 0\nwhile n > 17:\n n = n // 8\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 60162\ncount = 0\nwhile n > 17:\n n = n // 8\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "1c68e91353d0b609", "answer": "14 4", "completion": " الناتج:\n```text\n14 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'agi'}", "tests": ["assert freq_of('a go vector summer signal') == {'a': 2, 'g': 2, 'i': 1}", "assert freq_of('coffee apple') == {'a': 1, 'g': 0, 'i': 0}", "assert freq_of('a music winter go garden') == {'a': 2, 'g': 2, 'i': 2}", "assert freq_of('we go is is is engine') == {'a': 0, 'g': 2, 'i': 4}", "assert freq_of('engine desert in') == {'a': 0, 'g': 1, 'i': 2}", "assert freq_of('at') == {'a': 1, 'g': 0, 'i': 0}", "assert freq_of('') == {'a': 0, 'g': 0, 'i': 0}"], "test_code": "assert freq_of('a go vector summer signal') == {'a': 2, 'g': 2, 'i': 1}\nassert freq_of('coffee apple') == {'a': 1, 'g': 0, 'i': 0}\nassert freq_of('a music winter go garden') == {'a': 2, 'g': 2, 'i': 2}\nassert freq_of('we go is is is engine') == {'a': 0, 'g': 2, 'i': 4}\nassert freq_of('engine desert in') == {'a': 0, 'g': 1, 'i': 2}\nassert freq_of('at') == {'a': 1, 'g': 0, 'i': 0}\nassert freq_of('') == {'a': 0, 'g': 0, 'i': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'agi'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'agi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'g'، 'i' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('a go vector summer signal')` يُرجع `{'a': 2, 'g': 2, 'i': 1}`.\nالجواب:", "qhash": "e6152a650ed49507"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(14) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14']", "assert game(14) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14']", "assert game(1) == ['1']", "assert game(4) == ['1', '2', '3', '4']", "assert game(24) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14', 'Sun', '16', '17', '18', '19', 'SunMoon', '21', '22', '23', '24']"], "test_code": "assert game(14) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14']\nassert game(14) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14']\nassert game(1) == ['1']\nassert game(4) == ['1', '2', '3', '4']\nassert game(24) == ['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14', 'Sun', '16', '17', '18', '19', 'SunMoon', '21', '22', '23', '24']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Sun'\n if i % 10 == 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 % 5 == 0:\n s += 'Sun'\n if i % 10 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Sun'، وإن قَبِلها على 10 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(14)` يُرجع `['1', '2', '3', '4', 'Sun', '6', '7', '8', '9', 'SunMoon', '11', '12', '13', '14']`.\nالجواب:", "qhash": "a524cca272b63d90"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('ليلى', 43), ('مريم', 45), ('سعيد', 88), ('فيصل', 23)]\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 = [('ليلى', 43), ('مريم', 45), ('سعيد', 88), ('فيصل', 23)]\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": "b1b121f66591043d", "answer": "[('فيصل', 23), ('ليلى', 43), ('مريم', 45), ('سعيد', 88)]\n['سعيد', 'مريم']", "completion": " الناتج:\n```text\n[('فيصل', 23), ('ليلى', 43), ('مريم', 45), ('سعيد', 88)]\n['سعيد', 'مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([31, 48, 19, 25]) == [19, 25, 31, 48]", "assert shift_list([22, 3, 45, 29, 4, 26, 24, 5]) == [45, 29, 4, 26, 24, 5, 22, 3]", "assert shift_list([-8, 38]) == [-8, 38]", "assert shift_list([50, 50, -9, 4, 20, 2, 22, 14, 17, 7, 8]) == [17, 7, 8, 50, 50, -9, 4, 20, 2, 22, 14]", "assert shift_list([45, 23, 24, 13, -3, 26, 15, 42, 42]) == [-3, 26, 15, 42, 42, 45, 23, 24, 13]", "assert shift_list([46, 28, 0, 49, 16]) == [28, 0, 49, 16, 46]", "assert shift_list([]) == []"], "test_code": "assert shift_list([31, 48, 19, 25]) == [19, 25, 31, 48]\nassert shift_list([22, 3, 45, 29, 4, 26, 24, 5]) == [45, 29, 4, 26, 24, 5, 22, 3]\nassert shift_list([-8, 38]) == [-8, 38]\nassert shift_list([50, 50, -9, 4, 20, 2, 22, 14, 17, 7, 8]) == [17, 7, 8, 50, 50, -9, 4, 20, 2, 22, 14]\nassert shift_list([45, 23, 24, 13, -3, 26, 15, 42, 42]) == [-3, 26, 15, 42, 42, 45, 23, 24, 13]\nassert shift_list([46, 28, 0, 49, 16]) == [28, 0, 49, 16, 46]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n if not xs:\n return []\n k = 14 % 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 = 14 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 14 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(xs):\n if not xs:\n return []\n k = 14 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([31, 48, 19, 25])` يُرجع `[19, 25, 31, 48]`.\nالجواب:", "qhash": "382d1aa6a66542fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ar'}", "tests": ["assert freq_of('up banana') == {'a': 3, 'r': 0}", "assert freq_of('we') == {'a': 0, 'r': 0}", "assert freq_of('we') == {'a': 0, 'r': 0}", "assert freq_of('engine pixel it summer in') == {'a': 0, 'r': 1}", "assert freq_of('code light river banana') == {'a': 3, 'r': 2}", "assert freq_of('is') == {'a': 0, 'r': 0}", "assert freq_of('') == {'a': 0, 'r': 0}"], "test_code": "assert freq_of('up banana') == {'a': 3, 'r': 0}\nassert freq_of('we') == {'a': 0, 'r': 0}\nassert freq_of('we') == {'a': 0, 'r': 0}\nassert freq_of('engine pixel it summer in') == {'a': 0, 'r': 1}\nassert freq_of('code light river banana') == {'a': 3, 'r': 2}\nassert freq_of('is') == {'a': 0, 'r': 0}\nassert freq_of('') == {'a': 0, 'r': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ar'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ar'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('up banana')` يجب أن تُرجع `{'a': 3, 'r': 0}`.\nالجواب:", "qhash": "7a931d6e1d8ca83b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'عربية علم'\nprint(s.count('م'))\nprint(len(s.replace(' ', '')))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'عربية علم'\nprint(s.count('م'))\nprint(len(s.replace(' ', '')))\nprint(len(s))\n```\nالجواب:", "qhash": "049fd6835cf65631", "answer": "1\n8\n9", "completion": " الناتج:\n```text\n1\n8\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(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 largest_div([53, 24, 17, -17, 51, 4, -16, -25, -30]) == None", "assert largest_div([-36, -18, -36]) == -18", "assert largest_div([1, 10, 19, 28]) == None", "assert largest_div([-26, -14, -36, -12]) == -36", "assert largest_div([50, -13, 44, -49, 1, -14]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([53, 24, 17, -17, 51, 4, -16, -25, -30]) == None\nassert largest_div([-36, -18, -36]) == -18\nassert largest_div([1, 10, 19, 28]) == None\nassert largest_div([-26, -14, -36, -12]) == -36\nassert largest_div([50, -13, 44, -49, 1, -14]) == None\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(nums):\n best = 0\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 largest_div(nums):\n best = 0\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للتوضيح: الاستدعاء `largest_div([53, 24, 17, -17, 51, 4, -16, -25, -30])` يُرجع `None`.\nالجواب:", "qhash": "2a6db2ff87a92948"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'garden'\nprint(text.find('e'))\nprint(text.count('e'))\nprint(text[-2:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'garden'\nprint(text.find('e'))\nprint(text.count('e'))\nprint(text[-2:])\n```\nالجواب:", "qhash": "b944f225148dbe26", "answer": "4\n1\nen", "completion": " الناتج:\n```text\n4\n1\nen\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('vector by of') == 'zigxsv fc sj'", "assert decode('river at signal pixel falcon !') == 'vmziv ex wmkrep tmbip jepgsr !'", "assert decode('at apple it apple table') == 'ex ettpi mx ettpi xefpi'", "assert decode('winter matrix it apple') == 'amrxiv qexvmb mx ettpi'", "assert decode('in winter') == 'mr amrxiv'", "assert decode('it go cloud') == 'mx ks gpsyh'", "assert decode('') == ''"], "test_code": "assert decode('vector by of') == 'zigxsv fc sj'\nassert decode('river at signal pixel falcon !') == 'vmziv ex wmkrep tmbip jepgsr !'\nassert decode('at apple it apple table') == 'ex ettpi mx ettpi xefpi'\nassert decode('winter matrix it apple') == 'amrxiv qexvmb mx ettpi'\nassert decode('in winter') == 'mr amrxiv'\nassert decode('it go cloud') == 'mx ks gpsyh'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('vector by of')` يجب أن تُرجع `'zigxsv fc sj'`.\nالجواب:", "qhash": "c47abbeb7f620983"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "words_starting", "reference": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert words_starting('قهوة ماء ليل سوق ميناء مطر') == 3", "assert words_starting('طائرة جمل قمر') == 0", "assert words_starting('دفتر نور جمل برمجة مدينة مطر برمجة نهار') == 2", "assert words_starting('معلم دفتر طائرة ميناء صديق نهر حصان') == 2", "assert words_starting('برتقال عمل خبز سوق') == 0", "assert words_starting('قهوة سماء برمجة شمس رمل') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('قهوة ماء ليل سوق ميناء مطر') == 3\nassert words_starting('طائرة جمل قمر') == 0\nassert words_starting('دفتر نور جمل برمجة مدينة مطر برمجة نهار') == 2\nassert words_starting('معلم دفتر طائرة ميناء صديق نهر حصان') == 2\nassert words_starting('برتقال عمل خبز سوق') == 0\nassert words_starting('قهوة سماء برمجة شمس رمل') == 0\nassert words_starting('') == 0", "answer": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('م'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(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 words_starting(sentence):\n count = 0\n for w in sentence:\n if w.startswith('م'):\n count += 1\n return count\n```\nمثال: `words_starting('قهوة ماء ليل سوق ميناء مطر')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "f21321a265d8ac09"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_sel", "reference": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_sel([30, 18, 80, 86, 72, 55, 33, 53, 14, 81, 71]) == 1", "assert count_sel([60, 84, 46]) == 2", "assert count_sel([60, 19, -33, 7, 37, 8, 61, 55, 37, 51, 78, -25]) == 2", "assert count_sel([-27, -20]) == 0", "assert count_sel([85, 10, 1]) == 0", "assert count_sel([22, 24, -27, 40, 0, 10, 65, 2, 42, 28, 84, 36]) == 3", "assert count_sel([]) == 0"], "test_code": "assert count_sel([30, 18, 80, 86, 72, 55, 33, 53, 14, 81, 71]) == 1\nassert count_sel([60, 84, 46]) == 2\nassert count_sel([60, 19, -33, 7, 37, 8, 61, 55, 37, 51, 78, -25]) == 2\nassert count_sel([-27, -20]) == 0\nassert count_sel([85, 10, 1]) == 0\nassert count_sel([22, 24, -27, 40, 0, 10, 65, 2, 42, 28, 84, 36]) == 3\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_sel(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([30, 18, 80, 86, 72, 55, 33, 53, 14, 81, 71])` يُرجع `1`.\nالجواب:", "qhash": "7d23af02b314c9e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([11, 47, 50, 1, 18, 44, 33]) == [50, 1, 18, 44, 33, 11, 47]", "assert roll([42]) == [42]", "assert roll([42, 39, 1]) == [39, 1, 42]", "assert roll([9, -6, 23, 11, 0, 40, 31, 46, 48]) == [0, 40, 31, 46, 48, 9, -6, 23, 11]", "assert roll([5]) == [5]", "assert roll([29, 45, -3, 2, 27, 26, -4, 46, 46, 43, -2, 21]) == [46, 46, 43, -2, 21, 29, 45, -3, 2, 27, 26, -4]", "assert roll([]) == []"], "test_code": "assert roll([11, 47, 50, 1, 18, 44, 33]) == [50, 1, 18, 44, 33, 11, 47]\nassert roll([42]) == [42]\nassert roll([42, 39, 1]) == [39, 1, 42]\nassert roll([9, -6, 23, 11, 0, 40, 31, 46, 48]) == [0, 40, 31, 46, 48, 9, -6, 23, 11]\nassert roll([5]) == [5]\nassert roll([29, 45, -3, 2, 27, 26, -4, 46, 46, 43, -2, 21]) == [46, 46, 43, -2, 21, 29, 45, -3, 2, 27, 26, -4]\nassert roll([]) == []", "answer": "def roll(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 roll(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 roll(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return ____\n```\nمثال: `roll([11, 47, 50, 1, 18, 44, 33])` يجب أن تُرجع `[50, 1, 18, 44, 33, 11, 47]`.\nالجواب:", "qhash": "a990186d18db6a77"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'برمجة'\nprint(kalima[-1])\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'برمجة'\nprint(kalima[-1])\nprint(kalima.split())\nprint(len(kalima.replace(' ', '')))\n```\nالجواب:", "qhash": "3f53a23795b63072", "answer": "ة\n['برمجة']\n5", "completion": " الناتج:\n```text\nة\n['برمجة']\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_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 largest_div([-16, 18, 49, -8, 8]) == 8", "assert largest_div([-12, -8, -12]) == -8", "assert largest_div([1, 5]) == None", "assert largest_div([-22, -31, -5, 8, -28, -35, -17, -30]) == 8", "assert largest_div([1, -45, 47, 2, -32]) == -32", "assert largest_div([]) == None"], "test_code": "assert largest_div([-16, 18, 49, -8, 8]) == 8\nassert largest_div([-12, -8, -12]) == -8\nassert largest_div([1, 5]) == None\nassert largest_div([-22, -31, -5, 8, -28, -35, -17, -30]) == 8\nassert largest_div([1, -45, 47, 2, -32]) == -32\nassert largest_div([]) == None", "answer": "def largest_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 largest_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 largest_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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_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مثال: `largest_div([-16, 18, 49, -8, 8])` يجب أن تُرجع `8`.\nالجواب:", "qhash": "20964a5003805dff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('on on window') == 'window'", "assert reverse_words('cloud at cloud falcon window up winter') == 'winter-window-falcon-cloud-cloud'", "assert reverse_words('data') == 'data'", "assert reverse_words('to music pixel stone rocket it garden') == 'garden-rocket-stone-pixel-music'", "assert reverse_words('brain engine') == 'engine-brain'", "assert reverse_words('an at') == ''", "assert reverse_words('winter up code light') == 'light-code-winter'"], "test_code": "assert reverse_words('on on window') == 'window'\nassert reverse_words('cloud at cloud falcon window up winter') == 'winter-window-falcon-cloud-cloud'\nassert reverse_words('data') == 'data'\nassert reverse_words('to music pixel stone rocket it garden') == 'garden-rocket-stone-pixel-music'\nassert reverse_words('brain engine') == 'engine-brain'\nassert reverse_words('an at') == ''\nassert reverse_words('winter up code light') == 'light-code-winter'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `reverse_words('on on window')` يُرجع `'window'`.\nالجواب:", "qhash": "ff32e9a7ba6c04a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([29, 35, 42, 1, 11, 34, 14, 34, 4, 11]) == [29, 64, 0, 1, 12, 46, 60, 0, 4, 15]", "assert rolling_total([-9, 65, 9, -9, 37]) == [-9, 56, 65, 56, 0]", "assert rolling_total([25, 0, -8, 51, 52, 7, 23, 25, 11]) == [25, 25, 17, 68, 0, 7, 30, 55, 66]", "assert rolling_total([25]) == [25]", "assert rolling_total([39, 61, 36, 58]) == [39, 0, 36, 0]", "assert rolling_total([6]) == [6]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([29, 35, 42, 1, 11, 34, 14, 34, 4, 11]) == [29, 64, 0, 1, 12, 46, 60, 0, 4, 15]\nassert rolling_total([-9, 65, 9, -9, 37]) == [-9, 56, 65, 56, 0]\nassert rolling_total([25, 0, -8, 51, 52, 7, 23, 25, 11]) == [25, 25, 17, 68, 0, 7, 30, 55, 66]\nassert rolling_total([25]) == [25]\nassert rolling_total([39, 61, 36, 58]) == [39, 0, 36, 0]\nassert rolling_total([6]) == [6]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\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 > 75:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 75 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([29, 35, 42, 1, 11, 34, 14, 34, 4, 11])` يُرجع `[29, 64, 0, 1, 12, 46, 60, 0, 4, 15]`.\nالجواب:", "qhash": "aeeb527f817e3dbb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert turn_list([2, 35, 18, 18, 0, 26, 20]) == [18, 18, 0, 26, 20, 2, 35]", "assert turn_list([28, 32, 2]) == [28, 32, 2]", "assert turn_list([43]) == [43]", "assert turn_list([26, 15, -7, 2, 20, 26, 33, 23, 34, 21]) == [21, 26, 15, -7, 2, 20, 26, 33, 23, 34]", "assert turn_list([4, 30, -1, 48]) == [30, -1, 48, 4]", "assert turn_list([30, 17]) == [17, 30]", "assert turn_list([]) == []"], "test_code": "assert turn_list([2, 35, 18, 18, 0, 26, 20]) == [18, 18, 0, 26, 20, 2, 35]\nassert turn_list([28, 32, 2]) == [28, 32, 2]\nassert turn_list([43]) == [43]\nassert turn_list([26, 15, -7, 2, 20, 26, 33, 23, 34, 21]) == [21, 26, 15, -7, 2, 20, 26, 33, 23, 34]\nassert turn_list([4, 30, -1, 48]) == [30, -1, 48, 4]\nassert turn_list([30, 17]) == [17, 30]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nمثال: `turn_list([2, 35, 18, 18, 0, 26, 20])` يجب أن تُرجع `[18, 18, 0, 26, 20, 2, 35]`.\nالجواب:", "qhash": "50654624455310b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(112) == 3080", "assert mult_sum(288) == 20592", "assert mult_sum(76) == 1406", "assert mult_sum(21) == 110", "assert mult_sum(180) == 8010", "assert mult_sum(174) == 7482", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(112) == 3080\nassert mult_sum(288) == 20592\nassert mult_sum(76) == 1406\nassert mult_sum(21) == 110\nassert mult_sum(180) == 8010\nassert mult_sum(174) == 7482\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(112)` يُرجع `3080`.\nالجواب:", "qhash": "5296df98a239e062"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 14\nfor i in range(9, 12, 2):\n total -= i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 14\nfor i in range(9, 12, 2):\n total -= i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "8265f014525d4362", "answer": "-106\n11", "completion": " الناتج:\n```text\n-106\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -1 + 2 for x in range(4, 11) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -1 + 2 for x in range(4, 11) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "904c57b671baf2a2", "answer": "[-3, -5, -7]\n3 -15", "completion": " الناتج:\n```text\n[-3, -5, -7]\n3 -15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 161\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 = 161\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": "a1afa46f3ad7558b", "answer": "98", "completion": " الناتج:\n```text\n98\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 6\nfor n in range(-1, 16, 3):\n total -= n * 4\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 6\nfor n in range(-1, 16, 3):\n total -= n * 4\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "b07e5d4774b15081", "answer": "-150\n14", "completion": " الناتج:\n```text\n-150\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 60", "tests": ["assert dig_pow_mod(31506) == 9", "assert dig_pow_mod(424564) == 1", "assert dig_pow_mod(710815) == 22", "assert dig_pow_mod(972164) == 41", "assert dig_pow_mod(161569) == 28", "assert dig_pow_mod(399401) == 50", "assert dig_pow_mod(515662) == 31", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(31506) == 9\nassert dig_pow_mod(424564) == 1\nassert dig_pow_mod(710815) == 22\nassert dig_pow_mod(972164) == 41\nassert dig_pow_mod(161569) == 28\nassert dig_pow_mod(399401) == 50\nassert dig_pow_mod(515662) == 31\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 60", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 60\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 60.\nللتوضيح: الاستدعاء `dig_pow_mod(31506)` يُرجع `9`.\nالجواب:", "qhash": "6fc97ec782053cfc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [39, -19, 23, -14, -3, 14, 0, -2]\nprint(sorted(nums, key=lambda x: (abs(x - 22), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [39, -19, 23, -14, -3, 14, 0, -2]\nprint(sorted(nums, key=lambda x: (abs(x - 22), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "5f2cfc9c7d6405a4", "answer": "[23, 14, 39, 0, -2, -3, -14, -19]\n[39, 23, 14]", "completion": " الناتج:\n```text\n[23, 14, 39, 0, -2, -3, -14, -19]\n[39, 23, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 26", "tests": ["assert digit_score(28592) == 4", "assert digit_score(478112) == 11", "assert digit_score(574657) == 12", "assert digit_score(321487) == 13", "assert digit_score(758154) == 22", "assert digit_score(663075) == 5", "assert digit_score(979871) == 25", "assert digit_score(0) == 0"], "test_code": "assert digit_score(28592) == 4\nassert digit_score(478112) == 11\nassert digit_score(574657) == 12\nassert digit_score(321487) == 13\nassert digit_score(758154) == 22\nassert digit_score(663075) == 5\nassert digit_score(979871) == 25\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 26", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 26\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 26.\nللتوضيح: الاستدعاء `digit_score(28592)` يُرجع `4`.\nالجواب:", "qhash": "c71c728ad5cd1c4e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 6 for x in range(-6, 1) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 6 for x in range(-6, 1) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "77a7702ad25e835b", "answer": "[10]\n1 10", "completion": " الناتج:\n```text\n[10]\n1 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 67", "tests": ["assert mfact(12) == 41", "assert mfact(54) == 49", "assert mfact(14) == 25", "assert mfact(15) == 40", "assert mfact(52) == 8", "assert mfact(35) == 16", "assert mfact(0) == 1"], "test_code": "assert mfact(12) == 41\nassert mfact(54) == 49\nassert mfact(14) == 25\nassert mfact(15) == 40\nassert mfact(52) == 8\nassert mfact(35) == 16\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 67", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 1)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 67 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(12)` يجب أن تُرجع `41`.\nالجواب:", "qhash": "66c5b7bb334f6421"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([32, 23, 7, 37, 26, 10, 45, 38, 25, 1]) == [32, 55, 62, 0, 26, 36, 81, 0, 25, 26]", "assert capped_cumsum([]) == []", "assert capped_cumsum([49, 31, 78, 54, 24, 32, 30]) == [49, 80, 0, 54, 78, 0, 30]", "assert capped_cumsum([40, 0, 53, 38, 84, 68, 56]) == [40, 40, 0, 38, 0, 68, 0]", "assert capped_cumsum([61, 78, 47]) == [61, 0, 47]", "assert capped_cumsum([36, 65, 4, -9, 16]) == [36, 0, 4, -5, 11]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([32, 23, 7, 37, 26, 10, 45, 38, 25, 1]) == [32, 55, 62, 0, 26, 36, 81, 0, 25, 26]\nassert capped_cumsum([]) == []\nassert capped_cumsum([49, 31, 78, 54, 24, 32, 30]) == [49, 80, 0, 54, 78, 0, 30]\nassert capped_cumsum([40, 0, 53, 38, 84, 68, 56]) == [40, 40, 0, 38, 0, 68, 0]\nassert capped_cumsum([61, 78, 47]) == [61, 0, 47]\nassert capped_cumsum([36, 65, 4, -9, 16]) == [36, 0, 4, -5, 11]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 85:\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 > 85:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 85 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([32, 23, 7, 37, 26, 10, 45, 38, 25, 1])` يُرجع `[32, 55, 62, 0, 26, 36, 81, 0, 25, 26]`.\nالجواب:", "qhash": "1c4f931d992f3bcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "tests": ["assert sum_div(231) == 13340", "assert sum_div(21) == 110", "assert sum_div(288) == 20592", "assert sum_div(128) == 4032", "assert sum_div(46) == 506", "assert sum_div(202) == 10100", "assert sum_div(1) == 0"], "test_code": "assert sum_div(231) == 13340\nassert sum_div(21) == 110\nassert sum_div(288) == 20592\nassert sum_div(128) == 4032\nassert sum_div(46) == 506\nassert sum_div(202) == 10100\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 6.\nمثال: `sum_div(231)` يجب أن تُرجع `13340`.\nالجواب:", "qhash": "620af0e33b2bcd7b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 7 * x ** 2 + (-2) * x + (-7)", "tests": ["assert eval_poly(4) == 97", "assert eval_poly(-17) == 2050", "assert eval_poly(3) == 50", "assert eval_poly(2) == 17", "assert eval_poly(17) == 1982", "assert eval_poly(9) == 542", "assert eval_poly(-12) == 1025", "assert eval_poly(0) == -7"], "test_code": "assert eval_poly(4) == 97\nassert eval_poly(-17) == 2050\nassert eval_poly(3) == 50\nassert eval_poly(2) == 17\nassert eval_poly(17) == 1982\nassert eval_poly(9) == 542\nassert eval_poly(-12) == 1025\nassert eval_poly(0) == -7", "answer": "def eval_poly(x):\n return 7 * x ** 2 + (-2) * x + (-7)", "completion": " ```python\ndef eval_poly(x):\n return 7 * x ** 2 + (-2) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 7x² - 2x - 7 عند العدد الصحيح x.\nمثال: `eval_poly(4)` يجب أن تُرجع `97`.\nالجواب:", "qhash": "80350ff547c6d49d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [12, -9, 17, 39, -2, -1, 6]\nprint(a[0:1])\nprint(a[::-1])\nprint(min(a[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [12, -9, 17, 39, -2, -1, 6]\nprint(a[0:1])\nprint(a[::-1])\nprint(min(a[0:1]))\n```\nالجواب:", "qhash": "a7ef8b61b0631391", "answer": "[12]\n[6, -1, -2, 39, 17, -9, 12]\n12", "completion": " الناتج:\n```text\n[12]\n[6, -1, -2, 39, 17, -9, 12]\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'pixel'\nprint(s.count('l'))\nprint(s[-4:])\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'pixel'\nprint(s.count('l'))\nprint(s[-4:])\nprint(s.capitalize())\n```\nالجواب:", "qhash": "6f5576bd352af0cb", "answer": "1\nixel\nPixel", "completion": " الناتج:\n```text\n1\nixel\nPixel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'رمل ليل'\nprint(kalima[0])\nprint(kalima.split())\nprint('ر' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'رمل ليل'\nprint(kalima[0])\nprint(kalima.split())\nprint('ر' in kalima)\n```\nالجواب:", "qhash": "cdc0dff7d46fb25c", "answer": "ر\n['رمل', 'ليل']\nTrue", "completion": " الناتج:\n```text\nر\n['رمل', 'ليل']\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [32, -9, 14, -14, 21]\nprint(sorted(nums, key=lambda x: (abs(x - 5), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [32, -9, 14, -14, 21]\nprint(sorted(nums, key=lambda x: (abs(x - 5), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "499f5b5bda1ae9d1", "answer": "[14, -9, 21, -14, 32]\n[32, 21, 14]", "completion": " الناتج:\n```text\n[14, -9, 21, -14, 32]\n[32, 21, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(133) == 1758", "assert add_multiples(83) == 680", "assert add_multiples(182) == 3334", "assert add_multiples(259) == 6634", "assert add_multiples(238) == 5640", "assert add_multiples(291) == 8558", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(133) == 1758\nassert add_multiples(83) == 680\nassert add_multiples(182) == 3334\nassert add_multiples(259) == 6634\nassert add_multiples(238) == 5640\nassert add_multiples(291) == 8558\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 10.\nمثال: `add_multiples(133)` يجب أن تُرجع `1758`.\nالجواب:", "qhash": "66179697da05808a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert count_div([59, 60, 87, 56, 71, 63, 72]) == 3", "assert count_div([-15, 37]) == 1", "assert count_div([]) == 0", "assert count_div([9, 32, 56, 71, 72, 24, 66, -19, -33, -39, 56]) == 6", "assert count_div([]) == 0", "assert count_div([7]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([59, 60, 87, 56, 71, 63, 72]) == 3\nassert count_div([-15, 37]) == 1\nassert count_div([]) == 0\nassert count_div([9, 32, 56, 71, 72, 24, 66, -19, -33, -39, 56]) == 6\nassert count_div([]) == 0\nassert count_div([7]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 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 % 3 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 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([59, 60, 87, 56, 71, 63, 72])` يُرجع `3`.\nالجواب:", "qhash": "bd326c0160a4be97"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([48, 79, 82, 19, 88, 8, 75, 50, 35, 5]) == 0", "assert how_many_div([55, -39, 82, 75]) == 0", "assert how_many_div([65, 47, -10, -20, 4, -17, 76, 49, -11, 54]) == 1", "assert how_many_div([56, 66, -2, -12, 10, 65, 3, -25, 27, -32, -24, -3]) == 2", "assert how_many_div([23, -28, 9, 69, 33]) == 0", "assert how_many_div([57, 5, 73, 15, 29]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([48, 79, 82, 19, 88, 8, 75, 50, 35, 5]) == 0\nassert how_many_div([55, -39, 82, 75]) == 0\nassert how_many_div([65, 47, -10, -20, 4, -17, 76, 49, -11, 54]) == 1\nassert how_many_div([56, 66, -2, -12, 10, 65, 3, -25, 27, -32, -24, -3]) == 2\nassert how_many_div([23, -28, 9, 69, 33]) == 0\nassert how_many_div([57, 5, 73, 15, 29]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 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 % 6 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([48, 79, 82, 19, 88, 8, 75, 50, 35, 5])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "a775da13567c471c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 10007", "tests": ["assert multi_fact(8) == 80", "assert multi_fact(17) == 9300", "assert multi_fact(0) == 1", "assert multi_fact(23) == 5011", "assert multi_fact(2) == 2", "assert multi_fact(12) == 1944", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(8) == 80\nassert multi_fact(17) == 9300\nassert multi_fact(0) == 1\nassert multi_fact(23) == 5011\nassert multi_fact(2) == 2\nassert multi_fact(12) == 1944\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 10007", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(8)` يُرجع `80`.\nالجواب:", "qhash": "78da374df56f7e3e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(9) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9']", "assert label_numbers(7) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7']", "assert label_numbers(19) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'Ping', '17', 'PingPong', '19']", "assert label_numbers(0) == []", "assert label_numbers(17) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'Ping', '17']"], "test_code": "assert label_numbers(9) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9']\nassert label_numbers(7) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7']\nassert label_numbers(19) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'Ping', '17', 'PingPong', '19']\nassert label_numbers(0) == []\nassert label_numbers(17) == ['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9', 'Ping', '11', 'PingPong', '13', 'Ping', '15', 'Ping', '17']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Ping'\n if i % 6 == 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 % 2 == 0:\n s += 'Ping'\n if i % 6 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Ping'، وإن قَبِلها على 6 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(9)` يُرجع `['1', 'Ping', '3', 'Ping', '5', 'PingPong', '7', 'Ping', '9']`.\nالجواب:", "qhash": "612d745262a9d58f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 8\nfor i in range(1, 12, 2):\n acc -= i * 9\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 8\nfor i in range(1, 12, 2):\n acc -= i * 9\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "9829698d0769e2a7", "answer": "-316\n11", "completion": " الناتج:\n```text\n-316\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=2):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(h(-1))\nprint(h(-1, 0))\nprint(h(h(0), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=2):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(h(-1))\nprint(h(-1, 0))\nprint(h(h(0), -1))\n```\nالجواب:", "qhash": "6b0be5fa49cd0b92", "answer": "3\n-1\n9", "completion": " الناتج:\n```text\n3\n-1\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 57", "tests": ["assert sum_digit_pow(30710) == 2", "assert sum_digit_pow(565448) == 11", "assert sum_digit_pow(306103) == 55", "assert sum_digit_pow(33765) == 14", "assert sum_digit_pow(125007) == 22", "assert sum_digit_pow(493838) == 15", "assert sum_digit_pow(34908) == 56", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(30710) == 2\nassert sum_digit_pow(565448) == 11\nassert sum_digit_pow(306103) == 55\nassert sum_digit_pow(33765) == 14\nassert sum_digit_pow(125007) == 22\nassert sum_digit_pow(493838) == 15\nassert sum_digit_pow(34908) == 56\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 57", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 57\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 57.\nمثال: `sum_digit_pow(30710)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "559e1c02c4a4bb8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('م'):\n count += 1\n return count", "tests": ["assert count_initial('رمل ماء مدينة') == 2", "assert count_initial('معلم جمل ميناء عمل') == 2", "assert count_initial('دفتر سماء سماء صديق سماء نور') == 0", "assert count_initial('بيت سلام طالب نهار عربية') == 0", "assert count_initial('كتاب مطر صحراء حاسوب ميناء') == 2", "assert count_initial('حديقة خبز') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('رمل ماء مدينة') == 2\nassert count_initial('معلم جمل ميناء عمل') == 2\nassert count_initial('دفتر سماء سماء صديق سماء نور') == 0\nassert count_initial('بيت سلام طالب نهار عربية') == 0\nassert count_initial('كتاب مطر صحراء حاسوب ميناء') == 2\nassert count_initial('حديقة خبز') == 0\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('م'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text.split():\n if 'م' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('رمل ماء مدينة')` يُرجع `2`.\nالجواب:", "qhash": "d00606a59eade6ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'أحمد': 6, 'نور': 39, 'باسل': 15, 'علي': 34, 'خالد': 28}\nscores['خالد'] += 2\nscores['فيصل'] = 33\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'أحمد': 6, 'نور': 39, 'باسل': 15, 'علي': 34, 'خالد': 28}\nscores['خالد'] += 2\nscores['فيصل'] = 33\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('ليلى', -1))\n```\nالجواب:", "qhash": "92a7364f13cebe7d", "answer": "6\nنور\n157\n-1", "completion": " الناتج:\n```text\n6\nنور\n157\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('صديق صحراء عمل باب نهر حاسوب') == 2", "assert begin_count('صديق ليل صديق برمجة نهار صديق دفتر') == 3", "assert begin_count('جبل قلم وردة قلم صحراء صحراء') == 2", "assert begin_count('صحراء برمجة سيارة صحراء نهر بحر') == 2", "assert begin_count('صحراء صديق شجرة صديق') == 3", "assert begin_count('مطر حصان فجر تفاحة مدرسة سماء') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('صديق صحراء عمل باب نهر حاسوب') == 2\nassert begin_count('صديق ليل صديق برمجة نهار صديق دفتر') == 3\nassert begin_count('جبل قلم وردة قلم صحراء صحراء') == 2\nassert begin_count('صحراء برمجة سيارة صحراء نهر بحر') == 2\nassert begin_count('صحراء صديق شجرة صديق') == 3\nassert begin_count('مطر حصان فجر تفاحة مدرسة سماء') == 0\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('صديق صحراء عمل باب نهر حاسوب')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "f84b2c478fb10fe8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 2:\n return 1\n return 2 * rec(n - 1) + 2\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 2:\n return 1\n return 2 * rec(n - 1) + 2\n\nprint(rec(5))\n```\nالجواب:", "qhash": "074c16e5ab7893ba", "answer": "22", "completion": " الناتج:\n```text\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 9", "tests": ["assert sum_digit_pow(59163) == 0", "assert sum_digit_pow(985311) == 0", "assert sum_digit_pow(389624) == 8", "assert sum_digit_pow(548971) == 1", "assert sum_digit_pow(412985) == 8", "assert sum_digit_pow(687282) == 6", "assert sum_digit_pow(597969) == 0", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(59163) == 0\nassert sum_digit_pow(985311) == 0\nassert sum_digit_pow(389624) == 8\nassert sum_digit_pow(548971) == 1\nassert sum_digit_pow(412985) == 8\nassert sum_digit_pow(687282) == 6\nassert sum_digit_pow(597969) == 0\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 9", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 9\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 9.\nللتوضيح: الاستدعاء `sum_digit_pow(59163)` يُرجع `0`.\nالجواب:", "qhash": "86e06875e439d286"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 27\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 = 27\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": "707a527d1145758f", "answer": "111", "completion": " الناتج:\n```text\n111\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 17", "tests": ["assert multi_fact(11) == 10", "assert multi_fact(35) == 9", "assert multi_fact(38) == 0", "assert multi_fact(12) == 10", "assert multi_fact(39) == 11", "assert multi_fact(7) == 4", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(11) == 10\nassert multi_fact(35) == 9\nassert multi_fact(38) == 0\nassert multi_fact(12) == 10\nassert multi_fact(39) == 11\nassert multi_fact(7) == 4\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 17", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 4)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(11)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "55e094b77e1a5735"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([37, 79, 8, 30, 84, 74, 61, 73]) == [37, 116, 124, 154, 0, 74, 135, 0]", "assert cumulative([]) == []", "assert cumulative([108, 54, 81, 22, 15, 142, 76, 1, -5, 163]) == [108, 162, 0, 22, 37, 0, 76, 77, 72, 0]", "assert cumulative([110, 92]) == [110, 0]", "assert cumulative([171, 137, 56, 100, 16, 137]) == [171, 0, 56, 156, 172, 0]", "assert cumulative([122, 160, 116, 16, 9, 22, 44, 141, 32]) == [122, 0, 116, 132, 141, 163, 0, 141, 173]", "assert cumulative([]) == []"], "test_code": "assert cumulative([37, 79, 8, 30, 84, 74, 61, 73]) == [37, 116, 124, 154, 0, 74, 135, 0]\nassert cumulative([]) == []\nassert cumulative([108, 54, 81, 22, 15, 142, 76, 1, -5, 163]) == [108, 162, 0, 22, 37, 0, 76, 77, 72, 0]\nassert cumulative([110, 92]) == [110, 0]\nassert cumulative([171, 137, 56, 100, 16, 137]) == [171, 0, 56, 156, 172, 0]\nassert cumulative([122, 160, 116, 16, 9, 22, 44, 141, 32]) == [122, 0, 116, 132, 141, 163, 0, 141, 173]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 175:\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 > 175:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 175 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([37, 79, 8, 30, 84, 74, 61, 73])` يجب أن تُرجع `[37, 116, 124, 154, 0, 74, 135, 0]`.\nالجواب:", "qhash": "b8719de415b28373"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * -1 + 0 for x in range(4, 15) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * -1 + 0 for x in range(4, 15) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "23bf345cca24a7fa", "answer": "[-4, -9, -14]\n3 -27", "completion": " الناتج:\n```text\n[-4, -9, -14]\n3 -27\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 117:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([40, 35, 8, 11, 32, 50, 26, 4]) == [40, 75, 83, 94, 0, 50, 76, 80]", "assert reset_sum([89, -4]) == [89, 85]", "assert reset_sum([19, 53, 90]) == [19, 72, 0]", "assert reset_sum([8, 89, 107, 64, 19, 116, 110, 68]) == [8, 97, 0, 64, 83, 0, 110, 0]", "assert reset_sum([38, 80, 109, 32, 92, 65, 47, 63]) == [38, 0, 109, 0, 92, 0, 47, 110]", "assert reset_sum([35]) == [35]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([40, 35, 8, 11, 32, 50, 26, 4]) == [40, 75, 83, 94, 0, 50, 76, 80]\nassert reset_sum([89, -4]) == [89, 85]\nassert reset_sum([19, 53, 90]) == [19, 72, 0]\nassert reset_sum([8, 89, 107, 64, 19, 116, 110, 68]) == [8, 97, 0, 64, 83, 0, 110, 0]\nassert reset_sum([38, 80, 109, 32, 92, 65, 47, 63]) == [38, 0, 109, 0, 92, 0, 47, 110]\nassert reset_sum([35]) == [35]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 117:\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 > 117:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reset_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 117 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `reset_sum([40, 35, 8, 11, 32, 50, 26, 4])` يجب أن تُرجع `[40, 75, 83, 94, 0, 50, 76, 80]`.\nالجواب:", "qhash": "a8b35149705cfe98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [34, -7, 31, -6, -9, 8]\nprint(lst[2:6])\nprint(lst[::-1])\nprint(len(lst[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [34, -7, 31, -6, -9, 8]\nprint(lst[2:6])\nprint(lst[::-1])\nprint(len(lst[2:6]))\n```\nالجواب:", "qhash": "5c642df3d405581d", "answer": "[31, -6, -9, 8]\n[8, -9, -6, 31, -7, 34]\n4", "completion": " الناتج:\n```text\n[31, -6, -9, 8]\n[8, -9, -6, 31, -7, 34]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cgu'}", "tests": ["assert freq_of('pixel engine camel garden matrix to') == {'c': 1, 'g': 2, 'u': 0}", "assert freq_of('data banana') == {'c': 0, 'g': 0, 'u': 0}", "assert freq_of('it') == {'c': 0, 'g': 0, 'u': 0}", "assert freq_of('up') == {'c': 0, 'g': 0, 'u': 1}", "assert freq_of('garden') == {'c': 0, 'g': 1, 'u': 0}", "assert freq_of('signal python an is to') == {'c': 0, 'g': 1, 'u': 0}", "assert freq_of('') == {'c': 0, 'g': 0, 'u': 0}"], "test_code": "assert freq_of('pixel engine camel garden matrix to') == {'c': 1, 'g': 2, 'u': 0}\nassert freq_of('data banana') == {'c': 0, 'g': 0, 'u': 0}\nassert freq_of('it') == {'c': 0, 'g': 0, 'u': 0}\nassert freq_of('up') == {'c': 0, 'g': 0, 'u': 1}\nassert freq_of('garden') == {'c': 0, 'g': 1, 'u': 0}\nassert freq_of('signal python an is to') == {'c': 0, 'g': 1, 'u': 0}\nassert freq_of('') == {'c': 0, 'g': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cgu'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cgu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'g'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('pixel engine camel garden matrix to')` يجب أن تُرجع `{'c': 1, 'g': 2, 'u': 0}`.\nالجواب:", "qhash": "d9fd8bdf03a2f637"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [37, 24, 6, -4, 14, 14, -8, 14]\nprint(nums[3:8])\nprint(nums[::-2])\nprint(sum(nums[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [37, 24, 6, -4, 14, 14, -8, 14]\nprint(nums[3:8])\nprint(nums[::-2])\nprint(sum(nums[3:8]))\n```\nالجواب:", "qhash": "90125b52b4876745", "answer": "[-4, 14, 14, -8, 14]\n[14, 14, -4, 24]\n30", "completion": " الناتج:\n```text\n[-4, 14, 14, -8, 14]\n[14, 14, -4, 24]\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 20)", "tests": ["assert select_range([-6, 12, -8, 26, -2, 7]) == [28, 48]", "assert select_range([-25, 42, 24, 38]) == []", "assert select_range([46]) == []", "assert select_range([]) == []", "assert select_range([8, 5, -17, 11, 55, -30]) == [20, 32, 44]", "assert select_range([56]) == []", "assert select_range([16]) == [64]", "assert select_range([]) == []"], "test_code": "assert select_range([-6, 12, -8, 26, -2, 7]) == [28, 48]\nassert select_range([-25, 42, 24, 38]) == []\nassert select_range([46]) == []\nassert select_range([]) == []\nassert select_range([8, 5, -17, 11, 55, -30]) == [20, 32, 44]\nassert select_range([56]) == []\nassert select_range([16]) == [64]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 20)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 4 for x in xs if 2 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 2 ≤ x ≤ 20، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([-6, 12, -8, 26, -2, 7])` يُرجع `[28, 48]`.\nالجواب:", "qhash": "f344897cc4e510c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert game(5) == ['1', '2', 'Ping', '4', 'Pong']", "assert game(0) == []", "assert game(25) == ['1', '2', 'Ping', '4', 'Pong', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'PingPong', '16', '17', 'Ping', '19', 'Pong', 'Ping', '22', '23', 'Ping', 'Pong']", "assert game(1) == ['1']", "assert game(17) == ['1', '2', 'Ping', '4', 'Pong', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'PingPong', '16', '17']"], "test_code": "assert game(5) == ['1', '2', 'Ping', '4', 'Pong']\nassert game(0) == []\nassert game(25) == ['1', '2', 'Ping', '4', 'Pong', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'PingPong', '16', '17', 'Ping', '19', 'Pong', 'Ping', '22', '23', 'Ping', 'Pong']\nassert game(1) == ['1']\nassert game(17) == ['1', '2', 'Ping', '4', 'Pong', 'Ping', '7', '8', 'Ping', 'Pong', '11', 'Ping', '13', '14', 'PingPong', '16', '17']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\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 += 'Ping'\n if i % 5 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Ping'، وإن قَبِلها على 5 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(5)` يُرجع `['1', '2', 'Ping', '4', 'Pong']`.\nالجواب:", "qhash": "8a0526c01307e8be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 0\nfor j in range(0, 18, 4):\n s -= j * 7\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 0\nfor j in range(0, 18, 4):\n s -= j * 7\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "77214580ac47ef52", "answer": "-280\n16", "completion": " الناتج:\n```text\n-280\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert power_sum(3) == 42", "assert power_sum(0) == 0", "assert power_sum(2) == 21", "assert power_sum(14) == 735", "assert power_sum(5) == 105", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(3) == 42\nassert power_sum(0) == 0\nassert power_sum(2) == 21\nassert power_sum(14) == 735\nassert power_sum(5) == 105\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 ** 1\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total\n```\nمثال: `power_sum(3)` يجب أن تُرجع `42`.\nالجواب:", "qhash": "0e3fba794cac4462"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 50) == 1)", "tests": ["assert coprime_count(41) == 17", "assert coprime_count(146) == 58", "assert coprime_count(35) == 14", "assert coprime_count(121) == 49", "assert coprime_count(92) == 37", "assert coprime_count(9) == 4", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(41) == 17\nassert coprime_count(146) == 58\nassert coprime_count(35) == 14\nassert coprime_count(121) == 49\nassert coprime_count(92) == 37\nassert coprime_count(9) == 4\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, 50) == 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, 50) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 50) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(41)` يُرجع `17`.\nالجواب:", "qhash": "83ae0b56f78cb732"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'عمر': 28, 'ليلى': 3, 'وليد': 29, 'سلمى': 22}\npoints['وليد'] += 10\npoints['مريم'] = 56\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 = {'عمر': 28, 'ليلى': 3, 'وليد': 29, 'سلمى': 22}\npoints['وليد'] += 10\npoints['مريم'] = 56\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": "00f385f7f0dc6bfd", "answer": "5\nمريم\n148\n[('ليلى', 3), ('سلمى', 22)]", "completion": " الناتج:\n```text\n5\nمريم\n148\n[('ليلى', 3), ('سلمى', 22)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert shift_list([19, 17, 3, 15, 23, 28, 40]) == [23, 28, 40, 19, 17, 3, 15]", "assert shift_list([45, 37, -5, 50, -2, 17, 29, 45, 13, 1, 36, 34]) == [34, 45, 37, -5, 50, -2, 17, 29, 45, 13, 1, 36]", "assert shift_list([27, 46, 10]) == [10, 27, 46]", "assert shift_list([-3, 24, -1, -4, 44, -4, 13, 27, 13, 28]) == [24, -1, -4, 44, -4, 13, 27, 13, 28, -3]", "assert shift_list([23, 28, 44, 50]) == [50, 23, 28, 44]", "assert shift_list([-9, 11, -2, 17, 23]) == [11, -2, 17, 23, -9]", "assert shift_list([]) == []"], "test_code": "assert shift_list([19, 17, 3, 15, 23, 28, 40]) == [23, 28, 40, 19, 17, 3, 15]\nassert shift_list([45, 37, -5, 50, -2, 17, 29, 45, 13, 1, 36, 34]) == [34, 45, 37, -5, 50, -2, 17, 29, 45, 13, 1, 36]\nassert shift_list([27, 46, 10]) == [10, 27, 46]\nassert shift_list([-3, 24, -1, -4, 44, -4, 13, 27, 13, 28]) == [24, -1, -4, 44, -4, 13, 27, 13, 28, -3]\nassert shift_list([23, 28, 44, 50]) == [50, 23, 28, 44]\nassert shift_list([-9, 11, -2, 17, 23]) == [11, -2, 17, 23, -9]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef shift_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 shift_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([19, 17, 3, 15, 23, 28, 40])` يُرجع `[23, 28, 40, 19, 17, 3, 15]`.\nالجواب:", "qhash": "46d48e381326fe7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(9, 2))", "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(9, 2))\n```\nالجواب:", "qhash": "3fae4e89274e2706", "answer": "81", "completion": " الناتج:\n```text\n81\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('د'):\n count += 1\n return count", "tests": ["assert starts_count('تفاحة مطر حصان شمس سوق فجر دفتر') == 1", "assert starts_count('حصان بحر برتقال دفتر قهوة دفتر') == 2", "assert starts_count('دفتر علم خبز دفتر') == 2", "assert starts_count('نهار نهار تفاحة دفتر ماء جمل طالب') == 1", "assert starts_count('دفتر بحر بيت برمجة معلم بحر') == 1", "assert starts_count('دفتر معلم قهوة نهر ماء تفاحة جبل دفتر') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('تفاحة مطر حصان شمس سوق فجر دفتر') == 1\nassert starts_count('حصان بحر برتقال دفتر قهوة دفتر') == 2\nassert starts_count('دفتر علم خبز دفتر') == 2\nassert starts_count('نهار نهار تفاحة دفتر ماء جمل طالب') == 1\nassert starts_count('دفتر بحر بيت برمجة معلم بحر') == 1\nassert starts_count('دفتر معلم قهوة نهر ماء تفاحة جبل دفتر') == 2\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('د'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('د'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('تفاحة مطر حصان شمس سوق فجر دفتر')` يُرجع `1`.\nالجواب:", "qhash": "9ecef501f08e5152"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert only_div([78, 74, 36, 54, 15, 2, 65, 38, 5, 68, 32, 49]) == 1", "assert only_div([38, 9, 40, 84, -20, 86, 34, -22, 83, -12, -9]) == 1", "assert only_div([-36, 32, 8, -29, 82, -3, 59, 40, -30, 13, 40]) == 0", "assert only_div([36, -39, 27, 90, 63, 69, 18, 81, 85]) == 1", "assert only_div([42, -9, -1, 20, 27, 86, 75]) == 1", "assert only_div([19, 2, 55, -40, -18, 78, -32, 15, 54, 46, 49, 81]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([78, 74, 36, 54, 15, 2, 65, 38, 5, 68, 32, 49]) == 1\nassert only_div([38, 9, 40, 84, -20, 86, 34, -22, 83, -12, -9]) == 1\nassert only_div([-36, 32, 8, -29, 82, -3, 59, 40, -30, 13, 40]) == 0\nassert only_div([36, -39, 27, 90, 63, 69, 18, 81, 85]) == 1\nassert only_div([42, -9, -1, 20, 27, 86, 75]) == 1\nassert only_div([19, 2, 55, -40, -18, 78, -32, 15, 54, 46, 49, 81]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 5، ثم اكتب الدالة كاملة.\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([78, 74, 36, 54, 15, 2, 65, 38, 5, 68, 32, 49])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "35066b5c71d205b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 10\nfor n in range(8, 21, 1):\n result -= n * 9\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 10\nfor n in range(8, 21, 1):\n result -= n * 9\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "1013da75de45542f", "answer": "-1628\n20", "completion": " الناتج:\n```text\n-1628\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 3\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(9))", "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(9))\n```\nالجواب:", "qhash": "56a36bd73773d6f5", "answer": "199", "completion": " الناتج:\n```text\n199\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(arr):\n if not arr:\n return []\n k = 15 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_list([48, 44, 4, 23, 21]) == [48, 44, 4, 23, 21]", "assert rotate_list([11, -3, 27, -5, 16, 36, 48, 14, 40, -5, 31]) == [14, 40, -5, 31, 11, -3, 27, -5, 16, 36, 48]", "assert rotate_list([18, 49, 31, 41, 24, 5, -9, 27, -6, 32, 16]) == [27, -6, 32, 16, 18, 49, 31, 41, 24, 5, -9]", "assert rotate_list([49, 34, -5, 13, 29, 45, 16]) == [16, 49, 34, -5, 13, 29, 45]", "assert rotate_list([29, 26]) == [26, 29]", "assert rotate_list([42, -8, 40]) == [42, -8, 40]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([48, 44, 4, 23, 21]) == [48, 44, 4, 23, 21]\nassert rotate_list([11, -3, 27, -5, 16, 36, 48, 14, 40, -5, 31]) == [14, 40, -5, 31, 11, -3, 27, -5, 16, 36, 48]\nassert rotate_list([18, 49, 31, 41, 24, 5, -9, 27, -6, 32, 16]) == [27, -6, 32, 16, 18, 49, 31, 41, 24, 5, -9]\nassert rotate_list([49, 34, -5, 13, 29, 45, 16]) == [16, 49, 34, -5, 13, 29, 45]\nassert rotate_list([29, 26]) == [26, 29]\nassert rotate_list([42, -8, 40]) == [42, -8, 40]\nassert rotate_list([]) == []", "answer": "def rotate_list(arr):\n if not arr:\n return []\n k = 15 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 15 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(arr):\n if not arr:\n return []\n k = 15 % len(arr)\n return ____\n```\nمثال: `rotate_list([48, 44, 4, 23, 21])` يجب أن تُرجع `[48, 44, 4, 23, 21]`.\nالجواب:", "qhash": "afd55b782c0fdcbd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert turn_list([27, 13, 20, 21, 15, 21, 11, 30]) == [21, 11, 30, 27, 13, 20, 21, 15]", "assert turn_list([30, 26, 12, -9, 45, 11, 21, 31, 6]) == [31, 6, 30, 26, 12, -9, 45, 11, 21]", "assert turn_list([47, 31, 50, 11, 11, 34, -4, 15, 18]) == [15, 18, 47, 31, 50, 11, 11, 34, -4]", "assert turn_list([29, 50]) == [50, 29]", "assert turn_list([26, 33, 28, 29, 1, 14, 19, 29, -1, 46]) == [46, 26, 33, 28, 29, 1, 14, 19, 29, -1]", "assert turn_list([24, 20, 47, 50, 46, 38, -9, 41, 8, 26, 13, 20]) == [20, 47, 50, 46, 38, -9, 41, 8, 26, 13, 20, 24]", "assert turn_list([]) == []"], "test_code": "assert turn_list([27, 13, 20, 21, 15, 21, 11, 30]) == [21, 11, 30, 27, 13, 20, 21, 15]\nassert turn_list([30, 26, 12, -9, 45, 11, 21, 31, 6]) == [31, 6, 30, 26, 12, -9, 45, 11, 21]\nassert turn_list([47, 31, 50, 11, 11, 34, -4, 15, 18]) == [15, 18, 47, 31, 50, 11, 11, 34, -4]\nassert turn_list([29, 50]) == [50, 29]\nassert turn_list([26, 33, 28, 29, 1, 14, 19, 29, -1, 46]) == [46, 26, 33, 28, 29, 1, 14, 19, 29, -1]\nassert turn_list([24, 20, 47, 50, 46, 38, -9, 41, 8, 26, 13, 20]) == [20, 47, 50, 46, 38, -9, 41, 8, 26, 13, 20, 24]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 11 % len(items)\n return ____\n```\nمثال: `turn_list([27, 13, 20, 21, 15, 21, 11, 30])` يجب أن تُرجع `[21, 11, 30, 27, 13, 20, 21, 15]`.\nالجواب:", "qhash": "8e54435243311777"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert roll([4, 42, 24]) == [42, 24, 4]", "assert roll([33, 17, -9, 22, 21, 7, 37, 13, 31, 47, 13]) == [7, 37, 13, 31, 47, 13, 33, 17, -9, 22, 21]", "assert roll([-2, 34, 42, 26, 37, 12, 31, 47, 39, 6, 17, 42]) == [37, 12, 31, 47, 39, 6, 17, 42, -2, 34, 42, 26]", "assert roll([0, 27, 30, -7, 46, 12, -8, 31, 27, -4]) == [-8, 31, 27, -4, 0, 27, 30, -7, 46, 12]", "assert roll([46]) == [46]", "assert roll([14]) == [14]", "assert roll([]) == []"], "test_code": "assert roll([4, 42, 24]) == [42, 24, 4]\nassert roll([33, 17, -9, 22, 21, 7, 37, 13, 31, 47, 13]) == [7, 37, 13, 31, 47, 13, 33, 17, -9, 22, 21]\nassert roll([-2, 34, 42, 26, 37, 12, 31, 47, 39, 6, 17, 42]) == [37, 12, 31, 47, 39, 6, 17, 42, -2, 34, 42, 26]\nassert roll([0, 27, 30, -7, 46, 12, -8, 31, 27, -4]) == [-8, 31, 27, -4, 0, 27, 30, -7, 46, 12]\nassert roll([46]) == [46]\nassert roll([14]) == [14]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef roll(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `roll([4, 42, 24])` يُرجع `[42, 24, 4]`.\nالجواب:", "qhash": "6a2d4b3f69bdd179"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('we apple table on') == 'dl hwwsl ahisl vu'", "assert caesar('banana') == 'ihuhuh'", "assert caesar('at winter data up cloud OK') == 'ha dpualy khah bw jsvbk OK'", "assert caesar('desert engine we cloud') == 'klzlya lunpul dl jsvbk'", "assert caesar('signal data an') == 'zpnuhs khah hu'", "assert caesar('go') == 'nv'", "assert caesar('') == ''"], "test_code": "assert caesar('we apple table on') == 'dl hwwsl ahisl vu'\nassert caesar('banana') == 'ihuhuh'\nassert caesar('at winter data up cloud OK') == 'ha dpualy khah bw jsvbk OK'\nassert caesar('desert engine we cloud') == 'klzlya lunpul dl jsvbk'\nassert caesar('signal data an') == 'zpnuhs khah hu'\nassert caesar('go') == 'nv'\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 + (7)) % 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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('we apple table on')` يجب أن تُرجع `'dl hwwsl ahisl vu'`.\nالجواب:", "qhash": "5e4ddb0ae6fbbc84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 1\n return total", "tests": ["assert sum_powers(4) == 50", "assert sum_powers(0) == 0", "assert sum_powers(6) == 105", "assert sum_powers(14) == 525", "assert sum_powers(8) == 180", "assert sum_powers(1) == 5", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(4) == 50\nassert sum_powers(0) == 0\nassert sum_powers(6) == 105\nassert sum_powers(14) == 525\nassert sum_powers(8) == 180\nassert sum_powers(1) == 5\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 1\n return total", "completion": " ```python\ndef sum_powers(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_powers(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_powers(n):\n total = 0\n for i in range(1, n):\n total += 5 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(4)` يُرجع `50`.\nالجواب:", "qhash": "09c77a1447da0a5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 4 * x ** 2 + (4) * x + (-6)", "tests": ["assert poly(7) == 218", "assert poly(-8) == 218", "assert poly(-10) == 354", "assert poly(9) == 354", "assert poly(6) == 162", "assert poly(11) == 522", "assert poly(4) == 74", "assert poly(0) == -6"], "test_code": "assert poly(7) == 218\nassert poly(-8) == 218\nassert poly(-10) == 354\nassert poly(9) == 354\nassert poly(6) == 162\nassert poly(11) == 522\nassert poly(4) == 74\nassert poly(0) == -6", "answer": "def poly(x):\n return 4 * x ** 2 + (4) * x + (-6)", "completion": " ```python\ndef poly(x):\n return 4 * x ** 2 + (4) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 4x² + 4x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(7)` يُرجع `218`.\nالجواب:", "qhash": "c2677229340b6c1a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "tests": ["assert sum_powers(3) == 6", "assert sum_powers(5) == 15", "assert sum_powers(2) == 3", "assert sum_powers(13) == 91", "assert sum_powers(3) == 6", "assert sum_powers(1) == 1", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 6\nassert sum_powers(5) == 15\nassert sum_powers(2) == 3\nassert sum_powers(13) == 91\nassert sum_powers(3) == 6\nassert sum_powers(1) == 1\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 1 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total\n```\nمثال: `sum_powers(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "65c0584c13ffec9d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'برتقال'\nprint(len(text))\nprint(text[::-1])\nprint(text.find('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'برتقال'\nprint(len(text))\nprint(text[::-1])\nprint(text.find('ت'))\n```\nالجواب:", "qhash": "5a959fdc1d3d7211", "answer": "6\nلاقترب\n2", "completion": " الناتج:\n```text\n6\nلاقترب\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('سوق حاسوب دفتر ميناء') == 1", "assert count_hits('كتاب سيارة عربية حصان عربية شمس نهار') == 2", "assert count_hits('') == 0", "assert count_hits('شمس') == 0", "assert count_hits('برتقال طائرة ماء برتقال سيارة') == 0", "assert count_hits('سلام شجرة بحر نهار لغة') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('ماء سوق نور دفتر صحراء علم حاسوب') == 1\nassert count_hits('سوق حاسوب دفتر ميناء') == 1\nassert count_hits('كتاب سيارة عربية حصان عربية شمس نهار') == 2\nassert count_hits('') == 0\nassert count_hits('شمس') == 0\nassert count_hits('برتقال طائرة ماء برتقال سيارة') == 0\nassert count_hits('سلام شجرة بحر نهار لغة') == 1\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": "a94a170de1e004c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([22, 34, 29, 38, 41]) == [29, 38, 41, 22, 34]", "assert rotate_by([28, 7, 25, 32, 49, 5]) == [28, 7, 25, 32, 49, 5]", "assert rotate_by([17, 15]) == [17, 15]", "assert rotate_by([18, -1, 28, 48, 22, 34, -9, -5, 8, -3, 43, 34]) == [18, -1, 28, 48, 22, 34, -9, -5, 8, -3, 43, 34]", "assert rotate_by([-2, 24, -2, 13, 12, 36, 6, 38, -2]) == [13, 12, 36, 6, 38, -2, -2, 24, -2]", "assert rotate_by([7, 29, 47, 49, -5, 44]) == [7, 29, 47, 49, -5, 44]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([22, 34, 29, 38, 41]) == [29, 38, 41, 22, 34]\nassert rotate_by([28, 7, 25, 32, 49, 5]) == [28, 7, 25, 32, 49, 5]\nassert rotate_by([17, 15]) == [17, 15]\nassert rotate_by([18, -1, 28, 48, 22, 34, -9, -5, 8, -3, 43, 34]) == [18, -1, 28, 48, 22, 34, -9, -5, 8, -3, 43, 34]\nassert rotate_by([-2, 24, -2, 13, 12, 36, 6, 38, -2]) == [13, 12, 36, 6, 38, -2, -2, 24, -2]\nassert rotate_by([7, 29, 47, 49, -5, 44]) == [7, 29, 47, 49, -5, 44]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([22, 34, 29, 38, 41])` يُرجع `[29, 38, 41, 22, 34]`.\nالجواب:", "qhash": "cb685cbfc2787c71"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if 'ه' in w)", "tests": ["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", "assert count_hits('') == 0"], "test_code": "assert 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\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ه» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('ليل دفتر لغة')` يُرجع `0`.\nالجواب:", "qhash": "9d81fbbf797764ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_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 how_many_div([55, 90, 35, 67, 9, 17, 8, 41, 85]) == 1", "assert how_many_div([10, 66, 82, 60, 4, -19, 24, -10, -39, -22]) == 1", "assert how_many_div([69]) == 1", "assert how_many_div([16, -16, 82, 62, 43, 85, 14, -30]) == 0", "assert how_many_div([86, 54, -12, 74, 14, 54, -40, 10, 83, 44]) == 0", "assert how_many_div([-7, -20, -9, 57, 7, 44, -26, 82]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([55, 90, 35, 67, 9, 17, 8, 41, 85]) == 1\nassert how_many_div([10, 66, 82, 60, 4, -19, 24, -10, -39, -22]) == 1\nassert how_many_div([69]) == 1\nassert how_many_div([16, -16, 82, 62, 43, 85, 14, -30]) == 0\nassert how_many_div([86, 54, -12, 74, 14, 54, -40, 10, 83, 44]) == 0\nassert how_many_div([-7, -20, -9, 57, 7, 44, -26, 82]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_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 how_many_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 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([55, 90, 35, 67, 9, 17, 8, 41, 85])` يُرجع `1`.\nالجواب:", "qhash": "10e6361a9154e7da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'cen'}", "tests": ["assert tally('signal matrix python light camel in') == {'c': 1, 'e': 1, 'n': 3}", "assert tally('at banana up pixel signal by') == {'c': 0, 'e': 1, 'n': 3}", "assert tally('rocket by orange') == {'c': 1, 'e': 2, 'n': 1}", "assert tally('planet cloud table desert light') == {'c': 1, 'e': 4, 'n': 1}", "assert tally('coffee it python up pixel we') == {'c': 1, 'e': 4, 'n': 1}", "assert tally('is is rocket stone it a') == {'c': 1, 'e': 2, 'n': 1}", "assert tally('') == {'c': 0, 'e': 0, 'n': 0}"], "test_code": "assert tally('signal matrix python light camel in') == {'c': 1, 'e': 1, 'n': 3}\nassert tally('at banana up pixel signal by') == {'c': 0, 'e': 1, 'n': 3}\nassert tally('rocket by orange') == {'c': 1, 'e': 2, 'n': 1}\nassert tally('planet cloud table desert light') == {'c': 1, 'e': 4, 'n': 1}\nassert tally('coffee it python up pixel we') == {'c': 1, 'e': 4, 'n': 1}\nassert tally('is is rocket stone it a') == {'c': 1, 'e': 2, 'n': 1}\nassert tally('') == {'c': 0, 'e': 0, 'n': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'cen'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'cen'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'e'، 'n' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('signal matrix python light camel in')` يُرجع `{'c': 1, 'e': 1, 'n': 3}`.\nالجواب:", "qhash": "cf965fb5d729af01"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 58813\nsteps = 0\nwhile n > 11:\n n = n // 7\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 58813\nsteps = 0\nwhile n > 11:\n n = n // 7\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "d808d43c0e335b1b", "answer": "3 5", "completion": " الناتج:\n```text\n3 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('pixel banana') == 'tmbip ferere'", "assert caesar('an code python python music OK') == 'er gshi tcxlsr tcxlsr qywmg OK'", "assert caesar('on light an go banana A1') == 'sr pmklx er ks ferere A1'", "assert caesar('summer apple by stone OK') == 'wyqqiv ettpi fc wxsri OK'", "assert caesar('cloud banana') == 'gpsyh ferere'", "assert caesar('a pixel') == 'e tmbip'", "assert caesar('') == ''"], "test_code": "assert caesar('pixel banana') == 'tmbip ferere'\nassert caesar('an code python python music OK') == 'er gshi tcxlsr tcxlsr qywmg OK'\nassert caesar('on light an go banana A1') == 'sr pmklx er ks ferere A1'\nassert caesar('summer apple by stone OK') == 'wyqqiv ettpi fc wxsri OK'\nassert caesar('cloud banana') == 'gpsyh ferere'\nassert caesar('a pixel') == 'e tmbip'\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 + (4)) % 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 + (4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('pixel banana')` يجب أن تُرجع `'tmbip ferere'`.\nالجواب:", "qhash": "3897a9d96af6baa8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'table'\nprint(len(word))\nprint(word.replace('l', 'X'))\nprint(word.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'table'\nprint(len(word))\nprint(word.replace('l', 'X'))\nprint(word.upper())\n```\nالجواب:", "qhash": "4f8b27381d2be44f", "answer": "5\ntabXe\nTABLE", "completion": " الناتج:\n```text\n5\ntabXe\nTABLE\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 61078\nc = 0\nwhile m > 11:\n m = m // 8\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 61078\nc = 0\nwhile m > 11:\n m = m // 8\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "3649ccbb421a6cb9", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('س'):\n count += 1\n return count", "tests": ["assert count_start('فجر برمجة سماء') == 1", "assert count_start('باب مطر ليل بحر') == 0", "assert count_start('مطر قمر بيت سفينة') == 1", "assert count_start('نور كتاب') == 0", "assert count_start('لغة حصان') == 0", "assert count_start('سماء سفينة حاسوب خبز كتاب نهر') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('فجر برمجة سماء') == 1\nassert count_start('باب مطر ليل بحر') == 0\nassert count_start('مطر قمر بيت سفينة') == 1\nassert count_start('نور كتاب') == 0\nassert count_start('لغة حصان') == 0\nassert count_start('سماء سفينة حاسوب خبز كتاب نهر') == 2\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('س'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(s):\n count = 0\n for w in s.split():\n if 'س' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «س»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(s):\n count = 0\n for w in s.split():\n if 'س' in w:\n count += 1\n return count\n```\nمثال: `count_start('فجر برمجة سماء')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "9ce1c8de1cc06f0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(17) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'FooBar', '17']", "assert fizzbuzz(12) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo']", "assert fizzbuzz(12) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo']", "assert fizzbuzz(7) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7']", "assert fizzbuzz(24) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'Foo', '21', 'Foo', '23', 'FooBar']"], "test_code": "assert fizzbuzz(17) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'FooBar', '17']\nassert fizzbuzz(12) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo']\nassert fizzbuzz(12) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo']\nassert fizzbuzz(7) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7']\nassert fizzbuzz(24) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'FooBar', '17', 'Foo', '19', 'Foo', '21', 'Foo', '23', 'FooBar']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Foo'، وإن قَبِلها على 8 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(17)` يُرجع `['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'FooBar', '9', 'Foo', '11', 'Foo', '13', 'Foo', '15', 'FooBar', '17']`.\nالجواب:", "qhash": "9fcbf3f89809c6da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 27)", "tests": ["assert select_range([17, 1, 14, 6, 31, 25, 33, 18, 5, 14]) == [42, 42, 51, 54, 75]", "assert select_range([-23, 38, -26]) == []", "assert select_range([44, -21, 44, 23, 32, 42, 56, 40]) == [69]", "assert select_range([-10, 54, -2, 16, 33, 19, -10, -20, 43]) == [48, 57]", "assert select_range([30, 55, 33, 13, 2, 0, 57, -7, -14, -22]) == [39]", "assert select_range([8, -25, -2, 37, -16, 25, 24, 46]) == [72, 75]", "assert select_range([19, -9, 21]) == [57, 63]", "assert select_range([]) == []"], "test_code": "assert select_range([17, 1, 14, 6, 31, 25, 33, 18, 5, 14]) == [42, 42, 51, 54, 75]\nassert select_range([-23, 38, -26]) == []\nassert select_range([44, -21, 44, 23, 32, 42, 56, 40]) == [69]\nassert select_range([-10, 54, -2, 16, 33, 19, -10, -20, 43]) == [48, 57]\nassert select_range([30, 55, 33, 13, 2, 0, 57, -7, -14, -22]) == [39]\nassert select_range([8, -25, -2, 37, -16, 25, 24, 46]) == [72, 75]\nassert select_range([19, -9, 21]) == [57, 63]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 27)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 3 for x in xs if 10 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 10 ≤ x ≤ 27، اضرب كلًا منها في 3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([17, 1, 14, 6, 31, 25, 33, 18, 5, 14])` يُرجع `[42, 42, 51, 54, 75]`.\nالجواب:", "qhash": "791688ff0836ec0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([41, 55, 60, 25, 43, 31]) == 60", "assert max_of_div([-6, -12, -30]) == -6", "assert max_of_div([1]) == None", "assert max_of_div([-18, 30, 18, 40, -1, -20]) == 30", "assert max_of_div([2, -6, -50, 36, 49, -36, 37]) == 36", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([41, 55, 60, 25, 43, 31]) == 60\nassert max_of_div([-6, -12, -30]) == -6\nassert max_of_div([1]) == None\nassert max_of_div([-18, 30, 18, 40, -1, -20]) == 30\nassert max_of_div([2, -6, -50, 36, 49, -36, 37]) == 36\nassert max_of_div([]) == None", "answer": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(xs):\n best = None\n for x in xs:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([41, 55, 60, 25, 43, 31])` يُرجع `60`.\nالجواب:", "qhash": "47a433c58e538a1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert game(16) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'FizzBuzz']", "assert game(0) == []", "assert game(25) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'FizzBuzz', '17', 'Fizz', '19', 'Fizz', '21', 'Fizz', '23', 'FizzBuzz', '25']", "assert game(6) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz']", "assert game(1) == ['1']"], "test_code": "assert game(16) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'FizzBuzz']\nassert game(0) == []\nassert game(25) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'FizzBuzz', '17', 'Fizz', '19', 'Fizz', '21', 'Fizz', '23', 'FizzBuzz', '25']\nassert game(6) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz']\nassert game(1) == ['1']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\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 += 'Fizz'\n if i % 8 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Fizz'، وإن قَبِلها على 8 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(16)` يُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'FizzBuzz', '9', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'FizzBuzz']`.\nالجواب:", "qhash": "c2855fb2e80df049"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ق'):\n count += 1\n return count", "tests": ["assert starts_count('قلم رمل مكتبة فجر قلم نهر') == 2", "assert starts_count('حديقة شمس عربية قلم بحر مطر') == 1", "assert starts_count('نور دفتر') == 0", "assert starts_count('جبل مطر قهوة') == 1", "assert starts_count('علم مكتبة مطر') == 0", "assert starts_count('قمر سماء رمل قهوة') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('قلم رمل مكتبة فجر قلم نهر') == 2\nassert starts_count('حديقة شمس عربية قلم بحر مطر') == 1\nassert starts_count('نور دفتر') == 0\nassert starts_count('جبل مطر قهوة') == 1\nassert starts_count('علم مكتبة مطر') == 0\nassert starts_count('قمر سماء رمل قهوة') == 2\nassert starts_count('') == 0", "answer": "def starts_count(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ق'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(sentence):\n count = 0\n for w in sentence.split():\n if 'ق' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('قلم رمل مكتبة فجر قلم نهر')` يُرجع `2`.\nالجواب:", "qhash": "af2ec3a0824e0fb9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(14))\nprint(f(14, 10))\nprint(f(f(10), 14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(f(14))\nprint(f(14, 10))\nprint(f(f(10), 14))\n```\nالجواب:", "qhash": "8194f7901282397d", "answer": "97\n88\n469", "completion": " الناتج:\n```text\n97\n88\n469\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('عربية مدينة تفاحة') == 1", "assert prefix_hits('عربية ليل جبل عمل عربية معلم عربية صديق') == 4", "assert prefix_hits('برتقال سيارة جمل برمجة عربية نهر لغة') == 1", "assert prefix_hits('طالب سوق') == 0", "assert prefix_hits('مدينة مدينة علم') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صحراء شمس سماء عربية سماء قمر') == 1\nassert prefix_hits('عربية مدينة تفاحة') == 1\nassert prefix_hits('عربية ليل جبل عمل عربية معلم عربية صديق') == 4\nassert prefix_hits('برتقال سيارة جمل برمجة عربية نهر لغة') == 1\nassert prefix_hits('طالب سوق') == 0\nassert prefix_hits('مدينة مدينة علم') == 1\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": "19e5cc2b426fa7ff"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('up winter apple desert') == 'desert/apple/winter/up'", "assert flip_words('garden planet code at in planet') == 'planet/in/at/code/planet/garden'", "assert flip_words('river banana') == 'banana/river'", "assert flip_words('garden orange to cloud river is summer go') == 'go/summer/is/river/cloud/to/orange/garden'", "assert flip_words('python garden a we') == 'we/garden/python'", "assert flip_words('banana banana matrix data it') == 'it/data/matrix/banana/banana'", "assert flip_words('cloud to table brain desert in go') == 'go/in/desert/brain/table/to/cloud'"], "test_code": "assert flip_words('up winter apple desert') == 'desert/apple/winter/up'\nassert flip_words('garden planet code at in planet') == 'planet/in/at/code/planet/garden'\nassert flip_words('river banana') == 'banana/river'\nassert flip_words('garden orange to cloud river is summer go') == 'go/summer/is/river/cloud/to/orange/garden'\nassert flip_words('python garden a we') == 'we/garden/python'\nassert flip_words('banana banana matrix data it') == 'it/data/matrix/banana/banana'\nassert flip_words('cloud to table brain desert in go') == 'go/in/desert/brain/table/to/cloud'", "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('up winter apple desert')` يجب أن تُرجع `'desert/apple/winter/up'`.\nالجواب:", "qhash": "17952e4a7c6fdee4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(18))\n```\nالجواب:", "qhash": "df2024bbb5745122", "answer": "6765", "completion": " الناتج:\n```text\n6765\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('coffee an banana data matrix orange') == 'orange_matrix_data_banana_an_coffee'", "assert flip_words('table planet apple window is winter') == 'winter_is_window_apple_planet_table'", "assert flip_words('light signal engine an by') == 'by_an_engine_signal_light'", "assert flip_words('of music in') == 'in_music_of'", "assert flip_words('pixel') == 'pixel'", "assert flip_words('desert an is river falcon garden on') == 'on_garden_falcon_river_is_an_desert'", "assert flip_words('cloud') == 'cloud'"], "test_code": "assert flip_words('coffee an banana data matrix orange') == 'orange_matrix_data_banana_an_coffee'\nassert flip_words('table planet apple window is winter') == 'winter_is_window_apple_planet_table'\nassert flip_words('light signal engine an by') == 'by_an_engine_signal_light'\nassert flip_words('of music in') == 'in_music_of'\nassert flip_words('pixel') == 'pixel'\nassert flip_words('desert an is river falcon garden on') == 'on_garden_falcon_river_is_an_desert'\nassert flip_words('cloud') == 'cloud'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `flip_words('coffee an banana data matrix orange')` يُرجع `'orange_matrix_data_banana_an_coffee'`.\nالجواب:", "qhash": "3a4e05bdbf3d4fb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 34) == 1)", "tests": ["assert rel_prime_count(88) == 41", "assert rel_prime_count(45) == 22", "assert rel_prime_count(2) == 1", "assert rel_prime_count(74) == 35", "assert rel_prime_count(120) == 56", "assert rel_prime_count(29) == 14", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(88) == 41\nassert rel_prime_count(45) == 22\nassert rel_prime_count(2) == 1\nassert rel_prime_count(74) == 35\nassert rel_prime_count(120) == 56\nassert rel_prime_count(29) == 14\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, 34) == 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, 34) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 34، أي أن القاسم المشترك الأكبر لها مع 34 يساوي 1.\nمثال: `rel_prime_count(88)` يجب أن تُرجع `41`.\nالجواب:", "qhash": "4ae88d3906f9fda8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 30728\nc = 0\nwhile n > 12:\n n = n // 3\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 30728\nc = 0\nwhile n > 12:\n n = n // 3\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "57d44e43d1711433", "answer": "4 8", "completion": " الناتج:\n```text\n4 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([45, -16, 19, 30, -7]) == 30", "assert top_divisible([-10, -40, -30]) == -10", "assert top_divisible([1, 11, 21]) == None", "assert top_divisible([-19, -26, 34]) == None", "assert top_divisible([43, 35, -38]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([45, -16, 19, 30, -7]) == 30\nassert top_divisible([-10, -40, -30]) == -10\nassert top_divisible([1, 11, 21]) == None\nassert top_divisible([-19, -26, 34]) == None\nassert top_divisible([43, 35, -38]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 10 == 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 % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(xs):\n best = 0\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef top_divisible(xs):\n best = 0\n for x in xs:\n if x % 10 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `top_divisible([45, -16, 19, 30, -7])` يجب أن تُرجع `30`.\nالجواب:", "qhash": "e40fc5c5013a08f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "tests": ["assert sum_div(83) == 714", "assert sum_div(247) == 6678", "assert sum_div(175) == 3282", "assert sum_div(112) == 1292", "assert sum_div(187) == 3830", "assert sum_div(61) == 428", "assert sum_div(1) == 0"], "test_code": "assert sum_div(83) == 714\nassert sum_div(247) == 6678\nassert sum_div(175) == 3282\nassert sum_div(112) == 1292\nassert sum_div(187) == 3830\nassert sum_div(61) == 428\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(83)` يُرجع `714`.\nالجواب:", "qhash": "b0db352e7bbb2462"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=3):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(14))\nprint(calc(14, -1))\nprint(calc(calc(-1), 14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=3):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(calc(14))\nprint(calc(14, -1))\nprint(calc(calc(-1), 14))\n```\nالجواب:", "qhash": "aab6559b14b38bb8", "answer": "-59\n-55\n-69", "completion": " الناتج:\n```text\n-59\n-55\n-69\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 42) == 1)", "tests": ["assert count_gcd1(39) == 11", "assert count_gcd1(124) == 35", "assert count_gcd1(48) == 14", "assert count_gcd1(44) == 13", "assert count_gcd1(50) == 14", "assert count_gcd1(11) == 3", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(39) == 11\nassert count_gcd1(124) == 35\nassert count_gcd1(48) == 14\nassert count_gcd1(44) == 13\nassert count_gcd1(50) == 14\nassert count_gcd1(11) == 3\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, 42) == 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, 42) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 42) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(39)` يُرجع `11`.\nالجواب:", "qhash": "4a3663aad385681c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['banana', 'planet', 'orange', 'pixel', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['banana', 'planet', 'orange', 'pixel', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "57f0881cb378e660", "answer": "['pixel', 'table', 'banana', 'planet', 'orange']\n['planet', 'orange', 'banana']", "completion": " الناتج:\n```text\n['pixel', 'table', 'banana', 'planet', 'orange']\n['planet', 'orange', 'banana']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 77) == 1)", "tests": ["assert coprimes(118) == 93", "assert coprimes(46) == 36", "assert coprimes(120) == 94", "assert coprimes(180) == 141", "assert coprimes(159) == 125", "assert coprimes(11) == 9", "assert coprimes(1) == 1"], "test_code": "assert coprimes(118) == 93\nassert coprimes(46) == 36\nassert coprimes(120) == 94\nassert coprimes(180) == 141\nassert coprimes(159) == 125\nassert coprimes(11) == 9\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, 77) == 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, 77) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 77) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(118)` يُرجع `93`.\nالجواب:", "qhash": "68b5b3168587277e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'وليد': 43, 'مريم': 30, 'منى': 27, 'زينب': 4}\npoints['منى'] += 14\npoints['سعيد'] = 3\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 = {'وليد': 43, 'مريم': 30, 'منى': 27, 'زينب': 4}\npoints['منى'] += 14\npoints['سعيد'] = 3\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": "51bf270ccaaa7587", "answer": "5\nوليد\n121\n[('سعيد', 3), ('زينب', 4)]", "completion": " الناتج:\n```text\n5\nوليد\n121\n[('سعيد', 3), ('زينب', 4)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [3, 24, 1, 39, 12, 33, 19, 22, 6]\nprint(nums[2:6])\nprint(nums[::3])\nprint(sum(nums[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [3, 24, 1, 39, 12, 33, 19, 22, 6]\nprint(nums[2:6])\nprint(nums[::3])\nprint(sum(nums[2:6]))\n```\nالجواب:", "qhash": "cd9e19c63218a5e2", "answer": "[1, 39, 12, 33]\n[3, 39, 19]\n85", "completion": " الناتج:\n```text\n[1, 39, 12, 33]\n[3, 39, 19]\n85\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 997", "tests": ["assert step_product(9) == 945", "assert step_product(29) == 18", "assert step_product(51) == 306", "assert step_product(16) == 976", "assert step_product(57) == 418", "assert step_product(2) == 2", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 945\nassert step_product(29) == 18\nassert step_product(51) == 306\nassert step_product(16) == 976\nassert step_product(57) == 418\nassert step_product(2) == 2\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 997", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(9)` يُرجع `945`.\nالجواب:", "qhash": "9cb964f35014f3a8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جبل تفاحة وردة') == 1", "assert count_initial('جبل جمل طائرة صحراء') == 2", "assert count_initial('جمل جمل لغة جمل دفتر') == 3", "assert count_initial('برمجة مدينة قهوة جبل صحراء باب جبل جبل') == 3", "assert count_initial('شجرة لغة برتقال معلم جبل مدرسة') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('جمل جمل مطر ماء') == 2\nassert count_initial('جبل تفاحة وردة') == 1\nassert count_initial('جبل جمل طائرة صحراء') == 2\nassert count_initial('جمل جمل لغة جمل دفتر') == 3\nassert count_initial('برمجة مدينة قهوة جبل صحراء باب جبل جبل') == 3\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 'ج' in w:\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 'ج' in w:\n count += 1\n return count\n```\nمثال: `count_initial('جمل جمل مطر ماء')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "db6fabd168456b78"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 2 * x ** 2 + (8) * x + (-7)", "tests": ["assert poly(6) == 113", "assert poly(-11) == 147", "assert poly(-14) == 273", "assert poly(15) == 563", "assert poly(-10) == 113", "assert poly(-11) == 147", "assert poly(7) == 147", "assert poly(0) == -7"], "test_code": "assert poly(6) == 113\nassert poly(-11) == 147\nassert poly(-14) == 273\nassert poly(15) == 563\nassert poly(-10) == 113\nassert poly(-11) == 147\nassert poly(7) == 147\nassert poly(0) == -7", "answer": "def poly(x):\n return 2 * x ** 2 + (8) * x + (-7)", "completion": " ```python\ndef poly(x):\n return 2 * x ** 2 + (8) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 2x² + 8x - 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(6)` يُرجع `113`.\nالجواب:", "qhash": "628a3ffd95020f4d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'وليد': 34, 'باسل': 30, 'مريم': 20}\nscores['مريم'] += 9\nscores['منى'] = 17\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هشام', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nscores = {'وليد': 34, 'باسل': 30, 'مريم': 20}\nscores['مريم'] += 9\nscores['منى'] = 17\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('هشام', -1))\n```\nالجواب:", "qhash": "bf29d3bcf4c05fe1", "answer": "4\nوليد\n110\n-1", "completion": " الناتج:\n```text\n4\nوليد\n110\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 19:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([8, 4, 3, 3, 10]) == [8, 12, 15, 18, 0]", "assert capped_cumsum([-1, 17, 4, 12, -4, 11]) == [-1, 16, 0, 12, 8, 19]", "assert capped_cumsum([14, -1, 4, 16, 10, 17, -9, -3]) == [14, 13, 17, 0, 10, 0, -9, -12]", "assert capped_cumsum([-6, 5, -3, 11, 0, 4, 18, 18]) == [-6, -1, -4, 7, 7, 11, 0, 18]", "assert capped_cumsum([-5, 14, 9, -7, -5, 7, -8, 12]) == [-5, 9, 18, 11, 6, 13, 5, 17]", "assert capped_cumsum([16, -8, -1, 7, 11, 6, 10, -6, 2, 4]) == [16, 8, 7, 14, 0, 6, 16, 10, 12, 16]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([8, 4, 3, 3, 10]) == [8, 12, 15, 18, 0]\nassert capped_cumsum([-1, 17, 4, 12, -4, 11]) == [-1, 16, 0, 12, 8, 19]\nassert capped_cumsum([14, -1, 4, 16, 10, 17, -9, -3]) == [14, 13, 17, 0, 10, 0, -9, -12]\nassert capped_cumsum([-6, 5, -3, 11, 0, 4, 18, 18]) == [-6, -1, -4, 7, 7, 11, 0, 18]\nassert capped_cumsum([-5, 14, 9, -7, -5, 7, -8, 12]) == [-5, 9, 18, 11, 6, 13, 5, 17]\nassert capped_cumsum([16, -8, -1, 7, 11, 6, 10, -6, 2, 4]) == [16, 8, 7, 14, 0, 6, 16, 10, 12, 16]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 19:\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 > 19:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 19 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([8, 4, 3, 3, 10])` يُرجع `[8, 12, 15, 18, 0]`.\nالجواب:", "qhash": "1a51927b05fdac57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حصان برمجة جمل رمل لغة برتقال سماء رمل') == 2", "assert words_starting('مدينة رمل شمس نهر رمل') == 2", "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('حصان برمجة جمل رمل لغة برتقال سماء رمل') == 2\nassert words_starting('مدينة رمل شمس نهر رمل') == 2\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('حصان برمجة جمل رمل لغة برتقال سماء رمل')` يُرجع `2`.\nالجواب:", "qhash": "63f86657f243dd4b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 231\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 = 231\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": "bf5ffd02ee445d62", "answer": "127", "completion": " الناتج:\n```text\n127\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [35, -2, -6, -5, 20, 32, 16, 32, 4]\nprint(nums[1:9])\nprint(nums[::3])\nprint(sum(nums[1:9]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [35, -2, -6, -5, 20, 32, 16, 32, 4]\nprint(nums[1:9])\nprint(nums[::3])\nprint(sum(nums[1:9]))\n```\nالجواب:", "qhash": "25910683c3984d98", "answer": "[-2, -6, -5, 20, 32, 16, 32, 4]\n[35, -5, 16]\n91", "completion": " الناتج:\n```text\n[-2, -6, -5, 20, 32, 16, 32, 4]\n[35, -5, 16]\n91\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29", "tests": ["assert mfact(7) == 21", "assert mfact(46) == 4", "assert mfact(54) == 12", "assert mfact(0) == 1", "assert mfact(60) == 24", "assert mfact(1) == 1", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 21\nassert mfact(46) == 4\nassert mfact(54) == 12\nassert mfact(0) == 1\nassert mfact(60) == 24\nassert mfact(1) == 1\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 4)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(7)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "f15ae9b3d2c11844"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 35) == 1)", "tests": ["assert count_gcd1(37) == 26", "assert count_gcd1(97) == 67", "assert count_gcd1(114) == 79", "assert count_gcd1(10) == 7", "assert count_gcd1(89) == 62", "assert count_gcd1(14) == 10", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(37) == 26\nassert count_gcd1(97) == 67\nassert count_gcd1(114) == 79\nassert count_gcd1(10) == 7\nassert count_gcd1(89) == 62\nassert count_gcd1(14) == 10\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, 35) == 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, 35) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 35، أي أن القاسم المشترك الأكبر لها مع 35 يساوي 1.\nمثال: `count_gcd1(37)` يجب أن تُرجع `26`.\nالجواب:", "qhash": "5ddc1809f0188c5d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=5):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(calc(12))\nprint(calc(12, 6))\nprint(calc(calc(6), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(calc(12))\nprint(calc(12, 6))\nprint(calc(calc(6), 12))\n```\nالجواب:", "qhash": "11fa9a830c2946a9", "answer": "19\n18\n31", "completion": " الناتج:\n```text\n19\n18\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 64298\nc = 0\nwhile x > 14:\n x = x // 8\n c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 64298\nc = 0\nwhile x > 14:\n x = x // 8\n c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "78d5e4955c33302f", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قمر سوق عربية عربية معلم مكتبة عمل قلم') == 3", "assert count_start('ماء طائرة برمجة مكتبة') == 0", "assert count_start('عربية نهر علم لغة عمل وردة قلم') == 3", "assert count_start('وردة تفاحة برتقال وردة') == 0", "assert count_start('سماء حصان') == 0", "assert count_start('مكتبة خبز باب عربية عربية') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('قمر سوق عربية عربية معلم مكتبة عمل قلم') == 3\nassert count_start('ماء طائرة برمجة مكتبة') == 0\nassert count_start('عربية نهر علم لغة عمل وردة قلم') == 3\nassert count_start('وردة تفاحة برتقال وردة') == 0\nassert count_start('سماء حصان') == 0\nassert count_start('مكتبة خبز باب عربية عربية') == 2\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.split():\n if w.endswith('ع'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ع»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ع'):\n count += 1\n return count\n```\nمثال: `count_start('قمر سوق عربية عربية معلم مكتبة عمل قلم')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "6f79abbb29a90bca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 55:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([26, 12, 12, 18, 3, 22, 2, 14, 17, 29]) == [26, 38, 50, 0, 3, 25, 27, 41, 0, 29]", "assert running_sum([-3, 33, 53, 14, 48]) == [-3, 30, 0, 14, 0]", "assert running_sum([]) == []", "assert running_sum([51, 27, 40, 38, 31, 24, -2]) == [51, 0, 40, 0, 31, 55, 53]", "assert running_sum([]) == []", "assert running_sum([16, 48, 25, 50, 36, 42, 9]) == [16, 0, 25, 0, 36, 0, 9]", "assert running_sum([]) == []"], "test_code": "assert running_sum([26, 12, 12, 18, 3, 22, 2, 14, 17, 29]) == [26, 38, 50, 0, 3, 25, 27, 41, 0, 29]\nassert running_sum([-3, 33, 53, 14, 48]) == [-3, 30, 0, 14, 0]\nassert running_sum([]) == []\nassert running_sum([51, 27, 40, 38, 31, 24, -2]) == [51, 0, 40, 0, 31, 55, 53]\nassert running_sum([]) == []\nassert running_sum([16, 48, 25, 50, 36, 42, 9]) == [16, 0, 25, 0, 36, 0, 9]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 55:\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 > 55:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 55 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([26, 12, 12, 18, 3, 22, 2, 14, 17, 29])` يجب أن تُرجع `[26, 38, 50, 0, 3, 25, 27, 41, 0, 29]`.\nالجواب:", "qhash": "f5bfd6c3dfe15a16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 41", "tests": ["assert rec_prod(8) == 15", "assert rec_prod(21) == 17", "assert rec_prod(4) == 8", "assert rec_prod(33) == 28", "assert rec_prod(21) == 17", "assert rec_prod(34) == 24", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(8) == 15\nassert rec_prod(21) == 17\nassert rec_prod(4) == 8\nassert rec_prod(33) == 28\nassert rec_prod(21) == 17\nassert rec_prod(34) == 24\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 41", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 41 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(8)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "ac01c7fc2b01775c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return 5 * x ** 2 + (5) * x + (-7)", "tests": ["assert p(9) == 443", "assert p(18) == 1703", "assert p(-3) == 23", "assert p(16) == 1353", "assert p(8) == 353", "assert p(16) == 1353", "assert p(7) == 273", "assert p(0) == -7"], "test_code": "assert p(9) == 443\nassert p(18) == 1703\nassert p(-3) == 23\nassert p(16) == 1353\nassert p(8) == 353\nassert p(16) == 1353\nassert p(7) == 273\nassert p(0) == -7", "answer": "def p(x):\n return 5 * x ** 2 + (5) * x + (-7)", "completion": " ```python\ndef p(x):\n return 5 * x ** 2 + (5) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود 5x² + 5x - 7 عند العدد الصحيح x.\nمثال: `p(9)` يجب أن تُرجع `443`.\nالجواب:", "qhash": "f03de161ebd040c6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(28) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'Hi', 'Yo', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'Hi', '21', 'Yo', '23', '24', 'Hi', '26', '27', '28']", "assert fizzbuzz(1) == ['1']", "assert fizzbuzz(4) == ['1', '2', '3', '4']", "assert fizzbuzz(8) == ['1', '2', '3', '4', 'Hi', '6', '7', '8']", "assert fizzbuzz(21) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'Hi', 'Yo', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'Hi', '21']"], "test_code": "assert fizzbuzz(28) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'Hi', 'Yo', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'Hi', '21', 'Yo', '23', '24', 'Hi', '26', '27', '28']\nassert fizzbuzz(1) == ['1']\nassert fizzbuzz(4) == ['1', '2', '3', '4']\nassert fizzbuzz(8) == ['1', '2', '3', '4', 'Hi', '6', '7', '8']\nassert fizzbuzz(21) == ['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'Hi', 'Yo', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'Hi', '21']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Hi'\n if i % 11 == 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 % 5 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Hi'، وإن قَبِلها على 11 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(28)` يُرجع `['1', '2', '3', '4', 'Hi', '6', '7', '8', '9', 'Hi', 'Yo', '12', '13', '14', 'Hi', '16', '17', '18', '19', 'Hi', '21', 'Yo', '23', '24', 'Hi', '26', '27', '28']`.\nالجواب:", "qhash": "90c71d5f8e5384ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [26, -1, 12, 31, 36]\nprint(lst[0:5])\nprint(lst[::2])\nprint(len(lst[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [26, -1, 12, 31, 36]\nprint(lst[0:5])\nprint(lst[::2])\nprint(len(lst[0:5]))\n```\nالجواب:", "qhash": "786d796bd7471a68", "answer": "[26, -1, 12, 31, 36]\n[26, 12, 36]\n5", "completion": " الناتج:\n```text\n[26, -1, 12, 31, 36]\n[26, 12, 36]\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 5 * x ** 2 + (9) * x + (-4)", "tests": ["assert poly(9) == 482", "assert poly(1) == 10", "assert poly(8) == 388", "assert poly(-16) == 1132", "assert poly(7) == 304", "assert poly(-13) == 724", "assert poly(-11) == 502", "assert poly(0) == -4"], "test_code": "assert poly(9) == 482\nassert poly(1) == 10\nassert poly(8) == 388\nassert poly(-16) == 1132\nassert poly(7) == 304\nassert poly(-13) == 724\nassert poly(-11) == 502\nassert poly(0) == -4", "answer": "def poly(x):\n return 5 * x ** 2 + (9) * x + (-4)", "completion": " ```python\ndef poly(x):\n return 5 * x ** 2 + (9) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 5x² + 9x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(9)` يُرجع `482`.\nالجواب:", "qhash": "c97b79e0f14d1fee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 159:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([56, 18, 1, 26, 34, 62, 41, 65, 70]) == [56, 74, 75, 101, 135, 0, 41, 106, 0]", "assert rolling_total([21, 42, 142]) == [21, 63, 0]", "assert rolling_total([48, 111]) == [48, 159]", "assert rolling_total([40, 55, 45, 62, 66, 115]) == [40, 95, 140, 0, 66, 0]", "assert rolling_total([73, 98, 9, 115]) == [73, 0, 9, 124]", "assert rolling_total([24, 130, 5]) == [24, 154, 159]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([56, 18, 1, 26, 34, 62, 41, 65, 70]) == [56, 74, 75, 101, 135, 0, 41, 106, 0]\nassert rolling_total([21, 42, 142]) == [21, 63, 0]\nassert rolling_total([48, 111]) == [48, 159]\nassert rolling_total([40, 55, 45, 62, 66, 115]) == [40, 95, 140, 0, 66, 0]\nassert rolling_total([73, 98, 9, 115]) == [73, 0, 9, 124]\nassert rolling_total([24, 130, 5]) == [24, 154, 159]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 159:\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 > 159:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 159 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([56, 18, 1, 26, 34, 62, 41, 65, 70])` يُرجع `[56, 74, 75, 101, 135, 0, 41, 106, 0]`.\nالجواب:", "qhash": "f70d8f6d2efbe8c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(55) == 756", "assert sum_multiples(152) == 5700", "assert sum_multiples(10) == 20", "assert sum_multiples(62) == 930", "assert sum_multiples(98) == 2352", "assert sum_multiples(244) == 14762", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(55) == 756\nassert sum_multiples(152) == 5700\nassert sum_multiples(10) == 20\nassert sum_multiples(62) == 930\nassert sum_multiples(98) == 2352\nassert sum_multiples(244) == 14762\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 % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 14.\nمثال: `sum_multiples(55)` يجب أن تُرجع `756`.\nالجواب:", "qhash": "d2e3e57f187877eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([-10, 33, -23, 35, 28, 30]) == None", "assert top_divisible([-32, -24, -32]) == -24", "assert top_divisible([1]) == None", "assert top_divisible([17, -32, -5, 13, 8, -13, -20, -18]) == 8", "assert top_divisible([-40, 9, 20]) == -40", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-10, 33, -23, 35, 28, 30]) == None\nassert top_divisible([-32, -24, -32]) == -24\nassert top_divisible([1]) == None\nassert top_divisible([17, -32, -5, 13, 8, -13, -20, -18]) == 8\nassert top_divisible([-40, 9, 20]) == -40\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(values):\n best = 0\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 top_divisible(values):\n best = 0\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مثال: `top_divisible([-10, 33, -23, 35, 28, 30])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "517465911bbf87af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'gnr'}", "tests": ["assert char_counts('code') == {'g': 0, 'n': 0, 'r': 0}", "assert char_counts('winter river python matrix a rocket') == {'g': 0, 'n': 2, 'r': 5}", "assert char_counts('table is camel') == {'g': 0, 'n': 0, 'r': 0}", "assert char_counts('music at apple garden') == {'g': 1, 'n': 1, 'r': 1}", "assert char_counts('is matrix engine brain') == {'g': 1, 'n': 3, 'r': 2}", "assert char_counts('falcon python music matrix signal stone') == {'g': 1, 'n': 4, 'r': 1}", "assert char_counts('') == {'g': 0, 'n': 0, 'r': 0}"], "test_code": "assert char_counts('code') == {'g': 0, 'n': 0, 'r': 0}\nassert char_counts('winter river python matrix a rocket') == {'g': 0, 'n': 2, 'r': 5}\nassert char_counts('table is camel') == {'g': 0, 'n': 0, 'r': 0}\nassert char_counts('music at apple garden') == {'g': 1, 'n': 1, 'r': 1}\nassert char_counts('is matrix engine brain') == {'g': 1, 'n': 3, 'r': 2}\nassert char_counts('falcon python music matrix signal stone') == {'g': 1, 'n': 4, 'r': 1}\nassert char_counts('') == {'g': 0, 'n': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'gnr'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'gnr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'g'، 'n'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('code')` يجب أن تُرجع `{'g': 0, 'n': 0, 'r': 0}`.\nالجواب:", "qhash": "77517615d69c6567"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [6, 19, 17, -13, 11]\nprint(sorted(nums, key=lambda x: (abs(x - 17), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [6, 19, 17, -13, 11]\nprint(sorted(nums, key=lambda x: (abs(x - 17), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ce63db72af805c95", "answer": "[17, 19, 11, 6, -13]\n[19, 17, 11]", "completion": " الناتج:\n```text\n[17, 19, 11, 6, -13]\n[19, 17, 11]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(273) == 8025", "assert sum_multiples(80) == 693", "assert sum_multiples(72) == 616", "assert sum_multiples(123) == 1720", "assert sum_multiples(274) == 8298", "assert sum_multiples(50) == 306", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(273) == 8025\nassert sum_multiples(80) == 693\nassert sum_multiples(72) == 616\nassert sum_multiples(123) == 1720\nassert sum_multiples(274) == 8298\nassert sum_multiples(50) == 306\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 % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(273)` يُرجع `8025`.\nالجواب:", "qhash": "2a84d6a3530017c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 10007", "tests": ["assert prod_mod(8) == 384", "assert prod_mod(26) == 3802", "assert prod_mod(34) == 3237", "assert prod_mod(43) == 9429", "assert prod_mod(35) == 3153", "assert prod_mod(32) == 6276", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(8) == 384\nassert prod_mod(26) == 3802\nassert prod_mod(34) == 3237\nassert prod_mod(43) == 9429\nassert prod_mod(35) == 3153\nassert prod_mod(32) == 6276\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 10007", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(8)` يجب أن تُرجع `384`.\nالجواب:", "qhash": "14140544fba0df55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 19\nfor n in range(6, 22, 2):\n total -= n * 3\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 19\nfor n in range(6, 22, 2):\n total -= n * 3\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "a6abc08057c2d27d", "answer": "-293\n20", "completion": " الناتج:\n```text\n-293\n20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_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 largest_div([41, 53, -30, 38, 51, 40, -28]) == None", "assert largest_div([-36, -45, -45]) == -36", "assert largest_div([1, 10, 19, 28]) == None", "assert largest_div([29]) == None", "assert largest_div([32, -32, -39, -9, 46, 5, -31, -14, -26]) == -9", "assert largest_div([]) == None"], "test_code": "assert largest_div([41, 53, -30, 38, 51, 40, -28]) == None\nassert largest_div([-36, -45, -45]) == -36\nassert largest_div([1, 10, 19, 28]) == None\nassert largest_div([29]) == None\nassert largest_div([32, -32, -39, -9, 46, 5, -31, -14, -26]) == -9\nassert largest_div([]) == None", "answer": "def largest_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 largest_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 largest_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 largest_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للتوضيح: الاستدعاء `largest_div([41, 53, -30, 38, 51, 40, -28])` يُرجع `None`.\nالجواب:", "qhash": "b80e373b070be9b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([18, 19, 52, -1, -23, 2, 29, 32, 17]) == None", "assert find_max_div([-15, -20, -10]) == -10", "assert find_max_div([1, 6]) == None", "assert find_max_div([-3, -26, -8, 32, -14, -23, -30, -29]) == -30", "assert find_max_div([25, -43, -22, 28, 32, 47, 23]) == 25", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([18, 19, 52, -1, -23, 2, 29, 32, 17]) == None\nassert find_max_div([-15, -20, -10]) == -10\nassert find_max_div([1, 6]) == None\nassert find_max_div([-3, -26, -8, 32, -14, -23, -30, -29]) == -30\nassert find_max_div([25, -43, -22, 28, 32, 47, 23]) == 25\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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مثال: `find_max_div([18, 19, 52, -1, -23, 2, 29, 32, 17])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "f8d2aad950aaee6c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('code desert Hello') == 'htij ijxjwy Hjqqt'", "assert decode('coffee music in apple !') == 'htkkjj rzxnh ns fuuqj !'", "assert decode('up') == 'zu'", "assert decode('planet OK') == 'uqfsjy OK'", "assert decode('rocket music on window') == 'wthpjy rzxnh ts bnsitb'", "assert decode('music it table Hello') == 'rzxnh ny yfgqj Hjqqt'", "assert decode('') == ''"], "test_code": "assert decode('code desert Hello') == 'htij ijxjwy Hjqqt'\nassert decode('coffee music in apple !') == 'htkkjj rzxnh ns fuuqj !'\nassert decode('up') == 'zu'\nassert decode('planet OK') == 'uqfsjy OK'\nassert decode('rocket music on window') == 'wthpjy rzxnh ts bnsitb'\nassert decode('music it table Hello') == 'rzxnh ny yfgqj Hjqqt'\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 + (-21)) % 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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('code desert Hello')` يُرجع `'htij ijxjwy Hjqqt'`.\nالجواب:", "qhash": "5e704700fab87335"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 97", "tests": ["assert step_product(11) == 37", "assert step_product(27) == 72", "assert step_product(46) == 73", "assert step_product(53) == 54", "assert step_product(53) == 54", "assert step_product(41) == 7", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 37\nassert step_product(27) == 72\nassert step_product(46) == 73\nassert step_product(53) == 54\nassert step_product(53) == 54\nassert step_product(41) == 7\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 97", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(11)` يجب أن تُرجع `37`.\nالجواب:", "qhash": "df7aa158b8e37d79"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "tests": ["assert total_pow(4) == 1416", "assert total_pow(12) == 242840", "assert total_pow(14) == 510748", "assert total_pow(10) == 101332", "assert total_pow(9) == 61332", "assert total_pow(1) == 4", "assert total_pow(0) == 0"], "test_code": "assert total_pow(4) == 1416\nassert total_pow(12) == 242840\nassert total_pow(14) == 510748\nassert total_pow(10) == 101332\nassert total_pow(9) == 61332\nassert total_pow(1) == 4\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 4\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 4\n return total\n```\nمثال: `total_pow(4)` يجب أن تُرجع `1416`.\nالجواب:", "qhash": "bc3ff945e3762d0c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'python'\nprint(word.split('_'))\nprint(word.count('p'))\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'python'\nprint(word.split('_'))\nprint(word.count('p'))\nprint(len(word))\n```\nالجواب:", "qhash": "5ee72f80aa116e3e", "answer": "['python']\n1\n6", "completion": " الناتج:\n```text\n['python']\n1\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 77", "tests": ["assert digit_power(90625) == 22", "assert digit_power(888602) == 32", "assert digit_power(291296) == 29", "assert digit_power(805684) == 31", "assert digit_power(460995) == 33", "assert digit_power(318735) == 27", "assert digit_power(814628) == 29", "assert digit_power(0) == 0"], "test_code": "assert digit_power(90625) == 22\nassert digit_power(888602) == 32\nassert digit_power(291296) == 29\nassert digit_power(805684) == 31\nassert digit_power(460995) == 33\nassert digit_power(318735) == 27\nassert digit_power(814628) == 29\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 77", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 1 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 77.\nمثال: `digit_power(90625)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "b1a2792aff6ca018"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'banana_cloud'\nprint(s.capitalize())\nprint(s[-4:])\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'banana_cloud'\nprint(s.capitalize())\nprint(s[-4:])\nprint(s.split('_'))\n```\nالجواب:", "qhash": "4a365e57eec011fb", "answer": "Banana_cloud\nloud\n['banana', 'cloud']", "completion": " الناتج:\n```text\nBanana_cloud\nloud\n['banana', 'cloud']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'banana'\nprint(word.upper())\nprint(word[::-1])\nprint(word[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'banana'\nprint(word.upper())\nprint(word[::-1])\nprint(word[-4:])\n```\nالجواب:", "qhash": "3fc039e0d0b6996e", "answer": "BANANA\nananab\nnana", "completion": " الناتج:\n```text\nBANANA\nananab\nnana\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([54, 85, 2, 45, 49, 54, 44]) == [54, 139, 141, 0, 49, 103, 147]", "assert running_sum([122]) == [122]", "assert running_sum([109, 46, 80, 94, 112, 168, 96, 116, 115, 22]) == [109, 155, 0, 94, 0, 168, 0, 116, 0, 22]", "assert running_sum([114, 93]) == [114, 0]", "assert running_sum([135, 24, 18, 88, 153, -3, 146, 117, 14]) == [135, 159, 177, 0, 153, 150, 0, 117, 131]", "assert running_sum([125, 150]) == [125, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([54, 85, 2, 45, 49, 54, 44]) == [54, 139, 141, 0, 49, 103, 147]\nassert running_sum([122]) == [122]\nassert running_sum([109, 46, 80, 94, 112, 168, 96, 116, 115, 22]) == [109, 155, 0, 94, 0, 168, 0, 116, 0, 22]\nassert running_sum([114, 93]) == [114, 0]\nassert running_sum([135, 24, 18, 88, 153, -3, 146, 117, 14]) == [135, 159, 177, 0, 153, 150, 0, 117, 131]\nassert running_sum([125, 150]) == [125, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\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 > 178:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 178 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([54, 85, 2, 45, 49, 54, 44])` يجب أن تُرجع `[54, 139, 141, 0, 49, 103, 147]`.\nالجواب:", "qhash": "9703de87f4d03f79"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 5) // 3 for x in range(-1, 11) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 5) // 3 for x in range(-1, 11) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "35aecb5b06d5d290", "answer": "[1, 2, 3, 4]\n4 10", "completion": " الناتج:\n```text\n[1, 2, 3, 4]\n4 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert spin([11, 30, 4, 49, 41, 34]) == [30, 4, 49, 41, 34, 11]", "assert spin([36, -6]) == [-6, 36]", "assert spin([14, -6, 25, -2, 44, 6]) == [-6, 25, -2, 44, 6, 14]", "assert spin([33, -6, 38, 8]) == [-6, 38, 8, 33]", "assert spin([4, 10, 23, 23, 22, 33, -6, 46, 38, 49]) == [10, 23, 23, 22, 33, -6, 46, 38, 49, 4]", "assert spin([33, 3, -6, 1, -4, 45, 35]) == [3, -6, 1, -4, 45, 35, 33]", "assert spin([]) == []"], "test_code": "assert spin([11, 30, 4, 49, 41, 34]) == [30, 4, 49, 41, 34, 11]\nassert spin([36, -6]) == [-6, 36]\nassert spin([14, -6, 25, -2, 44, 6]) == [-6, 25, -2, 44, 6, 14]\nassert spin([33, -6, 38, 8]) == [-6, 38, 8, 33]\nassert spin([4, 10, 23, 23, 22, 33, -6, 46, 38, 49]) == [10, 23, 23, 22, 33, -6, 46, 38, 49, 4]\nassert spin([33, 3, -6, 1, -4, 45, 35]) == [3, -6, 1, -4, 45, 35, 33]\nassert spin([]) == []", "answer": "def spin(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef spin(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `spin([11, 30, 4, 49, 41, 34])` يُرجع `[30, 4, 49, 41, 34, 11]`.\nالجواب:", "qhash": "1bee32d75d59b9c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 13\nfor j in range(-5, 13, 4):\n total += j * 2\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 13\nfor j in range(-5, 13, 4):\n total += j * 2\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "652ada5b5d53d518", "answer": "43\n11", "completion": " الناتج:\n```text\n43\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_letter", "reference": "def count_letter(text):\n return sum(1 for w in text.split() if 'ب' in w)", "tests": ["assert count_letter('شمس صحراء علم حديقة كتاب بيت عربية جبل') == 4", "assert count_letter('مدينة بحر نور حديقة برتقال') == 2", "assert count_letter('سيارة') == 0", "assert count_letter('بيت') == 1", "assert count_letter('جمل ماء سيارة قلم مدرسة حصان') == 0", "assert count_letter('صديق سوق قلم حديقة عربية سوق') == 1", "assert count_letter('بحر وردة مدينة ميناء نهر سماء سلام سماء') == 1", "assert count_letter('') == 0"], "test_code": "assert count_letter('شمس صحراء علم حديقة كتاب بيت عربية جبل') == 4\nassert count_letter('مدينة بحر نور حديقة برتقال') == 2\nassert count_letter('سيارة') == 0\nassert count_letter('بيت') == 1\nassert count_letter('جمل ماء سيارة قلم مدرسة حصان') == 0\nassert count_letter('صديق سوق قلم حديقة عربية سوق') == 1\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('شمس صحراء علم حديقة كتاب بيت عربية جبل')` يجب أن تُرجع `4`.\nالجواب:", "qhash": "88f3797cfbe6be56"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('go planet vector rocket Hello') == 'ck lhwjap raypkn nkygap Hahhk'", "assert caesar('python camel camel at') == 'lupdkj ywiah ywiah wp'", "assert caesar('data winter at') == 'zwpw sejpan wp'", "assert caesar('on signal python window music') == 'kj oecjwh lupdkj sejzks iqoey'", "assert caesar('code banana of by go Hello') == 'ykza xwjwjw kb xu ck Hahhk'", "assert caesar('signal desert camel engine music') == 'oecjwh zaoanp ywiah ajceja iqoey'", "assert caesar('') == ''"], "test_code": "assert caesar('go planet vector rocket Hello') == 'ck lhwjap raypkn nkygap Hahhk'\nassert caesar('python camel camel at') == 'lupdkj ywiah ywiah wp'\nassert caesar('data winter at') == 'zwpw sejpan wp'\nassert caesar('on signal python window music') == 'kj oecjwh lupdkj sejzks iqoey'\nassert caesar('code banana of by go Hello') == 'ykza xwjwjw kb xu ck Hahhk'\nassert caesar('signal desert camel engine music') == 'oecjwh zaoanp ywiah ajceja iqoey'\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 + (-4)) % 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 + (-4)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `caesar(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 4 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('go planet vector rocket Hello')` يجب أن تُرجع `'ck lhwjap raypkn nkygap Hahhk'`.\nالجواب:", "qhash": "951477e0afca1123"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 50) == 1)", "tests": ["assert coprime_count(122) == 49", "assert coprime_count(22) == 9", "assert coprime_count(175) == 70", "assert coprime_count(91) == 37", "assert coprime_count(104) == 42", "assert coprime_count(75) == 30", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(122) == 49\nassert coprime_count(22) == 9\nassert coprime_count(175) == 70\nassert coprime_count(91) == 37\nassert coprime_count(104) == 42\nassert coprime_count(75) == 30\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, 50) == 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, 50) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 50، أي أن القاسم المشترك الأكبر لها مع 50 يساوي 1.\nمثال: `coprime_count(122)` يجب أن تُرجع `49`.\nالجواب:", "qhash": "fb1f397a3e42186b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 64) == 1)", "tests": ["assert rel_prime_count(132) == 66", "assert rel_prime_count(147) == 74", "assert rel_prime_count(70) == 35", "assert rel_prime_count(116) == 58", "assert rel_prime_count(50) == 25", "assert rel_prime_count(12) == 6", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(132) == 66\nassert rel_prime_count(147) == 74\nassert rel_prime_count(70) == 35\nassert rel_prime_count(116) == 58\nassert rel_prime_count(50) == 25\nassert rel_prime_count(12) == 6\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, 64) == 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, 64) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 64، أي أن القاسم المشترك الأكبر لها مع 64 يساوي 1.\nمثال: `rel_prime_count(132)` يجب أن تُرجع `66`.\nالجواب:", "qhash": "ab3145845b6f4429"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -1 for x in xs if 9 <= x <= 17)", "tests": ["assert between_times([4, 18, 8, 20, 13, 20, 14, 5, 19]) == [-14, -13]", "assert between_times([29, 56, -27, 10, 43, -13, 36]) == [-10]", "assert between_times([37, 48, -25, 0, 44, 12, -13, 12, 30, 30]) == [-12, -12]", "assert between_times([14]) == [-14]", "assert between_times([-26, 2, 9, 10, 59, -12, 45, 48, -20, 15]) == [-15, -10, -9]", "assert between_times([41, 12, 59, 7, 17, -13]) == [-17, -12]", "assert between_times([33, 29]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([4, 18, 8, 20, 13, 20, 14, 5, 19]) == [-14, -13]\nassert between_times([29, 56, -27, 10, 43, -13, 36]) == [-10]\nassert between_times([37, 48, -25, 0, 44, 12, -13, 12, 30, 30]) == [-12, -12]\nassert between_times([14]) == [-14]\nassert between_times([-26, 2, 9, 10, 59, -12, 45, 48, -20, 15]) == [-15, -10, -9]\nassert between_times([41, 12, 59, 7, 17, -13]) == [-17, -12]\nassert between_times([33, 29]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -1 for x in xs if 9 <= x <= 17)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -1 for x in xs if 9 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `between_times(xs)`: اختر من القائمة xs العناصر x التي تحقق 9 ≤ x ≤ 17، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `between_times([4, 18, 8, 20, 13, 20, 14, 5, 19])` يُرجع `[-14, -13]`.\nالجواب:", "qhash": "98899bc9a4cf33c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29", "tests": ["assert step_product(11) == 10", "assert step_product(13) == 15", "assert step_product(58) == 0", "assert step_product(46) == 14", "assert step_product(20) == 11", "assert step_product(30) == 5", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 10\nassert step_product(13) == 15\nassert step_product(58) == 0\nassert step_product(46) == 14\nassert step_product(20) == 11\nassert step_product(30) == 5\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(11)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "c1de8577699bcacf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حاسوب ماء سوق جبل عمل جبل') == 2", "assert words_starting('دفتر مدرسة لغة طالب') == 0", "assert words_starting('طالب قمر شمس') == 0", "assert words_starting('جبل جبل قمر') == 2", "assert words_starting('تفاحة بيت جمل جبل') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('شجرة جمل حاسوب نور مدرسة جمل') == 2\nassert words_starting('حاسوب ماء سوق جبل عمل جبل') == 2\nassert words_starting('دفتر مدرسة لغة طالب') == 0\nassert words_starting('طالب قمر شمس') == 0\nassert words_starting('جبل جبل قمر') == 2\nassert words_starting('تفاحة بيت جمل جبل') == 2\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:\n if w.startswith('ج'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ج»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef words_starting(line):\n count = 0\n for w in line:\n if w.startswith('ج'):\n count += 1\n return count\n```\nمثال: `words_starting('شجرة جمل حاسوب نور مدرسة جمل')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "45bff5863850587f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('باب سلام حديقة صديق') == 0", "assert count_prefix('عمل نهر وردة كتاب') == 1", "assert count_prefix('كتاب طالب قلم لغة نهر') == 1", "assert count_prefix('كتاب برمجة علم رمل') == 1", "assert count_prefix('لغة ليل نهر معلم لغة نهر') == 0", "assert count_prefix('كتاب جبل ليل') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('باب سلام حديقة صديق') == 0\nassert count_prefix('عمل نهر وردة كتاب') == 1\nassert count_prefix('كتاب طالب قلم لغة نهر') == 1\nassert count_prefix('كتاب برمجة علم رمل') == 1\nassert count_prefix('لغة ليل نهر معلم لغة نهر') == 0\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('باب سلام حديقة صديق')` يُرجع `0`.\nالجواب:", "qhash": "340948bc08a33cb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 7\nfor j in range(5, 19, 3):\n result -= j * 7\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 7\nfor j in range(5, 19, 3):\n result -= j * 7\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "e73a23cd54c9515d", "answer": "-378\n17", "completion": " الناتج:\n```text\n-378\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + -3 for x in range(-3, 3) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + -3 for x in range(-3, 3) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "98369eab286b0347", "answer": "[-3, -3, -3]\n3 -9", "completion": " الناتج:\n```text\n[-3, -3, -3]\n3 -9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "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": "118e79c19b3e2902", "answer": "سوق\n['سوق']\nقوس", "completion": " الناتج:\n```text\nسوق\n['سوق']\nقوس\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 20\nfor x in range(0, 16, 3):\n result += x * 9\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 20\nfor x in range(0, 16, 3):\n result += x * 9\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "aea2b7e6575bbc8e", "answer": "425\n15", "completion": " الناتج:\n```text\n425\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 3 + 8 for x in range(0, 13) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 3 + 8 for x in range(0, 13) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "728f12c8720afbfa", "answer": "[8, 20, 32, 44]\n4 104", "completion": " الناتج:\n```text\n[8, 20, 32, 44]\n4 104\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(65) == 480", "assert total_multiples(96) == 956", "assert total_multiples(16) == 32", "assert total_multiples(55) == 306", "assert total_multiples(282) == 8853", "assert total_multiples(119) == 1480", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(65) == 480\nassert total_multiples(96) == 956\nassert total_multiples(16) == 32\nassert total_multiples(55) == 306\nassert total_multiples(282) == 8853\nassert total_multiples(119) == 1480\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(65)` يُرجع `480`.\nالجواب:", "qhash": "c6a2f2ba2c2d7dbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor n in range(-3, 11, 4):\n total += n * 7\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor n in range(-3, 11, 4):\n total += n * 7\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "25b1a388ad2c0496", "answer": "99\n9", "completion": " الناتج:\n```text\n99\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('banana banana camel') == 'camel/banana/banana'", "assert rev_long_words('in on') == ''", "assert rev_long_words('planet winter') == 'winter/planet'", "assert rev_long_words('vector') == 'vector'", "assert rev_long_words('window') == 'window'", "assert rev_long_words('engine cloud it banana brain engine falcon') == 'falcon/engine/brain/banana/cloud/engine'", "assert rev_long_words('cloud matrix at brain') == 'brain/matrix/cloud'"], "test_code": "assert rev_long_words('banana banana camel') == 'camel/banana/banana'\nassert rev_long_words('in on') == ''\nassert rev_long_words('planet winter') == 'winter/planet'\nassert rev_long_words('vector') == 'vector'\nassert rev_long_words('window') == 'window'\nassert rev_long_words('engine cloud it banana brain engine falcon') == 'falcon/engine/brain/banana/cloud/engine'\nassert rev_long_words('cloud matrix at brain') == 'brain/matrix/cloud'", "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('banana banana camel')` يجب أن تُرجع `'camel/banana/banana'`.\nالجواب:", "qhash": "8965af08362a8670"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(304224755))\nprint(rec(rec(304224755)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(304224755))\nprint(rec(rec(304224755)))\n```\nالجواب:", "qhash": "c59c03b0eca04658", "answer": "32\n5", "completion": " الناتج:\n```text\n32\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if 'ب' in w)", "tests": ["assert count_hits('عربية جمل رمل بحر قلم') == 2", "assert count_hits('نهر عربية صديق صحراء فجر ماء') == 1", "assert count_hits('لغة علم سفينة سفينة بحر') == 1", "assert count_hits('سيارة شجرة سلام مدينة برمجة مدرسة') == 1", "assert count_hits('فجر ليل صديق تفاحة فجر جمل') == 0", "assert count_hits('طائرة عمل') == 0", "assert count_hits('سفينة نهار لغة مدرسة بحر') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('عربية جمل رمل بحر قلم') == 2\nassert count_hits('نهر عربية صديق صحراء فجر ماء') == 1\nassert count_hits('لغة علم سفينة سفينة بحر') == 1\nassert count_hits('سيارة شجرة سلام مدينة برمجة مدرسة') == 1\nassert count_hits('فجر ليل صديق تفاحة فجر جمل') == 0\nassert count_hits('طائرة عمل') == 0\nassert count_hits('سفينة نهار لغة مدرسة بحر') == 1\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('عربية جمل رمل بحر قلم')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "986d0153de5f3d9c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(30) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16', '17', 'Hi', '19', '20', '21', 'Yo', '23', 'Hi', '25', '26', '27', '28', '29', 'Hi']", "assert fizz(25) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16', '17', 'Hi', '19', '20', '21', 'Yo', '23', 'Hi', '25']", "assert fizz(2) == ['1', '2']", "assert fizz(8) == ['1', '2', '3', '4', '5', 'Hi', '7', '8']", "assert fizz(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16']"], "test_code": "assert fizz(30) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16', '17', 'Hi', '19', '20', '21', 'Yo', '23', 'Hi', '25', '26', '27', '28', '29', 'Hi']\nassert fizz(25) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16', '17', 'Hi', '19', '20', '21', 'Yo', '23', 'Hi', '25']\nassert fizz(2) == ['1', '2']\nassert fizz(8) == ['1', '2', '3', '4', '5', 'Hi', '7', '8']\nassert fizz(16) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Hi'، وإن قَبِلها على 11 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(30)` يُرجع `['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', '10', 'Yo', 'Hi', '13', '14', '15', '16', '17', 'Hi', '19', '20', '21', 'Yo', '23', 'Hi', '25', '26', '27', '28', '29', 'Hi']`.\nالجواب:", "qhash": "551a62d8be504375"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('حسن', 1), ('سعيد', 99), ('علي', 0), ('هشام', 36)]\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 = [('حسن', 1), ('سعيد', 99), ('علي', 0), ('هشام', 36)]\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": "4d8739d4889567df", "answer": "[('علي', 0), ('حسن', 1), ('هشام', 36), ('سعيد', 99)]\n['سعيد', 'هشام']", "completion": " الناتج:\n```text\n[('علي', 0), ('حسن', 1), ('هشام', 36), ('سعيد', 99)]\n['سعيد', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'signal'\nprint(text[::-1])\nprint(text.replace('a', '*'))\nprint(text.index('a') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'signal'\nprint(text[::-1])\nprint(text.replace('a', '*'))\nprint(text.index('a') + len(text))\n```\nالجواب:", "qhash": "31506d143b383a43", "answer": "langis\nsign*l\n10", "completion": " الناتج:\n```text\nlangis\nsign*l\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'ماء'\nprint(len(text.replace(' ', '')))\nprint(text.find('م'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'ماء'\nprint(len(text.replace(' ', '')))\nprint(text.find('م'))\nprint(len(text))\n```\nالجواب:", "qhash": "510a587512ff0723", "answer": "3\n0\n3", "completion": " الناتج:\n```text\n3\n0\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "tests": ["assert multiples_total(244) == 9720", "assert multiples_total(127) == 2710", "assert multiples_total(89) == 1306", "assert multiples_total(81) == 1134", "assert multiples_total(177) == 5310", "assert multiples_total(158) == 4134", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(244) == 9720\nassert multiples_total(127) == 2710\nassert multiples_total(89) == 1306\nassert multiples_total(81) == 1134\nassert multiples_total(177) == 5310\nassert multiples_total(158) == 4134\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 6.\nمثال: `multiples_total(244)` يجب أن تُرجع `9720`.\nالجواب:", "qhash": "cf37463ddc68cff3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([47, 5, 56, -13, -21]) == None", "assert find_max_div([-12, -24, -12]) == -12", "assert find_max_div([1, 7, 13, 19]) == None", "assert find_max_div([12]) == 12", "assert find_max_div([21, -37, 23, 47, -1, -33, -49, 43, -11]) == None", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([47, 5, 56, -13, -21]) == None\nassert find_max_div([-12, -24, -12]) == -12\nassert find_max_div([1, 7, 13, 19]) == None\nassert find_max_div([12]) == 12\nassert find_max_div([21, -37, 23, 47, -1, -33, -49, 43, -11]) == None\nassert find_max_div([]) == None", "answer": "def find_max_div(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([47, 5, 56, -13, -21])` يُرجع `None`.\nالجواب:", "qhash": "c0afc8b229390f1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 320\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 = 320\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": "4885e05fa5b04796", "answer": "11", "completion": " الناتج:\n```text\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -3 for x in xs if 9 <= x <= 24)", "tests": ["assert clip_scale([24, 4, 16, 19, 25, 17, 5, 4]) == [-72, -57, -51, -48]", "assert clip_scale([14, 44, 30, -16, 31, 14, 55, 11, 7]) == [-42, -42, -33]", "assert clip_scale([46, -1, 57, 39, -3, -17]) == []", "assert clip_scale([58, 43, 13, 22, 27, 7, 9, 32, 8]) == [-66, -39, -27]", "assert clip_scale([20, 2, 39, 48, 46, -14, -10, -26, 39]) == [-60]", "assert clip_scale([28, -28, 36]) == []", "assert clip_scale([31, 9, 5, 25, 5, -29, -8, -19]) == [-27]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([24, 4, 16, 19, 25, 17, 5, 4]) == [-72, -57, -51, -48]\nassert clip_scale([14, 44, 30, -16, 31, 14, 55, 11, 7]) == [-42, -42, -33]\nassert clip_scale([46, -1, 57, 39, -3, -17]) == []\nassert clip_scale([58, 43, 13, 22, 27, 7, 9, 32, 8]) == [-66, -39, -27]\nassert clip_scale([20, 2, 39, 48, 46, -14, -10, -26, 39]) == [-60]\nassert clip_scale([28, -28, 36]) == []\nassert clip_scale([31, 9, 5, 25, 5, -29, -8, -19]) == [-27]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -3 for x in xs if 9 <= x <= 24)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -3 for x in xs if 9 <= x <= 24)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 9 و24 (شاملًا الطرفين) في -3.\nمثال: `clip_scale([24, 4, 16, 19, 25, 17, 5, 4])` يجب أن تُرجع `[-72, -57, -51, -48]`.\nالجواب:", "qhash": "58c98d3a7fa1440a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'agit'}", "tests": ["assert letter_stats('at winter') == {'a': 1, 'g': 0, 'i': 1, 't': 2}", "assert letter_stats('garden winter window') == {'a': 1, 'g': 1, 'i': 2, 't': 1}", "assert letter_stats('an winter orange of camel by') == {'a': 3, 'g': 1, 'i': 1, 't': 1}", "assert letter_stats('by vector code') == {'a': 0, 'g': 0, 'i': 0, 't': 1}", "assert letter_stats('light winter planet') == {'a': 1, 'g': 1, 'i': 2, 't': 3}", "assert letter_stats('cloud we') == {'a': 0, 'g': 0, 'i': 0, 't': 0}", "assert letter_stats('') == {'a': 0, 'g': 0, 'i': 0, 't': 0}"], "test_code": "assert letter_stats('at winter') == {'a': 1, 'g': 0, 'i': 1, 't': 2}\nassert letter_stats('garden winter window') == {'a': 1, 'g': 1, 'i': 2, 't': 1}\nassert letter_stats('an winter orange of camel by') == {'a': 3, 'g': 1, 'i': 1, 't': 1}\nassert letter_stats('by vector code') == {'a': 0, 'g': 0, 'i': 0, 't': 1}\nassert letter_stats('light winter planet') == {'a': 1, 'g': 1, 'i': 2, 't': 3}\nassert letter_stats('cloud we') == {'a': 0, 'g': 0, 'i': 0, 't': 0}\nassert letter_stats('') == {'a': 0, 'g': 0, 'i': 0, 't': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'agit'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'agit'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'g'، 'i'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('at winter')` يُرجع `{'a': 1, 'g': 0, 'i': 1, 't': 2}`.\nالجواب:", "qhash": "f15772b2e6363bf4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([40, 38, 33, 17, 4, 15, 37, 16, 27]) == [40, 0, 33, 50, 54, 69, 0, 16, 43]", "assert rolling_total([11, 13]) == [11, 24]", "assert rolling_total([11, 28, -5, 67, 33, 5, -3, 22, 43]) == [11, 39, 34, 0, 33, 38, 35, 57, 0]", "assert rolling_total([]) == []", "assert rolling_total([69, 21, 69, 41, 63, -2]) == [69, 0, 69, 0, 63, 61]", "assert rolling_total([]) == []", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([40, 38, 33, 17, 4, 15, 37, 16, 27]) == [40, 0, 33, 50, 54, 69, 0, 16, 43]\nassert rolling_total([11, 13]) == [11, 24]\nassert rolling_total([11, 28, -5, 67, 33, 5, -3, 22, 43]) == [11, 39, 34, 0, 33, 38, 35, 57, 0]\nassert rolling_total([]) == []\nassert rolling_total([69, 21, 69, 41, 63, -2]) == [69, 0, 69, 0, 63, 61]\nassert rolling_total([]) == []\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 70 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([40, 38, 33, 17, 4, 15, 37, 16, 27])` يُرجع `[40, 0, 33, 50, 54, 69, 0, 16, 43]`.\nالجواب:", "qhash": "7e2c3bb86be4533a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 11) == 1)", "tests": ["assert coprimes(103) == 94", "assert coprimes(0) == 0", "assert coprimes(150) == 137", "assert coprimes(35) == 32", "assert coprimes(54) == 50", "assert coprimes(147) == 134", "assert coprimes(1) == 1"], "test_code": "assert coprimes(103) == 94\nassert coprimes(0) == 0\nassert coprimes(150) == 137\nassert coprimes(35) == 32\nassert coprimes(54) == 50\nassert coprimes(147) == 134\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, 11) == 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, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 11) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(103)` يُرجع `94`.\nالجواب:", "qhash": "3d3a40e80dbb1044"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -9 * x ** 2 + (4) * x + (8)", "tests": ["assert p(8) == -536", "assert p(5) == -197", "assert p(-11) == -1125", "assert p(4) == -120", "assert p(12) == -1240", "assert p(-5) == -237", "assert p(-20) == -3672", "assert p(0) == 8"], "test_code": "assert p(8) == -536\nassert p(5) == -197\nassert p(-11) == -1125\nassert p(4) == -120\nassert p(12) == -1240\nassert p(-5) == -237\nassert p(-20) == -3672\nassert p(0) == 8", "answer": "def p(x):\n return -9 * x ** 2 + (4) * x + (8)", "completion": " ```python\ndef p(x):\n return -9 * x ** 2 + (4) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -9x² + 4x + 8 عند العدد الصحيح x.\nمثال: `p(8)` يجب أن تُرجع `-536`.\nالجواب:", "qhash": "639c7494f77af42e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 9) // 2 for x in range(3, 14) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 9) // 2 for x in range(3, 14) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "658279d3d4ca25d2", "answer": "[6, 7, 8, 9, 10]\n5 40", "completion": " الناتج:\n```text\n[6, 7, 8, 9, 10]\n5 40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 2) // 5 for x in range(3, 15) if x % 5 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 2) // 5 for x in range(3, 15) if x % 5 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "d88a68fed123ac9b", "answer": "[1, 2]\n2 3", "completion": " الناتج:\n```text\n[1, 2]\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 2\n return total", "tests": ["assert weighted_sum(8) == 2040", "assert weighted_sum(13) == 8190", "assert weighted_sum(7) == 1400", "assert weighted_sum(9) == 2850", "assert weighted_sum(0) == 0", "assert weighted_sum(1) == 10", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(8) == 2040\nassert weighted_sum(13) == 8190\nassert weighted_sum(7) == 1400\nassert weighted_sum(9) == 2850\nassert weighted_sum(0) == 0\nassert weighted_sum(1) == 10\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 10 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n):\n total += 10 * i ** 2\n return total\n```\nمثال: `weighted_sum(8)` يجب أن تُرجع `2040`.\nالجواب:", "qhash": "6ef8b4d2d38dd862"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert turn_list([0, 7, 40, 38]) == [38, 0, 7, 40]", "assert turn_list([4, 28, 40, 5, 26]) == [26, 4, 28, 40, 5]", "assert turn_list([25, 3, 39, 2]) == [2, 25, 3, 39]", "assert turn_list([27, 29, 46, 4]) == [4, 27, 29, 46]", "assert turn_list([0, 43, 7, 41, 19, 15, 7, -3, 0, -1, 50, 14]) == [-3, 0, -1, 50, 14, 0, 43, 7, 41, 19, 15, 7]", "assert turn_list([48, 13, 17, 24, -4, -1, 27, 33, 26, 35, 8, -1]) == [33, 26, 35, 8, -1, 48, 13, 17, 24, -4, -1, 27]", "assert turn_list([]) == []"], "test_code": "assert turn_list([0, 7, 40, 38]) == [38, 0, 7, 40]\nassert turn_list([4, 28, 40, 5, 26]) == [26, 4, 28, 40, 5]\nassert turn_list([25, 3, 39, 2]) == [2, 25, 3, 39]\nassert turn_list([27, 29, 46, 4]) == [4, 27, 29, 46]\nassert turn_list([0, 43, 7, 41, 19, 15, 7, -3, 0, -1, 50, 14]) == [-3, 0, -1, 50, 14, 0, 43, 7, 41, 19, 15, 7]\nassert turn_list([48, 13, 17, 24, -4, -1, 27, 33, 26, 35, 8, -1]) == [33, 26, 35, 8, -1, 48, 13, 17, 24, -4, -1, 27]\nassert turn_list([]) == []", "answer": "def turn_list(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return ____\n```\nمثال: `turn_list([0, 7, 40, 38])` يجب أن تُرجع `[38, 0, 7, 40]`.\nالجواب:", "qhash": "46355365d23d276b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 2\nfor j in range(-1, 8, 3):\n total += j * 8\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 2\nfor j in range(-1, 8, 3):\n total += j * 8\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "18946f4796c34317", "answer": "50\n5", "completion": " الناتج:\n```text\n50\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'هشام': 8, 'منى': 29, 'علي': 38}\nmarks['منى'] += 15\nmarks['هدى'] = 52\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'هشام': 8, 'منى': 29, 'علي': 38}\nmarks['منى'] += 15\nmarks['هدى'] = 52\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))\n```\nالجواب:", "qhash": "63a59b24af78253f", "answer": "4\nهدى\n142\n-1", "completion": " الناتج:\n```text\n4\nهدى\n142\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total", "tests": ["assert weighted_sum(5) == 440", "assert weighted_sum(12) == 5200", "assert weighted_sum(14) == 8120", "assert weighted_sum(5) == 440", "assert weighted_sum(5) == 440", "assert weighted_sum(1) == 8", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 440\nassert weighted_sum(12) == 5200\nassert weighted_sum(14) == 8120\nassert weighted_sum(5) == 440\nassert weighted_sum(5) == 440\nassert weighted_sum(1) == 8\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 2\n return total\n```\nمثال: `weighted_sum(5)` يجب أن تُرجع `440`.\nالجواب:", "qhash": "b7a076b0819b1f64"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 155:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([68, 47, 58, 18, 72]) == [68, 115, 0, 18, 90]", "assert acc_reset([85, 25, 146, 123, 23, 17, 142]) == [85, 110, 0, 123, 146, 0, 142]", "assert acc_reset([53, 155, 141, 128, 39]) == [53, 0, 141, 0, 39]", "assert acc_reset([]) == []", "assert acc_reset([-8, 45, 79, 152, 94, 33, 14]) == [-8, 37, 116, 0, 94, 127, 141]", "assert acc_reset([31, 145, 70, 46, 84, 108, 103, -2]) == [31, 0, 70, 116, 0, 108, 0, -2]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([68, 47, 58, 18, 72]) == [68, 115, 0, 18, 90]\nassert acc_reset([85, 25, 146, 123, 23, 17, 142]) == [85, 110, 0, 123, 146, 0, 142]\nassert acc_reset([53, 155, 141, 128, 39]) == [53, 0, 141, 0, 39]\nassert acc_reset([]) == []\nassert acc_reset([-8, 45, 79, 152, 94, 33, 14]) == [-8, 37, 116, 0, 94, 127, 141]\nassert acc_reset([31, 145, 70, 46, 84, 108, 103, -2]) == [31, 0, 70, 116, 0, 108, 0, -2]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 155:\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 > 155:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 155 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([68, 47, 58, 18, 72])` يُرجع `[68, 115, 0, 18, 90]`.\nالجواب:", "qhash": "ca8d757c700292f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 82", "tests": ["assert dig_pow_mod(61786) == 28", "assert dig_pow_mod(167492) == 29", "assert dig_pow_mod(609469) == 34", "assert dig_pow_mod(654690) == 30", "assert dig_pow_mod(679646) == 38", "assert dig_pow_mod(947232) == 27", "assert dig_pow_mod(272147) == 23", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(61786) == 28\nassert dig_pow_mod(167492) == 29\nassert dig_pow_mod(609469) == 34\nassert dig_pow_mod(654690) == 30\nassert dig_pow_mod(679646) == 38\nassert dig_pow_mod(947232) == 27\nassert dig_pow_mod(272147) == 23\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 82", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 82\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 82.\nمثال: `dig_pow_mod(61786)` يجب أن تُرجع `28`.\nالجواب:", "qhash": "658a3c32df4ab0fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -7 <= x <= 10)", "tests": ["assert pick_between([0, 6, -10, -7, 6, 0, 9, -9, 16, 9]) == [-18, -18, -12, -12, 0, 0, 14]", "assert pick_between([41, 60, -19, 15, -27, 8, -11, -2]) == [-16, 4]", "assert pick_between([]) == []", "assert pick_between([57, 43, 16, 53, 53, 17]) == []", "assert pick_between([-13, 57, 46, 20, 15, 57]) == []", "assert pick_between([59, 37, -1]) == [2]", "assert pick_between([39, 24, 1, 51]) == [-2]", "assert pick_between([]) == []"], "test_code": "assert pick_between([0, 6, -10, -7, 6, 0, 9, -9, 16, 9]) == [-18, -18, -12, -12, 0, 0, 14]\nassert pick_between([41, 60, -19, 15, -27, 8, -11, -2]) == [-16, 4]\nassert pick_between([]) == []\nassert pick_between([57, 43, 16, 53, 53, 17]) == []\nassert pick_between([-13, 57, 46, 20, 15, 57]) == []\nassert pick_between([59, 37, -1]) == [2]\nassert pick_between([39, 24, 1, 51]) == [-2]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -2 for x in xs if -7 <= x <= 10)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -2 for x in xs if -7 <= x <= 10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -7 و10 (شاملًا الطرفين) في -2.\nمثال: `pick_between([0, 6, -10, -7, 6, 0, 9, -9, 16, 9])` يجب أن تُرجع `[-18, -18, -12, -12, 0, 0, 14]`.\nالجواب:", "qhash": "05dea0a6b624c27a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if -1 <= x <= 17)", "tests": ["assert between_times([24, 14, 22, 8, 25]) == [32, 56]", "assert between_times([17, 49, 42, -19, -15, -3, 51, 34]) == [68]", "assert between_times([]) == []", "assert between_times([0, -9, 31, -1, 19, 4, -22]) == [-4, 0, 16]", "assert between_times([-10, 58]) == []", "assert between_times([-17, -19, -14, -6, 21, 59]) == []", "assert between_times([-3, 10, 56, 21, 4]) == [16, 40]", "assert between_times([]) == []"], "test_code": "assert between_times([24, 14, 22, 8, 25]) == [32, 56]\nassert between_times([17, 49, 42, -19, -15, -3, 51, 34]) == [68]\nassert between_times([]) == []\nassert between_times([0, -9, 31, -1, 19, 4, -22]) == [-4, 0, 16]\nassert between_times([-10, 58]) == []\nassert between_times([-17, -19, -14, -6, 21, 59]) == []\nassert between_times([-3, 10, 56, 21, 4]) == [16, 40]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if -1 <= x <= 17)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if -1 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -1 و17 (شاملًا الطرفين) في 4.\nمثال: `between_times([24, 14, 22, 8, 25])` يجب أن تُرجع `[32, 56]`.\nالجواب:", "qhash": "70d31802f6a81d7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 8 * x ** 2 + (3) * x + (1)", "tests": ["assert poly(3) == 82", "assert poly(-9) == 622", "assert poly(11) == 1002", "assert poly(-15) == 1756", "assert poly(-20) == 3141", "assert poly(16) == 2097", "assert poly(13) == 1392", "assert poly(0) == 1"], "test_code": "assert poly(3) == 82\nassert poly(-9) == 622\nassert poly(11) == 1002\nassert poly(-15) == 1756\nassert poly(-20) == 3141\nassert poly(16) == 2097\nassert poly(13) == 1392\nassert poly(0) == 1", "answer": "def poly(x):\n return 8 * x ** 2 + (3) * x + (1)", "completion": " ```python\ndef poly(x):\n return 8 * x ** 2 + (3) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 8x² + 3x + 1 عند العدد الصحيح x.\nمثال: `poly(3)` يجب أن تُرجع `82`.\nالجواب:", "qhash": "236be299759339d0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 19741\ncount = 0\nwhile n > 14:\n n = n // 8\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 19741\ncount = 0\nwhile n > 14:\n n = n // 8\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "d247fab9356bce76", "answer": "4 4", "completion": " الناتج:\n```text\n4 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 65:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([1, 16, 2, 31, 21, 31, 37, 30, 24]) == [1, 17, 19, 50, 0, 31, 0, 30, 54]", "assert acc_reset([]) == []", "assert acc_reset([24, 41, 62, -6]) == [24, 65, 0, -6]", "assert acc_reset([-8, 65, 9, 62, 38, -9, -1, 21, 16, 15]) == [-8, 57, 0, 62, 0, -9, -10, 11, 27, 42]", "assert acc_reset([60, 16, 45, 20]) == [60, 0, 45, 65]", "assert acc_reset([0, 9, -1, 21, -5, 64]) == [0, 9, 8, 29, 24, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([1, 16, 2, 31, 21, 31, 37, 30, 24]) == [1, 17, 19, 50, 0, 31, 0, 30, 54]\nassert acc_reset([]) == []\nassert acc_reset([24, 41, 62, -6]) == [24, 65, 0, -6]\nassert acc_reset([-8, 65, 9, 62, 38, -9, -1, 21, 16, 15]) == [-8, 57, 0, 62, 0, -9, -10, 11, 27, 42]\nassert acc_reset([60, 16, 45, 20]) == [60, 0, 45, 65]\nassert acc_reset([0, 9, -1, 21, -5, 64]) == [0, 9, 8, 29, 24, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 65:\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 > 65:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 65 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([1, 16, 2, 31, 21, 31, 37, 30, 24])` يُرجع `[1, 17, 19, 50, 0, 31, 0, 30, 54]`.\nالجواب:", "qhash": "689089dd5dcc121a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'window_camel'\nprint(text[-1:])\nprint(text[0:2])\nprint(text.find('o'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'window_camel'\nprint(text[-1:])\nprint(text[0:2])\nprint(text.find('o'))\n```\nالجواب:", "qhash": "7935598f69ada2fb", "answer": "l\nwi\n4", "completion": " الناتج:\n```text\nl\nwi\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [31, 15, 34, 1, 11, 4]\nprint(nums[3:5])\nprint(nums[::3])\nprint(max(nums[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [31, 15, 34, 1, 11, 4]\nprint(nums[3:5])\nprint(nums[::3])\nprint(max(nums[3:5]))\n```\nالجواب:", "qhash": "e8d83c69b0e3fed0", "answer": "[1, 11]\n[31, 1]\n11", "completion": " الناتج:\n```text\n[1, 11]\n[31, 1]\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "tests": ["assert power_sum(5) == 17700", "assert power_sum(12) == 2522832", "assert power_sum(8) == 247104", "assert power_sum(4) == 5200", "assert power_sum(10) == 883300", "assert power_sum(1) == 4", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 17700\nassert power_sum(12) == 2522832\nassert power_sum(8) == 247104\nassert power_sum(4) == 5200\nassert power_sum(10) == 883300\nassert power_sum(1) == 4\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 4 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 4 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `power_sum(5)` يُرجع `17700`.\nالجواب:", "qhash": "79df783a105c6ae3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 54) == 1)", "tests": ["assert coprime_count(120) == 40", "assert coprime_count(41) == 14", "assert coprime_count(93) == 31", "assert coprime_count(101) == 34", "assert coprime_count(8) == 3", "assert coprime_count(49) == 17", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(120) == 40\nassert coprime_count(41) == 14\nassert coprime_count(93) == 31\nassert coprime_count(101) == 34\nassert coprime_count(8) == 3\nassert coprime_count(49) == 17\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 54، أي أن القاسم المشترك الأكبر لها مع 54 يساوي 1.\nمثال: `coprime_count(120)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "c46447996f318fed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('summer of in pixel in') == 'in|pixel|in|of|summer'", "assert rev_join('engine orange rocket up by a') == 'a|by|up|rocket|orange|engine'", "assert rev_join('stone vector is summer coffee go brain in') == 'in|brain|go|coffee|summer|is|vector|stone'", "assert rev_join('window we garden') == 'garden|we|window'", "assert rev_join('an summer') == 'summer|an'", "assert rev_join('table') == 'table'", "assert rev_join('cloud data code up up') == 'up|up|code|data|cloud'"], "test_code": "assert rev_join('summer of in pixel in') == 'in|pixel|in|of|summer'\nassert rev_join('engine orange rocket up by a') == 'a|by|up|rocket|orange|engine'\nassert rev_join('stone vector is summer coffee go brain in') == 'in|brain|go|coffee|summer|is|vector|stone'\nassert rev_join('window we garden') == 'garden|we|window'\nassert rev_join('an summer') == 'summer|an'\nassert rev_join('table') == 'table'\nassert rev_join('cloud data code up up') == 'up|up|code|data|cloud'", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `rev_join('summer of in pixel in')` يُرجع `'in|pixel|in|of|summer'`.\nالجواب:", "qhash": "fdf867a90f5bf823"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "tests": ["assert sum_powers(6) == 21", "assert sum_powers(1) == 1", "assert sum_powers(2) == 3", "assert sum_powers(2) == 3", "assert sum_powers(1) == 1", "assert sum_powers(1) == 1", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 21\nassert sum_powers(1) == 1\nassert sum_powers(2) == 3\nassert sum_powers(2) == 3\nassert sum_powers(1) == 1\nassert sum_powers(1) == 1\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 1 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 1 * i ** 1\n return total\n```\nمثال: `sum_powers(6)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "e9b3f36d7be5a9b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [-2, 4, -3, 17, 11, 25, -1, -2, 0]\nprint(items[2:6])\nprint(items[::-2])\nprint(len(items[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [-2, 4, -3, 17, 11, 25, -1, -2, 0]\nprint(items[2:6])\nprint(items[::-2])\nprint(len(items[2:6]))\n```\nالجواب:", "qhash": "2e42995468e7d09e", "answer": "[-3, 17, 11, 25]\n[0, -1, 11, -3, -2]\n4", "completion": " الناتج:\n```text\n[-3, 17, 11, 25]\n[0, -1, 11, -3, -2]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'music'\nprint(s.find('c'))\nprint(s.count('c'))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'music'\nprint(s.find('c'))\nprint(s.count('c'))\nprint(len(s))\n```\nالجواب:", "qhash": "819a1e5ed5d559fe", "answer": "4\n1\n5", "completion": " الناتج:\n```text\n4\n1\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 114:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([61, 43, 24, 1, 2]) == [61, 104, 0, 1, 3]", "assert running_sum([62, 28]) == [62, 90]", "assert running_sum([41, 72, -5, 89, 71, 93, 46]) == [41, 113, 108, 0, 71, 0, 46]", "assert running_sum([3, 39, 49, 2, 97, 12, 91]) == [3, 42, 91, 93, 0, 12, 103]", "assert running_sum([46, 101, 29, 12, 10, 113]) == [46, 0, 29, 41, 51, 0]", "assert running_sum([26, 38]) == [26, 64]", "assert running_sum([]) == []"], "test_code": "assert running_sum([61, 43, 24, 1, 2]) == [61, 104, 0, 1, 3]\nassert running_sum([62, 28]) == [62, 90]\nassert running_sum([41, 72, -5, 89, 71, 93, 46]) == [41, 113, 108, 0, 71, 0, 46]\nassert running_sum([3, 39, 49, 2, 97, 12, 91]) == [3, 42, 91, 93, 0, 12, 103]\nassert running_sum([46, 101, 29, 12, 10, 113]) == [46, 0, 29, 41, 51, 0]\nassert running_sum([26, 38]) == [26, 64]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 114:\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 > 114:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 114 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([61, 43, 24, 1, 2])` يُرجع `[61, 104, 0, 1, 3]`.\nالجواب:", "qhash": "cc258f73c05fbae0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 2 for x in xs if -9 <= x <= 22)", "tests": ["assert select_range([15, 24, 16, 25]) == [30, 32]", "assert select_range([28, 18, 46, -12, 30, 38, 9, 18]) == [18, 36, 36]", "assert select_range([]) == []", "assert select_range([]) == []", "assert select_range([1, 55, 39, 37, 34, 19, 34, -10, 55]) == [2, 38]", "assert select_range([9, -20]) == [18]", "assert select_range([56, 54, 57, 5, 9, 32, 12, 47, 22, 53]) == [10, 18, 24, 44]", "assert select_range([]) == []"], "test_code": "assert select_range([15, 24, 16, 25]) == [30, 32]\nassert select_range([28, 18, 46, -12, 30, 38, 9, 18]) == [18, 36, 36]\nassert select_range([]) == []\nassert select_range([]) == []\nassert select_range([1, 55, 39, 37, 34, 19, 34, -10, 55]) == [2, 38]\nassert select_range([9, -20]) == [18]\nassert select_range([56, 54, 57, 5, 9, 32, 12, 47, 22, 53]) == [10, 18, 24, 44]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 2 for x in xs if -9 <= x <= 22)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 2 for x in xs if -9 <= x <= 22)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -9 و22 (شاملًا الطرفين) في 2.\nمثال: `select_range([15, 24, 16, 25])` يجب أن تُرجع `[30, 32]`.\nالجواب:", "qhash": "b185d1c78b9b773b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11", "tests": ["assert multi_fact(5) == 10", "assert multi_fact(19) == 4", "assert multi_fact(15) == 10", "assert multi_fact(23) == 0", "assert multi_fact(23) == 0", "assert multi_fact(27) == 4", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(5) == 10\nassert multi_fact(19) == 4\nassert multi_fact(15) == 10\nassert multi_fact(23) == 0\nassert multi_fact(23) == 0\nassert multi_fact(27) == 4\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 3)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(5)` يُرجع `10`.\nالجواب:", "qhash": "44d8fd181868c1f6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 64", "tests": ["assert digit_power(79689) == 33", "assert digit_power(306788) == 10", "assert digit_power(297252) == 5", "assert digit_power(969477) == 56", "assert digit_power(927721) == 24", "assert digit_power(42768) == 55", "assert digit_power(655827) == 49", "assert digit_power(0) == 0"], "test_code": "assert digit_power(79689) == 33\nassert digit_power(306788) == 10\nassert digit_power(297252) == 5\nassert digit_power(969477) == 56\nassert digit_power(927721) == 24\nassert digit_power(42768) == 55\nassert digit_power(655827) == 49\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 64", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 64\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 64.\nللتوضيح: الاستدعاء `digit_power(79689)` يُرجع `33`.\nالجواب:", "qhash": "56d1a42247377d70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'سلام ليل'\nprint(len(text))\nprint(len(text.replace(' ', '')))\nprint(text.count('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'سلام ليل'\nprint(len(text))\nprint(len(text.replace(' ', '')))\nprint(text.count('س'))\n```\nالجواب:", "qhash": "04281332c96af23b", "answer": "8\n7\n1", "completion": " الناتج:\n```text\n8\n7\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 43", "tests": ["assert digit_score(55563) == 27", "assert digit_score(158082) == 19", "assert digit_score(249379) == 9", "assert digit_score(72299) == 32", "assert digit_score(707790) == 4", "assert digit_score(543246) == 36", "assert digit_score(910542) == 20", "assert digit_score(0) == 0"], "test_code": "assert digit_score(55563) == 27\nassert digit_score(158082) == 19\nassert digit_score(249379) == 9\nassert digit_score(72299) == 32\nassert digit_score(707790) == 4\nassert digit_score(543246) == 36\nassert digit_score(910542) == 20\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 43", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 4 for d in str(n)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 43.\nمثال: `digit_score(55563)` يجب أن تُرجع `27`.\nالجواب:", "qhash": "2ded9e59a40199da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 101", "tests": ["assert prod_mod(6) == 48", "assert prod_mod(57) == 46", "assert prod_mod(1) == 1", "assert prod_mod(45) == 46", "assert prod_mod(7) == 4", "assert prod_mod(2) == 2", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 48\nassert prod_mod(57) == 46\nassert prod_mod(1) == 1\nassert prod_mod(45) == 46\nassert prod_mod(7) == 4\nassert prod_mod(2) == 2\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 101", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(6)` يُرجع `48`.\nالجواب:", "qhash": "dc20ccd5a24b08dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total", "tests": ["assert weighted_sum(4) == 330", "assert weighted_sum(4) == 330", "assert weighted_sum(13) == 9009", "assert weighted_sum(11) == 5566", "assert weighted_sum(0) == 0", "assert weighted_sum(1) == 11", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 330\nassert weighted_sum(4) == 330\nassert weighted_sum(13) == 9009\nassert weighted_sum(11) == 5566\nassert weighted_sum(0) == 0\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 ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(4)` يُرجع `330`.\nالجواب:", "qhash": "78ff5372ee9a5dc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'يوسف': 8, 'رنا': 10, 'هدى': 30, 'باسل': 24, 'سلمى': 24}\nd['باسل'] += 9\nd['نور'] = 9\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 = {'يوسف': 8, 'رنا': 10, 'هدى': 30, 'باسل': 24, 'سلمى': 24}\nd['باسل'] += 9\nd['نور'] = 9\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": "4738841a660e6d20", "answer": "6\nباسل\n114\n[('يوسف', 8), ('نور', 9)]", "completion": " الناتج:\n```text\n6\nباسل\n114\n[('يوسف', 8), ('نور', 9)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13']", "assert fizzbuzz(19) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19']", "assert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13']", "assert fizzbuzz(18) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue']", "assert fizzbuzz(21) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red']"], "test_code": "assert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13']\nassert fizzbuzz(19) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19']\nassert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13']\nassert fizzbuzz(18) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue']\nassert fizzbuzz(21) == ['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13', '14', 'Red', '16', '17', 'RedBlue', '19', '20', 'Red']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Red'\n if i % 6 == 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 % 3 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(13)` يُرجع `['1', '2', 'Red', '4', '5', 'RedBlue', '7', '8', 'Red', '10', '11', 'RedBlue', '13']`.\nالجواب:", "qhash": "64988f8421fcaace"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 3\nfor n in range(5, 8, 4):\n total += n * 4\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 3\nfor n in range(5, 8, 4):\n total += n * 4\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "83555607ff5b38dc", "answer": "23\n5", "completion": " الناتج:\n```text\n23\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29", "tests": ["assert step_product(3) == 3", "assert step_product(18) == 9", "assert step_product(57) == 6", "assert step_product(28) == 7", "assert step_product(27) == 5", "assert step_product(24) == 12", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(18) == 9\nassert step_product(57) == 6\nassert step_product(28) == 7\nassert step_product(27) == 5\nassert step_product(24) == 12\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 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": "c3a147e213855efd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 7\nfor i in range(5, 29, 4):\n total -= i * 4\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 7\nfor i in range(5, 29, 4):\n total -= i * 4\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "01f727fdab7abd3d", "answer": "-353\n25", "completion": " الناتج:\n```text\n-353\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'خالد': 2, 'علي': 30, 'سعيد': 7}\nscores['خالد'] += 17\nscores['راشد'] = 18\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'خالد': 2, 'علي': 30, 'سعيد': 7}\nscores['خالد'] += 17\nscores['راشد'] = 18\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))\n```\nالجواب:", "qhash": "d117007e1b541192", "answer": "4\nعلي\n74\n30", "completion": " الناتج:\n```text\n4\nعلي\n74\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 10 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']", "assert label_numbers(1) == ['1']", "assert label_numbers(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar']", "assert label_numbers(11) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11']", "assert label_numbers(7) == ['1', '2', '3', '4', '5', '6', 'Foo']"], "test_code": "assert label_numbers(20) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']\nassert label_numbers(1) == ['1']\nassert label_numbers(10) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar']\nassert label_numbers(11) == ['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11']\nassert label_numbers(7) == ['1', '2', '3', '4', '5', '6', 'Foo']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Foo'، وعلى 10 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(20)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Foo', '8', '9', 'Bar', '11', '12', '13', 'Foo', '15', '16', '17', '18', '19', 'Bar']`.\nالجواب:", "qhash": "9ff451fd2da35e13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(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 fizzbuzz(26) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23', 'Red', '25', '26']", "assert fizzbuzz(3) == ['1', '2', '3']", "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue']", "assert fizzbuzz(11) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11']", "assert fizzbuzz(1) == ['1']"], "test_code": "assert fizzbuzz(26) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23', 'Red', '25', '26']\nassert fizzbuzz(3) == ['1', '2', '3']\nassert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue']\nassert fizzbuzz(11) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11']\nassert fizzbuzz(1) == ['1']", "answer": "def fizzbuzz(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 fizzbuzz(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سؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Red'، وإن قَبِلها على 9 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(26)` يُرجع `['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23', 'Red', '25', '26']`.\nالجواب:", "qhash": "6b7ba5020bb29003"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 14\nfor n in range(1, 9, 4):\n acc -= n * 5\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 14\nfor n in range(1, 9, 4):\n acc -= n * 5\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "2b1ebb57375370e2", "answer": "-16\n5", "completion": " الناتج:\n```text\n-16\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 84) == 1)", "tests": ["assert phi_upto(33) == 10", "assert phi_upto(108) == 31", "assert phi_upto(120) == 34", "assert phi_upto(78) == 22", "assert phi_upto(125) == 36", "assert phi_upto(108) == 31", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(33) == 10\nassert phi_upto(108) == 31\nassert phi_upto(120) == 34\nassert phi_upto(78) == 22\nassert phi_upto(125) == 36\nassert phi_upto(108) == 31\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, 84) == 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, 84) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 84، أي أن القاسم المشترك الأكبر لها مع 84 يساوي 1.\nمثال: `phi_upto(33)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "b6c37c6aef7e21cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 11", "tests": ["assert rec_prod(12) == 0", "assert rec_prod(17) == 0", "assert rec_prod(22) == 0", "assert rec_prod(53) == 0", "assert rec_prod(38) == 0", "assert rec_prod(48) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(12) == 0\nassert rec_prod(17) == 0\nassert rec_prod(22) == 0\nassert rec_prod(53) == 0\nassert rec_prod(38) == 0\nassert rec_prod(48) == 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)) % 11", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(12)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "96f1ee2d0e4d199c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 0\nfor x in range(9, 17, 3):\n total += x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 0\nfor x in range(9, 17, 3):\n total += x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "350165e7772ac472", "answer": "324\n15", "completion": " الناتج:\n```text\n324\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'falcon'\nprint(s.split('_'))\nprint(s.find('a'))\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'falcon'\nprint(s.split('_'))\nprint(s.find('a'))\nprint(s.capitalize())\n```\nالجواب:", "qhash": "eda7360d4aabd06d", "answer": "['falcon']\n1\nFalcon", "completion": " الناتج:\n```text\n['falcon']\n1\nFalcon\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'cu'}", "tests": ["assert char_counts('it go desert of camel signal') == {'c': 1, 'u': 0}", "assert char_counts('table river vector winter desert signal') == {'c': 1, 'u': 0}", "assert char_counts('orange') == {'c': 0, 'u': 0}", "assert char_counts('falcon window cloud') == {'c': 2, 'u': 1}", "assert char_counts('engine to cloud') == {'c': 1, 'u': 1}", "assert char_counts('orange river is') == {'c': 0, 'u': 0}", "assert char_counts('') == {'c': 0, 'u': 0}"], "test_code": "assert char_counts('it go desert of camel signal') == {'c': 1, 'u': 0}\nassert char_counts('table river vector winter desert signal') == {'c': 1, 'u': 0}\nassert char_counts('orange') == {'c': 0, 'u': 0}\nassert char_counts('falcon window cloud') == {'c': 2, 'u': 1}\nassert char_counts('engine to cloud') == {'c': 1, 'u': 1}\nassert char_counts('orange river is') == {'c': 0, 'u': 0}\nassert char_counts('') == {'c': 0, 'u': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'cu'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'cu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_counts(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_counts('it go desert of camel signal')` يجب أن تُرجع `{'c': 1, 'u': 0}`.\nالجواب:", "qhash": "1712e0736fcdbb4c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'ailt'}", "tests": ["assert count_chars('go an') == {'a': 1, 'i': 0, 'l': 0, 't': 0}", "assert count_chars('of matrix cloud signal of') == {'a': 2, 'i': 2, 'l': 2, 't': 1}", "assert count_chars('is window on table') == {'a': 1, 'i': 2, 'l': 1, 't': 1}", "assert count_chars('desert of python') == {'a': 0, 'i': 0, 'l': 0, 't': 2}", "assert count_chars('an') == {'a': 1, 'i': 0, 'l': 0, 't': 0}", "assert count_chars('apple to music brain we of') == {'a': 2, 'i': 2, 'l': 1, 't': 1}", "assert count_chars('') == {'a': 0, 'i': 0, 'l': 0, 't': 0}"], "test_code": "assert count_chars('go an') == {'a': 1, 'i': 0, 'l': 0, 't': 0}\nassert count_chars('of matrix cloud signal of') == {'a': 2, 'i': 2, 'l': 2, 't': 1}\nassert count_chars('is window on table') == {'a': 1, 'i': 2, 'l': 1, 't': 1}\nassert count_chars('desert of python') == {'a': 0, 'i': 0, 'l': 0, 't': 2}\nassert count_chars('an') == {'a': 1, 'i': 0, 'l': 0, 't': 0}\nassert count_chars('apple to music brain we of') == {'a': 2, 'i': 2, 'l': 1, 't': 1}\nassert count_chars('') == {'a': 0, 'i': 0, 'l': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'ailt'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'ailt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'i'، 'l'، 't' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('go an')` يجب أن تُرجع `{'a': 1, 'i': 0, 'l': 0, 't': 0}`.\nالجواب:", "qhash": "07f71c2f59120629"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -12 <= x <= 24)", "tests": ["assert pick_between([34, 13, -5, -7, 31, -8, -18, -3, 3, 24]) == [-32, -28, -20, -12, 12, 52, 96]", "assert pick_between([8]) == [32]", "assert pick_between([59, -30, 47, 20, -13, -16, -15]) == [80]", "assert pick_between([18, 6]) == [24, 72]", "assert pick_between([-9, 38, 12, 25, 47, 14, 21, -6, 28]) == [-36, -24, 48, 56, 84]", "assert pick_between([57, 48, 10]) == [40]", "assert pick_between([-4]) == [-16]", "assert pick_between([]) == []"], "test_code": "assert pick_between([34, 13, -5, -7, 31, -8, -18, -3, 3, 24]) == [-32, -28, -20, -12, 12, 52, 96]\nassert pick_between([8]) == [32]\nassert pick_between([59, -30, 47, 20, -13, -16, -15]) == [80]\nassert pick_between([18, 6]) == [24, 72]\nassert pick_between([-9, 38, 12, 25, 47, 14, 21, -6, 28]) == [-36, -24, 48, 56, 84]\nassert pick_between([57, 48, 10]) == [40]\nassert pick_between([-4]) == [-16]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 4 for x in xs if -12 <= x <= 24)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 4 for x in xs if -12 <= x <= 24)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -12 ≤ x ≤ 24، اضرب كلًا منها في 4، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([34, 13, -5, -7, 31, -8, -18, -3, 3, 24])` يُرجع `[-32, -28, -20, -12, 12, 52, 96]`.\nالجواب:", "qhash": "ced72f469ae275a2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "tests": ["assert sum_div(101) == 2550", "assert sum_div(37) == 342", "assert sum_div(40) == 380", "assert sum_div(46) == 506", "assert sum_div(177) == 7832", "assert sum_div(251) == 15750", "assert sum_div(1) == 0"], "test_code": "assert sum_div(101) == 2550\nassert sum_div(37) == 342\nassert sum_div(40) == 380\nassert sum_div(46) == 506\nassert sum_div(177) == 7832\nassert sum_div(251) == 15750\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 2 أو على 4.\nمثال: `sum_div(101)` يجب أن تُرجع `2550`.\nالجواب:", "qhash": "72f2d245de606386"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 5)", "tests": ["assert in_range_scaled([7, -6, -4, 13, -7]) == [-4]", "assert in_range_scaled([46, -19, -14, 26, 50, -7, 60]) == []", "assert in_range_scaled([10, 29, -17, 59, 0, 5]) == [0, 5]", "assert in_range_scaled([43, 37, 25, 8, 29, 28, 58]) == []", "assert in_range_scaled([39, 17, 18, -16]) == []", "assert in_range_scaled([45, 40, -19, -3, -13, -16]) == [-3]", "assert in_range_scaled([-9]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([7, -6, -4, 13, -7]) == [-4]\nassert in_range_scaled([46, -19, -14, 26, 50, -7, 60]) == []\nassert in_range_scaled([10, 29, -17, 59, 0, 5]) == [0, 5]\nassert in_range_scaled([43, 37, 25, 8, 29, 28, 58]) == []\nassert in_range_scaled([39, 17, 18, -16]) == []\nassert in_range_scaled([45, 40, -19, -3, -13, -16]) == [-3]\nassert in_range_scaled([-9]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 5)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 1 for x in xs if -4 <= x <= 5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -4 ≤ x ≤ 5، اضرب كلًا منها في 1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([7, -6, -4, 13, -7])` يُرجع `[-4]`.\nالجواب:", "qhash": "b20711c1c96d328a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(12))\n```\nالجواب:", "qhash": "ab99d8604723072a", "answer": "610", "completion": " الناتج:\n```text\n610\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 89", "tests": ["assert step_product(4) == 4", "assert step_product(54) == 30", "assert step_product(57) == 52", "assert step_product(0) == 1", "assert step_product(19) == 64", "assert step_product(51) == 22", "assert step_product(0) == 1"], "test_code": "assert step_product(4) == 4\nassert step_product(54) == 30\nassert step_product(57) == 52\nassert step_product(0) == 1\nassert step_product(19) == 64\nassert step_product(51) == 22\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 89", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(4)` يُرجع `4`.\nالجواب:", "qhash": "1e1fb6f952fb9e13"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "tests": ["assert weighted_sum(3) == 2484", "assert weighted_sum(12) == 5676372", "assert weighted_sum(2) == 297", "assert weighted_sum(14) == 13858425", "assert weighted_sum(1) == 9", "assert weighted_sum(1) == 9", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 2484\nassert weighted_sum(12) == 5676372\nassert weighted_sum(2) == 297\nassert weighted_sum(14) == 13858425\nassert weighted_sum(1) == 9\nassert weighted_sum(1) == 9\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 5\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 5\n return total\n```\nمثال: `weighted_sum(3)` يجب أن تُرجع `2484`.\nالجواب:", "qhash": "f901e10c0ad7dedf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('by winter to apple rocket') == 'ol jvagre gb nccyr ebpxrg'", "assert shift_text('orange python garden python of 2024') == 'benatr clguba tneqra clguba bs 2024'", "assert shift_text('code pixel data garden vector OK') == 'pbqr cvkry qngn tneqra irpgbe OK'", "assert shift_text('banana') == 'onanan'", "assert shift_text('vector winter we') == 'irpgbe jvagre jr'", "assert shift_text('music summer') == 'zhfvp fhzzre'", "assert shift_text('') == ''"], "test_code": "assert shift_text('by winter to apple rocket') == 'ol jvagre gb nccyr ebpxrg'\nassert shift_text('orange python garden python of 2024') == 'benatr clguba tneqra clguba bs 2024'\nassert shift_text('code pixel data garden vector OK') == 'pbqr cvkry qngn tneqra irpgbe OK'\nassert shift_text('banana') == 'onanan'\nassert shift_text('vector winter we') == 'irpgbe jvagre jr'\nassert shift_text('music summer') == 'zhfvp fhzzre'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('by winter to apple rocket')` يجب أن تُرجع `'ol jvagre gb nccyr ebpxrg'`.\nالجواب:", "qhash": "81be946f101d45ad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 2\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(6))", "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(6))\n```\nالجواب:", "qhash": "8604b7aab378b9a6", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(1, 1))", "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, 1))\n```\nالجواب:", "qhash": "03106f814bfbb426", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 25611\nsteps = 0\nwhile n > 5:\n n = n // 4\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 25611\nsteps = 0\nwhile n > 5:\n n = n // 4\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "86f3dc1b039292e7", "answer": "1 7", "completion": " الناتج:\n```text\n1 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'planet_desert'\nprint(text.index('e') + len(text))\nprint(text[-4:])\nprint(text.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'planet_desert'\nprint(text.index('e') + len(text))\nprint(text[-4:])\nprint(text.upper())\n```\nالجواب:", "qhash": "50db4ab04a4020c2", "answer": "17\nsert\nPLANET_DESERT", "completion": " الناتج:\n```text\n17\nsert\nPLANET_DESERT\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(9) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9']", "assert play(11) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11']", "assert play(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']", "assert play(11) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11']", "assert play(14) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac']"], "test_code": "assert play(9) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9']\nassert play(11) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11']\nassert play(16) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac', '15', 'Tic']\nassert play(11) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11']\nassert play(14) == ['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9', '10', '11', 'Tic', '13', 'Tac']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Tic'\n if i % 7 == 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 % 4 == 0:\n s += 'Tic'\n if i % 7 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Tic'، وعلى 7 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(9)` يجب أن تُرجع `['1', '2', '3', 'Tic', '5', '6', 'Tac', 'Tic', '9']`.\nالجواب:", "qhash": "fd797e6665515bb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([2, 33, 45, -18, 16]) == None", "assert top_divisible([-14, -35, -14]) == -14", "assert top_divisible([1, 8]) == None", "assert top_divisible([-14, 12, 10, 21, 36, -14, 36, -7]) == 21", "assert top_divisible([36, 19, -4, 20]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([2, 33, 45, -18, 16]) == None\nassert top_divisible([-14, -35, -14]) == -14\nassert top_divisible([1, 8]) == None\nassert top_divisible([-14, 12, 10, 21, 36, -14, 36, -7]) == 21\nassert top_divisible([36, 19, -4, 20]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef top_divisible(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def top_divisible(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([2, 33, 45, -18, 16])` يُرجع `None`.\nالجواب:", "qhash": "a9ccc34c4ff2f301"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 8) // 4 for x in range(5, 19) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 8) // 4 for x in range(5, 19) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "ee9121ea0eb9cf03", "answer": "[4, 5, 6]\n3 15", "completion": " الناتج:\n```text\n[4, 5, 6]\n3 15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ا»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('برتقال شجرة نهر سلام جمل قلم')` يُرجع `0`.\nالجواب:", "qhash": "aa4cb7fa2fad95dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('قمر جمل نهر مدينة جمل ليل حصان نور') == 1", "assert how_many('سوق قلم') == 1", "assert how_many('نور حصان مطر') == 0", "assert how_many('مدينة صحراء') == 0", "assert how_many('خبز خبز لغة برتقال دفتر مطر باب') == 0", "assert how_many('شمس قمر طالب') == 1", "assert how_many('') == 0"], "test_code": "assert how_many('طائرة معلم بحر برتقال خبز') == 0\nassert how_many('قمر جمل نهر مدينة جمل ليل حصان نور') == 1\nassert how_many('سوق قلم') == 1\nassert how_many('نور حصان مطر') == 0\nassert how_many('مدينة صحراء') == 0\nassert how_many('خبز خبز لغة برتقال دفتر مطر باب') == 0\nassert how_many('شمس قمر طالب') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('طائرة معلم بحر برتقال خبز')` يُرجع `0`.\nالجواب:", "qhash": "2b11095c72e9e7ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'قهوة'\nprint(kalima.find('ا'))\nprint('ا' in kalima)\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'قهوة'\nprint(kalima.find('ا'))\nprint('ا' in kalima)\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "b98628190d98fe95", "answer": "-1\nFalse\nقهوة", "completion": " الناتج:\n```text\n-1\nFalse\nقهوة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -1 <= x <= 27)", "tests": ["assert filter_range([8, 32, 20, 21, -6, 11, 9, 27]) == [-27, -21, -20, -11, -9, -8]", "assert filter_range([43, 0, -21, 55, 32, 37, -2, -15, 4, -18]) == [-4, 0]", "assert filter_range([59, 5, 54, 22, 16, 43]) == [-22, -16, -5]", "assert filter_range([]) == []", "assert filter_range([1, -4, -19, -24, 13]) == [-13, -1]", "assert filter_range([1, 18, 16, -12]) == [-18, -16, -1]", "assert filter_range([-14]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([8, 32, 20, 21, -6, 11, 9, 27]) == [-27, -21, -20, -11, -9, -8]\nassert filter_range([43, 0, -21, 55, 32, 37, -2, -15, 4, -18]) == [-4, 0]\nassert filter_range([59, 5, 54, 22, 16, 43]) == [-22, -16, -5]\nassert filter_range([]) == []\nassert filter_range([1, -4, -19, -24, 13]) == [-13, -1]\nassert filter_range([1, 18, 16, -12]) == [-18, -16, -1]\nassert filter_range([-14]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -1 for x in xs if -1 <= x <= 27)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -1 for x in xs if -1 <= x <= 27)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -1 و27 (شاملًا الطرفين) في -1.\nمثال: `filter_range([8, 32, 20, 21, -6, 11, 9, 27])` يجب أن تُرجع `[-27, -21, -20, -11, -9, -8]`.\nالجواب:", "qhash": "91bf49489770cabf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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('in coffee banana banana Hello') == 'ns htkkjj gfsfsf gfsfsf Hjqqt'", "assert rotate_letters('light light to in go OK') == 'qnlmy qnlmy yt ns lt OK'", "assert rotate_letters('signal is go by') == 'xnlsfq nx lt gd'", "assert rotate_letters('matrix') == 'rfywnc'", "assert rotate_letters('code code signal at an A1') == 'htij htij xnlsfq fy fs A1'", "assert rotate_letters('a planet cloud data 2024') == 'f uqfsjy hqtzi ifyf 2024'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('in coffee banana banana Hello') == 'ns htkkjj gfsfsf gfsfsf Hjqqt'\nassert rotate_letters('light light to in go OK') == 'qnlmy qnlmy yt ns lt OK'\nassert rotate_letters('signal is go by') == 'xnlsfq nx lt gd'\nassert rotate_letters('matrix') == 'rfywnc'\nassert rotate_letters('code code signal at an A1') == 'htij htij xnlsfq fy fs A1'\nassert rotate_letters('a planet cloud data 2024') == 'f uqfsjy hqtzi ifyf 2024'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('in coffee banana banana Hello')` يجب أن تُرجع `'ns htkkjj gfsfsf gfsfsf Hjqqt'`.\nالجواب:", "qhash": "4a78a0708c621c57"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [7, 16, 23, 38, 35, 16, 7]\nprint(a[2:5])\nprint(a[::3])\nprint(sum(a[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [7, 16, 23, 38, 35, 16, 7]\nprint(a[2:5])\nprint(a[::3])\nprint(sum(a[2:5]))\n```\nالجواب:", "qhash": "01d2562685ce8575", "answer": "[23, 38, 35]\n[7, 38, 7]\n96", "completion": " الناتج:\n```text\n[23, 38, 35]\n[7, 38, 7]\n96\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=2):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(17))\nprint(h(17, 5))\nprint(h(h(5), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=2):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(h(17))\nprint(h(17, 5))\nprint(h(h(5), 17))\n```\nالجواب:", "qhash": "7eca9c22d84ed6e0", "answer": "83\n80\n98", "completion": " الناتج:\n```text\n83\n80\n98\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'ehnt'}", "tests": ["assert tally('of engine we') == {'e': 3, 'h': 0, 'n': 2, 't': 0}", "assert tally('table stone is brain brain') == {'e': 2, 'h': 0, 'n': 3, 't': 2}", "assert tally('signal') == {'e': 0, 'h': 0, 'n': 1, 't': 0}", "assert tally('coffee') == {'e': 2, 'h': 0, 'n': 0, 't': 0}", "assert tally('garden pixel code music garden') == {'e': 4, 'h': 0, 'n': 2, 't': 0}", "assert tally('apple table a') == {'e': 2, 'h': 0, 'n': 0, 't': 1}", "assert tally('') == {'e': 0, 'h': 0, 'n': 0, 't': 0}"], "test_code": "assert tally('of engine we') == {'e': 3, 'h': 0, 'n': 2, 't': 0}\nassert tally('table stone is brain brain') == {'e': 2, 'h': 0, 'n': 3, 't': 2}\nassert tally('signal') == {'e': 0, 'h': 0, 'n': 1, 't': 0}\nassert tally('coffee') == {'e': 2, 'h': 0, 'n': 0, 't': 0}\nassert tally('garden pixel code music garden') == {'e': 4, 'h': 0, 'n': 2, 't': 0}\nassert tally('apple table a') == {'e': 2, 'h': 0, 'n': 0, 't': 1}\nassert tally('') == {'e': 0, 'h': 0, 'n': 0, 't': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'ehnt'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'ehnt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'h'، 'n'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('of engine we')` يُرجع `{'e': 3, 'h': 0, 'n': 2, 't': 0}`.\nالجواب:", "qhash": "5c405564c522d6e6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('كتاب كتاب خبز معلم رمل قمر سلام') == 2", "assert lead_count('كتاب قهوة ميناء سماء مطر نور كتاب') == 2", "assert lead_count('جبل سلام ليل صحراء ميناء كتاب قمر') == 1", "assert lead_count('قهوة خبز') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('سيارة نور عمل معلم علم كتاب شمس') == 1\nassert lead_count('صحراء تفاحة برمجة رمل') == 0\nassert lead_count('كتاب كتاب خبز معلم رمل قمر سلام') == 2\nassert lead_count('كتاب قهوة ميناء سماء مطر نور كتاب') == 2\nassert lead_count('جبل سلام ليل صحراء ميناء كتاب قمر') == 1\nassert lead_count('قهوة خبز') == 0\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.split():\n if w.endswith('ك'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ك»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef lead_count(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ك'):\n count += 1\n return count\n```\nمثال: `lead_count('سيارة نور عمل معلم علم كتاب شمس')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "f2e9f059bc0e48fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72", "tests": ["assert sum_digit_pow(31197) == 21", "assert sum_digit_pow(281019) == 21", "assert sum_digit_pow(705883) == 31", "assert sum_digit_pow(447767) == 35", "assert sum_digit_pow(441695) == 29", "assert sum_digit_pow(117190) == 19", "assert sum_digit_pow(734690) == 29", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(31197) == 21\nassert sum_digit_pow(281019) == 21\nassert sum_digit_pow(705883) == 31\nassert sum_digit_pow(447767) == 35\nassert sum_digit_pow(441695) == 29\nassert sum_digit_pow(117190) == 19\nassert sum_digit_pow(734690) == 29\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 72\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 72.\nمثال: `sum_digit_pow(31197)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "a5def98a13c47269"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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 window river camel') == 'camel/river/window/brain'", "assert mirror_words('to engine banana in of music is table') == 'table/is/music/of/in/banana/engine/to'", "assert mirror_words('table of signal in of rocket cloud orange') == 'orange/cloud/rocket/of/in/signal/of/table'", "assert mirror_words('pixel') == 'pixel'", "assert mirror_words('coffee we') == 'we/coffee'", "assert mirror_words('') == ''", "assert mirror_words('code rocket cloud on up table garden') == 'garden/table/up/on/cloud/rocket/code'"], "test_code": "assert mirror_words('brain window river camel') == 'camel/river/window/brain'\nassert mirror_words('to engine banana in of music is table') == 'table/is/music/of/in/banana/engine/to'\nassert mirror_words('table of signal in of rocket cloud orange') == 'orange/cloud/rocket/of/in/signal/of/table'\nassert mirror_words('pixel') == 'pixel'\nassert mirror_words('coffee we') == 'we/coffee'\nassert mirror_words('') == ''\nassert mirror_words('code rocket cloud on up table garden') == 'garden/table/up/on/cloud/rocket/code'", "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 window river camel')` يجب أن تُرجع `'camel/river/window/brain'`.\nالجواب:", "qhash": "9c599bcf3b282fd9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total", "tests": ["assert scaled_powers(6) == 882", "assert scaled_powers(5) == 450", "assert scaled_powers(3) == 72", "assert scaled_powers(12) == 12168", "assert scaled_powers(7) == 1568", "assert scaled_powers(1) == 2", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(6) == 882\nassert scaled_powers(5) == 450\nassert scaled_powers(3) == 72\nassert scaled_powers(12) == 12168\nassert scaled_powers(7) == 1568\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 ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(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 scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 2 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(6)` يُرجع `882`.\nالجواب:", "qhash": "b4ec3fffc31c5446"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23", "tests": ["assert rec_prod(11) == 22", "assert rec_prod(55) == 0", "assert rec_prod(32) == 2", "assert rec_prod(19) == 12", "assert rec_prod(12) == 11", "assert rec_prod(36) == 10", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 22\nassert rec_prod(55) == 0\nassert rec_prod(32) == 2\nassert rec_prod(19) == 12\nassert rec_prod(12) == 11\nassert rec_prod(36) == 10\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(11)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "f2331eb3292ff724"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -2 for x in xs if 13 <= x <= 40)", "tests": ["assert filter_range([29, 21, 10, 6, 40, 46, 31, 41, 37]) == [-80, -74, -62, -58, -42]", "assert filter_range([52, 29, 31, 37]) == [-74, -62, -58]", "assert filter_range([12, 58, -1, 0, -25, -19, 18, 23]) == [-46, -36]", "assert filter_range([54, 44, 36]) == [-72]", "assert filter_range([41, 9, 3, -3]) == []", "assert filter_range([59, -10, 25, 39, 43]) == [-78, -50]", "assert filter_range([26, 18, 46, -25]) == [-52, -36]", "assert filter_range([]) == []"], "test_code": "assert filter_range([29, 21, 10, 6, 40, 46, 31, 41, 37]) == [-80, -74, -62, -58, -42]\nassert filter_range([52, 29, 31, 37]) == [-74, -62, -58]\nassert filter_range([12, 58, -1, 0, -25, -19, 18, 23]) == [-46, -36]\nassert filter_range([54, 44, 36]) == [-72]\nassert filter_range([41, 9, 3, -3]) == []\nassert filter_range([59, -10, 25, 39, 43]) == [-78, -50]\nassert filter_range([26, 18, 46, -25]) == [-52, -36]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -2 for x in xs if 13 <= x <= 40)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -2 for x in xs if 13 <= x <= 40)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 13 و40 (شاملًا الطرفين) في -2.\nمثال: `filter_range([29, 21, 10, 6, 40, 46, 31, 41, 37])` يجب أن تُرجع `[-80, -74, -62, -58, -42]`.\nالجواب:", "qhash": "2792d70cd0423f75"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('شمس ماء نهر ماء علم خبز حديقة') == 1", "assert how_many('خبز برتقال لغة طالب سفينة ماء سفينة') == 0", "assert how_many('') == 0", "assert how_many('جمل باب برتقال دفتر شمس نهر كتاب') == 1", "assert how_many('تفاحة جبل عربية مكتبة') == 0", "assert how_many('طالب حاسوب وردة') == 0", "assert how_many('') == 0"], "test_code": "assert 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\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": "827d82765c444451"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-1, -7, 25, 15, -5, 40]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-1, -7, 25, 15, -5, 40]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "032b7a13f9ed18a5", "answer": "[-5, -1, -7, 15, 25, 40]\n[40, 25, 15]", "completion": " الناتج:\n```text\n[-5, -1, -7, 15, 25, 40]\n[40, 25, 15]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(calc(18))\nprint(calc(18, 12))\nprint(calc(calc(12), 18))", "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(18))\nprint(calc(18, 12))\nprint(calc(calc(12), 18))\n```\nالجواب:", "qhash": "f880de7bd68db9a8", "answer": "45\n42\n63", "completion": " الناتج:\n```text\n45\n42\n63\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 11796\ncount = 0\nwhile x > 10:\n x = x // 6\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 11796\ncount = 0\nwhile x > 10:\n x = x // 6\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "c401f4138779aae0", "answer": "9 4", "completion": " الناتج:\n```text\n9 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('يمل باب مدينة معلم مطر') == 1", "assert lead_count('رمل رمل وردة حاسوب شمس') == 0", "assert lead_count('ماء قلم معلم حديقة سماء برتقال') == 0", "assert lead_count('صحراء صحراء تفاحة') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('سوق يمل شجرة') == 1\nassert lead_count('لغة مطر سيارة') == 0\nassert lead_count('يمل باب مدينة معلم مطر') == 1\nassert lead_count('رمل رمل وردة حاسوب شمس') == 0\nassert lead_count('ماء قلم معلم حديقة سماء برتقال') == 0\nassert lead_count('صحراء صحراء تفاحة') == 0\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": "53373239ec7b5e6f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'alru'}", "tests": ["assert count_chars('vector window up engine orange table') == {'a': 2, 'l': 1, 'r': 2, 'u': 1}", "assert count_chars('river garden') == {'a': 1, 'l': 0, 'r': 3, 'u': 0}", "assert count_chars('go') == {'a': 0, 'l': 0, 'r': 0, 'u': 0}", "assert count_chars('apple') == {'a': 1, 'l': 1, 'r': 0, 'u': 0}", "assert count_chars('engine signal pixel falcon go music') == {'a': 2, 'l': 3, 'r': 0, 'u': 1}", "assert count_chars('matrix to go data an') == {'a': 4, 'l': 0, 'r': 1, 'u': 0}", "assert count_chars('') == {'a': 0, 'l': 0, 'r': 0, 'u': 0}"], "test_code": "assert count_chars('vector window up engine orange table') == {'a': 2, 'l': 1, 'r': 2, 'u': 1}\nassert count_chars('river garden') == {'a': 1, 'l': 0, 'r': 3, 'u': 0}\nassert count_chars('go') == {'a': 0, 'l': 0, 'r': 0, 'u': 0}\nassert count_chars('apple') == {'a': 1, 'l': 1, 'r': 0, 'u': 0}\nassert count_chars('engine signal pixel falcon go music') == {'a': 2, 'l': 3, 'r': 0, 'u': 1}\nassert count_chars('matrix to go data an') == {'a': 4, 'l': 0, 'r': 1, 'u': 0}\nassert count_chars('') == {'a': 0, 'l': 0, 'r': 0, 'u': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'alru'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'alru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'a'، 'l'، 'r'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('vector window up engine orange table')` يُرجع `{'a': 2, 'l': 1, 'r': 2, 'u': 1}`.\nالجواب:", "qhash": "3cdb75bed1890d74"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([2, 34, 25, 23, 0, 15, 47]) == [23, 0, 15, 47, 2, 34, 25]", "assert rotate_list([5, 39, 12, -2]) == [12, -2, 5, 39]", "assert rotate_list([-6, 29, 30, 47, -1]) == [30, 47, -1, -6, 29]", "assert rotate_list([41]) == [41]", "assert rotate_list([2]) == [2]", "assert rotate_list([27, 12, 15, 32, -3]) == [15, 32, -3, 27, 12]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([2, 34, 25, 23, 0, 15, 47]) == [23, 0, 15, 47, 2, 34, 25]\nassert rotate_list([5, 39, 12, -2]) == [12, -2, 5, 39]\nassert rotate_list([-6, 29, 30, 47, -1]) == [30, 47, -1, -6, 29]\nassert rotate_list([41]) == [41]\nassert rotate_list([2]) == [2]\nassert rotate_list([27, 12, 15, 32, -3]) == [15, 32, -3, 27, 12]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 18 % 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 = 18 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return ____\n```\nمثال: `rotate_list([2, 34, 25, 23, 0, 15, 47])` يجب أن تُرجع `[23, 0, 15, 47, 2, 34, 25]`.\nالجواب:", "qhash": "8be4dd0b97d7f48a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('at of cloud a A1') == 'un iz wfiox u A1'", "assert shift_text('matrix') == 'gunlcr'", "assert shift_text('camel Hello') == 'wugyf Hyffi'", "assert shift_text('desert an matrix') == 'xymyln uh gunlcr'", "assert shift_text('camel an winter A1') == 'wugyf uh qchnyl A1'", "assert shift_text('music window at') == 'gomcw qchxiq un'", "assert shift_text('') == ''"], "test_code": "assert shift_text('at of cloud a A1') == 'un iz wfiox u A1'\nassert shift_text('matrix') == 'gunlcr'\nassert shift_text('camel Hello') == 'wugyf Hyffi'\nassert shift_text('desert an matrix') == 'xymyln uh gunlcr'\nassert shift_text('camel an winter A1') == 'wugyf uh qchnyl A1'\nassert shift_text('music window at') == 'gomcw qchxiq un'\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 + (20)) % 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 + (20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('at of cloud a A1')` يُرجع `'un iz wfiox u A1'`.\nالجواب:", "qhash": "fa93f30dc9045cbd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 6 * x ** 2 + (-8) * x + (8)", "tests": ["assert poly(5) == 118", "assert poly(-3) == 86", "assert poly(-16) == 1672", "assert poly(8) == 328", "assert poly(11) == 646", "assert poly(16) == 1416", "assert poly(-2) == 48", "assert poly(0) == 8"], "test_code": "assert poly(5) == 118\nassert poly(-3) == 86\nassert poly(-16) == 1672\nassert poly(8) == 328\nassert poly(11) == 646\nassert poly(16) == 1416\nassert poly(-2) == 48\nassert poly(0) == 8", "answer": "def poly(x):\n return 6 * x ** 2 + (-8) * x + (8)", "completion": " ```python\ndef poly(x):\n return 6 * x ** 2 + (-8) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 6x² - 8x + 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(5)` يُرجع `118`.\nالجواب:", "qhash": "c7b93fd2a8751adb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "tests": ["assert total_pow(6) == 3087", "assert total_pow(10) == 21175", "assert total_pow(13) == 57967", "assert total_pow(10) == 21175", "assert total_pow(9) == 14175", "assert total_pow(1) == 7", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 3087\nassert total_pow(10) == 21175\nassert total_pow(13) == 57967\nassert total_pow(10) == 21175\nassert total_pow(9) == 14175\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 ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total\n```\n", "buggy": "def total_pow(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 total_pow(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `total_pow(6)` يُرجع `3087`.\nالجواب:", "qhash": "f08d9b9a4413dfab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(arr):\n if not arr:\n return []\n k = 6 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([40, 11, 35, 20, 41, 45]) == [40, 11, 35, 20, 41, 45]", "assert roll([31, 38, 18, 26, 1, 18]) == [31, 38, 18, 26, 1, 18]", "assert roll([-6, 24]) == [-6, 24]", "assert roll([8]) == [8]", "assert roll([-7, 48, -3, 17, -1, 33, -2]) == [48, -3, 17, -1, 33, -2, -7]", "assert roll([39, 11, 31, 32, 8, 31, 43, 47, 34, 21, 27]) == [31, 43, 47, 34, 21, 27, 39, 11, 31, 32, 8]", "assert roll([]) == []"], "test_code": "assert roll([40, 11, 35, 20, 41, 45]) == [40, 11, 35, 20, 41, 45]\nassert roll([31, 38, 18, 26, 1, 18]) == [31, 38, 18, 26, 1, 18]\nassert roll([-6, 24]) == [-6, 24]\nassert roll([8]) == [8]\nassert roll([-7, 48, -3, 17, -1, 33, -2]) == [48, -3, 17, -1, 33, -2, -7]\nassert roll([39, 11, 31, 32, 8, 31, 43, 47, 34, 21, 27]) == [31, 43, 47, 34, 21, 27, 39, 11, 31, 32, 8]\nassert roll([]) == []", "answer": "def roll(arr):\n if not arr:\n return []\n k = 6 % 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 = 6 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef roll(arr):\n if not arr:\n return []\n k = 6 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `roll([40, 11, 35, 20, 41, 45])` يُرجع `[40, 11, 35, 20, 41, 45]`.\nالجواب:", "qhash": "3d5d8cb6e0af97c4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11", "tests": ["assert multi_fact(8) == 10", "assert multi_fact(18) == 6", "assert multi_fact(47) == 0", "assert multi_fact(43) == 0", "assert multi_fact(48) == 0", "assert multi_fact(24) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(8) == 10\nassert multi_fact(18) == 6\nassert multi_fact(47) == 0\nassert multi_fact(43) == 0\nassert multi_fact(48) == 0\nassert multi_fact(24) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 2)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `multi_fact(8)` يجب أن تُرجع `10`.\nالجواب:", "qhash": "d4a492f29290dad5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('a summer is is garden orange it') == 'it|orange|garden|is|is|summer|a'", "assert rev_join('light brain of on table coffee') == 'coffee|table|on|of|brain|light'", "assert rev_join('vector window winter table rocket rocket') == 'rocket|rocket|table|winter|window|vector'", "assert rev_join('it a camel window of river matrix to') == 'to|matrix|river|of|window|camel|a|it'", "assert rev_join('music camel river at desert brain signal window') == 'window|signal|brain|desert|at|river|camel|music'", "assert rev_join('window desert') == 'desert|window'", "assert rev_join('') == ''"], "test_code": "assert rev_join('a summer is is garden orange it') == 'it|orange|garden|is|is|summer|a'\nassert rev_join('light brain of on table coffee') == 'coffee|table|on|of|brain|light'\nassert rev_join('vector window winter table rocket rocket') == 'rocket|rocket|table|winter|window|vector'\nassert rev_join('it a camel window of river matrix to') == 'to|matrix|river|of|window|camel|a|it'\nassert rev_join('music camel river at desert brain signal window') == 'window|signal|brain|desert|at|river|camel|music'\nassert rev_join('window desert') == 'desert|window'\nassert rev_join('') == ''", "answer": "def rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `rev_join('a summer is is garden orange it')` يجب أن تُرجع `'it|orange|garden|is|is|summer|a'`.\nالجواب:", "qhash": "871f8d66bd3f68c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "turn_list", "reference": "def turn_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert turn_list([27, 30, 18, 23, 4, 37, 14, 28]) == [23, 4, 37, 14, 28, 27, 30, 18]", "assert turn_list([-4, 9, 16, 31, 25, 47, 46]) == [47, 46, -4, 9, 16, 31, 25]", "assert turn_list([-2, 12, 28, 50, 37, 4, 5, 1, 17, 25]) == [25, -2, 12, 28, 50, 37, 4, 5, 1, 17]", "assert turn_list([9, 4, 49, 13, 38, -4, 42, 43]) == [13, 38, -4, 42, 43, 9, 4, 49]", "assert turn_list([44, 22, -3, 34, 45, -4, -9, 8, 16, -2, 29]) == [16, -2, 29, 44, 22, -3, 34, 45, -4, -9, 8]", "assert turn_list([-6, 4, 26, 42, 3, 29, 2, -2, 1, 5, 37, -5]) == [-2, 1, 5, 37, -5, -6, 4, 26, 42, 3, 29, 2]", "assert turn_list([]) == []"], "test_code": "assert turn_list([27, 30, 18, 23, 4, 37, 14, 28]) == [23, 4, 37, 14, 28, 27, 30, 18]\nassert turn_list([-4, 9, 16, 31, 25, 47, 46]) == [47, 46, -4, 9, 16, 31, 25]\nassert turn_list([-2, 12, 28, 50, 37, 4, 5, 1, 17, 25]) == [25, -2, 12, 28, 50, 37, 4, 5, 1, 17]\nassert turn_list([9, 4, 49, 13, 38, -4, 42, 43]) == [13, 38, -4, 42, 43, 9, 4, 49]\nassert turn_list([44, 22, -3, 34, 45, -4, -9, 8, 16, -2, 29]) == [16, -2, 29, 44, 22, -3, 34, 45, -4, -9, 8]\nassert turn_list([-6, 4, 26, 42, 3, 29, 2, -2, 1, 5, 37, -5]) == [-2, 1, 5, 37, -5, -6, 4, 26, 42, 3, 29, 2]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef turn_list(xs):\n if not xs:\n return []\n k = 19 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `turn_list([27, 30, 18, 23, 4, 37, 14, 28])` يُرجع `[23, 4, 37, 14, 28, 27, 30, 18]`.\nالجواب:", "qhash": "9042df6a372336a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 4\nfor i in range(9, 33, 3):\n s -= i * 5\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 4\nfor i in range(9, 33, 3):\n s -= i * 5\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "7e125d33ff3c1141", "answer": "-776\n30", "completion": " الناتج:\n```text\n-776\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('banana data 2024') == 'pobobo roho 2024'", "assert caesar('pixel !') == 'dwlsz !'", "assert caesar('planet summer summer window desert Hello') == 'dzobsh giaasf giaasf kwbrck rsgsfh Hszzc'", "assert caesar('code light in light 2024') == 'qcrs zwuvh wb zwuvh 2024'", "assert caesar('banana camel') == 'pobobo qoasz'", "assert caesar('banana garden orange an Hello') == 'pobobo uofrsb cfobus ob Hszzc'", "assert caesar('') == ''"], "test_code": "assert caesar('banana data 2024') == 'pobobo roho 2024'\nassert caesar('pixel !') == 'dwlsz !'\nassert caesar('planet summer summer window desert Hello') == 'dzobsh giaasf giaasf kwbrck rsgsfh Hszzc'\nassert caesar('code light in light 2024') == 'qcrs zwuvh wb zwuvh 2024'\nassert caesar('banana camel') == 'pobobo qoasz'\nassert caesar('banana garden orange an Hello') == 'pobobo uofrsb cfobus ob Hszzc'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('banana data 2024')` يُرجع `'pobobo roho 2024'`.\nالجواب:", "qhash": "4120a8e349a14a46"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'signal'\nprint(word.capitalize())\nprint(word.replace('l', '0'))\nprint(word[-1:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'signal'\nprint(word.capitalize())\nprint(word.replace('l', '0'))\nprint(word[-1:])\n```\nالجواب:", "qhash": "e2ea353ffbbe9780", "answer": "Signal\nsigna0\nl", "completion": " الناتج:\n```text\nSignal\nsigna0\nl\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'light'\nprint(s[::-1])\nprint(s.index('t') + len(s))\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'light'\nprint(s[::-1])\nprint(s.index('t') + len(s))\nprint(s.capitalize())\n```\nالجواب:", "qhash": "46fe13ac8661d263", "answer": "thgil\n9\nLight", "completion": " الناتج:\n```text\nthgil\n9\nLight\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'engine'\nprint(word[2:4])\nprint(len(word))\nprint(word[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'engine'\nprint(word[2:4])\nprint(len(word))\nprint(word[::-1])\n```\nالجواب:", "qhash": "36c22a67f0261bb1", "answer": "gi\n6\nenigne", "completion": " الناتج:\n```text\ngi\n6\nenigne\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 91\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 = 91\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": "0c7a2d1886cadab7", "answer": "92", "completion": " الناتج:\n```text\n92\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 0) // 5 for x in range(-5, 0) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 0) // 5 for x in range(-5, 0) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "3d9b5af8ae0ba300", "answer": "[-1]\n1 -1", "completion": " الناتج:\n```text\n[-1]\n1 -1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([10, 21, 26, 43, -17, 9, -17]) == None", "assert biggest_mult([-8, -24, -8]) == -8", "assert biggest_mult([1, 9, 17]) == None", "assert biggest_mult([-7, 4]) == None", "assert biggest_mult([-13, 9, -1, 8]) == 8", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([10, 21, 26, 43, -17, 9, -17]) == None\nassert biggest_mult([-8, -24, -8]) == -8\nassert biggest_mult([1, 9, 17]) == None\nassert biggest_mult([-7, 4]) == None\nassert biggest_mult([-13, 9, -1, 8]) == 8\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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للتوضيح: الاستدعاء `biggest_mult([10, 21, 26, 43, -17, 9, -17])` يُرجع `None`.\nالجواب:", "qhash": "9f73201113be0507"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\n return total", "tests": ["assert weighted_sum(4) == 708", "assert weighted_sum(14) == 255374", "assert weighted_sum(5) == 1958", "assert weighted_sum(6) == 4550", "assert weighted_sum(15) == 356624", "assert weighted_sum(1) == 2", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 708\nassert weighted_sum(14) == 255374\nassert weighted_sum(5) == 1958\nassert weighted_sum(6) == 4550\nassert weighted_sum(15) == 356624\nassert weighted_sum(1) == 2\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 4\n return total", "completion": " ```python\ndef weighted_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 weighted_sum(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 weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 4\n return total\n```\nمثال: `weighted_sum(4)` يجب أن تُرجع `708`.\nالجواب:", "qhash": "be91d004b7f27db1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(17))\nprint(calc(17, -10))\nprint(calc(calc(-10), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(calc(17))\nprint(calc(17, -10))\nprint(calc(calc(-10), 17))\n```\nالجواب:", "qhash": "5e8cda27eea3bd8d", "answer": "131\n146\n223", "completion": " الناتج:\n```text\n131\n146\n223\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert backwards('data to planet at camel river') == 'river camel planet data'", "assert backwards('') == ''", "assert backwards('signal signal') == 'signal signal'", "assert backwards('light is cloud brain by a') == 'brain cloud light'", "assert backwards('brain apple orange garden') == 'garden orange apple brain'", "assert backwards('winter it brain table') == 'table brain winter'", "assert backwards('desert it stone desert music code rocket code') == 'code rocket code music desert stone desert'"], "test_code": "assert backwards('data to planet at camel river') == 'river camel planet data'\nassert backwards('') == ''\nassert backwards('signal signal') == 'signal signal'\nassert backwards('light is cloud brain by a') == 'brain cloud light'\nassert backwards('brain apple orange garden') == 'garden orange apple brain'\nassert backwards('winter it brain table') == 'table brain winter'\nassert backwards('desert it stone desert music code rocket code') == 'code rocket code music desert stone desert'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `backwards('data to planet at camel river')` يُرجع `'river camel planet data'`.\nالجواب:", "qhash": "84aea7084e416966"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'lrtu'}", "tests": ["assert tally('summer') == {'l': 0, 'r': 1, 't': 0, 'u': 1}", "assert tally('an planet planet desert at') == {'l': 2, 'r': 1, 't': 4, 'u': 0}", "assert tally('code apple at apple summer') == {'l': 2, 'r': 1, 't': 1, 'u': 1}", "assert tally('we summer engine falcon matrix') == {'l': 1, 'r': 2, 't': 1, 'u': 1}", "assert tally('summer it matrix matrix river signal') == {'l': 1, 'r': 5, 't': 3, 'u': 1}", "assert tally('planet winter orange brain rocket') == {'l': 1, 'r': 4, 't': 3, 'u': 0}", "assert tally('') == {'l': 0, 'r': 0, 't': 0, 'u': 0}"], "test_code": "assert tally('summer') == {'l': 0, 'r': 1, 't': 0, 'u': 1}\nassert tally('an planet planet desert at') == {'l': 2, 'r': 1, 't': 4, 'u': 0}\nassert tally('code apple at apple summer') == {'l': 2, 'r': 1, 't': 1, 'u': 1}\nassert tally('we summer engine falcon matrix') == {'l': 1, 'r': 2, 't': 1, 'u': 1}\nassert tally('summer it matrix matrix river signal') == {'l': 1, 'r': 5, 't': 3, 'u': 1}\nassert tally('planet winter orange brain rocket') == {'l': 1, 'r': 4, 't': 3, 'u': 0}\nassert tally('') == {'l': 0, 'r': 0, 't': 0, 'u': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'lrtu'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'lrtu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'l'، 'r'، 't'، 'u' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('summer')` يُرجع `{'l': 0, 'r': 1, 't': 0, 'u': 1}`.\nالجواب:", "qhash": "1ae6dfa4d6479567"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 5 for x in xs if 6 <= x <= 46)", "tests": ["assert select_range([15, 8, 7, 50, 56, 19, -1, -2, 28, 19]) == [35, 40, 75, 95, 95, 140]", "assert select_range([35, 15, 38, 10]) == [50, 75, 175, 190]", "assert select_range([-4, 46, -1]) == [230]", "assert select_range([18, 60, 32, -26, -12, 28, 50]) == [90, 140, 160]", "assert select_range([-27, 37, 4, 16, 18, 27, -26]) == [80, 90, 135, 185]", "assert select_range([47, -15, 2, -26, 46, -27, -17]) == [230]", "assert select_range([-10, 5, -22, 20, 11, -29, 25, -3, -5, 7]) == [35, 55, 100, 125]", "assert select_range([]) == []"], "test_code": "assert select_range([15, 8, 7, 50, 56, 19, -1, -2, 28, 19]) == [35, 40, 75, 95, 95, 140]\nassert select_range([35, 15, 38, 10]) == [50, 75, 175, 190]\nassert select_range([-4, 46, -1]) == [230]\nassert select_range([18, 60, 32, -26, -12, 28, 50]) == [90, 140, 160]\nassert select_range([-27, 37, 4, 16, 18, 27, -26]) == [80, 90, 135, 185]\nassert select_range([47, -15, 2, -26, 46, -27, -17]) == [230]\nassert select_range([-10, 5, -22, 20, 11, -29, 25, -3, -5, 7]) == [35, 55, 100, 125]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 5 for x in xs if 6 <= x <= 46)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 5 for x in xs if 6 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 6 ≤ x ≤ 46، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([15, 8, 7, 50, 56, 19, -1, -2, 28, 19])` يُرجع `[35, 40, 75, 95, 95, 140]`.\nالجواب:", "qhash": "3deb1fb558374c82"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('window up code') == 'code/up/window'", "assert rev_long_words('summer table it falcon planet') == 'planet/falcon/it/table/summer'", "assert rev_long_words('on camel cloud') == 'cloud/camel/on'", "assert rev_long_words('river cloud on desert garden table') == 'table/garden/desert/on/cloud/river'", "assert rev_long_words('coffee on apple vector') == 'vector/apple/on/coffee'", "assert rev_long_words('coffee engine summer in data') == 'data/in/summer/engine/coffee'", "assert rev_long_words('on cloud signal light planet table') == 'table/planet/light/signal/cloud/on'"], "test_code": "assert rev_long_words('window up code') == 'code/up/window'\nassert rev_long_words('summer table it falcon planet') == 'planet/falcon/it/table/summer'\nassert rev_long_words('on camel cloud') == 'cloud/camel/on'\nassert rev_long_words('river cloud on desert garden table') == 'table/garden/desert/on/cloud/river'\nassert rev_long_words('coffee on apple vector') == 'vector/apple/on/coffee'\nassert rev_long_words('coffee engine summer in data') == 'data/in/summer/engine/coffee'\nassert rev_long_words('on cloud signal light planet table') == 'table/planet/light/signal/cloud/on'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `rev_long_words('window up code')` يُرجع `'code/up/window'`.\nالجواب:", "qhash": "e25179c79ef49451"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([30, 51, -2, 34, 16, -17, -10, -11]) == 30", "assert max_multiple([-24, -30, -30]) == -24", "assert max_multiple([1, 7, 13, 19]) == None", "assert max_multiple([18, 4]) == 18", "assert max_multiple([49, 34, 27]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([30, 51, -2, 34, 16, -17, -10, -11]) == 30\nassert max_multiple([-24, -30, -30]) == -24\nassert max_multiple([1, 7, 13, 19]) == None\nassert max_multiple([18, 4]) == 18\nassert max_multiple([49, 34, 27]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 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 % 6 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(values):\n best = None\n for x in values:\n if x % 6 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_multiple([30, 51, -2, 34, 16, -17, -10, -11])` يجب أن تُرجع `30`.\nالجواب:", "qhash": "6e6da71c65a6a6ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(1))\nprint(f(1, 10))\nprint(f(f(10), 1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=5):\n if x > y:\n return x * -1 - y\n return x + y * -1\n\nprint(f(1))\nprint(f(1, 10))\nprint(f(f(10), 1))\n```\nالجواب:", "qhash": "a3fe39ab7d720f7d", "answer": "-4\n-9\n-16", "completion": " الناتج:\n```text\n-4\n-9\n-16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'علم'\nprint(w[::-1])\nprint(w[-1])\nprint(len(w))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'علم'\nprint(w[::-1])\nprint(w[-1])\nprint(len(w))\n```\nالجواب:", "qhash": "f47b095a674659d8", "answer": "ملع\nم\n3", "completion": " الناتج:\n```text\nملع\nم\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(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 running_sum([13, 58, 31, 22, 25, 93]) == [13, 71, 102, 124, 149, 0]", "assert running_sum([]) == []", "assert running_sum([135, 161, 50, 7, -2, 55, 42]) == [135, 0, 50, 57, 55, 110, 152]", "assert running_sum([]) == []", "assert running_sum([72, 113, 7, 3, 167, 18, 78, 82, 177]) == [72, 0, 7, 10, 177, 0, 78, 160, 0]", "assert running_sum([64, 8, 125, 88, 100, 124, 40, 148, 130]) == [64, 72, 0, 88, 0, 124, 164, 0, 130]", "assert running_sum([]) == []"], "test_code": "assert running_sum([13, 58, 31, 22, 25, 93]) == [13, 71, 102, 124, 149, 0]\nassert running_sum([]) == []\nassert running_sum([135, 161, 50, 7, -2, 55, 42]) == [135, 0, 50, 57, 55, 110, 152]\nassert running_sum([]) == []\nassert running_sum([72, 113, 7, 3, 167, 18, 78, 82, 177]) == [72, 0, 7, 10, 177, 0, 78, 160, 0]\nassert running_sum([64, 8, 125, 88, 100, 124, 40, 148, 130]) == [64, 72, 0, 88, 0, 124, 164, 0, 130]\nassert running_sum([]) == []", "answer": "def running_sum(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 running_sum(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سؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 183 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([13, 58, 31, 22, 25, 93])` يجب أن تُرجع `[13, 71, 102, 124, 149, 0]`.\nالجواب:", "qhash": "14aa093db47c9a4f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * 1 + -9 for x in range(2, 13) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * 1 + -9 for x in range(2, 13) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "5244b32d458d985f", "answer": "[-7, -5, -3, -1, 1, 3]\n6 -12", "completion": " الناتج:\n```text\n[-7, -5, -3, -1, 1, 3]\n6 -12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('امل نور امل قهوة كتاب') == 2", "assert lead_count('لغة حاسوب') == 0", "assert lead_count('بيت امل مطر معلم') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('نهار حصان جبل') == 0\nassert lead_count('علم نهار خبز طالب قلم علم امل') == 1\nassert lead_count('نهر امل شجرة') == 1\nassert lead_count('امل نور امل قهوة كتاب') == 2\nassert lead_count('لغة حاسوب') == 0\nassert lead_count('بيت امل مطر معلم') == 1\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 'ا' in w:\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 'ا' in w:\n count += 1\n return count\n```\nمثال: `lead_count('نهار حصان جبل')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "133a1bd47b092be8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'light'\nprint(s[::-1])\nprint(s.count('l'))\nprint(s.find('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'light'\nprint(s[::-1])\nprint(s.count('l'))\nprint(s.find('l'))\n```\nالجواب:", "qhash": "e77505c11084067c", "answer": "thgil\n1\n0", "completion": " الناتج:\n```text\nthgil\n1\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_multiple([57, 5, 10, -15, 6]) == None", "assert max_multiple([-45, -45, -9]) == -9", "assert max_multiple([1, 10]) == None", "assert max_multiple([-37, -29, 30, 32, -5, -22]) == None", "assert max_multiple([37, -31, -13, -37, 9]) == 9", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([57, 5, 10, -15, 6]) == None\nassert max_multiple([-45, -45, -9]) == -9\nassert max_multiple([1, 10]) == None\nassert max_multiple([-37, -29, 30, 32, -5, -22]) == None\nassert max_multiple([37, -31, -13, -37, 9]) == 9\nassert max_multiple([]) == None", "answer": "def max_multiple(xs):\n best = None\n for x in xs:\n if x % 9 == 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 % 9 == 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 % 9 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_multiple(xs):\n best = None\n for x in xs:\n if x % 9 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_multiple([57, 5, 10, -15, 6])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "2fe82eb956161800"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 57", "tests": ["assert digit_power(34762) == 4", "assert digit_power(279377) == 20", "assert digit_power(258345) == 18", "assert digit_power(181085) == 35", "assert digit_power(640241) == 53", "assert digit_power(930869) == 26", "assert digit_power(675222) == 45", "assert digit_power(0) == 0"], "test_code": "assert digit_power(34762) == 4\nassert digit_power(279377) == 20\nassert digit_power(258345) == 18\nassert digit_power(181085) == 35\nassert digit_power(640241) == 53\nassert digit_power(930869) == 26\nassert digit_power(675222) == 45\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 57", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 5 for d in str(n)) % 57\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_power(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 57.\nللتوضيح: الاستدعاء `digit_power(34762)` يُرجع `4`.\nالجواب:", "qhash": "0e12c707ca83f75f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 2:\n return n + 2\n return go(n - 1) + go(n - 2)\n\nprint(go(13))\n```\nالجواب:", "qhash": "4e319dff75e24b4b", "answer": "987", "completion": " الناتج:\n```text\n987\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([53, -3, 38, -23, 52, 12]) == None", "assert top_divisible([-36, -27, -18]) == -18", "assert top_divisible([1, 10, 19]) == None", "assert top_divisible([-14, 8, 3, -23, 24, -13]) == None", "assert top_divisible([-18, -12, 1, 45, 8, 11]) == 45", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([53, -3, 38, -23, 52, 12]) == None\nassert top_divisible([-36, -27, -18]) == -18\nassert top_divisible([1, 10, 19]) == None\nassert top_divisible([-14, 8, 3, -23, 24, -13]) == None\nassert top_divisible([-18, -12, 1, 45, 8, 11]) == 45\nassert top_divisible([]) == None", "answer": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 9 == 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 % 9 == 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 % 9 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(xs):\n best = None\n for x in xs:\n if x % 9 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([53, -3, 38, -23, 52, 12])` يُرجع `None`.\nالجواب:", "qhash": "e4913b1de4978255"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 7\nfor i in range(0, 4, 3):\n acc += i * 1\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 7\nfor i in range(0, 4, 3):\n acc += i * 1\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "879f84bf80dd63b4", "answer": "10\n3", "completion": " الناتج:\n```text\n10\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 20\nfor i in range(9, 17, 3):\n s -= i * 6\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 20\nfor i in range(9, 17, 3):\n s -= i * 6\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "9deb550a58996901", "answer": "-196\n15", "completion": " الناتج:\n```text\n-196\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(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 reset_sum([6, 32, 18, 17, 10, 20, 36]) == [6, 38, 56, 0, 10, 30, 0]", "assert reset_sum([-10, 18, 23, 60, 60]) == [-10, 8, 31, 0, 60]", "assert reset_sum([59, 12, 9, 34, 4]) == [59, 0, 9, 43, 47]", "assert reset_sum([32, 58, 11, 55, 47, 10, 52, 41, 21, -6]) == [32, 0, 11, 0, 47, 57, 0, 41, 62, 56]", "assert reset_sum([61, 64, 39, 49, 26, 51]) == [61, 0, 39, 0, 26, 0]", "assert reset_sum([]) == []", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([6, 32, 18, 17, 10, 20, 36]) == [6, 38, 56, 0, 10, 30, 0]\nassert reset_sum([-10, 18, 23, 60, 60]) == [-10, 8, 31, 0, 60]\nassert reset_sum([59, 12, 9, 34, 4]) == [59, 0, 9, 43, 47]\nassert reset_sum([32, 58, 11, 55, 47, 10, 52, 41, 21, -6]) == [32, 0, 11, 0, 47, 57, 0, 41, 62, 56]\nassert reset_sum([61, 64, 39, 49, 26, 51]) == [61, 0, 39, 0, 26, 0]\nassert reset_sum([]) == []\nassert reset_sum([]) == []", "answer": "def reset_sum(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 reset_sum(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سؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 64 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([6, 32, 18, 17, 10, 20, 36])` يُرجع `[6, 38, 56, 0, 10, 30, 0]`.\nالجواب:", "qhash": "7f126a327d737afa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'حصان نهر'\nprint(text.count('س'))\nprint(text.find('س'))\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'حصان نهر'\nprint(text.count('س'))\nprint(text.find('س'))\nprint(text[-1])\n```\nالجواب:", "qhash": "e3adec313d1f516d", "answer": "0\n-1\nر", "completion": " الناتج:\n```text\n0\n-1\nر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'chr'}", "tests": ["assert tally('code go') == {'c': 1, 'h': 0, 'r': 0}", "assert tally('winter') == {'c': 0, 'h': 0, 'r': 1}", "assert tally('falcon') == {'c': 1, 'h': 0, 'r': 0}", "assert tally('orange go a') == {'c': 0, 'h': 0, 'r': 1}", "assert tally('an signal banana music brain') == {'c': 1, 'h': 0, 'r': 1}", "assert tally('it garden at') == {'c': 0, 'h': 0, 'r': 1}", "assert tally('') == {'c': 0, 'h': 0, 'r': 0}"], "test_code": "assert tally('code go') == {'c': 1, 'h': 0, 'r': 0}\nassert tally('winter') == {'c': 0, 'h': 0, 'r': 1}\nassert tally('falcon') == {'c': 1, 'h': 0, 'r': 0}\nassert tally('orange go a') == {'c': 0, 'h': 0, 'r': 1}\nassert tally('an signal banana music brain') == {'c': 1, 'h': 0, 'r': 1}\nassert tally('it garden at') == {'c': 0, 'h': 0, 'r': 1}\nassert tally('') == {'c': 0, 'h': 0, 'r': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'chr'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'chr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'h'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('code go')` يُرجع `{'c': 1, 'h': 0, 'r': 0}`.\nالجواب:", "qhash": "b14e42a4629a9a87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 2:\n return n + 2\n return f(n - 1) + f(n - 2)\n\nprint(f(13))", "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(13))\n```\nالجواب:", "qhash": "a4fb95e01b349bcb", "answer": "987", "completion": " الناتج:\n```text\n987\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('it') == 'pa'", "assert rot('stone to code A1') == 'zavul av jvkl A1'", "assert rot('code summer 2024') == 'jvkl zbttly 2024'", "assert rot('at orange brain pixel brain') == 'ha vyhunl iyhpu wpels iyhpu'", "assert rot('data OK') == 'khah OK'", "assert rot('we in window') == 'dl pu dpukvd'", "assert rot('') == ''"], "test_code": "assert rot('it') == 'pa'\nassert rot('stone to code A1') == 'zavul av jvkl A1'\nassert rot('code summer 2024') == 'jvkl zbttly 2024'\nassert rot('at orange brain pixel brain') == 'ha vyhunl iyhpu wpels iyhpu'\nassert rot('data OK') == 'khah OK'\nassert rot('we in window') == 'dl pu dpukvd'\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 + (7)) % 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 + (7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('it')` يُرجع `'pa'`.\nالجواب:", "qhash": "748afbc02d0d5dcc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert game(13) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon', 'Sun', '9', 'Sun', '11', 'Sun', '13']", "assert game(1) == ['1']", "assert game(7) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon']", "assert game(6) == ['1', 'Sun', '3', 'Sun', '5', 'Sun']", "assert game(25) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon', 'Sun', '9', 'Sun', '11', 'Sun', '13', 'SunMoon', '15', 'Sun', '17', 'Sun', '19', 'Sun', 'Moon', 'Sun', '23', 'Sun', '25']"], "test_code": "assert game(13) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon', 'Sun', '9', 'Sun', '11', 'Sun', '13']\nassert game(1) == ['1']\nassert game(7) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon']\nassert game(6) == ['1', 'Sun', '3', 'Sun', '5', 'Sun']\nassert game(25) == ['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon', 'Sun', '9', 'Sun', '11', 'Sun', '13', 'SunMoon', '15', 'Sun', '17', 'Sun', '19', 'Sun', 'Moon', 'Sun', '23', 'Sun', '25']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Sun'\n if i % 7 == 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 % 2 == 0:\n s += 'Sun'\n if i % 7 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Sun'، وعلى 7 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(13)` يجب أن تُرجع `['1', 'Sun', '3', 'Sun', '5', 'Sun', 'Moon', 'Sun', '9', 'Sun', '11', 'Sun', '13']`.\nالجواب:", "qhash": "279f857c140b9fe2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('by at falcon apple') == 'apple|falcon'", "assert flip_words('') == ''", "assert flip_words('to orange summer coffee light on of summer') == 'summer|light|coffee|summer|orange'", "assert flip_words('garden to') == 'garden'", "assert flip_words('is planet') == 'planet'", "assert flip_words('') == ''", "assert flip_words('vector falcon engine') == 'engine|falcon|vector'"], "test_code": "assert flip_words('by at falcon apple') == 'apple|falcon'\nassert flip_words('') == ''\nassert flip_words('to orange summer coffee light on of summer') == 'summer|light|coffee|summer|orange'\nassert flip_words('garden to') == 'garden'\nassert flip_words('is planet') == 'planet'\nassert flip_words('') == ''\nassert flip_words('vector falcon engine') == 'engine|falcon|vector'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `flip_words('by at falcon apple')` يُرجع `'apple|falcon'`.\nالجواب:", "qhash": "2571a70bf8517ade"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'ehrs'}", "tests": ["assert count_chars('on falcon pixel up') == {'e': 1, 'h': 0, 'r': 0, 's': 0}", "assert count_chars('go a data is to') == {'e': 0, 'h': 0, 'r': 0, 's': 1}", "assert count_chars('engine') == {'e': 2, 'h': 0, 'r': 0, 's': 0}", "assert count_chars('code river go planet') == {'e': 3, 'h': 0, 'r': 2, 's': 0}", "assert count_chars('rocket a is data') == {'e': 1, 'h': 0, 'r': 1, 's': 1}", "assert count_chars('summer a garden cloud cloud') == {'e': 2, 'h': 0, 'r': 2, 's': 1}", "assert count_chars('') == {'e': 0, 'h': 0, 'r': 0, 's': 0}"], "test_code": "assert count_chars('on falcon pixel up') == {'e': 1, 'h': 0, 'r': 0, 's': 0}\nassert count_chars('go a data is to') == {'e': 0, 'h': 0, 'r': 0, 's': 1}\nassert count_chars('engine') == {'e': 2, 'h': 0, 'r': 0, 's': 0}\nassert count_chars('code river go planet') == {'e': 3, 'h': 0, 'r': 2, 's': 0}\nassert count_chars('rocket a is data') == {'e': 1, 'h': 0, 'r': 1, 's': 1}\nassert count_chars('summer a garden cloud cloud') == {'e': 2, 'h': 0, 'r': 2, 's': 1}\nassert count_chars('') == {'e': 0, 'h': 0, 'r': 0, 's': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'ehrs'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'ehrs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'h'، 'r'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('on falcon pixel up')` يُرجع `{'e': 1, 'h': 0, 'r': 0, 's': 0}`.\nالجواب:", "qhash": "479967e3638f7200"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + -2\n\nprint(f(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n <= 3:\n return 4\n return 3 * f(n - 1) + -2\n\nprint(f(8))\n```\nالجواب:", "qhash": "40e711198a9cfea7", "answer": "730", "completion": " الناتج:\n```text\n730\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(183218392))\nprint(calc(calc(183218392)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(183218392))\nprint(calc(calc(183218392)))\n```\nالجواب:", "qhash": "8ce11fa2f31523e9", "answer": "37\n10", "completion": " الناتج:\n```text\n37\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [32, 31, 14, -5, 34, 3, 3, 21, 7]\nprint(a[1:2])\nprint(a[::-2])\nprint(len(a[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [32, 31, 14, -5, 34, 3, 3, 21, 7]\nprint(a[1:2])\nprint(a[::-2])\nprint(len(a[1:2]))\n```\nالجواب:", "qhash": "038f73abb14bdd51", "answer": "[31]\n[7, 3, 34, 14, 32]\n1", "completion": " الناتج:\n```text\n[31]\n[7, 3, 34, 14, 32]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'ي' in w)", "tests": ["assert letter_count('سماء تفاحة بحر طائرة فجر') == 0", "assert letter_count('فجر قمر تفاحة دفتر مطر سلام ليل رمل') == 1", "assert letter_count('عمل قهوة تفاحة') == 0", "assert letter_count('باب بحر حصان صديق نهر قهوة تفاحة') == 1", "assert letter_count('سماء سيارة شجرة ليل رمل رمل') == 2", "assert letter_count('') == 0", "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('باب بحر حصان صديق نهر قهوة تفاحة') == 1\nassert letter_count('سماء سيارة شجرة ليل رمل رمل') == 2\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ي» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_count('سماء تفاحة بحر طائرة فجر')` يُرجع `0`.\nالجواب:", "qhash": "b2a6ea45bf4273f1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'summer'\nprint(word.replace('m', 'X'))\nprint(word.split('_'))\nprint(word.count('m'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'summer'\nprint(word.replace('m', 'X'))\nprint(word.split('_'))\nprint(word.count('m'))\n```\nالجواب:", "qhash": "72a5ac88d6dea4fe", "answer": "suXXer\n['summer']\n2", "completion": " الناتج:\n```text\nsuXXer\n['summer']\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 8\nfor n in range(4, 22, 1):\n result -= n * 4\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 8\nfor n in range(4, 22, 1):\n result -= n * 4\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "f6a0206fdd708f00", "answer": "-892\n21", "completion": " الناتج:\n```text\n-892\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'بيت سيارة'\nprint(len(kalima))\nprint('ت' in kalima)\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'بيت سيارة'\nprint(len(kalima))\nprint('ت' in kalima)\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "300b46ee3151b7b4", "answer": "9\nTrue\nبيت-سيارة", "completion": " الناتج:\n```text\n9\nTrue\nبيت-سيارة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'وردة'\nprint('ة' in s)\nprint(s.find('ة'))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'وردة'\nprint('ة' in s)\nprint(s.find('ة'))\nprint(s[::-1])\n```\nالجواب:", "qhash": "d9c26791d4bb6617", "answer": "True\n3\nةدرو", "completion": " الناتج:\n```text\nTrue\n3\nةدرو\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'rocket'\nprint(name.capitalize())\nprint(len(name))\nprint(name.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'rocket'\nprint(name.capitalize())\nprint(len(name))\nprint(name.upper())\n```\nالجواب:", "qhash": "60e8b91fc1710512", "answer": "Rocket\n6\nROCKET", "completion": " الناتج:\n```text\nRocket\n6\nROCKET\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 18) == 1)", "tests": ["assert count_coprime(17) == 6", "assert count_coprime(166) == 55", "assert count_coprime(22) == 7", "assert count_coprime(139) == 47", "assert count_coprime(6) == 2", "assert count_coprime(50) == 17", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(17) == 6\nassert count_coprime(166) == 55\nassert count_coprime(22) == 7\nassert count_coprime(139) == 47\nassert count_coprime(6) == 2\nassert count_coprime(50) == 17\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, 18) == 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, 18) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_coprime(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 18، أي أن القاسم المشترك الأكبر لها مع 18 يساوي 1.\nمثال: `count_coprime(17)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "75eb0a5551e4bc35"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['desert', 'table', 'falcon', 'engine', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['desert', 'table', 'falcon', 'engine', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "976bd55497bf84b0", "answer": "['code', 'table', 'desert', 'falcon', 'engine']\n['falcon', 'engine', 'desert']", "completion": " الناتج:\n```text\n['code', 'table', 'desert', 'falcon', 'engine']\n['falcon', 'engine', 'desert']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "tests": ["assert mfact(4) == 4", "assert mfact(38) == 212", "assert mfact(9) == 162", "assert mfact(17) == 577", "assert mfact(11) == 880", "assert mfact(48) == 32", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 4\nassert mfact(38) == 212\nassert mfact(9) == 162\nassert mfact(17) == 577\nassert mfact(11) == 880\nassert mfact(48) == 32\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(4)` يجب أن تُرجع `4`.\nالجواب:", "qhash": "4742d9114091616e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "d = {'رنا': 40, 'زينب': 23, 'سعيد': 43, 'مريم': 0, 'خالد': 39}\nd['خالد'] += 7\nd['نور'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nd = {'رنا': 40, 'زينب': 23, 'سعيد': 43, 'مريم': 0, 'خالد': 39}\nd['خالد'] += 7\nd['نور'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('سعيد', -1))\n```\nالجواب:", "qhash": "8ee09a23d8d8506b", "answer": "6\nخالد\n198\n43", "completion": " الناتج:\n```text\n6\nخالد\n198\n43\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -7 * x ** 2 + (-6) * x + (-8)", "tests": ["assert poly(1) == -21", "assert poly(2) == -48", "assert poly(-1) == -9", "assert poly(8) == -504", "assert poly(11) == -921", "assert poly(14) == -1464", "assert poly(-9) == -521", "assert poly(0) == -8"], "test_code": "assert poly(1) == -21\nassert poly(2) == -48\nassert poly(-1) == -9\nassert poly(8) == -504\nassert poly(11) == -921\nassert poly(14) == -1464\nassert poly(-9) == -521\nassert poly(0) == -8", "answer": "def poly(x):\n return -7 * x ** 2 + (-6) * x + (-8)", "completion": " ```python\ndef poly(x):\n return -7 * x ** 2 + (-6) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -7x² - 6x - 8 عند العدد الصحيح x.\nمثال: `poly(1)` يجب أن تُرجع `-21`.\nالجواب:", "qhash": "3389806ae588daca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [10, 40, 17, 3, 0, -5, 31]\nprint(items[2:6])\nprint(items[::3])\nprint(min(items[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [10, 40, 17, 3, 0, -5, 31]\nprint(items[2:6])\nprint(items[::3])\nprint(min(items[2:6]))\n```\nالجواب:", "qhash": "9524418572feb57e", "answer": "[17, 3, 0, -5]\n[10, 3, 31]\n-5", "completion": " الناتج:\n```text\n[17, 3, 0, -5]\n[10, 3, 31]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 4", "tests": ["assert pow_digits(49196) == 1", "assert pow_digits(547146) == 3", "assert pow_digits(458864) == 3", "assert pow_digits(106996) == 3", "assert pow_digits(556115) == 3", "assert pow_digits(839800) == 0", "assert pow_digits(612882) == 3", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(49196) == 1\nassert pow_digits(547146) == 3\nassert pow_digits(458864) == 3\nassert pow_digits(106996) == 3\nassert pow_digits(556115) == 3\nassert pow_digits(839800) == 0\nassert pow_digits(612882) == 3\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 4", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 1 for d in str(n)) % 4\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 4.\nمثال: `pow_digits(49196)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "d8fcf196ccfbf1a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 11:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([1, 3, 1, 6, 2, 2, 3, 9, 6]) == [1, 4, 5, 11, 0, 2, 5, 0, 6]", "assert capped_cumsum([-8, 6, -7, 11, 1, 9]) == [-8, -2, -9, 2, 3, 0]", "assert capped_cumsum([-7, -7, -9, 1, -4, 6, -3, -9]) == [-7, -14, -23, -22, -26, -20, -23, -32]", "assert capped_cumsum([9, -8, -10, -6, -4, 8]) == [9, 1, -9, -15, -19, -11]", "assert capped_cumsum([10, -5]) == [10, 5]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([1, 3, 1, 6, 2, 2, 3, 9, 6]) == [1, 4, 5, 11, 0, 2, 5, 0, 6]\nassert capped_cumsum([-8, 6, -7, 11, 1, 9]) == [-8, -2, -9, 2, 3, 0]\nassert capped_cumsum([-7, -7, -9, 1, -4, 6, -3, -9]) == [-7, -14, -23, -22, -26, -20, -23, -32]\nassert capped_cumsum([9, -8, -10, -6, -4, 8]) == [9, 1, -9, -15, -19, -11]\nassert capped_cumsum([10, -5]) == [10, 5]\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 > 11:\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 > 11:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 11 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([1, 3, 1, 6, 2, 2, 3, 9, 6])` يجب أن تُرجع `[1, 4, 5, 11, 0, 2, 5, 0, 6]`.\nالجواب:", "qhash": "3d588ac2106a4aea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 4) // 2 for x in range(6, 20) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 4) // 2 for x in range(6, 20) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "09c1aca55fee9489", "answer": "[5, 6, 7, 8, 9, 10, 11]\n7 56", "completion": " الناتج:\n```text\n[5, 6, 7, 8, 9, 10, 11]\n7 56\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('brain orange a planet') == 'planet|a|orange|brain'", "assert backwards('river garden falcon rocket by we') == 'we|by|rocket|falcon|garden|river'", "assert backwards('') == ''", "assert backwards('desert up summer engine desert') == 'desert|engine|summer|up|desert'", "assert backwards('light cloud') == 'cloud|light'", "assert backwards('engine python planet banana an river window code') == 'code|window|river|an|banana|planet|python|engine'", "assert backwards('by vector is winter') == 'winter|is|vector|by'"], "test_code": "assert backwards('brain orange a planet') == 'planet|a|orange|brain'\nassert backwards('river garden falcon rocket by we') == 'we|by|rocket|falcon|garden|river'\nassert backwards('') == ''\nassert backwards('desert up summer engine desert') == 'desert|engine|summer|up|desert'\nassert backwards('light cloud') == 'cloud|light'\nassert backwards('engine python planet banana an river window code') == 'code|window|river|an|banana|planet|python|engine'\nassert backwards('by vector is winter') == 'winter|is|vector|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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `backwards('brain orange a planet')` يُرجع `'planet|a|orange|brain'`.\nالجواب:", "qhash": "4213be0699a85d61"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'شجرة'\nprint(text[0])\nprint(text[-1])\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'شجرة'\nprint(text[0])\nprint(text[-1])\nprint(text[::-1])\n```\nالجواب:", "qhash": "677b2fd00b66e193", "answer": "ش\nة\nةرجش", "completion": " الناتج:\n```text\nش\nة\nةرجش\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('كتاب دفتر جمل سوق سماء') == 1", "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('كتاب دفتر جمل سوق سماء') == 1\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": "b06ae01800ca8a8d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_div([83, 63, 42, 69, 78, 19, 84, 10, 50, 65, 24, 21]) == 3", "assert count_div([-12, 11, 65]) == 1", "assert count_div([76, 33, 58, 15, 77, 59]) == 1", "assert count_div([26, 46, 63, 14, -38, -7, 28, 0, 36, 48, -7]) == 0", "assert count_div([76, 58, -38, 64]) == 0", "assert count_div([-3, -3, -15]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([83, 63, 42, 69, 78, 19, 84, 10, 50, 65, 24, 21]) == 3\nassert count_div([-12, 11, 65]) == 1\nassert count_div([76, 33, 58, 15, 77, 59]) == 1\nassert count_div([26, 46, 63, 14, -38, -7, 28, 0, 36, 48, -7]) == 0\nassert count_div([76, 58, -38, 64]) == 0\nassert count_div([-3, -3, -15]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 9 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([83, 63, 42, 69, 78, 19, 84, 10, 50, 65, 24, 21])` يُرجع `3`.\nالجواب:", "qhash": "76a363f5d984292d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [24, 25, 27, 19, 39, 24, 7, -4, -4]\nprint(xs[1:2])\nprint(xs[::-1])\nprint(max(xs[1:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [24, 25, 27, 19, 39, 24, 7, -4, -4]\nprint(xs[1:2])\nprint(xs[::-1])\nprint(max(xs[1:2]))\n```\nالجواب:", "qhash": "f44399e33906dd53", "answer": "[25]\n[-4, -4, 7, 24, 39, 19, 27, 25, 24]\n25", "completion": " الناتج:\n```text\n[25]\n[-4, -4, 7, 24, 39, 19, 27, 25, 24]\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 17\nfor j in range(-5, 16, 4):\n s += j * 6\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 17\nfor j in range(-5, 16, 4):\n s += j * 6\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "cb23b08297dd7df1", "answer": "197\n15", "completion": " الناتج:\n```text\n197\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('at up at at camel data data') == ''", "assert invert_words('matrix apple code window it engine signal apple') == 'signal engine window matrix'", "assert invert_words('window signal data on orange vector it stone') == 'vector orange signal window'", "assert invert_words('data window python an by table') == 'python window'", "assert invert_words('signal a camel up falcon light desert') == 'desert falcon signal'", "assert invert_words('garden planet light go orange') == 'orange planet garden'", "assert invert_words('orange it by camel stone winter it') == 'winter orange'"], "test_code": "assert invert_words('at up at at camel data data') == ''\nassert invert_words('matrix apple code window it engine signal apple') == 'signal engine window matrix'\nassert invert_words('window signal data on orange vector it stone') == 'vector orange signal window'\nassert invert_words('data window python an by table') == 'python window'\nassert invert_words('signal a camel up falcon light desert') == 'desert falcon signal'\nassert invert_words('garden planet light go orange') == 'orange planet garden'\nassert invert_words('orange it by camel stone winter it') == 'winter orange'", "answer": "def invert_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `invert_words('at up at at camel data data')` يُرجع `''`.\nالجواب:", "qhash": "c80fc07e566b08ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return 1 * x ** 2 + (0) * x + (5)", "tests": ["assert p(5) == 30", "assert p(14) == 201", "assert p(-17) == 294", "assert p(0) == 5", "assert p(-5) == 30", "assert p(18) == 329", "assert p(8) == 69", "assert p(0) == 5"], "test_code": "assert p(5) == 30\nassert p(14) == 201\nassert p(-17) == 294\nassert p(0) == 5\nassert p(-5) == 30\nassert p(18) == 329\nassert p(8) == 69\nassert p(0) == 5", "answer": "def p(x):\n return 1 * x ** 2 + (0) * x + (5)", "completion": " ```python\ndef p(x):\n return 1 * x ** 2 + (0) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود 1x² + 0x + 5 عند العدد الصحيح x.\nمثال: `p(5)` يجب أن تُرجع `30`.\nالجواب:", "qhash": "6d7718239c0be955"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('pixel to window') == 'ohwdk sn vhmcnv'", "assert caesar('table data is it') == 'szakd czsz hr hs'", "assert caesar('on') == 'nm'", "assert caesar('go matrix winter music') == 'fn lzsqhw vhmsdq ltrhb'", "assert caesar('it brain go by') == 'hs aqzhm fn ax'", "assert caesar('at to coffee music') == 'zs sn bneedd ltrhb'", "assert caesar('') == ''"], "test_code": "assert caesar('pixel to window') == 'ohwdk sn vhmcnv'\nassert caesar('table data is it') == 'szakd czsz hr hs'\nassert caesar('on') == 'nm'\nassert caesar('go matrix winter music') == 'fn lzsqhw vhmsdq ltrhb'\nassert caesar('it brain go by') == 'hs aqzhm fn ax'\nassert caesar('at to coffee music') == 'zs sn bneedd ltrhb'\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 + (25)) % 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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('pixel to window')` يُرجع `'ohwdk sn vhmcnv'`.\nالجواب:", "qhash": "210f3d0650444d11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "tests": ["assert letter_stats('up pixel desert') == {'m': 0, 'r': 1}", "assert letter_stats('summer planet in apple brain') == {'m': 2, 'r': 2}", "assert letter_stats('signal code stone') == {'m': 0, 'r': 0}", "assert letter_stats('window') == {'m': 0, 'r': 0}", "assert letter_stats('river go data stone garden winter') == {'m': 0, 'r': 4}", "assert letter_stats('by an go by') == {'m': 0, 'r': 0}", "assert letter_stats('') == {'m': 0, 'r': 0}"], "test_code": "assert letter_stats('up pixel desert') == {'m': 0, 'r': 1}\nassert letter_stats('summer planet in apple brain') == {'m': 2, 'r': 2}\nassert letter_stats('signal code stone') == {'m': 0, 'r': 0}\nassert letter_stats('window') == {'m': 0, 'r': 0}\nassert letter_stats('river go data stone garden winter') == {'m': 0, 'r': 4}\nassert letter_stats('by an go by') == {'m': 0, 'r': 0}\nassert letter_stats('') == {'m': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'mr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'mr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'm'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('up pixel desert')` يُرجع `{'m': 0, 'r': 1}`.\nالجواب:", "qhash": "2dc49c91c690edc8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ا'):\n count += 1\n return count", "tests": ["assert begin_count('امل حصان عمل ميناء امل برمجة') == 2", "assert begin_count('حاسوب حصان باب') == 0", "assert begin_count('برتقال قهوة عربية مدرسة') == 0", "assert begin_count('نور شمس مدينة مدينة قهوة') == 0", "assert begin_count('خبز صديق سلام سفينة امل امل') == 2", "assert begin_count('مكتبة امل قلم') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('امل حصان عمل ميناء امل برمجة') == 2\nassert begin_count('حاسوب حصان باب') == 0\nassert begin_count('برتقال قهوة عربية مدرسة') == 0\nassert begin_count('نور شمس مدينة مدينة قهوة') == 0\nassert begin_count('خبز صديق سلام سفينة امل امل') == 2\nassert begin_count('مكتبة امل قلم') == 1\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ا'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_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 begin_count(line):\n count = 0\n for w in line:\n if w.startswith('ا'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('امل حصان عمل ميناء امل برمجة')` يُرجع `2`.\nالجواب:", "qhash": "da736e21783a2cae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "tests": ["assert sum_div(178) == 4465", "assert sum_div(250) == 8946", "assert sum_div(111) == 1740", "assert sum_div(54) == 370", "assert sum_div(130) == 2331", "assert sum_div(44) == 273", "assert sum_div(1) == 0"], "test_code": "assert sum_div(178) == 4465\nassert sum_div(250) == 8946\nassert sum_div(111) == 1740\nassert sum_div(54) == 370\nassert sum_div(130) == 2331\nassert sum_div(44) == 273\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 7.\nمثال: `sum_div(178)` يجب أن تُرجع `4465`.\nالجواب:", "qhash": "21fdbec65de398a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('orange data Hello') == 'firexv urkr Hvccf'", "assert shift_letters('on in stone A1') == 'fe ze jkfev A1'", "assert shift_letters('camel planet a camel winter Hello') == 'trdvc gcrevk r trdvc nzekvi Hvccf'", "assert shift_letters('go') == 'xf'", "assert shift_letters('matrix banana') == 'drkizo srerer'", "assert shift_letters('cloud by window OK') == 'tcflu sp nzeufn OK'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('orange data Hello') == 'firexv urkr Hvccf'\nassert shift_letters('on in stone A1') == 'fe ze jkfev A1'\nassert shift_letters('camel planet a camel winter Hello') == 'trdvc gcrevk r trdvc nzekvi Hvccf'\nassert shift_letters('go') == 'xf'\nassert shift_letters('matrix banana') == 'drkizo srerer'\nassert shift_letters('cloud by window OK') == 'tcflu sp nzeufn OK'\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 + (17)) % 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 + (17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('orange data Hello')` يجب أن تُرجع `'firexv urkr Hvccf'`.\nالجواب:", "qhash": "c146e4df571a6c6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 13)", "tests": ["assert select_range([-5, 18, 13, 19, 14, 20, 5, 14, 8, -5]) == [-26, -16, -10]", "assert select_range([-18, 18, 9, 4, 17, -9]) == [-18, -8]", "assert select_range([42, -13, -15, -11]) == []", "assert select_range([]) == []", "assert select_range([54, 7, -3, 9, 1, 4]) == [-18, -14, -8]", "assert select_range([-3]) == []", "assert select_range([-11, 7, -14, -24, -23, -15, 25, 1, 50]) == [-14]", "assert select_range([]) == []"], "test_code": "assert select_range([-5, 18, 13, 19, 14, 20, 5, 14, 8, -5]) == [-26, -16, -10]\nassert select_range([-18, 18, 9, 4, 17, -9]) == [-18, -8]\nassert select_range([42, -13, -15, -11]) == []\nassert select_range([]) == []\nassert select_range([54, 7, -3, 9, 1, 4]) == [-18, -14, -8]\nassert select_range([-3]) == []\nassert select_range([-11, 7, -14, -24, -23, -15, 25, 1, 50]) == [-14]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 13)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -2 for x in xs if 4 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `select_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 4 ≤ x ≤ 13، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `select_range([-5, 18, 13, 19, 14, 20, 5, 14, 8, -5])` يُرجع `[-26, -16, -10]`.\nالجواب:", "qhash": "aa514cca0dff6688"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 3\nfor j in range(7, 10, 4):\n s += j * 7\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 3\nfor j in range(7, 10, 4):\n s += j * 7\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "305674254139bd6c", "answer": "52\n7", "completion": " الناتج:\n```text\n52\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 13", "tests": ["assert rec_prod(9) == 9", "assert rec_prod(32) == 0", "assert rec_prod(52) == 0", "assert rec_prod(33) == 0", "assert rec_prod(29) == 0", "assert rec_prod(54) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(9) == 9\nassert rec_prod(32) == 0\nassert rec_prod(52) == 0\nassert rec_prod(33) == 0\nassert rec_prod(29) == 0\nassert rec_prod(54) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 13", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(9)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "2ed56d299ba2129c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'camel'\nprint(name.find('m'))\nprint(name.split('_'))\nprint(name[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'camel'\nprint(name.find('m'))\nprint(name.split('_'))\nprint(name[-4:])\n```\nالجواب:", "qhash": "02f0dc37ca541134", "answer": "2\n['camel']\namel", "completion": " الناتج:\n```text\n2\n['camel']\namel\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert cycle([19, 40, 44, 20, 7, 31, 47]) == [40, 44, 20, 7, 31, 47, 19]", "assert cycle([41, 39]) == [39, 41]", "assert cycle([-4, 21]) == [21, -4]", "assert cycle([44, 50, 7, -2, 3, 17, 15, 19, -1, 19]) == [17, 15, 19, -1, 19, 44, 50, 7, -2, 3]", "assert cycle([9, 1, 42, 25]) == [25, 9, 1, 42]", "assert cycle([32, 9, 4, 16, 11]) == [32, 9, 4, 16, 11]", "assert cycle([]) == []"], "test_code": "assert cycle([19, 40, 44, 20, 7, 31, 47]) == [40, 44, 20, 7, 31, 47, 19]\nassert cycle([41, 39]) == [39, 41]\nassert cycle([-4, 21]) == [21, -4]\nassert cycle([44, 50, 7, -2, 3, 17, 15, 19, -1, 19]) == [17, 15, 19, -1, 19, 44, 50, 7, -2, 3]\nassert cycle([9, 1, 42, 25]) == [25, 9, 1, 42]\nassert cycle([32, 9, 4, 16, 11]) == [32, 9, 4, 16, 11]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return ____\n```\nمثال: `cycle([19, 40, 44, 20, 7, 31, 47])` يجب أن تُرجع `[40, 44, 20, 7, 31, 47, 19]`.\nالجواب:", "qhash": "e21b1928390f8395"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-14, 5, 25, 13, 18, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 18), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-14, 5, 25, 13, 18, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 18), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "1304f8fcb415cdf7", "answer": "[18, 14, 13, 25, 5, -14]\n[25, 18, 14]", "completion": " الناتج:\n```text\n[18, 14, 13, 25, 5, -14]\n[25, 18, 14]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['window', 'orange', 'summer', 'signal', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['window', 'orange', 'summer', 'signal', 'cloud']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "002066dcfea16ca1", "answer": "['cloud', 'window', 'orange', 'summer', 'signal']\n['window', 'summer', 'signal']", "completion": " الناتج:\n```text\n['cloud', 'window', 'orange', 'summer', 'signal']\n['window', 'summer', 'signal']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'bt'}", "tests": ["assert count_chars('matrix it garden river') == {'b': 0, 't': 2}", "assert count_chars('on up') == {'b': 0, 't': 0}", "assert count_chars('vector matrix light rocket') == {'b': 0, 't': 4}", "assert count_chars('stone summer window signal to') == {'b': 0, 't': 2}", "assert count_chars('by planet python light is music') == {'b': 1, 't': 3}", "assert count_chars('code') == {'b': 0, 't': 0}", "assert count_chars('') == {'b': 0, 't': 0}"], "test_code": "assert count_chars('matrix it garden river') == {'b': 0, 't': 2}\nassert count_chars('on up') == {'b': 0, 't': 0}\nassert count_chars('vector matrix light rocket') == {'b': 0, 't': 4}\nassert count_chars('stone summer window signal to') == {'b': 0, 't': 2}\nassert count_chars('by planet python light is music') == {'b': 1, 't': 3}\nassert count_chars('code') == {'b': 0, 't': 0}\nassert count_chars('') == {'b': 0, 't': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'bt'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'bt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'b'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('matrix it garden river')` يُرجع `{'b': 0, 't': 2}`.\nالجواب:", "qhash": "af6bb5a7c1f5feda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [-7, 3, 6, -1, 35, 34, 6]\nprint(nums[3:6])\nprint(nums[::3])\nprint(len(nums[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-7, 3, 6, -1, 35, 34, 6]\nprint(nums[3:6])\nprint(nums[::3])\nprint(len(nums[3:6]))\n```\nالجواب:", "qhash": "4a5048f1003b3e7e", "answer": "[-1, 35, 34]\n[-7, -1, 6]\n3", "completion": " الناتج:\n```text\n[-1, 35, 34]\n[-7, -1, 6]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 7)", "tests": ["assert in_range_scaled([-25, -25, 9, 1, -20, 16, 9]) == [-2]", "assert in_range_scaled([23]) == []", "assert in_range_scaled([32, 21, 48, 58, -27, 7, 11, 58, -11]) == [-14, 22]", "assert in_range_scaled([]) == []", "assert in_range_scaled([3, 35, -4, -28, 42]) == [-6, 8]", "assert in_range_scaled([23, 0, 26, 19, -14, 50, 0, 15, 24, 20]) == [0, 0, 28]", "assert in_range_scaled([-1, 20]) == [2]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-25, -25, 9, 1, -20, 16, 9]) == [-2]\nassert in_range_scaled([23]) == []\nassert in_range_scaled([32, 21, 48, 58, -27, 7, 11, 58, -11]) == [-14, 22]\nassert in_range_scaled([]) == []\nassert in_range_scaled([3, 35, -4, -28, 42]) == [-6, 8]\nassert in_range_scaled([23, 0, 26, 19, -14, 50, 0, 15, 24, 20]) == [0, 0, 28]\nassert in_range_scaled([-1, 20]) == [2]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 7)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -2 for x in xs if -16 <= x <= 7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق -16 ≤ x ≤ 7، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([-25, -25, 9, 1, -20, 16, 9])` يُرجع `[-2]`.\nالجواب:", "qhash": "7902bcd3eee7c3aa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73", "tests": ["assert rec_prod(11) == 12", "assert rec_prod(29) == 40", "assert rec_prod(2) == 2", "assert rec_prod(21) == 65", "assert rec_prod(19) == 62", "assert rec_prod(53) == 38", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 12\nassert rec_prod(29) == 40\nassert rec_prod(2) == 2\nassert rec_prod(21) == 65\nassert rec_prod(19) == 62\nassert rec_prod(53) == 38\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 4)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `12`.\nالجواب:", "qhash": "722e784a9c5b5610"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 7\nfor x in range(-5, 13, 1):\n total -= x * 1\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 7\nfor x in range(-5, 13, 1):\n total -= x * 1\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "a9686d9b6d0b9991", "answer": "-56\n12", "completion": " الناتج:\n```text\n-56\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert spin([35, 32, 30, 3, 33, 21]) == [3, 33, 21, 35, 32, 30]", "assert spin([14, -9, 20, 47, 15, 14]) == [47, 15, 14, 14, -9, 20]", "assert spin([-7, 14, 14, 24, 0, 43, 5, 16]) == [16, -7, 14, 14, 24, 0, 43, 5]", "assert spin([16, 6, 21, -4, 48, 5, 15, 35, -3, 0, 22]) == [48, 5, 15, 35, -3, 0, 22, 16, 6, 21, -4]", "assert spin([0, 10]) == [10, 0]", "assert spin([28, 3, 13, 25, 34, -3, 20]) == [3, 13, 25, 34, -3, 20, 28]", "assert spin([]) == []"], "test_code": "assert spin([35, 32, 30, 3, 33, 21]) == [3, 33, 21, 35, 32, 30]\nassert spin([14, -9, 20, 47, 15, 14]) == [47, 15, 14, 14, -9, 20]\nassert spin([-7, 14, 14, 24, 0, 43, 5, 16]) == [16, -7, 14, 14, 24, 0, 43, 5]\nassert spin([16, 6, 21, -4, 48, 5, 15, 35, -3, 0, 22]) == [48, 5, 15, 35, -3, 0, 22, 16, 6, 21, -4]\nassert spin([0, 10]) == [10, 0]\nassert spin([28, 3, 13, 25, 34, -3, 20]) == [3, 13, 25, 34, -3, 20, 28]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return ____\n```\nمثال: `spin([35, 32, 30, 3, 33, 21])` يجب أن تُرجع `[3, 33, 21, 35, 32, 30]`.\nالجواب:", "qhash": "357899d4ad2ec333"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(118) == 1104", "assert mult_sum(136) == 1485", "assert mult_sum(274) == 5805", "assert mult_sum(229) == 4050", "assert mult_sum(290) == 6657", "assert mult_sum(82) == 585", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(118) == 1104\nassert mult_sum(136) == 1485\nassert mult_sum(274) == 5805\nassert mult_sum(229) == 4050\nassert mult_sum(290) == 6657\nassert mult_sum(82) == 585\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 15.\nمثال: `mult_sum(118)` يجب أن تُرجع `1104`.\nالجواب:", "qhash": "9c2fdb27142140b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 0\nfor x in range(-1, 4, 3):\n total += x * 6\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 0\nfor x in range(-1, 4, 3):\n total += x * 6\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "b1522a062ea61baf", "answer": "6\n2", "completion": " الناتج:\n```text\n6\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x * 1 + 7 for x in range(-1, 11) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x * 1 + 7 for x in range(-1, 11) if x % 5 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "0b0462ec328a02b5", "answer": "[10, 15]\n2 25", "completion": " الناتج:\n```text\n[10, 15]\n2 25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "acc = 3\nfor i in range(-3, 18, 4):\n acc -= i * 1\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nacc = 3\nfor i in range(-3, 18, 4):\n acc -= i * 1\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "28db75275c0c319a", "answer": "-39\n17", "completion": " الناتج:\n```text\n-39\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(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 largest_div([-25, 60, 13, -13, 16, 32, 2]) == 60", "assert largest_div([-6, -24, -30]) == -6", "assert largest_div([1]) == None", "assert largest_div([]) == None", "assert largest_div([26, 40, -47, -37]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([-25, 60, 13, -13, 16, 32, 2]) == 60\nassert largest_div([-6, -24, -30]) == -6\nassert largest_div([1]) == None\nassert largest_div([]) == None\nassert largest_div([26, 40, -47, -37]) == None\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(arr):\n best = 0\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 largest_div(arr):\n best = 0\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مثال: `largest_div([-25, 60, 13, -13, 16, 32, 2])` يجب أن تُرجع `60`.\nالجواب:", "qhash": "f81bae2ae1343910"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=3):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(h(3))\nprint(h(3, 20))\nprint(h(h(20), 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=3):\n if x > y:\n return x * 2 - y\n return x + y * 2\n\nprint(h(3))\nprint(h(3, 20))\nprint(h(h(20), 3))\n```\nالجواب:", "qhash": "d0bbb746ed30eebd", "answer": "9\n43\n71", "completion": " الناتج:\n```text\n9\n43\n71\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -3 * x ** 2 + (2) * x + (-7)", "tests": ["assert eval_poly(4) == -47", "assert eval_poly(-7) == -168", "assert eval_poly(14) == -567", "assert eval_poly(10) == -287", "assert eval_poly(3) == -28", "assert eval_poly(-2) == -23", "assert eval_poly(-20) == -1247", "assert eval_poly(0) == -7"], "test_code": "assert eval_poly(4) == -47\nassert eval_poly(-7) == -168\nassert eval_poly(14) == -567\nassert eval_poly(10) == -287\nassert eval_poly(3) == -28\nassert eval_poly(-2) == -23\nassert eval_poly(-20) == -1247\nassert eval_poly(0) == -7", "answer": "def eval_poly(x):\n return -3 * x ** 2 + (2) * x + (-7)", "completion": " ```python\ndef eval_poly(x):\n return -3 * x ** 2 + (2) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود -3x² + 2x - 7 عند العدد الصحيح x.\nمثال: `eval_poly(4)` يجب أن تُرجع `-47`.\nالجواب:", "qhash": "88ba24a3de452b37"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert add_multiples(28) == 63", "assert add_multiples(272) == 6693", "assert add_multiples(13) == 8", "assert add_multiples(153) == 2225", "assert add_multiples(22) == 39", "assert add_multiples(171) == 2718", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(28) == 63\nassert add_multiples(272) == 6693\nassert add_multiples(13) == 8\nassert add_multiples(153) == 2225\nassert add_multiples(22) == 39\nassert add_multiples(171) == 2718\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `add_multiples(28)` يجب أن تُرجع `63`.\nالجواب:", "qhash": "72c4f0f646fe89b9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('planet brain a apple apple data at stone') == 'stone,data,apple,apple,brain,planet'", "assert invert_words('up python') == 'python'", "assert invert_words('planet vector camel desert music orange apple up') == 'apple,orange,music,desert,camel,vector,planet'", "assert invert_words('is code') == 'code'", "assert invert_words('python') == 'python'", "assert invert_words('at camel vector code of') == 'code,vector,camel'", "assert invert_words('is at an on') == ''"], "test_code": "assert invert_words('planet brain a apple apple data at stone') == 'stone,data,apple,apple,brain,planet'\nassert invert_words('up python') == 'python'\nassert invert_words('planet vector camel desert music orange apple up') == 'apple,orange,music,desert,camel,vector,planet'\nassert invert_words('is code') == 'code'\nassert invert_words('python') == 'python'\nassert invert_words('at camel vector code of') == 'code,vector,camel'\nassert invert_words('is at an on') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `invert_words('planet brain a apple apple data at stone')` يُرجع `'stone,data,apple,apple,brain,planet'`.\nالجواب:", "qhash": "0b00924cb77fefa7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('is OK') == 'bl OK'", "assert rot('we table banana signal an') == 'px mtuex utgtgt lbzgte tg'", "assert rot('cloud cloud desert we') == 'vehnw vehnw wxlxkm px'", "assert rot('stone an orange') == 'lmhgx tg hktgzx'", "assert rot('is signal engine !') == 'bl lbzgte xgzbgx !'", "assert rot('signal 2024') == 'lbzgte 2024'", "assert rot('') == ''"], "test_code": "assert rot('is OK') == 'bl OK'\nassert rot('we table banana signal an') == 'px mtuex utgtgt lbzgte tg'\nassert rot('cloud cloud desert we') == 'vehnw vehnw wxlxkm px'\nassert rot('stone an orange') == 'lmhgx tg hktgzx'\nassert rot('is signal engine !') == 'bl lbzgte xgzbgx !'\nassert rot('signal 2024') == 'lbzgte 2024'\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 + (-7)) % 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 + (-7)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('is OK')` يجب أن تُرجع `'bl OK'`.\nالجواب:", "qhash": "e25c2af12292fe32"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 46)", "tests": ["assert clip_scale([29, 21, 12, 50, 28, 30]) == [-60, -58, -56, -42, -24]", "assert clip_scale([28, 19, 1, -17]) == [-56, -38]", "assert clip_scale([-7, -15, 37, 25, 28, -7, 59, 60]) == [-74, -56, -50]", "assert clip_scale([-14, 21, -24, 51, -26, -4, -24, 54, 36]) == [-72, -42]", "assert clip_scale([7, -28, 47, -4, 16, -30, 18, 48]) == [-36, -32]", "assert clip_scale([24, 21, -2]) == [-48, -42]", "assert clip_scale([]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([29, 21, 12, 50, 28, 30]) == [-60, -58, -56, -42, -24]\nassert clip_scale([28, 19, 1, -17]) == [-56, -38]\nassert clip_scale([-7, -15, 37, 25, 28, -7, 59, 60]) == [-74, -56, -50]\nassert clip_scale([-14, 21, -24, 51, -26, -4, -24, 54, 36]) == [-72, -42]\nassert clip_scale([7, -28, 47, -4, 16, -30, 18, 48]) == [-36, -32]\nassert clip_scale([24, 21, -2]) == [-48, -42]\nassert clip_scale([]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 46)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -2 for x in xs if 11 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 11 ≤ x ≤ 46، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([29, 21, 12, 50, 28, 30])` يُرجع `[-60, -58, -56, -42, -24]`.\nالجواب:", "qhash": "342183a50162c889"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('river') == 'xobkx'", "assert rot('planet to !') == 'vrgtkz zu !'", "assert rot('window window go !') == 'cotjuc cotjuc mu !'", "assert rot('pixel to table rocket we') == 'vodkr zu zghrk xuiqkz ck'", "assert rot('matrix code python 2024') == 'sgzxod iujk veznut 2024'", "assert rot('winter at river') == 'cotzkx gz xobkx'", "assert rot('') == ''"], "test_code": "assert rot('river') == 'xobkx'\nassert rot('planet to !') == 'vrgtkz zu !'\nassert rot('window window go !') == 'cotjuc cotjuc mu !'\nassert rot('pixel to table rocket we') == 'vodkr zu zghrk xuiqkz ck'\nassert rot('matrix code python 2024') == 'sgzxod iujk veznut 2024'\nassert rot('winter at river') == 'cotzkx gz xobkx'\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 + (-20)) % 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 + (-20)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 20 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('river')` يجب أن تُرجع `'xobkx'`.\nالجواب:", "qhash": "9ff4f7ced358c9e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('banana to planet to') == 'planet/banana'", "assert mirror_words('') == ''", "assert mirror_words('of to go light data by to') == 'data/light'", "assert mirror_words('cloud window engine falcon matrix code') == 'code/matrix/falcon/engine/window/cloud'", "assert mirror_words('matrix garden') == 'garden/matrix'", "assert mirror_words('desert') == 'desert'", "assert mirror_words('to music falcon cloud in winter') == 'winter/cloud/falcon/music'"], "test_code": "assert mirror_words('banana to planet to') == 'planet/banana'\nassert mirror_words('') == ''\nassert mirror_words('of to go light data by to') == 'data/light'\nassert mirror_words('cloud window engine falcon matrix code') == 'code/matrix/falcon/engine/window/cloud'\nassert mirror_words('matrix garden') == 'garden/matrix'\nassert mirror_words('desert') == 'desert'\nassert mirror_words('to music falcon cloud in winter') == 'winter/cloud/falcon/music'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `mirror_words('banana to planet to')` يُرجع `'planet/banana'`.\nالجواب:", "qhash": "25810ca3a29ec41a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(324736515))\nprint(calc(calc(324736515)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(324736515))\nprint(calc(calc(324736515)))\n```\nالجواب:", "qhash": "91a5285c0490a87d", "answer": "36\n9", "completion": " الناتج:\n```text\n36\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 97", "tests": ["assert rec_prod(3) == 6", "assert rec_prod(4) == 24", "assert rec_prod(43) == 1", "assert rec_prod(34) == 88", "assert rec_prod(31) == 34", "assert rec_prod(43) == 1", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 6\nassert rec_prod(4) == 24\nassert rec_prod(43) == 1\nassert rec_prod(34) == 88\nassert rec_prod(31) == 34\nassert rec_prod(43) == 1\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 97", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "5e6895d468b99773"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total", "tests": ["assert pow_total(4) == 40", "assert pow_total(1) == 4", "assert pow_total(2) == 12", "assert pow_total(9) == 180", "assert pow_total(11) == 264", "assert pow_total(1) == 4", "assert pow_total(0) == 0"], "test_code": "assert pow_total(4) == 40\nassert pow_total(1) == 4\nassert pow_total(2) == 12\nassert pow_total(9) == 180\nassert pow_total(11) == 264\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 ** 1\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 1\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 1\n return total\n```\nمثال: `pow_total(4)` يجب أن تُرجع `40`.\nالجواب:", "qhash": "1f545a3fd64f5179"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([24, 48, 36, -25, -7, 30, 37]) == 30", "assert biggest_mult([-50, -10, -10]) == -10", "assert biggest_mult([1, 11, 21]) == None", "assert biggest_mult([22, -26, -31, 36, 28, 29, 20]) == 20", "assert biggest_mult([-46, 29, -37, -39, 11, 43, -23]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([24, 48, 36, -25, -7, 30, 37]) == 30\nassert biggest_mult([-50, -10, -10]) == -10\nassert biggest_mult([1, 11, 21]) == None\nassert biggest_mult([22, -26, -31, 36, 28, 29, 20]) == 20\nassert biggest_mult([-46, 29, -37, -39, 11, 43, -23]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef biggest_mult(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للتوضيح: الاستدعاء `biggest_mult([24, 48, 36, -25, -7, 30, 37])` يُرجع `30`.\nالجواب:", "qhash": "1011a2bb04331e14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(7))\n```\nالجواب:", "qhash": "657470cc58c84e39", "answer": "34", "completion": " الناتج:\n```text\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([-15, -8, -17, 25, 40]) == None", "assert top_divisible([-22, -33, -44]) == -22", "assert top_divisible([1, 12, 23]) == None", "assert top_divisible([-14, 20, 17]) == None", "assert top_divisible([-10, -8, -22, 6, -3, 40, -43, -31]) == -22", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([-15, -8, -17, 25, 40]) == None\nassert top_divisible([-22, -33, -44]) == -22\nassert top_divisible([1, 12, 23]) == None\nassert top_divisible([-14, 20, 17]) == None\nassert top_divisible([-10, -8, -22, 6, -3, 40, -43, -31]) == -22\nassert top_divisible([]) == None", "answer": "def top_divisible(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(xs):\n best = None\n for x in xs:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([-15, -8, -17, 25, 40])` يُرجع `None`.\nالجواب:", "qhash": "c1c5a2cf69878770"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'برمجة سيارة'\nprint(text.replace(' ', '-'))\nprint('ب' in text)\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'برمجة سيارة'\nprint(text.replace(' ', '-'))\nprint('ب' in text)\nprint(text[-1])\n```\nالجواب:", "qhash": "f46295319879f32e", "answer": "برمجة-سيارة\nTrue\nة", "completion": " الناتج:\n```text\nبرمجة-سيارة\nTrue\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('summer brain in rocket it') == 'xzrrjw gwfns ns wthpjy ny'", "assert decode('we') == 'bj'", "assert decode('by') == 'gd'", "assert decode('go window banana camel') == 'lt bnsitb gfsfsf hfrjq'", "assert decode('engine we table stone !') == 'jslnsj bj yfgqj xytsj !'", "assert decode('is by is go') == 'nx gd nx lt'", "assert decode('') == ''"], "test_code": "assert decode('summer brain in rocket it') == 'xzrrjw gwfns ns wthpjy ny'\nassert decode('we') == 'bj'\nassert decode('by') == 'gd'\nassert decode('go window banana camel') == 'lt bnsitb gfsfsf hfrjq'\nassert decode('engine we table stone !') == 'jslnsj bj yfgqj xytsj !'\nassert decode('is by is go') == 'nx gd nx lt'\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 + (-21)) % 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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `decode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `decode('summer brain in rocket it')` يُرجع `'xzrrjw gwfns ns wthpjy ny'`.\nالجواب:", "qhash": "2f002ed05561f92d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 141:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([72, 38, 18, 27, 57, 53]) == [72, 110, 128, 0, 57, 110]", "assert rolling_total([96, 86, 52, 69]) == [96, 0, 52, 121]", "assert rolling_total([77, 20, 80, 31, 6, 42, 49, 105]) == [77, 97, 0, 31, 37, 79, 128, 0]", "assert rolling_total([41, 58, 71, 108, 36, 87]) == [41, 99, 0, 108, 0, 87]", "assert rolling_total([108, 78, 107, 27, 97, 64, 6, -4, 70]) == [108, 0, 107, 134, 0, 64, 70, 66, 136]", "assert rolling_total([23, 54, 111, 64, 92, 113, 88, 87, 103]) == [23, 77, 0, 64, 0, 113, 0, 87, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([72, 38, 18, 27, 57, 53]) == [72, 110, 128, 0, 57, 110]\nassert rolling_total([96, 86, 52, 69]) == [96, 0, 52, 121]\nassert rolling_total([77, 20, 80, 31, 6, 42, 49, 105]) == [77, 97, 0, 31, 37, 79, 128, 0]\nassert rolling_total([41, 58, 71, 108, 36, 87]) == [41, 99, 0, 108, 0, 87]\nassert rolling_total([108, 78, 107, 27, 97, 64, 6, -4, 70]) == [108, 0, 107, 134, 0, 64, 70, 66, 136]\nassert rolling_total([23, 54, 111, 64, 92, 113, 88, 87, 103]) == [23, 77, 0, 64, 0, 113, 0, 87, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 141:\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 > 141:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 141 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([72, 38, 18, 27, 57, 53])` يجب أن تُرجع `[72, 110, 128, 0, 57, 110]`.\nالجواب:", "qhash": "8f7548096aa961da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([42, 28, 43, 34, 48, 1, 33, 12]) == [43, 34, 48, 1, 33, 12, 42, 28]", "assert shift_list([41, 48, 6, 31]) == [6, 31, 41, 48]", "assert shift_list([30, 14, 40, 12, 23]) == [12, 23, 30, 14, 40]", "assert shift_list([34, 36, 27]) == [34, 36, 27]", "assert shift_list([23, 29]) == [23, 29]", "assert shift_list([2, 2, 35, 4, -5, 28, 12]) == [-5, 28, 12, 2, 2, 35, 4]", "assert shift_list([]) == []"], "test_code": "assert shift_list([42, 28, 43, 34, 48, 1, 33, 12]) == [43, 34, 48, 1, 33, 12, 42, 28]\nassert shift_list([41, 48, 6, 31]) == [6, 31, 41, 48]\nassert shift_list([30, 14, 40, 12, 23]) == [12, 23, 30, 14, 40]\nassert shift_list([34, 36, 27]) == [34, 36, 27]\nassert shift_list([23, 29]) == [23, 29]\nassert shift_list([2, 2, 35, 4, -5, 28, 12]) == [-5, 28, 12, 2, 2, 35, 4]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 18 % len(arr)\n return ____\n```\nمثال: `shift_list([42, 28, 43, 34, 48, 1, 33, 12])` يجب أن تُرجع `[43, 34, 48, 1, 33, 12, 42, 28]`.\nالجواب:", "qhash": "d1c88d95754fd78d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -1 for x in xs if 8 <= x <= 16)", "tests": ["assert pick_between([23, 22, 26, 15, 1]) == [-15]", "assert pick_between([39, 23, -27, -7]) == []", "assert pick_between([4]) == []", "assert pick_between([]) == []", "assert pick_between([-23, -6, 2, 16]) == [-16]", "assert pick_between([36, 3, 5, -13, 8, 11, 15, 20, 29, 18]) == [-15, -11, -8]", "assert pick_between([-4, 12, 4, 58, 53, 50]) == [-12]", "assert pick_between([]) == []"], "test_code": "assert pick_between([23, 22, 26, 15, 1]) == [-15]\nassert pick_between([39, 23, -27, -7]) == []\nassert pick_between([4]) == []\nassert pick_between([]) == []\nassert pick_between([-23, -6, 2, 16]) == [-16]\nassert pick_between([36, 3, 5, -13, 8, 11, 15, 20, 29, 18]) == [-15, -11, -8]\nassert pick_between([-4, 12, 4, 58, 53, 50]) == [-12]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -1 for x in xs if 8 <= x <= 16)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -1 for x in xs if 8 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 8 و16 (شاملًا الطرفين) في -1.\nمثال: `pick_between([23, 22, 26, 15, 1])` يجب أن تُرجع `[-15]`.\nالجواب:", "qhash": "7d78dbf60c54d585"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 15\nfor n in range(-5, 3, 3):\n result += n * 1\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 15\nfor n in range(-5, 3, 3):\n result += n * 1\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "d18fe68f41cb67cc", "answer": "9\n1", "completion": " الناتج:\n```text\n9\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [21, 1, 14, -5, 10, 19, 32, 9, 5]\nprint(a[3:9])\nprint(a[::-2])\nprint(sum(a[3:9]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [21, 1, 14, -5, 10, 19, 32, 9, 5]\nprint(a[3:9])\nprint(a[::-2])\nprint(sum(a[3:9]))\n```\nالجواب:", "qhash": "6fa119fcd69c973a", "answer": "[-5, 10, 19, 32, 9, 5]\n[5, 32, 10, 14, 21]\n70", "completion": " الناتج:\n```text\n[-5, 10, 19, 32, 9, 5]\n[5, 32, 10, 14, 21]\n70\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 140:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([1, 58, 41, 2, 41, 2, 67, 71, 20, 67]) == [1, 59, 100, 102, 0, 2, 69, 140, 0, 67]", "assert cumulative([49, 74, 47, 82, 136, 63]) == [49, 123, 0, 82, 0, 63]", "assert cumulative([21, 17, 120, 23, 7, 69, 48, 19, 122]) == [21, 38, 0, 23, 30, 99, 0, 19, 0]", "assert cumulative([79, 133, 139, 115, 3, 8, -4, 80, 14, 4]) == [79, 0, 139, 0, 3, 11, 7, 87, 101, 105]", "assert cumulative([124, 50, 89, 70, 126, 114]) == [124, 0, 89, 0, 126, 0]", "assert cumulative([18, 34, 82, 48, 54]) == [18, 52, 134, 0, 54]", "assert cumulative([]) == []"], "test_code": "assert cumulative([1, 58, 41, 2, 41, 2, 67, 71, 20, 67]) == [1, 59, 100, 102, 0, 2, 69, 140, 0, 67]\nassert cumulative([49, 74, 47, 82, 136, 63]) == [49, 123, 0, 82, 0, 63]\nassert cumulative([21, 17, 120, 23, 7, 69, 48, 19, 122]) == [21, 38, 0, 23, 30, 99, 0, 19, 0]\nassert cumulative([79, 133, 139, 115, 3, 8, -4, 80, 14, 4]) == [79, 0, 139, 0, 3, 11, 7, 87, 101, 105]\nassert cumulative([124, 50, 89, 70, 126, 114]) == [124, 0, 89, 0, 126, 0]\nassert cumulative([18, 34, 82, 48, 54]) == [18, 52, 134, 0, 54]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 140:\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 > 140:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 140 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([1, 58, 41, 2, 41, 2, 67, 71, 20, 67])` يجب أن تُرجع `[1, 59, 100, 102, 0, 2, 69, 140, 0, 67]`.\nالجواب:", "qhash": "dd89ca12cc35dc3d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ل')", "tests": ["assert count_hits('سفينة باب جبل فجر قهوة') == 1", "assert count_hits('سوق') == 0", "assert count_hits('برمجة خبز صحراء تفاحة ليل') == 2", "assert count_hits('') == 0", "assert count_hits('بحر وردة نهر برمجة') == 0", "assert count_hits('') == 0", "assert count_hits('رمل ليل') == 3", "assert count_hits('') == 0"], "test_code": "assert count_hits('سفينة باب جبل فجر قهوة') == 1\nassert count_hits('سوق') == 0\nassert count_hits('برمجة خبز صحراء تفاحة ليل') == 2\nassert count_hits('') == 0\nassert count_hits('بحر وردة نهر برمجة') == 0\nassert count_hits('') == 0\nassert count_hits('رمل ليل') == 3\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('سفينة باب جبل فجر قهوة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "5fb34def40f5e8b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([89, 41, 69, 57, 4, 36]) == 1", "assert how_many_div([-31]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([13, 2, -2, 4, 62, -26, 8, 15, 26, -1, 39, 79]) == 0", "assert how_many_div([86, 73, 1, -27, 69, 84]) == 0", "assert how_many_div([10, 66, -14, 80, 37, 25, -25, 84, 5, -32, 69]) == 1", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([89, 41, 69, 57, 4, 36]) == 1\nassert how_many_div([-31]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([13, 2, -2, 4, 62, -26, 8, 15, 26, -1, 39, 79]) == 0\nassert how_many_div([86, 73, 1, -27, 69, 84]) == 0\nassert how_many_div([10, 66, -14, 80, 37, 25, -25, 84, 5, -32, 69]) == 1\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 7 != 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 % 6 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 7، ثم اكتب الدالة كاملة.\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([89, 41, 69, 57, 4, 36])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "ce8d281f664144ce"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'brst'}", "tests": ["assert freq_of('planet pixel') == {'b': 0, 'r': 0, 's': 0, 't': 1}", "assert freq_of('river falcon a code stone pixel') == {'b': 0, 'r': 2, 's': 1, 't': 1}", "assert freq_of('a light vector an at') == {'b': 0, 'r': 1, 's': 0, 't': 3}", "assert freq_of('vector signal apple rocket') == {'b': 0, 'r': 2, 's': 1, 't': 2}", "assert freq_of('apple garden falcon code falcon') == {'b': 0, 'r': 1, 's': 0, 't': 0}", "assert freq_of('coffee it') == {'b': 0, 'r': 0, 's': 0, 't': 1}", "assert freq_of('') == {'b': 0, 'r': 0, 's': 0, 't': 0}"], "test_code": "assert freq_of('planet pixel') == {'b': 0, 'r': 0, 's': 0, 't': 1}\nassert freq_of('river falcon a code stone pixel') == {'b': 0, 'r': 2, 's': 1, 't': 1}\nassert freq_of('a light vector an at') == {'b': 0, 'r': 1, 's': 0, 't': 3}\nassert freq_of('vector signal apple rocket') == {'b': 0, 'r': 2, 's': 1, 't': 2}\nassert freq_of('apple garden falcon code falcon') == {'b': 0, 'r': 1, 's': 0, 't': 0}\nassert freq_of('coffee it') == {'b': 0, 'r': 0, 's': 0, 't': 1}\nassert freq_of('') == {'b': 0, 'r': 0, 's': 0, 't': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'brst'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'brst'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'b'، 'r'، 's'، 't' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('planet pixel')` يُرجع `{'b': 0, 'r': 0, 's': 0, 't': 1}`.\nالجواب:", "qhash": "c8af4a0873076af7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 6 * x ** 2 + (9) * x + (0)", "tests": ["assert p(8) == 456", "assert p(-11) == 627", "assert p(-4) == 60", "assert p(14) == 1302", "assert p(12) == 972", "assert p(12) == 972", "assert p(12) == 972", "assert p(0) == 0"], "test_code": "assert p(8) == 456\nassert p(-11) == 627\nassert p(-4) == 60\nassert p(14) == 1302\nassert p(12) == 972\nassert p(12) == 972\nassert p(12) == 972\nassert p(0) == 0", "answer": "def p(x):\n return 6 * x ** 2 + (9) * x + (0)", "completion": " ```python\ndef p(x):\n return 6 * x ** 2 + (9) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 6x² + 9x + 0 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(8)` يُرجع `456`.\nالجواب:", "qhash": "027b91086879c3ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(95) == 843", "assert mult_sum(155) == 2225", "assert mult_sum(278) == 6965", "assert mult_sum(147) == 1923", "assert mult_sum(159) == 2225", "assert mult_sum(214) == 4263", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(95) == 843\nassert mult_sum(155) == 2225\nassert mult_sum(278) == 6965\nassert mult_sum(147) == 1923\nassert mult_sum(159) == 2225\nassert mult_sum(214) == 4263\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 % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `mult_sum(95)` يجب أن تُرجع `843`.\nالجواب:", "qhash": "0bc2a2d03339869b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if w.startswith('ع'))", "tests": ["assert count_ar('عمل نهار حديقة باب ليل حاسوب جبل') == 1", "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('عمل نهار حديقة باب ليل حاسوب جبل') == 1\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 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('عمل نهار حديقة باب ليل حاسوب جبل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "f7b501d3af0f436d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_list([0, 18, 37, 0]) == [0, 0, 18, 37]", "assert rotate_list([21, -5]) == [-5, 21]", "assert rotate_list([39, 19, -7, -7, 9, 6, 43]) == [9, 6, 43, 39, 19, -7, -7]", "assert rotate_list([20, 38, 10]) == [10, 20, 38]", "assert rotate_list([2]) == [2]", "assert rotate_list([39, 8, 30, -9, 1, -1, 11, 35, -3, 33]) == [8, 30, -9, 1, -1, 11, 35, -3, 33, 39]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([0, 18, 37, 0]) == [0, 0, 18, 37]\nassert rotate_list([21, -5]) == [-5, 21]\nassert rotate_list([39, 19, -7, -7, 9, 6, 43]) == [9, 6, 43, 39, 19, -7, -7]\nassert rotate_list([20, 38, 10]) == [10, 20, 38]\nassert rotate_list([2]) == [2]\nassert rotate_list([39, 8, 30, -9, 1, -1, 11, 35, -3, 33]) == [8, 30, -9, 1, -1, 11, 35, -3, 33, 39]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_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 rotate_list(xs):\n if not xs:\n return []\n k = 11 % len(xs)\n return ____\n```\nمثال: `rotate_list([0, 18, 37, 0])` يجب أن تُرجع `[0, 0, 18, 37]`.\nالجواب:", "qhash": "ff4f9b41bb98ff49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 9)", "tests": ["assert in_range_scaled([10, -15, 1, 6, 13, -15, -2]) == [-30, -5, 10]", "assert in_range_scaled([-30, 8, 38, 1, 45, 57, 26, -10]) == [-40, -5]", "assert in_range_scaled([59]) == []", "assert in_range_scaled([3, -1, 58, 41, 19, -3, 60, 54]) == [-15, 5, 15]", "assert in_range_scaled([43, 56, -24, 44]) == []", "assert in_range_scaled([26, 9, 50, 58, -30, -24, -7]) == [-45]", "assert in_range_scaled([-30, 46, 41, -22, 31, -19]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([10, -15, 1, 6, 13, -15, -2]) == [-30, -5, 10]\nassert in_range_scaled([-30, 8, 38, 1, 45, 57, 26, -10]) == [-40, -5]\nassert in_range_scaled([59]) == []\nassert in_range_scaled([3, -1, 58, 41, 19, -3, 60, 54]) == [-15, 5, 15]\nassert in_range_scaled([43, 56, -24, 44]) == []\nassert in_range_scaled([26, 9, 50, 58, -30, -24, -7]) == [-45]\nassert in_range_scaled([-30, 46, 41, -22, 31, -19]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 9)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `in_range_scaled(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و9 (شاملًا الطرفين) في -5.\nمثال: `in_range_scaled([10, -15, 1, 6, 13, -15, -2])` يجب أن تُرجع `[-30, -5, 10]`.\nالجواب:", "qhash": "4edfec61578d6c62"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 1\n return total", "tests": ["assert scaled_powers(5) == 180", "assert scaled_powers(11) == 792", "assert scaled_powers(6) == 252", "assert scaled_powers(5) == 180", "assert scaled_powers(14) == 1260", "assert scaled_powers(1) == 12", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(5) == 180\nassert scaled_powers(11) == 792\nassert scaled_powers(6) == 252\nassert scaled_powers(5) == 180\nassert scaled_powers(14) == 1260\nassert scaled_powers(1) == 12\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(5)` يُرجع `180`.\nالجواب:", "qhash": "40725c59badda71a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('brain camel summer') == 'summer/camel/brain'", "assert reverse_words('garden camel code vector signal table stone') == 'stone/table/signal/vector/camel/garden'", "assert reverse_words('camel summer python python code') == 'python/python/summer/camel'", "assert reverse_words('on at table by') == 'table'", "assert reverse_words('') == ''", "assert reverse_words('river river go') == 'river/river'", "assert reverse_words('') == ''"], "test_code": "assert reverse_words('brain camel summer') == 'summer/camel/brain'\nassert reverse_words('garden camel code vector signal table stone') == 'stone/table/signal/vector/camel/garden'\nassert reverse_words('camel summer python python code') == 'python/python/summer/camel'\nassert reverse_words('on at table by') == 'table'\nassert reverse_words('') == ''\nassert reverse_words('river river go') == 'river/river'\nassert reverse_words('') == ''", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `reverse_words('brain camel summer')` يُرجع `'summer/camel/brain'`.\nالجواب:", "qhash": "3e605406dfaa5e28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return 4 * x ** 2 + (3) * x + (-1)", "tests": ["assert poly(1) == 6", "assert poly(-11) == 450", "assert poly(-20) == 1539", "assert poly(-14) == 741", "assert poly(-9) == 296", "assert poly(-17) == 1104", "assert poly(16) == 1071", "assert poly(0) == -1"], "test_code": "assert poly(1) == 6\nassert poly(-11) == 450\nassert poly(-20) == 1539\nassert poly(-14) == 741\nassert poly(-9) == 296\nassert poly(-17) == 1104\nassert poly(16) == 1071\nassert poly(0) == -1", "answer": "def poly(x):\n return 4 * x ** 2 + (3) * x + (-1)", "completion": " ```python\ndef poly(x):\n return 4 * x ** 2 + (3) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود 4x² + 3x - 1 عند العدد الصحيح x.\nمثال: `poly(1)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "3a94c976eaf45889"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total", "tests": ["assert total_pow(5) == 1575", "assert total_pow(6) == 3087", "assert total_pow(12) == 42588", "assert total_pow(3) == 252", "assert total_pow(4) == 700", "assert total_pow(1) == 7", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 1575\nassert total_pow(6) == 3087\nassert total_pow(12) == 42588\nassert total_pow(3) == 252\nassert total_pow(4) == 700\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 ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 3\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `total_pow(5)` يُرجع `1575`.\nالجواب:", "qhash": "6a6628c4173e0423"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [12, 26, 25, 23, 17, 24, 27]\nprint(xs[0:6])\nprint(xs[::-2])\nprint(len(xs[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [12, 26, 25, 23, 17, 24, 27]\nprint(xs[0:6])\nprint(xs[::-2])\nprint(len(xs[0:6]))\n```\nالجواب:", "qhash": "10b41a9662a09609", "answer": "[12, 26, 25, 23, 17, 24]\n[27, 17, 25, 12]\n6", "completion": " الناتج:\n```text\n[12, 26, 25, 23, 17, 24]\n[27, 17, 25, 12]\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total", "tests": ["assert series(8) == 78948", "assert series(3) == 882", "assert series(2) == 153", "assert series(8) == 78948", "assert series(12) == 546390", "assert series(1) == 9", "assert series(0) == 0"], "test_code": "assert series(8) == 78948\nassert series(3) == 882\nassert series(2) == 153\nassert series(8) == 78948\nassert series(12) == 546390\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 ** 4\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 4\n return total\n```\n", "buggy": "def series(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 series(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 4\n return total\n```\nمثال: `series(8)` يجب أن تُرجع `78948`.\nالجواب:", "qhash": "50d72f36331f7201"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'سفينة'\nprint(text.split())\nprint(text[0])\nprint('س' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'سفينة'\nprint(text.split())\nprint(text[0])\nprint('س' in text)\n```\nالجواب:", "qhash": "509c6568c1506d8b", "answer": "['سفينة']\nس\nTrue", "completion": " الناتج:\n```text\n['سفينة']\nس\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 12\nfor j in range(10, 31, 1):\n result += j * 3\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 12\nfor j in range(10, 31, 1):\n result += j * 3\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "0c47d8384fc26e73", "answer": "1272\n30", "completion": " الناتج:\n```text\n1272\n30\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "tests": ["assert pow_total(7) == 87024", "assert pow_total(7) == 87024", "assert pow_total(10) == 662475", "assert pow_total(7) == 87024", "assert pow_total(4) == 3900", "assert pow_total(1) == 3", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 87024\nassert pow_total(7) == 87024\nassert pow_total(10) == 662475\nassert pow_total(7) == 87024\nassert pow_total(4) == 3900\nassert pow_total(1) == 3\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 3 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `pow_total(7)` يُرجع `87024`.\nالجواب:", "qhash": "cac15d156360ff1d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سفينة') == 0", "assert letter_hits('سوق شجرة قهوة وردة سماء') == 2", "assert letter_hits('ليل رمل مدرسة مدرسة') == 0", "assert letter_hits('برمجة طائرة شجرة خبز جمل صديق حاسوب نهار') == 1", "assert letter_hits('شمس قهوة حاسوب شجرة صحراء فجر') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('برتقال برمجة صحراء ميناء سيارة جبل مطر') == 1\nassert letter_hits('بيت مدرسة نور بحر باب قهوة سلام') == 1\nassert letter_hits('سفينة') == 0\nassert letter_hits('سوق شجرة قهوة وردة سماء') == 2\nassert letter_hits('ليل رمل مدرسة مدرسة') == 0\nassert letter_hits('برمجة طائرة شجرة خبز جمل صديق حاسوب نهار') == 1\nassert letter_hits('شمس قهوة حاسوب شجرة صحراء فجر') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ق» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('برتقال برمجة صحراء ميناء سيارة جبل مطر')` يُرجع `1`.\nالجواب:", "qhash": "aa3eb9281474d713"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([32, -20, 47, 43, -11, 11]) == 32", "assert best_multiple([-4, -8, -4]) == -4", "assert best_multiple([1, 5, 9]) == None", "assert best_multiple([0, -21, -14, -10, 39, 1, 20, -24, -26]) == 20", "assert best_multiple([-21, 13, 5, 50, 19]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([32, -20, 47, 43, -11, 11]) == 32\nassert best_multiple([-4, -8, -4]) == -4\nassert best_multiple([1, 5, 9]) == None\nassert best_multiple([0, -21, -14, -10, 39, 1, 20, -24, -26]) == 20\nassert best_multiple([-21, 13, 5, 50, 19]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(values):\n best = 0\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 best_multiple(values):\n best = 0\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للتوضيح: الاستدعاء `best_multiple([32, -20, 47, 43, -11, 11])` يُرجع `32`.\nالجواب:", "qhash": "77d592efbf5de14d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('orange to is garden stone') == 'zclyrp ez td rlcopy dezyp'", "assert shift_text('orange planet') == 'zclyrp awlype'", "assert shift_text('of coffee camel is') == 'zq nzqqpp nlxpw td'", "assert shift_text('signal') == 'dtrylw'", "assert shift_text('data light') == 'olel wtrse'", "assert shift_text('garden brain falcon data go !') == 'rlcopy mclty qlwnzy olel rz !'", "assert shift_text('') == ''"], "test_code": "assert shift_text('orange to is garden stone') == 'zclyrp ez td rlcopy dezyp'\nassert shift_text('orange planet') == 'zclyrp awlype'\nassert shift_text('of coffee camel is') == 'zq nzqqpp nlxpw td'\nassert shift_text('signal') == 'dtrylw'\nassert shift_text('data light') == 'olel wtrse'\nassert shift_text('garden brain falcon data go !') == 'rlcopy mclty qlwnzy olel rz !'\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 + (-15)) % 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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('orange to is garden stone')` يُرجع `'zclyrp ez td rlcopy dezyp'`.\nالجواب:", "qhash": "35b1648e06f157b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 27", "tests": ["assert dig_pow_mod(76974) == 15", "assert dig_pow_mod(838194) == 19", "assert dig_pow_mod(502079) == 24", "assert dig_pow_mod(146962) == 12", "assert dig_pow_mod(934751) == 19", "assert dig_pow_mod(691514) == 25", "assert dig_pow_mod(866926) == 14", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(76974) == 15\nassert dig_pow_mod(838194) == 19\nassert dig_pow_mod(502079) == 24\nassert dig_pow_mod(146962) == 12\nassert dig_pow_mod(934751) == 19\nassert dig_pow_mod(691514) == 25\nassert dig_pow_mod(866926) == 14\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 27", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 27\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 27.\nللتوضيح: الاستدعاء `dig_pow_mod(76974)` يُرجع `15`.\nالجواب:", "qhash": "15ab81c38fe998b3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'no'}", "tests": ["assert tally('code stone orange signal light') == {'n': 3, 'o': 3}", "assert tally('banana summer on code banana falcon') == {'n': 6, 'o': 3}", "assert tally('is music pixel code') == {'n': 0, 'o': 1}", "assert tally('signal on engine we') == {'n': 4, 'o': 1}", "assert tally('banana python') == {'n': 3, 'o': 1}", "assert tally('river river') == {'n': 0, 'o': 0}", "assert tally('') == {'n': 0, 'o': 0}"], "test_code": "assert tally('code stone orange signal light') == {'n': 3, 'o': 3}\nassert tally('banana summer on code banana falcon') == {'n': 6, 'o': 3}\nassert tally('is music pixel code') == {'n': 0, 'o': 1}\nassert tally('signal on engine we') == {'n': 4, 'o': 1}\nassert tally('banana python') == {'n': 3, 'o': 1}\nassert tally('river river') == {'n': 0, 'o': 0}\nassert tally('') == {'n': 0, 'o': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'no'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'no'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `tally(s)` تعيد dict يربط كل محرف من المحارف 'n'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `tally('code stone orange signal light')` يُرجع `{'n': 3, 'o': 3}`.\nالجواب:", "qhash": "5ee79d0c573c52f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([32, 65, 24, 48, 81, 36, 24]) == 5", "assert how_many_div([-13, 68, 24, 32, 77, 26, -40, 35, 20, -30]) == 2", "assert how_many_div([]) == 0", "assert how_many_div([40, 51, 47, -7, 41, 41, 43]) == 1", "assert how_many_div([84, 24, 87, 4]) == 2", "assert how_many_div([37]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([32, 65, 24, 48, 81, 36, 24]) == 5\nassert how_many_div([-13, 68, 24, 32, 77, 26, -40, 35, 20, -30]) == 2\nassert how_many_div([]) == 0\nassert how_many_div([40, 51, 47, -7, 41, 41, 43]) == 1\nassert how_many_div([84, 24, 87, 4]) == 2\nassert how_many_div([37]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 7 != 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 % 3 == 0 and x % 7 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 7، واكتب الدالة بعد إكمالها.\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([32, 65, 24, 48, 81, 36, 24])` يُرجع `5`.\nالجواب:", "qhash": "334885b62945899a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 50", "tests": ["assert sum_digit_pow(20769) == 24", "assert sum_digit_pow(99484) == 34", "assert sum_digit_pow(999779) == 0", "assert sum_digit_pow(540200) == 11", "assert sum_digit_pow(734720) == 23", "assert sum_digit_pow(234473) == 23", "assert sum_digit_pow(538466) == 32", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(20769) == 24\nassert sum_digit_pow(99484) == 34\nassert sum_digit_pow(999779) == 0\nassert sum_digit_pow(540200) == 11\nassert sum_digit_pow(734720) == 23\nassert sum_digit_pow(234473) == 23\nassert sum_digit_pow(538466) == 32\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 50", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 1 for d in str(n)) % 50\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 1، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 50.\nللتوضيح: الاستدعاء `sum_digit_pow(20769)` يُرجع `24`.\nالجواب:", "qhash": "119c8c498471ec4e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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": "d9664be9c7eb66ed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert words_reversed('of winter to at up coffee we table') == 'table|we|coffee|up|at|to|winter|of'", "assert words_reversed('coffee camel music orange desert coffee on') == 'on|coffee|desert|orange|music|camel|coffee'", "assert words_reversed('coffee light') == 'light|coffee'", "assert words_reversed('camel pixel') == 'pixel|camel'", "assert words_reversed('brain winter') == 'winter|brain'", "assert words_reversed('rocket river an garden up apple light it') == 'it|light|apple|up|garden|an|river|rocket'", "assert words_reversed('coffee we desert cloud river pixel go') == 'go|pixel|river|cloud|desert|we|coffee'"], "test_code": "assert words_reversed('of winter to at up coffee we table') == 'table|we|coffee|up|at|to|winter|of'\nassert words_reversed('coffee camel music orange desert coffee on') == 'on|coffee|desert|orange|music|camel|coffee'\nassert words_reversed('coffee light') == 'light|coffee'\nassert words_reversed('camel pixel') == 'pixel|camel'\nassert words_reversed('brain winter') == 'winter|brain'\nassert words_reversed('rocket river an garden up apple light it') == 'it|light|apple|up|garden|an|river|rocket'\nassert words_reversed('coffee we desert cloud river pixel go') == 'go|pixel|river|cloud|desert|we|coffee'", "answer": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `words_reversed('of winter to at up coffee we table')` يجب أن تُرجع `'table|we|coffee|up|at|to|winter|of'`.\nالجواب:", "qhash": "abc3f2717668871b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('planet camel light') == 'light camel planet'", "assert words_reversed('python data banana cloud code it engine garden') == 'garden engine cloud banana python'", "assert words_reversed('to it falcon winter a') == 'winter falcon'", "assert words_reversed('up music it on summer river python') == 'python river summer music'", "assert words_reversed('banana is river on') == 'river banana'", "assert words_reversed('matrix code desert apple engine code river') == 'river engine apple desert matrix'", "assert words_reversed('window river banana vector') == 'vector banana river window'"], "test_code": "assert words_reversed('planet camel light') == 'light camel planet'\nassert words_reversed('python data banana cloud code it engine garden') == 'garden engine cloud banana python'\nassert words_reversed('to it falcon winter a') == 'winter falcon'\nassert words_reversed('up music it on summer river python') == 'python river summer music'\nassert words_reversed('banana is river on') == 'river banana'\nassert words_reversed('matrix code desert apple engine code river') == 'river engine apple desert matrix'\nassert words_reversed('window river banana vector') == 'vector banana river window'", "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('planet camel light')` يجب أن تُرجع `'light camel planet'`.\nالجواب:", "qhash": "425795ca2fd45ff4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [-2, 7, 6, 3, -8]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [-2, 7, 6, 3, -8]\nprint(sorted(nums, key=lambda x: (abs(x - -7), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "8eab4ad4632376a8", "answer": "[-8, -2, 3, 6, 7]\n[7, 6, 3]", "completion": " الناتج:\n```text\n[-8, -2, 3, 6, 7]\n[7, 6, 3]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x * 0 + -5 for x in range(-2, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x * 0 + -5 for x in range(-2, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "31f4bb62c438acda", "answer": "[-5, -5, -5, -5, -5]\n5 -25", "completion": " الناتج:\n```text\n[-5, -5, -5, -5, -5]\n5 -25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([30, 44, -24, -28, 54, -12]) == 54", "assert max_of_div([-45, -45, -45]) == -45", "assert max_of_div([1]) == None", "assert max_of_div([-28, -24, 18, -29, -32, -27, 36]) == 36", "assert max_of_div([41, 44, -38, -49]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([30, 44, -24, -28, 54, -12]) == 54\nassert max_of_div([-45, -45, -45]) == -45\nassert max_of_div([1]) == None\nassert max_of_div([-28, -24, 18, -29, -32, -27, 36]) == 36\nassert max_of_div([41, 44, -38, -49]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 9 == 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 % 9 == 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 % 9 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(values):\n best = 0\n for x in values:\n if x % 9 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([30, 44, -24, -28, 54, -12])` يُرجع `54`.\nالجواب:", "qhash": "ab55c3ef2e00d037"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "tests": ["assert sum_powers(8) == 2448", "assert sum_powers(10) == 4620", "assert sum_powers(14) == 12180", "assert sum_powers(10) == 4620", "assert sum_powers(5) == 660", "assert sum_powers(1) == 12", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(8) == 2448\nassert sum_powers(10) == 4620\nassert sum_powers(14) == 12180\nassert sum_powers(10) == 4620\nassert sum_powers(5) == 660\nassert sum_powers(1) == 12\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(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_powers(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 12 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n):\n total += 12 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(8)` يُرجع `2448`.\nالجواب:", "qhash": "35d0660ba2b194cf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('camel table table stone table brain') == 'brain,table,stone,table,table,camel'", "assert flip_words('go apple engine is river a') == 'river,engine,apple'", "assert flip_words('camel signal pixel') == 'pixel,signal,camel'", "assert flip_words('') == ''", "assert flip_words('river rocket camel window code') == 'window,camel,rocket,river'", "assert flip_words('orange we go summer') == 'summer,orange'", "assert flip_words('falcon stone') == 'stone,falcon'"], "test_code": "assert flip_words('camel table table stone table brain') == 'brain,table,stone,table,table,camel'\nassert flip_words('go apple engine is river a') == 'river,engine,apple'\nassert flip_words('camel signal pixel') == 'pixel,signal,camel'\nassert flip_words('') == ''\nassert flip_words('river rocket camel window code') == 'window,camel,rocket,river'\nassert flip_words('orange we go summer') == 'summer,orange'\nassert flip_words('falcon stone') == 'stone,falcon'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `flip_words('camel table table stone table brain')` يُرجع `'brain,table,stone,table,table,camel'`.\nالجواب:", "qhash": "6192fd5d0a46b5f8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "items = [14, -2, 11, 36, 19, 27, 29]\nprint(items[2:6])\nprint(items[::3])\nprint(min(items[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nitems = [14, -2, 11, 36, 19, 27, 29]\nprint(items[2:6])\nprint(items[::3])\nprint(min(items[2:6]))\n```\nالجواب:", "qhash": "bac647c56b2c673c", "answer": "[11, 36, 19, 27]\n[14, 36, 29]\n11", "completion": " الناتج:\n```text\n[11, 36, 19, 27]\n[14, 36, 29]\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('code planet coffee planet brain') == 'brain-planet-coffee-planet-code'", "assert backwards('music desert up brain rocket') == 'rocket-brain-up-desert-music'", "assert backwards('music to window') == 'window-to-music'", "assert backwards('') == ''", "assert backwards('python orange river window python we a desert') == 'desert-a-we-python-window-river-orange-python'", "assert backwards('table vector') == 'vector-table'", "assert backwards('music cloud coffee') == 'coffee-cloud-music'"], "test_code": "assert backwards('code planet coffee planet brain') == 'brain-planet-coffee-planet-code'\nassert backwards('music desert up brain rocket') == 'rocket-brain-up-desert-music'\nassert backwards('music to window') == 'window-to-music'\nassert backwards('') == ''\nassert backwards('python orange river window python we a desert') == 'desert-a-we-python-window-river-orange-python'\nassert backwards('table vector') == 'vector-table'\nassert backwards('music cloud coffee') == 'coffee-cloud-music'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '-'.\nللتوضيح: الاستدعاء `backwards('code planet coffee planet brain')` يُرجع `'brain-planet-coffee-planet-code'`.\nالجواب:", "qhash": "fc633310ddf04ec6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [7, 17, 18, -4, 13, -16]\nprint(sorted(nums, key=lambda x: (abs(x - 9), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [7, 17, 18, -4, 13, -16]\nprint(sorted(nums, key=lambda x: (abs(x - 9), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "2ee508645d9ce48b", "answer": "[7, 13, 17, 18, -4, -16]\n[18, 17, 13]", "completion": " الناتج:\n```text\n[7, 13, 17, 18, -4, -16]\n[18, 17, 13]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (-4) * x + (1)", "tests": ["assert evaluate(3) == -2", "assert evaluate(-7) == 78", "assert evaluate(-1) == 6", "assert evaluate(-9) == 118", "assert evaluate(-4) == 33", "assert evaluate(8) == 33", "assert evaluate(18) == 253", "assert evaluate(0) == 1"], "test_code": "assert evaluate(3) == -2\nassert evaluate(-7) == 78\nassert evaluate(-1) == 6\nassert evaluate(-9) == 118\nassert evaluate(-4) == 33\nassert evaluate(8) == 33\nassert evaluate(18) == 253\nassert evaluate(0) == 1", "answer": "def evaluate(x):\n return 1 * x ** 2 + (-4) * x + (1)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (-4) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 1x² - 4x + 1 عند العدد الصحيح x.\nمثال: `evaluate(3)` يجب أن تُرجع `-2`.\nالجواب:", "qhash": "e1d74a54f2e194be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('طائرة لغة سيارة نهر معلم تفاحة لغة') == 0", "assert how_many('فجر') == 1", "assert how_many('جبل عربية') == 1", "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('طائرة لغة سيارة نهر معلم تفاحة لغة') == 0\nassert how_many('فجر') == 1\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)` بحيث تُعيد عدد مرات ظهور الحرف «ج» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `how_many('جبل خبز سلام نور')` يُرجع `1`.\nالجواب:", "qhash": "bc5f08f14caefb52"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 17412\ncount = 0\nwhile n > 19:\n n = n // 2\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 17412\ncount = 0\nwhile n > 19:\n n = n // 2\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "4840990f9bc9727e", "answer": "17 10", "completion": " الناتج:\n```text\n17 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([16, 13, 20, 47, 44]) == [47, 44, 16, 13, 20]", "assert rotate_list([10, 32, 16, 4, 26, 25, 18, -7, 39, 10, 48, 13]) == [48, 13, 10, 32, 16, 4, 26, 25, 18, -7, 39, 10]", "assert rotate_list([38, 40, 45, 2, 46, 4, 37, 38]) == [37, 38, 38, 40, 45, 2, 46, 4]", "assert rotate_list([50, 28, 4, 34, 44, 0, -3]) == [0, -3, 50, 28, 4, 34, 44]", "assert rotate_list([19, 9, 8, 24, 25]) == [24, 25, 19, 9, 8]", "assert rotate_list([12, 24, 35, -7, 2, 5, 21, 44, -9, 22, 24]) == [22, 24, 12, 24, 35, -7, 2, 5, 21, 44, -9]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([16, 13, 20, 47, 44]) == [47, 44, 16, 13, 20]\nassert rotate_list([10, 32, 16, 4, 26, 25, 18, -7, 39, 10, 48, 13]) == [48, 13, 10, 32, 16, 4, 26, 25, 18, -7, 39, 10]\nassert rotate_list([38, 40, 45, 2, 46, 4, 37, 38]) == [37, 38, 38, 40, 45, 2, 46, 4]\nassert rotate_list([50, 28, 4, 34, 44, 0, -3]) == [0, -3, 50, 28, 4, 34, 44]\nassert rotate_list([19, 9, 8, 24, 25]) == [24, 25, 19, 9, 8]\nassert rotate_list([12, 24, 35, -7, 2, 5, 21, 44, -9, 22, 24]) == [22, 24, 12, 24, 35, -7, 2, 5, 21, 44, -9]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n if not lst:\n return []\n k = 2 % 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 = 2 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(lst):\n if not lst:\n return []\n k = 2 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([16, 13, 20, 47, 44])` يُرجع `[47, 44, 16, 13, 20]`.\nالجواب:", "qhash": "6f4308d37d088e1a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'مكتبة'\nprint(w.find('ب'))\nprint(w.replace(' ', '-'))\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'مكتبة'\nprint(w.find('ب'))\nprint(w.replace(' ', '-'))\nprint(w[0])\n```\nالجواب:", "qhash": "38aa0cb5f9c9bdc0", "answer": "3\nمكتبة\nم", "completion": " الناتج:\n```text\n3\nمكتبة\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [1, 31, 36, 10, -13]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [1, 31, 36, 10, -13]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "088f4b60b615a19d", "answer": "[10, 31, 36, 1, -13]\n[36, 31, 10]", "completion": " الناتج:\n```text\n[10, 31, 36, 1, -13]\n[36, 31, 10]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([66, 11, 54, 34, 60, 11, 78, 42, 51]) == 1", "assert only_div([28, 73, 36, 64, 87, -15, 5, -1]) == 2", "assert only_div([18, 70]) == 0", "assert only_div([62, 42]) == 0", "assert only_div([60, 37]) == 1", "assert only_div([64, -19]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([66, 11, 54, 34, 60, 11, 78, 42, 51]) == 1\nassert only_div([28, 73, 36, 64, 87, -15, 5, -1]) == 2\nassert only_div([18, 70]) == 0\nassert only_div([62, 42]) == 0\nassert only_div([60, 37]) == 1\nassert only_div([64, -19]) == 1\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([66, 11, 54, 34, 60, 11, 78, 42, 51])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "258d61a96b3745c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('مطر حاسوب حاسوب ميناء قمر جبل') == 1", "assert count_start('علم مكتبة تفاحة سوق جمل معلم دفتر') == 1", "assert count_start('بحر بيت علم جمل علم طالب نهر جبل') == 2", "assert count_start('حاسوب جمل جبل ميناء برمجة') == 2", "assert count_start('جبل مدينة وردة سلام خبز بيت جبل') == 2", "assert count_start('نور حصان') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('مطر حاسوب حاسوب ميناء قمر جبل') == 1\nassert count_start('علم مكتبة تفاحة سوق جمل معلم دفتر') == 1\nassert count_start('بحر بيت علم جمل علم طالب نهر جبل') == 2\nassert count_start('حاسوب جمل جبل ميناء برمجة') == 2\nassert count_start('جبل مدينة وردة سلام خبز بيت جبل') == 2\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('مطر حاسوب حاسوب ميناء قمر جبل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "66874d4dd7a8a27b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [(x + 10) // 5 for x in range(-6, 9) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [(x + 10) // 5 for x in range(-6, 9) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e9a6da960219db60", "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": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert shift_list([35, 25, 31, 6]) == [25, 31, 6, 35]", "assert shift_list([36, -7, 33, -3]) == [-7, 33, -3, 36]", "assert shift_list([35, 44, 39, 33, 38, 22, 46]) == [46, 35, 44, 39, 33, 38, 22]", "assert shift_list([-6, 13, 36, 12, 47, 31, 0, 26, -2, -1, 35]) == [26, -2, -1, 35, -6, 13, 36, 12, 47, 31, 0]", "assert shift_list([14, 15, -6, 19]) == [15, -6, 19, 14]", "assert shift_list([-1, 49, 14, 44, 33, -5, 3]) == [3, -1, 49, 14, 44, 33, -5]", "assert shift_list([]) == []"], "test_code": "assert shift_list([35, 25, 31, 6]) == [25, 31, 6, 35]\nassert shift_list([36, -7, 33, -3]) == [-7, 33, -3, 36]\nassert shift_list([35, 44, 39, 33, 38, 22, 46]) == [46, 35, 44, 39, 33, 38, 22]\nassert shift_list([-6, 13, 36, 12, 47, 31, 0, 26, -2, -1, 35]) == [26, -2, -1, 35, -6, 13, 36, 12, 47, 31, 0]\nassert shift_list([14, 15, -6, 19]) == [15, -6, 19, 14]\nassert shift_list([-1, 49, 14, 44, 33, -5, 3]) == [3, -1, 49, 14, 44, 33, -5]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nمثال: `shift_list([35, 25, 31, 6])` يجب أن تُرجع `[25, 31, 6, 35]`.\nالجواب:", "qhash": "14532f404781f03b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'قهوة حصان'\nprint(len(text))\nprint('ا' in text)\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'قهوة حصان'\nprint(len(text))\nprint('ا' in text)\nprint(text[::-1])\n```\nالجواب:", "qhash": "53b0fccabe46ed8e", "answer": "9\nTrue\nناصح ةوهق", "completion": " الناتج:\n```text\n9\nTrue\nناصح ةوهق\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'طائرة'\nprint(len(s))\nprint(s[::-1])\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'طائرة'\nprint(len(s))\nprint(s[::-1])\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "f7ddef64fdc853aa", "answer": "5\nةرئاط\nطائرة", "completion": " الناتج:\n```text\n5\nةرئاط\nطائرة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([40, 51, 13, 45, -5, -21]) == None", "assert top_divisible([-24, -12, -30]) == -12", "assert top_divisible([1, 7, 13, 19]) == None", "assert top_divisible([17, -2, -30]) == -30", "assert top_divisible([-11, 44, -45]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([40, 51, 13, 45, -5, -21]) == None\nassert top_divisible([-24, -12, -30]) == -12\nassert top_divisible([1, 7, 13, 19]) == None\nassert top_divisible([17, -2, -30]) == -30\nassert top_divisible([-11, 44, -45]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(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للتوضيح: الاستدعاء `top_divisible([40, 51, 13, 45, -5, -21])` يُرجع `None`.\nالجواب:", "qhash": "c80de2281e773bd2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'falcon'\nprint(word[3:4])\nprint(word.replace('o', '#'))\nprint(word.count('o'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'falcon'\nprint(word[3:4])\nprint(word.replace('o', '#'))\nprint(word.count('o'))\n```\nالجواب:", "qhash": "e2576f1baa40a9cb", "answer": "c\nfalc#n\n1", "completion": " الناتج:\n```text\nc\nfalc#n\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 110:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([51, 57, 39, 33, 9, 24, 60]) == [51, 108, 0, 33, 42, 66, 0]", "assert cumulative([25, 99, 75, 56, 86, 31]) == [25, 0, 75, 0, 86, 0]", "assert cumulative([71, 88, 14]) == [71, 0, 14]", "assert cumulative([69, 76, 86, 86, 31, -4, 40]) == [69, 0, 86, 0, 31, 27, 67]", "assert cumulative([60, 107, 103, 38, 72]) == [60, 0, 103, 0, 72]", "assert cumulative([]) == []", "assert cumulative([]) == []"], "test_code": "assert cumulative([51, 57, 39, 33, 9, 24, 60]) == [51, 108, 0, 33, 42, 66, 0]\nassert cumulative([25, 99, 75, 56, 86, 31]) == [25, 0, 75, 0, 86, 0]\nassert cumulative([71, 88, 14]) == [71, 0, 14]\nassert cumulative([69, 76, 86, 86, 31, -4, 40]) == [69, 0, 86, 0, 31, 27, 67]\nassert cumulative([60, 107, 103, 38, 72]) == [60, 0, 103, 0, 72]\nassert cumulative([]) == []\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 110:\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 > 110:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 110 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([51, 57, 39, 33, 9, 24, 60])` يجب أن تُرجع `[51, 108, 0, 33, 42, 66, 0]`.\nالجواب:", "qhash": "2288dc0a869cb18e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=5):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-10))\nprint(h(-10, 19))\nprint(h(h(19), -10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=5):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-10))\nprint(h(-10, 19))\nprint(h(h(19), -10))\n```\nالجواب:", "qhash": "4826a4a9e9c2dd81", "answer": "25\n123\n906", "completion": " الناتج:\n```text\n25\n123\n906\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 74) == 1)", "tests": ["assert rel_prime_count(97) == 48", "assert rel_prime_count(33) == 17", "assert rel_prime_count(39) == 19", "assert rel_prime_count(175) == 86", "assert rel_prime_count(48) == 23", "assert rel_prime_count(62) == 30", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(97) == 48\nassert rel_prime_count(33) == 17\nassert rel_prime_count(39) == 19\nassert rel_prime_count(175) == 86\nassert rel_prime_count(48) == 23\nassert rel_prime_count(62) == 30\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, 74) == 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, 74) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 74، أي أن القاسم المشترك الأكبر لها مع 74 يساوي 1.\nمثال: `rel_prime_count(97)` يجب أن تُرجع `48`.\nالجواب:", "qhash": "6d6623004e608f07"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 17", "tests": ["assert step_product(5) == 10", "assert step_product(53) == 0", "assert step_product(22) == 14", "assert step_product(54) == 0", "assert step_product(27) == 6", "assert step_product(21) == 3", "assert step_product(0) == 1"], "test_code": "assert step_product(5) == 10\nassert step_product(53) == 0\nassert step_product(22) == 14\nassert step_product(54) == 0\nassert step_product(27) == 6\nassert step_product(21) == 3\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 17", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 3)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(5)` يُرجع `10`.\nالجواب:", "qhash": "fefe1d8127f9c565"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 81:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([34, 44, 33, 21, 6, 34]) == [34, 78, 0, 21, 27, 61]", "assert capped_cumsum([69, 57, -8, 80, 14, 61, 79, 28]) == [69, 0, -8, 72, 0, 61, 0, 28]", "assert capped_cumsum([21, 31, -4, 42, 60, 77]) == [21, 52, 48, 0, 60, 0]", "assert capped_cumsum([42, -5]) == [42, 37]", "assert capped_cumsum([24, 45, 60]) == [24, 69, 0]", "assert capped_cumsum([70, 68, 73, 78, 24, 49]) == [70, 0, 73, 0, 24, 73]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([34, 44, 33, 21, 6, 34]) == [34, 78, 0, 21, 27, 61]\nassert capped_cumsum([69, 57, -8, 80, 14, 61, 79, 28]) == [69, 0, -8, 72, 0, 61, 0, 28]\nassert capped_cumsum([21, 31, -4, 42, 60, 77]) == [21, 52, 48, 0, 60, 0]\nassert capped_cumsum([42, -5]) == [42, 37]\nassert capped_cumsum([24, 45, 60]) == [24, 69, 0]\nassert capped_cumsum([70, 68, 73, 78, 24, 49]) == [70, 0, 73, 0, 24, 73]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 81:\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 > 81:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 81 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([34, 44, 33, 21, 6, 34])` يجب أن تُرجع `[34, 78, 0, 21, 27, 61]`.\nالجواب:", "qhash": "6431391327769a74"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -4 * x ** 2 + (-3) * x + (4)", "tests": ["assert p(4) == -72", "assert p(-9) == -293", "assert p(5) == -111", "assert p(2) == -18", "assert p(-16) == -972", "assert p(-18) == -1238", "assert p(-12) == -536", "assert p(0) == 4"], "test_code": "assert p(4) == -72\nassert p(-9) == -293\nassert p(5) == -111\nassert p(2) == -18\nassert p(-16) == -972\nassert p(-18) == -1238\nassert p(-12) == -536\nassert p(0) == 4", "answer": "def p(x):\n return -4 * x ** 2 + (-3) * x + (4)", "completion": " ```python\ndef p(x):\n return -4 * x ** 2 + (-3) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -4x² - 3x + 4 عند العدد الصحيح x.\nمثال: `p(4)` يجب أن تُرجع `-72`.\nالجواب:", "qhash": "780604aca6999a58"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([59, 19, 45, 33, 37, 28, 60, 30, 13, 6]) == 3", "assert how_many_div([-37, 77, 36, 87, -34, 11, -11, 59, 42, 62]) == 0", "assert how_many_div([]) == 0", "assert how_many_div([84, -18, 13, 17, 85, 41, 61, 66, 58, 67]) == 1", "assert how_many_div([]) == 0", "assert how_many_div([66, 18, 19, 9, -8, 17, 75, -12, 65, 85]) == 3", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([59, 19, 45, 33, 37, 28, 60, 30, 13, 6]) == 3\nassert how_many_div([-37, 77, 36, 87, -34, 11, -11, 59, 42, 62]) == 0\nassert how_many_div([]) == 0\nassert how_many_div([84, -18, 13, 17, 85, 41, 61, 66, 58, 67]) == 1\nassert how_many_div([]) == 0\nassert how_many_div([66, 18, 19, 9, -8, 17, 75, -12, 65, 85]) == 3\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 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 % 5 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 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([59, 19, 45, 33, 37, 28, 60, 30, 13, 6])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "88c541fb5aca0b86"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 97", "tests": ["assert pow_digits(58997) == 68", "assert pow_digits(336395) == 92", "assert pow_digits(637112) == 13", "assert pow_digits(106139) == 83", "assert pow_digits(567606) == 27", "assert pow_digits(969981) == 50", "assert pow_digits(24767) == 65", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(58997) == 68\nassert pow_digits(336395) == 92\nassert pow_digits(637112) == 13\nassert pow_digits(106139) == 83\nassert pow_digits(567606) == 27\nassert pow_digits(969981) == 50\nassert pow_digits(24767) == 65\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 97", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 97.\nللتوضيح: الاستدعاء `pow_digits(58997)` يُرجع `68`.\nالجواب:", "qhash": "542dbc8029dc37a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 7\nfor i in range(-2, 2, 4):\n total += i * 6\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 7\nfor i in range(-2, 2, 4):\n total += i * 6\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "97b9e08921340459", "answer": "-5\n-2", "completion": " الناتج:\n```text\n-5\n-2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "tests": ["assert multiples_total(183) == 4827", "assert multiples_total(257) == 9198", "assert multiples_total(16) == 39", "assert multiples_total(142) == 2874", "assert multiples_total(48) == 273", "assert multiples_total(237) == 7977", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(183) == 4827\nassert multiples_total(257) == 9198\nassert multiples_total(16) == 39\nassert multiples_total(142) == 2874\nassert multiples_total(48) == 273\nassert multiples_total(237) == 7977\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 % 7 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 7.\nمثال: `multiples_total(183)` يجب أن تُرجع `4827`.\nالجواب:", "qhash": "20e73c4b5563dbe9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('is camel code desert') == 'lv fdpho frgh ghvhuw'", "assert encode('at on cloud desert A1') == 'dw rq forxg ghvhuw A1'", "assert encode('engine it garden on up') == 'hqjlqh lw jdughq rq xs'", "assert encode('table by light desert A1') == 'wdeoh eb oljkw ghvhuw A1'", "assert encode('desert table stone code Hello') == 'ghvhuw wdeoh vwrqh frgh Hhoor'", "assert encode('banana garden !') == 'edqdqd jdughq !'", "assert encode('') == ''"], "test_code": "assert encode('is camel code desert') == 'lv fdpho frgh ghvhuw'\nassert encode('at on cloud desert A1') == 'dw rq forxg ghvhuw A1'\nassert encode('engine it garden on up') == 'hqjlqh lw jdughq rq xs'\nassert encode('table by light desert A1') == 'wdeoh eb oljkw ghvhuw A1'\nassert encode('desert table stone code Hello') == 'ghvhuw wdeoh vwrqh frgh Hhoor'\nassert encode('banana garden !') == 'edqdqd jdughq !'\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 + (3)) % 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 + (3)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('is camel code desert')` يجب أن تُرجع `'lv fdpho frgh ghvhuw'`.\nالجواب:", "qhash": "7581e8afb98c1d9a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'banana_signal'\nprint(name.upper())\nprint(name[::-1])\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'banana_signal'\nprint(name.upper())\nprint(name[::-1])\nprint(len(name))\n```\nالجواب:", "qhash": "929d051f707c1fc8", "answer": "BANANA_SIGNAL\nlangis_ananab\n13", "completion": " الناتج:\n```text\nBANANA_SIGNAL\nlangis_ananab\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [25, 31, 11, 37, 3, 26]\nprint(a[3:5])\nprint(a[::-1])\nprint(max(a[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [25, 31, 11, 37, 3, 26]\nprint(a[3:5])\nprint(a[::-1])\nprint(max(a[3:5]))\n```\nالجواب:", "qhash": "4937039ab7049a73", "answer": "[37, 3]\n[26, 3, 37, 11, 31, 25]\n37", "completion": " الناتج:\n```text\n[37, 3]\n[26, 3, 37, 11, 31, 25]\n37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 19 <= x <= 29)", "tests": ["assert in_range_scaled([12, 24, 21, 14, 39, 9, 9, 13]) == [105, 120]", "assert in_range_scaled([30, 0]) == []", "assert in_range_scaled([50, 58, -9, -9, 33, 36, 25, 42]) == [125]", "assert in_range_scaled([48, 0, 18, 17]) == []", "assert in_range_scaled([44, 5, -29, -14, -8, 33, -2, -27, -6, 17]) == []", "assert in_range_scaled([43, 28]) == [140]", "assert in_range_scaled([]) == []", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([12, 24, 21, 14, 39, 9, 9, 13]) == [105, 120]\nassert in_range_scaled([30, 0]) == []\nassert in_range_scaled([50, 58, -9, -9, 33, 36, 25, 42]) == [125]\nassert in_range_scaled([48, 0, 18, 17]) == []\nassert in_range_scaled([44, 5, -29, -14, -8, 33, -2, -27, -6, 17]) == []\nassert in_range_scaled([43, 28]) == [140]\nassert in_range_scaled([]) == []\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 19 <= x <= 29)", "completion": " ```python\ndef in_range_scaled(xs):\n return sorted(x * 5 for x in xs if 19 <= x <= 29)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `in_range_scaled(xs)`: اختر من القائمة xs العناصر x التي تحقق 19 ≤ x ≤ 29، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `in_range_scaled([12, 24, 21, 14, 39, 9, 9, 13])` يُرجع `[105, 120]`.\nالجواب:", "qhash": "08da9ecac0397354"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 106\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 = 106\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": "90c32068848b0e2b", "answer": "12", "completion": " الناتج:\n```text\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 5\nfor n in range(0, 15, 1):\n s -= n * 5\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 5\nfor n in range(0, 15, 1):\n s -= n * 5\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "4deb9313454e32f2", "answer": "-520\n14", "completion": " الناتج:\n```text\n-520\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 5)", "tests": ["assert filter_range([1, 0, -3, -16, -4]) == [-2, 0, 6, 8]", "assert filter_range([26, 25, 60, -29, 42, 9, -8]) == [16]", "assert filter_range([]) == []", "assert filter_range([-18, -18]) == []", "assert filter_range([]) == []", "assert filter_range([57, -19, -8, -25, -14, -26, -16, -20, -28, -9]) == [16, 18]", "assert filter_range([32, 51, 2, 36, 38, 13, 55, 30, -5]) == [-4, 10]", "assert filter_range([]) == []"], "test_code": "assert filter_range([1, 0, -3, -16, -4]) == [-2, 0, 6, 8]\nassert filter_range([26, 25, 60, -29, 42, 9, -8]) == [16]\nassert filter_range([]) == []\nassert filter_range([-18, -18]) == []\nassert filter_range([]) == []\nassert filter_range([57, -19, -8, -25, -14, -26, -16, -20, -28, -9]) == [16, 18]\nassert filter_range([32, 51, 2, 36, 38, 13, 55, 30, -5]) == [-4, 10]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 5)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -10 ≤ x ≤ 5، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([1, 0, -3, -16, -4])` يُرجع `[-2, 0, 6, 8]`.\nالجواب:", "qhash": "51e2f029a69e1a8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([26, 4, -30, 18]) == 18", "assert max_div([-30, -18, -12]) == -12", "assert max_div([1, 7, 13]) == None", "assert max_div([-12, 7, 32, -27]) == -12", "assert max_div([41, 0, -39, 50, 8, 35, 49, -50, -40]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([26, 4, -30, 18]) == 18\nassert max_div([-30, -18, -12]) == -12\nassert max_div([1, 7, 13]) == None\nassert max_div([-12, 7, 32, -27]) == -12\nassert max_div([41, 0, -39, 50, 8, 35, 49, -50, -40]) == 0\nassert max_div([]) == None", "answer": "def max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(xs):\n best = None\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(xs):\n best = 0\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_div(xs):\n best = 0\n for x in xs:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_div([26, 4, -30, 18])` يُرجع `18`.\nالجواب:", "qhash": "d7154f0709c9f858"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 66085\ncount = 0\nwhile x > 7:\n x = x // 9\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 66085\ncount = 0\nwhile x > 7:\n x = x // 9\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "f39e922e77b7df39", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert tally_div([55, 45, 41, 50, 28, 23]) == 1", "assert tally_div([23, 77, 32, 19, 49, 76, 35, -7, 29, -11, -28, 26]) == 4", "assert tally_div([18, 25, -31, 67, 29]) == 1", "assert tally_div([-2, 34, 28, 89, 68, -17, -30]) == 4", "assert tally_div([-13, -15, 30, -18, 17, -12, -24]) == 3", "assert tally_div([0, 89, 11, 76, 74, 88, 56, 9, 25, 54, -13, -15]) == 5", "assert tally_div([]) == 0"], "test_code": "assert tally_div([55, 45, 41, 50, 28, 23]) == 1\nassert tally_div([23, 77, 32, 19, 49, 76, 35, -7, 29, -11, -28, 26]) == 4\nassert tally_div([18, 25, -31, 67, 29]) == 1\nassert tally_div([-2, 34, 28, 89, 68, -17, -30]) == 4\nassert tally_div([-13, -15, 30, -18, 17, -12, -24]) == 3\nassert tally_div([0, 89, 11, 76, 74, 88, 56, 9, 25, 54, -13, -15]) == 5\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef tally_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([55, 45, 41, 50, 28, 23])` يُرجع `1`.\nالجواب:", "qhash": "21c7bfa38ac0ceb0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 146:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([42, 16, 20, 51, 37, 19, 76]) == [42, 58, 78, 129, 0, 19, 95]", "assert cumulative([114, 65, 31, 73, 45, 16, 114, 91]) == [114, 0, 31, 104, 0, 16, 130, 0]", "assert cumulative([87, 49, 102, 108, 14]) == [87, 136, 0, 108, 122]", "assert cumulative([76, 103, 20, 26, 72, 80]) == [76, 0, 20, 46, 118, 0]", "assert cumulative([138, 41, 19, 102, 29, -9, 109]) == [138, 0, 19, 121, 0, -9, 100]", "assert cumulative([130, 11, 52, 107, 139, 139, 96]) == [130, 141, 0, 107, 0, 139, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([42, 16, 20, 51, 37, 19, 76]) == [42, 58, 78, 129, 0, 19, 95]\nassert cumulative([114, 65, 31, 73, 45, 16, 114, 91]) == [114, 0, 31, 104, 0, 16, 130, 0]\nassert cumulative([87, 49, 102, 108, 14]) == [87, 136, 0, 108, 122]\nassert cumulative([76, 103, 20, 26, 72, 80]) == [76, 0, 20, 46, 118, 0]\nassert cumulative([138, 41, 19, 102, 29, -9, 109]) == [138, 0, 19, 121, 0, -9, 100]\nassert cumulative([130, 11, 52, 107, 139, 139, 96]) == [130, 141, 0, 107, 0, 139, 0]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 146:\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 > 146:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 146 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([42, 16, 20, 51, 37, 19, 76])` يُرجع `[42, 58, 78, 129, 0, 19, 95]`.\nالجواب:", "qhash": "90eea28e86cfe35e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_special([15, 25, 89, 65, 80, 69]) == 1", "assert count_special([]) == 0", "assert count_special([72, 17, -27, -2, -18, 69, 81, 83]) == 1", "assert count_special([23, 68, -36, 1, -22, 13, 53]) == 2", "assert count_special([-33, 11, 81, 55, 86, 48, -14, -14, 34]) == 4", "assert count_special([-34, 76, 37, 77, 83, -5, -1, 26, 83, 64, 66]) == 4", "assert count_special([]) == 0"], "test_code": "assert count_special([15, 25, 89, 65, 80, 69]) == 1\nassert count_special([]) == 0\nassert count_special([72, 17, -27, -2, -18, 69, 81, 83]) == 1\nassert count_special([23, 68, -36, 1, -22, 13, 53]) == 2\nassert count_special([-33, 11, 81, 55, 86, 48, -14, -14, 34]) == 4\nassert count_special([-34, 76, 37, 77, 83, -5, -1, 26, 83, 64, 66]) == 4\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_special(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 3، ثم اكتب الدالة كاملة.\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([15, 25, 89, 65, 80, 69])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "c014532cece697c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=7):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(f(8))\nprint(f(8, 8))\nprint(f(f(8), 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=7):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(f(8))\nprint(f(8, 8))\nprint(f(f(8), 8))\n```\nالجواب:", "qhash": "05928f494e4ccb12", "answer": "-39\n-24\n-71", "completion": " الناتج:\n```text\n-39\n-24\n-71\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(29) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', 'Tac', '11', '12', '13', 'Tic', '15', '16', '17', '18', '19', 'Tac', 'Tic', '22', '23', '24', '25', '26', '27', 'Tic', '29']", "assert label_numbers(3) == ['1', '2', '3']", "assert label_numbers(20) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', 'Tac', '11', '12', '13', 'Tic', '15', '16', '17', '18', '19', 'Tac']", "assert label_numbers(5) == ['1', '2', '3', '4', '5']", "assert label_numbers(1) == ['1']"], "test_code": "assert label_numbers(29) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', 'Tac', '11', '12', '13', 'Tic', '15', '16', '17', '18', '19', 'Tac', 'Tic', '22', '23', '24', '25', '26', '27', 'Tic', '29']\nassert label_numbers(3) == ['1', '2', '3']\nassert label_numbers(20) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', 'Tac', '11', '12', '13', 'Tic', '15', '16', '17', '18', '19', 'Tac']\nassert label_numbers(5) == ['1', '2', '3', '4', '5']\nassert label_numbers(1) == ['1']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(29)` يُرجع `['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', 'Tac', '11', '12', '13', 'Tic', '15', '16', '17', '18', '19', 'Tac', 'Tic', '22', '23', '24', '25', '26', '27', 'Tic', '29']`.\nالجواب:", "qhash": "e0c9458e7544fe3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'hn'}", "tests": ["assert char_freq('table') == {'h': 0, 'n': 0}", "assert char_freq('matrix falcon') == {'h': 0, 'n': 1}", "assert char_freq('winter') == {'h': 0, 'n': 1}", "assert char_freq('on code matrix') == {'h': 0, 'n': 1}", "assert char_freq('desert garden') == {'h': 0, 'n': 1}", "assert char_freq('python river rocket by') == {'h': 1, 'n': 1}", "assert char_freq('') == {'h': 0, 'n': 0}"], "test_code": "assert char_freq('table') == {'h': 0, 'n': 0}\nassert char_freq('matrix falcon') == {'h': 0, 'n': 1}\nassert char_freq('winter') == {'h': 0, 'n': 1}\nassert char_freq('on code matrix') == {'h': 0, 'n': 1}\nassert char_freq('desert garden') == {'h': 0, 'n': 1}\nassert char_freq('python river rocket by') == {'h': 1, 'n': 1}\nassert char_freq('') == {'h': 0, 'n': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'hn'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'hn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 'n' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('table')` يجب أن تُرجع `{'h': 0, 'n': 0}`.\nالجواب:", "qhash": "527ad2f2ea88fef2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'هشام': 39, 'وليد': 46, 'باسل': 38}\nscores['هشام'] += 16\nscores['منى'] = 57\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 = {'هشام': 39, 'وليد': 46, 'باسل': 38}\nscores['هشام'] += 16\nscores['منى'] = 57\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": "b6b4159270b9d6ac", "answer": "4\nمنى\n196\n[('باسل', 38), ('وليد', 46)]", "completion": " الناتج:\n```text\n4\nمنى\n196\n[('باسل', 38), ('وليد', 46)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_div(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 only_div([36, 9, 44, 30, 9, 66]) == 4", "assert only_div([-36, 17, 35, -38]) == 1", "assert only_div([36, 10, 0, 40, 44, -11]) == 1", "assert only_div([]) == 0", "assert only_div([4, 87, 24, 32, -32, 77, 57, -24, 58, -31]) == 4", "assert only_div([-38, 79, -19, 85, 40, -5, 90, -33, 12, 23]) == 2", "assert only_div([]) == 0"], "test_code": "assert only_div([36, 9, 44, 30, 9, 66]) == 4\nassert only_div([-36, 17, 35, -38]) == 1\nassert only_div([36, 10, 0, 40, 44, -11]) == 1\nassert only_div([]) == 0\nassert only_div([4, 87, 24, 32, -32, 77, 57, -24, 58, -31]) == 4\nassert only_div([-38, 79, -19, 85, 40, -5, 90, -33, 12, 23]) == 2\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `only_div([36, 9, 44, 30, 9, 66])` يجب أن تُرجع `4`.\nالجواب:", "qhash": "250ee6d588ee8eea"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('data of light pixel up') == 'czsz ne khfgs ohwdk to'", "assert caesar('up in apple we apple OK') == 'to hm zookd vd zookd OK'", "assert caesar('go garden banana at A1') == 'fn fzqcdm azmzmz zs A1'", "assert caesar('cloud python matrix') == 'bkntc oxsgnm lzsqhw'", "assert caesar('pixel coffee winter music cloud A1') == 'ohwdk bneedd vhmsdq ltrhb bkntc A1'", "assert caesar('by of signal music') == 'ax ne rhfmzk ltrhb'", "assert caesar('') == ''"], "test_code": "assert caesar('data of light pixel up') == 'czsz ne khfgs ohwdk to'\nassert caesar('up in apple we apple OK') == 'to hm zookd vd zookd OK'\nassert caesar('go garden banana at A1') == 'fn fzqcdm azmzmz zs A1'\nassert caesar('cloud python matrix') == 'bkntc oxsgnm lzsqhw'\nassert caesar('pixel coffee winter music cloud A1') == 'ohwdk bneedd vhmsdq ltrhb bkntc A1'\nassert caesar('by of signal music') == 'ax ne rhfmzk ltrhb'\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 + (25)) % 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 + (25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('data of light pixel up')` يُرجع `'czsz ne khfgs ohwdk to'`.\nالجواب:", "qhash": "82f950e0cc69a8f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "only_div", "reference": "def only_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 only_div([25, 50, 87, 34, 22, 85, 1, 63, 23, 56, 54, 38]) == 1", "assert only_div([-4, -23, -16, 51, -3, 11, 77, -36, 35, 29, 60, 82]) == 0", "assert only_div([-3, -39, 72, 84, -27, 25]) == 0", "assert only_div([55, -39, 4, -28, 78, 21]) == 1", "assert only_div([62, 18, 43, 38, 82, -4, 53, 88, 40]) == 1", "assert only_div([57, 86]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([25, 50, 87, 34, 22, 85, 1, 63, 23, 56, 54, 38]) == 1\nassert only_div([-4, -23, -16, 51, -3, 11, 77, -36, 35, 29, 60, 82]) == 0\nassert only_div([-3, -39, 72, 84, -27, 25]) == 0\nassert only_div([55, -39, 4, -28, 78, 21]) == 1\nassert only_div([62, 18, 43, 38, 82, -4, 53, 88, 40]) == 1\nassert only_div([57, 86]) == 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 % 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 % 6 == 0 and x % 4 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([25, 50, 87, 34, 22, 85, 1, 63, 23, 56, 54, 38])` يجب أن تُرجع `1`.\nالجواب:", "qhash": "dfae2e3cdebf4dcf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "tests": ["assert pow_total(7) == 252", "assert pow_total(4) == 90", "assert pow_total(13) == 819", "assert pow_total(6) == 189", "assert pow_total(1) == 9", "assert pow_total(1) == 9", "assert pow_total(0) == 0"], "test_code": "assert pow_total(7) == 252\nassert pow_total(4) == 90\nassert pow_total(13) == 819\nassert pow_total(6) == 189\nassert pow_total(1) == 9\nassert pow_total(1) == 9\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 1\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 9 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef pow_total(n):\n total = 0\n for i in range(0, n):\n total += 9 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `pow_total(7)` يُرجع `252`.\nالجواب:", "qhash": "aa6b35c71dce5414"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 0 + 6 for x in range(-6, 8) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 0 + 6 for x in range(-6, 8) if x % 5 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "65941e6676f1dc51", "answer": "[6, 6, 6]\n3 18", "completion": " الناتج:\n```text\n[6, 6, 6]\n3 18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 69:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([2, 5, 22, 18, 9, 6, 2, 29, 11]) == [2, 7, 29, 47, 56, 62, 64, 0, 11]", "assert acc_reset([-2, 22]) == [-2, 20]", "assert acc_reset([2]) == [2]", "assert acc_reset([49, 50, 52, 37, 46, 47, 46, -2, 68]) == [49, 0, 52, 0, 46, 0, 46, 44, 0]", "assert acc_reset([45, 49]) == [45, 0]", "assert acc_reset([26, 66, -3, -9, 12]) == [26, 0, -3, -12, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([2, 5, 22, 18, 9, 6, 2, 29, 11]) == [2, 7, 29, 47, 56, 62, 64, 0, 11]\nassert acc_reset([-2, 22]) == [-2, 20]\nassert acc_reset([2]) == [2]\nassert acc_reset([49, 50, 52, 37, 46, 47, 46, -2, 68]) == [49, 0, 52, 0, 46, 0, 46, 44, 0]\nassert acc_reset([45, 49]) == [45, 0]\nassert acc_reset([26, 66, -3, -9, 12]) == [26, 0, -3, -12, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 69:\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 > 69:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 69 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([2, 5, 22, 18, 9, 6, 2, 29, 11])` يُرجع `[2, 7, 29, 47, 56, 62, 64, 0, 11]`.\nالجواب:", "qhash": "5fbbf4cfd938f815"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ب')", "tests": ["assert count_ar('وردة جبل نور') == 1", "assert count_ar('') == 0", "assert count_ar('لغة خبز علم مدرسة قلم') == 1", "assert count_ar('بيت دفتر قهوة سوق لغة') == 1", "assert count_ar('خبز برتقال دفتر كتاب بيت سماء') == 4", "assert count_ar('صديق ليل سفينة') == 0", "assert count_ar('قمر بيت') == 1", "assert count_ar('') == 0"], "test_code": "assert count_ar('وردة جبل نور') == 1\nassert count_ar('') == 0\nassert count_ar('لغة خبز علم مدرسة قلم') == 1\nassert count_ar('بيت دفتر قهوة سوق لغة') == 1\nassert count_ar('خبز برتقال دفتر كتاب بيت سماء') == 4\nassert count_ar('صديق ليل سفينة') == 0\nassert count_ar('قمر بيت') == 1\nassert count_ar('') == 0", "answer": "def count_ar(text):\n return text.count('ب')", "completion": " ```python\ndef count_ar(text):\n return text.count('ب')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `count_ar(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ب» في النص.\nمثال: `count_ar('وردة جبل نور')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "a371b0c33999a956"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 9 == 0)", "tests": ["assert add_multiples(176) == 3510", "assert add_multiples(104) == 1242", "assert add_multiples(132) == 1827", "assert add_multiples(232) == 5967", "assert add_multiples(54) == 297", "assert add_multiples(184) == 3690", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(176) == 3510\nassert add_multiples(104) == 1242\nassert add_multiples(132) == 1827\nassert add_multiples(232) == 5967\nassert add_multiples(54) == 297\nassert add_multiples(184) == 3690\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 % 9 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `add_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 6 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `add_multiples(176)` يُرجع `3510`.\nالجواب:", "qhash": "f884800de47a3567"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('وليد', 35), ('عمر', 36), ('باسل', 46), ('سلمى', 0)]\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 = [('وليد', 35), ('عمر', 36), ('باسل', 46), ('سلمى', 0)]\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": "df0976e52c612aca", "answer": "[('سلمى', 0), ('وليد', 35), ('عمر', 36), ('باسل', 46)]\n['باسل', 'عمر']", "completion": " الناتج:\n```text\n[('سلمى', 0), ('وليد', 35), ('عمر', 36), ('باسل', 46)]\n['باسل', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 0:\n return 3\n return 1 * f(n - 1) + 0\n\nprint(f(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 0:\n return 3\n return 1 * f(n - 1) + 0\n\nprint(f(2))\n```\nالجواب:", "qhash": "54882aa5c947f2bc", "answer": "3", "completion": " الناتج:\n```text\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [38, 37, -5, -2, 13, 33, 26]\nprint(data[0:6])\nprint(data[::-1])\nprint(min(data[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [38, 37, -5, -2, 13, 33, 26]\nprint(data[0:6])\nprint(data[::-1])\nprint(min(data[0:6]))\n```\nالجواب:", "qhash": "30c64d7973c8fd22", "answer": "[38, 37, -5, -2, 13, 33]\n[26, 33, 13, -2, -5, 37, 38]\n-5", "completion": " الناتج:\n```text\n[38, 37, -5, -2, 13, 33]\n[26, 33, 13, -2, -5, 37, 38]\n-5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'علم تفاحة'\nprint(text[0])\nprint('ب' in text)\nprint(text.find('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'علم تفاحة'\nprint(text[0])\nprint('ب' in text)\nprint(text.find('ب'))\n```\nالجواب:", "qhash": "ee07e82cc5d6c1e4", "answer": "ع\nFalse\n-1", "completion": " الناتج:\n```text\nع\nFalse\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return -2 * x ** 2 + (-9) * x + (-1)", "tests": ["assert evaluate(10) == -291", "assert evaluate(-9) == -82", "assert evaluate(-20) == -621", "assert evaluate(14) == -519", "assert evaluate(-2) == 9", "assert evaluate(9) == -244", "assert evaluate(16) == -657", "assert evaluate(0) == -1"], "test_code": "assert evaluate(10) == -291\nassert evaluate(-9) == -82\nassert evaluate(-20) == -621\nassert evaluate(14) == -519\nassert evaluate(-2) == 9\nassert evaluate(9) == -244\nassert evaluate(16) == -657\nassert evaluate(0) == -1", "answer": "def evaluate(x):\n return -2 * x ** 2 + (-9) * x + (-1)", "completion": " ```python\ndef evaluate(x):\n return -2 * x ** 2 + (-9) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود -2x² - 9x - 1 عند العدد الصحيح x.\nمثال: `evaluate(10)` يجب أن تُرجع `-291`.\nالجواب:", "qhash": "f8ea3d2d1d69dd67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'pixel_orange'\nprint(name.index('g') + len(name))\nprint(name[3:8])\nprint(name.find('g'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'pixel_orange'\nprint(name.index('g') + len(name))\nprint(name[3:8])\nprint(name.find('g'))\n```\nالجواب:", "qhash": "27d9f9a8062c7134", "answer": "22\nel_or\n10", "completion": " الناتج:\n```text\n22\nel_or\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'ميناء دفتر'\nprint(w[::-1])\nprint(w.replace(' ', '-'))\nprint(w[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'ميناء دفتر'\nprint(w[::-1])\nprint(w.replace(' ', '-'))\nprint(w[-1])\n```\nالجواب:", "qhash": "abf80917b42f5997", "answer": "رتفد ءانيم\nميناء-دفتر\nر", "completion": " الناتج:\n```text\nرتفد ءانيم\nميناء-دفتر\nر\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(4))\n```\nالجواب:", "qhash": "a240d6138649d4c5", "answer": "8", "completion": " الناتج:\n```text\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'adl'}", "tests": ["assert tally('up vector rocket orange is banana') == {'a': 4, 'd': 0, 'l': 0}", "assert tally('of rocket falcon rocket up') == {'a': 1, 'd': 0, 'l': 1}", "assert tally('apple we summer') == {'a': 1, 'd': 0, 'l': 1}", "assert tally('on winter stone orange') == {'a': 1, 'd': 0, 'l': 0}", "assert tally('in engine') == {'a': 0, 'd': 0, 'l': 0}", "assert tally('banana') == {'a': 3, 'd': 0, 'l': 0}", "assert tally('') == {'a': 0, 'd': 0, 'l': 0}"], "test_code": "assert tally('up vector rocket orange is banana') == {'a': 4, 'd': 0, 'l': 0}\nassert tally('of rocket falcon rocket up') == {'a': 1, 'd': 0, 'l': 1}\nassert tally('apple we summer') == {'a': 1, 'd': 0, 'l': 1}\nassert tally('on winter stone orange') == {'a': 1, 'd': 0, 'l': 0}\nassert tally('in engine') == {'a': 0, 'd': 0, 'l': 0}\nassert tally('banana') == {'a': 3, 'd': 0, 'l': 0}\nassert tally('') == {'a': 0, 'd': 0, 'l': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'adl'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'adl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'd'، 'l' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('up vector rocket orange is banana')` يجب أن تُرجع `{'a': 4, 'd': 0, 'l': 0}`.\nالجواب:", "qhash": "ea101c33bf1938ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 3) // 5 for x in range(3, 9) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 3) // 5 for x in range(3, 9) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "9643b36a16dd47fe", "answer": "[1, 2]\n2 3", "completion": " الناتج:\n```text\n[1, 2]\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('خبز جبل يمل يمل') == 2", "assert count_initial('ماء يمل جمل يمل قلم بيت بحر') == 2", "assert count_initial('نهار يمل دفتر خبز') == 1", "assert count_initial('يمل لغة حديقة يمل مدرسة') == 2", "assert count_initial('برتقال رمل صديق شجرة جمل حاسوب') == 0", "assert count_initial('رمل ليل يمل يمل ليل قهوة') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('خبز جبل يمل يمل') == 2\nassert count_initial('ماء يمل جمل يمل قلم بيت بحر') == 2\nassert count_initial('نهار يمل دفتر خبز') == 1\nassert count_initial('يمل لغة حديقة يمل مدرسة') == 2\nassert count_initial('برتقال رمل صديق شجرة جمل حاسوب') == 0\nassert count_initial('رمل ليل يمل يمل ليل قهوة') == 2\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('خبز جبل يمل يمل')` يُرجع `2`.\nالجواب:", "qhash": "520288ce13ba4455"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('desert apple !') == 'hiwivx ettpi !'", "assert rot('music matrix code') == 'qywmg qexvmb gshi'", "assert rot('falcon window orange is') == 'jepgsr amrhsa sverki mw'", "assert rot('planet planet we') == 'tperix tperix ai'", "assert rot('window') == 'amrhsa'", "assert rot('engine') == 'irkmri'", "assert rot('') == ''"], "test_code": "assert rot('desert apple !') == 'hiwivx ettpi !'\nassert rot('music matrix code') == 'qywmg qexvmb gshi'\nassert rot('falcon window orange is') == 'jepgsr amrhsa sverki mw'\nassert rot('planet planet we') == 'tperix tperix ai'\nassert rot('window') == 'amrhsa'\nassert rot('engine') == 'irkmri'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('desert apple !')` يجب أن تُرجع `'hiwivx ettpi !'`.\nالجواب:", "qhash": "0debe209140a4590"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('vector brain') == 'lusjeh rhqyd'", "assert shift_letters('window on stone') == 'mydtem ed ijedu'", "assert shift_letters('signal A1') == 'iywdqb A1'", "assert shift_letters('at by a A1') == 'qj ro q A1'", "assert shift_letters('signal is') == 'iywdqb yi'", "assert shift_letters('to') == 'je'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('vector brain') == 'lusjeh rhqyd'\nassert shift_letters('window on stone') == 'mydtem ed ijedu'\nassert shift_letters('signal A1') == 'iywdqb A1'\nassert shift_letters('at by a A1') == 'qj ro q A1'\nassert shift_letters('signal is') == 'iywdqb yi'\nassert shift_letters('to') == 'je'\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 + (16)) % 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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('vector brain')` يجب أن تُرجع `'lusjeh rhqyd'`.\nالجواب:", "qhash": "c11be6303b5f7f91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(42) == 190", "assert mult_sum(140) == 1900", "assert mult_sum(298) == 8859", "assert mult_sum(228) == 5185", "assert mult_sum(260) == 6634", "assert mult_sum(27) == 57", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(42) == 190\nassert mult_sum(140) == 1900\nassert mult_sum(298) == 8859\nassert mult_sum(228) == 5185\nassert mult_sum(260) == 6634\nassert mult_sum(27) == 57\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 9 أو على 10.\nمثال: `mult_sum(42)` يجب أن تُرجع `190`.\nالجواب:", "qhash": "b1382defe2df8b39"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total", "tests": ["assert series(8) == 8772", "assert series(2) == 17", "assert series(0) == 0", "assert series(4) == 354", "assert series(15) == 178312", "assert series(1) == 1", "assert series(0) == 0"], "test_code": "assert series(8) == 8772\nassert series(2) == 17\nassert series(0) == 0\nassert series(4) == 354\nassert series(15) == 178312\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 ** 4\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 1 * i ** 4\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 1 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 1 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `series(8)` يُرجع `8772`.\nالجواب:", "qhash": "26965324852f5730"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(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_div([-15, 24, 16, 14, 39, -15, 34, 60, 59]) == 60", "assert max_div([-30, -6, -12]) == -6", "assert max_div([1]) == None", "assert max_div([25, -15, 19, -19]) == None", "assert max_div([21, -4, -6, 12, 37, 49, 8]) == 12", "assert max_div([]) == None"], "test_code": "assert max_div([-15, 24, 16, 14, 39, -15, 34, 60, 59]) == 60\nassert max_div([-30, -6, -12]) == -6\nassert max_div([1]) == None\nassert max_div([25, -15, 19, -19]) == None\nassert max_div([21, -4, -6, 12, 37, 49, 8]) == 12\nassert max_div([]) == None", "answer": "def max_div(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_div(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_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(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مثال: `max_div([-15, 24, 16, 14, 39, -15, 34, 60, 59])` يجب أن تُرجع `60`.\nالجواب:", "qhash": "5f03421728eeb916"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'طائرة طائرة'\nprint(kalima.find('ا'))\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'طائرة طائرة'\nprint(kalima.find('ا'))\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "20fc66192dae4329", "answer": "1\n['طائرة', 'طائرة']\nطائرة-طائرة", "completion": " الناتج:\n```text\n1\n['طائرة', 'طائرة']\nطائرة-طائرة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 45", "tests": ["assert sum_digit_pow(79733) == 5", "assert sum_digit_pow(634367) == 11", "assert sum_digit_pow(166117) == 1", "assert sum_digit_pow(553469) == 39", "assert sum_digit_pow(744422) == 6", "assert sum_digit_pow(265905) == 33", "assert sum_digit_pow(553800) == 27", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(79733) == 5\nassert sum_digit_pow(634367) == 11\nassert sum_digit_pow(166117) == 1\nassert sum_digit_pow(553469) == 39\nassert sum_digit_pow(744422) == 6\nassert sum_digit_pow(265905) == 33\nassert sum_digit_pow(553800) == 27\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 45", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 45\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `sum_digit_pow(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 45.\nللتوضيح: الاستدعاء `sum_digit_pow(79733)` يُرجع `5`.\nالجواب:", "qhash": "2a2b625f5a8f06fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'نور': 13, 'رنا': 19, 'زينب': 29, 'مريم': 45, 'أحمد': 20}\npoints['أحمد'] += 20\npoints['خالد'] = 53\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 = {'نور': 13, 'رنا': 19, 'زينب': 29, 'مريم': 45, 'أحمد': 20}\npoints['أحمد'] += 20\npoints['خالد'] = 53\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": "627197877682277a", "answer": "6\nخالد\n199\n[('نور', 13), ('رنا', 19)]", "completion": " الناتج:\n```text\n6\nخالد\n199\n[('نور', 13), ('رنا', 19)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 21) == 1)", "tests": ["assert phi_upto(48) == 28", "assert phi_upto(69) == 40", "assert phi_upto(7) == 4", "assert phi_upto(45) == 26", "assert phi_upto(42) == 24", "assert phi_upto(53) == 31", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(48) == 28\nassert phi_upto(69) == 40\nassert phi_upto(7) == 4\nassert phi_upto(45) == 26\nassert phi_upto(42) == 24\nassert phi_upto(53) == 31\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, 21) == 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, 21) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 21، أي أن القاسم المشترك الأكبر لها مع 21 يساوي 1.\nمثال: `phi_upto(48)` يجب أن تُرجع `28`.\nالجواب:", "qhash": "455fbf464ee4cd0a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 89", "tests": ["assert rec_prod(6) == 8", "assert rec_prod(34) == 46", "assert rec_prod(32) == 47", "assert rec_prod(37) == 65", "assert rec_prod(60) == 15", "assert rec_prod(18) == 86", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 8\nassert rec_prod(34) == 46\nassert rec_prod(32) == 47\nassert rec_prod(37) == 65\nassert rec_prod(60) == 15\nassert rec_prod(18) == 86\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 89", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(6)` يُرجع `8`.\nالجواب:", "qhash": "b8ac720f42f76639"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "tests": ["assert series(6) == 2646", "assert series(13) == 49686", "assert series(14) == 66150", "assert series(5) == 1350", "assert series(3) == 216", "assert series(1) == 6", "assert series(0) == 0"], "test_code": "assert series(6) == 2646\nassert series(13) == 49686\nassert series(14) == 66150\nassert series(5) == 1350\nassert series(3) == 216\nassert series(1) == 6\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 3\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 6 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `series(6)` يُرجع `2646`.\nالجواب:", "qhash": "8f415dce089e2e5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Red'\n if i % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13']", "assert fizzbuzz(24) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13', 'Blue', 'Red', '16', '17', 'Red', '19', '20', 'RedBlue', '22', '23', 'Red']", "assert fizzbuzz(1) == ['1']", "assert fizzbuzz(3) == ['1', '2', 'Red']", "assert fizzbuzz(20) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13', 'Blue', 'Red', '16', '17', 'Red', '19', '20']"], "test_code": "assert fizzbuzz(13) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13']\nassert fizzbuzz(24) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13', 'Blue', 'Red', '16', '17', 'Red', '19', '20', 'RedBlue', '22', '23', 'Red']\nassert fizzbuzz(1) == ['1']\nassert fizzbuzz(3) == ['1', '2', 'Red']\nassert fizzbuzz(20) == ['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13', 'Blue', 'Red', '16', '17', 'Red', '19', '20']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Red'\n if i % 7 == 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 % 3 == 0:\n s += 'Red'\n if i % 7 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Red'، وعلى 7 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(13)` يجب أن تُرجع `['1', '2', 'Red', '4', '5', 'Red', 'Blue', '8', 'Red', '10', '11', 'Red', '13']`.\nالجواب:", "qhash": "c86064e7148fc024"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'يوسف': 10, 'حسن': 36, 'راشد': 43, 'سعيد': 5, 'علي': 32}\nd['يوسف'] += 13\nd['عمر'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'يوسف': 10, 'حسن': 36, 'راشد': 43, 'سعيد': 5, 'علي': 32}\nd['يوسف'] += 13\nd['عمر'] = 18\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 25])\n```\nالجواب:", "qhash": "0716762aaaa12c46", "answer": "6\nراشد\n157\n['حسن', 'راشد', 'علي']", "completion": " الناتج:\n```text\n6\nراشد\n157\n['حسن', 'راشد', 'علي']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 49", "tests": ["assert sum_digit_pow(33440) == 35", "assert sum_digit_pow(929040) == 11", "assert sum_digit_pow(814697) == 3", "assert sum_digit_pow(175229) == 38", "assert sum_digit_pow(469124) == 4", "assert sum_digit_pow(258079) == 2", "assert sum_digit_pow(252213) == 30", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(33440) == 35\nassert sum_digit_pow(929040) == 11\nassert sum_digit_pow(814697) == 3\nassert sum_digit_pow(175229) == 38\nassert sum_digit_pow(469124) == 4\nassert sum_digit_pow(258079) == 2\nassert sum_digit_pow(252213) == 30\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 49", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 3 for d in str(n)) % 49\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 49.\nمثال: `sum_digit_pow(33440)` يجب أن تُرجع `35`.\nالجواب:", "qhash": "b19b5fe0af2e7168"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert spin([43, 24, 50, 48, 35, 43, 2]) == [50, 48, 35, 43, 2, 43, 24]", "assert spin([46, 35, 41, -5, 29, 14]) == [35, 41, -5, 29, 14, 46]", "assert spin([6, 13, 19]) == [13, 19, 6]", "assert spin([50, 23, 12, 34, 10, 28, 41, 35, 26, 7, 27, 31]) == [35, 26, 7, 27, 31, 50, 23, 12, 34, 10, 28, 41]", "assert spin([-3]) == [-3]", "assert spin([25, -4, 14, 3, 4, 26, 25, 11, 39, -9, 48]) == [25, 11, 39, -9, 48, 25, -4, 14, 3, 4, 26]", "assert spin([]) == []"], "test_code": "assert spin([43, 24, 50, 48, 35, 43, 2]) == [50, 48, 35, 43, 2, 43, 24]\nassert spin([46, 35, 41, -5, 29, 14]) == [35, 41, -5, 29, 14, 46]\nassert spin([6, 13, 19]) == [13, 19, 6]\nassert spin([50, 23, 12, 34, 10, 28, 41, 35, 26, 7, 27, 31]) == [35, 26, 7, 27, 31, 50, 23, 12, 34, 10, 28, 41]\nassert spin([-3]) == [-3]\nassert spin([25, -4, 14, 3, 4, 26, 25, 11, 39, -9, 48]) == [25, 11, 39, -9, 48, 25, -4, 14, 3, 4, 26]\nassert spin([]) == []", "answer": "def spin(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 spin(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 spin(xs):\n if not xs:\n return []\n k = 5 % len(xs)\n return ____\n```\nمثال: `spin([43, 24, 50, 48, 35, 43, 2])` يجب أن تُرجع `[50, 48, 35, 43, 2, 43, 24]`.\nالجواب:", "qhash": "f5ccc849a92ec638"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'de'}", "tests": ["assert letter_stats('falcon garden in') == {'d': 1, 'e': 1}", "assert letter_stats('light signal python garden') == {'d': 1, 'e': 1}", "assert letter_stats('banana apple an') == {'d': 0, 'e': 1}", "assert letter_stats('python vector') == {'d': 0, 'e': 1}", "assert letter_stats('apple python') == {'d': 0, 'e': 1}", "assert letter_stats('by of in go') == {'d': 0, 'e': 0}", "assert letter_stats('') == {'d': 0, 'e': 0}"], "test_code": "assert letter_stats('falcon garden in') == {'d': 1, 'e': 1}\nassert letter_stats('light signal python garden') == {'d': 1, 'e': 1}\nassert letter_stats('banana apple an') == {'d': 0, 'e': 1}\nassert letter_stats('python vector') == {'d': 0, 'e': 1}\nassert letter_stats('apple python') == {'d': 0, 'e': 1}\nassert letter_stats('by of in go') == {'d': 0, 'e': 0}\nassert letter_stats('') == {'d': 0, 'e': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'de'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'de'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'e' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('falcon garden in')` يجب أن تُرجع `{'d': 1, 'e': 1}`.\nالجواب:", "qhash": "b079a250e8d9ca4b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-3))\nprint(h(-3, 2))\nprint(h(h(2), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=1):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(-3))\nprint(h(-3, 2))\nprint(h(h(2), -3))\n```\nالجواب:", "qhash": "b857c3821c72a914", "answer": "4\n11\n94", "completion": " الناتج:\n```text\n4\n11\n94\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 56", "tests": ["assert digits_mod(44745) == 44", "assert digits_mod(644130) == 44", "assert digits_mod(636485) == 16", "assert digits_mod(276492) == 48", "assert digits_mod(929605) == 7", "assert digits_mod(563161) == 50", "assert digits_mod(650343) == 35", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(44745) == 44\nassert digits_mod(644130) == 44\nassert digits_mod(636485) == 16\nassert digits_mod(276492) == 48\nassert digits_mod(929605) == 7\nassert digits_mod(563161) == 50\nassert digits_mod(650343) == 35\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 56", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 56\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 56.\nمثال: `digits_mod(44745)` يجب أن تُرجع `44`.\nالجواب:", "qhash": "31247c082f2974ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -2 for x in xs if 12 <= x <= 24)", "tests": ["assert filter_range([4, 28, 18, 24, 33]) == [-48, -36]", "assert filter_range([]) == []", "assert filter_range([21, 9, 45, -2, 12, 29, 11, -11, 21]) == [-42, -42, -24]", "assert filter_range([-5, -8, 12, -9, 20, 60]) == [-40, -24]", "assert filter_range([-22, -13]) == []", "assert filter_range([]) == []", "assert filter_range([-27, 26]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([4, 28, 18, 24, 33]) == [-48, -36]\nassert filter_range([]) == []\nassert filter_range([21, 9, 45, -2, 12, 29, 11, -11, 21]) == [-42, -42, -24]\nassert filter_range([-5, -8, 12, -9, 20, 60]) == [-40, -24]\nassert filter_range([-22, -13]) == []\nassert filter_range([]) == []\nassert filter_range([-27, 26]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -2 for x in xs if 12 <= x <= 24)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -2 for x in xs if 12 <= x <= 24)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 12 ≤ x ≤ 24، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([4, 28, 18, 24, 33])` يُرجع `[-48, -36]`.\nالجواب:", "qhash": "9a47c76f78230648"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert spin([49, 1, 48, 12, 8, 50, 42]) == [8, 50, 42, 49, 1, 48, 12]", "assert spin([8, -8, 15, 44]) == [-8, 15, 44, 8]", "assert spin([50, 27, 4, 19, 18, 4, 49, 41, 12]) == [49, 41, 12, 50, 27, 4, 19, 18, 4]", "assert spin([45, -5, 44]) == [45, -5, 44]", "assert spin([25, 6, 44, 35, 11, 25, 6, 35, 27]) == [6, 35, 27, 25, 6, 44, 35, 11, 25]", "assert spin([19, 39, 42, 16, 17, -7, 2]) == [17, -7, 2, 19, 39, 42, 16]", "assert spin([]) == []"], "test_code": "assert spin([49, 1, 48, 12, 8, 50, 42]) == [8, 50, 42, 49, 1, 48, 12]\nassert spin([8, -8, 15, 44]) == [-8, 15, 44, 8]\nassert spin([50, 27, 4, 19, 18, 4, 49, 41, 12]) == [49, 41, 12, 50, 27, 4, 19, 18, 4]\nassert spin([45, -5, 44]) == [45, -5, 44]\nassert spin([25, 6, 44, 35, 11, 25, 6, 35, 27]) == [6, 35, 27, 25, 6, 44, 35, 11, 25]\nassert spin([19, 39, 42, 16, 17, -7, 2]) == [17, -7, 2, 19, 39, 42, 16]\nassert spin([]) == []", "answer": "def spin(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef spin(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[len(xs) - k:] + xs[:len(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([49, 1, 48, 12, 8, 50, 42])` يُرجع `[8, 50, 42, 49, 1, 48, 12]`.\nالجواب:", "qhash": "3c8b63183c75f982"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 37", "tests": ["assert rec_prod(3) == 6", "assert rec_prod(31) == 33", "assert rec_prod(16) == 29", "assert rec_prod(26) == 34", "assert rec_prod(24) == 21", "assert rec_prod(24) == 21", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 6\nassert rec_prod(31) == 33\nassert rec_prod(16) == 29\nassert rec_prod(26) == 34\nassert rec_prod(24) == 21\nassert rec_prod(24) == 21\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 37", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(3)` يُرجع `6`.\nالجواب:", "qhash": "4a01807a04f33e8b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert spin([46, 11, 38, 30, 22]) == [38, 30, 22, 46, 11]", "assert spin([44, 38, 19, 46, 50, 28, -2, 15]) == [15, 44, 38, 19, 46, 50, 28, -2]", "assert spin([10, 32, 22, 12, 24, 11, 33, 17, 13, 25, 7, 48]) == [17, 13, 25, 7, 48, 10, 32, 22, 12, 24, 11, 33]", "assert spin([31]) == [31]", "assert spin([32, 40, 40, 1]) == [1, 32, 40, 40]", "assert spin([-7]) == [-7]", "assert spin([]) == []"], "test_code": "assert spin([46, 11, 38, 30, 22]) == [38, 30, 22, 46, 11]\nassert spin([44, 38, 19, 46, 50, 28, -2, 15]) == [15, 44, 38, 19, 46, 50, 28, -2]\nassert spin([10, 32, 22, 12, 24, 11, 33, 17, 13, 25, 7, 48]) == [17, 13, 25, 7, 48, 10, 32, 22, 12, 24, 11, 33]\nassert spin([31]) == [31]\nassert spin([32, 40, 40, 1]) == [1, 32, 40, 40]\nassert spin([-7]) == [-7]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 7 % len(arr)\n return ____\n```\nمثال: `spin([46, 11, 38, 30, 22])` يجب أن تُرجع `[38, 30, 22, 46, 11]`.\nالجواب:", "qhash": "27762b39aac22c50"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(424415703))\nprint(go(go(424415703)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef go(n):\n if n < 10:\n return n\n return n % 10 + go(n // 10)\n\nprint(go(424415703))\nprint(go(go(424415703)))\n```\nالجواب:", "qhash": "f09cf0c084ac3431", "answer": "30\n3", "completion": " الناتج:\n```text\n30\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 94", "tests": ["assert dig_pow_mod(59347) == 54", "assert dig_pow_mod(892724) == 92", "assert dig_pow_mod(285760) == 68", "assert dig_pow_mod(500649) == 90", "assert dig_pow_mod(914565) == 58", "assert dig_pow_mod(987667) == 3", "assert dig_pow_mod(289371) == 90", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(59347) == 54\nassert dig_pow_mod(892724) == 92\nassert dig_pow_mod(285760) == 68\nassert dig_pow_mod(500649) == 90\nassert dig_pow_mod(914565) == 58\nassert dig_pow_mod(987667) == 3\nassert dig_pow_mod(289371) == 90\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 94", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 94\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 94.\nللتوضيح: الاستدعاء `dig_pow_mod(59347)` يُرجع `54`.\nالجواب:", "qhash": "a0734420bdbcee3e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "tests": ["assert power_sum(5) == 11748", "assert power_sum(7) == 56112", "assert power_sum(1) == 12", "assert power_sum(7) == 56112", "assert power_sum(8) == 105264", "assert power_sum(1) == 12", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 11748\nassert power_sum(7) == 56112\nassert power_sum(1) == 12\nassert power_sum(7) == 56112\nassert power_sum(8) == 105264\nassert power_sum(1) == 12\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 12 * i ** 4\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 12 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 12 * i ** 4\n return total\n```\nمثال: `power_sum(5)` يجب أن تُرجع `11748`.\nالجواب:", "qhash": "758be23751c9ba11"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([31, 33, 3, -3, 2, 0, -20, -15, 28]) == 0", "assert biggest_mult([-24, -40, -32]) == -24", "assert biggest_mult([1]) == None", "assert biggest_mult([-5, -2]) == None", "assert biggest_mult([1, -12, -15]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([31, 33, 3, -3, 2, 0, -20, -15, 28]) == 0\nassert biggest_mult([-24, -40, -32]) == -24\nassert biggest_mult([1]) == None\nassert biggest_mult([-5, -2]) == None\nassert biggest_mult([1, -12, -15]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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مثال: `biggest_mult([31, 33, 3, -3, 2, 0, -20, -15, 28])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "234e3aa75c691389"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 94:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([36, 44, 31, 41, 44]) == [36, 80, 0, 41, 85]", "assert cumulative([63, 79, 41, 63, 19, 84, 9, 60]) == [63, 0, 41, 0, 19, 0, 9, 69]", "assert cumulative([67]) == [67]", "assert cumulative([27, 81, 12]) == [27, 0, 12]", "assert cumulative([-2, 56, 21, -1, 2, 50, 46, 22, 53, 43]) == [-2, 54, 75, 74, 76, 0, 46, 68, 0, 43]", "assert cumulative([38]) == [38]", "assert cumulative([]) == []"], "test_code": "assert cumulative([36, 44, 31, 41, 44]) == [36, 80, 0, 41, 85]\nassert cumulative([63, 79, 41, 63, 19, 84, 9, 60]) == [63, 0, 41, 0, 19, 0, 9, 69]\nassert cumulative([67]) == [67]\nassert cumulative([27, 81, 12]) == [27, 0, 12]\nassert cumulative([-2, 56, 21, -1, 2, 50, 46, 22, 53, 43]) == [-2, 54, 75, 74, 76, 0, 46, 68, 0, 43]\nassert cumulative([38]) == [38]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 94:\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 > 94:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 94 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([36, 44, 31, 41, 44])` يُرجع `[36, 80, 0, 41, 85]`.\nالجواب:", "qhash": "f5ce9c858138e619"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "xs = [2, 26, 1, 21, 4, 16]\nprint(xs[1:6])\nprint(xs[::-2])\nprint(max(xs[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nxs = [2, 26, 1, 21, 4, 16]\nprint(xs[1:6])\nprint(xs[::-2])\nprint(max(xs[1:6]))\n```\nالجواب:", "qhash": "b81774f04cb40bb5", "answer": "[26, 1, 21, 4, 16]\n[16, 21, 26]\n26", "completion": " الناتج:\n```text\n[26, 1, 21, 4, 16]\n[16, 21, 26]\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(92338901))\nprint(rec(rec(92338901)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 10:\n return n\n return n % 10 + rec(n // 10)\n\nprint(rec(92338901))\nprint(rec(rec(92338901)))\n```\nالجواب:", "qhash": "39b0380cadfc31cf", "answer": "35\n8", "completion": " الناتج:\n```text\n35\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "tests": ["assert rec_prod(11) == 54", "assert rec_prod(34) == 57", "assert rec_prod(23) == 2", "assert rec_prod(38) == 44", "assert rec_prod(24) == 40", "assert rec_prod(15) == 14", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(11) == 54\nassert rec_prod(34) == 57\nassert rec_prod(23) == 2\nassert rec_prod(38) == 44\nassert rec_prod(24) == 40\nassert rec_prod(15) == 14\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 3)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(11)` يُرجع `54`.\nالجواب:", "qhash": "4f2c97c0b53f8960"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'أحمد': 37, 'منى': 14, 'راشد': 27, 'يوسف': 16, 'هدى': 27}\nscores['أحمد'] += 4\nscores['هشام'] = 12\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 = {'أحمد': 37, 'منى': 14, 'راشد': 27, 'يوسف': 16, 'هدى': 27}\nscores['أحمد'] += 4\nscores['هشام'] = 12\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": "7dec7e015cc77836", "answer": "6\nأحمد\n137\n[('هشام', 12), ('منى', 14)]", "completion": " الناتج:\n```text\n6\nأحمد\n137\n[('هشام', 12), ('منى', 14)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('up') == 'mh'", "assert rotate_letters('banana') == 'tsfsfs'", "assert rotate_letters('music vector apple') == 'emkau nwulgj shhdw'", "assert rotate_letters('brain coffee') == 'tjsaf ugxxww'", "assert rotate_letters('vector orange apple python') == 'nwulgj gjsfyw shhdw hqlzgf'", "assert rotate_letters('vector we') == 'nwulgj ow'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('up') == 'mh'\nassert rotate_letters('banana') == 'tsfsfs'\nassert rotate_letters('music vector apple') == 'emkau nwulgj shhdw'\nassert rotate_letters('brain coffee') == 'tjsaf ugxxww'\nassert rotate_letters('vector orange apple python') == 'nwulgj gjsfyw shhdw hqlzgf'\nassert rotate_letters('vector we') == 'nwulgj ow'\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 + (-8)) % 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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rotate_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rotate_letters('up')` يُرجع `'mh'`.\nالجواب:", "qhash": "dc7c2afe7d536980"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [(x + 7) // 4 for x in range(-4, 10) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [(x + 7) // 4 for x in range(-4, 10) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "c3d1489840153e73", "answer": "[1, 2, 3, 4]\n4 10", "completion": " الناتج:\n```text\n[1, 2, 3, 4]\n4 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=6):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(f(-7))\nprint(f(-7, -5))\nprint(f(f(-5), -7))", "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(-7))\nprint(f(-7, -5))\nprint(f(f(-5), -7))\n```\nالجواب:", "qhash": "67e6fb351f18dc6a", "answer": "17\n-27\n83", "completion": " الناتج:\n```text\n17\n-27\n83\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([-8, -9, 5, 28, -23, 18]) == 5", "assert largest_div([-10, -20, -25]) == -10", "assert largest_div([1, 6, 11, 16]) == None", "assert largest_div([21, -27, -30, 12, -31, -8, 21, 7, -2]) == -30", "assert largest_div([-16, -34, -27, 29, -37, 36, 10, -42, 48]) == 10", "assert largest_div([]) == None"], "test_code": "assert largest_div([-8, -9, 5, 28, -23, 18]) == 5\nassert largest_div([-10, -20, -25]) == -10\nassert largest_div([1, 6, 11, 16]) == None\nassert largest_div([21, -27, -30, 12, -31, -8, 21, 7, -2]) == -30\nassert largest_div([-16, -34, -27, 29, -37, 36, 10, -42, 48]) == 10\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 5 == 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 % 5 == 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 % 5 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(arr):\n best = 0\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `largest_div([-8, -9, 5, 28, -23, 18])` يجب أن تُرجع `5`.\nالجواب:", "qhash": "849868f19b579ce7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert shift_list([32, 19, 39, 48, 9]) == [32, 19, 39, 48, 9]", "assert shift_list([-4, 35, 25]) == [-4, 35, 25]", "assert shift_list([-3, -3, -2, 40, -4, 16]) == [40, -4, 16, -3, -3, -2]", "assert shift_list([47, 39, 22, 27, 14, 3, 27, 38, 17, 5, -5, 45]) == [5, -5, 45, 47, 39, 22, 27, 14, 3, 27, 38, 17]", "assert shift_list([40, 1, 30]) == [40, 1, 30]", "assert shift_list([-3, 5, -3, 22]) == [5, -3, 22, -3]", "assert shift_list([]) == []"], "test_code": "assert shift_list([32, 19, 39, 48, 9]) == [32, 19, 39, 48, 9]\nassert shift_list([-4, 35, 25]) == [-4, 35, 25]\nassert shift_list([-3, -3, -2, 40, -4, 16]) == [40, -4, 16, -3, -3, -2]\nassert shift_list([47, 39, 22, 27, 14, 3, 27, 38, 17, 5, -5, 45]) == [5, -5, 45, 47, 39, 22, 27, 14, 3, 27, 38, 17]\nassert shift_list([40, 1, 30]) == [40, 1, 30]\nassert shift_list([-3, 5, -3, 22]) == [5, -3, 22, -3]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 15 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([32, 19, 39, 48, 9])` يُرجع `[32, 19, 39, 48, 9]`.\nالجواب:", "qhash": "44b9c47b3d829305"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n, k):\n if k == 0:\n return 1\n return n * calc(n, k - 1)\n\nprint(calc(-4, 4))", "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(-4, 4))\n```\nالجواب:", "qhash": "b1dc9e78d8215dad", "answer": "256", "completion": " الناتج:\n```text\n256\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 26:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([18, 10, 16, 4, 15, 18, 8, 7, 7, 3]) == [18, 0, 16, 20, 0, 18, 26, 0, 7, 10]", "assert acc_reset([]) == []", "assert acc_reset([21, 18]) == [21, 0]", "assert acc_reset([-5, 15, -4]) == [-5, 10, 6]", "assert acc_reset([-9, 4, 26, 13, -4, -6, -1, 2]) == [-9, -5, 21, 0, -4, -10, -11, -9]", "assert acc_reset([14, -2, 26, -4, 25, 19, 4]) == [14, 12, 0, -4, 21, 0, 4]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([18, 10, 16, 4, 15, 18, 8, 7, 7, 3]) == [18, 0, 16, 20, 0, 18, 26, 0, 7, 10]\nassert acc_reset([]) == []\nassert acc_reset([21, 18]) == [21, 0]\nassert acc_reset([-5, 15, -4]) == [-5, 10, 6]\nassert acc_reset([-9, 4, 26, 13, -4, -6, -1, 2]) == [-9, -5, 21, 0, -4, -10, -11, -9]\nassert acc_reset([14, -2, 26, -4, 25, 19, 4]) == [14, 12, 0, -4, 21, 0, 4]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 26:\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 > 26:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `acc_reset(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 26 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `acc_reset([18, 10, 16, 4, 15, 18, 8, 7, 7, 3])` يُرجع `[18, 0, 16, 20, 0, 18, 26, 0, 7, 10]`.\nالجواب:", "qhash": "a7b3e17e195b0d9e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 88) == 1)", "tests": ["assert count_coprime(37) == 17", "assert count_coprime(157) == 72", "assert count_coprime(157) == 72", "assert count_coprime(56) == 25", "assert count_coprime(189) == 86", "assert count_coprime(45) == 21", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(37) == 17\nassert count_coprime(157) == 72\nassert count_coprime(157) == 72\nassert count_coprime(56) == 25\nassert count_coprime(189) == 86\nassert count_coprime(45) == 21\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, 88) == 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, 88) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 88) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(37)` يُرجع `17`.\nالجواب:", "qhash": "e068e8837e61798e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009", "tests": ["assert step_product(5) == 5", "assert step_product(28) == 818", "assert step_product(50) == 579", "assert step_product(25) == 559", "assert step_product(37) == 78", "assert step_product(59) == 20", "assert step_product(0) == 1"], "test_code": "assert step_product(5) == 5\nassert step_product(28) == 818\nassert step_product(50) == 579\nassert step_product(25) == 559\nassert step_product(37) == 78\nassert step_product(59) == 20\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 4)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `step_product(5)` يُرجع `5`.\nالجواب:", "qhash": "137bc07240d6a485"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 32) == 1)", "tests": ["assert coprime_count(39) == 20", "assert coprime_count(29) == 15", "assert coprime_count(41) == 21", "assert coprime_count(195) == 98", "assert coprime_count(129) == 65", "assert coprime_count(81) == 41", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(39) == 20\nassert coprime_count(29) == 15\nassert coprime_count(41) == 21\nassert coprime_count(195) == 98\nassert coprime_count(129) == 65\nassert coprime_count(81) == 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, 32) == 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, 32) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 32) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(39)` يُرجع `20`.\nالجواب:", "qhash": "9305669f84bfc7b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 40:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([18, 4, 6, 5, 3, 7, 20, 9, 23, 14]) == [18, 22, 28, 33, 36, 0, 20, 29, 0, 14]", "assert running_sum([17, -3, -1, -6, 13]) == [17, 14, 13, 7, 20]", "assert running_sum([31, 4, 20, 6]) == [31, 35, 0, 6]", "assert running_sum([-1, 0, 19, 7, -9, 21, 3, 32, 20, 16]) == [-1, -1, 18, 25, 16, 37, 40, 0, 20, 36]", "assert running_sum([-10, 16, 10, 20, 10, 18, 0]) == [-10, 6, 16, 36, 0, 18, 18]", "assert running_sum([11, 13, 29, 5, -4, -3, -8, 16, 38, 34]) == [11, 24, 0, 5, 1, -2, -10, 6, 0, 34]", "assert running_sum([]) == []"], "test_code": "assert running_sum([18, 4, 6, 5, 3, 7, 20, 9, 23, 14]) == [18, 22, 28, 33, 36, 0, 20, 29, 0, 14]\nassert running_sum([17, -3, -1, -6, 13]) == [17, 14, 13, 7, 20]\nassert running_sum([31, 4, 20, 6]) == [31, 35, 0, 6]\nassert running_sum([-1, 0, 19, 7, -9, 21, 3, 32, 20, 16]) == [-1, -1, 18, 25, 16, 37, 40, 0, 20, 36]\nassert running_sum([-10, 16, 10, 20, 10, 18, 0]) == [-10, 6, 16, 36, 0, 18, 18]\nassert running_sum([11, 13, 29, 5, -4, -3, -8, 16, 38, 34]) == [11, 24, 0, 5, 1, -2, -10, 6, 0, 34]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 40:\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 > 40:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 40 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([18, 4, 6, 5, 3, 7, 20, 9, 23, 14])` يُرجع `[18, 22, 28, 33, 36, 0, 20, 29, 0, 14]`.\nالجواب:", "qhash": "69977185ff618eee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n, k):\n if k == 0:\n return 1\n return n * f(n, k - 1)\n\nprint(f(-1, 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(-1, 5))\n```\nالجواب:", "qhash": "b2de664a5d9837e3", "answer": "-1", "completion": " الناتج:\n```text\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'ei'}", "tests": ["assert letter_stats('at desert by') == {'e': 2, 'i': 0}", "assert letter_stats('desert desert') == {'e': 4, 'i': 0}", "assert letter_stats('at in it river an') == {'e': 1, 'i': 3}", "assert letter_stats('code is by up go') == {'e': 1, 'i': 1}", "assert letter_stats('light engine of a on matrix') == {'e': 2, 'i': 3}", "assert letter_stats('banana') == {'e': 0, 'i': 0}", "assert letter_stats('') == {'e': 0, 'i': 0}"], "test_code": "assert letter_stats('at desert by') == {'e': 2, 'i': 0}\nassert letter_stats('desert desert') == {'e': 4, 'i': 0}\nassert letter_stats('at in it river an') == {'e': 1, 'i': 3}\nassert letter_stats('code is by up go') == {'e': 1, 'i': 1}\nassert letter_stats('light engine of a on matrix') == {'e': 2, 'i': 3}\nassert letter_stats('banana') == {'e': 0, 'i': 0}\nassert letter_stats('') == {'e': 0, 'i': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'ei'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'ei'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'i' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('at desert by')` يجب أن تُرجع `{'e': 2, 'i': 0}`.\nالجواب:", "qhash": "4b58105f670700d2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [-4, 38, 28, 25, 23, 10, -8, 3]\nprint(items[3:5])\nprint(items[::-1])\nprint(min(items[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [-4, 38, 28, 25, 23, 10, -8, 3]\nprint(items[3:5])\nprint(items[::-1])\nprint(min(items[3:5]))\n```\nالجواب:", "qhash": "358e679a9c9c0fc8", "answer": "[25, 23]\n[3, -8, 10, 23, 25, 28, 38, -4]\n23", "completion": " الناتج:\n```text\n[25, 23]\n[3, -8, 10, 23, 25, 28, 38, -4]\n23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)", "tests": ["assert sum_div(150) == 4193", "assert sum_div(97) == 1752", "assert sum_div(168) == 5292", "assert sum_div(220) == 9153", "assert sum_div(1) == 0", "assert sum_div(147) == 4046", "assert sum_div(1) == 0"], "test_code": "assert sum_div(150) == 4193\nassert sum_div(97) == 1752\nassert sum_div(168) == 5292\nassert sum_div(220) == 9153\nassert sum_div(1) == 0\nassert sum_div(147) == 4046\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 % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 14.\nمثال: `sum_div(150)` يجب أن تُرجع `4193`.\nالجواب:", "qhash": "92519509a5f1e625"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(19))\nprint(h(19, 6))\nprint(h(h(6), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=0):\n if x > y:\n return x * 6 - y\n return x + y * 6\n\nprint(h(19))\nprint(h(19, 6))\nprint(h(h(6), 19))\n```\nالجواب:", "qhash": "17651fcd3060ed19", "answer": "114\n108\n197", "completion": " الناتج:\n```text\n114\n108\n197\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Ping'\n if i % 9 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert play(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong']", "assert play(12) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping']", "assert play(11) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11']", "assert play(14) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping']", "assert play(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']"], "test_code": "assert play(18) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong']\nassert play(12) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping']\nassert play(11) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11']\nassert play(14) == ['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping']\nassert play(6) == ['1', 'Ping', '3', 'Ping', '5', 'Ping']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 % 2 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Ping'، وعلى 9 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(18)` يجب أن تُرجع `['1', 'Ping', '3', 'Ping', '5', 'Ping', '7', 'Ping', 'Pong', 'Ping', '11', 'Ping', '13', 'Ping', '15', 'Ping', '17', 'PingPong']`.\nالجواب:", "qhash": "fd1f6cf5b07a5105"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert best_multiple([52, 25, 22, -26, -17, 51]) == None", "assert best_multiple([-14, -7, -35]) == -7", "assert best_multiple([1, 8, 15, 22]) == None", "assert best_multiple([-32, 11, -37, -16, -30, 37]) == None", "assert best_multiple([-1, 28, 49, 23, -7, 44, 24]) == 49", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([52, 25, 22, -26, -17, 51]) == None\nassert best_multiple([-14, -7, -35]) == -7\nassert best_multiple([1, 8, 15, 22]) == None\nassert best_multiple([-32, 11, -37, -16, -30, 37]) == None\nassert best_multiple([-1, 28, 49, 23, -7, 44, 24]) == 49\nassert best_multiple([]) == None", "answer": "def best_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef best_multiple(nums):\n best = None\n for x in nums:\n if x % 7 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def best_multiple(nums):\n best = None\n for x in nums:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef best_multiple(nums):\n best = None\n for x in nums:\n if x % 7 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `best_multiple([52, 25, 22, -26, -17, 51])` يُرجع `None`.\nالجواب:", "qhash": "c1179cee0412d7b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 96", "tests": ["assert digits_mod(6279) == 74", "assert digits_mod(32209) == 2", "assert digits_mod(698149) == 87", "assert digits_mod(425152) == 75", "assert digits_mod(351814) == 20", "assert digits_mod(125397) == 73", "assert digits_mod(188327) == 95", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(6279) == 74\nassert digits_mod(32209) == 2\nassert digits_mod(698149) == 87\nassert digits_mod(425152) == 75\nassert digits_mod(351814) == 20\nassert digits_mod(125397) == 73\nassert digits_mod(188327) == 95\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 96", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 96\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 96.\nمثال: `digits_mod(6279)` يجب أن تُرجع `74`.\nالجواب:", "qhash": "ad6bdfd5d84b7bb4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([-2, -14, -27, 37, 25, -2, 35]) == -27", "assert biggest_mult([-6, -3, -12]) == -3", "assert biggest_mult([1]) == None", "assert biggest_mult([10, -33, -14, -7, 25, -1, 25, 10]) == -33", "assert biggest_mult([31, 10, -29, 33, -26]) == 33", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-2, -14, -27, 37, 25, -2, 35]) == -27\nassert biggest_mult([-6, -3, -12]) == -3\nassert biggest_mult([1]) == None\nassert biggest_mult([10, -33, -14, -7, 25, -1, 25, 10]) == -33\nassert biggest_mult([31, 10, -29, 33, -26]) == 33\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(nums):\n best = 0\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 biggest_mult(nums):\n best = 0\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مثال: `biggest_mult([-2, -14, -27, 37, 25, -2, 35])` يجب أن تُرجع `-27`.\nالجواب:", "qhash": "6b16aedad9f87811"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'خالد': 31, 'حسن': 16, 'فيصل': 33, 'مريم': 17}\nd['مريم'] += 18\nd['ليلى'] = 19\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('زينب', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'خالد': 31, 'حسن': 16, 'فيصل': 33, 'مريم': 17}\nd['مريم'] += 18\nd['ليلى'] = 19\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('زينب', -1))\n```\nالجواب:", "qhash": "4d3f32d942090081", "answer": "5\nمريم\n134\n-1", "completion": " الناتج:\n```text\n5\nمريم\n134\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('planet') == 'fbqduj'", "assert shift_letters('banana of we planet on') == 'rqdqdq ev mu fbqduj ed'", "assert shift_letters('winter') == 'mydjuh'", "assert shift_letters('river planet at data of OK') == 'hyluh fbqduj qj tqjq ev OK'", "assert shift_letters('up river A1') == 'kf hyluh A1'", "assert shift_letters('python matrix is in') == 'fojxed cqjhyn yi yd'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet') == 'fbqduj'\nassert shift_letters('banana of we planet on') == 'rqdqdq ev mu fbqduj ed'\nassert shift_letters('winter') == 'mydjuh'\nassert shift_letters('river planet at data of OK') == 'hyluh fbqduj qj tqjq ev OK'\nassert shift_letters('up river A1') == 'kf hyluh A1'\nassert shift_letters('python matrix is in') == 'fojxed cqjhyn yi yd'\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 + (16)) % 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 + (16)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 16 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('planet')` يجب أن تُرجع `'fbqduj'`.\nالجواب:", "qhash": "e2b2b4b1dabd2b42"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert series(7) == 224", "assert series(14) == 840", "assert series(5) == 120", "assert series(9) == 360", "assert series(11) == 528", "assert series(1) == 8", "assert series(0) == 0"], "test_code": "assert series(7) == 224\nassert series(14) == 840\nassert series(5) == 120\nassert series(9) == 360\nassert series(11) == 528\nassert series(1) == 8\nassert series(0) == 0", "answer": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 1\n return total\n```\nمثال: `series(7)` يجب أن تُرجع `224`.\nالجواب:", "qhash": "1fa8351b9d5275ae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 43", "tests": ["assert digits_mod(32133) == 32", "assert digits_mod(200334) == 38", "assert digits_mod(530055) == 41", "assert digits_mod(342920) == 28", "assert digits_mod(543179) == 9", "assert digits_mod(11218) == 28", "assert digits_mod(680969) == 40", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(32133) == 32\nassert digits_mod(200334) == 38\nassert digits_mod(530055) == 41\nassert digits_mod(342920) == 28\nassert digits_mod(543179) == 9\nassert digits_mod(11218) == 28\nassert digits_mod(680969) == 40\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 43", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 43.\nللتوضيح: الاستدعاء `digits_mod(32133)` يُرجع `32`.\nالجواب:", "qhash": "af2913a409a48ba8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'سماء'\nprint(s.count('ا'))\nprint(len(s.replace(' ', '')))\nprint('ا' in s)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'سماء'\nprint(s.count('ا'))\nprint(len(s.replace(' ', '')))\nprint('ا' in s)\n```\nالجواب:", "qhash": "6c217f89bf344ff8", "answer": "1\n4\nTrue", "completion": " الناتج:\n```text\n1\n4\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23", "tests": ["assert rec_prod(6) == 2", "assert rec_prod(38) == 12", "assert rec_prod(7) == 13", "assert rec_prod(0) == 1", "assert rec_prod(16) == 3", "assert rec_prod(52) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(6) == 2\nassert rec_prod(38) == 12\nassert rec_prod(7) == 13\nassert rec_prod(0) == 1\nassert rec_prod(16) == 3\nassert rec_prod(52) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 2)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `rec_prod(6)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "b3d128b1816bfe53"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "points = {'فيصل': 33, 'رنا': 17, 'زينب': 22}\npoints['زينب'] += 7\npoints['علي'] = 17\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\npoints = {'فيصل': 33, 'رنا': 17, 'زينب': 22}\npoints['زينب'] += 7\npoints['علي'] = 17\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 25])\n```\nالجواب:", "qhash": "81f47830a2f6b83f", "answer": "4\nفيصل\n96\n['فيصل', 'زينب']", "completion": " الناتج:\n```text\n4\nفيصل\n96\n['فيصل', 'زينب']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([9, 25, 38, 32, 23, 36]) == [32, 23, 36, 9, 25, 38]", "assert shift_list([-4, 31, 16, 7]) == [31, 16, 7, -4]", "assert shift_list([-3, 12, 34, 37, -1, 11, 25, 6]) == [12, 34, 37, -1, 11, 25, 6, -3]", "assert shift_list([30, 38, 43, 47, 11, 42, 40, 36]) == [38, 43, 47, 11, 42, 40, 36, 30]", "assert shift_list([38, 1, 8]) == [38, 1, 8]", "assert shift_list([28, 17, -4, -6, -1, 43, 48, 12, 23, 20, 31, 3]) == [20, 31, 3, 28, 17, -4, -6, -1, 43, 48, 12, 23]", "assert shift_list([]) == []"], "test_code": "assert shift_list([9, 25, 38, 32, 23, 36]) == [32, 23, 36, 9, 25, 38]\nassert shift_list([-4, 31, 16, 7]) == [31, 16, 7, -4]\nassert shift_list([-3, 12, 34, 37, -1, 11, 25, 6]) == [12, 34, 37, -1, 11, 25, 6, -3]\nassert shift_list([30, 38, 43, 47, 11, 42, 40, 36]) == [38, 43, 47, 11, 42, 40, 36, 30]\nassert shift_list([38, 1, 8]) == [38, 1, 8]\nassert shift_list([28, 17, -4, -6, -1, 43, 48, 12, 23, 20, 31, 3]) == [20, 31, 3, 28, 17, -4, -6, -1, 43, 48, 12, 23]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 9 % len(arr)\n return ____\n```\nمثال: `shift_list([9, 25, 38, 32, 23, 36])` يجب أن تُرجع `[32, 23, 36, 9, 25, 38]`.\nالجواب:", "qhash": "f4d03618cab4a0a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=4):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(-1))\nprint(g(-1, 4))\nprint(g(g(4), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=4):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(g(-1))\nprint(g(-1, 4))\nprint(g(g(4), -1))\n```\nالجواب:", "qhash": "6c7ff35614f6eb1c", "answer": "-21\n-21\n-11", "completion": " الناتج:\n```text\n-21\n-21\n-11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 10 for x in range(-3, 4) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 10 for x in range(-3, 4) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "fb991c1cc34fca21", "answer": "[-1, -10, -1]\n3 -12", "completion": " الناتج:\n```text\n[-1, -10, -1]\n3 -12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('معلم نهر بحر') == 1", "assert count_initial('ماء حصان مدرسة') == 0", "assert count_initial('نهار ماء نهار شجرة حديقة عربية وردة') == 2", "assert count_initial('كتاب باب ميناء عربية نهار نهار نهار') == 3", "assert count_initial('حاسوب ليل مدينة حديقة') == 0", "assert count_initial('نهر قمر نهر ميناء') == 2", "assert count_initial('') == 0"], "test_code": "assert count_initial('معلم نهر بحر') == 1\nassert count_initial('ماء حصان مدرسة') == 0\nassert count_initial('نهار ماء نهار شجرة حديقة عربية وردة') == 2\nassert count_initial('كتاب باب ميناء عربية نهار نهار نهار') == 3\nassert count_initial('حاسوب ليل مدينة حديقة') == 0\nassert count_initial('نهر قمر نهر ميناء') == 2\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('معلم نهر بحر')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "66a370bc14a42c4e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 2\nfor i in range(-2, 8, 3):\n s -= i * 9\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 2\nfor i in range(-2, 8, 3):\n s -= i * 9\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "242348b12707483d", "answer": "-88\n7", "completion": " الناتج:\n```text\n-88\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('سلام سوق رمل سلام رمل') == 2", "assert count_prefix('سلام رمل مدينة خبز طالب') == 1", "assert count_prefix('وردة رمل رمل سفينة رمل سلام طائرة') == 3", "assert count_prefix('قلم فجر تفاحة حديقة نهر رمل سوق') == 1", "assert count_prefix('قمر لغة رمل رمل حاسوب شجرة حاسوب') == 2", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('مدرسة قهوة عربية') == 0\nassert count_prefix('سلام سوق رمل سلام رمل') == 2\nassert count_prefix('سلام رمل مدينة خبز طالب') == 1\nassert count_prefix('وردة رمل رمل سفينة رمل سلام طائرة') == 3\nassert count_prefix('قلم فجر تفاحة حديقة نهر رمل سوق') == 1\nassert count_prefix('قمر لغة رمل رمل حاسوب شجرة حاسوب') == 2\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": "78f6cd9e9113e2b4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('summer a A1') == 'dfxxpc l A1'", "assert cipher('vector by !') == 'gpnezc mj !'", "assert cipher('orange to code') == 'zclyrp ez nzop'", "assert cipher('desert orange of') == 'opdpce zclyrp zq'", "assert cipher('a engine on winter coffee') == 'l pyrtyp zy htyepc nzqqpp'", "assert cipher('engine vector up 2024') == 'pyrtyp gpnezc fa 2024'", "assert cipher('') == ''"], "test_code": "assert cipher('summer a A1') == 'dfxxpc l A1'\nassert cipher('vector by !') == 'gpnezc mj !'\nassert cipher('orange to code') == 'zclyrp ez nzop'\nassert cipher('desert orange of') == 'opdpce zclyrp zq'\nassert cipher('a engine on winter coffee') == 'l pyrtyp zy htyepc nzqqpp'\nassert cipher('engine vector up 2024') == 'pyrtyp gpnezc fa 2024'\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 + (11)) % 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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('summer a A1')` يُرجع `'dfxxpc l A1'`.\nالجواب:", "qhash": "eb75838dc8dca0af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'سعيد': 15, 'هدى': 47, 'باسل': 48, 'نور': 11}\nscores['هدى'] += 18\nscores['مريم'] = 59\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('رنا', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'سعيد': 15, 'هدى': 47, 'باسل': 48, 'نور': 11}\nscores['هدى'] += 18\nscores['مريم'] = 59\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('رنا', -1))\n```\nالجواب:", "qhash": "fa60358ac65d0d60", "answer": "5\nهدى\n198\n-1", "completion": " الناتج:\n```text\n5\nهدى\n198\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'نور خبز'\nprint(text.replace(' ', '-'))\nprint(text[0])\nprint(text.count('خ'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'نور خبز'\nprint(text.replace(' ', '-'))\nprint(text[0])\nprint(text.count('خ'))\n```\nالجواب:", "qhash": "196ab64fc4a76297", "answer": "نور-خبز\nن\n1", "completion": " الناتج:\n```text\nنور-خبز\nن\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'gs'}", "tests": ["assert char_freq('we') == {'g': 0, 's': 0}", "assert char_freq('brain table pixel python music music') == {'g': 0, 's': 2}", "assert char_freq('by we we it') == {'g': 0, 's': 0}", "assert char_freq('in code winter') == {'g': 0, 's': 0}", "assert char_freq('vector we banana brain') == {'g': 0, 's': 0}", "assert char_freq('brain table to pixel engine') == {'g': 1, 's': 0}", "assert char_freq('') == {'g': 0, 's': 0}"], "test_code": "assert char_freq('we') == {'g': 0, 's': 0}\nassert char_freq('brain table pixel python music music') == {'g': 0, 's': 2}\nassert char_freq('by we we it') == {'g': 0, 's': 0}\nassert char_freq('in code winter') == {'g': 0, 's': 0}\nassert char_freq('vector we banana brain') == {'g': 0, 's': 0}\nassert char_freq('brain table to pixel engine') == {'g': 1, 's': 0}\nassert char_freq('') == {'g': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'gs'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'gs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'g'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('we')` يُرجع `{'g': 0, 's': 0}`.\nالجواب:", "qhash": "f700a36f6a65cbb3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'وليد': 46, 'فيصل': 18, 'زينب': 0, 'هدى': 48}\npoints['وليد'] += 16\npoints['رنا'] = 53\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 = {'وليد': 46, 'فيصل': 18, 'زينب': 0, 'هدى': 48}\npoints['وليد'] += 16\npoints['رنا'] = 53\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": "31a23da8005a1011", "answer": "5\nوليد\n181\n['وليد', 'هدى', 'رنا']", "completion": " الناتج:\n```text\n5\nوليد\n181\n['وليد', 'هدى', 'رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert tally_div([3, 36, 37, 33, 73, 2, 90, 73, 74, 59, 89, 86]) == 0", "assert tally_div([66, -18, 11]) == 0", "assert tally_div([-24, 48, 77, -8, 89, 13, -30, 43]) == 1", "assert tally_div([-8, -29, 56, -1, 75, 28]) == 2", "assert tally_div([18, 20, 24, -20, 16, 36, 29, 67]) == 0", "assert tally_div([71, -40, 30, 17]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([3, 36, 37, 33, 73, 2, 90, 73, 74, 59, 89, 86]) == 0\nassert tally_div([66, -18, 11]) == 0\nassert tally_div([-24, 48, 77, -8, 89, 13, -30, 43]) == 1\nassert tally_div([-8, -29, 56, -1, 75, 28]) == 2\nassert tally_div([18, 20, 24, -20, 16, 36, 29, 67]) == 0\nassert tally_div([71, -40, 30, 17]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count", "completion": " ```python\ndef tally_div(xs):\n count = 0\n for x in xs:\n if x % 7 == 0 and x % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([3, 36, 37, 33, 73, 2, 90, 73, 74, 59, 89, 86])` يُرجع `0`.\nالجواب:", "qhash": "1f7b4962416b4971"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('cloud A1') == 'jsvbk A1'", "assert shift_text('garden data go signal winter') == 'nhyklu khah nv zpnuhs dpualy'", "assert shift_text('garden engine stone vector') == 'nhyklu lunpul zavul cljavy'", "assert shift_text('coffee cloud orange') == 'jvmmll jsvbk vyhunl'", "assert shift_text('is rocket summer music') == 'pz yvjrla zbttly tbzpj'", "assert shift_text('falcon') == 'mhsjvu'", "assert shift_text('') == ''"], "test_code": "assert shift_text('cloud A1') == 'jsvbk A1'\nassert shift_text('garden data go signal winter') == 'nhyklu khah nv zpnuhs dpualy'\nassert shift_text('garden engine stone vector') == 'nhyklu lunpul zavul cljavy'\nassert shift_text('coffee cloud orange') == 'jvmmll jsvbk vyhunl'\nassert shift_text('is rocket summer music') == 'pz yvjrla zbttly tbzpj'\nassert shift_text('falcon') == 'mhsjvu'\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 + (-19)) % 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 + (-19)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('cloud A1')` يُرجع `'jsvbk A1'`.\nالجواب:", "qhash": "5981db69ab843b44"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 21) == 1)", "tests": ["assert phi_upto(141) == 80", "assert phi_upto(144) == 82", "assert phi_upto(23) == 14", "assert phi_upto(177) == 101", "assert phi_upto(118) == 68", "assert phi_upto(200) == 115", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(141) == 80\nassert phi_upto(144) == 82\nassert phi_upto(23) == 14\nassert phi_upto(177) == 101\nassert phi_upto(118) == 68\nassert phi_upto(200) == 115\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, 21) == 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, 21) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 21، أي أن القاسم المشترك الأكبر لها مع 21 يساوي 1.\nمثال: `phi_upto(141)` يجب أن تُرجع `80`.\nالجواب:", "qhash": "75c55393b6d8f6f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('مطر ماء مدينة مكتبة عمل لغة') == 1", "assert count_in_text('دفتر طالب') == 0", "assert count_in_text('عربية مدينة سماء قهوة') == 2", "assert count_in_text('بيت معلم طالب قمر معلم طالب بحر باب') == 1", "assert count_in_text('') == 0", "assert count_in_text('فجر دفتر سيارة سيارة سيارة ليل') == 4", "assert count_in_text('مدرسة وردة') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('مطر ماء مدينة مكتبة عمل لغة') == 1\nassert count_in_text('دفتر طالب') == 0\nassert count_in_text('عربية مدينة سماء قهوة') == 2\nassert count_in_text('بيت معلم طالب قمر معلم طالب بحر باب') == 1\nassert count_in_text('') == 0\nassert count_in_text('فجر دفتر سيارة سيارة سيارة ليل') == 4\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ي» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_in_text('مطر ماء مدينة مكتبة عمل لغة')` يُرجع `1`.\nالجواب:", "qhash": "f7a8690e6addddd6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']", "assert fizz(15) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15']", "assert fizz(0) == []", "assert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']", "assert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']"], "test_code": "assert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']\nassert fizz(15) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15']\nassert fizz(0) == []\nassert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']\nassert fizz(22) == ['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\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 % 4 == 0:\n s += 'Hi'\n if i % 11 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Hi'، وعلى 11 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(22)` يجب أن تُرجع `['1', '2', '3', 'Hi', '5', '6', '7', 'Hi', '9', '10', 'Yo', 'Hi', '13', '14', '15', 'Hi', '17', '18', '19', 'Hi', '21', 'Yo']`.\nالجواب:", "qhash": "cf84164c5aded20b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "a = [-9, 1, 32, 35, 30]\nprint(a[2:5])\nprint(a[::-2])\nprint(len(a[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\na = [-9, 1, 32, 35, 30]\nprint(a[2:5])\nprint(a[::-2])\nprint(len(a[2:5]))\n```\nالجواب:", "qhash": "0d37e6a79701ca90", "answer": "[32, 35, 30]\n[30, 32, -9]\n3", "completion": " الناتج:\n```text\n[32, 35, 30]\n[30, 32, -9]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "scores = {'خالد': 21, 'حسن': 17, 'مريم': 35}\nscores['خالد'] += 12\nscores['أحمد'] = 31\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 = {'خالد': 21, 'حسن': 17, 'مريم': 35}\nscores['خالد'] += 12\nscores['أحمد'] = 31\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": "ea94cbe42317032d", "answer": "4\nمريم\n116\n[('حسن', 17), ('أحمد', 31)]", "completion": " الناتج:\n```text\n4\nمريم\n116\n[('حسن', 17), ('أحمد', 31)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(219) == 4850", "assert sum_multiples(95) == 836", "assert sum_multiples(21) == 35", "assert sum_multiples(0) == 0", "assert sum_multiples(54) == 278", "assert sum_multiples(257) == 6996", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(219) == 4850\nassert sum_multiples(95) == 836\nassert sum_multiples(21) == 35\nassert sum_multiples(0) == 0\nassert sum_multiples(54) == 278\nassert sum_multiples(257) == 6996\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(219)` يُرجع `4850`.\nالجواب:", "qhash": "d13c95b724935360"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 9\nfor j in range(10, 27, 4):\n result -= j * 8\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 9\nfor j in range(10, 27, 4):\n result -= j * 8\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "caa3868781265ae4", "answer": "-711\n26", "completion": " الناتج:\n```text\n-711\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert spin([23, 19, 23, 19, 48, 28, 33, 41]) == [28, 33, 41, 23, 19, 23, 19, 48]", "assert spin([19, 46, 7, 5]) == [46, 7, 5, 19]", "assert spin([37, 41, 20, 18, 16, 47, 45, 22, 10]) == [10, 37, 41, 20, 18, 16, 47, 45, 22]", "assert spin([7, 2, -1, 42, 0, 3, 24, 43, 0]) == [0, 7, 2, -1, 42, 0, 3, 24, 43]", "assert spin([-6, 44, -8]) == [-8, -6, 44]", "assert spin([35, 23, 29, 40, 50, 39, 17, 2, 0, 13]) == [23, 29, 40, 50, 39, 17, 2, 0, 13, 35]", "assert spin([]) == []"], "test_code": "assert spin([23, 19, 23, 19, 48, 28, 33, 41]) == [28, 33, 41, 23, 19, 23, 19, 48]\nassert spin([19, 46, 7, 5]) == [46, 7, 5, 19]\nassert spin([37, 41, 20, 18, 16, 47, 45, 22, 10]) == [10, 37, 41, 20, 18, 16, 47, 45, 22]\nassert spin([7, 2, -1, 42, 0, 3, 24, 43, 0]) == [0, 7, 2, -1, 42, 0, 3, 24, 43]\nassert spin([-6, 44, -8]) == [-8, -6, 44]\nassert spin([35, 23, 29, 40, 50, 39, 17, 2, 0, 13]) == [23, 29, 40, 50, 39, 17, 2, 0, 13, 35]\nassert spin([]) == []", "answer": "def spin(lst):\n if not lst:\n return []\n k = 19 % 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 = 19 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 19 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(lst):\n if not lst:\n return []\n k = 19 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `spin([23, 19, 23, 19, 48, 28, 33, 41])` يُرجع `[28, 33, 41, 23, 19, 23, 19, 48]`.\nالجواب:", "qhash": "5d3e259544bb4f91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "tests": ["assert pow_total(3) == 2760", "assert pow_total(1) == 10", "assert pow_total(1) == 10", "assert pow_total(8) == 617760", "assert pow_total(4) == 13000", "assert pow_total(1) == 10", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 2760\nassert pow_total(1) == 10\nassert pow_total(1) == 10\nassert pow_total(8) == 617760\nassert pow_total(4) == 13000\nassert pow_total(1) == 10\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * 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 = 10 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 10 × 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 = 10 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `pow_total(3)` يُرجع `2760`.\nالجواب:", "qhash": "7b75078e8e238400"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert scaled_powers(7) == 3920", "assert scaled_powers(13) == 41405", "assert scaled_powers(7) == 3920", "assert scaled_powers(15) == 72000", "assert scaled_powers(0) == 0", "assert scaled_powers(1) == 5", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 3920\nassert scaled_powers(13) == 41405\nassert scaled_powers(7) == 3920\nassert scaled_powers(15) == 72000\nassert scaled_powers(0) == 0\nassert scaled_powers(1) == 5\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 5 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(7)` يُرجع `3920`.\nالجواب:", "qhash": "8dadb677274b5377"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 52817\nsteps = 0\nwhile n > 1:\n n = n // 9\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 52817\nsteps = 0\nwhile n > 1:\n n = n // 9\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "0734df85db03ac75", "answer": "0 5", "completion": " الناتج:\n```text\n0 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 168\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 = 168\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": "44bf175119bcf4e5", "answer": "10", "completion": " الناتج:\n```text\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('مدرسة نهر باب') == 1", "assert prefix_hits('بحر معلم خبز قلم') == 1", "assert prefix_hits('جمل برمجة مكتبة') == 1", "assert prefix_hits('جبل باب دفتر سلام كتاب طائرة') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('عربية بيت شمس سوق ميناء بحر بحر مدينة') == 3\nassert prefix_hits('سوق باب عربية قمر') == 1\nassert prefix_hits('مدرسة نهر باب') == 1\nassert prefix_hits('بحر معلم خبز قلم') == 1\nassert prefix_hits('جمل برمجة مكتبة') == 1\nassert prefix_hits('جبل باب دفتر سلام كتاب طائرة') == 1\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:\n if w.startswith('ب'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ب»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef prefix_hits(s):\n count = 0\n for w in s:\n if w.startswith('ب'):\n count += 1\n return count\n```\nمثال: `prefix_hits('عربية بيت شمس سوق ميناء بحر بحر مدينة')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "be561d09271bfbfb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(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 count_matching([87, 45, 83, 50, 14, 22, 31, 80, 86, 33, 12, 53]) == 3", "assert count_matching([59]) == 0", "assert count_matching([80, 88, -6, 64, 63, 29, 22, 56, 63, 58]) == 1", "assert count_matching([]) == 0", "assert count_matching([-19, 62, 39, -20, 12, 73, 11, 20, 80, -31]) == 2", "assert count_matching([59, 23, -36, 75, 26, 58, 7, 22, 13, -37, -10]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([87, 45, 83, 50, 14, 22, 31, 80, 86, 33, 12, 53]) == 3\nassert count_matching([59]) == 0\nassert count_matching([80, 88, -6, 64, 63, 29, 22, 56, 63, 58]) == 1\nassert count_matching([]) == 0\nassert count_matching([-19, 62, 39, -20, 12, 73, 11, 20, 80, -31]) == 2\nassert count_matching([59, 23, -36, 75, 26, 58, 7, 22, 13, -37, -10]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(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 count_matching(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 count_matching(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_matching([87, 45, 83, 50, 14, 22, 31, 80, 86, 33, 12, 53])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "4f10f6784cceb0f7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "rec_prod", "reference": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 73", "tests": ["assert rec_prod(4) == 24", "assert rec_prod(58) == 8", "assert rec_prod(50) == 43", "assert rec_prod(57) == 53", "assert rec_prod(38) == 2", "assert rec_prod(25) == 22", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(4) == 24\nassert rec_prod(58) == 8\nassert rec_prod(50) == 43\nassert rec_prod(57) == 53\nassert rec_prod(38) == 2\nassert rec_prod(25) == 22\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 73", "completion": " ```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return (n * rec_prod(n - 1)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef rec_prod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `rec_prod(4)` يُرجع `24`.\nالجواب:", "qhash": "37a1c18b18e8e7da"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert mult_sum(225) == 4703", "assert mult_sum(68) == 438", "assert mult_sum(63) == 374", "assert mult_sum(151) == 2073", "assert mult_sum(222) == 4479", "assert mult_sum(62) == 374", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(225) == 4703\nassert mult_sum(68) == 438\nassert mult_sum(63) == 374\nassert mult_sum(151) == 2073\nassert mult_sum(222) == 4479\nassert mult_sum(62) == 374\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 % 15 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 15.\nمثال: `mult_sum(225)` يجب أن تُرجع `4703`.\nالجواب:", "qhash": "1b2630f02f182737"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_prefix", "reference": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "tests": ["assert count_prefix('قلم برتقال معلم صحراء بيت دفتر معلم نهار') == 2", "assert count_prefix('ماء عمل باب جمل') == 1", "assert count_prefix('معلم سيارة باب طالب معلم جمل') == 1", "assert count_prefix('جمل حديقة مدينة دفتر باب') == 1", "assert count_prefix('بيت شمس بيت سلام') == 2", "assert count_prefix('وردة برمجة برتقال وردة دفتر ميناء برمجة') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('قلم برتقال معلم صحراء بيت دفتر معلم نهار') == 2\nassert count_prefix('ماء عمل باب جمل') == 1\nassert count_prefix('معلم سيارة باب طالب معلم جمل') == 1\nassert count_prefix('جمل حديقة مدينة دفتر باب') == 1\nassert count_prefix('بيت شمس بيت سلام') == 2\nassert count_prefix('وردة برمجة برتقال وردة دفتر ميناء برمجة') == 3\nassert count_prefix('') == 0", "answer": "def count_prefix(s):\n count = 0\n for w in s.split():\n if w.startswith('ب'):\n count += 1\n return count", "completion": " ```python\ndef count_prefix(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_prefix(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_prefix(s):\n count = 0\n for w in s.split():\n if w.endswith('ب'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_prefix('قلم برتقال معلم صحراء بيت دفتر معلم نهار')` يُرجع `2`.\nالجواب:", "qhash": "c7fc1a1bdb0ed706"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('قمر عمل علم قهوة سماء دفتر') == 2", "assert count_start('مدرسة حصان سيارة مدينة حديقة نور') == 0", "assert count_start('قمر حصان صديق طالب سفينة فجر') == 1", "assert count_start('ميناء ميناء باب قمر قهوة') == 2", "assert count_start('مكتبة قلم قمر صديق بيت') == 2", "assert count_start('بحر قهوة قهوة بحر') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('قمر عمل علم قهوة سماء دفتر') == 2\nassert count_start('مدرسة حصان سيارة مدينة حديقة نور') == 0\nassert count_start('قمر حصان صديق طالب سفينة فجر') == 1\nassert count_start('ميناء ميناء باب قمر قهوة') == 2\nassert count_start('مكتبة قلم قمر صديق بيت') == 2\nassert count_start('بحر قهوة قهوة بحر') == 2\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.split():\n if w.endswith('ق'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ق». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef count_start(sentence):\n count = 0\n for w in sentence.split():\n if w.endswith('ق'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('قمر عمل علم قهوة سماء دفتر')` يُرجع `2`.\nالجواب:", "qhash": "8ab37b30587112c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 84) == 1)", "tests": ["assert phi_upto(73) == 22", "assert phi_upto(47) == 14", "assert phi_upto(146) == 42", "assert phi_upto(187) == 54", "assert phi_upto(138) == 39", "assert phi_upto(21) == 6", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(73) == 22\nassert phi_upto(47) == 14\nassert phi_upto(146) == 42\nassert phi_upto(187) == 54\nassert phi_upto(138) == 39\nassert phi_upto(21) == 6\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, 84) == 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, 84) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 84) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(73)` يُرجع `22`.\nالجواب:", "qhash": "a11d3eec60601475"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'brain'\nprint(name.upper())\nprint(name.split('_'))\nprint(name.index('n') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'brain'\nprint(name.upper())\nprint(name.split('_'))\nprint(name.index('n') + len(name))\n```\nالجواب:", "qhash": "826d308fdc1f2b68", "answer": "BRAIN\n['brain']\n9", "completion": " الناتج:\n```text\nBRAIN\n['brain']\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['stone', 'matrix', 'light', 'coffee', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['stone', 'matrix', 'light', 'coffee', 'planet']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "218ec411f58ed7ec", "answer": "['stone', 'light', 'matrix', 'coffee', 'planet']\n['planet', 'matrix', 'coffee']", "completion": " الناتج:\n```text\n['stone', 'light', 'matrix', 'coffee', 'planet']\n['planet', 'matrix', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['light', 'window', 'river', 'orange', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['light', 'window', 'river', 'orange', 'coffee']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "caaf023aeee7cb60", "answer": "['light', 'river', 'window', 'orange', 'coffee']\n['window', 'orange', 'coffee']", "completion": " الناتج:\n```text\n['light', 'river', 'window', 'orange', 'coffee']\n['window', 'orange', 'coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 33) == 1)", "tests": ["assert count_gcd1(34) == 21", "assert count_gcd1(186) == 113", "assert count_gcd1(185) == 113", "assert count_gcd1(127) == 77", "assert count_gcd1(183) == 111", "assert count_gcd1(74) == 46", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(34) == 21\nassert count_gcd1(186) == 113\nassert count_gcd1(185) == 113\nassert count_gcd1(127) == 77\nassert count_gcd1(183) == 111\nassert count_gcd1(74) == 46\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 33، أي أن القاسم المشترك الأكبر لها مع 33 يساوي 1.\nمثال: `count_gcd1(34)` يجب أن تُرجع `21`.\nالجواب:", "qhash": "b46b010b8bb6d5a4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 7 for x in range(-5, 8) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 7 for x in range(-5, 8) if x % 4 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "0286667675a34b08", "answer": "[9, -7, 9]\n3 11", "completion": " الناتج:\n```text\n[9, -7, 9]\n3 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "tests": ["assert power_sum(5) == 13275", "assert power_sum(9) == 362475", "assert power_sum(11) == 1145628", "assert power_sum(0) == 0", "assert power_sum(13) == 3006003", "assert power_sum(1) == 3", "assert power_sum(0) == 0"], "test_code": "assert power_sum(5) == 13275\nassert power_sum(9) == 362475\nassert power_sum(11) == 1145628\nassert power_sum(0) == 0\nassert power_sum(13) == 3006003\nassert power_sum(1) == 3\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 5\n return total\n```\n", "buggy": "def power_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 3 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef power_sum(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 5\n return total\n```\nمثال: `power_sum(5)` يجب أن تُرجع `13275`.\nالجواب:", "qhash": "6e304b698305eb72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 11", "tests": ["assert mfact(11) == 0", "assert mfact(16) == 4", "assert mfact(56) == 0", "assert mfact(46) == 0", "assert mfact(43) == 0", "assert mfact(52) == 0", "assert mfact(0) == 1"], "test_code": "assert mfact(11) == 0\nassert mfact(16) == 4\nassert mfact(56) == 0\nassert mfact(46) == 0\nassert mfact(43) == 0\nassert mfact(52) == 0\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 11", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(11)` يُرجع `0`.\nالجواب:", "qhash": "4b57c21b732062ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 5\nfor i in range(4, 12, 1):\n s += i * 3\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 5\nfor i in range(4, 12, 1):\n s += i * 3\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "6e10c45f8e601b26", "answer": "185\n11", "completion": " الناتج:\n```text\n185\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "pairs = [('سعيد', 58), ('سلمى', 14), ('مريم', 47), ('راشد', 41)]\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 = [('سعيد', 58), ('سلمى', 14), ('مريم', 47), ('راشد', 41)]\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": "513f831c820d41e7", "answer": "[('سلمى', 14), ('راشد', 41), ('مريم', 47), ('سعيد', 58)]\n['سعيد', 'مريم']", "completion": " الناتج:\n```text\n[('سلمى', 14), ('راشد', 41), ('مريم', 47), ('سعيد', 58)]\n['سعيد', 'مريم']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['vector', 'banana', 'camel', 'orange', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['vector', 'banana', 'camel', 'orange', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "faa1d306b2e85933", "answer": "['camel', 'vector', 'banana', 'orange', 'engine']\n['vector', 'orange', 'engine']", "completion": " الناتج:\n```text\n['camel', 'vector', 'banana', 'orange', 'engine']\n['vector', 'orange', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 2 * x ** 2 + (-4) * x + (-5)", "tests": ["assert evaluate(6) == 43", "assert evaluate(-7) == 121", "assert evaluate(-18) == 715", "assert evaluate(-12) == 331", "assert evaluate(-3) == 25", "assert evaluate(-9) == 193", "assert evaluate(19) == 641", "assert evaluate(0) == -5"], "test_code": "assert evaluate(6) == 43\nassert evaluate(-7) == 121\nassert evaluate(-18) == 715\nassert evaluate(-12) == 331\nassert evaluate(-3) == 25\nassert evaluate(-9) == 193\nassert evaluate(19) == 641\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n return 2 * x ** 2 + (-4) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n return 2 * x ** 2 + (-4) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 2x² - 4x - 5 عند العدد الصحيح x.\nمثال: `evaluate(6)` يجب أن تُرجع `43`.\nالجواب:", "qhash": "48992786c07b2dd0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'فيصل': 10, 'عمر': 8, 'منى': 37, 'زينب': 24}\nmarks['عمر'] += 8\nmarks['سلمى'] = 18\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'فيصل': 10, 'عمر': 8, 'منى': 37, 'زينب': 24}\nmarks['عمر'] += 8\nmarks['سلمى'] = 18\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('ليلى', -1))\n```\nالجواب:", "qhash": "9943d6ac72f30556", "answer": "5\nمنى\n105\n-1", "completion": " الناتج:\n```text\n5\nمنى\n105\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('to') == 'gb'", "assert cipher('a') == 'n'", "assert cipher('garden river planet A1') == 'tneqra evire cynarg A1'", "assert cipher('is table at brain engine Hello') == 'vf gnoyr ng oenva ratvar Hryyb'", "assert cipher('go matrix light') == 'tb zngevk yvtug'", "assert cipher('vector banana falcon desert to') == 'irpgbe onanan snypba qrfreg gb'", "assert cipher('') == ''"], "test_code": "assert cipher('to') == 'gb'\nassert cipher('a') == 'n'\nassert cipher('garden river planet A1') == 'tneqra evire cynarg A1'\nassert cipher('is table at brain engine Hello') == 'vf gnoyr ng oenva ratvar Hryyb'\nassert cipher('go matrix light') == 'tb zngevk yvtug'\nassert cipher('vector banana falcon desert to') == 'irpgbe onanan snypba qrfreg gb'\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 + (13)) % 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 + (13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('to')` يُرجع `'gb'`.\nالجواب:", "qhash": "f0324057715b6e45"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 70) == 1)", "tests": ["assert coprime_count(23) == 8", "assert coprime_count(191) == 66", "assert coprime_count(116) == 40", "assert coprime_count(88) == 30", "assert coprime_count(38) == 13", "assert coprime_count(131) == 46", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(23) == 8\nassert coprime_count(191) == 66\nassert coprime_count(116) == 40\nassert coprime_count(88) == 30\nassert coprime_count(38) == 13\nassert coprime_count(131) == 46\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, 70) == 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, 70) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 70) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(23)` يُرجع `8`.\nالجواب:", "qhash": "869d3b022ef7512b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(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_of_div([-25, 31, 48, 42, -24]) == 42", "assert max_of_div([-35, -7, -7]) == -7", "assert max_of_div([1, 8, 15, 22]) == None", "assert max_of_div([22, -27, 11]) == None", "assert max_of_div([-6, 36, 14, 30, -50, -12, 4]) == 14", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-25, 31, 48, 42, -24]) == 42\nassert max_of_div([-35, -7, -7]) == -7\nassert max_of_div([1, 8, 15, 22]) == None\nassert max_of_div([22, -27, 11]) == None\nassert max_of_div([-6, 36, 14, 30, -50, -12, 4]) == 14\nassert max_of_div([]) == None", "answer": "def max_of_div(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_of_div(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_of_div(values):\n best = 0\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_of_div(values):\n best = 0\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_of_div([-25, 31, 48, 42, -24])` يُرجع `42`.\nالجواب:", "qhash": "52946b5e082fd11a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert rotate([6, 28, 2, 37, 4, 10, 3, 24]) == [28, 2, 37, 4, 10, 3, 24, 6]", "assert rotate([7, 30, 47, 11, 17, 8, 31, 41]) == [30, 47, 11, 17, 8, 31, 41, 7]", "assert rotate([28, 45, 26, 5, 16, 28, -6, 19]) == [45, 26, 5, 16, 28, -6, 19, 28]", "assert rotate([35, 50, -8]) == [35, 50, -8]", "assert rotate([14, -8, 23, -1, -9, 33, 22, 38]) == [-8, 23, -1, -9, 33, 22, 38, 14]", "assert rotate([8, 32, -5, 31, 44, 49]) == [31, 44, 49, 8, 32, -5]", "assert rotate([]) == []"], "test_code": "assert rotate([6, 28, 2, 37, 4, 10, 3, 24]) == [28, 2, 37, 4, 10, 3, 24, 6]\nassert rotate([7, 30, 47, 11, 17, 8, 31, 41]) == [30, 47, 11, 17, 8, 31, 41, 7]\nassert rotate([28, 45, 26, 5, 16, 28, -6, 19]) == [45, 26, 5, 16, 28, -6, 19, 28]\nassert rotate([35, 50, -8]) == [35, 50, -8]\nassert rotate([14, -8, 23, -1, -9, 33, 22, 38]) == [-8, 23, -1, -9, 33, 22, 38, 14]\nassert rotate([8, 32, -5, 31, 44, 49]) == [31, 44, 49, 8, 32, -5]\nassert rotate([]) == []", "answer": "def rotate(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef rotate(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 15 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(xs):\n if not xs:\n return []\n k = 15 % len(xs)\n return ____\n```\nمثال: `rotate([6, 28, 2, 37, 4, 10, 3, 24])` يجب أن تُرجع `[28, 2, 37, 4, 10, 3, 24, 6]`.\nالجواب:", "qhash": "917621bcb9f587e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([15, 59, 26, 25]) == 25", "assert max_div([-5, -5, -15]) == -5", "assert max_div([1]) == None", "assert max_div([]) == None", "assert max_div([-4, -45, 21, 40, -30, -50]) == 40", "assert max_div([]) == None"], "test_code": "assert max_div([15, 59, 26, 25]) == 25\nassert max_div([-5, -5, -15]) == -5\nassert max_div([1]) == None\nassert max_div([]) == None\nassert max_div([-4, -45, 21, 40, -30, -50]) == 40\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = None\n for x in arr:\n if x % 5 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 5 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_div([15, 59, 26, 25])` يجب أن تُرجع `25`.\nالجواب:", "qhash": "e4834b60906915ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([56, 28, 16, 81, 81, 49, 28, 31]) == 2", "assert div_not([-3, 89, 49, -16, -18, 28, 34]) == 1", "assert div_not([67, -26, -4, 89]) == 0", "assert div_not([-10, 21, 12, -26, 10, 40, 26, 41, -21, -32, 8]) == 0", "assert div_not([72, -33, 82, 39, 58, -6]) == 0", "assert div_not([]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([56, 28, 16, 81, 81, 49, 28, 31]) == 2\nassert div_not([-3, 89, 49, -16, -18, 28, 34]) == 1\nassert div_not([67, -26, -4, 89]) == 0\nassert div_not([-10, 21, 12, -26, 10, 40, 26, 41, -21, -32, 8]) == 0\nassert div_not([72, -33, 82, 39, 58, -6]) == 0\nassert div_not([]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([56, 28, 16, 81, 81, 49, 28, 31])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "b227a0d9db880fcc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -5 for x in xs if 9 <= x <= 33)", "tests": ["assert pick_between([24, 34, 3, 10, 34, 3]) == [-120, -50]", "assert pick_between([48, 41, -27, 23]) == [-115]", "assert pick_between([23, 8, -19, 8, -2]) == [-115]", "assert pick_between([-26, 13, -23]) == [-65]", "assert pick_between([58, 16, 44, -25, 50]) == [-80]", "assert pick_between([38, 32, 52, -20, 39, 24, -17]) == [-160, -120]", "assert pick_between([50]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([24, 34, 3, 10, 34, 3]) == [-120, -50]\nassert pick_between([48, 41, -27, 23]) == [-115]\nassert pick_between([23, 8, -19, 8, -2]) == [-115]\nassert pick_between([-26, 13, -23]) == [-65]\nassert pick_between([58, 16, 44, -25, 50]) == [-80]\nassert pick_between([38, 32, 52, -20, 39, 24, -17]) == [-160, -120]\nassert pick_between([50]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -5 for x in xs if 9 <= x <= 33)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -5 for x in xs if 9 <= x <= 33)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pick_between(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 9 و33 (شاملًا الطرفين) في -5.\nمثال: `pick_between([24, 34, 3, 10, 34, 3])` يجب أن تُرجع `[-120, -50]`.\nالجواب:", "qhash": "c475fc14358aaca1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 9\nfor n in range(-1, 11, 4):\n acc -= n * 1\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 9\nfor n in range(-1, 11, 4):\n acc -= n * 1\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "1de90911b1312574", "answer": "0\n7", "completion": " الناتج:\n```text\n0\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 0 + 6 for x in range(-4, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 0 + 6 for x in range(-4, 9) if x % 3 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "98f514c78b149980", "answer": "[6, 6, 6, 6]\n4 24", "completion": " الناتج:\n```text\n[6, 6, 6, 6]\n4 24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizz", "reference": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(17) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9', '10', '11', 'RedBlue', '13', '14', '15', 'Red', '17']", "assert fizz(9) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9']", "assert fizz(2) == ['1', '2']", "assert fizz(0) == []", "assert fizz(22) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9', '10', '11', 'RedBlue', '13', '14', '15', 'Red', '17', 'Blue', '19', 'Red', '21', '22']"], "test_code": "assert fizz(17) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9', '10', '11', 'RedBlue', '13', '14', '15', 'Red', '17']\nassert fizz(9) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9']\nassert fizz(2) == ['1', '2']\nassert fizz(0) == []\nassert fizz(22) == ['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9', '10', '11', 'RedBlue', '13', '14', '15', 'Red', '17', 'Blue', '19', 'Red', '21', '22']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 0:\n s += 'Red'\n if i % 6 == 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 % 4 == 0:\n s += 'Red'\n if i % 6 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Red'، وإن قَبِلها على 6 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(17)` يُرجع `['1', '2', '3', 'Red', '5', 'Blue', '7', 'Red', '9', '10', '11', 'RedBlue', '13', '14', '15', 'Red', '17']`.\nالجواب:", "qhash": "4bc1fd6f19cd70c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(43) == 180", "assert mult_sum(211) == 4515", "assert mult_sum(14) == 15", "assert mult_sum(238) == 5640", "assert mult_sum(238) == 5640", "assert mult_sum(159) == 2480", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(43) == 180\nassert mult_sum(211) == 4515\nassert mult_sum(14) == 15\nassert mult_sum(238) == 5640\nassert mult_sum(238) == 5640\nassert mult_sum(159) == 2480\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 % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(43)` يُرجع `180`.\nالجواب:", "qhash": "ecea02c3cc7a69ca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -6 * x ** 2 + (-8) * x + (7)", "tests": ["assert value_at(10) == -673", "assert value_at(4) == -121", "assert value_at(13) == -1111", "assert value_at(12) == -953", "assert value_at(-8) == -313", "assert value_at(-7) == -231", "assert value_at(16) == -1657", "assert value_at(0) == 7"], "test_code": "assert value_at(10) == -673\nassert value_at(4) == -121\nassert value_at(13) == -1111\nassert value_at(12) == -953\nassert value_at(-8) == -313\nassert value_at(-7) == -231\nassert value_at(16) == -1657\nassert value_at(0) == 7", "answer": "def value_at(x):\n return -6 * x ** 2 + (-8) * x + (7)", "completion": " ```python\ndef value_at(x):\n return -6 * x ** 2 + (-8) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -6x² - 8x + 7 عند العدد الصحيح x.\nمثال: `value_at(10)` يجب أن تُرجع `-673`.\nالجواب:", "qhash": "b2dd871ba22d4be5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert sum_div(112) == 1092", "assert sum_div(228) == 4925", "assert sum_div(281) == 7731", "assert sum_div(207) == 4056", "assert sum_div(86) == 713", "assert sum_div(66) == 483", "assert sum_div(1) == 0"], "test_code": "assert sum_div(112) == 1092\nassert sum_div(228) == 4925\nassert sum_div(281) == 7731\nassert sum_div(207) == 4056\nassert sum_div(86) == 713\nassert sum_div(66) == 483\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(112)` يُرجع `1092`.\nالجواب:", "qhash": "1024af1594009c0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'بيت مدينة'\nprint(s.count('ة'))\nprint('ة' in s)\nprint(s[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'بيت مدينة'\nprint(s.count('ة'))\nprint('ة' in s)\nprint(s[0])\n```\nالجواب:", "qhash": "7495f612771bd415", "answer": "1\nTrue\nب", "completion": " الناتج:\n```text\n1\nTrue\nب\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(7))\nprint(calc(7, 9))\nprint(calc(calc(9), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(calc(7))\nprint(calc(7, 9))\nprint(calc(calc(9), 7))\n```\nالجواب:", "qhash": "a3b4d8cc50b7ec02", "answer": "2\n16\n11", "completion": " الناتج:\n```text\n2\n16\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "tests": ["assert mfact(7) == 28", "assert mfact(50) == 176", "assert mfact(19) == 696", "assert mfact(60) == 379", "assert mfact(55) == 714", "assert mfact(14) == 212", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 28\nassert mfact(50) == 176\nassert mfact(19) == 696\nassert mfact(60) == 379\nassert mfact(55) == 714\nassert mfact(14) == 212\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(7)` يُرجع `28`.\nالجواب:", "qhash": "918b3b43cdd1ce38"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(items):\n if not items:\n return []\n k = 11 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([16, 3, 16, 44, 17, 18]) == [3, 16, 44, 17, 18, 16]", "assert rotate_by([21, 20, -9, 1, 50, 37, 39, 50, 28, 49, 46]) == [21, 20, -9, 1, 50, 37, 39, 50, 28, 49, 46]", "assert rotate_by([-6, 25, 46]) == [25, 46, -6]", "assert rotate_by([18, 23, 17, 31, 27, -5, 25, 36, 30, -2, 3, -9]) == [23, 17, 31, 27, -5, 25, 36, 30, -2, 3, -9, 18]", "assert rotate_by([-2, 4]) == [4, -2]", "assert rotate_by([42, 29, 17, 5, -5, 19]) == [29, 17, 5, -5, 19, 42]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([16, 3, 16, 44, 17, 18]) == [3, 16, 44, 17, 18, 16]\nassert rotate_by([21, 20, -9, 1, 50, 37, 39, 50, 28, 49, 46]) == [21, 20, -9, 1, 50, 37, 39, 50, 28, 49, 46]\nassert rotate_by([-6, 25, 46]) == [25, 46, -6]\nassert rotate_by([18, 23, 17, 31, 27, -5, 25, 36, 30, -2, 3, -9]) == [23, 17, 31, 27, -5, 25, 36, 30, -2, 3, -9, 18]\nassert rotate_by([-2, 4]) == [4, -2]\nassert rotate_by([42, 29, 17, 5, -5, 19]) == [29, 17, 5, -5, 19, 42]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n if not items:\n return []\n k = 11 % 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 = 11 % len(items)\n return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(items):\n if not items:\n return []\n k = 11 % len(items)\n return ____\n```\nمثال: `rotate_by([16, 3, 16, 44, 17, 18])` يجب أن تُرجع `[3, 16, 44, 17, 18, 16]`.\nالجواب:", "qhash": "3862a7d7c9ae8eca"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 6\nfor j in range(-3, 13, 1):\n s -= j * 1\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 6\nfor j in range(-3, 13, 1):\n s -= j * 1\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "a8431b6ec203604c", "answer": "-66\n12", "completion": " الناتج:\n```text\n-66\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [34, 35, 22, 22, 18, 35]\nprint(data[3:6])\nprint(data[::-2])\nprint(len(data[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [34, 35, 22, 22, 18, 35]\nprint(data[3:6])\nprint(data[::-2])\nprint(len(data[3:6]))\n```\nالجواب:", "qhash": "88e5bbe47eeb07f1", "answer": "[22, 18, 35]\n[35, 22, 35]\n3", "completion": " الناتج:\n```text\n[22, 18, 35]\n[35, 22, 35]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=0):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(g(-5))\nprint(g(-5, 9))\nprint(g(g(9), -5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=0):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(g(-5))\nprint(g(-5, 9))\nprint(g(g(9), -5))\n```\nالجواب:", "qhash": "349a5afca3aa5902", "answer": "-5\n-41\n-16", "completion": " الناتج:\n```text\n-5\n-41\n-16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 388\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 = 388\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": "b177e6ad46b3036e", "answer": "120", "completion": " الناتج:\n```text\n120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(-8))\nprint(f(-8, -2))\nprint(f(f(-2), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=5):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(-8))\nprint(f(-8, -2))\nprint(f(f(-2), -8))\n```\nالجواب:", "qhash": "e1b715178655ae36", "answer": "-3\n-10\n11", "completion": " الناتج:\n```text\n-3\n-10\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 41) == 1)", "tests": ["assert count_gcd1(109) == 107", "assert count_gcd1(174) == 170", "assert count_gcd1(27) == 27", "assert count_gcd1(193) == 189", "assert count_gcd1(19) == 19", "assert count_gcd1(180) == 176", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(109) == 107\nassert count_gcd1(174) == 170\nassert count_gcd1(27) == 27\nassert count_gcd1(193) == 189\nassert count_gcd1(19) == 19\nassert count_gcd1(180) == 176\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, 41) == 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, 41) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 41) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(109)` يُرجع `107`.\nالجواب:", "qhash": "7a548106b2029d67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(8))\nprint(compute(8, 16))\nprint(compute(compute(16), 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(8))\nprint(compute(8, 16))\nprint(compute(compute(16), 8))\n```\nالجواب:", "qhash": "038bea7d1a1954d7", "answer": "59\n136\n976", "completion": " الناتج:\n```text\n59\n136\n976\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('to orange an') == 'sn nqzmfd zm'", "assert decode('table in it') == 'szakd hm hs'", "assert decode('falcon in data cloud garden') == 'ezkbnm hm czsz bkntc fzqcdm'", "assert decode('code by cloud A1') == 'bncd ax bkntc A1'", "assert decode('camel in apple data in') == 'bzldk hm zookd czsz hm'", "assert decode('cloud falcon an to in') == 'bkntc ezkbnm zm sn hm'", "assert decode('') == ''"], "test_code": "assert decode('to orange an') == 'sn nqzmfd zm'\nassert decode('table in it') == 'szakd hm hs'\nassert decode('falcon in data cloud garden') == 'ezkbnm hm czsz bkntc fzqcdm'\nassert decode('code by cloud A1') == 'bncd ax bkntc A1'\nassert decode('camel in apple data in') == 'bzldk hm zookd czsz hm'\nassert decode('cloud falcon an to in') == 'bkntc ezkbnm zm sn hm'\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 + (-1)) % 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 + (-1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('to orange an')` يجب أن تُرجع `'sn nqzmfd zm'`.\nالجواب:", "qhash": "53276018b1dc7473"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "p", "reference": "def p(x):\n return -3 * x ** 2 + (-1) * x + (-9)", "tests": ["assert p(4) == -61", "assert p(18) == -999", "assert p(-20) == -1189", "assert p(13) == -529", "assert p(-3) == -33", "assert p(-9) == -243", "assert p(10) == -319", "assert p(0) == -9"], "test_code": "assert p(4) == -61\nassert p(18) == -999\nassert p(-20) == -1189\nassert p(13) == -529\nassert p(-3) == -33\nassert p(-9) == -243\nassert p(10) == -319\nassert p(0) == -9", "answer": "def p(x):\n return -3 * x ** 2 + (-1) * x + (-9)", "completion": " ```python\ndef p(x):\n return -3 * x ** 2 + (-1) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `p(x)` تُرجع قيمة كثيرة الحدود -3x² - 1x - 9 عند العدد الصحيح x.\nمثال: `p(4)` يجب أن تُرجع `-61`.\nالجواب:", "qhash": "f0961788db956927"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(15))\nprint(g(15, -1))\nprint(g(g(-1), 15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(15))\nprint(g(15, -1))\nprint(g(g(-1), 15))\n```\nالجواب:", "qhash": "268d8c4b8cb29d04", "answer": "-33\n-29\n-37", "completion": " الناتج:\n```text\n-33\n-29\n-37\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 66:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([36, 36, 38, 20, 27, 33]) == [36, 0, 38, 58, 0, 33]", "assert acc_reset([31, 61, -5, 29]) == [31, 0, -5, 24]", "assert acc_reset([39, 55, 24, 0, 59, 26]) == [39, 0, 24, 24, 0, 26]", "assert acc_reset([-7, 18, 60, 7, 39, 59, 46, 61, 57, 43]) == [-7, 11, 0, 7, 46, 0, 46, 0, 57, 0]", "assert acc_reset([45, 45, 13, 20, 5, 66]) == [45, 0, 13, 33, 38, 0]", "assert acc_reset([52, -10, 24, 40, 33, 47, 23]) == [52, 42, 66, 0, 33, 0, 23]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([36, 36, 38, 20, 27, 33]) == [36, 0, 38, 58, 0, 33]\nassert acc_reset([31, 61, -5, 29]) == [31, 0, -5, 24]\nassert acc_reset([39, 55, 24, 0, 59, 26]) == [39, 0, 24, 24, 0, 26]\nassert acc_reset([-7, 18, 60, 7, 39, 59, 46, 61, 57, 43]) == [-7, 11, 0, 7, 46, 0, 46, 0, 57, 0]\nassert acc_reset([45, 45, 13, 20, 5, 66]) == [45, 0, 13, 33, 38, 0]\nassert acc_reset([52, -10, 24, 40, 33, 47, 23]) == [52, 42, 66, 0, 33, 0, 23]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 66:\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 > 66:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 66 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([36, 36, 38, 20, 27, 33])` يجب أن تُرجع `[36, 0, 38, 58, 0, 33]`.\nالجواب:", "qhash": "4a2a4bf66e228d5e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('ميناء نهر عمل بيت نور') == 0", "assert tally_letter('') == 0", "assert tally_letter('حاسوب مدرسة قهوة برمجة بحر نور') == 1", "assert tally_letter('بيت صديق رمل سماء برتقال') == 1", "assert tally_letter('ماء نهار حديقة') == 1", "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('حاسوب مدرسة قهوة برمجة بحر نور') == 1\nassert tally_letter('بيت صديق رمل سماء برتقال') == 1\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": "39ef10bb1b47ee48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('coffee engine camel winter river coffee') == 'coffee-river-winter-camel-engine-coffee'", "assert rev_long_words('window') == 'window'", "assert rev_long_words('by of table vector signal') == 'signal-vector-table'", "assert rev_long_words('pixel') == 'pixel'", "assert rev_long_words('coffee a vector apple apple cloud garden falcon') == 'falcon-garden-cloud-apple-apple-vector-coffee'", "assert rev_long_words('river at') == 'river'", "assert rev_long_words('rocket apple stone cloud signal by camel winter') == 'winter-camel-signal-cloud-stone-apple-rocket'"], "test_code": "assert rev_long_words('coffee engine camel winter river coffee') == 'coffee-river-winter-camel-engine-coffee'\nassert rev_long_words('window') == 'window'\nassert rev_long_words('by of table vector signal') == 'signal-vector-table'\nassert rev_long_words('pixel') == 'pixel'\nassert rev_long_words('coffee a vector apple apple cloud garden falcon') == 'falcon-garden-cloud-apple-apple-vector-coffee'\nassert rev_long_words('river at') == 'river'\nassert rev_long_words('rocket apple stone cloud signal by camel winter') == 'winter-camel-signal-cloud-stone-apple-rocket'", "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('coffee engine camel winter river coffee')` يجب أن تُرجع `'coffee-river-winter-camel-engine-coffee'`.\nالجواب:", "qhash": "c8224ba997430eef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert biggest_mult([19, 11, 25, 55, 57, -8, 1, -27, 33]) == 55", "assert biggest_mult([-44, -22, -22]) == -22", "assert biggest_mult([1, 12, 23]) == None", "assert biggest_mult([21, 26, 11]) == 11", "assert biggest_mult([-12, 7, -42, 18, 3, -27, -9]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([19, 11, 25, 55, 57, -8, 1, -27, 33]) == 55\nassert biggest_mult([-44, -22, -22]) == -22\nassert biggest_mult([1, 12, 23]) == None\nassert biggest_mult([21, 26, 11]) == 11\nassert biggest_mult([-12, 7, -42, 18, 3, -27, -9]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 == 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 % 11 == 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 % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef biggest_mult(xs):\n best = None\n for x in xs:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `biggest_mult([19, 11, 25, 55, 57, -8, 1, -27, 33])` يجب أن تُرجع `55`.\nالجواب:", "qhash": "3499177563137e1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 2 + -3 for x in range(-3, 11) if x % 5 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 2 + -3 for x in range(-3, 11) if x % 5 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "201c656cf33e1921", "answer": "[-9, 1, 11]\n3 3", "completion": " الناتج:\n```text\n[-9, 1, 11]\n3 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if 'ك' in w)", "tests": ["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", "assert letter_count('') == 0"], "test_code": "assert 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\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('دفتر عربية مدرسة بحر سلام وردة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "a4fa994ef93e6523"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'eos'}", "tests": ["assert count_chars('is') == {'e': 0, 'o': 0, 's': 1}", "assert count_chars('brain pixel table pixel') == {'e': 3, 'o': 0, 's': 0}", "assert count_chars('cloud') == {'e': 0, 'o': 1, 's': 0}", "assert count_chars('engine apple river stone rocket by') == {'e': 6, 'o': 2, 's': 1}", "assert count_chars('on garden an falcon music') == {'e': 1, 'o': 2, 's': 1}", "assert count_chars('code rocket music up rocket') == {'e': 3, 'o': 3, 's': 1}", "assert count_chars('') == {'e': 0, 'o': 0, 's': 0}"], "test_code": "assert count_chars('is') == {'e': 0, 'o': 0, 's': 1}\nassert count_chars('brain pixel table pixel') == {'e': 3, 'o': 0, 's': 0}\nassert count_chars('cloud') == {'e': 0, 'o': 1, 's': 0}\nassert count_chars('engine apple river stone rocket by') == {'e': 6, 'o': 2, 's': 1}\nassert count_chars('on garden an falcon music') == {'e': 1, 'o': 2, 's': 1}\nassert count_chars('code rocket music up rocket') == {'e': 3, 'o': 3, 's': 1}\nassert count_chars('') == {'e': 0, 'o': 0, 's': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'eos'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'eos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_chars(s)` تُرجع قاموسًا مفاتيحه المحارف 'e'، 'o'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `count_chars('is')` يجب أن تُرجع `{'e': 0, 'o': 0, 's': 1}`.\nالجواب:", "qhash": "5bfe9a60b0d04da6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_ar", "reference": "def count_ar(text):\n return text.count('ص')", "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 text.count('ص')", "completion": " ```python\ndef count_ar(text):\n return text.count('ص')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `count_ar(text)` تأخذ نصًا عربيًا وتُرجع عدد مرات ظهور الحرف «ص» في النص.\nمثال: `count_ar('برتقال ليل طالب')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "f1d7f1a7e4a42427"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 15:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([10, 10, 12, 10, 9, 9, 7, 1]) == [10, 0, 12, 0, 9, 0, 7, 8]", "assert cumulative([]) == []", "assert cumulative([13, 7, -3, 11]) == [13, 0, -3, 8]", "assert cumulative([-6, 4, 14, -7, -5, 8, -1, 15, -6]) == [-6, -2, 12, 5, 0, 8, 7, 0, -6]", "assert cumulative([]) == []", "assert cumulative([-10, -8, -1, 11]) == [-10, -18, -19, -8]", "assert cumulative([]) == []"], "test_code": "assert cumulative([10, 10, 12, 10, 9, 9, 7, 1]) == [10, 0, 12, 0, 9, 0, 7, 8]\nassert cumulative([]) == []\nassert cumulative([13, 7, -3, 11]) == [13, 0, -3, 8]\nassert cumulative([-6, 4, 14, -7, -5, 8, -1, 15, -6]) == [-6, -2, 12, 5, 0, 8, 7, 0, -6]\nassert cumulative([]) == []\nassert cumulative([-10, -8, -1, 11]) == [-10, -18, -19, -8]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 15:\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 > 15:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 15 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([10, 10, 12, 10, 9, 9, 7, 1])` يجب أن تُرجع `[10, 0, 12, 0, 9, 0, 7, 8]`.\nالجواب:", "qhash": "a29431c20387075f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'سماء ميناء'\nprint(s.split())\nprint(s[-1])\nprint(s.find('ت'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'سماء ميناء'\nprint(s.split())\nprint(s[-1])\nprint(s.find('ت'))\n```\nالجواب:", "qhash": "8ad00d6d514245d3", "answer": "['سماء', 'ميناء']\nء\n-1", "completion": " الناتج:\n```text\n['سماء', 'ميناء']\nء\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert mirror_words('planet winter banana falcon table') == 'table falcon banana winter planet'", "assert mirror_words('winter') == 'winter'", "assert mirror_words('by window vector rocket we at desert at') == 'at desert at we rocket vector window by'", "assert mirror_words('signal') == 'signal'", "assert mirror_words('vector planet vector matrix pixel music desert') == 'desert music pixel matrix vector planet vector'", "assert mirror_words('rocket stone table we table light stone') == 'stone light table we table stone rocket'", "assert mirror_words('falcon on data rocket apple garden') == 'garden apple rocket data on falcon'"], "test_code": "assert mirror_words('planet winter banana falcon table') == 'table falcon banana winter planet'\nassert mirror_words('winter') == 'winter'\nassert mirror_words('by window vector rocket we at desert at') == 'at desert at we rocket vector window by'\nassert mirror_words('signal') == 'signal'\nassert mirror_words('vector planet vector matrix pixel music desert') == 'desert music pixel matrix vector planet vector'\nassert mirror_words('rocket stone table we table light stone') == 'stone light table we table stone rocket'\nassert mirror_words('falcon on data rocket apple garden') == 'garden apple rocket data on falcon'", "answer": "def mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef mirror_words(s):\n return ' '.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `mirror_words('planet winter banana falcon table')` يُرجع `'table falcon banana winter planet'`.\nالجواب:", "qhash": "87bc4b87d508ddf1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '_'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert backwards('in we data stone orange in camel summer') == 'summer_camel_orange_stone'", "assert backwards('apple at') == 'apple'", "assert backwards('by') == ''", "assert backwards('vector garden winter in') == 'winter_garden_vector'", "assert backwards('is') == ''", "assert backwards('coffee rocket') == 'rocket_coffee'", "assert backwards('') == ''"], "test_code": "assert backwards('in we data stone orange in camel summer') == 'summer_camel_orange_stone'\nassert backwards('apple at') == 'apple'\nassert backwards('by') == ''\nassert backwards('vector garden winter in') == 'winter_garden_vector'\nassert backwards('is') == ''\nassert backwards('coffee rocket') == 'rocket_coffee'\nassert backwards('') == ''", "answer": "def backwards(s):\n return '_'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef backwards(s):\n return '_'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `backwards(s)` تأخذ جملة وتُرجع الكلمات التي طولها 5 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `backwards('in we data stone orange in camel summer')` يجب أن تُرجع `'summer_camel_orange_stone'`.\nالجواب:", "qhash": "398aace52fe9b363"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total", "tests": ["assert total_pow(6) == 168", "assert total_pow(7) == 224", "assert total_pow(14) == 840", "assert total_pow(10) == 440", "assert total_pow(9) == 360", "assert total_pow(1) == 8", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 168\nassert total_pow(7) == 224\nassert total_pow(14) == 840\nassert total_pow(10) == 440\nassert total_pow(9) == 360\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 ** 1\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 1\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 8 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n):\n total += 8 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `total_pow(6)` يُرجع `168`.\nالجواب:", "qhash": "bf4e7b00b5a486c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_counts", "reference": "def char_counts(s):\n return {c: s.count(c) for c in 'ghir'}", "tests": ["assert char_counts('engine') == {'g': 1, 'h': 0, 'i': 1, 'r': 0}", "assert char_counts('falcon up to garden') == {'g': 1, 'h': 0, 'i': 0, 'r': 1}", "assert char_counts('on vector go winter') == {'g': 1, 'h': 0, 'i': 1, 'r': 2}", "assert char_counts('planet music a river python') == {'g': 0, 'h': 1, 'i': 2, 'r': 2}", "assert char_counts('summer window pixel orange desert go') == {'g': 2, 'h': 0, 'i': 2, 'r': 3}", "assert char_counts('desert') == {'g': 0, 'h': 0, 'i': 0, 'r': 1}", "assert char_counts('') == {'g': 0, 'h': 0, 'i': 0, 'r': 0}"], "test_code": "assert char_counts('engine') == {'g': 1, 'h': 0, 'i': 1, 'r': 0}\nassert char_counts('falcon up to garden') == {'g': 1, 'h': 0, 'i': 0, 'r': 1}\nassert char_counts('on vector go winter') == {'g': 1, 'h': 0, 'i': 1, 'r': 2}\nassert char_counts('planet music a river python') == {'g': 0, 'h': 1, 'i': 2, 'r': 2}\nassert char_counts('summer window pixel orange desert go') == {'g': 2, 'h': 0, 'i': 2, 'r': 3}\nassert char_counts('desert') == {'g': 0, 'h': 0, 'i': 0, 'r': 1}\nassert char_counts('') == {'g': 0, 'h': 0, 'i': 0, 'r': 0}", "answer": "def char_counts(s):\n return {c: s.count(c) for c in 'ghir'}", "completion": " ```python\ndef char_counts(s):\n return {c: s.count(c) for c in 'ghir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_counts(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'h'، 'i'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_counts('engine')` يُرجع `{'g': 1, 'h': 0, 'i': 1, 'r': 0}`.\nالجواب:", "qhash": "9064e507978c829f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_div(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 how_many_div([40, 56, 42, 41, 31, 78, 68, 60, 34, 80, 59]) == 4", "assert how_many_div([85, -31, -40, -20, 4, -27, 82, -29]) == 3", "assert how_many_div([]) == 0", "assert how_many_div([54, 25, 88, 44, 61, 64, 36, -5]) == 4", "assert how_many_div([85, 45, -20, 77, 67, 81, 76, 48, -34, 6, 13]) == 3", "assert how_many_div([2, 78, 1, 24, 39, 20, 21, -30, -2, -25]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([40, 56, 42, 41, 31, 78, 68, 60, 34, 80, 59]) == 4\nassert how_many_div([85, -31, -40, -20, 4, -27, 82, -29]) == 3\nassert how_many_div([]) == 0\nassert how_many_div([54, 25, 88, 44, 61, 64, 36, -5]) == 4\nassert how_many_div([85, 45, -20, 77, 67, 81, 76, 48, -34, 6, 13]) == 3\nassert how_many_div([2, 78, 1, 24, 39, 20, 21, -30, -2, -25]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_div(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 how_many_div(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 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([40, 56, 42, 41, 31, 78, 68, 60, 34, 80, 59])` يُرجع `4`.\nالجواب:", "qhash": "fe427527388ab463"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(3))\nprint(h(3, 4))\nprint(h(h(4), 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(h(3))\nprint(h(3, 4))\nprint(h(h(4), 3))\n```\nالجواب:", "qhash": "cecb93e326586428", "answer": "30\n15\n90", "completion": " الناتج:\n```text\n30\n15\n90\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "mirror_words", "reference": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert mirror_words('summer rocket python banana light') == 'banana_python_rocket_summer'", "assert mirror_words('in by matrix') == 'matrix'", "assert mirror_words('river table by garden to summer a rocket') == 'rocket_summer_garden'", "assert mirror_words('up camel camel camel cloud') == ''", "assert mirror_words('light of python summer banana in garden brain') == 'garden_banana_summer_python'", "assert mirror_words('at table winter on light signal') == 'signal_winter'", "assert mirror_words('go planet engine matrix orange table planet') == 'planet_orange_matrix_engine_planet'"], "test_code": "assert mirror_words('summer rocket python banana light') == 'banana_python_rocket_summer'\nassert mirror_words('in by matrix') == 'matrix'\nassert mirror_words('river table by garden to summer a rocket') == 'rocket_summer_garden'\nassert mirror_words('up camel camel camel cloud') == ''\nassert mirror_words('light of python summer banana in garden brain') == 'garden_banana_summer_python'\nassert mirror_words('at table winter on light signal') == 'signal_winter'\nassert mirror_words('go planet engine matrix orange table planet') == 'planet_orange_matrix_engine_planet'", "answer": "def mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef mirror_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `mirror_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `mirror_words('summer rocket python banana light')` يُرجع `'banana_python_rocket_summer'`.\nالجواب:", "qhash": "a3bd9822c30c46a1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 41) == 1)", "tests": ["assert coprimes(103) == 101", "assert coprimes(73) == 72", "assert coprimes(87) == 85", "assert coprimes(174) == 170", "assert coprimes(169) == 165", "assert coprimes(129) == 126", "assert coprimes(1) == 1"], "test_code": "assert coprimes(103) == 101\nassert coprimes(73) == 72\nassert coprimes(87) == 85\nassert coprimes(174) == 170\nassert coprimes(169) == 165\nassert coprimes(129) == 126\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, 41) == 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, 41) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprimes(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 41، أي أن القاسم المشترك الأكبر لها مع 41 يساوي 1.\nمثال: `coprimes(103)` يجب أن تُرجع `101`.\nالجواب:", "qhash": "b2f7d61eed8812df"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [29, 31, -5, 21, -5]\nprint(a[2:4])\nprint(a[::2])\nprint(len(a[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [29, 31, -5, 21, -5]\nprint(a[2:4])\nprint(a[::2])\nprint(len(a[2:4]))\n```\nالجواب:", "qhash": "0bb5640962bab565", "answer": "[-5, 21]\n[29, -5, -5]\n2", "completion": " الناتج:\n```text\n[-5, 21]\n[29, -5, -5]\n2\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(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 cumulative([61, 67, 31, 17, 59, 17, 34]) == [61, 128, 0, 17, 76, 93, 127]", "assert cumulative([117, 134, 41, 75]) == [117, 0, 41, 116]", "assert cumulative([120]) == [120]", "assert cumulative([]) == []", "assert cumulative([80, 68, 112, 136, 113, -7, 55, 62, 39, -8]) == [80, 148, 0, 136, 0, -7, 48, 110, 149, 141]", "assert cumulative([80, 5, 140, 82, 91, 74, -4, 8, 76]) == [80, 85, 0, 82, 0, 74, 70, 78, 0]", "assert cumulative([]) == []"], "test_code": "assert cumulative([61, 67, 31, 17, 59, 17, 34]) == [61, 128, 0, 17, 76, 93, 127]\nassert cumulative([117, 134, 41, 75]) == [117, 0, 41, 116]\nassert cumulative([120]) == [120]\nassert cumulative([]) == []\nassert cumulative([80, 68, 112, 136, 113, -7, 55, 62, 39, -8]) == [80, 148, 0, 136, 0, -7, 48, 110, 149, 141]\nassert cumulative([80, 5, 140, 82, 91, 74, -4, 8, 76]) == [80, 85, 0, 82, 0, 74, 70, 78, 0]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 151 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([61, 67, 31, 17, 59, 17, 34])` يُرجع `[61, 128, 0, 17, 76, 93, 127]`.\nالجواب:", "qhash": "4bae817f22621b62"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 3:\n return 1\n return 3 * rec(n - 1) + -1\n\nprint(rec(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 3:\n return 1\n return 3 * rec(n - 1) + -1\n\nprint(rec(9))\n```\nالجواب:", "qhash": "b9c5850510ebf455", "answer": "365", "completion": " الناتج:\n```text\n365\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n <= 1:\n return 1\n return 2 * rec(n - 1) + 3\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n <= 1:\n return 1\n return 2 * rec(n - 1) + 3\n\nprint(rec(5))\n```\nالجواب:", "qhash": "936f5e29235c5def", "answer": "61", "completion": " الناتج:\n```text\n61\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [17, 24, 22, 1, 10, 11, 10, 16, -5]\nprint(a[2:6])\nprint(a[::-1])\nprint(max(a[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [17, 24, 22, 1, 10, 11, 10, 16, -5]\nprint(a[2:6])\nprint(a[::-1])\nprint(max(a[2:6]))\n```\nالجواب:", "qhash": "24551002aa84d95d", "answer": "[22, 1, 10, 11]\n[-5, 16, 10, 11, 10, 1, 22, 24, 17]\n22", "completion": " الناتج:\n```text\n[22, 1, 10, 11]\n[-5, 16, 10, 11, 10, 1, 22, 24, 17]\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'قهوة'\nprint(w.split())\nprint(len(w))\nprint(w.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'قهوة'\nprint(w.split())\nprint(len(w))\nprint(w.replace(' ', '-'))\n```\nالجواب:", "qhash": "767d786db77c94c6", "answer": "['قهوة']\n4\nقهوة", "completion": " الناتج:\n```text\n['قهوة']\n4\nقهوة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('عربية سلام باب حديقة جمل') == 1", "assert starts_count('حديقة شمس مدينة معلم حاسوب') == 2", "assert starts_count('طالب برمجة فجر نهر حصان') == 1", "assert starts_count('نهار حديقة عمل مدينة فجر') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('بيت عمل طالب حاسوب طائرة حاسوب بيت') == 2\nassert starts_count('حصان بحر عربية علم حديقة') == 2\nassert starts_count('عربية سلام باب حديقة جمل') == 1\nassert starts_count('حديقة شمس مدينة معلم حاسوب') == 2\nassert starts_count('طالب برمجة فجر نهر حصان') == 1\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 w.endswith('ح'):\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 w.endswith('ح'):\n count += 1\n return count\n```\nمثال: `starts_count('بيت عمل طالب حاسوب طائرة حاسوب بيت')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "b48a21d0356180c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 9 * x ** 2 + (2) * x + (2)", "tests": ["assert evaluate(10) == 922", "assert evaluate(6) == 338", "assert evaluate(11) == 1113", "assert evaluate(1) == 13", "assert evaluate(-1) == 9", "assert evaluate(9) == 749", "assert evaluate(0) == 2", "assert evaluate(0) == 2"], "test_code": "assert evaluate(10) == 922\nassert evaluate(6) == 338\nassert evaluate(11) == 1113\nassert evaluate(1) == 13\nassert evaluate(-1) == 9\nassert evaluate(9) == 749\nassert evaluate(0) == 2\nassert evaluate(0) == 2", "answer": "def evaluate(x):\n return 9 * x ** 2 + (2) * x + (2)", "completion": " ```python\ndef evaluate(x):\n return 9 * x ** 2 + (2) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 9x² + 2x + 2 عند العدد الصحيح x.\nمثال: `evaluate(10)` يجب أن تُرجع `922`.\nالجواب:", "qhash": "a8472361695a60dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -4 for x in xs if -8 <= x <= 13)", "tests": ["assert between_times([-2, 23, 14, -6, 15, 9, -8]) == [-36, 8, 24, 32]", "assert between_times([-17, 20, -7, -9, -13, -6, 22, 34]) == [24, 28]", "assert between_times([49, -5, 59, -2, 26]) == [8, 20]", "assert between_times([26, 30, 34, 16]) == []", "assert between_times([-2, 36, 10, 27, 39, 35, -14, -8, 0, -24]) == [-40, 0, 8, 32]", "assert between_times([]) == []", "assert between_times([]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([-2, 23, 14, -6, 15, 9, -8]) == [-36, 8, 24, 32]\nassert between_times([-17, 20, -7, -9, -13, -6, 22, 34]) == [24, 28]\nassert between_times([49, -5, 59, -2, 26]) == [8, 20]\nassert between_times([26, 30, 34, 16]) == []\nassert between_times([-2, 36, 10, 27, 39, 35, -14, -8, 0, -24]) == [-40, 0, 8, 32]\nassert between_times([]) == []\nassert between_times([]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -4 for x in xs if -8 <= x <= 13)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -4 for x in xs if -8 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -8 و13 (شاملًا الطرفين) في -4.\nمثال: `between_times([-2, 23, 14, -6, 15, 9, -8])` يجب أن تُرجع `[-36, 8, 24, 32]`.\nالجواب:", "qhash": "a94e1fa5313bb4c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=7):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(4))\nprint(h(4, 15))\nprint(h(h(15), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=7):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(4))\nprint(h(4, 15))\nprint(h(h(15), 4))\n```\nالجواب:", "qhash": "a4d27cc661077400", "answer": "-10\n-26\n-45", "completion": " الناتج:\n```text\n-10\n-26\n-45\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 13", "tests": ["assert mfact(4) == 8", "assert mfact(5) == 2", "assert mfact(12) == 8", "assert mfact(24) == 12", "assert mfact(11) == 8", "assert mfact(5) == 2", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 8\nassert mfact(5) == 2\nassert mfact(12) == 8\nassert mfact(24) == 12\nassert mfact(11) == 8\nassert mfact(5) == 2\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 13", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `mfact(4)` يجب أن تُرجع `8`.\nالجواب:", "qhash": "e1073acd587c6f87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(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_special([43, 74, 88, 50, 51, 57, 44, 11, 71, 39]) == 0", "assert count_special([39, 47, 45, 22, 10, 86, 49, 83, -29]) == 1", "assert count_special([]) == 0", "assert count_special([55, -37, -8, 5, 82]) == 0", "assert count_special([4, 4, 10, -14, 37, 74, 63, 34, 65, 3, -16]) == 0", "assert count_special([-29, -22, 41, 46]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([43, 74, 88, 50, 51, 57, 44, 11, 71, 39]) == 0\nassert count_special([39, 47, 45, 22, 10, 86, 49, 83, -29]) == 1\nassert count_special([]) == 0\nassert count_special([55, -37, -8, 5, 82]) == 0\nassert count_special([4, 4, 10, -14, 37, 74, 63, 34, 65, 3, -16]) == 0\nassert count_special([-29, -22, 41, 46]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_special([43, 74, 88, 50, 51, 57, 44, 11, 71, 39])` يُرجع `0`.\nالجواب:", "qhash": "3b90e57e9080ff8c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert multiples_total(54) == 298", "assert multiples_total(43) == 198", "assert multiples_total(263) == 6642", "assert multiples_total(103) == 988", "assert multiples_total(71) == 483", "assert multiples_total(296) == 8305", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(54) == 298\nassert multiples_total(43) == 198\nassert multiples_total(263) == 6642\nassert multiples_total(103) == 988\nassert multiples_total(71) == 483\nassert multiples_total(296) == 8305\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 % 13 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 13.\nمثال: `multiples_total(54)` يجب أن تُرجع `298`.\nالجواب:", "qhash": "cc901595a34b9d2d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([-1, 33, -1, 43, 58, -14, -28]) == None", "assert largest_div([-25, -20, -25]) == -20", "assert largest_div([1, 6, 11]) == None", "assert largest_div([-2, -32, 28, -13, -33]) == None", "assert largest_div([38, -35, -45, 13, 36]) == -35", "assert largest_div([]) == None"], "test_code": "assert largest_div([-1, 33, -1, 43, 58, -14, -28]) == None\nassert largest_div([-25, -20, -25]) == -20\nassert largest_div([1, 6, 11]) == None\nassert largest_div([-2, -32, 28, -13, -33]) == None\nassert largest_div([38, -35, -45, 13, 36]) == -35\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 5 == 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 % 5 == 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 % 5 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(arr):\n best = 0\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([-1, 33, -1, 43, 58, -14, -28])` يُرجع `None`.\nالجواب:", "qhash": "997784341f876d89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "tests": ["assert mult_sum(260) == 10014", "assert mult_sum(172) == 4423", "assert mult_sum(95) == 1263", "assert mult_sum(115) == 1985", "assert mult_sum(22) == 74", "assert mult_sum(9) == 13", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(260) == 10014\nassert mult_sum(172) == 4423\nassert mult_sum(95) == 1263\nassert mult_sum(115) == 1985\nassert mult_sum(22) == 74\nassert mult_sum(9) == 13\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 % 8 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 5 أو على 8.\nمثال: `mult_sum(260)` يجب أن تُرجع `10014`.\nالجواب:", "qhash": "757a8c9cdf514418"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 202\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 = 202\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": "2be10c59a51e1af3", "answer": "26", "completion": " الناتج:\n```text\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n <= 1:\n return 3\n return 3 * rec(n - 1) + 0\n\nprint(rec(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n <= 1:\n return 3\n return 3 * rec(n - 1) + 0\n\nprint(rec(4))\n```\nالجواب:", "qhash": "d6223d32c28ec946", "answer": "81", "completion": " الناتج:\n```text\n81\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 49", "tests": ["assert digit_score(53150) == 11", "assert digit_score(12047) == 21", "assert digit_score(177902) == 37", "assert digit_score(856759) == 35", "assert digit_score(518436) == 4", "assert digit_score(819505) == 0", "assert digit_score(795627) == 48", "assert digit_score(0) == 0"], "test_code": "assert digit_score(53150) == 11\nassert digit_score(12047) == 21\nassert digit_score(177902) == 37\nassert digit_score(856759) == 35\nassert digit_score(518436) == 4\nassert digit_score(819505) == 0\nassert digit_score(795627) == 48\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 49", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 49\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digit_score(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 49.\nللتوضيح: الاستدعاء `digit_score(53150)` يُرجع `11`.\nالجواب:", "qhash": "fb2524dfdb8652f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_matching([74, 52, 18, 38, 23, 15, 21, 16, 25, 71]) == 2", "assert count_matching([39, -23, -35, -39, -4, 37, 69, -4]) == 2", "assert count_matching([1, -16, 44, -28, 60, -2]) == 4", "assert count_matching([13, 47, 21, 10, 2, 25, -27, -38, -26, 37]) == 0", "assert count_matching([]) == 0", "assert count_matching([41, 14, 1, 11, 15, 6, 40, 87, 67, -37]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([74, 52, 18, 38, 23, 15, 21, 16, 25, 71]) == 2\nassert count_matching([39, -23, -35, -39, -4, 37, 69, -4]) == 2\nassert count_matching([1, -16, 44, -28, 60, -2]) == 4\nassert count_matching([13, 47, 21, 10, 2, 25, -27, -38, -26, 37]) == 0\nassert count_matching([]) == 0\nassert count_matching([41, 14, 1, 11, 15, 6, 40, 87, 67, -37]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 9، واكتب الدالة بعد إكمالها.\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([74, 52, 18, 38, 23, 15, 21, 16, 25, 71])` يُرجع `2`.\nالجواب:", "qhash": "1d09f875b6af89c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x * -1 + -1 for x in range(3, 17) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x * -1 + -1 for x in range(3, 17) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "fa40ed3a0714d1f7", "answer": "[-6, -11, -16]\n3 -33", "completion": " الناتج:\n```text\n[-6, -11, -16]\n3 -33\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('فجر حاسوب خبز ميناء قهوة خبز') == 1", "assert count_letter('رمل رمل ماء طائرة قلم برتقال سماء نهار') == 1", "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('فجر حاسوب خبز ميناء قهوة خبز') == 1\nassert count_letter('رمل رمل ماء طائرة قلم برتقال سماء نهار') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ق»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('حاسوب بيت سلام كتاب سيارة بحر سلام صحراء')` يُرجع `0`.\nالجواب:", "qhash": "0a45a384227b6ce4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'مدرسة خبز'\nprint(len(text))\nprint(text.count('ب'))\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'مدرسة خبز'\nprint(len(text))\nprint(text.count('ب'))\nprint(text[0])\n```\nالجواب:", "qhash": "af88cec65500539c", "answer": "9\n1\nم", "completion": " الناتج:\n```text\n9\n1\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert decode('music an orange a OK') == 'zhfvp na benatr n OK'", "assert decode('is by') == 'vf ol'", "assert decode('coffee 2024') == 'pbssrr 2024'", "assert decode('by an river rocket summer A1') == 'ol na evire ebpxrg fhzzre A1'", "assert decode('orange') == 'benatr'", "assert decode('table desert coffee summer python Hello') == 'gnoyr qrfreg pbssrr fhzzre clguba Hryyb'", "assert decode('') == ''"], "test_code": "assert decode('music an orange a OK') == 'zhfvp na benatr n OK'\nassert decode('is by') == 'vf ol'\nassert decode('coffee 2024') == 'pbssrr 2024'\nassert decode('by an river rocket summer A1') == 'ol na evire ebpxrg fhzzre A1'\nassert decode('orange') == 'benatr'\nassert decode('table desert coffee summer python Hello') == 'gnoyr qrfreg pbssrr fhzzre clguba Hryyb'\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 + (-13)) % 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 + (-13)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `decode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('music an orange a OK')` يجب أن تُرجع `'zhfvp na benatr n OK'`.\nالجواب:", "qhash": "4690d8323e0346fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 11:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([9, 9, 7, 2, 3, 1, 10]) == [9, 0, 7, 9, 0, 1, 11]", "assert acc_reset([-1, 3, 7, 3, -9, -2, -2, 1, -6]) == [-1, 2, 9, 0, -9, -11, -13, -12, -18]", "assert acc_reset([5, -5, 0]) == [5, 0, 0]", "assert acc_reset([6, -7, 11]) == [6, -1, 10]", "assert acc_reset([-5, 8, 11]) == [-5, 3, 0]", "assert acc_reset([-5, 4]) == [-5, -1]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([9, 9, 7, 2, 3, 1, 10]) == [9, 0, 7, 9, 0, 1, 11]\nassert acc_reset([-1, 3, 7, 3, -9, -2, -2, 1, -6]) == [-1, 2, 9, 0, -9, -11, -13, -12, -18]\nassert acc_reset([5, -5, 0]) == [5, 0, 0]\nassert acc_reset([6, -7, 11]) == [6, -1, 10]\nassert acc_reset([-5, 8, 11]) == [-5, 3, 0]\nassert acc_reset([-5, 4]) == [-5, -1]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 11:\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 > 11:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 11 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([9, 9, 7, 2, 3, 1, 10])` يجب أن تُرجع `[9, 0, 7, 9, 0, 1, 11]`.\nالجواب:", "qhash": "5fe1c23293bd6d21"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 5911\nc = 0\nwhile n > 15:\n n = n // 9\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 5911\nc = 0\nwhile n > 15:\n n = n // 9\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "f7dfc0452cf365b7", "answer": "8 3", "completion": " الناتج:\n```text\n8 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'برتقال شمس'\nprint(len(w.replace(' ', '')))\nprint(w[::-1])\nprint(w.find('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'برتقال شمس'\nprint(len(w.replace(' ', '')))\nprint(w[::-1])\nprint(w.find('ا'))\n```\nالجواب:", "qhash": "598e4df10efc4723", "answer": "9\nسمش لاقترب\n4", "completion": " الناتج:\n```text\n9\nسمش لاقترب\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_start", "reference": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ج'):\n count += 1\n return count", "tests": ["assert count_start('صحراء نور عربية سيارة طائرة برتقال') == 0", "assert count_start('حاسوب بيت') == 0", "assert count_start('برمجة حديقة طائرة جبل قمر جمل') == 2", "assert count_start('جبل وردة باب سفينة مطر مدينة') == 1", "assert count_start('نهار جمل سيارة سفينة') == 1", "assert count_start('خبز برمجة نهر جبل حديقة ليل') == 1", "assert count_start('') == 0"], "test_code": "assert count_start('صحراء نور عربية سيارة طائرة برتقال') == 0\nassert count_start('حاسوب بيت') == 0\nassert count_start('برمجة حديقة طائرة جبل قمر جمل') == 2\nassert count_start('جبل وردة باب سفينة مطر مدينة') == 1\nassert count_start('نهار جمل سيارة سفينة') == 1\nassert count_start('خبز برمجة نهر جبل حديقة ليل') == 1\nassert count_start('') == 0", "answer": "def count_start(s):\n count = 0\n for w in s.split():\n if w.startswith('ج'):\n count += 1\n return count", "completion": " ```python\ndef count_start(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_start(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_start(s):\n count = 0\n for w in s.split():\n if w.endswith('ج'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_start('صحراء نور عربية سيارة طائرة برتقال')` يُرجع `0`.\nالجواب:", "qhash": "6aa04ce09dd9e157"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [28, 37, 6, 30, 0, -6, 10, 18, -7]\nprint(lst[2:9])\nprint(lst[::3])\nprint(min(lst[2:9]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [28, 37, 6, 30, 0, -6, 10, 18, -7]\nprint(lst[2:9])\nprint(lst[::3])\nprint(min(lst[2:9]))\n```\nالجواب:", "qhash": "a44dbc1e807d3cf8", "answer": "[6, 30, 0, -6, 10, 18, -7]\n[28, 30, 10]\n-7", "completion": " الناتج:\n```text\n[6, 30, 0, -6, 10, 18, -7]\n[28, 30, 10]\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('go cloud table river it') == 'river_table_cloud'", "assert rev_long_words('by to python rocket planet') == 'planet_rocket_python'", "assert rev_long_words('by signal light by music in window music') == 'music_window_music_light_signal'", "assert rev_long_words('banana we at on') == 'banana'", "assert rev_long_words('brain window pixel window code') == 'window_pixel_window_brain'", "assert rev_long_words('go garden garden music light on we') == 'light_music_garden_garden'", "assert rev_long_words('it python orange table pixel by') == 'pixel_table_orange_python'"], "test_code": "assert rev_long_words('go cloud table river it') == 'river_table_cloud'\nassert rev_long_words('by to python rocket planet') == 'planet_rocket_python'\nassert rev_long_words('by signal light by music in window music') == 'music_window_music_light_signal'\nassert rev_long_words('banana we at on') == 'banana'\nassert rev_long_words('brain window pixel window code') == 'window_pixel_window_brain'\nassert rev_long_words('go garden garden music light on we') == 'light_music_garden_garden'\nassert rev_long_words('it python orange table pixel by') == 'pixel_table_orange_python'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_long_words('go cloud table river it')` يُرجع `'river_table_cloud'`.\nالجواب:", "qhash": "e438c1ca0937f200"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 31", "tests": ["assert step_product(3) == 3", "assert step_product(1) == 1", "assert step_product(43) == 0", "assert step_product(58) == 16", "assert step_product(3) == 3", "assert step_product(35) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(1) == 1\nassert step_product(43) == 0\nassert step_product(58) == 16\nassert step_product(3) == 3\nassert step_product(35) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 31", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 31\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 31 في كل خطوة (وتُرجع 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": "c2ce634aaf3b6fa3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * -1 + -9 for x in range(-4, 10) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * -1 + -9 for x in range(-4, 10) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "27332dc5b4605b6c", "answer": "[-9, -14]\n2 -23", "completion": " الناتج:\n```text\n[-9, -14]\n2 -23\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return -9 * x ** 2 + (-8) * x + (2)", "tests": ["assert p(7) == -495", "assert p(17) == -2735", "assert p(12) == -1390", "assert p(-7) == -383", "assert p(6) == -370", "assert p(-16) == -2174", "assert p(-19) == -3095", "assert p(0) == 2"], "test_code": "assert p(7) == -495\nassert p(17) == -2735\nassert p(12) == -1390\nassert p(-7) == -383\nassert p(6) == -370\nassert p(-16) == -2174\nassert p(-19) == -3095\nassert p(0) == 2", "answer": "def p(x):\n return -9 * x ** 2 + (-8) * x + (2)", "completion": " ```python\ndef p(x):\n return -9 * x ** 2 + (-8) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار -9x² - 8x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(7)` يُرجع `-495`.\nالجواب:", "qhash": "2a8e60ed9ffc73a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 49065\ncount = 0\nwhile n > 11:\n n = n // 6\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 49065\ncount = 0\nwhile n > 11:\n n = n // 6\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "df007ee176d69eb2", "answer": "6 5", "completion": " الناتج:\n```text\n6 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([46, -9, 7, 14, 3, 1, -7]) == None", "assert max_multiple([-60, -60, -36]) == -36", "assert max_multiple([1, 13]) == None", "assert max_multiple([-21, -21, -23, 18]) == None", "assert max_multiple([-4, 24, 27, -29, -50, -39, -39, 10, 25]) == 24", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([46, -9, 7, 14, 3, 1, -7]) == None\nassert max_multiple([-60, -60, -36]) == -36\nassert max_multiple([1, 13]) == None\nassert max_multiple([-21, -21, -23, 18]) == None\nassert max_multiple([-4, 24, 27, -29, -50, -39, -39, 10, 25]) == 24\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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 max_multiple(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مثال: `max_multiple([46, -9, 7, 14, 3, 1, -7])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "b9344087cdd3fee7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'عربية'\nprint('ب' in text)\nprint(text.replace(' ', '-'))\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'عربية'\nprint('ب' in text)\nprint(text.replace(' ', '-'))\nprint(text[0])\n```\nالجواب:", "qhash": "ceea0fc59fbc1dbf", "answer": "True\nعربية\nع", "completion": " الناتج:\n```text\nTrue\nعربية\nع\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('مطر نهر') == 0", "assert lead_count('سيارة شمس قهوة') == 0", "assert lead_count('سماء طالب') == 0", "assert lead_count('وردة دفتر سماء') == 1", "assert lead_count('حاسوب لغة قهوة وردة شمس مدينة سماء') == 1", "assert lead_count('قمر شمس وردة صديق') == 1", "assert lead_count('') == 0"], "test_code": "assert lead_count('مطر نهر') == 0\nassert lead_count('سيارة شمس قهوة') == 0\nassert lead_count('سماء طالب') == 0\nassert lead_count('وردة دفتر سماء') == 1\nassert lead_count('حاسوب لغة قهوة وردة شمس مدينة سماء') == 1\nassert lead_count('قمر شمس وردة صديق') == 1\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('مطر نهر')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "9812ca7c5e8a09d7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert play(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi']", "assert play(20) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17', 'Hi', '19', 'Hi']", "assert play(17) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17']", "assert play(15) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15']", "assert play(18) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17', 'Hi']"], "test_code": "assert play(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi']\nassert play(20) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17', 'Hi', '19', 'Hi']\nassert play(17) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17']\nassert play(15) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15']\nassert play(18) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi', '13', 'HiYo', '15', 'Hi', '17', 'Hi']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 7 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Hi'، وعلى 7 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(12)` يجب أن تُرجع `['1', 'Hi', '3', 'Hi', '5', 'Hi', 'Yo', 'Hi', '9', 'Hi', '11', 'Hi']`.\nالجواب:", "qhash": "726c9f2f864230d8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [31, 4, 24, 4, 25, 30, 28, -1, 5]\nprint(items[2:4])\nprint(items[::3])\nprint(max(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [31, 4, 24, 4, 25, 30, 28, -1, 5]\nprint(items[2:4])\nprint(items[::3])\nprint(max(items[2:4]))\n```\nالجواب:", "qhash": "317f4b2fb4185250", "answer": "[24, 4]\n[31, 4, 28]\n24", "completion": " الناتج:\n```text\n[24, 4]\n[31, 4, 28]\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "items = [31, 39, 12, 23, 34, 3, -5, 21, -3]\nprint(items[0:1])\nprint(items[::-2])\nprint(sum(items[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nitems = [31, 39, 12, 23, 34, 3, -5, 21, -3]\nprint(items[0:1])\nprint(items[::-2])\nprint(sum(items[0:1]))\n```\nالجواب:", "qhash": "eacdc63e2c78c88d", "answer": "[31]\n[-3, -5, 34, 12, 31]\n31", "completion": " الناتج:\n```text\n[31]\n[-3, -5, 34, 12, 31]\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 16)", "tests": ["assert between_times([13, 22, -13, 20]) == [-65]", "assert between_times([]) == []", "assert between_times([38, 36, 3, 24, -10]) == [-15]", "assert between_times([-22, -7, 37]) == []", "assert between_times([53, -15, 55, -26]) == []", "assert between_times([13, 14, 46, 18]) == [-70, -65]", "assert between_times([-12, 44, -13, 31, 33, 10, 24, 41, 11]) == [-55, -50]", "assert between_times([]) == []"], "test_code": "assert between_times([13, 22, -13, 20]) == [-65]\nassert between_times([]) == []\nassert between_times([38, 36, 3, 24, -10]) == [-15]\nassert between_times([-22, -7, 37]) == []\nassert between_times([53, -15, 55, -26]) == []\nassert between_times([13, 14, 46, 18]) == [-70, -65]\nassert between_times([-12, 44, -13, 31, 33, 10, 24, 41, 11]) == [-55, -50]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 16)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * -5 for x in xs if -6 <= x <= 16)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و16 (شاملًا الطرفين) في -5.\nمثال: `between_times([13, 22, -13, 20])` يجب أن تُرجع `[-65]`.\nالجواب:", "qhash": "ce4fb456d7f149ba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('garden up by desert window vector window by') == 'window/vector/window/desert/garden'", "assert backwards('python matrix') == 'matrix/python'", "assert backwards('go on desert stone we') == 'desert'", "assert backwards('banana coffee brain engine') == 'engine/coffee/banana'", "assert backwards('table go it on we apple summer we') == 'summer'", "assert backwards('desert river brain we code light table') == 'desert'", "assert backwards('coffee a to code vector signal window') == 'window/signal/vector/coffee'"], "test_code": "assert backwards('garden up by desert window vector window by') == 'window/vector/window/desert/garden'\nassert backwards('python matrix') == 'matrix/python'\nassert backwards('go on desert stone we') == 'desert'\nassert backwards('banana coffee brain engine') == 'engine/coffee/banana'\nassert backwards('table go it on we apple summer we') == 'summer'\nassert backwards('desert river brain we code light table') == 'desert'\nassert backwards('coffee a to code vector signal window') == 'window/signal/vector/coffee'", "answer": "def backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `backwards('garden up by desert window vector window by')` يُرجع `'window/vector/window/desert/garden'`.\nالجواب:", "qhash": "f6cad81bcbb8613a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [x * 2 + 0 for x in range(4, 18) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [x * 2 + 0 for x in range(4, 18) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "b44046697ae27d73", "answer": "[10, 16, 22, 28, 34]\n5 110", "completion": " الناتج:\n```text\n[10, 16, 22, 28, 34]\n5 110\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('stone pixel stone go at is to') == 'stone pixel stone'", "assert flip_words('of river up coffee in at apple') == 'apple coffee river'", "assert flip_words('signal planet winter code table table of') == 'table table code winter planet signal'", "assert flip_words('') == ''", "assert flip_words('an vector by banana') == 'banana vector'", "assert flip_words('light signal planet of') == 'planet signal light'", "assert flip_words('coffee to summer music cloud matrix it') == 'matrix cloud music summer coffee'"], "test_code": "assert flip_words('stone pixel stone go at is to') == 'stone pixel stone'\nassert flip_words('of river up coffee in at apple') == 'apple coffee river'\nassert flip_words('signal planet winter code table table of') == 'table table code winter planet signal'\nassert flip_words('') == ''\nassert flip_words('an vector by banana') == 'banana vector'\nassert flip_words('light signal planet of') == 'planet signal light'\nassert flip_words('coffee to summer music cloud matrix it') == 'matrix cloud music summer coffee'", "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('stone pixel stone go at is to')` يجب أن تُرجع `'stone pixel stone'`.\nالجواب:", "qhash": "cd44d87dac8009fb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([3, 7, 7, 7, 12, 8, 12, 2, 18]) == [3, 10, 17, 24, 0, 8, 20, 22, 0]", "assert capped_cumsum([-3, 14]) == [-3, 11]", "assert capped_cumsum([7, 0, -7]) == [7, 7, 0]", "assert capped_cumsum([21, -10, 21, -9, -2, -2, -9, 11, 5, -8]) == [21, 11, 0, -9, -11, -13, -22, -11, -6, -14]", "assert capped_cumsum([15, 29, 1]) == [15, 0, 1]", "assert capped_cumsum([13, -8, 9, 26, 16, 17, 23, 9]) == [13, 5, 14, 0, 16, 0, 23, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([3, 7, 7, 7, 12, 8, 12, 2, 18]) == [3, 10, 17, 24, 0, 8, 20, 22, 0]\nassert capped_cumsum([-3, 14]) == [-3, 11]\nassert capped_cumsum([7, 0, -7]) == [7, 7, 0]\nassert capped_cumsum([21, -10, 21, -9, -2, -2, -9, 11, 5, -8]) == [21, 11, 0, -9, -11, -13, -22, -11, -6, -14]\nassert capped_cumsum([15, 29, 1]) == [15, 0, 1]\nassert capped_cumsum([13, -8, 9, 26, 16, 17, 23, 9]) == [13, 5, 14, 0, 16, 0, 23, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 30:\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 > 30:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `capped_cumsum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 30 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `capped_cumsum([3, 7, 7, 7, 12, 8, 12, 2, 18])` يجب أن تُرجع `[3, 10, 17, 24, 0, 8, 20, 22, 0]`.\nالجواب:", "qhash": "4a367056d47049e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ك'):\n count += 1\n return count", "tests": ["assert starts_count('سيارة كتاب حاسوب رمل حديقة كتاب') == 2", "assert starts_count('كتاب تفاحة علم نهار رمل سوق حصان') == 1", "assert starts_count('بيت طائرة سوق مطر') == 0", "assert starts_count('قهوة كتاب خبز') == 1", "assert starts_count('عمل كتاب باب') == 1", "assert starts_count('سفينة حاسوب مكتبة') == 0", "assert starts_count('') == 0"], "test_code": "assert starts_count('سيارة كتاب حاسوب رمل حديقة كتاب') == 2\nassert starts_count('كتاب تفاحة علم نهار رمل سوق حصان') == 1\nassert starts_count('بيت طائرة سوق مطر') == 0\nassert starts_count('قهوة كتاب خبز') == 1\nassert starts_count('عمل كتاب باب') == 1\nassert starts_count('سفينة حاسوب مكتبة') == 0\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ك'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_count(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 starts_count(line):\n count = 0\n for w in line.split():\n if 'ك' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('سيارة كتاب حاسوب رمل حديقة كتاب')` يُرجع `2`.\nالجواب:", "qhash": "aad8ef8a869ce31b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)", "tests": ["assert sum_div(182) == 3976", "assert sum_div(106) == 1371", "assert sum_div(27) == 69", "assert sum_div(237) == 6708", "assert sum_div(28) == 96", "assert sum_div(88) == 888", "assert sum_div(1) == 0"], "test_code": "assert sum_div(182) == 3976\nassert sum_div(106) == 1371\nassert sum_div(27) == 69\nassert sum_div(237) == 6708\nassert sum_div(28) == 96\nassert sum_div(88) == 888\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 9، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(182)` يُرجع `3976`.\nالجواب:", "qhash": "b3eb673f07aa1c70"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'برتقال مدينة'\nprint(text[-1])\nprint(text.split())\nprint('ت' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'برتقال مدينة'\nprint(text[-1])\nprint(text.split())\nprint('ت' in text)\n```\nالجواب:", "qhash": "dea4f7fb142bf43f", "answer": "ة\n['برتقال', 'مدينة']\nTrue", "completion": " الناتج:\n```text\nة\n['برتقال', 'مدينة']\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 37", "tests": ["assert step_product(7) == 31", "assert step_product(9) == 20", "assert step_product(46) == 9", "assert step_product(37) == 0", "assert step_product(24) == 34", "assert step_product(53) == 0", "assert step_product(0) == 1"], "test_code": "assert step_product(7) == 31\nassert step_product(9) == 20\nassert step_product(46) == 9\nassert step_product(37) == 0\nassert step_product(24) == 34\nassert step_product(53) == 0\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 37", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 37\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 37 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(7)` يجب أن تُرجع `31`.\nالجواب:", "qhash": "a9c2712a6879a01b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 11)", "tests": ["assert pick_between([-14, -4, 13, 10, 8, -1]) == [-10, -8, 1, 4]", "assert pick_between([9, -16, 39, 11, -20, -24, 36]) == [-11, -9]", "assert pick_between([25, 49, -16, -7, -12]) == [7]", "assert pick_between([]) == []", "assert pick_between([31, -20, 58, 12, -22, 59, 60, 51]) == []", "assert pick_between([-18, -5, 52, 26, 22]) == [5]", "assert pick_between([]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-14, -4, 13, 10, 8, -1]) == [-10, -8, 1, 4]\nassert pick_between([9, -16, 39, 11, -20, -24, 36]) == [-11, -9]\nassert pick_between([25, 49, -16, -7, -12]) == [7]\nassert pick_between([]) == []\nassert pick_between([31, -20, 58, 12, -22, 59, 60, 51]) == []\nassert pick_between([-18, -5, 52, 26, 22]) == [5]\nassert pick_between([]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 11)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * -1 for x in xs if -7 <= x <= 11)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق -7 ≤ x ≤ 11، اضرب كلًا منها في -1، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([-14, -4, 13, 10, 8, -1])` يُرجع `[-10, -8, 1, 4]`.\nالجواب:", "qhash": "466dbe13ed7399e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(8))\n```\nالجواب:", "qhash": "94423735ad53f20c", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(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 rolling_total([14, 28, 22, 20, 24, 11, 7, 20, 16]) == [14, 42, 0, 20, 44, 0, 7, 27, 43]", "assert rolling_total([22, 7, 22, 0, -5, 10, 44, 5, -8, 31]) == [22, 29, 0, 0, -5, 5, 0, 5, -3, 28]", "assert rolling_total([24, 1, 37, 0, 46, 39, 3, 10, 15]) == [24, 25, 0, 0, 46, 0, 3, 13, 28]", "assert rolling_total([]) == []", "assert rolling_total([-3, -4, -6, 26, 7, 32, -1, 33]) == [-3, -7, -13, 13, 20, 0, -1, 32]", "assert rolling_total([15, -7, 35, 1, 31, 32, 24]) == [15, 8, 43, 44, 0, 32, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([14, 28, 22, 20, 24, 11, 7, 20, 16]) == [14, 42, 0, 20, 44, 0, 7, 27, 43]\nassert rolling_total([22, 7, 22, 0, -5, 10, 44, 5, -8, 31]) == [22, 29, 0, 0, -5, 5, 0, 5, -3, 28]\nassert rolling_total([24, 1, 37, 0, 46, 39, 3, 10, 15]) == [24, 25, 0, 0, 46, 0, 3, 13, 28]\nassert rolling_total([]) == []\nassert rolling_total([-3, -4, -6, 26, 7, 32, -1, 33]) == [-3, -7, -13, 13, 20, 0, -1, 32]\nassert rolling_total([15, -7, 35, 1, 31, 32, 24]) == [15, 8, 43, 44, 0, 32, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(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 rolling_total(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سؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 46 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([14, 28, 22, 20, 24, 11, 7, 20, 16])` يُرجع `[14, 42, 0, 20, 44, 0, 7, 27, 43]`.\nالجواب:", "qhash": "b649f28b8e1947d1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(67) == 462", "assert mult_sum(78) == 604", "assert mult_sum(167) == 2809", "assert mult_sum(206) == 4107", "assert mult_sum(196) == 3709", "assert mult_sum(57) == 339", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(67) == 462\nassert mult_sum(78) == 604\nassert mult_sum(167) == 2809\nassert mult_sum(206) == 4107\nassert mult_sum(196) == 3709\nassert mult_sum(57) == 339\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(67)` يُرجع `462`.\nالجواب:", "qhash": "f093f1a3a4d7f8c3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('حديقة فجر كتاب ماء') == 1", "assert count_start('طائرة فجر حصان سلام فجر حاسوب') == 2", "assert count_start('فجر سفينة ليل فجر') == 2", "assert count_start('سوق سلام') == 0", "assert count_start('سيارة فجر قلم قهوة') == 1", "assert count_start('بحر حاسوب نهر حصان') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('حديقة فجر كتاب ماء') == 1\nassert count_start('طائرة فجر حصان سلام فجر حاسوب') == 2\nassert count_start('فجر سفينة ليل فجر') == 2\nassert count_start('سوق سلام') == 0\nassert count_start('سيارة فجر قلم قهوة') == 1\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:\n if w.startswith('ف'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ف»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef count_start(line):\n count = 0\n for w in line:\n if w.startswith('ف'):\n count += 1\n return count\n```\nمثال: `count_start('حديقة فجر كتاب ماء')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "236511aa6a79fcf4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'cloud_table'\nprint(s.replace('l', '0'))\nprint(s.capitalize())\nprint(s.find('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'cloud_table'\nprint(s.replace('l', '0'))\nprint(s.capitalize())\nprint(s.find('l'))\n```\nالجواب:", "qhash": "293e3189e808b587", "answer": "c0oud_tab0e\nCloud_table\n1", "completion": " الناتج:\n```text\nc0oud_tab0e\nCloud_table\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 16\nfor x in range(6, 22, 1):\n total += x * 9\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 16\nfor x in range(6, 22, 1):\n total += x * 9\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "0b42a57c7a1b69a4", "answer": "1960\n21", "completion": " الناتج:\n```text\n1960\n21\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 22", "tests": ["assert digits_mod(53638) == 1", "assert digits_mod(225885) == 20", "assert digits_mod(204093) == 2", "assert digits_mod(518282) == 20", "assert digits_mod(912048) == 12", "assert digits_mod(474920) == 12", "assert digits_mod(61659) == 1", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(53638) == 1\nassert digits_mod(225885) == 20\nassert digits_mod(204093) == 2\nassert digits_mod(518282) == 20\nassert digits_mod(912048) == 12\nassert digits_mod(474920) == 12\nassert digits_mod(61659) == 1\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 22", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 22\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 22.\nللتوضيح: الاستدعاء `digits_mod(53638)` يُرجع `1`.\nالجواب:", "qhash": "756b153e6b01cf16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return sum(1 for w in text.split() if 'م' in w)", "tests": ["assert tally_letter('سلام صديق سلام جمل ليل قهوة بحر تفاحة') == 3", "assert tally_letter('فجر مطر مطر مكتبة') == 3", "assert tally_letter('مكتبة صحراء سيارة برتقال رمل شمس') == 3", "assert tally_letter('') == 0", "assert tally_letter('لغة طالب فجر') == 0", "assert tally_letter('عربية حاسوب مدرسة شجرة') == 1", "assert tally_letter('حاسوب مدينة تفاحة كتاب حديقة دفتر') == 1", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('سلام صديق سلام جمل ليل قهوة بحر تفاحة') == 3\nassert tally_letter('فجر مطر مطر مكتبة') == 3\nassert tally_letter('مكتبة صحراء سيارة برتقال رمل شمس') == 3\nassert tally_letter('') == 0\nassert tally_letter('لغة طالب فجر') == 0\nassert tally_letter('عربية حاسوب مدرسة شجرة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «م» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('سلام صديق سلام جمل ليل قهوة بحر تفاحة')` يُرجع `3`.\nالجواب:", "qhash": "c678af1e1142a28e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 47751\ncount = 0\nwhile n > 15:\n n = n // 9\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 47751\ncount = 0\nwhile n > 15:\n n = n // 9\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "c9f4447124c2141d", "answer": "7 4", "completion": " الناتج:\n```text\n7 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -9 * x ** 2 + (1) * x + (-6)", "tests": ["assert poly(6) == -324", "assert poly(-13) == -1540", "assert poly(5) == -226", "assert poly(-8) == -590", "assert poly(-9) == -744", "assert poly(-12) == -1314", "assert poly(-11) == -1106", "assert poly(0) == -6"], "test_code": "assert poly(6) == -324\nassert poly(-13) == -1540\nassert poly(5) == -226\nassert poly(-8) == -590\nassert poly(-9) == -744\nassert poly(-12) == -1314\nassert poly(-11) == -1106\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)` تُرجع قيمة كثيرة الحدود -9x² + 1x - 6 عند العدد الصحيح x.\nمثال: `poly(6)` يجب أن تُرجع `-324`.\nالجواب:", "qhash": "b91f7a4e22064f48"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [6, 32, 25, 16, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [6, 32, 25, 16, 14]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "5b41803ddb737630", "answer": "[6, 14, 16, 25, 32]\n[32, 25, 16]", "completion": " الناتج:\n```text\n[6, 14, 16, 25, 32]\n[32, 25, 16]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert only_div([74, 82, 87, 46, 9, 2, 37, 5, 89, 36, 51]) == 1", "assert only_div([90, 11, 67, -12, 30, -13, 66]) == 0", "assert only_div([]) == 0", "assert only_div([27, -29, 28, 21, 70]) == 1", "assert only_div([-24, 73]) == 0", "assert only_div([87, 57, -15]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([74, 82, 87, 46, 9, 2, 37, 5, 89, 36, 51]) == 1\nassert only_div([90, 11, 67, -12, 30, -13, 66]) == 0\nassert only_div([]) == 0\nassert only_div([27, -29, 28, 21, 70]) == 1\nassert only_div([-24, 73]) == 0\nassert only_div([87, 57, -15]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count", "completion": " ```python\ndef only_div(xs):\n count = 0\n for x in xs:\n if x % 5 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([74, 82, 87, 46, 9, 2, 37, 5, 89, 36, 51])` يُرجع `1`.\nالجواب:", "qhash": "2c2bbe2f36730343"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'طائرة'\nprint(s[0])\nprint(s.find('ط'))\nprint(s.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'طائرة'\nprint(s[0])\nprint(s.find('ط'))\nprint(s.replace(' ', '-'))\n```\nالجواب:", "qhash": "493cb848de5423ea", "answer": "ط\n0\nطائرة", "completion": " الناتج:\n```text\nط\n0\nطائرة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([18, 7, 29, 11, 43, 2, 39, 11, 44]) == [18, 25, 54, 65, 108, 110, 0, 11, 55]", "assert capped_cumsum([94, 40, -3, 65]) == [94, 0, -3, 62]", "assert capped_cumsum([40, 113, 114, -7, 54, 48, 114, 91]) == [40, 0, 114, 107, 0, 48, 0, 91]", "assert capped_cumsum([11, 101, 23, 109, 44]) == [11, 112, 0, 109, 0]", "assert capped_cumsum([105, 2, 106, 97, 0, 21]) == [105, 107, 0, 97, 97, 0]", "assert capped_cumsum([25, 53, 0, 12, 36, 81, -10, 38, 52, 106]) == [25, 78, 78, 90, 0, 81, 71, 109, 0, 106]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([18, 7, 29, 11, 43, 2, 39, 11, 44]) == [18, 25, 54, 65, 108, 110, 0, 11, 55]\nassert capped_cumsum([94, 40, -3, 65]) == [94, 0, -3, 62]\nassert capped_cumsum([40, 113, 114, -7, 54, 48, 114, 91]) == [40, 0, 114, 107, 0, 48, 0, 91]\nassert capped_cumsum([11, 101, 23, 109, 44]) == [11, 112, 0, 109, 0]\nassert capped_cumsum([105, 2, 106, 97, 0, 21]) == [105, 107, 0, 97, 97, 0]\nassert capped_cumsum([25, 53, 0, 12, 36, 81, -10, 38, 52, 106]) == [25, 78, 78, 90, 0, 81, 71, 109, 0, 106]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 115:\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 > 115:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 115 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([18, 7, 29, 11, 43, 2, 39, 11, 44])` يُرجع `[18, 25, 54, 65, 108, 110, 0, 11, 55]`.\nالجواب:", "qhash": "010a069861c494e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "turn_list", "reference": "def turn_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "tests": ["assert turn_list([11, 22, 48, 27, 0, 24, 42, 30]) == [48, 27, 0, 24, 42, 30, 11, 22]", "assert turn_list([50, 15, -1, 45, -6, 14, 50, 34, 12, -8, 50]) == [50, 50, 15, -1, 45, -6, 14, 50, 34, 12, -8]", "assert turn_list([49, 24, 7, 9, 28, -5, -7, 17, 30, 35, 43]) == [43, 49, 24, 7, 9, 28, -5, -7, 17, 30, 35]", "assert turn_list([-1, 32, -9, -4, 10, 25, 3]) == [-4, 10, 25, 3, -1, 32, -9]", "assert turn_list([30]) == [30]", "assert turn_list([17, 43, 24, -4, 49, 18]) == [49, 18, 17, 43, 24, -4]", "assert turn_list([]) == []"], "test_code": "assert turn_list([11, 22, 48, 27, 0, 24, 42, 30]) == [48, 27, 0, 24, 42, 30, 11, 22]\nassert turn_list([50, 15, -1, 45, -6, 14, 50, 34, 12, -8, 50]) == [50, 50, 15, -1, 45, -6, 14, 50, 34, 12, -8]\nassert turn_list([49, 24, 7, 9, 28, -5, -7, 17, 30, 35, 43]) == [43, 49, 24, 7, 9, 28, -5, -7, 17, 30, 35]\nassert turn_list([-1, 32, -9, -4, 10, 25, 3]) == [-4, 10, 25, 3, -1, 32, -9]\nassert turn_list([30]) == [30]\nassert turn_list([17, 43, 24, -4, 49, 18]) == [49, 18, 17, 43, 24, -4]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]", "completion": " ```python\ndef turn_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef turn_list(items):\n if not items:\n return []\n k = 10 % len(items)\n return ____\n```\nمثال: `turn_list([11, 22, 48, 27, 0, 24, 42, 30])` يجب أن تُرجع `[48, 27, 0, 24, 42, 30, 11, 22]`.\nالجواب:", "qhash": "81e598cc40da8215"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'مريم': 5, 'هشام': 40, 'راشد': 14, 'ليلى': 8}\nd['هشام'] += 17\nd['وليد'] = 16\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 = {'مريم': 5, 'هشام': 40, 'راشد': 14, 'ليلى': 8}\nd['هشام'] += 17\nd['وليد'] = 16\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": "b0aedf3f8852ba07", "answer": "5\nهشام\n100\n[('مريم', 5), ('ليلى', 8)]", "completion": " الناتج:\n```text\n5\nهشام\n100\n[('مريم', 5), ('ليلى', 8)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor x in range(5, 17, 2):\n total -= x * 8\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor x in range(5, 17, 2):\n total -= x * 8\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "e0b635a2a3d9ac76", "answer": "-465\n15", "completion": " الناتج:\n```text\n-465\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(103) == 918", "assert multiples_total(209) == 3570", "assert multiples_total(15) == 18", "assert multiples_total(259) == 5676", "assert multiples_total(92) == 720", "assert multiples_total(192) == 2976", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(103) == 918\nassert multiples_total(209) == 3570\nassert multiples_total(15) == 18\nassert multiples_total(259) == 5676\nassert multiples_total(92) == 720\nassert multiples_total(192) == 2976\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 % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 12.\nمثال: `multiples_total(103)` يجب أن تُرجع `918`.\nالجواب:", "qhash": "2ef85ffbb06c2cf9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if w.startswith('ص'))", "tests": ["assert count_ar('مدينة شجرة صحراء ميناء وردة وردة') == 1", "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('مدينة شجرة صحراء ميناء وردة وردة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ص»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('مدينة شجرة صحراء ميناء وردة وردة')` يُرجع `1`.\nالجواب:", "qhash": "74425e1b09d0fae9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(8) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo']", "assert fizzbuzz(11) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11']", "assert fizzbuzz(22) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11', 'Foo', '13', 'FooBar', '15', 'Foo', '17', 'Foo', '19', 'Foo', 'Bar', 'Foo']", "assert fizzbuzz(11) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11']", "assert fizzbuzz(14) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11', 'Foo', '13', 'FooBar']"], "test_code": "assert fizzbuzz(8) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo']\nassert fizzbuzz(11) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11']\nassert fizzbuzz(22) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11', 'Foo', '13', 'FooBar', '15', 'Foo', '17', 'Foo', '19', 'Foo', 'Bar', 'Foo']\nassert fizzbuzz(11) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11']\nassert fizzbuzz(14) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo', '9', 'Foo', '11', 'Foo', '13', 'FooBar']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 7 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Foo'، وإن قَبِلها على 7 أضف 'Bar' (فيصبح 'FooBar' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(8)` يُرجع `['1', 'Foo', '3', 'Foo', '5', 'Foo', 'Bar', 'Foo']`.\nالجواب:", "qhash": "85164782dc756666"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['table', 'signal', 'vector', 'camel', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['table', 'signal', 'vector', 'camel', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "007624a5e7473bca", "answer": "['table', 'camel', 'signal', 'vector', 'winter']\n['winter', 'vector', 'signal']", "completion": " الناتج:\n```text\n['table', 'camel', 'signal', 'vector', 'winter']\n['winter', 'vector', 'signal']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 130:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([45, 44, 66, 4, 49, 68, 26, 60, 28]) == [45, 89, 0, 4, 53, 121, 0, 60, 88]", "assert reset_sum([115, 77, 17]) == [115, 0, 17]", "assert reset_sum([115, 126, 123, 56, 12, -9, 3]) == [115, 0, 123, 0, 12, 3, 6]", "assert reset_sum([]) == []", "assert reset_sum([]) == []", "assert reset_sum([115, 72, 7, 56, 49, 95]) == [115, 0, 7, 63, 112, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([45, 44, 66, 4, 49, 68, 26, 60, 28]) == [45, 89, 0, 4, 53, 121, 0, 60, 88]\nassert reset_sum([115, 77, 17]) == [115, 0, 17]\nassert reset_sum([115, 126, 123, 56, 12, -9, 3]) == [115, 0, 123, 0, 12, 3, 6]\nassert reset_sum([]) == []\nassert reset_sum([]) == []\nassert reset_sum([115, 72, 7, 56, 49, 95]) == [115, 0, 7, 63, 112, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 130:\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 > 130:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 130 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([45, 44, 66, 4, 49, 68, 26, 60, 28])` يُرجع `[45, 89, 0, 4, 53, 121, 0, 60, 88]`.\nالجواب:", "qhash": "892be90f99676d82"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * -1 + 5 for x in range(-1, 10) if x % 5 == 4]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * -1 + 5 for x in range(-1, 10) if x % 5 == 4]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "b29f45cbc21a4b47", "answer": "[6, 1, -4]\n3 3", "completion": " الناتج:\n```text\n[6, 1, -4]\n3 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "words = ['code', 'planet', 'signal', 'river', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nwords = ['code', 'planet', 'signal', 'river', 'engine']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "1252aac8639de574", "answer": "['code', 'river', 'planet', 'signal', 'engine']\n['signal', 'planet', 'engine']", "completion": " الناتج:\n```text\n['code', 'river', 'planet', 'signal', 'engine']\n['signal', 'planet', 'engine']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['orange', 'apple', 'pixel', 'engine', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['orange', 'apple', 'pixel', 'engine', 'data']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "4f577d54a6b46faa", "answer": "['data', 'apple', 'pixel', 'orange', 'engine']\n['orange', 'engine', 'pixel']", "completion": " الناتج:\n```text\n['data', 'apple', 'pixel', 'orange', 'engine']\n['orange', 'engine', 'pixel']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'camel'\nprint(word.capitalize())\nprint(word[::-1])\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'camel'\nprint(word.capitalize())\nprint(word[::-1])\nprint(len(word))\n```\nالجواب:", "qhash": "10f5983225c41822", "answer": "Camel\nlemac\n5", "completion": " الناتج:\n```text\nCamel\nlemac\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [33, 24, -2, 28, 24, 5, 10]\nprint(xs[1:7])\nprint(xs[::2])\nprint(max(xs[1:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [33, 24, -2, 28, 24, 5, 10]\nprint(xs[1:7])\nprint(xs[::2])\nprint(max(xs[1:7]))\n```\nالجواب:", "qhash": "12e72f2a47e0b641", "answer": "[24, -2, 28, 24, 5, 10]\n[33, -2, 24, 10]\n28", "completion": " الناتج:\n```text\n[24, -2, 28, 24, 5, 10]\n[33, -2, 24, 10]\n28\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=7):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(12))\nprint(g(12, -4))\nprint(g(g(-4), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=7):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(12))\nprint(g(12, -4))\nprint(g(g(-4), 12))\n```\nالجواب:", "qhash": "654dbda219d31f48", "answer": "29\n40\n39", "completion": " الناتج:\n```text\n29\n40\n39\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 9 != 0:\n count += 1\n return count", "tests": ["assert count_matching([39, 79, 37, 58, 89, 4, 11, 11, 55, 80, 19, 88]) == 3", "assert count_matching([2, 25]) == 0", "assert count_matching([-16, 68]) == 2", "assert count_matching([81, 86, 27, -6, -5, 52, -39, 81, -9, -4, 57, 12]) == 3", "assert count_matching([-30, 15, -21, 46, 58]) == 0", "assert count_matching([24]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([39, 79, 37, 58, 89, 4, 11, 11, 55, 80, 19, 88]) == 3\nassert count_matching([2, 25]) == 0\nassert count_matching([-16, 68]) == 2\nassert count_matching([81, 86, 27, -6, -5, 52, -39, 81, -9, -4, 57, 12]) == 3\nassert count_matching([-30, 15, -21, 46, 58]) == 0\nassert count_matching([24]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 4 == 0 and x % 9 != 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 % 9 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 9، ثم اكتب الدالة كاملة.\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([39, 79, 37, 58, 89, 4, 11, 11, 55, 80, 19, 88])` يجب أن تُرجع `3`.\nالجواب:", "qhash": "3bfe84f5e1f5d482"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('س'):\n count += 1\n return count", "tests": ["assert count_initial('ماء علم برمجة مدينة قمر دفتر') == 0", "assert count_initial('سلام سيارة سلام دفتر قهوة') == 3", "assert count_initial('حصان سلام مدرسة حديقة') == 1", "assert count_initial('مطر سوق نور') == 1", "assert count_initial('عربية برتقال كتاب') == 0", "assert count_initial('خبز شجرة سوق نهر وردة') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('ماء علم برمجة مدينة قمر دفتر') == 0\nassert count_initial('سلام سيارة سلام دفتر قهوة') == 3\nassert count_initial('حصان سلام مدرسة حديقة') == 1\nassert count_initial('مطر سوق نور') == 1\nassert count_initial('عربية برتقال كتاب') == 0\nassert count_initial('خبز شجرة سوق نهر وردة') == 1\nassert count_initial('') == 0", "answer": "def count_initial(line):\n count = 0\n for w in line.split():\n if w.startswith('س'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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 count_initial(line):\n count = 0\n for w in line:\n if w.startswith('س'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('ماء علم برمجة مدينة قمر دفتر')` يُرجع `0`.\nالجواب:", "qhash": "a958ed5d33b660c2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -2 * x ** 2 + (0) * x + (-6)", "tests": ["assert eval_poly(7) == -104", "assert eval_poly(0) == -6", "assert eval_poly(8) == -134", "assert eval_poly(14) == -398", "assert eval_poly(18) == -654", "assert eval_poly(-11) == -248", "assert eval_poly(-4) == -38", "assert eval_poly(0) == -6"], "test_code": "assert eval_poly(7) == -104\nassert eval_poly(0) == -6\nassert eval_poly(8) == -134\nassert eval_poly(14) == -398\nassert eval_poly(18) == -654\nassert eval_poly(-11) == -248\nassert eval_poly(-4) == -38\nassert eval_poly(0) == -6", "answer": "def eval_poly(x):\n return -2 * x ** 2 + (0) * x + (-6)", "completion": " ```python\ndef eval_poly(x):\n return -2 * x ** 2 + (0) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -2x² + 0x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(7)` يُرجع `-104`.\nالجواب:", "qhash": "f39377d895f334ec"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 88", "tests": ["assert pow_digits(95781) == 44", "assert pow_digits(169793) == 81", "assert pow_digits(828508) == 45", "assert pow_digits(992828) == 34", "assert pow_digits(12076) == 2", "assert pow_digits(478459) == 75", "assert pow_digits(653768) == 43", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(95781) == 44\nassert pow_digits(169793) == 81\nassert pow_digits(828508) == 45\nassert pow_digits(992828) == 34\nassert pow_digits(12076) == 2\nassert pow_digits(478459) == 75\nassert pow_digits(653768) == 43\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 88", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 2 for d in str(n)) % 88\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 2، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 88.\nللتوضيح: الاستدعاء `pow_digits(95781)` يُرجع `44`.\nالجواب:", "qhash": "5e6d1785b618970b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 33) == 1)", "tests": ["assert phi_upto(109) == 67", "assert phi_upto(0) == 0", "assert phi_upto(67) == 41", "assert phi_upto(68) == 42", "assert phi_upto(45) == 27", "assert phi_upto(190) == 115", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(109) == 67\nassert phi_upto(0) == 0\nassert phi_upto(67) == 41\nassert phi_upto(68) == 42\nassert phi_upto(45) == 27\nassert phi_upto(190) == 115\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, 33) == 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, 33) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 33، أي أن القاسم المشترك الأكبر لها مع 33 يساوي 1.\nمثال: `phi_upto(109)` يجب أن تُرجع `67`.\nالجواب:", "qhash": "cb94414c5be07be4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)", "tests": ["assert total_multiples(196) == 6762", "assert total_multiples(172) == 5124", "assert total_multiples(272) == 13039", "assert total_multiples(248) == 10966", "assert total_multiples(80) == 1138", "assert total_multiples(136) == 3294", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(196) == 6762\nassert total_multiples(172) == 5124\nassert total_multiples(272) == 13039\nassert total_multiples(248) == 10966\nassert total_multiples(80) == 1138\nassert total_multiples(136) == 3294\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 7.\nمثال: `total_multiples(196)` يجب أن تُرجع `6762`.\nالجواب:", "qhash": "73549eef14393d5a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 % 10 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(12) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12']", "assert label_numbers(24) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21', '22', '23', '24']", "assert label_numbers(22) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21', '22']", "assert label_numbers(16) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16']", "assert label_numbers(5) == ['1', '2', '3', '4', 'Red']"], "test_code": "assert label_numbers(12) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12']\nassert label_numbers(24) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21', '22', '23', '24']\nassert label_numbers(22) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16', '17', '18', '19', 'RedBlue', '21', '22']\nassert label_numbers(16) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12', '13', '14', 'Red', '16']\nassert label_numbers(5) == ['1', '2', '3', '4', 'Red']", "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 % 10 == 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 % 10 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Red'، وعلى 10 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(12)` يجب أن تُرجع `['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'RedBlue', '11', '12']`.\nالجواب:", "qhash": "30a519d769bfc6f3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "name = 'falcon'\nprint(name[-3:])\nprint(name.index('f') + len(name))\nprint(name.find('f'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nname = 'falcon'\nprint(name[-3:])\nprint(name.index('f') + len(name))\nprint(name.find('f'))\n```\nالجواب:", "qhash": "a32c8c50020b6957", "answer": "con\n6\n0", "completion": " الناتج:\n```text\ncon\n6\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "tests": ["assert total_pow(5) == 1125", "assert total_pow(14) == 55125", "assert total_pow(8) == 6480", "assert total_pow(8) == 6480", "assert total_pow(7) == 3920", "assert total_pow(1) == 5", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 1125\nassert total_pow(14) == 55125\nassert total_pow(8) == 6480\nassert total_pow(8) == 6480\nassert total_pow(7) == 3920\nassert total_pow(1) == 5\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 3\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef total_pow(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 3\n return total\n```\nمثال: `total_pow(5)` يجب أن تُرجع `1125`.\nالجواب:", "qhash": "17d18572c739d618"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('cloud OK') == 'nwzfo OK'", "assert cipher('camel is winter it go Hello') == 'nlxpw td htyepc te rz Hpwwz'", "assert cipher('in desert of A1') == 'ty opdpce zq A1'", "assert cipher('a on river Hello') == 'l zy ctgpc Hpwwz'", "assert cipher('summer rocket python of to') == 'dfxxpc cznvpe ajeszy zq ez'", "assert cipher('code cloud it') == 'nzop nwzfo te'", "assert cipher('') == ''"], "test_code": "assert cipher('cloud OK') == 'nwzfo OK'\nassert cipher('camel is winter it go Hello') == 'nlxpw td htyepc te rz Hpwwz'\nassert cipher('in desert of A1') == 'ty opdpce zq A1'\nassert cipher('a on river Hello') == 'l zy ctgpc Hpwwz'\nassert cipher('summer rocket python of to') == 'dfxxpc cznvpe ajeszy zq ez'\nassert cipher('code cloud it') == 'nzop nwzfo te'\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 + (-15)) % 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 + (-15)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('cloud OK')` يجب أن تُرجع `'nwzfo OK'`.\nالجواب:", "qhash": "7b6f46ddf7a221c9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_by([9, 25, 44, 42]) == [25, 44, 42, 9]", "assert rotate_by([22, 11]) == [11, 22]", "assert rotate_by([2, 33, 11]) == [2, 33, 11]", "assert rotate_by([-7, 11, 10, 17, 30, 48, 46, 11, 15, 0, 0]) == [15, 0, 0, -7, 11, 10, 17, 30, 48, 46, 11]", "assert rotate_by([35, 30, 50, 43, 15, 16, 49]) == [15, 16, 49, 35, 30, 50, 43]", "assert rotate_by([27, 1, 8, 17, 49]) == [8, 17, 49, 27, 1]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([9, 25, 44, 42]) == [25, 44, 42, 9]\nassert rotate_by([22, 11]) == [11, 22]\nassert rotate_by([2, 33, 11]) == [2, 33, 11]\nassert rotate_by([-7, 11, 10, 17, 30, 48, 46, 11, 15, 0, 0]) == [15, 0, 0, -7, 11, 10, 17, 30, 48, 46, 11]\nassert rotate_by([35, 30, 50, 43, 15, 16, 49]) == [15, 16, 49, 35, 30, 50, 43]\nassert rotate_by([27, 1, 8, 17, 49]) == [8, 17, 49, 27, 1]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return ____\n```\nمثال: `rotate_by([9, 25, 44, 42])` يجب أن تُرجع `[25, 44, 42, 9]`.\nالجواب:", "qhash": "4d2ed2d505daa769"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n <= 1:\n return 4\n return 2 * f(n - 1) + -1\n\nprint(f(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n <= 1:\n return 4\n return 2 * f(n - 1) + -1\n\nprint(f(4))\n```\nالجواب:", "qhash": "bb31ba70afc5c8dd", "answer": "25", "completion": " الناتج:\n```text\n25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'مدينة نهار'\nprint('ي' in kalima)\nprint(kalima[-1])\nprint(kalima.count('ي'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'مدينة نهار'\nprint('ي' in kalima)\nprint(kalima[-1])\nprint(kalima.count('ي'))\n```\nالجواب:", "qhash": "4b505e617c28ba49", "answer": "True\nر\n1", "completion": " الناتج:\n```text\nTrue\nر\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "text = 'فجر طالب'\nprint(text[::-1])\nprint(text.split())\nprint('ل' in text)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'فجر طالب'\nprint(text[::-1])\nprint(text.split())\nprint('ل' in text)\n```\nالجواب:", "qhash": "58b50c6fdaabd83d", "answer": "بلاط رجف\n['فجر', 'طالب']\nTrue", "completion": " الناتج:\n```text\nبلاط رجف\n['فجر', 'طالب']\nTrue\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 2) // 4 for x in range(-1, 4) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 2) // 4 for x in range(-1, 4) if x % 4 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "8359a27a0986589e", "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": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 1) // 2 for x in range(6, 19) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 1) // 2 for x in range(6, 19) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "6a6343cff49ecf19", "answer": "[3, 4, 5, 6, 7, 8, 9]\n7 42", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7, 8, 9]\n7 42\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_count", "reference": "def letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ب'))", "tests": ["assert letter_count('برمجة وردة حديقة سوق ليل جبل') == 1", "assert letter_count('') == 0", "assert letter_count('سوق سفينة دفتر مدينة مدينة صديق نهر') == 0", "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('سوق سفينة دفتر مدينة مدينة صديق نهر') == 0\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 sum(1 for w in text.split() if w.startswith('ب'))", "completion": " ```python\ndef letter_count(text):\n return sum(1 for w in text.split() if w.startswith('ب'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_count(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ب».\nمثال: `letter_count('برمجة وردة حديقة سوق ليل جبل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "60a9e335a66253eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 45:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([18, 3, 25, 10, 19, 27, 23]) == [18, 21, 0, 10, 29, 0, 23]", "assert acc_reset([44, -10, 11, 21, 5, 30, 35, 37, 7, 7]) == [44, 34, 45, 0, 5, 35, 0, 37, 44, 0]", "assert acc_reset([20, 15, -5, 39, 32, 12, 23]) == [20, 35, 30, 0, 32, 44, 0]", "assert acc_reset([15, 34, 36]) == [15, 0, 36]", "assert acc_reset([]) == []", "assert acc_reset([11, 41, 40, 9, 5, 20, 12, -2]) == [11, 0, 40, 0, 5, 25, 37, 35]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([18, 3, 25, 10, 19, 27, 23]) == [18, 21, 0, 10, 29, 0, 23]\nassert acc_reset([44, -10, 11, 21, 5, 30, 35, 37, 7, 7]) == [44, 34, 45, 0, 5, 35, 0, 37, 44, 0]\nassert acc_reset([20, 15, -5, 39, 32, 12, 23]) == [20, 35, 30, 0, 32, 44, 0]\nassert acc_reset([15, 34, 36]) == [15, 0, 36]\nassert acc_reset([]) == []\nassert acc_reset([11, 41, 40, 9, 5, 20, 12, -2]) == [11, 0, 40, 0, 5, 25, 37, 35]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 45:\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 > 45:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 45 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([18, 3, 25, 10, 19, 27, 23])` يجب أن تُرجع `[18, 21, 0, 10, 29, 0, 23]`.\nالجواب:", "qhash": "dc924c0483335152"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'عمر': 26, 'باسل': 30, 'وليد': 47, 'فيصل': 22, 'يوسف': 2}\npoints['وليد'] += 8\npoints['علي'] = 23\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'عمر': 26, 'باسل': 30, 'وليد': 47, 'فيصل': 22, 'يوسف': 2}\npoints['وليد'] += 8\npoints['علي'] = 23\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 16])\n```\nالجواب:", "qhash": "bb9112c32726db90", "answer": "6\nوليد\n158\n['عمر', 'باسل', 'وليد', 'فيصل', 'علي']", "completion": " الناتج:\n```text\n6\nوليد\n158\n['عمر', 'باسل', 'وليد', 'فيصل', 'علي']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [15, 5, 28, 11, 4, -1]\nprint(nums[1:5])\nprint(nums[::3])\nprint(len(nums[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [15, 5, 28, 11, 4, -1]\nprint(nums[1:5])\nprint(nums[::3])\nprint(len(nums[1:5]))\n```\nالجواب:", "qhash": "2c018200d4d8524e", "answer": "[5, 28, 11, 4]\n[15, 11]\n4", "completion": " الناتج:\n```text\n[5, 28, 11, 4]\n[15, 11]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "poly", "reference": "def poly(x):\n return 7 * x ** 2 + (4) * x + (9)", "tests": ["assert poly(10) == 749", "assert poly(4) == 137", "assert poly(-12) == 969", "assert poly(-18) == 2205", "assert poly(-11) == 812", "assert poly(-8) == 425", "assert poly(-10) == 669", "assert poly(0) == 9"], "test_code": "assert poly(10) == 749\nassert poly(4) == 137\nassert poly(-12) == 969\nassert poly(-18) == 2205\nassert poly(-11) == 812\nassert poly(-8) == 425\nassert poly(-10) == 669\nassert poly(0) == 9", "answer": "def poly(x):\n return 7 * x ** 2 + (4) * x + (9)", "completion": " ```python\ndef poly(x):\n return 7 * x ** 2 + (4) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `poly(x)` تحسب المقدار 7x² + 4x + 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `poly(10)` يُرجع `749`.\nالجواب:", "qhash": "8d0e08166cb065cb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-6, -8, -2, 22, 21, -8, -8, 15]\nprint(sorted(nums, key=lambda x: (abs(x - 13), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-6, -8, -2, 22, 21, -8, -8, 15]\nprint(sorted(nums, key=lambda x: (abs(x - 13), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ebf0131c039f8456", "answer": "[15, 21, 22, -2, -6, -8, -8, -8]\n[22, 21, 15]", "completion": " الناتج:\n```text\n[15, 21, 22, -2, -6, -8, -8, -8]\n[22, 21, 15]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('planet summer of window data') == 'sodqhw vxpphu ri zlqgrz gdwd'", "assert shift_letters('vector window brain music summer') == 'yhfwru zlqgrz eudlq pxvlf vxpphu'", "assert shift_letters('apple summer in') == 'dssoh vxpphu lq'", "assert shift_letters('table up OK') == 'wdeoh xs OK'", "assert shift_letters('matrix garden planet river !') == 'pdwula jdughq sodqhw ulyhu !'", "assert shift_letters('data Hello') == 'gdwd Hhoor'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet summer of window data') == 'sodqhw vxpphu ri zlqgrz gdwd'\nassert shift_letters('vector window brain music summer') == 'yhfwru zlqgrz eudlq pxvlf vxpphu'\nassert shift_letters('apple summer in') == 'dssoh vxpphu lq'\nassert shift_letters('table up OK') == 'wdeoh xs OK'\nassert shift_letters('matrix garden planet river !') == 'pdwula jdughq sodqhw ulyhu !'\nassert shift_letters('data Hello') == 'gdwd Hhoor'\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 + (-23)) % 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 + (-23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('planet summer of window data')` يُرجع `'sodqhw vxpphu ri zlqgrz gdwd'`.\nالجواب:", "qhash": "9bf67f898d277307"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('امل مدرسة امل باب قمر بحر مدرسة سوق') == 2", "assert count_start('عربية طائرة لغة شجرة رمل نور امل') == 1", "assert count_start('لغة قلم امل امل') == 2", "assert count_start('سوق امل معلم ماء فجر عربية ميناء امل') == 2", "assert count_start('سفينة ميناء') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('معلم طائرة امل امل') == 2\nassert count_start('امل مدرسة امل باب قمر بحر مدرسة سوق') == 2\nassert count_start('عربية طائرة لغة شجرة رمل نور امل') == 1\nassert count_start('لغة قلم امل امل') == 2\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": "70e1a1f4a9afe35d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'stone'\nprint(s.capitalize())\nprint(s.index('t') + len(s))\nprint(s.replace('t', '*'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'stone'\nprint(s.capitalize())\nprint(s.index('t') + len(s))\nprint(s.replace('t', '*'))\n```\nالجواب:", "qhash": "1ef465de9228382e", "answer": "Stone\n6\ns*one", "completion": " الناتج:\n```text\nStone\n6\ns*one\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(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 largest_div([14, 29, 60, -16, 60, 22]) == 60", "assert largest_div([-9, -15, -12]) == -9", "assert largest_div([1, 4, 7]) == None", "assert largest_div([]) == None", "assert largest_div([33, -42, -16, -45]) == 33", "assert largest_div([]) == None"], "test_code": "assert largest_div([14, 29, 60, -16, 60, 22]) == 60\nassert largest_div([-9, -15, -12]) == -9\nassert largest_div([1, 4, 7]) == None\nassert largest_div([]) == None\nassert largest_div([33, -42, -16, -45]) == 33\nassert largest_div([]) == None", "answer": "def largest_div(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 largest_div(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 largest_div(nums):\n best = 0\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 largest_div(nums):\n best = 0\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للتوضيح: الاستدعاء `largest_div([14, 29, 60, -16, 60, 22])` يُرجع `60`.\nالجواب:", "qhash": "678fa1bd01d7f4e2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "tests": ["assert power_sum(8) == 679536", "assert power_sum(10) == 2429075", "assert power_sum(8) == 679536", "assert power_sum(10) == 2429075", "assert power_sum(11) == 4200636", "assert power_sum(1) == 11", "assert power_sum(0) == 0"], "test_code": "assert power_sum(8) == 679536\nassert power_sum(10) == 2429075\nassert power_sum(8) == 679536\nassert power_sum(10) == 2429075\nassert power_sum(11) == 4200636\nassert power_sum(1) == 11\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 11 * i ** 5\n return total", "completion": " ```python\ndef power_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 power_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 11 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef power_sum(n):\n total = 0\n for i in range(0, n):\n total += 11 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `power_sum(8)` يُرجع `679536`.\nالجواب:", "qhash": "e7e5abe4cc3b8347"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if 'ب' in w)", "tests": ["assert count_hits('باب وردة برتقال بحر قهوة مدينة') == 3", "assert count_hits('برتقال صحراء ماء ميناء تفاحة وردة قمر') == 1", "assert count_hits('سفينة صديق خبز لغة نهر برتقال حصان نهار') == 2", "assert count_hits('خبز سوق') == 1", "assert count_hits('شمس بيت كتاب عمل سماء عربية بحر طالب') == 5", "assert count_hits('باب شجرة تفاحة') == 1", "assert count_hits('سماء كتاب') == 1", "assert count_hits('') == 0"], "test_code": "assert count_hits('باب وردة برتقال بحر قهوة مدينة') == 3\nassert count_hits('برتقال صحراء ماء ميناء تفاحة وردة قمر') == 1\nassert count_hits('سفينة صديق خبز لغة نهر برتقال حصان نهار') == 2\nassert count_hits('خبز سوق') == 1\nassert count_hits('شمس بيت كتاب عمل سماء عربية بحر طالب') == 5\nassert count_hits('باب شجرة تفاحة') == 1\nassert count_hits('سماء كتاب') == 1\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('باب وردة برتقال بحر قهوة مدينة')` يجب أن تُرجع `3`.\nالجواب:", "qhash": "b1f862b85ae0c59f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [5, 27, -11, 32, 0]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [5, 27, -11, 32, 0]\nprint(sorted(nums, key=lambda x: (abs(x - 24), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "11578a7d764b0478", "answer": "[27, 32, 5, 0, -11]\n[32, 27, 5]", "completion": " الناتج:\n```text\n[27, 32, 5, 0, -11]\n[32, 27, 5]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'signal'\nprint(name.index('g') + len(name))\nprint(name[3:4])\nprint(name.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'signal'\nprint(name.index('g') + len(name))\nprint(name[3:4])\nprint(name.split('_'))\n```\nالجواب:", "qhash": "7629149cde9f0c5c", "answer": "8\nn\n['signal']", "completion": " الناتج:\n```text\n8\nn\n['signal']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([-16, 7, -13, 39, -3]) == None", "assert max_of_div([-15, -5, -10]) == -5", "assert max_of_div([1]) == None", "assert max_of_div([28, 21]) == None", "assert max_of_div([-13, 39, -5, 45, 15]) == 45", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-16, 7, -13, 39, -3]) == None\nassert max_of_div([-15, -5, -10]) == -5\nassert max_of_div([1]) == None\nassert max_of_div([28, 21]) == None\nassert max_of_div([-13, 39, -5, 45, 15]) == 45\nassert max_of_div([]) == None", "answer": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 5 == 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 % 5 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_of_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([-16, 7, -13, 39, -3])` يُرجع `None`.\nالجواب:", "qhash": "2f6205f506ab142c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'banana'\nprint(s.upper())\nprint(s.index('b') + len(s))\nprint(s[3:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'banana'\nprint(s.upper())\nprint(s.index('b') + len(s))\nprint(s[3:4])\n```\nالجواب:", "qhash": "9473c8728a7e7afe", "answer": "BANANA\n6\na", "completion": " الناتج:\n```text\nBANANA\n6\na\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(4))\nprint(h(4, -5))\nprint(h(h(-5), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(4))\nprint(h(4, -5))\nprint(h(h(-5), 4))\n```\nالجواب:", "qhash": "3f22e8368e1989cb", "answer": "35\n41\n40", "completion": " الناتج:\n```text\n35\n41\n40\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 88724\ncount = 0\nwhile n > 6:\n n = n // 3\n count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 88724\ncount = 0\nwhile n > 6:\n n = n // 3\n count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "fa694dace8f27511", "answer": "4 9", "completion": " الناتج:\n```text\n4 9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'لغة'\nprint(s.count('ة'))\nprint(s.split())\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'لغة'\nprint(s.count('ة'))\nprint(s.split())\nprint(s[-1])\n```\nالجواب:", "qhash": "1ab06bc5ed7febfc", "answer": "1\n['لغة']\nة", "completion": " الناتج:\n```text\n1\n['لغة']\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 33\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 = 33\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": "b205839b24b3a1b4", "answer": "26", "completion": " الناتج:\n```text\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 41) == 1)", "tests": ["assert coprimes(19) == 19", "assert coprimes(134) == 131", "assert coprimes(181) == 177", "assert coprimes(40) == 40", "assert coprimes(40) == 40", "assert coprimes(66) == 65", "assert coprimes(1) == 1"], "test_code": "assert coprimes(19) == 19\nassert coprimes(134) == 131\nassert coprimes(181) == 177\nassert coprimes(40) == 40\nassert coprimes(40) == 40\nassert coprimes(66) == 65\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, 41) == 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, 41) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 41) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(19)` يُرجع `19`.\nالجواب:", "qhash": "95d3e3f820873a58"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'es'}", "tests": ["assert freq_of('window go falcon is') == {'e': 0, 's': 1}", "assert freq_of('coffee') == {'e': 2, 's': 0}", "assert freq_of('by stone summer desert garden engine') == {'e': 7, 's': 3}", "assert freq_of('brain') == {'e': 0, 's': 0}", "assert freq_of('desert vector at desert to camel') == {'e': 6, 's': 2}", "assert freq_of('brain at on pixel') == {'e': 1, 's': 0}", "assert freq_of('') == {'e': 0, 's': 0}"], "test_code": "assert freq_of('window go falcon is') == {'e': 0, 's': 1}\nassert freq_of('coffee') == {'e': 2, 's': 0}\nassert freq_of('by stone summer desert garden engine') == {'e': 7, 's': 3}\nassert freq_of('brain') == {'e': 0, 's': 0}\nassert freq_of('desert vector at desert to camel') == {'e': 6, 's': 2}\nassert freq_of('brain at on pixel') == {'e': 1, 's': 0}\nassert freq_of('') == {'e': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'es'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'es'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 's' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('window go falcon is')` يُرجع `{'e': 0, 's': 1}`.\nالجواب:", "qhash": "d97791f3f098a0f9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 44) == 1)", "tests": ["assert rel_prime_count(140) == 64", "assert rel_prime_count(133) == 61", "assert rel_prime_count(115) == 53", "assert rel_prime_count(162) == 74", "assert rel_prime_count(88) == 40", "assert rel_prime_count(101) == 46", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(140) == 64\nassert rel_prime_count(133) == 61\nassert rel_prime_count(115) == 53\nassert rel_prime_count(162) == 74\nassert rel_prime_count(88) == 40\nassert rel_prime_count(101) == 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, 44) == 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, 44) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 44) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(140)` يُرجع `64`.\nالجواب:", "qhash": "85c17c1f5735ea5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [0, 32, 29, 11, 9, 26, 39]\nprint(nums[1:5])\nprint(nums[::3])\nprint(len(nums[1:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [0, 32, 29, 11, 9, 26, 39]\nprint(nums[1:5])\nprint(nums[::3])\nprint(len(nums[1:5]))\n```\nالجواب:", "qhash": "66ea21a0ab879494", "answer": "[32, 29, 11, 9]\n[0, 11, 39]\n4", "completion": " الناتج:\n```text\n[32, 29, 11, 9]\n[0, 11, 39]\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'orange'\nprint(word.upper())\nprint(word.count('n'))\nprint(word.replace('n', '0'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'orange'\nprint(word.upper())\nprint(word.count('n'))\nprint(word.replace('n', '0'))\n```\nالجواب:", "qhash": "58633d80ca31bab8", "answer": "ORANGE\n1\nora0ge", "completion": " الناتج:\n```text\nORANGE\n1\nora0ge\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'signal'\nprint(word[::-1])\nprint(word.index('l') + len(word))\nprint(word.upper())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'signal'\nprint(word[::-1])\nprint(word.index('l') + len(word))\nprint(word.upper())\n```\nالجواب:", "qhash": "1e4cb68868eeebf4", "answer": "langis\n11\nSIGNAL", "completion": " الناتج:\n```text\nlangis\n11\nSIGNAL\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "count_initial", "reference": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ل'):\n count += 1\n return count", "tests": ["assert count_initial('برتقال صديق ليل برتقال سوق مدرسة بحر') == 1", "assert count_initial('فجر ليل جمل قمر كتاب نور لغة فجر') == 2", "assert count_initial('ليل حصان ليل باب') == 2", "assert count_initial('لغة باب صديق كتاب معلم باب') == 1", "assert count_initial('برتقال عربية لغة قلم برتقال جبل باب') == 1", "assert count_initial('ميناء ليل قمر') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('برتقال صديق ليل برتقال سوق مدرسة بحر') == 1\nassert count_initial('فجر ليل جمل قمر كتاب نور لغة فجر') == 2\nassert count_initial('ليل حصان ليل باب') == 2\nassert count_initial('لغة باب صديق كتاب معلم باب') == 1\nassert count_initial('برتقال عربية لغة قلم برتقال جبل باب') == 1\nassert count_initial('ميناء ليل قمر') == 1\nassert count_initial('') == 0", "answer": "def count_initial(text):\n count = 0\n for w in text.split():\n if w.startswith('ل'):\n count += 1\n return count", "completion": " ```python\ndef count_initial(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_initial(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_initial(text):\n count = 0\n for w in text.split():\n if w.endswith('ل'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `count_initial('برتقال صديق ليل برتقال سوق مدرسة بحر')` يُرجع `1`.\nالجواب:", "qhash": "6e9f986394b91d6a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(68) == 392", "assert sum_multiples(88) == 699", "assert sum_multiples(211) == 4038", "assert sum_multiples(109) == 1094", "assert sum_multiples(219) == 4254", "assert sum_multiples(205) == 3621", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(68) == 392\nassert sum_multiples(88) == 699\nassert sum_multiples(211) == 4038\nassert sum_multiples(109) == 1094\nassert sum_multiples(219) == 4254\nassert sum_multiples(205) == 3621\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 % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 9 أو من مضاعفات 14، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_multiples(68)` يُرجع `392`.\nالجواب:", "qhash": "f873d6aee3a444b1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('camel up up camel falcon data by') == 'falcon_camel_camel'", "assert flip_words('signal banana an') == 'banana_signal'", "assert flip_words('garden summer falcon summer') == 'summer_falcon_summer_garden'", "assert flip_words('by an rocket code orange apple up') == 'apple_orange_rocket'", "assert flip_words('of code') == ''", "assert flip_words('vector') == 'vector'", "assert flip_words('in river winter vector music camel on') == 'camel_music_vector_winter_river'"], "test_code": "assert flip_words('camel up up camel falcon data by') == 'falcon_camel_camel'\nassert flip_words('signal banana an') == 'banana_signal'\nassert flip_words('garden summer falcon summer') == 'summer_falcon_summer_garden'\nassert flip_words('by an rocket code orange apple up') == 'apple_orange_rocket'\nassert flip_words('of code') == ''\nassert flip_words('vector') == 'vector'\nassert flip_words('in river winter vector music camel on') == 'camel_music_vector_winter_river'", "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('camel up up camel falcon data by')` يجب أن تُرجع `'falcon_camel_camel'`.\nالجواب:", "qhash": "741949ce4ad1ead3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def f(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(f(-5))\nprint(f(-5, -3))\nprint(f(f(-3), -5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(x, y=6):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(f(-5))\nprint(f(-5, -3))\nprint(f(f(-3), -5))\n```\nالجواب:", "qhash": "bcb784b1489bfc93", "answer": "-35\n10\n-8", "completion": " الناتج:\n```text\n-35\n10\n-8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x ** 2 - 3 for x in range(0, 5) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x ** 2 - 3 for x in range(0, 5) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "be9a2ea71fad0f8e", "answer": "[-3, 6]\n2 3", "completion": " الناتج:\n```text\n[-3, 6]\n2 3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 10 for x in range(0, 13) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 10 for x in range(0, 13) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "332b47344196cdca", "answer": "[-10, -1, 26, 71, 134]\n5 220", "completion": " الناتج:\n```text\n[-10, -1, 26, 71, 134]\n5 220\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 6\nfor x in range(-2, 23, 4):\n result -= x * 5\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 6\nfor x in range(-2, 23, 4):\n result -= x * 5\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "6d10ec4999316822", "answer": "-344\n22", "completion": " الناتج:\n```text\n-344\n22\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_multiple", "reference": "def max_multiple(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 max_multiple([37, 43, 44, 21, 13, 3, 38, 17, 51]) == 21", "assert max_multiple([-28, -21, -7]) == -7", "assert max_multiple([1]) == None", "assert max_multiple([-7, 37, -34, -2, 36, 22, -12, -26]) == -7", "assert max_multiple([-14, -4, -31, 18, -19, 31, -10, 14]) == 14", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([37, 43, 44, 21, 13, 3, 38, 17, 51]) == 21\nassert max_multiple([-28, -21, -7]) == -7\nassert max_multiple([1]) == None\nassert max_multiple([-7, 37, -34, -2, 36, 22, -12, -26]) == -7\nassert max_multiple([-14, -4, -31, 18, -19, 31, -10, 14]) == 14\nassert max_multiple([]) == None", "answer": "def max_multiple(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 max_multiple(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 max_multiple(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_multiple(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للتوضيح: الاستدعاء `max_multiple([37, 43, 44, 21, 13, 3, 38, 17, 51])` يُرجع `21`.\nالجواب:", "qhash": "11849c016bfd2f96"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "a = [14, -1, 28, 7, 15, 17, 8, 12]\nprint(a[0:2])\nprint(a[::-1])\nprint(min(a[0:2]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\na = [14, -1, 28, 7, 15, 17, 8, 12]\nprint(a[0:2])\nprint(a[::-1])\nprint(min(a[0:2]))\n```\nالجواب:", "qhash": "cd7d38e35bcc5181", "answer": "[14, -1]\n[12, 8, 17, 15, 7, 28, -1, 14]\n-1", "completion": " الناتج:\n```text\n[14, -1]\n[12, 8, 17, 15, 7, 28, -1, 14]\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 4", "tests": ["assert dig_pow_mod(82525) == 2", "assert dig_pow_mod(71090) == 3", "assert dig_pow_mod(484112) == 2", "assert dig_pow_mod(681579) == 0", "assert dig_pow_mod(448105) == 2", "assert dig_pow_mod(507596) == 0", "assert dig_pow_mod(253771) == 1", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(82525) == 2\nassert dig_pow_mod(71090) == 3\nassert dig_pow_mod(484112) == 2\nassert dig_pow_mod(681579) == 0\nassert dig_pow_mod(448105) == 2\nassert dig_pow_mod(507596) == 0\nassert dig_pow_mod(253771) == 1\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 4", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 4\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 4.\nمثال: `dig_pow_mod(82525)` يجب أن تُرجع `2`.\nالجواب:", "qhash": "a4c1737cb8096de0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(19))\nprint(compute(19, 14))\nprint(compute(compute(14), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=5):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(compute(19))\nprint(compute(19, 14))\nprint(compute(compute(14), 19))\n```\nالجواب:", "qhash": "48a2aa37912e21e5", "answer": "147\n138\n837", "completion": " الناتج:\n```text\n147\n138\n837\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "p", "reference": "def p(x):\n return 1 * x ** 2 + (9) * x + (0)", "tests": ["assert p(9) == 162", "assert p(-13) == 52", "assert p(11) == 220", "assert p(-5) == -20", "assert p(20) == 580", "assert p(13) == 286", "assert p(-6) == -18", "assert p(0) == 0"], "test_code": "assert p(9) == 162\nassert p(-13) == 52\nassert p(11) == 220\nassert p(-5) == -20\nassert p(20) == 580\nassert p(13) == 286\nassert p(-6) == -18\nassert p(0) == 0", "answer": "def p(x):\n return 1 * x ** 2 + (9) * x + (0)", "completion": " ```python\ndef p(x):\n return 1 * x ** 2 + (9) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `p(x)` تحسب المقدار 1x² + 9x + 0 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `p(9)` يُرجع `162`.\nالجواب:", "qhash": "28931d9b294ff064"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total", "tests": ["assert scaled_powers(3) == 84", "assert scaled_powers(3) == 84", "assert scaled_powers(9) == 1710", "assert scaled_powers(2) == 30", "assert scaled_powers(2) == 30", "assert scaled_powers(1) == 6", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(3) == 84\nassert scaled_powers(3) == 84\nassert scaled_powers(9) == 1710\nassert scaled_powers(2) == 30\nassert scaled_powers(2) == 30\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 ** 2\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 6 * i ** 2\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 6 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 6 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(3)` يُرجع `84`.\nالجواب:", "qhash": "12f21ca26963c6a5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if 10 <= x <= 46)", "tests": ["assert clip_scale([28, 48, 54, 52, 50, 7, 53, 26, 55]) == [130, 140]", "assert clip_scale([-7, 12, -10, -14, -27, 21, 27, -26, -29, 16]) == [60, 80, 105, 135]", "assert clip_scale([12, 36, 48, 2, -9, 46, -26, 1, 10]) == [50, 60, 180, 230]", "assert clip_scale([-26]) == []", "assert clip_scale([56, 6]) == []", "assert clip_scale([5, 15, 10]) == [50, 75]", "assert clip_scale([9, 58, -15, -30, 16]) == [80]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([28, 48, 54, 52, 50, 7, 53, 26, 55]) == [130, 140]\nassert clip_scale([-7, 12, -10, -14, -27, 21, 27, -26, -29, 16]) == [60, 80, 105, 135]\nassert clip_scale([12, 36, 48, 2, -9, 46, -26, 1, 10]) == [50, 60, 180, 230]\nassert clip_scale([-26]) == []\nassert clip_scale([56, 6]) == []\nassert clip_scale([5, 15, 10]) == [50, 75]\nassert clip_scale([9, 58, -15, -30, 16]) == [80]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if 10 <= x <= 46)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 5 for x in xs if 10 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و46 (شاملًا الطرفين) في 5.\nمثال: `clip_scale([28, 48, 54, 52, 50, 7, 53, 26, 55])` يجب أن تُرجع `[130, 140]`.\nالجواب:", "qhash": "048b427cf0194682"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(601891724))\nprint(calc(calc(601891724)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(601891724))\nprint(calc(calc(601891724)))\n```\nالجواب:", "qhash": "6413ae0f842e5348", "answer": "38\n11", "completion": " الناتج:\n```text\n38\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([10, 8, 8, 9, 11, 5, 7]) == [8, 9, 11, 5, 7, 10, 8]", "assert shift_list([42]) == [42]", "assert shift_list([8, 33, 27, 26, -8, 47]) == [8, 33, 27, 26, -8, 47]", "assert shift_list([-5, 5, 47, 33, 27, 3, -7, 33, -4, 25, 32, 45]) == [-5, 5, 47, 33, 27, 3, -7, 33, -4, 25, 32, 45]", "assert shift_list([10, 23, 8, 8, 33, 34, 17]) == [8, 8, 33, 34, 17, 10, 23]", "assert shift_list([17, 6, -6, 14, -2, 50, 41, 12, 45, 7]) == [45, 7, 17, 6, -6, 14, -2, 50, 41, 12]", "assert shift_list([]) == []"], "test_code": "assert shift_list([10, 8, 8, 9, 11, 5, 7]) == [8, 9, 11, 5, 7, 10, 8]\nassert shift_list([42]) == [42]\nassert shift_list([8, 33, 27, 26, -8, 47]) == [8, 33, 27, 26, -8, 47]\nassert shift_list([-5, 5, 47, 33, 27, 3, -7, 33, -4, 25, 32, 45]) == [-5, 5, 47, 33, 27, 3, -7, 33, -4, 25, 32, 45]\nassert shift_list([10, 23, 8, 8, 33, 34, 17]) == [8, 8, 33, 34, 17, 10, 23]\nassert shift_list([17, 6, -6, 14, -2, 50, 41, 12, 45, 7]) == [45, 7, 17, 6, -6, 14, -2, 50, 41, 12]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n if not xs:\n return []\n k = 12 % 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 = 12 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(xs):\n if not xs:\n return []\n k = 12 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([10, 8, 8, 9, 11, 5, 7])` يُرجع `[8, 9, 11, 5, 7, 10, 8]`.\nالجواب:", "qhash": "06095a9a55c6301d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('rocket window pixel we') == 'we|pixel|window|rocket'", "assert mirror_words('light matrix') == 'matrix|light'", "assert mirror_words('table') == 'table'", "assert mirror_words('') == ''", "assert mirror_words('is music vector by coffee window') == 'window|coffee|by|vector|music|is'", "assert mirror_words('signal') == 'signal'", "assert mirror_words('coffee on an we cloud is') == 'is|cloud|we|an|on|coffee'"], "test_code": "assert mirror_words('rocket window pixel we') == 'we|pixel|window|rocket'\nassert mirror_words('light matrix') == 'matrix|light'\nassert mirror_words('table') == 'table'\nassert mirror_words('') == ''\nassert mirror_words('is music vector by coffee window') == 'window|coffee|by|vector|music|is'\nassert mirror_words('signal') == 'signal'\nassert mirror_words('coffee on an we cloud is') == 'is|cloud|we|an|on|coffee'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '|'.\nللتوضيح: الاستدعاء `mirror_words('rocket window pixel we')` يُرجع `'we|pixel|window|rocket'`.\nالجواب:", "qhash": "91a4547728845d68"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x * 5 + -9 for x in range(1, 15) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x * 5 + -9 for x in range(1, 15) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "85b63b51c88facb3", "answer": "[11, 36, 61]\n3 108", "completion": " الناتج:\n```text\n[11, 36, 61]\n3 108\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'هدى': 19, 'يوسف': 46, 'راشد': 14, 'أحمد': 11, 'نور': 32}\nmarks['راشد'] += 3\nmarks['وليد'] = 24\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 = {'هدى': 19, 'يوسف': 46, 'راشد': 14, 'أحمد': 11, 'نور': 32}\nmarks['راشد'] += 3\nmarks['وليد'] = 24\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": "869c56ab1ed8bc07", "answer": "6\nيوسف\n149\n[('أحمد', 11), ('راشد', 17)]", "completion": " الناتج:\n```text\n6\nيوسف\n149\n[('أحمد', 11), ('راشد', 17)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 17", "tests": ["assert sum_digit_pow(68035) == 15", "assert sum_digit_pow(127579) == 5", "assert sum_digit_pow(504491) == 3", "assert sum_digit_pow(239211) == 15", "assert sum_digit_pow(576991) == 1", "assert sum_digit_pow(826066) == 6", "assert sum_digit_pow(224806) == 5", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(68035) == 15\nassert sum_digit_pow(127579) == 5\nassert sum_digit_pow(504491) == 3\nassert sum_digit_pow(239211) == 15\nassert sum_digit_pow(576991) == 1\nassert sum_digit_pow(826066) == 6\nassert sum_digit_pow(224806) == 5\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 17", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 2 for d in str(n)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 17.\nمثال: `sum_digit_pow(68035)` يجب أن تُرجع `15`.\nالجواب:", "qhash": "fcf7eb0b5cfb91a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(g(3))\nprint(g(3, 1))\nprint(g(g(1), 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=1):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(g(3))\nprint(g(3, 1))\nprint(g(g(1), 3))\n```\nالجواب:", "qhash": "e4a12728eafd1daa", "answer": "26\n26\n87", "completion": " الناتج:\n```text\n26\n26\n87\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [7, 13, 30, 30, 13]\nprint(xs[2:3])\nprint(xs[::-1])\nprint(len(xs[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [7, 13, 30, 30, 13]\nprint(xs[2:3])\nprint(xs[::-1])\nprint(len(xs[2:3]))\n```\nالجواب:", "qhash": "cccf01f0de010f5b", "answer": "[30]\n[13, 30, 30, 13, 7]\n1", "completion": " الناتج:\n```text\n[30]\n[13, 30, 30, 13, 7]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 195:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([22, 82, 80, 17, 81, 67, 46, 102, 72]) == [22, 104, 184, 0, 81, 148, 194, 0, 72]", "assert cumulative([81, 74, 116, 85, 129, 48, 7]) == [81, 155, 0, 85, 0, 48, 55]", "assert cumulative([34, 103]) == [34, 137]", "assert cumulative([93, 131, 179, 24, 26, 149, 148, 93]) == [93, 0, 179, 0, 26, 175, 0, 93]", "assert cumulative([158, 91, 78, 172]) == [158, 0, 78, 0]", "assert cumulative([]) == []", "assert cumulative([]) == []"], "test_code": "assert cumulative([22, 82, 80, 17, 81, 67, 46, 102, 72]) == [22, 104, 184, 0, 81, 148, 194, 0, 72]\nassert cumulative([81, 74, 116, 85, 129, 48, 7]) == [81, 155, 0, 85, 0, 48, 55]\nassert cumulative([34, 103]) == [34, 137]\nassert cumulative([93, 131, 179, 24, 26, 149, 148, 93]) == [93, 0, 179, 0, 26, 175, 0, 93]\nassert cumulative([158, 91, 78, 172]) == [158, 0, 78, 0]\nassert cumulative([]) == []\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 195:\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 > 195:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 195 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([22, 82, 80, 17, 81, 67, 46, 102, 72])` يُرجع `[22, 104, 184, 0, 81, 148, 194, 0, 72]`.\nالجواب:", "qhash": "8faf94ca60509dbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 47", "tests": ["assert step_product(3) == 6", "assert step_product(7) == 11", "assert step_product(45) == 1", "assert step_product(40) == 25", "assert step_product(57) == 0", "assert step_product(21) == 30", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 6\nassert step_product(7) == 11\nassert step_product(45) == 1\nassert step_product(40) == 25\nassert step_product(57) == 0\nassert step_product(21) == 30\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 47", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 1)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef step_product(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `step_product(3)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "6edd910552786da6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 9\nfor n in range(-2, 10, 1):\n result -= n * 7\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 9\nfor n in range(-2, 10, 1):\n result -= n * 7\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "49232433c202e563", "answer": "-285\n9", "completion": " الناتج:\n```text\n-285\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[k:] + arr[:k]", "tests": ["assert shift_list([22, 41, 48, 45]) == [45, 22, 41, 48]", "assert shift_list([35, 5, 35, 11, -1, 42, 5, 11, 2]) == [11, -1, 42, 5, 11, 2, 35, 5, 35]", "assert shift_list([39, 29, 25, 2, 4, 40]) == [2, 4, 40, 39, 29, 25]", "assert shift_list([49, 33, 35, 1, 6, 4, 26, 19, 29, 1]) == [1, 6, 4, 26, 19, 29, 1, 49, 33, 35]", "assert shift_list([-4, 14]) == [14, -4]", "assert shift_list([43, 9, 14, 42, 8]) == [42, 8, 43, 9, 14]", "assert shift_list([]) == []"], "test_code": "assert shift_list([22, 41, 48, 45]) == [45, 22, 41, 48]\nassert shift_list([35, 5, 35, 11, -1, 42, 5, 11, 2]) == [11, -1, 42, 5, 11, 2, 35, 5, 35]\nassert shift_list([39, 29, 25, 2, 4, 40]) == [2, 4, 40, 39, 29, 25]\nassert shift_list([49, 33, 35, 1, 6, 4, 26, 19, 29, 1]) == [1, 6, 4, 26, 19, 29, 1, 49, 33, 35]\nassert shift_list([-4, 14]) == [14, -4]\nassert shift_list([43, 9, 14, 42, 8]) == [42, 8, 43, 9, 14]\nassert shift_list([]) == []", "answer": "def shift_list(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[k:] + arr[:k]", "completion": " ```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(arr):\n if not arr:\n return []\n k = 3 % len(arr)\n return ____\n```\nمثال: `shift_list([22, 41, 48, 45])` يجب أن تُرجع `[45, 22, 41, 48]`.\nالجواب:", "qhash": "233ff9b57fd0ce36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -3 for x in xs if -18 <= x <= -1)", "tests": ["assert filter_range([-7, -6, 1, -18, -5, -25, -11, -2]) == [6, 15, 18, 21, 33, 54]", "assert filter_range([-28, 25, 23, 33, -21, -18, -11]) == [33, 54]", "assert filter_range([-4, 4, -23, -20, 30, 40, 2]) == [12]", "assert filter_range([32, 18, 2, -7, -21, -24, 28, -12, 2]) == [21, 36]", "assert filter_range([60, 48, -17, 9]) == [51]", "assert filter_range([-26, 18, 44, 13, 5, 41, -2, 11, 41, 49]) == [6]", "assert filter_range([53]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([-7, -6, 1, -18, -5, -25, -11, -2]) == [6, 15, 18, 21, 33, 54]\nassert filter_range([-28, 25, 23, 33, -21, -18, -11]) == [33, 54]\nassert filter_range([-4, 4, -23, -20, 30, 40, 2]) == [12]\nassert filter_range([32, 18, 2, -7, -21, -24, 28, -12, 2]) == [21, 36]\nassert filter_range([60, 48, -17, 9]) == [51]\nassert filter_range([-26, 18, 44, 13, 5, 41, -2, 11, 41, 49]) == [6]\nassert filter_range([53]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -3 for x in xs if -18 <= x <= -1)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -3 for x in xs if -18 <= x <= -1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و-1 (شاملًا الطرفين) في -3.\nمثال: `filter_range([-7, -6, 1, -18, -5, -25, -11, -2])` يجب أن تُرجع `[6, 15, 18, 21, 33, 54]`.\nالجواب:", "qhash": "7aec8d12d7b2c70e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert scaled_powers(5) == 105", "assert scaled_powers(15) == 840", "assert scaled_powers(0) == 0", "assert scaled_powers(8) == 252", "assert scaled_powers(12) == 546", "assert scaled_powers(1) == 7", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(5) == 105\nassert scaled_powers(15) == 840\nassert scaled_powers(0) == 0\nassert scaled_powers(8) == 252\nassert scaled_powers(12) == 546\nassert scaled_powers(1) == 7\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(5)` يُرجع `105`.\nالجواب:", "qhash": "d9a8cb7c4c497e4f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'يوسف': 6, 'سلمى': 13, 'خالد': 42, 'عمر': 44, 'نور': 25}\nd['نور'] += 2\nd['هشام'] = 6\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 12])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'يوسف': 6, 'سلمى': 13, 'خالد': 42, 'عمر': 44, 'نور': 25}\nd['نور'] += 2\nd['هشام'] = 6\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 12])\n```\nالجواب:", "qhash": "e9301162903a6332", "answer": "6\nعمر\n138\n['سلمى', 'خالد', 'عمر', 'نور']", "completion": " الناتج:\n```text\n6\nعمر\n138\n['سلمى', 'خالد', 'عمر', 'نور']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cms'}", "tests": ["assert freq_of('desert garden rocket') == {'c': 1, 'm': 0, 's': 1}", "assert freq_of('to stone window of summer') == {'c': 0, 'm': 2, 's': 2}", "assert freq_of('signal') == {'c': 0, 'm': 0, 's': 1}", "assert freq_of('desert on data music rocket it') == {'c': 2, 'm': 1, 's': 2}", "assert freq_of('window coffee code') == {'c': 2, 'm': 0, 's': 0}", "assert freq_of('in on python pixel on light') == {'c': 0, 'm': 0, 's': 0}", "assert freq_of('') == {'c': 0, 'm': 0, 's': 0}"], "test_code": "assert freq_of('desert garden rocket') == {'c': 1, 'm': 0, 's': 1}\nassert freq_of('to stone window of summer') == {'c': 0, 'm': 2, 's': 2}\nassert freq_of('signal') == {'c': 0, 'm': 0, 's': 1}\nassert freq_of('desert on data music rocket it') == {'c': 2, 'm': 1, 's': 2}\nassert freq_of('window coffee code') == {'c': 2, 'm': 0, 's': 0}\nassert freq_of('in on python pixel on light') == {'c': 0, 'm': 0, 's': 0}\nassert freq_of('') == {'c': 0, 'm': 0, 's': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cms'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cms'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'm'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('desert garden rocket')` يجب أن تُرجع `{'c': 1, 'm': 0, 's': 1}`.\nالجواب:", "qhash": "504914e2a00a5848"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 1\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(2))\n```\nالجواب:", "qhash": "8a46719f3c800ac0", "answer": "3", "completion": " الناتج:\n```text\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('by is banana') == 'sp zj srerer'", "assert shift_text('cloud it go an !') == 'tcflu zk xf re !'", "assert shift_text('coffee') == 'tfwwvv'", "assert shift_text('signal desert desert matrix is') == 'jzxerc uvjvik uvjvik drkizo zj'", "assert shift_text('banana brain desert Hello') == 'srerer sirze uvjvik Hvccf'", "assert shift_text('signal signal 2024') == 'jzxerc jzxerc 2024'", "assert shift_text('') == ''"], "test_code": "assert shift_text('by is banana') == 'sp zj srerer'\nassert shift_text('cloud it go an !') == 'tcflu zk xf re !'\nassert shift_text('coffee') == 'tfwwvv'\nassert shift_text('signal desert desert matrix is') == 'jzxerc uvjvik uvjvik drkizo zj'\nassert shift_text('banana brain desert Hello') == 'srerer sirze uvjvik Hvccf'\nassert shift_text('signal signal 2024') == 'jzxerc jzxerc 2024'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('by is banana')` يُرجع `'sp zj srerer'`.\nالجواب:", "qhash": "5e74160d7007037d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('python stone desert music') == 'ravjqp uvqpg fgugtv owuke'", "assert encode('to engine stone music cloud') == 'vq gpikpg uvqpg owuke enqwf'", "assert encode('code garden window is music') == 'eqfg ictfgp ykpfqy ku owuke'", "assert encode('pixel code table garden summer OK') == 'rkzgn eqfg vcdng ictfgp uwoogt OK'", "assert encode('light matrix by window') == 'nkijv ocvtkz da ykpfqy'", "assert encode('is an planet python falcon') == 'ku cp rncpgv ravjqp hcneqp'", "assert encode('') == ''"], "test_code": "assert encode('python stone desert music') == 'ravjqp uvqpg fgugtv owuke'\nassert encode('to engine stone music cloud') == 'vq gpikpg uvqpg owuke enqwf'\nassert encode('code garden window is music') == 'eqfg ictfgp ykpfqy ku owuke'\nassert encode('pixel code table garden summer OK') == 'rkzgn eqfg vcdng ictfgp uwoogt OK'\nassert encode('light matrix by window') == 'nkijv ocvtkz da ykpfqy'\nassert encode('is an planet python falcon') == 'ku cp rncpgv ravjqp hcneqp'\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 + (2)) % 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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `encode(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('python stone desert music')` يجب أن تُرجع `'ravjqp uvqpg fgugtv owuke'`.\nالجواب:", "qhash": "631565691647c404"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 110\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 = 110\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": "09005e15b1113c87", "answer": "113", "completion": " الناتج:\n```text\n113\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert mult_sum(213) == 8925", "assert mult_sum(280) == 15543", "assert mult_sum(24) == 114", "assert mult_sum(89) == 1575", "assert mult_sum(268) == 14445", "assert mult_sum(235) == 11163", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(213) == 8925\nassert mult_sum(280) == 15543\nassert mult_sum(24) == 114\nassert mult_sum(89) == 1575\nassert mult_sum(268) == 14445\nassert mult_sum(235) == 11163\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(213)` يُرجع `8925`.\nالجواب:", "qhash": "c94d61201bd54ed0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=8):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(14))\nprint(g(14, -10))\nprint(g(g(-10), 14))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=8):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(g(14))\nprint(g(14, -10))\nprint(g(g(-10), 14))\n```\nالجواب:", "qhash": "ebfe675b7137aee9", "answer": "-36\n-18\n-54", "completion": " الناتج:\n```text\n-36\n-18\n-54\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert spin([13, 0, 48, 13, 46, 50, 6, 15]) == [13, 0, 48, 13, 46, 50, 6, 15]", "assert spin([33]) == [33]", "assert spin([40, 39, 15, 36, 24, 12]) == [24, 12, 40, 39, 15, 36]", "assert spin([18, 26, 14, -2, 14, -2, 32, 30, 16, 16]) == [32, 30, 16, 16, 18, 26, 14, -2, 14, -2]", "assert spin([-5, 11]) == [-5, 11]", "assert spin([-5, 26, 5, -8, 43, 6, 22, 48]) == [-5, 26, 5, -8, 43, 6, 22, 48]", "assert spin([]) == []"], "test_code": "assert spin([13, 0, 48, 13, 46, 50, 6, 15]) == [13, 0, 48, 13, 46, 50, 6, 15]\nassert spin([33]) == [33]\nassert spin([40, 39, 15, 36, 24, 12]) == [24, 12, 40, 39, 15, 36]\nassert spin([18, 26, 14, -2, 14, -2, 32, 30, 16, 16]) == [32, 30, 16, 16, 18, 26, 14, -2, 14, -2]\nassert spin([-5, 11]) == [-5, 11]\nassert spin([-5, 26, 5, -8, 43, 6, 22, 48]) == [-5, 26, 5, -8, 43, 6, 22, 48]\nassert spin([]) == []", "answer": "def spin(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef spin(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(lst):\n if not lst:\n return []\n k = 16 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `spin([13, 0, 48, 13, 46, 50, 6, 15])` يُرجع `[13, 0, 48, 13, 46, 50, 6, 15]`.\nالجواب:", "qhash": "db617ab9bd239db9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "tests": ["assert sum_div(144) == 2034", "assert sum_div(123) == 1500", "assert sum_div(108) == 1158", "assert sum_div(265) == 7158", "assert sum_div(226) == 5178", "assert sum_div(177) == 3154", "assert sum_div(1) == 0"], "test_code": "assert sum_div(144) == 2034\nassert sum_div(123) == 1500\nassert sum_div(108) == 1158\nassert sum_div(265) == 7158\nassert sum_div(226) == 5178\nassert sum_div(177) == 3154\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 10.\nمثال: `sum_div(144)` يجب أن تُرجع `2034`.\nالجواب:", "qhash": "310778d927524fbf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 12)", "tests": ["assert clip_scale([-1, 12, -16, 3, 4, 22, 21]) == [-5, 15, 20, 60]", "assert clip_scale([4]) == [20]", "assert clip_scale([44, -27, -9]) == []", "assert clip_scale([-10, 44, 17, 28, 41]) == []", "assert clip_scale([51, -30]) == []", "assert clip_scale([]) == []", "assert clip_scale([35, 37, -7, 45, -24]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-1, 12, -16, 3, 4, 22, 21]) == [-5, 15, 20, 60]\nassert clip_scale([4]) == [20]\nassert clip_scale([44, -27, -9]) == []\nassert clip_scale([-10, 44, 17, 28, 41]) == []\nassert clip_scale([51, -30]) == []\nassert clip_scale([]) == []\nassert clip_scale([35, 37, -7, 45, -24]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 12)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 5 for x in xs if -6 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -6 و12 (شاملًا الطرفين) في 5.\nمثال: `clip_scale([-1, 12, -16, 3, 4, 22, 21])` يجب أن تُرجع `[-5, 15, 20, 60]`.\nالجواب:", "qhash": "65dcabc96591f748"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [30, 31, 17, 6, 28, 34, -14, -3]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [30, 31, 17, 6, 28, 34, -14, -3]\nprint(sorted(nums, key=lambda x: (abs(x - 19), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "0c0f04c79731ca7d", "answer": "[17, 28, 30, 31, 6, 34, -3, -14]\n[34, 31, 30]", "completion": " الناتج:\n```text\n[17, 28, 30, 31, 6, 34, -3, -14]\n[34, 31, 30]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 2 for x in range(1, 12) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 2 for x in range(1, 12) if x % 2 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f5c26062976b03f2", "answer": "[-1, 7, 23, 47, 79, 119]\n6 274", "completion": " الناتج:\n```text\n[-1, 7, 23, 47, 79, 119]\n6 274\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "poly", "reference": "def poly(x):\n return -7 * x ** 2 + (2) * x + (-6)", "tests": ["assert poly(9) == -555", "assert poly(16) == -1766", "assert poly(-15) == -1611", "assert poly(-19) == -2571", "assert poly(6) == -246", "assert poly(5) == -171", "assert poly(16) == -1766", "assert poly(0) == -6"], "test_code": "assert poly(9) == -555\nassert poly(16) == -1766\nassert poly(-15) == -1611\nassert poly(-19) == -2571\nassert poly(6) == -246\nassert poly(5) == -171\nassert poly(16) == -1766\nassert poly(0) == -6", "answer": "def poly(x):\n return -7 * x ** 2 + (2) * x + (-6)", "completion": " ```python\ndef poly(x):\n return -7 * x ** 2 + (2) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `poly(x)` تُرجع قيمة كثيرة الحدود -7x² + 2x - 6 عند العدد الصحيح x.\nمثال: `poly(9)` يجب أن تُرجع `-555`.\nالجواب:", "qhash": "a5ad6eb890afd16f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'lr'}", "tests": ["assert letter_stats('table banana') == {'l': 1, 'r': 0}", "assert letter_stats('is table') == {'l': 1, 'r': 0}", "assert letter_stats('camel') == {'l': 1, 'r': 0}", "assert letter_stats('stone an we data window winter') == {'l': 0, 'r': 1}", "assert letter_stats('river garden data summer') == {'l': 0, 'r': 4}", "assert letter_stats('desert of signal') == {'l': 1, 'r': 1}", "assert letter_stats('') == {'l': 0, 'r': 0}"], "test_code": "assert letter_stats('table banana') == {'l': 1, 'r': 0}\nassert letter_stats('is table') == {'l': 1, 'r': 0}\nassert letter_stats('camel') == {'l': 1, 'r': 0}\nassert letter_stats('stone an we data window winter') == {'l': 0, 'r': 1}\nassert letter_stats('river garden data summer') == {'l': 0, 'r': 4}\nassert letter_stats('desert of signal') == {'l': 1, 'r': 1}\nassert letter_stats('') == {'l': 0, 'r': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'lr'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'lr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `letter_stats(s)` تعيد dict يربط كل محرف من المحارف 'l'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `letter_stats('table banana')` يُرجع `{'l': 1, 'r': 0}`.\nالجواب:", "qhash": "c332e1a130171c4d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Tic'\n if i % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(12) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic']", "assert label_numbers(10) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac']", "assert label_numbers(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic']", "assert label_numbers(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']", "assert label_numbers(17) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17']"], "test_code": "assert label_numbers(12) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic']\nassert label_numbers(10) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac']\nassert label_numbers(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic']\nassert label_numbers(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']\nassert label_numbers(17) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: أنشئ دالة بايثون `label_numbers(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `label_numbers(12)` يُرجع `['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic']`.\nالجواب:", "qhash": "7d0080180b3fa1ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 0 + 4 for x in range(-3, 9) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 0 + 4 for x in range(-3, 9) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "ec88cab846d427ae", "answer": "[4, 4, 4]\n3 12", "completion": " الناتج:\n```text\n[4, 4, 4]\n3 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'cgms'}", "tests": ["assert char_freq('of is music matrix') == {'c': 1, 'g': 0, 'm': 2, 's': 2}", "assert char_freq('data brain python pixel code') == {'c': 1, 'g': 0, 'm': 0, 's': 0}", "assert char_freq('of at pixel') == {'c': 0, 'g': 0, 'm': 0, 's': 0}", "assert char_freq('winter up') == {'c': 0, 'g': 0, 'm': 0, 's': 0}", "assert char_freq('music') == {'c': 1, 'g': 0, 'm': 1, 's': 1}", "assert char_freq('up orange code code') == {'c': 2, 'g': 1, 'm': 0, 's': 0}", "assert char_freq('') == {'c': 0, 'g': 0, 'm': 0, 's': 0}"], "test_code": "assert char_freq('of is music matrix') == {'c': 1, 'g': 0, 'm': 2, 's': 2}\nassert char_freq('data brain python pixel code') == {'c': 1, 'g': 0, 'm': 0, 's': 0}\nassert char_freq('of at pixel') == {'c': 0, 'g': 0, 'm': 0, 's': 0}\nassert char_freq('winter up') == {'c': 0, 'g': 0, 'm': 0, 's': 0}\nassert char_freq('music') == {'c': 1, 'g': 0, 'm': 1, 's': 1}\nassert char_freq('up orange code code') == {'c': 2, 'g': 1, 'm': 0, 's': 0}\nassert char_freq('') == {'c': 0, 'g': 0, 'm': 0, 's': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'cgms'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'cgms'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `char_freq(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'g'، 'm'، 's' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `char_freq('of is music matrix')` يجب أن تُرجع `{'c': 1, 'g': 0, 'm': 2, 's': 2}`.\nالجواب:", "qhash": "c174ae4aed8512c5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 385\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 = 385\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": "867dc7100023eac0", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 192:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([34, 22, 98, 65, 3, 19, 76, 61, 82]) == [34, 56, 154, 0, 3, 22, 98, 159, 0]", "assert rolling_total([88]) == [88]", "assert rolling_total([20, 70]) == [20, 90]", "assert rolling_total([152]) == [152]", "assert rolling_total([]) == []", "assert rolling_total([80, 114, 54, 113, 186]) == [80, 0, 54, 167, 0]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([34, 22, 98, 65, 3, 19, 76, 61, 82]) == [34, 56, 154, 0, 3, 22, 98, 159, 0]\nassert rolling_total([88]) == [88]\nassert rolling_total([20, 70]) == [20, 90]\nassert rolling_total([152]) == [152]\nassert rolling_total([]) == []\nassert rolling_total([80, 114, 54, 113, 186]) == [80, 0, 54, 167, 0]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 192:\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 > 192:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rolling_total(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 192 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `rolling_total([34, 22, 98, 65, 3, 19, 76, 61, 82])` يجب أن تُرجع `[34, 56, 154, 0, 3, 22, 98, 159, 0]`.\nالجواب:", "qhash": "79113d3169cde207"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-17, 24, -4, -8, 4]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-17, 24, -4, -8, 4]\nprint(sorted(nums, key=lambda x: (abs(x - 15), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "8a83d2c9608f7af5", "answer": "[24, 4, -4, -8, -17]\n[24, 4, -4]", "completion": " الناتج:\n```text\n[24, 4, -4, -8, -17]\n[24, 4, -4]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Red'\n if i % 11 == 0:\n s += 'Blue'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(20) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20']", "assert fizzbuzz(24) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23', 'Red']", "assert fizzbuzz(14) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14']", "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9']", "assert fizzbuzz(1) == ['1']"], "test_code": "assert fizzbuzz(20) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20']\nassert fizzbuzz(24) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20', '21', 'Blue', '23', 'Red']\nassert fizzbuzz(14) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14']\nassert fizzbuzz(9) == ['1', '2', '3', '4', '5', 'Red', '7', '8', '9']\nassert fizzbuzz(1) == ['1']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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سؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Red'، وإن قَبِلها على 11 أضف 'Blue' (فيصبح 'RedBlue' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(20)` يُرجع `['1', '2', '3', '4', '5', 'Red', '7', '8', '9', '10', 'Blue', 'Red', '13', '14', '15', '16', '17', 'Red', '19', '20']`.\nالجواب:", "qhash": "49714f81c84d8131"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'نور': 7, 'سعيد': 20, 'هشام': 32, 'علي': 12}\npoints['هشام'] += 16\npoints['باسل'] = 16\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 40])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\npoints = {'نور': 7, 'سعيد': 20, 'هشام': 32, 'علي': 12}\npoints['هشام'] += 16\npoints['باسل'] = 16\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 40])\n```\nالجواب:", "qhash": "fb29719a251f514d", "answer": "5\nهشام\n103\n['هشام']", "completion": " الناتج:\n```text\n5\nهشام\n103\n['هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 5\n return total", "tests": ["assert weighted_sum(5) == 30975", "assert weighted_sum(7) == 203056", "assert weighted_sum(8) == 432432", "assert weighted_sum(1) == 7", "assert weighted_sum(15) == 16094400", "assert weighted_sum(1) == 7", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(5) == 30975\nassert weighted_sum(7) == 203056\nassert weighted_sum(8) == 432432\nassert weighted_sum(1) == 7\nassert weighted_sum(15) == 16094400\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 ** 5\n return total", "completion": " ```python\ndef weighted_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 weighted_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 weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 5\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(5)` يُرجع `30975`.\nالجواب:", "qhash": "5a4c8f7a91aa3643"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('قهوة حديقة شمس') == 1", "assert begin_count('حديقة قمر سماء برتقال') == 1", "assert begin_count('سفينة قمر شمس') == 1", "assert begin_count('حديقة جمل بحر قهوة قمر شجرة') == 2", "assert begin_count('بحر سفينة لغة مطر تفاحة قمر') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('فجر شجرة') == 0\nassert begin_count('قهوة حديقة شمس') == 1\nassert begin_count('حديقة قمر سماء برتقال') == 1\nassert begin_count('سفينة قمر شمس') == 1\nassert begin_count('حديقة جمل بحر قهوة قمر شجرة') == 2\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.split():\n if 'ق' in w:\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 'ق' in w:\n count += 1\n return count\n```\nمثال: `begin_count('فجر شجرة')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "34ec3123f9ceac91"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 0\n return go(n - 1) + go(n - 2)\n\nprint(go(7))", "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(7))\n```\nالجواب:", "qhash": "4dfe62be30892cc1", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "res = [(x + 10) // 2 for x in range(-4, 7) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nres = [(x + 10) // 2 for x in range(-4, 7) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "6209e85ad6f2a588", "answer": "[3, 4, 5, 6, 7]\n5 25", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7]\n5 25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([57, 17, 40, 56, 15, 0, 68]) == 0", "assert div_not([51, 14, 26, -40, 38]) == 0", "assert div_not([-20, 75, 25, -28, -31, 44, 59, 61]) == 0", "assert div_not([55]) == 0", "assert div_not([51, 18, -31, 39, 54, 71, 38, -14]) == 0", "assert div_not([-13, 59, 72, 22, 19, 46, 48, -27, -31, -21, 27, 64]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([57, 17, 40, 56, 15, 0, 68]) == 0\nassert div_not([51, 14, 26, -40, 38]) == 0\nassert div_not([-20, 75, 25, -28, -31, 44, 59, 61]) == 0\nassert div_not([55]) == 0\nassert div_not([51, 18, -31, 39, 54, 71, 38, -14]) == 0\nassert div_not([-13, 59, 72, 22, 19, 46, 48, -27, -31, -21, 27, 64]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `div_not([57, 17, 40, 56, 15, 0, 68])` يُرجع `0`.\nالجواب:", "qhash": "e5ce7b58fcbd465e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('garden of apple an pixel') == 'pixel apple garden'", "assert invert_words('go') == ''", "assert invert_words('river is by data matrix an window') == 'window matrix river'", "assert invert_words('light matrix') == 'matrix light'", "assert invert_words('engine river on brain summer vector window an') == 'window vector summer brain river engine'", "assert invert_words('is apple') == 'apple'", "assert invert_words('python we to') == 'python'"], "test_code": "assert invert_words('garden of apple an pixel') == 'pixel apple garden'\nassert invert_words('go') == ''\nassert invert_words('river is by data matrix an window') == 'window matrix river'\nassert invert_words('light matrix') == 'matrix light'\nassert invert_words('engine river on brain summer vector window an') == 'window vector summer brain river engine'\nassert invert_words('is apple') == 'apple'\nassert invert_words('python we to') == 'python'", "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('garden of apple an pixel')` يجب أن تُرجع `'pixel apple garden'`.\nالجواب:", "qhash": "c639942ac88e4f7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)", "tests": ["assert sum_div(218) == 9067", "assert sum_div(156) == 4602", "assert sum_div(9) == 9", "assert sum_div(61) == 721", "assert sum_div(256) == 12616", "assert sum_div(180) == 6103", "assert sum_div(1) == 0"], "test_code": "assert sum_div(218) == 9067\nassert sum_div(156) == 4602\nassert sum_div(9) == 9\nassert sum_div(61) == 721\nassert sum_div(256) == 12616\nassert sum_div(180) == 6103\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 % 13 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 13، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(218)` يُرجع `9067`.\nالجواب:", "qhash": "939af394f1bcdbd7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [-13, 39, 40, 34, 28, 22, 28]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [-13, 39, 40, 34, 28, 22, 28]\nprint(sorted(nums, key=lambda x: (abs(x - 6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "ed4f766cdafc1892", "answer": "[22, -13, 28, 28, 34, 39, 40]\n[40, 39, 34]", "completion": " الناتج:\n```text\n[22, -13, 28, 28, 34, 39, 40]\n[40, 39, 34]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([38, 36, 36, 23, 20]) == None", "assert find_max_div([-11, -44, -11]) == -11", "assert find_max_div([1]) == None", "assert find_max_div([16, 28, 29, -32, -28, -5, -34, -28]) == None", "assert find_max_div([-17, -43, -42, -18, -44]) == -44", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([38, 36, 36, 23, 20]) == None\nassert find_max_div([-11, -44, -11]) == -11\nassert find_max_div([1]) == None\nassert find_max_div([16, 28, 29, -32, -28, -5, -34, -28]) == None\nassert find_max_div([-17, -43, -42, -18, -44]) == -44\nassert find_max_div([]) == None", "answer": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(xs):\n best = None\n for x in xs:\n if x % 11 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([38, 36, 36, 23, 20])` يُرجع `None`.\nالجواب:", "qhash": "9a669196fa2b0ae1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "backwards", "reference": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert backwards('cloud river camel camel at python garden summer') == 'summer-garden-python'", "assert backwards('window an to vector') == 'vector-window'", "assert backwards('') == ''", "assert backwards('window table desert') == 'desert-window'", "assert backwards('music banana table signal python camel') == 'python-signal-banana'", "assert backwards('') == ''", "assert backwards('') == ''"], "test_code": "assert backwards('cloud river camel camel at python garden summer') == 'summer-garden-python'\nassert backwards('window an to vector') == 'vector-window'\nassert backwards('') == ''\nassert backwards('window table desert') == 'desert-window'\nassert backwards('music banana table signal python camel') == 'python-signal-banana'\nassert backwards('') == ''\nassert backwards('') == ''", "answer": "def backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef backwards(s):\n return '-'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `backwards(s)` تأخذ جملة وتُرجع الكلمات التي طولها 6 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `backwards('cloud river camel camel at python garden summer')` يجب أن تُرجع `'summer-garden-python'`.\nالجواب:", "qhash": "07a427f3a4f1d78a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 337\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 = 337\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": "35fbf9341947fdcb", "answer": "112", "completion": " الناتج:\n```text\n112\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 24:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([2, 11, 5, 10, 7]) == [2, 13, 18, 0, 7]", "assert cumulative([5, 14, 3, 6]) == [5, 19, 22, 0]", "assert cumulative([17, -4, 22, 18, 3, 9, 8]) == [17, 13, 0, 18, 21, 0, 8]", "assert cumulative([14, 0, 16, 23, 13, 7]) == [14, 14, 0, 23, 0, 7]", "assert cumulative([16, 24, 14, 19, -4]) == [16, 0, 14, 0, -4]", "assert cumulative([14, -5, 2, -4, 11, -10]) == [14, 9, 11, 7, 18, 8]", "assert cumulative([]) == []"], "test_code": "assert cumulative([2, 11, 5, 10, 7]) == [2, 13, 18, 0, 7]\nassert cumulative([5, 14, 3, 6]) == [5, 19, 22, 0]\nassert cumulative([17, -4, 22, 18, 3, 9, 8]) == [17, 13, 0, 18, 21, 0, 8]\nassert cumulative([14, 0, 16, 23, 13, 7]) == [14, 14, 0, 23, 0, 7]\nassert cumulative([16, 24, 14, 19, -4]) == [16, 0, 14, 0, -4]\nassert cumulative([14, -5, 2, -4, 11, -10]) == [14, 9, 11, 7, 18, 8]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 24:\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 > 24:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 24 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([2, 11, 5, 10, 7])` يُرجع `[2, 13, 18, 0, 7]`.\nالجواب:", "qhash": "eb0e37dd44261cab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('python') == 'nwrfml'", "assert cipher('rocket river python go signal') == 'pmaicr pgtcp nwrfml em qgelyj'", "assert cipher('we of') == 'uc md'", "assert cipher('a music up signal falcon') == 'y ksqga sn qgelyj dyjaml'", "assert cipher('apple we') == 'ynnjc uc'", "assert cipher('data winter window summer OK') == 'byry uglrcp uglbmu qskkcp OK'", "assert cipher('') == ''"], "test_code": "assert cipher('python') == 'nwrfml'\nassert cipher('rocket river python go signal') == 'pmaicr pgtcp nwrfml em qgelyj'\nassert cipher('we of') == 'uc md'\nassert cipher('a music up signal falcon') == 'y ksqga sn qgelyj dyjaml'\nassert cipher('apple we') == 'ynnjc uc'\nassert cipher('data winter window summer OK') == 'byry uglrcp uglbmu qskkcp OK'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('python')` يُرجع `'nwrfml'`.\nالجواب:", "qhash": "7faa44e0e1d5f0e4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('matrix matrix window coffee is signal') == 'signal-is-coffee-window-matrix-matrix'", "assert flip_words('camel garden on is by desert engine') == 'engine-desert-by-is-on-garden-camel'", "assert flip_words('apple music matrix planet a of window') == 'window-of-planet-matrix-music-apple'", "assert flip_words('rocket garden stone cloud') == 'cloud-stone-garden-rocket'", "assert flip_words('matrix') == 'matrix'", "assert flip_words('table on stone') == 'stone-on-table'", "assert flip_words('rocket music by') == 'by-music-rocket'"], "test_code": "assert flip_words('matrix matrix window coffee is signal') == 'signal-is-coffee-window-matrix-matrix'\nassert flip_words('camel garden on is by desert engine') == 'engine-desert-by-is-on-garden-camel'\nassert flip_words('apple music matrix planet a of window') == 'window-of-planet-matrix-music-apple'\nassert flip_words('rocket garden stone cloud') == 'cloud-stone-garden-rocket'\nassert flip_words('matrix') == 'matrix'\nassert flip_words('table on stone') == 'stone-on-table'\nassert flip_words('rocket music by') == 'by-music-rocket'", "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('matrix matrix window coffee is signal')` يجب أن تُرجع `'signal-is-coffee-window-matrix-matrix'`.\nالجواب:", "qhash": "3f55b1ce882c34e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'data_python'\nprint(s[2:3])\nprint(s.split('_'))\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'data_python'\nprint(s[2:3])\nprint(s.split('_'))\nprint(s.capitalize())\n```\nالجواب:", "qhash": "d8ca8ace60786d1c", "answer": "t\n['data', 'python']\nData_python", "completion": " الناتج:\n```text\nt\n['data', 'python']\nData_python\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "nums = [22, -6, 40, 26, -5]\nprint(nums[1:4])\nprint(nums[::2])\nprint(len(nums[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [22, -6, 40, 26, -5]\nprint(nums[1:4])\nprint(nums[::2])\nprint(len(nums[1:4]))\n```\nالجواب:", "qhash": "6ae811deaf0ec82b", "answer": "[-6, 40, 26]\n[22, 40, -5]\n3", "completion": " الناتج:\n```text\n[-6, 40, 26]\n[22, 40, -5]\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=3):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(-7))\nprint(h(-7, -3))\nprint(h(h(-3), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=3):\n if x > y:\n return x * 8 - y\n return x + y * 8\n\nprint(h(-7))\nprint(h(-7, -3))\nprint(h(h(-3), -7))\n```\nالجواب:", "qhash": "48d7a8c7d1e88610", "answer": "17\n-31\n175", "completion": " الناتج:\n```text\n17\n-31\n175\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(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 game(18) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18']", "assert game(13) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13']", "assert game(0) == []", "assert game(4) == ['1', '2', '3', 'Ping']", "assert game(4) == ['1', '2', '3', 'Ping']"], "test_code": "assert game(18) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18']\nassert game(13) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13']\nassert game(0) == []\nassert game(4) == ['1', '2', '3', 'Ping']\nassert game(4) == ['1', '2', '3', 'Ping']", "answer": "def game(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 game(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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 4 يُستبدل بـ 'Ping'، وعلى 10 بـ 'Pong'، وعلى كليهما بـ 'PingPong'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(18)` يجب أن تُرجع `['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18']`.\nالجواب:", "qhash": "710eb186ecb95f09"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 61) == 1)", "tests": ["assert coprime_count(69) == 68", "assert coprime_count(56) == 56", "assert coprime_count(122) == 120", "assert coprime_count(117) == 116", "assert coprime_count(106) == 105", "assert coprime_count(169) == 167", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(69) == 68\nassert coprime_count(56) == 56\nassert coprime_count(122) == 120\nassert coprime_count(117) == 116\nassert coprime_count(106) == 105\nassert coprime_count(169) == 167\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, 61) == 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, 61) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 61، أي أن القاسم المشترك الأكبر لها مع 61 يساوي 1.\nمثال: `coprime_count(69)` يجب أن تُرجع `68`.\nالجواب:", "qhash": "7587f6087a3c9f97"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('أحمد', 72), ('سلمى', 17), ('رنا', 60), ('سعيد', 37)]\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 = [('أحمد', 72), ('سلمى', 17), ('رنا', 60), ('سعيد', 37)]\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": "3f762e567f2751ed", "answer": "[('سلمى', 17), ('سعيد', 37), ('رنا', 60), ('أحمد', 72)]\n['أحمد', 'رنا']", "completion": " الناتج:\n```text\n[('سلمى', 17), ('سعيد', 37), ('رنا', 60), ('أحمد', 72)]\n['أحمد', 'رنا']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(226) == 5178", "assert add_multiples(144) == 2034", "assert add_multiples(15) == 18", "assert add_multiples(59) == 334", "assert add_multiples(108) == 1158", "assert add_multiples(88) == 680", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(226) == 5178\nassert add_multiples(144) == 2034\nassert add_multiples(15) == 18\nassert add_multiples(59) == 334\nassert add_multiples(108) == 1158\nassert add_multiples(88) == 680\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 10.\nمثال: `add_multiples(226)` يجب أن تُرجع `5178`.\nالجواب:", "qhash": "cdd6d91c4fcd5892"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 17", "tests": ["assert digit_power(82240) == 14", "assert digit_power(515211) == 6", "assert digit_power(379657) == 15", "assert digit_power(691255) == 14", "assert digit_power(703583) == 14", "assert digit_power(961037) == 7", "assert digit_power(544966) == 3", "assert digit_power(0) == 0"], "test_code": "assert digit_power(82240) == 14\nassert digit_power(515211) == 6\nassert digit_power(379657) == 15\nassert digit_power(691255) == 14\nassert digit_power(703583) == 14\nassert digit_power(961037) == 7\nassert digit_power(544966) == 3\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 17", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 3 for d in str(n)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 3) على 17.\nمثال: `digit_power(82240)` يجب أن تُرجع `14`.\nالجواب:", "qhash": "e0a0a7526fb90c8e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_div", "reference": "def 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 max_div([1, 3, -17, 48, 35]) == 48", "assert max_div([-3, -15, -3]) == -3", "assert max_div([1, 4, 7]) == None", "assert max_div([-37, 1, -4, 32, 18, -23, 24, -24, -1]) == 24", "assert max_div([-23, -16, -28, 40]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([1, 3, -17, 48, 35]) == 48\nassert max_div([-3, -15, -3]) == -3\nassert max_div([1, 4, 7]) == None\nassert max_div([-37, 1, -4, 32, 18, -23, 24, -24, -1]) == 24\nassert max_div([-23, -16, -28, 40]) == None\nassert max_div([]) == None", "answer": "def 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 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 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 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للتوضيح: الاستدعاء `max_div([1, 3, -17, 48, 35])` يُرجع `48`.\nالجواب:", "qhash": "ac422c4ef6072714"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert shift_list([35, 43, 11, 12]) == [11, 12, 35, 43]", "assert shift_list([42, 10, -8, 46]) == [-8, 46, 42, 10]", "assert shift_list([-6, 41, 15, 7, 18, -6, 8, -4, 18, 29]) == [-6, 41, 15, 7, 18, -6, 8, -4, 18, 29]", "assert shift_list([19, 9, 19, -5, 44, 42, 6, 43, 8, 48, 4]) == [4, 19, 9, 19, -5, 44, 42, 6, 43, 8, 48]", "assert shift_list([22, -3, -5, 3, 17, 4, 5]) == [3, 17, 4, 5, 22, -3, -5]", "assert shift_list([4]) == [4]", "assert shift_list([]) == []"], "test_code": "assert shift_list([35, 43, 11, 12]) == [11, 12, 35, 43]\nassert shift_list([42, 10, -8, 46]) == [-8, 46, 42, 10]\nassert shift_list([-6, 41, 15, 7, 18, -6, 8, -4, 18, 29]) == [-6, 41, 15, 7, 18, -6, 8, -4, 18, 29]\nassert shift_list([19, 9, 19, -5, 44, 42, 6, 43, 8, 48, 4]) == [4, 19, 9, 19, -5, 44, 42, 6, 43, 8, 48]\nassert shift_list([22, -3, -5, 3, 17, 4, 5]) == [3, 17, 4, 5, 22, -3, -5]\nassert shift_list([4]) == [4]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return ____\n```\nمثال: `shift_list([35, 43, 11, 12])` يجب أن تُرجع `[11, 12, 35, 43]`.\nالجواب:", "qhash": "29fb936efc902cda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "multi_fact", "reference": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 17", "tests": ["assert multi_fact(4) == 7", "assert multi_fact(58) == 0", "assert multi_fact(31) == 0", "assert multi_fact(11) == 1", "assert multi_fact(30) == 0", "assert multi_fact(54) == 0", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(4) == 7\nassert multi_fact(58) == 0\nassert multi_fact(31) == 0\nassert multi_fact(11) == 1\nassert multi_fact(30) == 0\nassert multi_fact(54) == 0\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 17", "completion": " ```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return (n * multi_fact(n - 1)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef multi_fact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `multi_fact(4)` يُرجع `7`.\nالجواب:", "qhash": "c5187f83d7a3760b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total", "tests": ["assert weighted_sum(7) == 1260", "assert weighted_sum(15) == 11160", "assert weighted_sum(5) == 495", "assert weighted_sum(13) == 7371", "assert weighted_sum(6) == 819", "assert weighted_sum(1) == 9", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(7) == 1260\nassert weighted_sum(15) == 11160\nassert weighted_sum(5) == 495\nassert weighted_sum(13) == 7371\nassert weighted_sum(6) == 819\nassert weighted_sum(1) == 9\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 9 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 2\n return total\n```\nمثال: `weighted_sum(7)` يجب أن تُرجع `1260`.\nالجواب:", "qhash": "cf86d403db354b3e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'ar'}", "tests": ["assert tally('signal summer') == {'a': 1, 'r': 1}", "assert tally('code') == {'a': 0, 'r': 0}", "assert tally('to vector by') == {'a': 0, 'r': 1}", "assert tally('winter cloud on an table a') == {'a': 3, 'r': 1}", "assert tally('vector summer pixel falcon') == {'a': 1, 'r': 2}", "assert tally('engine garden') == {'a': 1, 'r': 1}", "assert tally('') == {'a': 0, 'r': 0}"], "test_code": "assert tally('signal summer') == {'a': 1, 'r': 1}\nassert tally('code') == {'a': 0, 'r': 0}\nassert tally('to vector by') == {'a': 0, 'r': 1}\nassert tally('winter cloud on an table a') == {'a': 3, 'r': 1}\nassert tally('vector summer pixel falcon') == {'a': 1, 'r': 2}\nassert tally('engine garden') == {'a': 1, 'r': 1}\nassert tally('') == {'a': 0, 'r': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'ar'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'ar'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'a'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('signal summer')` يجب أن تُرجع `{'a': 1, 'r': 1}`.\nالجواب:", "qhash": "426b82250f4a7061"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=4):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(g(16))\nprint(g(16, 17))\nprint(g(g(17), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=4):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(g(16))\nprint(g(16, 17))\nprint(g(g(17), 16))\n```\nالجواب:", "qhash": "78ee467eefdca271", "answer": "140\n169\n1325", "completion": " الناتج:\n```text\n140\n169\n1325\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "char_freq", "reference": "def char_freq(s):\n return {c: s.count(c) for c in 'gl'}", "tests": ["assert char_freq('coffee vector music python') == {'g': 0, 'l': 0}", "assert char_freq('signal at is') == {'g': 1, 'l': 1}", "assert char_freq('winter') == {'g': 0, 'l': 0}", "assert char_freq('engine falcon river up data') == {'g': 1, 'l': 1}", "assert char_freq('by in engine window') == {'g': 1, 'l': 0}", "assert char_freq('python orange winter rocket') == {'g': 1, 'l': 0}", "assert char_freq('') == {'g': 0, 'l': 0}"], "test_code": "assert char_freq('coffee vector music python') == {'g': 0, 'l': 0}\nassert char_freq('signal at is') == {'g': 1, 'l': 1}\nassert char_freq('winter') == {'g': 0, 'l': 0}\nassert char_freq('engine falcon river up data') == {'g': 1, 'l': 1}\nassert char_freq('by in engine window') == {'g': 1, 'l': 0}\nassert char_freq('python orange winter rocket') == {'g': 1, 'l': 0}\nassert char_freq('') == {'g': 0, 'l': 0}", "answer": "def char_freq(s):\n return {c: s.count(c) for c in 'gl'}", "completion": " ```python\ndef char_freq(s):\n return {c: s.count(c) for c in 'gl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `char_freq(s)` تعيد dict يربط كل محرف من المحارف 'g'، 'l' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `char_freq('coffee vector music python')` يُرجع `{'g': 0, 'l': 0}`.\nالجواب:", "qhash": "6af796c04e50928b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('an vector a') == 'fs ajhytw f'", "assert shift_text('of cloud data !') == 'tk hqtzi ifyf !'", "assert shift_text('rocket garden table river we') == 'wthpjy lfwijs yfgqj wnajw bj'", "assert shift_text('summer planet') == 'xzrrjw uqfsjy'", "assert shift_text('go it up at 2024') == 'lt ny zu fy 2024'", "assert shift_text('orange camel go A1') == 'twfslj hfrjq lt A1'", "assert shift_text('') == ''"], "test_code": "assert shift_text('an vector a') == 'fs ajhytw f'\nassert shift_text('of cloud data !') == 'tk hqtzi ifyf !'\nassert shift_text('rocket garden table river we') == 'wthpjy lfwijs yfgqj wnajw bj'\nassert shift_text('summer planet') == 'xzrrjw uqfsjy'\nassert shift_text('go it up at 2024') == 'lt ny zu fy 2024'\nassert shift_text('orange camel go A1') == 'twfslj hfrjq lt A1'\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 + (-21)) % 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 + (-21)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `shift_text(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('an vector a')` يجب أن تُرجع `'fs ajhytw f'`.\nالجواب:", "qhash": "511efaf5b62a9e36"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([74, 69, 10, 83, 83, 21, 37, 84, 5, 38]) == 2", "assert div_not([63, 7, 1, 56, 31, -28, 7, -35, 3, 40]) == 1", "assert div_not([-32]) == 0", "assert div_not([-8, -7, 79, -23, 67, 77, 48, -34, 36]) == 0", "assert div_not([77, 8, 64, 16, 46, 19]) == 0", "assert div_not([66, 26, -23, 67, 29, 32]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([74, 69, 10, 83, 83, 21, 37, 84, 5, 38]) == 2\nassert div_not([63, 7, 1, 56, 31, -28, 7, -35, 3, 40]) == 1\nassert div_not([-32]) == 0\nassert div_not([-8, -7, 79, -23, 67, 77, 48, -34, 36]) == 0\nassert div_not([77, 8, 64, 16, 46, 19]) == 0\nassert div_not([66, 26, -23, 67, 29, 32]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `div_not([74, 69, 10, 83, 83, 21, 37, 84, 5, 38])` يُرجع `2`.\nالجواب:", "qhash": "de61747b8c3a55d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "tests": ["assert total_multiples(175) == 5134", "assert total_multiples(15) == 30", "assert total_multiples(279) == 12834", "assert total_multiples(149) == 3676", "assert total_multiples(180) == 5310", "assert total_multiples(19) == 64", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(175) == 5134\nassert total_multiples(15) == 30\nassert total_multiples(279) == 12834\nassert total_multiples(149) == 3676\nassert total_multiples(180) == 5310\nassert total_multiples(19) == 64\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 6.\nمثال: `total_multiples(175)` يجب أن تُرجع `5134`.\nالجواب:", "qhash": "62213d008e2f1ba9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('باب ميناء قمر سوق تفاحة بيت لغة') == 1", "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('باب ميناء قمر سوق تفاحة بيت لغة') == 1\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": "d9a346b653cf50ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "tests": ["assert mult_sum(100) == 2450", "assert mult_sum(28) == 182", "assert mult_sum(89) == 1980", "assert mult_sum(40) == 380", "assert mult_sum(31) == 240", "assert mult_sum(176) == 7656", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(100) == 2450\nassert mult_sum(28) == 182\nassert mult_sum(89) == 1980\nassert mult_sum(40) == 380\nassert mult_sum(31) == 240\nassert mult_sum(176) == 7656\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 2 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `mult_sum(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 2 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `mult_sum(100)` يُرجع `2450`.\nالجواب:", "qhash": "63e436dd92656af9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('تفاحة قلم همل سفينة همل') == 2", "assert prefix_hits('دفتر ماء مطر قهوة خبز مطر') == 0", "assert prefix_hits('برمجة همل لغة نهار دفتر جبل جبل') == 1", "assert prefix_hits('وردة همل سماء همل') == 2", "assert prefix_hits('همل نهر رمل برتقال مدينة فجر') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('همل باب مكتبة همل قهوة') == 2\nassert prefix_hits('تفاحة قلم همل سفينة همل') == 2\nassert prefix_hits('دفتر ماء مطر قهوة خبز مطر') == 0\nassert prefix_hits('برمجة همل لغة نهار دفتر جبل جبل') == 1\nassert prefix_hits('وردة همل سماء همل') == 2\nassert prefix_hits('همل نهر رمل برتقال مدينة فجر') == 1\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:\n if w.startswith('ه'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ه»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef prefix_hits(line):\n count = 0\n for w in line:\n if w.startswith('ه'):\n count += 1\n return count\n```\nمثال: `prefix_hits('همل باب مكتبة همل قهوة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "582ded3b52e23cd3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('is brain') == 'wg pfowb'", "assert rot('music go Hello') == 'aigwq uc Hszzc'", "assert rot('to code light an 2024') == 'hc qcrs zwuvh ob 2024'", "assert rot('data by data desert 2024') == 'roho pm roho rsgsfh 2024'", "assert rot('table by') == 'hopzs pm'", "assert rot('river it python vector') == 'fwjsf wh dmhvcb jsqhcf'", "assert rot('') == ''"], "test_code": "assert rot('is brain') == 'wg pfowb'\nassert rot('music go Hello') == 'aigwq uc Hszzc'\nassert rot('to code light an 2024') == 'hc qcrs zwuvh ob 2024'\nassert rot('data by data desert 2024') == 'roho pm roho rsgsfh 2024'\nassert rot('table by') == 'hopzs pm'\nassert rot('river it python vector') == 'fwjsf wh dmhvcb jsqhcf'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('is brain')` يجب أن تُرجع `'wg pfowb'`.\nالجواب:", "qhash": "d3d79659459a6956"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 88", "tests": ["assert dig_pow_mod(61914) == 19", "assert dig_pow_mod(288924) == 81", "assert dig_pow_mod(789501) == 44", "assert dig_pow_mod(63506) == 42", "assert dig_pow_mod(92939) == 68", "assert dig_pow_mod(652405) == 2", "assert dig_pow_mod(893731) == 21", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(61914) == 19\nassert dig_pow_mod(288924) == 81\nassert dig_pow_mod(789501) == 44\nassert dig_pow_mod(63506) == 42\nassert dig_pow_mod(92939) == 68\nassert dig_pow_mod(652405) == 2\nassert dig_pow_mod(893731) == 21\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 88", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 88\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `dig_pow_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 88.\nللتوضيح: الاستدعاء `dig_pow_mod(61914)` يُرجع `19`.\nالجواب:", "qhash": "fc404e9d8ef33302"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'hior'}", "tests": ["assert freq_of('planet river winter signal code it') == {'h': 0, 'i': 4, 'o': 1, 'r': 3}", "assert freq_of('table brain') == {'h': 0, 'i': 1, 'o': 0, 'r': 1}", "assert freq_of('is cloud') == {'h': 0, 'i': 1, 'o': 1, 'r': 0}", "assert freq_of('vector garden signal is rocket') == {'h': 0, 'i': 2, 'o': 2, 'r': 3}", "assert freq_of('cloud signal river at garden we') == {'h': 0, 'i': 2, 'o': 1, 'r': 3}", "assert freq_of('it rocket up up vector camel') == {'h': 0, 'i': 1, 'o': 2, 'r': 2}", "assert freq_of('') == {'h': 0, 'i': 0, 'o': 0, 'r': 0}"], "test_code": "assert freq_of('planet river winter signal code it') == {'h': 0, 'i': 4, 'o': 1, 'r': 3}\nassert freq_of('table brain') == {'h': 0, 'i': 1, 'o': 0, 'r': 1}\nassert freq_of('is cloud') == {'h': 0, 'i': 1, 'o': 1, 'r': 0}\nassert freq_of('vector garden signal is rocket') == {'h': 0, 'i': 2, 'o': 2, 'r': 3}\nassert freq_of('cloud signal river at garden we') == {'h': 0, 'i': 2, 'o': 1, 'r': 3}\nassert freq_of('it rocket up up vector camel') == {'h': 0, 'i': 1, 'o': 2, 'r': 2}\nassert freq_of('') == {'h': 0, 'i': 0, 'o': 0, 'r': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'hior'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'hior'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'h'، 'i'، 'o'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('planet river winter signal code it')` يجب أن تُرجع `{'h': 0, 'i': 4, 'o': 1, 'r': 3}`.\nالجواب:", "qhash": "6767bd928566a18c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 17", "tests": ["assert fact_mod(7) == 11", "assert fact_mod(26) == 0", "assert fact_mod(5) == 10", "assert fact_mod(14) == 12", "assert fact_mod(4) == 4", "assert fact_mod(32) == 0", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 11\nassert fact_mod(26) == 0\nassert fact_mod(5) == 10\nassert fact_mod(14) == 12\nassert fact_mod(4) == 4\nassert fact_mod(32) == 0\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 17", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 17 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(7)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "9f5a5517c91a2fb9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 4\nfor n in range(-5, 17, 3):\n result -= n * 3\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 4\nfor n in range(-5, 17, 3):\n result -= n * 3\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "45e654a7469a7027", "answer": "-128\n16", "completion": " الناتج:\n```text\n-128\n16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('to table by pixel garden brain') == 'brain garden pixel table'", "assert reverse_words('desert rocket pixel in we table rocket') == 'rocket table pixel rocket desert'", "assert reverse_words('summer river we falcon summer by planet') == 'planet summer falcon river summer'", "assert reverse_words('by an light') == 'light'", "assert reverse_words('rocket we desert camel signal') == 'signal camel desert rocket'", "assert reverse_words('python a stone apple') == 'apple stone python'", "assert reverse_words('table an') == 'table'"], "test_code": "assert reverse_words('to table by pixel garden brain') == 'brain garden pixel table'\nassert reverse_words('desert rocket pixel in we table rocket') == 'rocket table pixel rocket desert'\nassert reverse_words('summer river we falcon summer by planet') == 'planet summer falcon river summer'\nassert reverse_words('by an light') == 'light'\nassert reverse_words('rocket we desert camel signal') == 'signal camel desert rocket'\nassert reverse_words('python a stone apple') == 'apple stone python'\nassert reverse_words('table an') == 'table'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 3، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `reverse_words('to table by pixel garden brain')` يُرجع `'brain garden pixel table'`.\nالجواب:", "qhash": "df3c06308289e5c1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert mult_sum(65) == 330", "assert mult_sum(232) == 4446", "assert mult_sum(186) == 2790", "assert mult_sum(248) == 5166", "assert mult_sum(18) == 18", "assert mult_sum(100) == 816", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(65) == 330\nassert mult_sum(232) == 4446\nassert mult_sum(186) == 2790\nassert mult_sum(248) == 5166\nassert mult_sum(18) == 18\nassert mult_sum(100) == 816\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 % 12 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 12.\nمثال: `mult_sum(65)` يجب أن تُرجع `330`.\nالجواب:", "qhash": "7cbf8ef7129c9528"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return 4 * x ** 2 + (8) * x + (0)", "tests": ["assert evaluate(3) == 60", "assert evaluate(-11) == 396", "assert evaluate(5) == 140", "assert evaluate(-18) == 1152", "assert evaluate(-16) == 896", "assert evaluate(6) == 192", "assert evaluate(19) == 1596", "assert evaluate(0) == 0"], "test_code": "assert evaluate(3) == 60\nassert evaluate(-11) == 396\nassert evaluate(5) == 140\nassert evaluate(-18) == 1152\nassert evaluate(-16) == 896\nassert evaluate(6) == 192\nassert evaluate(19) == 1596\nassert evaluate(0) == 0", "answer": "def evaluate(x):\n return 4 * x ** 2 + (8) * x + (0)", "completion": " ```python\ndef evaluate(x):\n return 4 * x ** 2 + (8) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار 4x² + 8x + 0 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(3)` يُرجع `60`.\nالجواب:", "qhash": "e1ddc39dbf4bc4dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert mult_sum(150) == 1800", "assert mult_sum(118) == 1140", "assert mult_sum(96) == 720", "assert mult_sum(205) == 3572", "assert mult_sum(169) == 2436", "assert mult_sum(62) == 332", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(150) == 1800\nassert mult_sum(118) == 1140\nassert mult_sum(96) == 720\nassert mult_sum(205) == 3572\nassert mult_sum(169) == 2436\nassert mult_sum(62) == 332\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 % 12 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 8 أو على 12.\nمثال: `mult_sum(150)` يجب أن تُرجع `1800`.\nالجواب:", "qhash": "fcbd9b7a52af9c1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 47:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([21, 23, 20, 7, 7]) == [21, 44, 0, 7, 14]", "assert running_sum([8, -5, 45, 18, 14, 14, 28, 28, -5]) == [8, 3, 0, 18, 32, 46, 0, 28, 23]", "assert running_sum([]) == []", "assert running_sum([12, 7, -7, 20, 10, -1, 0]) == [12, 19, 12, 32, 42, 41, 41]", "assert running_sum([44, 16, 19, 36, 4, 41, 11, 22]) == [44, 0, 19, 0, 4, 45, 0, 22]", "assert running_sum([13, 41]) == [13, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([21, 23, 20, 7, 7]) == [21, 44, 0, 7, 14]\nassert running_sum([8, -5, 45, 18, 14, 14, 28, 28, -5]) == [8, 3, 0, 18, 32, 46, 0, 28, 23]\nassert running_sum([]) == []\nassert running_sum([12, 7, -7, 20, 10, -1, 0]) == [12, 19, 12, 32, 42, 41, 41]\nassert running_sum([44, 16, 19, 36, 4, 41, 11, 22]) == [44, 0, 19, 0, 4, 45, 0, 22]\nassert running_sum([13, 41]) == [13, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 47:\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 > 47:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `running_sum(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 47 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `running_sum([21, 23, 20, 7, 7])` يجب أن تُرجع `[21, 44, 0, 7, 14]`.\nالجواب:", "qhash": "7d8b52aaa12f328b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "data = [25, 27, -7, 23, -7, 24, 31, 19, 19]\nprint(data[2:7])\nprint(data[::-1])\nprint(len(data[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndata = [25, 27, -7, 23, -7, 24, 31, 19, 19]\nprint(data[2:7])\nprint(data[::-1])\nprint(len(data[2:7]))\n```\nالجواب:", "qhash": "7d7cc7506448c880", "answer": "[-7, 23, -7, 24, 31]\n[19, 19, 31, 24, -7, 23, -7, 27, 25]\n5", "completion": " الناتج:\n```text\n[-7, 23, -7, 24, 31]\n[19, 19, 31, 24, -7, 23, -7, 27, 25]\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(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_list([0, 6, 7, 0, 45]) == [45, 0, 6, 7, 0]", "assert rotate_list([50, 1, -2]) == [50, 1, -2]", "assert rotate_list([-9, 9, 36, 31, -8, 1, 10, 14, -4, 1, 36, 36]) == [10, 14, -4, 1, 36, 36, -9, 9, 36, 31, -8, 1]", "assert rotate_list([43, 5, 13, 30]) == [13, 30, 43, 5]", "assert rotate_list([-4, 42, -3, 34, -1, 1, 2, 37, -1]) == [34, -1, 1, 2, 37, -1, -4, 42, -3]", "assert rotate_list([25]) == [25]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([0, 6, 7, 0, 45]) == [45, 0, 6, 7, 0]\nassert rotate_list([50, 1, -2]) == [50, 1, -2]\nassert rotate_list([-9, 9, 36, 31, -8, 1, 10, 14, -4, 1, 36, 36]) == [10, 14, -4, 1, 36, 36, -9, 9, 36, 31, -8, 1]\nassert rotate_list([43, 5, 13, 30]) == [13, 30, 43, 5]\nassert rotate_list([-4, 42, -3, 34, -1, 1, 2, 37, -1]) == [34, -1, 1, 2, 37, -1, -4, 42, -3]\nassert rotate_list([25]) == [25]\nassert rotate_list([]) == []", "answer": "def rotate_list(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_list(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_list(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([0, 6, 7, 0, 45])` يُرجع `[45, 0, 6, 7, 0]`.\nالجواب:", "qhash": "f097f649177dda3a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ehno'}", "tests": ["assert freq_of('camel it') == {'e': 1, 'h': 0, 'n': 0, 'o': 0}", "assert freq_of('by engine of by to') == {'e': 2, 'h': 0, 'n': 2, 'o': 2}", "assert freq_of('desert falcon table pixel brain winter') == {'e': 5, 'h': 0, 'n': 3, 'o': 1}", "assert freq_of('summer on in garden on planet') == {'e': 3, 'h': 0, 'n': 5, 'o': 2}", "assert freq_of('an rocket brain') == {'e': 1, 'h': 0, 'n': 2, 'o': 1}", "assert freq_of('music') == {'e': 0, 'h': 0, 'n': 0, 'o': 0}", "assert freq_of('') == {'e': 0, 'h': 0, 'n': 0, 'o': 0}"], "test_code": "assert freq_of('camel it') == {'e': 1, 'h': 0, 'n': 0, 'o': 0}\nassert freq_of('by engine of by to') == {'e': 2, 'h': 0, 'n': 2, 'o': 2}\nassert freq_of('desert falcon table pixel brain winter') == {'e': 5, 'h': 0, 'n': 3, 'o': 1}\nassert freq_of('summer on in garden on planet') == {'e': 3, 'h': 0, 'n': 5, 'o': 2}\nassert freq_of('an rocket brain') == {'e': 1, 'h': 0, 'n': 2, 'o': 1}\nassert freq_of('music') == {'e': 0, 'h': 0, 'n': 0, 'o': 0}\nassert freq_of('') == {'e': 0, 'h': 0, 'n': 0, 'o': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ehno'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ehno'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'h'، 'n'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('camel it')` يُرجع `{'e': 1, 'h': 0, 'n': 0, 'o': 0}`.\nالجواب:", "qhash": "eaa00c2af765ac9a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert caesar('a we OK') == 'e ai OK'", "assert caesar('of 2024') == 'sj 2024'", "assert caesar('is') == 'mw'", "assert caesar('an banana vector 2024') == 'er ferere zigxsv 2024'", "assert caesar('winter Hello') == 'amrxiv Hipps'", "assert caesar('signal music A1') == 'wmkrep qywmg A1'", "assert caesar('') == ''"], "test_code": "assert caesar('a we OK') == 'e ai OK'\nassert caesar('of 2024') == 'sj 2024'\nassert caesar('is') == 'mw'\nassert caesar('an banana vector 2024') == 'er ferere zigxsv 2024'\nassert caesar('winter Hello') == 'amrxiv Hipps'\nassert caesar('signal music A1') == 'wmkrep qywmg A1'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `caesar(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `caesar('a we OK')` يُرجع `'e ai OK'`.\nالجواب:", "qhash": "333dbe0b72c277a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "count_hits", "reference": "def count_hits(text):\n return sum(1 for w in text.split() if w.startswith('ب'))", "tests": ["assert count_hits('بحر بيت طالب دفتر سماء فجر') == 2", "assert count_hits('سوق جبل نهر برمجة باب سيارة سماء') == 2", "assert count_hits('فجر معلم') == 0", "assert count_hits('طائرة') == 0", "assert count_hits('تفاحة علم صديق عمل وردة سفينة برتقال') == 1", "assert count_hits('تفاحة قمر باب') == 1", "assert count_hits('رمل باب سلام معلم بيت سماء') == 2", "assert count_hits('') == 0"], "test_code": "assert count_hits('بحر بيت طالب دفتر سماء فجر') == 2\nassert count_hits('سوق جبل نهر برمجة باب سيارة سماء') == 2\nassert count_hits('فجر معلم') == 0\nassert count_hits('طائرة') == 0\nassert count_hits('تفاحة علم صديق عمل وردة سفينة برتقال') == 1\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('بحر بيت طالب دفتر سماء فجر')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "d486b6a287d3636c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "step_product", "reference": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "tests": ["assert step_product(10) == 13", "assert step_product(8) == 40", "assert step_product(55) == 0", "assert step_product(10) == 13", "assert step_product(45) == 0", "assert step_product(54) == 32", "assert step_product(0) == 1"], "test_code": "assert step_product(10) == 13\nassert step_product(8) == 40\nassert step_product(55) == 0\nassert step_product(10) == 13\nassert step_product(45) == 0\nassert step_product(54) == 32\nassert step_product(0) == 1", "answer": "def step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43", "completion": " ```python\ndef step_product(n):\n if n <= 0:\n return 1\n return (n * step_product(n - 2)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 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": "8a280254f7bb4eb6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 41\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 = 41\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": "745e937268231288", "answer": "109", "completion": " الناتج:\n```text\n109\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([9, 22, 18, 79, 20, 80, 78, 40, 64]) == [9, 31, 49, 128, 148, 0, 78, 118, 0]", "assert cumulative([176, 137, 93, 147]) == [176, 0, 93, 0]", "assert cumulative([110, 147]) == [110, 0]", "assert cumulative([130, 114, 102, 87, 31, 163, 64, 8, 115, 146]) == [130, 0, 102, 0, 31, 0, 64, 72, 0, 146]", "assert cumulative([]) == []", "assert cumulative([106, 141, 29]) == [106, 0, 29]", "assert cumulative([]) == []"], "test_code": "assert cumulative([9, 22, 18, 79, 20, 80, 78, 40, 64]) == [9, 31, 49, 128, 148, 0, 78, 118, 0]\nassert cumulative([176, 137, 93, 147]) == [176, 0, 93, 0]\nassert cumulative([110, 147]) == [110, 0]\nassert cumulative([130, 114, 102, 87, 31, 163, 64, 8, 115, 146]) == [130, 0, 102, 0, 31, 0, 64, 72, 0, 146]\nassert cumulative([]) == []\nassert cumulative([106, 141, 29]) == [106, 0, 29]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 178:\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 > 178:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 178 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([9, 22, 18, 79, 20, 80, 78, 40, 64])` يُرجع `[9, 31, 49, 128, 148, 0, 78, 118, 0]`.\nالجواب:", "qhash": "c9bd46dea891d634"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 8 * x ** 2 + (-9) * x + (7)", "tests": ["assert value_at(6) == 241", "assert value_at(10) == 717", "assert value_at(15) == 1672", "assert value_at(13) == 1242", "assert value_at(-9) == 736", "assert value_at(15) == 1672", "assert value_at(-4) == 171", "assert value_at(0) == 7"], "test_code": "assert value_at(6) == 241\nassert value_at(10) == 717\nassert value_at(15) == 1672\nassert value_at(13) == 1242\nassert value_at(-9) == 736\nassert value_at(15) == 1672\nassert value_at(-4) == 171\nassert value_at(0) == 7", "answer": "def value_at(x):\n return 8 * x ** 2 + (-9) * x + (7)", "completion": " ```python\ndef value_at(x):\n return 8 * x ** 2 + (-9) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 8x² - 9x + 7 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(6)` يُرجع `241`.\nالجواب:", "qhash": "19e153972b470825"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 11907\nc = 0\nwhile n > 9:\n n = n // 3\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 11907\nc = 0\nwhile n > 9:\n n = n // 3\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "57a9a1b143b750ed", "answer": "5 7", "completion": " الناتج:\n```text\n5 7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_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 tally_div([27, 59, 16, 13, 22, 25, 30, 51]) == 0", "assert tally_div([-27, 9, 56, -9]) == 1", "assert tally_div([-40, 31, 78, -22, 67, 63, -25, 72, 90]) == 0", "assert tally_div([-16, -21, 57, 15]) == 1", "assert tally_div([-31, 7, 69, 10]) == 1", "assert tally_div([63, 60, -27, 80, 65, -38, -30, -8, 41, 7, 61]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([27, 59, 16, 13, 22, 25, 30, 51]) == 0\nassert tally_div([-27, 9, 56, -9]) == 1\nassert tally_div([-40, 31, 78, -22, 67, 63, -25, 72, 90]) == 0\nassert tally_div([-16, -21, 57, 15]) == 1\nassert tally_div([-31, 7, 69, 10]) == 1\nassert tally_div([63, 60, -27, 80, 65, -38, -30, -8, 41, 7, 61]) == 1\nassert tally_div([]) == 0", "answer": "def tally_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 tally_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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `tally_div([27, 59, 16, 13, 22, 25, 30, 51])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "a3c40abe8d45fa5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "game", "reference": "def game(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 game(10) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10']", "assert game(3) == ['1', '2', '3']", "assert game(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']", "assert game(3) == ['1', '2', '3']", "assert game(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15']"], "test_code": "assert game(10) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10']\nassert game(3) == ['1', '2', '3']\nassert game(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']\nassert game(3) == ['1', '2', '3']\nassert game(15) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15']", "answer": "def game(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 game(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سؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 7 أضف 'Fizz'، وإن قَبِلها على 9 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(10)` يُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10']`.\nالجواب:", "qhash": "63f5c560e71584dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 90) == 1)", "tests": ["assert phi_upto(45) == 12", "assert phi_upto(163) == 44", "assert phi_upto(164) == 44", "assert phi_upto(159) == 42", "assert phi_upto(121) == 33", "assert phi_upto(86) == 23", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(45) == 12\nassert phi_upto(163) == 44\nassert phi_upto(164) == 44\nassert phi_upto(159) == 42\nassert phi_upto(121) == 33\nassert phi_upto(86) == 23\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, 90) == 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, 90) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `phi_upto(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 90) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `phi_upto(45)` يُرجع `12`.\nالجواب:", "qhash": "174ff3a29b5a8857"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "reset_sum", "reference": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\n s = 0\n out.append(s)\n return out", "tests": ["assert reset_sum([14, 14, 35, 21, 23, 38, 5]) == [14, 28, 63, 0, 23, 61, 66]", "assert reset_sum([75, 70, 13, 7]) == [75, 0, 13, 20]", "assert reset_sum([8]) == [8]", "assert reset_sum([27]) == [27]", "assert reset_sum([17]) == [17]", "assert reset_sum([20, 15, -2, 40]) == [20, 35, 33, 73]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([14, 14, 35, 21, 23, 38, 5]) == [14, 28, 63, 0, 23, 61, 66]\nassert reset_sum([75, 70, 13, 7]) == [75, 0, 13, 20]\nassert reset_sum([8]) == [8]\nassert reset_sum([27]) == [27]\nassert reset_sum([17]) == [17]\nassert reset_sum([20, 15, -2, 40]) == [20, 35, 33, 73]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\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 > 75:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `reset_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 75 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `reset_sum([14, 14, 35, 21, 23, 38, 5])` يُرجع `[14, 28, 63, 0, 23, 61, 66]`.\nالجواب:", "qhash": "97f9f6d60c17d8d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'coffee'\nprint(s[-4:])\nprint(s[0:5])\nprint(s.find('c'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'coffee'\nprint(s[-4:])\nprint(s[0:5])\nprint(s.find('c'))\n```\nالجواب:", "qhash": "3c814f5516dc6506", "answer": "ffee\ncoffe\n0", "completion": " الناتج:\n```text\nffee\ncoffe\n0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'حسن': 33, 'خالد': 15, 'وليد': 37, 'منى': 23}\npoints['حسن'] += 8\npoints['سلمى'] = 36\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 = {'حسن': 33, 'خالد': 15, 'وليد': 37, 'منى': 23}\npoints['حسن'] += 8\npoints['سلمى'] = 36\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": "f4fe4ca0e16d8d7d", "answer": "5\nحسن\n152\n[('خالد', 15), ('منى', 23)]", "completion": " الناتج:\n```text\n5\nحسن\n152\n[('خالد', 15), ('منى', 23)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [13, 30, 4, -1, -7, -8, 38]\nprint(xs[3:4])\nprint(xs[::3])\nprint(len(xs[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [13, 30, 4, -1, -7, -8, 38]\nprint(xs[3:4])\nprint(xs[::3])\nprint(len(xs[3:4]))\n```\nالجواب:", "qhash": "a739778f241a1da7", "answer": "[-1]\n[13, -1, 38]\n1", "completion": " الناتج:\n```text\n[-1]\n[13, -1, 38]\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'iru'}", "tests": ["assert freq_of('data code table at') == {'i': 0, 'r': 0, 'u': 0}", "assert freq_of('falcon of cloud apple an') == {'i': 0, 'r': 0, 'u': 1}", "assert freq_of('code window up an is') == {'i': 2, 'r': 0, 'u': 1}", "assert freq_of('is on apple to orange') == {'i': 1, 'r': 1, 'u': 0}", "assert freq_of('to') == {'i': 0, 'r': 0, 'u': 0}", "assert freq_of('signal code winter summer pixel') == {'i': 3, 'r': 2, 'u': 1}", "assert freq_of('') == {'i': 0, 'r': 0, 'u': 0}"], "test_code": "assert freq_of('data code table at') == {'i': 0, 'r': 0, 'u': 0}\nassert freq_of('falcon of cloud apple an') == {'i': 0, 'r': 0, 'u': 1}\nassert freq_of('code window up an is') == {'i': 2, 'r': 0, 'u': 1}\nassert freq_of('is on apple to orange') == {'i': 1, 'r': 1, 'u': 0}\nassert freq_of('to') == {'i': 0, 'r': 0, 'u': 0}\nassert freq_of('signal code winter summer pixel') == {'i': 3, 'r': 2, 'u': 1}\nassert freq_of('') == {'i': 0, 'r': 0, 'u': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'iru'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'iru'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'i'، 'r'، 'u' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('data code table at')` يجب أن تُرجع `{'i': 0, 'r': 0, 'u': 0}`.\nالجواب:", "qhash": "72688bdd31cc1262"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert count_div([62, 3, 1, 33, 39, 56, 84, 74, 52, 4]) == 1", "assert count_div([80]) == 0", "assert count_div([-11, 7, 23, 27, -2, 4]) == 0", "assert count_div([7, 36, 9, 64, 20, -9, 67, -39, 6, 43, -2, 38]) == 2", "assert count_div([19, 68, 44, 18, 88, 2, -24, -18]) == 3", "assert count_div([63, 54, -21, 14, -29, 7, 54, 61, 11]) == 2", "assert count_div([]) == 0"], "test_code": "assert count_div([62, 3, 1, 33, 39, 56, 84, 74, 52, 4]) == 1\nassert count_div([80]) == 0\nassert count_div([-11, 7, 23, 27, -2, 4]) == 0\nassert count_div([7, 36, 9, 64, 20, -9, 67, -39, 6, 43, -2, 38]) == 2\nassert count_div([19, 68, 44, 18, 88, 2, -24, -18]) == 3\nassert count_div([63, 54, -21, 14, -29, 7, 54, 61, 11]) == 2\nassert count_div([]) == 0", "answer": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([62, 3, 1, 33, 39, 56, 84, 74, 52, 4])` يُرجع `1`.\nالجواب:", "qhash": "530ae6f4f2c524d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#1", "code": "lst = [24, 34, 13, 20, 32, 6, 17]\nprint(lst[1:3])\nprint(lst[::2])\nprint(sum(lst[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nlst = [24, 34, 13, 20, 32, 6, 17]\nprint(lst[1:3])\nprint(lst[::2])\nprint(sum(lst[1:3]))\n```\nالجواب:", "qhash": "5a01a4fab32c0fba", "answer": "[34, 13]\n[24, 13, 32, 17]\n47", "completion": " الناتج:\n```text\n[34, 13]\n[24, 13, 32, 17]\n47\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "w = 'طالب سفينة'\nprint(w.count('ت'))\nprint(len(w))\nprint('ت' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nw = 'طالب سفينة'\nprint(w.count('ت'))\nprint(len(w))\nprint('ت' in w)\n```\nالجواب:", "qhash": "51ac06cf276e65e6", "answer": "0\n10\nFalse", "completion": " الناتج:\n```text\n0\n10\nFalse\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'ego'}", "tests": ["assert freq_of('up falcon falcon') == {'e': 0, 'g': 0, 'o': 2}", "assert freq_of('matrix coffee falcon') == {'e': 2, 'g': 0, 'o': 2}", "assert freq_of('of orange to') == {'e': 1, 'g': 1, 'o': 3}", "assert freq_of('river window planet brain stone') == {'e': 3, 'g': 0, 'o': 2}", "assert freq_of('stone music vector banana brain') == {'e': 2, 'g': 0, 'o': 2}", "assert freq_of('table an summer data summer rocket') == {'e': 4, 'g': 0, 'o': 1}", "assert freq_of('') == {'e': 0, 'g': 0, 'o': 0}"], "test_code": "assert freq_of('up falcon falcon') == {'e': 0, 'g': 0, 'o': 2}\nassert freq_of('matrix coffee falcon') == {'e': 2, 'g': 0, 'o': 2}\nassert freq_of('of orange to') == {'e': 1, 'g': 1, 'o': 3}\nassert freq_of('river window planet brain stone') == {'e': 3, 'g': 0, 'o': 2}\nassert freq_of('stone music vector banana brain') == {'e': 2, 'g': 0, 'o': 2}\nassert freq_of('table an summer data summer rocket') == {'e': 4, 'g': 0, 'o': 1}\nassert freq_of('') == {'e': 0, 'g': 0, 'o': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'ego'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'ego'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'e'، 'g'، 'o' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('up falcon falcon')` يُرجع `{'e': 0, 'g': 0, 'o': 2}`.\nالجواب:", "qhash": "9db02f98c3b96aa4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\n s = 0\n out.append(s)\n return out", "tests": ["assert capped_cumsum([5, 7, 35, 28, 40, 35]) == [5, 12, 47, 75, 0, 35]", "assert capped_cumsum([66, 20, 26]) == [66, 0, 26]", "assert capped_cumsum([62, 14, 46, 62, 50, 10, 42, 22]) == [62, 0, 46, 0, 50, 60, 0, 22]", "assert capped_cumsum([59, 29, -3, 21, 69, -2, 52, 4, 4, 48]) == [59, 0, -3, 18, 0, -2, 50, 54, 58, 0]", "assert capped_cumsum([-1, 32]) == [-1, 31]", "assert capped_cumsum([69, 33, 65, 2, 38, 38, 49]) == [69, 0, 65, 67, 0, 38, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([5, 7, 35, 28, 40, 35]) == [5, 12, 47, 75, 0, 35]\nassert capped_cumsum([66, 20, 26]) == [66, 0, 26]\nassert capped_cumsum([62, 14, 46, 62, 50, 10, 42, 22]) == [62, 0, 46, 0, 50, 60, 0, 22]\nassert capped_cumsum([59, 29, -3, 21, 69, -2, 52, 4, 4, 48]) == [59, 0, -3, 18, 0, -2, 50, 54, 58, 0]\nassert capped_cumsum([-1, 32]) == [-1, 31]\nassert capped_cumsum([69, 33, 65, 2, 38, 38, 49]) == [69, 0, 65, 67, 0, 38, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 75:\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 > 75:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `capped_cumsum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 75 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `capped_cumsum([5, 7, 35, 28, 40, 35])` يُرجع `[5, 12, 47, 75, 0, 35]`.\nالجواب:", "qhash": "df005a14c2042f63"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [19, -15, 11, 34, 11, 13, 20, 8]\nprint(sorted(nums, key=lambda x: (abs(x - 16), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [19, -15, 11, 34, 11, 13, 20, 8]\nprint(sorted(nums, key=lambda x: (abs(x - 16), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "99d8326b8e4c477d", "answer": "[13, 19, 20, 11, 11, 8, 34, -15]\n[34, 20, 19]", "completion": " الناتج:\n```text\n[13, 19, 20, 11, 11, 8, 34, -15]\n[34, 20, 19]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'حسن': 43, 'نور': 16, 'ليلى': 6, 'سعيد': 41}\nmarks['سعيد'] += 15\nmarks['عمر'] = 41\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 23])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nmarks = {'حسن': 43, 'نور': 16, 'ليلى': 6, 'سعيد': 41}\nmarks['سعيد'] += 15\nmarks['عمر'] = 41\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 23])\n```\nالجواب:", "qhash": "72fae0ba585af95c", "answer": "5\nسعيد\n162\n['حسن', 'سعيد', 'عمر']", "completion": " الناتج:\n```text\n5\nسعيد\n162\n['حسن', 'سعيد', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 21\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 = 21\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": "05c8b64eed1f7295", "answer": "7", "completion": " الناتج:\n```text\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'يوسف': 43, 'وليد': 26, 'فيصل': 25, 'راشد': 48}\nscores['فيصل'] += 12\nscores['سعيد'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'يوسف': 43, 'وليد': 26, 'فيصل': 25, 'راشد': 48}\nscores['فيصل'] += 12\nscores['سعيد'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('علي', -1))\n```\nالجواب:", "qhash": "335bea88b543550e", "answer": "5\nسعيد\n214\n-1", "completion": " الناتج:\n```text\n5\nسعيد\n214\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -6 * x ** 2 + (7) * x + (-6)", "tests": ["assert eval_poly(3) == -39", "assert eval_poly(10) == -536", "assert eval_poly(-3) == -81", "assert eval_poly(-14) == -1280", "assert eval_poly(7) == -251", "assert eval_poly(-13) == -1111", "assert eval_poly(2) == -16", "assert eval_poly(0) == -6"], "test_code": "assert eval_poly(3) == -39\nassert eval_poly(10) == -536\nassert eval_poly(-3) == -81\nassert eval_poly(-14) == -1280\nassert eval_poly(7) == -251\nassert eval_poly(-13) == -1111\nassert eval_poly(2) == -16\nassert eval_poly(0) == -6", "answer": "def eval_poly(x):\n return -6 * x ** 2 + (7) * x + (-6)", "completion": " ```python\ndef eval_poly(x):\n return -6 * x ** 2 + (7) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -6x² + 7x - 6 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(3)` يُرجع `-39`.\nالجواب:", "qhash": "f4a87d5fcc2a6dfb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(443478049))\nprint(f(f(443478049)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef f(n):\n if n < 10:\n return n\n return n % 10 + f(n // 10)\n\nprint(f(443478049))\nprint(f(f(443478049)))\n```\nالجواب:", "qhash": "80f7e4fe8ccf8303", "answer": "43\n7", "completion": " الناتج:\n```text\n43\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('in winter') == 'qv eqvbmz'", "assert encode('banana stone !') == 'jivivi abwvm !'", "assert encode('pixel pixel matrix orange camel Hello') == 'xqfmt xqfmt uibzqf wzivom kiumt Hmttw'", "assert encode('brain a winter a') == 'jziqv i eqvbmz i'", "assert encode('engine coffee pixel by !') == 'mvoqvm kwnnmm xqfmt jg !'", "assert encode('stone apple garden coffee !') == 'abwvm ixxtm oizlmv kwnnmm !'", "assert encode('') == ''"], "test_code": "assert encode('in winter') == 'qv eqvbmz'\nassert encode('banana stone !') == 'jivivi abwvm !'\nassert encode('pixel pixel matrix orange camel Hello') == 'xqfmt xqfmt uibzqf wzivom kiumt Hmttw'\nassert encode('brain a winter a') == 'jziqv i eqvbmz i'\nassert encode('engine coffee pixel by !') == 'mvoqvm kwnnmm xqfmt jg !'\nassert encode('stone apple garden coffee !') == 'abwvm ixxtm oizlmv kwnnmm !'\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 + (-18)) % 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 + (-18)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 18 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('in winter')` يُرجع `'qv eqvbmz'`.\nالجواب:", "qhash": "6fd51b4fe56ddf2e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 54) == 1)", "tests": ["assert rel_prime_count(91) == 31", "assert rel_prime_count(107) == 36", "assert rel_prime_count(10) == 3", "assert rel_prime_count(200) == 67", "assert rel_prime_count(162) == 54", "assert rel_prime_count(10) == 3", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(91) == 31\nassert rel_prime_count(107) == 36\nassert rel_prime_count(10) == 3\nassert rel_prime_count(200) == 67\nassert rel_prime_count(162) == 54\nassert rel_prime_count(10) == 3\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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rel_prime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 54) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `rel_prime_count(91)` يُرجع `31`.\nالجواب:", "qhash": "b51ae1b79ded4983"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "best_multiple", "reference": "def best_multiple(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 best_multiple([16, -5, 1, 27, -14, 54, -22, -4]) == 16", "assert best_multiple([-16, -24, -16]) == -16", "assert best_multiple([1, 9, 17, 25]) == None", "assert best_multiple([-7, -27, 0, -39, 39, 21, -14, 36, 0]) == 0", "assert best_multiple([-34, -37, -16, -7, -16, -37, -47, -8, -48]) == -8", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([16, -5, 1, 27, -14, 54, -22, -4]) == 16\nassert best_multiple([-16, -24, -16]) == -16\nassert best_multiple([1, 9, 17, 25]) == None\nassert best_multiple([-7, -27, 0, -39, 39, 21, -14, 36, 0]) == 0\nassert best_multiple([-34, -37, -16, -7, -16, -37, -47, -8, -48]) == -8\nassert best_multiple([]) == None", "answer": "def best_multiple(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 best_multiple(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 best_multiple(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 best_multiple(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للتوضيح: الاستدعاء `best_multiple([16, -5, 1, 27, -14, 54, -22, -4])` يُرجع `16`.\nالجواب:", "qhash": "f02f497af4a3144b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 9 == 0)", "tests": ["assert sum_div(272) == 12285", "assert sum_div(95) == 1488", "assert sum_div(199) == 6633", "assert sum_div(150) == 3675", "assert sum_div(44) == 315", "assert sum_div(107) == 1890", "assert sum_div(1) == 0"], "test_code": "assert sum_div(272) == 12285\nassert sum_div(95) == 1488\nassert sum_div(199) == 6633\nassert sum_div(150) == 3675\nassert sum_div(44) == 315\nassert sum_div(107) == 1890\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 % 9 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 9.\nمثال: `sum_div(272)` يجب أن تُرجع `12285`.\nالجواب:", "qhash": "d0290c33abfb9191"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#1", "code": "points = {'راشد': 43, 'زينب': 48, 'خالد': 36}\npoints['راشد'] += 1\npoints['علي'] = 7\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 = {'راشد': 43, 'زينب': 48, 'خالد': 36}\npoints['راشد'] += 1\npoints['علي'] = 7\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": "5e28deee693bd83f", "answer": "4\nزينب\n135\n[('علي', 7), ('خالد', 36)]", "completion": " الناتج:\n```text\n4\nزينب\n135\n[('علي', 7), ('خالد', 36)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 3 * x ** 2 + (2) * x + (2)", "tests": ["assert value_at(9) == 263", "assert value_at(-1) == 3", "assert value_at(7) == 163", "assert value_at(2) == 18", "assert value_at(18) == 1010", "assert value_at(6) == 122", "assert value_at(8) == 210", "assert value_at(0) == 2"], "test_code": "assert value_at(9) == 263\nassert value_at(-1) == 3\nassert value_at(7) == 163\nassert value_at(2) == 18\nassert value_at(18) == 1010\nassert value_at(6) == 122\nassert value_at(8) == 210\nassert value_at(0) == 2", "answer": "def value_at(x):\n return 3 * x ** 2 + (2) * x + (2)", "completion": " ```python\ndef value_at(x):\n return 3 * x ** 2 + (2) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 3x² + 2x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(9)` يُرجع `263`.\nالجواب:", "qhash": "4f027a037f78637a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert game(16) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16']", "assert game(9) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz']", "assert game(12) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz']", "assert game(16) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16']", "assert game(25) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16', '17', 'Fizz', '19', 'Buzz', 'Fizz', '22', '23', 'Fizz', 'Buzz']"], "test_code": "assert game(16) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16']\nassert game(9) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz']\nassert game(12) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz']\nassert game(16) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16']\nassert game(25) == ['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16', '17', 'Fizz', '19', 'Buzz', 'Fizz', '22', '23', 'Fizz', 'Buzz']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 3 == 0:\n s += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\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 += 'Fizz'\n if i % 5 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 3 يُستبدل بـ 'Fizz'، وعلى 5 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(16)` يجب أن تُرجع `['1', '2', 'Fizz', '4', 'Buzz', 'Fizz', '7', '8', 'Fizz', 'Buzz', '11', 'Fizz', '13', '14', 'FizzBuzz', '16']`.\nالجواب:", "qhash": "0f792bf8dd81437a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [3, 16, 31, 34, -8, -3]\nprint(lst[1:6])\nprint(lst[::3])\nprint(max(lst[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [3, 16, 31, 34, -8, -3]\nprint(lst[1:6])\nprint(lst[::3])\nprint(max(lst[1:6]))\n```\nالجواب:", "qhash": "371a558fbf8145e6", "answer": "[16, 31, 34, -8, -3]\n[3, 34]\n34", "completion": " الناتج:\n```text\n[16, 31, 34, -8, -3]\n[3, 34]\n34\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('علم علم عمل مدرسة سوق سيارة علم') == 4", "assert count_initial('كتاب ميناء ميناء عربية نهار عربية') == 2", "assert count_initial('باب ماء علم طائرة شجرة مطر برمجة') == 1", "assert count_initial('طائرة ليل تفاحة سماء حديقة') == 0", "assert count_initial('عربية عربية عربية قمر علم') == 4", "assert count_initial('ليل جمل مكتبة') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('علم علم عمل مدرسة سوق سيارة علم') == 4\nassert count_initial('كتاب ميناء ميناء عربية نهار عربية') == 2\nassert count_initial('باب ماء علم طائرة شجرة مطر برمجة') == 1\nassert count_initial('طائرة ليل تفاحة سماء حديقة') == 0\nassert count_initial('عربية عربية عربية قمر علم') == 4\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('علم علم عمل مدرسة سوق سيارة علم')` يجب أن تُرجع `4`.\nالجواب:", "qhash": "8f8442c3e692aa17"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('signal cloud') == 'qgelyj ajmsb'", "assert shift_letters('by stone data A1') == 'zw qrmlc byry A1'", "assert shift_letters('camel light engine orange pixel 2024') == 'aykcj jgefr cleglc mpylec ngvcj 2024'", "assert shift_letters('vector summer matrix on Hello') == 'tcarmp qskkcp kyrpgv ml Hcjjm'", "assert shift_letters('it code !') == 'gr ambc !'", "assert shift_letters('on by') == 'ml zw'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('signal cloud') == 'qgelyj ajmsb'\nassert shift_letters('by stone data A1') == 'zw qrmlc byry A1'\nassert shift_letters('camel light engine orange pixel 2024') == 'aykcj jgefr cleglc mpylec ngvcj 2024'\nassert shift_letters('vector summer matrix on Hello') == 'tcarmp qskkcp kyrpgv ml Hcjjm'\nassert shift_letters('it code !') == 'gr ambc !'\nassert shift_letters('on by') == 'ml zw'\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 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('signal cloud')` يُرجع `'qgelyj ajmsb'`.\nالجواب:", "qhash": "dab14f063cba7aa9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('سيارة لغة لغة') == 0", "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('سيارة لغة لغة') == 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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ك»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('نور حاسوب صديق عربية كتاب سماء ماء')` يُرجع `1`.\nالجواب:", "qhash": "f3c1ac1af2283a5c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('winter camel river') == 'xjoufs dbnfm sjwfs'", "assert cipher('go data garden python summer OK') == 'hp ebub hbsefo qzuipo tvnnfs OK'", "assert cipher('we') == 'xf'", "assert cipher('winter signal stone') == 'xjoufs tjhobm tupof'", "assert cipher('desert by by summer table') == 'eftfsu cz cz tvnnfs ubcmf'", "assert cipher('cloud music music A1') == 'dmpve nvtjd nvtjd A1'", "assert cipher('') == ''"], "test_code": "assert cipher('winter camel river') == 'xjoufs dbnfm sjwfs'\nassert cipher('go data garden python summer OK') == 'hp ebub hbsefo qzuipo tvnnfs OK'\nassert cipher('we') == 'xf'\nassert cipher('winter signal stone') == 'xjoufs tjhobm tupof'\nassert cipher('desert by by summer table') == 'eftfsu cz cz tvnnfs ubcmf'\nassert cipher('cloud music music A1') == 'dmpve nvtjd nvtjd 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 + (1)) % 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 + (1)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('winter camel river')` يجب أن تُرجع `'xjoufs dbnfm sjwfs'`.\nالجواب:", "qhash": "016bcc229e1242eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(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 acc_reset([8, 10, 34, 18, 10, 58]) == [8, 18, 52, 70, 80, 0]", "assert acc_reset([63, -5, 86, 79, 40, 24, -2]) == [63, 58, 0, 79, 0, 24, 22]", "assert acc_reset([32, 26, 28, -4, 92, 16, 86, 109]) == [32, 58, 86, 82, 0, 16, 102, 0]", "assert acc_reset([32, 85, 55, 52, 80, 85, 48]) == [32, 0, 55, 107, 0, 85, 0]", "assert acc_reset([]) == []", "assert acc_reset([46, -7, 30, 18, 91, -2, 54, 46, 36, 20]) == [46, 39, 69, 87, 0, -2, 52, 98, 0, 20]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([8, 10, 34, 18, 10, 58]) == [8, 18, 52, 70, 80, 0]\nassert acc_reset([63, -5, 86, 79, 40, 24, -2]) == [63, 58, 0, 79, 0, 24, 22]\nassert acc_reset([32, 26, 28, -4, 92, 16, 86, 109]) == [32, 58, 86, 82, 0, 16, 102, 0]\nassert acc_reset([32, 85, 55, 52, 80, 85, 48]) == [32, 0, 55, 107, 0, 85, 0]\nassert acc_reset([]) == []\nassert acc_reset([46, -7, 30, 18, 91, -2, 54, 46, 36, 20]) == [46, 39, 69, 87, 0, -2, 52, 98, 0, 20]\nassert acc_reset([]) == []", "answer": "def acc_reset(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 acc_reset(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سؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 109 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([8, 10, 34, 18, 10, 58])` يجب أن تُرجع `[8, 18, 52, 70, 80, 0]`.\nالجواب:", "qhash": "0a9db27ea38525b8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "shift_list", "reference": "def shift_list(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert shift_list([20, 40, 6, 16, 8, 39, 35, 28]) == [40, 6, 16, 8, 39, 35, 28, 20]", "assert shift_list([-5, 43, 24, 46]) == [43, 24, 46, -5]", "assert shift_list([35, 14, 18, 20, 10, 25, 2, 37]) == [14, 18, 20, 10, 25, 2, 37, 35]", "assert shift_list([-2, 48, 3, 44, 0]) == [48, 3, 44, 0, -2]", "assert shift_list([35, 13, 18, 18, 33, -5, 27, 32, 12, 40, 20]) == [13, 18, 18, 33, -5, 27, 32, 12, 40, 20, 35]", "assert shift_list([18]) == [18]", "assert shift_list([]) == []"], "test_code": "assert shift_list([20, 40, 6, 16, 8, 39, 35, 28]) == [40, 6, 16, 8, 39, 35, 28, 20]\nassert shift_list([-5, 43, 24, 46]) == [43, 24, 46, -5]\nassert shift_list([35, 14, 18, 20, 10, 25, 2, 37]) == [14, 18, 20, 10, 25, 2, 37, 35]\nassert shift_list([-2, 48, 3, 44, 0]) == [48, 3, 44, 0, -2]\nassert shift_list([35, 13, 18, 18, 33, -5, 27, 32, 12, 40, 20]) == [13, 18, 18, 33, -5, 27, 32, 12, 40, 20, 35]\nassert shift_list([18]) == [18]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 1 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef shift_list(lst):\n if not lst:\n return []\n k = 1 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `shift_list([20, 40, 6, 16, 8, 39, 35, 28])` يُرجع `[40, 6, 16, 8, 39, 35, 28, 20]`.\nالجواب:", "qhash": "df63e8cd78197487"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'apple'\nprint(text[2:5])\nprint(text.count('p'))\nprint(text.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'apple'\nprint(text[2:5])\nprint(text.count('p'))\nprint(text.capitalize())\n```\nالجواب:", "qhash": "c5b5771d25410737", "answer": "ple\n2\nApple", "completion": " الناتج:\n```text\nple\n2\nApple\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n):\n if n < 2:\n return n + 2\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(10))", "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(10))\n```\nالجواب:", "qhash": "9563668bea5032a5", "answer": "233", "completion": " الناتج:\n```text\n233\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'falcon'\nprint(s[1:6])\nprint(s.find('n'))\nprint(s.count('n'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'falcon'\nprint(s[1:6])\nprint(s.find('n'))\nprint(s.count('n'))\n```\nالجواب:", "qhash": "8d17e4b824445eae", "answer": "alcon\n5\n1", "completion": " الناتج:\n```text\nalcon\n5\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -1 * x ** 2 + (-6) * x + (2)", "tests": ["assert eval_poly(6) == -70", "assert eval_poly(18) == -430", "assert eval_poly(-8) == -14", "assert eval_poly(11) == -185", "assert eval_poly(-7) == -5", "assert eval_poly(-2) == 10", "assert eval_poly(6) == -70", "assert eval_poly(0) == 2"], "test_code": "assert eval_poly(6) == -70\nassert eval_poly(18) == -430\nassert eval_poly(-8) == -14\nassert eval_poly(11) == -185\nassert eval_poly(-7) == -5\nassert eval_poly(-2) == 10\nassert eval_poly(6) == -70\nassert eval_poly(0) == 2", "answer": "def eval_poly(x):\n return -1 * x ** 2 + (-6) * x + (2)", "completion": " ```python\ndef eval_poly(x):\n return -1 * x ** 2 + (-6) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -1x² - 6x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(6)` يُرجع `-70`.\nالجواب:", "qhash": "3362c1603429302d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=9):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(calc(19))\nprint(calc(19, -7))\nprint(calc(calc(-7), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=9):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(calc(19))\nprint(calc(19, -7))\nprint(calc(calc(-7), 19))\n```\nالجواب:", "qhash": "7b9e31b758343c5e", "answer": "-9\n7\n-7", "completion": " الناتج:\n```text\n-9\n7\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "xs = [25, 5, 28, 29, 22, 7, -7, 3]\nprint(xs[0:8])\nprint(xs[::2])\nprint(max(xs[0:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nxs = [25, 5, 28, 29, 22, 7, -7, 3]\nprint(xs[0:8])\nprint(xs[::2])\nprint(max(xs[0:8]))\n```\nالجواب:", "qhash": "d04ce4c24cb3eb0d", "answer": "[25, 5, 28, 29, 22, 7, -7, 3]\n[25, 28, 22, -7]\n29", "completion": " الناتج:\n```text\n[25, 5, 28, 29, 22, 7, -7, 3]\n[25, 28, 22, -7]\n29\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "begin_count", "reference": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ص'):\n count += 1\n return count", "tests": ["assert begin_count('برمجة مطر جمل صحراء طائرة حصان') == 1", "assert begin_count('طائرة كتاب') == 0", "assert begin_count('ماء سماء سيارة صحراء ميناء مطر') == 1", "assert begin_count('صحراء تفاحة بيت طالب باب') == 1", "assert begin_count('صحراء صديق سيارة') == 2", "assert begin_count('برمجة صديق مكتبة صديق رمل') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('برمجة مطر جمل صحراء طائرة حصان') == 1\nassert begin_count('طائرة كتاب') == 0\nassert begin_count('ماء سماء سيارة صحراء ميناء مطر') == 1\nassert begin_count('صحراء تفاحة بيت طالب باب') == 1\nassert begin_count('صحراء صديق سيارة') == 2\nassert begin_count('برمجة صديق مكتبة صديق رمل') == 2\nassert begin_count('') == 0", "answer": "def begin_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ص'):\n count += 1\n return count", "completion": " ```python\ndef begin_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 begin_count(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 begin_count(line):\n count = 0\n for w in line.split():\n if w.endswith('ص'):\n count += 1\n return count\n```\nمثال: `begin_count('برمجة مطر جمل صحراء طائرة حصان')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "f179d85f00015400"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([36, 7, 17, 46, 23, 22, 30]) == [46, 23, 22, 30, 36, 7, 17]", "assert rotate_by([9, 36, 49, 43]) == [49, 43, 9, 36]", "assert rotate_by([28]) == [28]", "assert rotate_by([26, -4, 39, 14, 33, 2, -1, 22, 41]) == [-4, 39, 14, 33, 2, -1, 22, 41, 26]", "assert rotate_by([20, 43, -7]) == [43, -7, 20]", "assert rotate_by([48, 50, 30]) == [50, 30, 48]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([36, 7, 17, 46, 23, 22, 30]) == [46, 23, 22, 30, 36, 7, 17]\nassert rotate_by([9, 36, 49, 43]) == [49, 43, 9, 36]\nassert rotate_by([28]) == [28]\nassert rotate_by([26, -4, 39, 14, 33, 2, -1, 22, 41]) == [-4, 39, 14, 33, 2, -1, 22, 41, 26]\nassert rotate_by([20, 43, -7]) == [43, -7, 20]\nassert rotate_by([48, 50, 30]) == [50, 30, 48]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 10 % len(lst)\n return ____\n```\nمثال: `rotate_by([36, 7, 17, 46, 23, 22, 30])` يجب أن تُرجع `[46, 23, 22, 30, 36, 7, 17]`.\nالجواب:", "qhash": "d58243dce64e3874"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 147\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 = 147\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": "5cda9401d8a9c6b2", "answer": "116", "completion": " الناتج:\n```text\n116\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * 5 + -10 for x in range(-4, 8) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * 5 + -10 for x in range(-4, 8) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "857bc16c40b2e969", "answer": "[-25, -15, -5, 5, 15, 25]\n6 0", "completion": " الناتج:\n```text\n[-25, -15, -5, 5, 15, 25]\n6 0\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def rec(n, k):\n if k == 0:\n return 1\n return n * rec(n, k - 1)\n\nprint(rec(7, 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(7, 2))\n```\nالجواب:", "qhash": "1596fe27ffc80ecb", "answer": "49", "completion": " الناتج:\n```text\n49\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'stone'\nprint(word.find('e'))\nprint(word[3:4])\nprint(word.index('e') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'stone'\nprint(word.find('e'))\nprint(word[3:4])\nprint(word.index('e') + len(word))\n```\nالجواب:", "qhash": "5b8ae151cb357ec2", "answer": "4\nn\n9", "completion": " الناتج:\n```text\n4\nn\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_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 largest_div([-8, -16, 49, -12, 10, 20, 18, -23]) == 20", "assert largest_div([-12, -4, -20]) == -4", "assert largest_div([1, 5, 9, 13]) == None", "assert largest_div([-6]) == None", "assert largest_div([16, 36, 43, -21, 16]) == 36", "assert largest_div([]) == None"], "test_code": "assert largest_div([-8, -16, 49, -12, 10, 20, 18, -23]) == 20\nassert largest_div([-12, -4, -20]) == -4\nassert largest_div([1, 5, 9, 13]) == None\nassert largest_div([-6]) == None\nassert largest_div([16, 36, 43, -21, 16]) == 36\nassert largest_div([]) == None", "answer": "def largest_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 largest_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 largest_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 largest_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مثال: `largest_div([-8, -16, 49, -12, 10, 20, 18, -23])` يجب أن تُرجع `20`.\nالجواب:", "qhash": "d04a51499b3e8857"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "starts_count", "reference": "def starts_count(line):\n count = 0\n for w in line.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('قهوة حصان نور') == 1", "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('قهوة حصان نور') == 1\nassert starts_count('') == 0", "answer": "def starts_count(line):\n count = 0\n for w in line.split():\n if w.startswith('ن'):\n count += 1\n return count", "completion": " ```python\ndef starts_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 starts_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 starts_count(line):\n count = 0\n for w in line:\n if w.startswith('ن'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `starts_count('فجر بحر برتقال سماء لغة صديق')` يُرجع `0`.\nالجواب:", "qhash": "70664d93f27c26af"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(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 game(19) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19']", "assert game(3) == ['1', '2', '3']", "assert game(25) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', '24', 'Tic']", "assert game(1) == ['1']", "assert game(8) == ['1', '2', '3', '4', 'Tic', '6', '7', '8']"], "test_code": "assert game(19) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19']\nassert game(3) == ['1', '2', '3']\nassert game(25) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', '24', 'Tic']\nassert game(1) == ['1']\nassert game(8) == ['1', '2', '3', '4', 'Tic', '6', '7', '8']", "answer": "def game(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 game(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سؤال: اكتب دالة `game(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Tic'، وعلى 9 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(19)` يجب أن تُرجع `['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19']`.\nالجواب:", "qhash": "fc28efae3d158d72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "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('نهار صديق برمجة حاسوب وردة سلام') == 1", "assert tally_letter('شمس') == 0", "assert tally_letter('دفتر') == 0", "assert tally_letter('مدرسة علم وردة قلم لغة') == 0", "assert tally_letter('طالب ليل صديق حديقة قهوة نهار') == 1", "assert tally_letter('صديق ميناء شمس ماء بيت سيارة قمر نهر') == 0", "assert tally_letter('') == 0"], "test_code": "assert 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\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ح» مرة واحدة على الأقل، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('سماء ميناء سيارة سفينة سوق')` يُرجع `0`.\nالجواب:", "qhash": "72ed99343b18bb2e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 2 * x ** 2 + (-1) * x + (-4)", "tests": ["assert quad(1) == -3", "assert quad(-1) == -1", "assert quad(-7) == 101", "assert quad(2) == 2", "assert quad(-3) == 17", "assert quad(-11) == 249", "assert quad(-3) == 17", "assert quad(0) == -4"], "test_code": "assert quad(1) == -3\nassert quad(-1) == -1\nassert quad(-7) == 101\nassert quad(2) == 2\nassert quad(-3) == 17\nassert quad(-11) == 249\nassert quad(-3) == 17\nassert quad(0) == -4", "answer": "def quad(x):\n return 2 * x ** 2 + (-1) * x + (-4)", "completion": " ```python\ndef quad(x):\n return 2 * x ** 2 + (-1) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 2x² - 1x - 4 عند العدد الصحيح x.\nمثال: `quad(1)` يجب أن تُرجع `-3`.\nالجواب:", "qhash": "fd43d7c5f4d347e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor j in range(7, 13, 3):\n total += j * 1\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor j in range(7, 13, 3):\n total += j * 1\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "90964035241bd5f0", "answer": "32\n10", "completion": " الناتج:\n```text\n32\n10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('go music is matrix A1') == 'rz xfdtn td xlecti A1'", "assert cipher('to pixel engine desert of') == 'ez atipw pyrtyp opdpce zq'", "assert cipher('rocket an A1') == 'cznvpe ly A1'", "assert cipher('on winter rocket is go A1') == 'zy htyepc cznvpe td rz A1'", "assert cipher('summer window 2024') == 'dfxxpc htyozh 2024'", "assert cipher('orange signal go') == 'zclyrp dtrylw rz'", "assert cipher('') == ''"], "test_code": "assert cipher('go music is matrix A1') == 'rz xfdtn td xlecti A1'\nassert cipher('to pixel engine desert of') == 'ez atipw pyrtyp opdpce zq'\nassert cipher('rocket an A1') == 'cznvpe ly A1'\nassert cipher('on winter rocket is go A1') == 'zy htyepc cznvpe td rz A1'\nassert cipher('summer window 2024') == 'dfxxpc htyozh 2024'\nassert cipher('orange signal go') == 'zclyrp dtrylw rz'\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 + (11)) % 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 + (11)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cipher(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `cipher('go music is matrix A1')` يُرجع `'rz xfdtn td xlecti A1'`.\nالجواب:", "qhash": "2f8e580bd7e58dc4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(4))\nprint(calc(4, 3))\nprint(calc(calc(3), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=7):\n if x > y:\n return x * 5 - y\n return x + y * 5\n\nprint(calc(4))\nprint(calc(4, 3))\nprint(calc(calc(3), 4))\n```\nالجواب:", "qhash": "6efeec4493e020a7", "answer": "39\n17\n186", "completion": " الناتج:\n```text\n39\n17\n186\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 10)", "tests": ["assert filter_range([-12, 0, 19, 10, 3]) == [0, 6, 20]", "assert filter_range([3]) == [6]", "assert filter_range([]) == []", "assert filter_range([60]) == []", "assert filter_range([40, 0, 45]) == [0]", "assert filter_range([4, 60, 39, 49, -27, -9, 59]) == [8]", "assert filter_range([40, 8, 3, 22]) == [6, 16]", "assert filter_range([]) == []"], "test_code": "assert filter_range([-12, 0, 19, 10, 3]) == [0, 6, 20]\nassert filter_range([3]) == [6]\nassert filter_range([]) == []\nassert filter_range([60]) == []\nassert filter_range([40, 0, 45]) == [0]\nassert filter_range([4, 60, 39, 49, -27, -9, 59]) == [8]\nassert filter_range([40, 8, 3, 22]) == [6, 16]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 10)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 2 for x in xs if -5 <= x <= 10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -5 ≤ x ≤ 10، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([-12, 0, 19, 10, 3])` يُرجع `[0, 6, 20]`.\nالجواب:", "qhash": "7bee9202b61b0c42"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n <= 0:\n return 3\n return 1 * calc(n - 1) + 4\n\nprint(calc(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n <= 0:\n return 3\n return 1 * calc(n - 1) + 4\n\nprint(calc(2))\n```\nالجواب:", "qhash": "6601c80cf3530e68", "answer": "11", "completion": " الناتج:\n```text\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "quad", "reference": "def quad(x):\n return 3 * x ** 2 + (-9) * x + (7)", "tests": ["assert quad(6) == 61", "assert quad(-13) == 631", "assert quad(11) == 271", "assert quad(14) == 469", "assert quad(-9) == 331", "assert quad(4) == 19", "assert quad(8) == 127", "assert quad(0) == 7"], "test_code": "assert quad(6) == 61\nassert quad(-13) == 631\nassert quad(11) == 271\nassert quad(14) == 469\nassert quad(-9) == 331\nassert quad(4) == 19\nassert quad(8) == 127\nassert quad(0) == 7", "answer": "def quad(x):\n return 3 * x ** 2 + (-9) * x + (7)", "completion": " ```python\ndef quad(x):\n return 3 * x ** 2 + (-9) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `quad(x)` تُرجع قيمة كثيرة الحدود 3x² - 9x + 7 عند العدد الصحيح x.\nمثال: `quad(6)` يجب أن تُرجع `61`.\nالجواب:", "qhash": "4f16c4d32099310c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Sun'\n if i % 6 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(7) == ['1', '2', '3', '4', 'Sun', 'Moon', '7']", "assert fizz(24) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22', '23', 'Moon']", "assert fizz(4) == ['1', '2', '3', '4']", "assert fizz(16) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16']", "assert fizz(1) == ['1']"], "test_code": "assert fizz(7) == ['1', '2', '3', '4', 'Sun', 'Moon', '7']\nassert fizz(24) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22', '23', 'Moon']\nassert fizz(4) == ['1', '2', '3', '4']\nassert fizz(16) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16']\nassert fizz(1) == ['1']", "answer": "def fizz(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 fizz(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سؤال: اكتب دالة `fizz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Sun'، وعلى 6 بـ 'Moon'، وعلى كليهما بـ 'SunMoon'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizz(7)` يجب أن تُرجع `['1', '2', '3', '4', 'Sun', 'Moon', '7']`.\nالجواب:", "qhash": "7e46d551bdc2c582"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=8):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(17))\nprint(calc(17, 16))\nprint(calc(calc(16), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=8):\n if x > y:\n return x * -5 - y\n return x + y * -5\n\nprint(calc(17))\nprint(calc(17, 16))\nprint(calc(calc(16), 17))\n```\nالجواب:", "qhash": "e55e94d4d2916278", "answer": "-93\n-101\n-173", "completion": " الناتج:\n```text\n-93\n-101\n-173\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 46) == 1)", "tests": ["assert coprimes(69) == 33", "assert coprimes(65) == 32", "assert coprimes(70) == 33", "assert coprimes(32) == 15", "assert coprimes(22) == 11", "assert coprimes(104) == 50", "assert coprimes(1) == 1"], "test_code": "assert coprimes(69) == 33\nassert coprimes(65) == 32\nassert coprimes(70) == 33\nassert coprimes(32) == 15\nassert coprimes(22) == 11\nassert coprimes(104) == 50\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, 46) == 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, 46) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprimes(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 46) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprimes(69)` يُرجع `33`.\nالجواب:", "qhash": "667190b5256768aa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 16\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 = 16\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": "711238e74fe8e404", "answer": "4", "completion": " الناتج:\n```text\n4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 72) == 1)", "tests": ["assert count_gcd1(20) == 7", "assert count_gcd1(81) == 27", "assert count_gcd1(109) == 37", "assert count_gcd1(2) == 1", "assert count_gcd1(48) == 16", "assert count_gcd1(15) == 5", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(20) == 7\nassert count_gcd1(81) == 27\nassert count_gcd1(109) == 37\nassert count_gcd1(2) == 1\nassert count_gcd1(48) == 16\nassert count_gcd1(15) == 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, 72) == 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, 72) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 72) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(20)` يُرجع `7`.\nالجواب:", "qhash": "80540a8d038c6907"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Ping'\n if i % 10 == 0:\n s += 'Pong'\n out.append(s or str(i))\n return out", "tests": ["assert play(11) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11']", "assert play(20) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15', '16', '17', 'Ping', '19', 'Pong']", "assert play(12) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping']", "assert play(18) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15', '16', '17', 'Ping']", "assert play(15) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15']"], "test_code": "assert play(11) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11']\nassert play(20) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15', '16', '17', 'Ping', '19', 'Pong']\nassert play(12) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping']\nassert play(18) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15', '16', '17', 'Ping']\nassert play(15) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11', 'Ping', '13', '14', '15']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 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سؤال: أنشئ دالة بايثون `play(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Ping'، وإن قَبِلها على 10 أضف 'Pong' (فيصبح 'PingPong' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(11)` يُرجع `['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', 'Pong', '11']`.\nالجواب:", "qhash": "5f407d1db5a5f2fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "tests": ["assert sum_powers(6) == 3528", "assert sum_powers(9) == 16200", "assert sum_powers(14) == 88200", "assert sum_powers(15) == 115200", "assert sum_powers(2) == 72", "assert sum_powers(1) == 8", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 3528\nassert sum_powers(9) == 16200\nassert sum_powers(14) == 88200\nassert sum_powers(15) == 115200\nassert sum_powers(2) == 72\nassert sum_powers(1) == 8\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 8 * i ** 3\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 8 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 8 * i ** 3\n return total\n```\nمثال: `sum_powers(6)` يجب أن تُرجع `3528`.\nالجواب:", "qhash": "c7e136713c4d2545"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 17 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert cycle([45, 42, 5, 21, 2, 44, 10]) == [2, 44, 10, 45, 42, 5, 21]", "assert cycle([37, 29]) == [29, 37]", "assert cycle([8, 25, 40, 20, 23, -2, -8, -4, 4, 8, -8, 29]) == [-4, 4, 8, -8, 29, 8, 25, 40, 20, 23, -2, -8]", "assert cycle([-7, 23, 38]) == [23, 38, -7]", "assert cycle([7]) == [7]", "assert cycle([-1, 9]) == [9, -1]", "assert cycle([]) == []"], "test_code": "assert cycle([45, 42, 5, 21, 2, 44, 10]) == [2, 44, 10, 45, 42, 5, 21]\nassert cycle([37, 29]) == [29, 37]\nassert cycle([8, 25, 40, 20, 23, -2, -8, -4, 4, 8, -8, 29]) == [-4, 4, 8, -8, 29, 8, 25, 40, 20, 23, -2, -8]\nassert cycle([-7, 23, 38]) == [23, 38, -7]\nassert cycle([7]) == [7]\nassert cycle([-1, 9]) == [9, -1]\nassert cycle([]) == []", "answer": "def cycle(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 cycle(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 cycle(lst):\n if not lst:\n return []\n k = 17 % len(lst)\n return ____\n```\nمثال: `cycle([45, 42, 5, 21, 2, 44, 10])` يجب أن تُرجع `[2, 44, 10, 45, 42, 5, 21]`.\nالجواب:", "qhash": "e7cb7e01db6c6900"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('banana A1') == 'yxkxkx A1'", "assert shift_letters('apple go') == 'xmmib dl'", "assert shift_letters('engine apple signal 2024') == 'bkdfkb xmmib pfdkxi 2024'", "assert shift_letters('winter vector') == 'tfkqbo sbzqlo'", "assert shift_letters('by cloud is OK') == 'yv zilra fp OK'", "assert shift_letters('river falcon light') == 'ofsbo cxizlk ifdeq'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('banana A1') == 'yxkxkx A1'\nassert shift_letters('apple go') == 'xmmib dl'\nassert shift_letters('engine apple signal 2024') == 'bkdfkb xmmib pfdkxi 2024'\nassert shift_letters('winter vector') == 'tfkqbo sbzqlo'\nassert shift_letters('by cloud is OK') == 'yv zilra fp OK'\nassert shift_letters('river falcon light') == 'ofsbo cxizlk ifdeq'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('banana A1')` يُرجع `'yxkxkx A1'`.\nالجواب:", "qhash": "dcbfac3f3593874c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('apple is cloud brain OK') == 'xmmib fp zilra yoxfk OK'", "assert shift_text('at A1') == 'xq A1'", "assert shift_text('up') == 'rm'", "assert shift_text('garden go') == 'dxoabk dl'", "assert shift_text('stone rocket data 2024') == 'pqlkb olzhbq axqx 2024'", "assert shift_text('of pixel') == 'lc mfubi'", "assert shift_text('') == ''"], "test_code": "assert shift_text('apple is cloud brain OK') == 'xmmib fp zilra yoxfk OK'\nassert shift_text('at A1') == 'xq A1'\nassert shift_text('up') == 'rm'\nassert shift_text('garden go') == 'dxoabk dl'\nassert shift_text('stone rocket data 2024') == 'pqlkb olzhbq axqx 2024'\nassert shift_text('of pixel') == 'lc mfubi'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('apple is cloud brain OK')` يُرجع `'xmmib fp zilra yoxfk OK'`.\nالجواب:", "qhash": "a56f3fefa914371e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return -5 * x ** 2 + (-5) * x + (-3)", "tests": ["assert eval_poly(1) == -13", "assert eval_poly(-11) == -553", "assert eval_poly(-20) == -1903", "assert eval_poly(7) == -283", "assert eval_poly(2) == -33", "assert eval_poly(-8) == -283", "assert eval_poly(20) == -2103", "assert eval_poly(0) == -3"], "test_code": "assert eval_poly(1) == -13\nassert eval_poly(-11) == -553\nassert eval_poly(-20) == -1903\nassert eval_poly(7) == -283\nassert eval_poly(2) == -33\nassert eval_poly(-8) == -283\nassert eval_poly(20) == -2103\nassert eval_poly(0) == -3", "answer": "def eval_poly(x):\n return -5 * x ** 2 + (-5) * x + (-3)", "completion": " ```python\ndef eval_poly(x):\n return -5 * x ** 2 + (-5) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار -5x² - 5x - 3 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(1)` يُرجع `-13`.\nالجواب:", "qhash": "326605093c652c05"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 9) == 1)", "tests": ["assert coprime_count(143) == 96", "assert coprime_count(140) == 94", "assert coprime_count(120) == 80", "assert coprime_count(90) == 60", "assert coprime_count(37) == 25", "assert coprime_count(49) == 33", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(143) == 96\nassert coprime_count(140) == 94\nassert coprime_count(120) == 80\nassert coprime_count(90) == 60\nassert coprime_count(37) == 25\nassert coprime_count(49) == 33\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, 9) == 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, 9) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `coprime_count(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 9) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `coprime_count(143)` يُرجع `96`.\nالجواب:", "qhash": "ef383943fbcb5719"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "total = 1\nfor j in range(-3, 13, 2):\n total += j * 6\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntotal = 1\nfor j in range(-3, 13, 2):\n total += j * 6\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "f6a342e59006787e", "answer": "193\n11", "completion": " الناتج:\n```text\n193\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert cycle([20, 34, 11, 48, 8, 43]) == [8, 43, 20, 34, 11, 48]", "assert cycle([22, 1, -8, 15, -9, 26]) == [-9, 26, 22, 1, -8, 15]", "assert cycle([29, 9, 46, 16, 45, 38, 3, 2, 35, -5]) == [29, 9, 46, 16, 45, 38, 3, 2, 35, -5]", "assert cycle([29]) == [29]", "assert cycle([40, -1, -4, 29, 16, 19, 46, 37, -7]) == [37, -7, 40, -1, -4, 29, 16, 19, 46]", "assert cycle([26, 39, 47, 40, 33, 43, 49, 2, 20, -2, 35, 43]) == [33, 43, 49, 2, 20, -2, 35, 43, 26, 39, 47, 40]", "assert cycle([]) == []"], "test_code": "assert cycle([20, 34, 11, 48, 8, 43]) == [8, 43, 20, 34, 11, 48]\nassert cycle([22, 1, -8, 15, -9, 26]) == [-9, 26, 22, 1, -8, 15]\nassert cycle([29, 9, 46, 16, 45, 38, 3, 2, 35, -5]) == [29, 9, 46, 16, 45, 38, 3, 2, 35, -5]\nassert cycle([29]) == [29]\nassert cycle([40, -1, -4, 29, 16, 19, 46, 37, -7]) == [37, -7, 40, -1, -4, 29, 16, 19, 46]\nassert cycle([26, 39, 47, 40, 33, 43, 49, 2, 20, -2, 35, 43]) == [33, 43, 49, 2, 20, -2, 35, 43, 26, 39, 47, 40]\nassert cycle([]) == []", "answer": "def cycle(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 cycle(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 cycle(xs):\n if not xs:\n return []\n k = 20 % len(xs)\n return ____\n```\nمثال: `cycle([20, 34, 11, 48, 8, 43])` يجب أن تُرجع `[8, 43, 20, 34, 11, 48]`.\nالجواب:", "qhash": "e2a285e689fc512b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert game(19) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19']", "assert game(23) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac', '21', 'Tic', '23']", "assert game(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac']", "assert game(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']", "assert game(23) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac', '21', 'Tic', '23']"], "test_code": "assert game(19) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19']\nassert game(23) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac', '21', 'Tic', '23']\nassert game(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac']\nassert game(7) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7']\nassert game(23) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'TicTac', '21', 'Tic', '23']", "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 % 10 == 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 % 10 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `game(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Tic'، وإن قَبِلها على 10 أضف 'Tac' (فيصبح 'TicTac' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `game(19)` يُرجع `['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19']`.\nالجواب:", "qhash": "ea65bb2e3db63a87"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "div_not", "reference": "def div_not(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 div_not([20, 54, 73, 15, 24, 5, 55, 38, 68, 69, 23]) == 0", "assert div_not([-16, 49, -2, 22, 20, -33, 26]) == 0", "assert div_not([66, -3, -20]) == 0", "assert div_not([64, -14, 17, 49, 7, 52, 9, 44, 34, 51, 35]) == 0", "assert div_not([16, 82, 0, 60, -36]) == 0", "assert div_not([-5, -15, 54, 83, -8, 24]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([20, 54, 73, 15, 24, 5, 55, 38, 68, 69, 23]) == 0\nassert div_not([-16, 49, -2, 22, 20, -33, 26]) == 0\nassert div_not([66, -3, -20]) == 0\nassert div_not([64, -14, 17, 49, 7, 52, 9, 44, 34, 51, 35]) == 0\nassert div_not([16, 82, 0, 60, -36]) == 0\nassert div_not([-5, -15, 54, 83, -8, 24]) == 0\nassert div_not([]) == 0", "answer": "def div_not(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 div_not(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 div_not(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `div_not([20, 54, 73, 15, 24, 5, 55, 38, 68, 69, 23])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "fe1fbcd1042df23e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['light', 'matrix', 'summer', 'table', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['light', 'matrix', 'summer', 'table', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "0df8b9ca43d2f207", "answer": "['light', 'table', 'music', 'matrix', 'summer']\n['summer', 'matrix', 'table']", "completion": " الناتج:\n```text\n['light', 'table', 'music', 'matrix', 'summer']\n['summer', 'matrix', 'table']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=7):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(7))\nprint(f(7, -9))\nprint(f(f(-9), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=7):\n if x > y:\n return x * 1 - y\n return x + y * 1\n\nprint(f(7))\nprint(f(7, -9))\nprint(f(f(-9), 7))\n```\nالجواب:", "qhash": "7e356d3e2de31b7e", "answer": "14\n16\n5", "completion": " الناتج:\n```text\n14\n16\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'قهوة نهار'\nprint(s.count('س'))\nprint(s[::-1])\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'قهوة نهار'\nprint(s.count('س'))\nprint(s[::-1])\nprint(s.split())\n```\nالجواب:", "qhash": "6166111eb11dfd71", "answer": "0\nراهن ةوهق\n['قهوة', 'نهار']", "completion": " الناتج:\n```text\n0\nراهن ةوهق\n['قهوة', 'نهار']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 13) == 1)", "tests": ["assert count_coprime(142) == 132", "assert count_coprime(134) == 124", "assert count_coprime(56) == 52", "assert count_coprime(146) == 135", "assert count_coprime(107) == 99", "assert count_coprime(87) == 81", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(142) == 132\nassert count_coprime(134) == 124\nassert count_coprime(56) == 52\nassert count_coprime(146) == 135\nassert count_coprime(107) == 99\nassert count_coprime(87) == 81\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, 13) == 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, 13) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_coprime(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 13) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_coprime(142)` يُرجع `132`.\nالجواب:", "qhash": "cc6d0bc89e48d4fa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return 6 * x ** 2 + (1) * x + (-4)", "tests": ["assert quad(4) == 96", "assert quad(4) == 96", "assert quad(-8) == 372", "assert quad(-2) == 18", "assert quad(-7) == 283", "assert quad(-4) == 88", "assert quad(-2) == 18", "assert quad(0) == -4"], "test_code": "assert quad(4) == 96\nassert quad(4) == 96\nassert quad(-8) == 372\nassert quad(-2) == 18\nassert quad(-7) == 283\nassert quad(-4) == 88\nassert quad(-2) == 18\nassert quad(0) == -4", "answer": "def quad(x):\n return 6 * x ** 2 + (1) * x + (-4)", "completion": " ```python\ndef quad(x):\n return 6 * x ** 2 + (1) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار 6x² + 1x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(4)` يُرجع `96`.\nالجواب:", "qhash": "097eefe047675eb8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(12) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi']", "assert fizz(13) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi', '13']", "assert fizz(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi', '13', '14', '15', '16', '17']", "assert fizz(2) == ['1', '2']", "assert fizz(12) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi']"], "test_code": "assert fizz(12) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi']\nassert fizz(13) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi', '13']\nassert fizz(17) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi', '13', '14', '15', '16', '17']\nassert fizz(2) == ['1', '2']\nassert fizz(12) == ['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi']", "answer": "def fizz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 10 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 6 أضف 'Hi'، وإن قَبِلها على 10 أضف 'Yo' (فيصبح 'HiYo' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(12)` يُرجع `['1', '2', '3', '4', '5', 'Hi', '7', '8', '9', 'Yo', '11', 'Hi']`.\nالجواب:", "qhash": "253578c7a47ce462"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'زينب': 18, 'أحمد': 28, 'خالد': 8, 'سعيد': 22}\nscores['زينب'] += 16\nscores['عمر'] = 45\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'زينب': 18, 'أحمد': 28, 'خالد': 8, 'سعيد': 22}\nscores['زينب'] += 16\nscores['عمر'] = 45\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 16])\n```\nالجواب:", "qhash": "a371cf01077441d9", "answer": "5\nعمر\n137\n['زينب', 'أحمد', 'سعيد', 'عمر']", "completion": " الناتج:\n```text\n5\nعمر\n137\n['زينب', 'أحمد', 'سعيد', 'عمر']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "rolling_total", "reference": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 10:\n s = 0\n out.append(s)\n return out", "tests": ["assert rolling_total([9, 3, 6, 5, 5, 9, 1, 5, 10]) == [9, 0, 6, 0, 5, 0, 1, 6, 0]", "assert rolling_total([]) == []", "assert rolling_total([8, -6, 9]) == [8, 2, 0]", "assert rolling_total([10, 5, -2, -9, 9, 5, 1, 8, 10, 2]) == [10, 0, -2, -11, -2, 3, 4, 0, 10, 0]", "assert rolling_total([3, 10]) == [3, 0]", "assert rolling_total([3, -2, 10, -2, -1, -9]) == [3, 1, 0, -2, -3, -12]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([9, 3, 6, 5, 5, 9, 1, 5, 10]) == [9, 0, 6, 0, 5, 0, 1, 6, 0]\nassert rolling_total([]) == []\nassert rolling_total([8, -6, 9]) == [8, 2, 0]\nassert rolling_total([10, 5, -2, -9, 9, 5, 1, 8, 10, 2]) == [10, 0, -2, -11, -2, 3, 4, 0, 10, 0]\nassert rolling_total([3, 10]) == [3, 0]\nassert rolling_total([3, -2, 10, -2, -1, -9]) == [3, 1, 0, -2, -3, -12]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 10:\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 > 10:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rolling_total(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 10 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `rolling_total([9, 3, 6, 5, 5, 9, 1, 5, 10])` يُرجع `[9, 0, 6, 0, 5, 0, 1, 6, 0]`.\nالجواب:", "qhash": "6a7c62085089185f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 997", "tests": ["assert prod_mod(5) == 15", "assert prod_mod(17) == 114", "assert prod_mod(29) == 18", "assert prod_mod(7) == 105", "assert prod_mod(55) == 672", "assert prod_mod(26) == 32", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(5) == 15\nassert prod_mod(17) == 114\nassert prod_mod(29) == 18\nassert prod_mod(7) == 105\nassert prod_mod(55) == 672\nassert prod_mod(26) == 32\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 997", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 2)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(5)` يُرجع `15`.\nالجواب:", "qhash": "1e68fd2a4273b3dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#1", "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, 52) == 1)", "tests": ["assert count_gcd1(40) == 18", "assert count_gcd1(43) == 20", "assert count_gcd1(103) == 48", "assert count_gcd1(57) == 27", "assert count_gcd1(11) == 6", "assert count_gcd1(155) == 72", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(40) == 18\nassert count_gcd1(43) == 20\nassert count_gcd1(103) == 48\nassert count_gcd1(57) == 27\nassert count_gcd1(11) == 6\nassert count_gcd1(155) == 72\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, 52) == 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, 52) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_gcd1(n)` تعدّ قيم i حيث 1 ≤ i ≤ n و gcd(i, 52) = 1، ثم تُرجع العدد.\nللتوضيح: الاستدعاء `count_gcd1(40)` يُرجع `18`.\nالجواب:", "qhash": "d538e9d8d2f9f263"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 8 == 0)", "tests": ["assert total_multiples(287) == 17136", "assert total_multiples(183) == 6842", "assert total_multiples(139) == 4107", "assert total_multiples(48) == 456", "assert total_multiples(156) == 4994", "assert total_multiples(32) == 189", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(287) == 17136\nassert total_multiples(183) == 6842\nassert total_multiples(139) == 4107\nassert total_multiples(48) == 456\nassert total_multiples(156) == 4994\nassert total_multiples(32) == 189\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 % 8 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 3 أو من مضاعفات 8، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(287)` يُرجع `17136`.\nالجواب:", "qhash": "081e0f139ae381dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def compute(x, y=2):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(7))\nprint(compute(7, -5))\nprint(compute(compute(-5), 7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef compute(x, y=2):\n if x > y:\n return x * 4 - y\n return x + y * 4\n\nprint(compute(7))\nprint(compute(7, -5))\nprint(compute(compute(-5), 7))\n```\nالجواب:", "qhash": "d316b445e0695742", "answer": "26\n33\n31", "completion": " الناتج:\n```text\n26\n33\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('منى', 62), ('أحمد', 57), ('زينب', 73), ('رنا', 23)]\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 = [('منى', 62), ('أحمد', 57), ('زينب', 73), ('رنا', 23)]\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": "ebfe9d45298153ea", "answer": "[('رنا', 23), ('أحمد', 57), ('منى', 62), ('زينب', 73)]\n['زينب', 'منى']", "completion": " الناتج:\n```text\n[('رنا', 23), ('أحمد', 57), ('منى', 62), ('زينب', 73)]\n['زينب', 'منى']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('وردة سماء') == 0", "assert begin_count('ليل باب نهار نهر طالب') == 0", "assert begin_count('عربية كتاب فجر بحر خبز') == 0", "assert begin_count('ميناء فجر سفينة شمس دفتر نهر دفتر') == 2", "assert begin_count('ماء دفتر سفينة جمل دفتر رمل حصان') == 2", "assert begin_count('جبل دفتر حديقة ليل رمل طالب حديقة') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('وردة سماء') == 0\nassert begin_count('ليل باب نهار نهر طالب') == 0\nassert begin_count('عربية كتاب فجر بحر خبز') == 0\nassert begin_count('ميناء فجر سفينة شمس دفتر نهر دفتر') == 2\nassert begin_count('ماء دفتر سفينة جمل دفتر رمل حصان') == 2\nassert begin_count('جبل دفتر حديقة ليل رمل طالب حديقة') == 1\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:\n if w.startswith('د'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «د». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef begin_count(sentence):\n count = 0\n for w in sentence:\n if w.startswith('د'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `begin_count('وردة سماء')` يُرجع `0`.\nالجواب:", "qhash": "28ab5bf78ec6358a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['apple', 'rocket', 'cloud', 'falcon', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['apple', 'rocket', 'cloud', 'falcon', 'brain']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "c05a7006721894fd", "answer": "['apple', 'cloud', 'brain', 'rocket', 'falcon']\n['rocket', 'falcon', 'cloud']", "completion": " الناتج:\n```text\n['apple', 'cloud', 'brain', 'rocket', 'falcon']\n['rocket', 'falcon', 'cloud']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 77", "tests": ["assert digits_mod(74918) == 32", "assert digits_mod(850399) == 43", "assert digits_mod(138767) == 56", "assert digits_mod(391191) == 25", "assert digits_mod(847416) == 45", "assert digits_mod(105825) == 1", "assert digits_mod(534466) == 19", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(74918) == 32\nassert digits_mod(850399) == 43\nassert digits_mod(138767) == 56\nassert digits_mod(391191) == 25\nassert digits_mod(847416) == 45\nassert digits_mod(105825) == 1\nassert digits_mod(534466) == 19\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 77", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 77.\nللتوضيح: الاستدعاء `digits_mod(74918)` يُرجع `32`.\nالجواب:", "qhash": "865508091ca5b922"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('planet A1') == 'dzobsh A1'", "assert rot('light !') == 'zwuvh !'", "assert rot('table garden on falcon banana') == 'hopzs uofrsb cb tozqcb pobobo'", "assert rot('winter apple camel signal orange') == 'kwbhsf oddzs qoasz gwuboz cfobus'", "assert rot('signal') == 'gwuboz'", "assert rot('winter planet summer it') == 'kwbhsf dzobsh giaasf wh'", "assert rot('') == ''"], "test_code": "assert rot('planet A1') == 'dzobsh A1'\nassert rot('light !') == 'zwuvh !'\nassert rot('table garden on falcon banana') == 'hopzs uofrsb cb tozqcb pobobo'\nassert rot('winter apple camel signal orange') == 'kwbhsf oddzs qoasz gwuboz cfobus'\nassert rot('signal') == 'gwuboz'\nassert rot('winter planet summer it') == 'kwbhsf dzobsh giaasf wh'\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 + (14)) % 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 + (14)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('planet A1')` يُرجع `'dzobsh A1'`.\nالجواب:", "qhash": "20af432e7ff9a71b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 93800\nsteps = 0\nwhile m > 7:\n m = m // 5\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 93800\nsteps = 0\nwhile m > 7:\n m = m // 5\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "cc17b86e3e6ab40d", "answer": "6 6", "completion": " الناتج:\n```text\n6 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'سماء تفاحة'\nprint(s.split())\nprint(s[0])\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'سماء تفاحة'\nprint(s.split())\nprint(s[0])\nprint(s[-1])\n```\nالجواب:", "qhash": "2b777d6e100d49f4", "answer": "['سماء', 'تفاحة']\nس\nة", "completion": " الناتج:\n```text\n['سماء', 'تفاحة']\nس\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('to a vector 2024') == 'up b wfdups 2024'", "assert cipher('by Hello') == 'cz Hfmmp'", "assert cipher('camel code code stone summer') == 'dbnfm dpef dpef tupof tvnnfs'", "assert cipher('camel Hello') == 'dbnfm Hfmmp'", "assert cipher('winter signal at desert') == 'xjoufs tjhobm bu eftfsu'", "assert cipher('we engine rocket pixel data OK') == 'xf fohjof spdlfu qjyfm ebub OK'", "assert cipher('') == ''"], "test_code": "assert cipher('to a vector 2024') == 'up b wfdups 2024'\nassert cipher('by Hello') == 'cz Hfmmp'\nassert cipher('camel code code stone summer') == 'dbnfm dpef dpef tupof tvnnfs'\nassert cipher('camel Hello') == 'dbnfm Hfmmp'\nassert cipher('winter signal at desert') == 'xjoufs tjhobm bu eftfsu'\nassert cipher('we engine rocket pixel data OK') == 'xf fohjof spdlfu qjyfm ebub OK'\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 + (-25)) % 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 + (-25)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('to a vector 2024')` يجب أن تُرجع `'up b wfdups 2024'`.\nالجواب:", "qhash": "f018d72c008da4b6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 71", "tests": ["assert mfact(4) == 8", "assert mfact(25) == 24", "assert mfact(26) == 26", "assert mfact(49) == 40", "assert mfact(43) == 41", "assert mfact(47) == 24", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 8\nassert mfact(25) == 24\nassert mfact(26) == 26\nassert mfact(49) == 40\nassert mfact(43) == 41\nassert mfact(47) == 24\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 71", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 2)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(4)` يُرجع `8`.\nالجواب:", "qhash": "32059a0523394639"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "how_many_div", "reference": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert how_many_div([50, 1, 85, 51, 79, 40, 43, 41, 88, 17]) == 1", "assert how_many_div([28, 76, -38]) == 0", "assert how_many_div([8, 60, -38, 63, 42, 41, 39, 6, 29, 66, -27]) == 3", "assert how_many_div([30, 1, -13, -38, -27, 12, 33]) == 2", "assert how_many_div([-35, 67, 38, -7, 19, -37, -5, -8, -13, 21, 39]) == 2", "assert how_many_div([]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([50, 1, 85, 51, 79, 40, 43, 41, 88, 17]) == 1\nassert how_many_div([28, 76, -38]) == 0\nassert how_many_div([8, 60, -38, 63, 42, 41, 39, 6, 29, 66, -27]) == 3\nassert how_many_div([30, 1, -13, -38, -27, 12, 33]) == 2\nassert how_many_div([-35, 67, 38, -7, 19, -37, -5, -8, -13, 21, 39]) == 2\nassert how_many_div([]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n count = 0\n for x in xs:\n if x % 3 == 0 and x % 6 != 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 % 3 == 0 and x % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([50, 1, 85, 51, 79, 40, 43, 41, 88, 17])` يُرجع `1`.\nالجواب:", "qhash": "39a2fc4128364067"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'يوسف': 46, 'رنا': 19, 'خالد': 3}\nscores['رنا'] += 6\nscores['منى'] = 59\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'يوسف': 46, 'رنا': 19, 'خالد': 3}\nscores['رنا'] += 6\nscores['منى'] = 59\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('راشد', -1))\n```\nالجواب:", "qhash": "cf05000b0f2a5d59", "answer": "4\nمنى\n133\n-1", "completion": " الناتج:\n```text\n4\nمنى\n133\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 5 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert find_max_div([42, 43, 46, 41, 34, 41]) == None", "assert find_max_div([-5, -10, -20]) == -5", "assert find_max_div([1]) == None", "assert find_max_div([-29]) == None", "assert find_max_div([-1, -46, 15]) == 15", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([42, 43, 46, 41, 34, 41]) == None\nassert find_max_div([-5, -10, -20]) == -5\nassert find_max_div([1]) == None\nassert find_max_div([-29]) == None\nassert find_max_div([-1, -46, 15]) == 15\nassert find_max_div([]) == None", "answer": "def find_max_div(arr):\n best = None\n for x in arr:\n if x % 5 == 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 % 5 == 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 % 5 != 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef find_max_div(arr):\n best = None\n for x in arr:\n if x % 5 != 0 and (best is None or x > best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `find_max_div([42, 43, 46, 41, 34, 41])` يُرجع `None`.\nالجواب:", "qhash": "3a5eaee699e9c1e0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_by([6, 25, 46, 17, 7, 24]) == [7, 24, 6, 25, 46, 17]", "assert rotate_by([8, 39, 4, 38, 33, 42, 42, 23, 31, 49]) == [33, 42, 42, 23, 31, 49, 8, 39, 4, 38]", "assert rotate_by([21, 15, 30, 48, 6, 30, 39, 35, 2, 41]) == [6, 30, 39, 35, 2, 41, 21, 15, 30, 48]", "assert rotate_by([3, 9]) == [3, 9]", "assert rotate_by([25, 6, -1]) == [6, -1, 25]", "assert rotate_by([15, 46, 47, -6, 46, -9, 22, 30, -4, 31, 43]) == [46, -9, 22, 30, -4, 31, 43, 15, 46, 47, -6]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([6, 25, 46, 17, 7, 24]) == [7, 24, 6, 25, 46, 17]\nassert rotate_by([8, 39, 4, 38, 33, 42, 42, 23, 31, 49]) == [33, 42, 42, 23, 31, 49, 8, 39, 4, 38]\nassert rotate_by([21, 15, 30, 48, 6, 30, 39, 35, 2, 41]) == [6, 30, 39, 35, 2, 41, 21, 15, 30, 48]\nassert rotate_by([3, 9]) == [3, 9]\nassert rotate_by([25, 6, -1]) == [6, -1, 25]\nassert rotate_by([15, 46, 47, -6, 46, -9, 22, 30, -4, 31, 43]) == [46, -9, 22, 30, -4, 31, 43, 15, 46, 47, -6]\nassert rotate_by([]) == []", "answer": "def rotate_by(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate_by(xs):\n if not xs:\n return []\n k = 4 % len(xs)\n return ____\n```\nمثال: `rotate_by([6, 25, 46, 17, 7, 24])` يجب أن تُرجع `[7, 24, 6, 25, 46, 17]`.\nالجواب:", "qhash": "a172d29e3bfd5f16"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "between_times", "reference": "def between_times(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 14)", "tests": ["assert between_times([21, -7, 5, 9, 0]) == [-28, 0, 20, 36]", "assert between_times([]) == []", "assert between_times([17]) == []", "assert between_times([13, 29, 46, -22, -4]) == [-16, 52]", "assert between_times([6, 60, -13, 5, 8, 2, -6, 47, -18]) == [-52, -24, 8, 20, 24, 32]", "assert between_times([-25, -20, -5, 21]) == [-20]", "assert between_times([10, -7, 53, 60, 9, 10, 33]) == [-28, 36, 40, 40]", "assert between_times([]) == []"], "test_code": "assert between_times([21, -7, 5, 9, 0]) == [-28, 0, 20, 36]\nassert between_times([]) == []\nassert between_times([17]) == []\nassert between_times([13, 29, 46, -22, -4]) == [-16, 52]\nassert between_times([6, 60, -13, 5, 8, 2, -6, 47, -18]) == [-52, -24, 8, 20, 24, 32]\nassert between_times([-25, -20, -5, 21]) == [-20]\nassert between_times([10, -7, 53, 60, 9, 10, 33]) == [-28, 36, 40, 40]\nassert between_times([]) == []", "answer": "def between_times(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 14)", "completion": " ```python\ndef between_times(xs):\n return sorted(x * 4 for x in xs if -13 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `between_times(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -13 و14 (شاملًا الطرفين) في 4.\nمثال: `between_times([21, -7, 5, 9, 0])` يجب أن تُرجع `[-28, 0, 20, 36]`.\nالجواب:", "qhash": "e94cc65398997764"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "s = 'صديق جبل'\nprint(len(s.replace(' ', '')))\nprint(s.find('ق'))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'صديق جبل'\nprint(len(s.replace(' ', '')))\nprint(s.find('ق'))\nprint(len(s))\n```\nالجواب:", "qhash": "660b2145e8d4f41a", "answer": "7\n3\n8", "completion": " الناتج:\n```text\n7\n3\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 43)", "tests": ["assert clip_scale([6, 41, 22, 31, 27, 47]) == [22, 27, 31, 41]", "assert clip_scale([47, -6, 11]) == [11]", "assert clip_scale([35, 45]) == [35]", "assert clip_scale([20, 20, 0, -14, 20, 6]) == [20, 20, 20]", "assert clip_scale([27, 44, 55, 1, 2, 45, -8, -18, -3]) == [27]", "assert clip_scale([-5, -22, 47, -3, 49, 59, -3]) == []", "assert clip_scale([26, -8, -9]) == [26]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([6, 41, 22, 31, 27, 47]) == [22, 27, 31, 41]\nassert clip_scale([47, -6, 11]) == [11]\nassert clip_scale([35, 45]) == [35]\nassert clip_scale([20, 20, 0, -14, 20, 6]) == [20, 20, 20]\nassert clip_scale([27, 44, 55, 1, 2, 45, -8, -18, -3]) == [27]\nassert clip_scale([-5, -22, 47, -3, 49, 59, -3]) == []\nassert clip_scale([26, -8, -9]) == [26]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 43)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 1 for x in xs if 10 <= x <= 43)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و43 (شاملًا الطرفين) في 1.\nمثال: `clip_scale([6, 41, 22, 31, 27, 47])` يجب أن تُرجع `[22, 27, 31, 41]`.\nالجواب:", "qhash": "b63434fd71d6e6eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 7\nfor j in range(10, 18, 4):\n s -= j * 8\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 7\nfor j in range(10, 18, 4):\n s -= j * 8\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "a894c1185a9b3e95", "answer": "-185\n14", "completion": " الناتج:\n```text\n-185\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "reverse_words", "reference": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert reverse_words('it orange to apple engine') == 'engine_apple_to_orange_it'", "assert reverse_words('in cloud by an') == 'an_by_cloud_in'", "assert reverse_words('vector matrix data garden of signal') == 'signal_of_garden_data_matrix_vector'", "assert reverse_words('rocket river winter a') == 'a_winter_river_rocket'", "assert reverse_words('matrix of river it') == 'it_river_of_matrix'", "assert reverse_words('code data desert we is music camel') == 'camel_music_is_we_desert_data_code'", "assert reverse_words('stone of banana') == 'banana_of_stone'"], "test_code": "assert reverse_words('it orange to apple engine') == 'engine_apple_to_orange_it'\nassert reverse_words('in cloud by an') == 'an_by_cloud_in'\nassert reverse_words('vector matrix data garden of signal') == 'signal_of_garden_data_matrix_vector'\nassert reverse_words('rocket river winter a') == 'a_winter_river_rocket'\nassert reverse_words('matrix of river it') == 'it_river_of_matrix'\nassert reverse_words('code data desert we is music camel') == 'camel_music_is_we_desert_data_code'\nassert reverse_words('stone of banana') == 'banana_of_stone'", "answer": "def reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef reverse_words(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `reverse_words(s)` تأخذ جملة وتُرجع الكلمات التي طولها 1 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '_'.\nمثال: `reverse_words('it orange to apple engine')` يجب أن تُرجع `'engine_apple_to_orange_it'`.\nالجواب:", "qhash": "8417b40709eee8a7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'قلم ميناء'\nprint(w.find('ا'))\nprint(w.replace(' ', '-'))\nprint(w.count('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'قلم ميناء'\nprint(w.find('ا'))\nprint(w.replace(' ', '-'))\nprint(w.count('ا'))\n```\nالجواب:", "qhash": "b1ce302511618319", "answer": "7\nقلم-ميناء\n1", "completion": " الناتج:\n```text\n7\nقلم-ميناء\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert words_reversed('code summer code cloud window') == 'window/summer'", "assert words_reversed('engine by data data winter of winter a') == 'winter/winter/engine'", "assert words_reversed('is') == ''", "assert words_reversed('matrix it orange camel desert desert') == 'desert/desert/orange/matrix'", "assert words_reversed('river music cloud') == ''", "assert words_reversed('vector up orange') == 'orange/vector'", "assert words_reversed('planet engine apple cloud a we cloud') == 'engine/planet'"], "test_code": "assert words_reversed('code summer code cloud window') == 'window/summer'\nassert words_reversed('engine by data data winter of winter a') == 'winter/winter/engine'\nassert words_reversed('is') == ''\nassert words_reversed('matrix it orange camel desert desert') == 'desert/desert/orange/matrix'\nassert words_reversed('river music cloud') == ''\nassert words_reversed('vector up orange') == 'orange/vector'\nassert words_reversed('planet engine apple cloud a we cloud') == 'engine/planet'", "answer": "def words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `words_reversed(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('code summer code cloud window')` يُرجع `'window/summer'`.\nالجواب:", "qhash": "a6417b407eb1a9ef"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'cei'}", "tests": ["assert freq_of('vector') == {'c': 1, 'e': 1, 'i': 0}", "assert freq_of('code brain') == {'c': 1, 'e': 1, 'i': 1}", "assert freq_of('music') == {'c': 1, 'e': 0, 'i': 1}", "assert freq_of('an garden river in') == {'c': 0, 'e': 2, 'i': 2}", "assert freq_of('table code') == {'c': 1, 'e': 2, 'i': 0}", "assert freq_of('python window brain') == {'c': 0, 'e': 0, 'i': 2}", "assert freq_of('') == {'c': 0, 'e': 0, 'i': 0}"], "test_code": "assert freq_of('vector') == {'c': 1, 'e': 1, 'i': 0}\nassert freq_of('code brain') == {'c': 1, 'e': 1, 'i': 1}\nassert freq_of('music') == {'c': 1, 'e': 0, 'i': 1}\nassert freq_of('an garden river in') == {'c': 0, 'e': 2, 'i': 2}\nassert freq_of('table code') == {'c': 1, 'e': 2, 'i': 0}\nassert freq_of('python window brain') == {'c': 0, 'e': 0, 'i': 2}\nassert freq_of('') == {'c': 0, 'e': 0, 'i': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'cei'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'cei'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `freq_of(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'e'، 'i' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `freq_of('vector')` يُرجع `{'c': 1, 'e': 1, 'i': 0}`.\nالجواب:", "qhash": "44e022dab5326f4d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 0:\n count += 1\n return count", "tests": ["assert count_matching([80, 50, 12, 40, 0, 75, 18]) == 2", "assert count_matching([85]) == 0", "assert count_matching([19, 88, 16, -16, -16]) == 0", "assert count_matching([87, 41, 53, 34, 14, 7, 5, 35, 64]) == 0", "assert count_matching([80, -30, -25, 66, 15, -26, 14]) == 2", "assert count_matching([-18, -37]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([80, 50, 12, 40, 0, 75, 18]) == 2\nassert count_matching([85]) == 0\nassert count_matching([19, 88, 16, -16, -16]) == 0\nassert count_matching([87, 41, 53, 34, 14, 7, 5, 35, 64]) == 0\nassert count_matching([80, -30, -25, 66, 15, -26, 14]) == 2\nassert count_matching([-18, -37]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 6 == 0 and x % 8 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 8، ثم اكتب الدالة كاملة.\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([80, 50, 12, 40, 0, 75, 18])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "eef99a9d9dd1c7c7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('د')", "tests": ["assert count_letter('حصان ميناء برمجة مدرسة') == 1", "assert count_letter('') == 0", "assert count_letter('') == 0", "assert count_letter('') == 0", "assert count_letter('مدينة مدرسة برتقال قلم بحر قمر نهار نور') == 2", "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('مدينة مدرسة برتقال قلم بحر قمر نهار نور') == 2\nassert count_letter('فجر ميناء طالب برتقال مكتبة جمل') == 0\nassert count_letter('برتقال برتقال جمل خبز سفينة') == 0\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)` بحيث تُعيد عدد مرات ظهور الحرف «د» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('حصان ميناء برمجة مدرسة')` يُرجع `1`.\nالجواب:", "qhash": "c73e42a28376ebee"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -5 * x ** 2 + (4) * x + (-8)", "tests": ["assert quad(6) == -164", "assert quad(18) == -1556", "assert quad(20) == -1928", "assert quad(2) == -20", "assert quad(-17) == -1521", "assert quad(-1) == -17", "assert quad(-14) == -1044", "assert quad(0) == -8"], "test_code": "assert quad(6) == -164\nassert quad(18) == -1556\nassert quad(20) == -1928\nassert quad(2) == -20\nassert quad(-17) == -1521\nassert quad(-1) == -17\nassert quad(-14) == -1044\nassert quad(0) == -8", "answer": "def quad(x):\n return -5 * x ** 2 + (4) * x + (-8)", "completion": " ```python\ndef quad(x):\n return -5 * x ** 2 + (4) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -5x² + 4x - 8 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(6)` يُرجع `-164`.\nالجواب:", "qhash": "204d81aec626e606"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_div", "reference": "def count_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 count_div([76, 58, 29, 70, 52, 12, 23, 84, 4, 82, 41, 43]) == 2", "assert count_div([81, 79, 68, 53, 6, 5]) == 0", "assert count_div([59, 44, -33, 43, 77, 3, -31, 82, -39, -8]) == 1", "assert count_div([83]) == 0", "assert count_div([20, 66, 15, -3, 39, 88, 26, 10, 10, -31, 80, -20]) == 0", "assert count_div([-11, 35, -18, 38, 78, 59, 49, -21]) == 3", "assert count_div([]) == 0"], "test_code": "assert count_div([76, 58, 29, 70, 52, 12, 23, 84, 4, 82, 41, 43]) == 2\nassert count_div([81, 79, 68, 53, 6, 5]) == 0\nassert count_div([59, 44, -33, 43, 77, 3, -31, 82, -39, -8]) == 1\nassert count_div([83]) == 0\nassert count_div([20, 66, 15, -3, 39, 88, 26, 10, 10, -31, 80, -20]) == 0\nassert count_div([-11, 35, -18, 38, 78, 59, 49, -21]) == 3\nassert count_div([]) == 0", "answer": "def count_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 count_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 count_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_div([76, 58, 29, 70, 52, 12, 23, 84, 4, 82, 41, 43])` يجب أن تُرجع `2`.\nالجواب:", "qhash": "f73afc868138eb89"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 97", "tests": ["assert digits_mod(16895) == 13", "assert digits_mod(156386) == 74", "assert digits_mod(796132) == 83", "assert digits_mod(337608) == 70", "assert digits_mod(265974) == 17", "assert digits_mod(134641) == 79", "assert digits_mod(372520) == 91", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(16895) == 13\nassert digits_mod(156386) == 74\nassert digits_mod(796132) == 83\nassert digits_mod(337608) == 70\nassert digits_mod(265974) == 17\nassert digits_mod(134641) == 79\nassert digits_mod(372520) == 91\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 97", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 2 for d in str(n)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 97.\nمثال: `digits_mod(16895)` يجب أن تُرجع `13`.\nالجواب:", "qhash": "33c3b39f7da14a6c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert div_not([42, 38, 25, 49, 73, 89]) == 0", "assert div_not([83, -33]) == 0", "assert div_not([-28, 72, 69, 63, 6]) == 0", "assert div_not([74, 6, 59, 28, 81, -1, 85, 23, 66]) == 0", "assert div_not([-31]) == 0", "assert div_not([71, 86, 77, 35, -40, -33, -34, -2, -31, 1, -37, 74]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([42, 38, 25, 49, 73, 89]) == 0\nassert div_not([83, -33]) == 0\nassert div_not([-28, 72, 69, 63, 6]) == 0\nassert div_not([74, 6, 59, 28, 81, -1, 85, 23, 66]) == 0\nassert div_not([-31]) == 0\nassert div_not([71, 86, 77, 35, -40, -33, -34, -2, -31, 1, -37, 74]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n count = 0\n for x in xs:\n if x % 8 == 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 % 8 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([42, 38, 25, 49, 73, 89])` يُرجع `0`.\nالجواب:", "qhash": "54906de2f46329dc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 199:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([26, 58, 65, 58, 47, 87, 66, 73, 17]) == [26, 84, 149, 0, 47, 134, 0, 73, 90]", "assert cumulative([49, 0, 30, 148, 148, 14, -9, 69, 105, 134]) == [49, 49, 79, 0, 148, 162, 153, 0, 105, 0]", "assert cumulative([49, 35, -3, 45, 189, 39]) == [49, 84, 81, 126, 0, 39]", "assert cumulative([128, 26, 163, 64]) == [128, 154, 0, 64]", "assert cumulative([184, 131, 129, -3]) == [184, 0, 129, 126]", "assert cumulative([166, 55, 110, 45, 108, 123]) == [166, 0, 110, 155, 0, 123]", "assert cumulative([]) == []"], "test_code": "assert cumulative([26, 58, 65, 58, 47, 87, 66, 73, 17]) == [26, 84, 149, 0, 47, 134, 0, 73, 90]\nassert cumulative([49, 0, 30, 148, 148, 14, -9, 69, 105, 134]) == [49, 49, 79, 0, 148, 162, 153, 0, 105, 0]\nassert cumulative([49, 35, -3, 45, 189, 39]) == [49, 84, 81, 126, 0, 39]\nassert cumulative([128, 26, 163, 64]) == [128, 154, 0, 64]\nassert cumulative([184, 131, 129, -3]) == [184, 0, 129, 126]\nassert cumulative([166, 55, 110, 45, 108, 123]) == [166, 0, 110, 155, 0, 123]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 199:\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 > 199:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cumulative(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 199 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `cumulative([26, 58, 65, 58, 47, 87, 66, 73, 17])` يجب أن تُرجع `[26, 84, 149, 0, 47, 134, 0, 73, 90]`.\nالجواب:", "qhash": "9e5e39483c884e06"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "running_sum", "reference": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 71:\n s = 0\n out.append(s)\n return out", "tests": ["assert running_sum([28, 19, 33, 15, 28, 17]) == [28, 47, 0, 15, 43, 60]", "assert running_sum([14, -5, 6, 6, 41]) == [14, 9, 15, 21, 62]", "assert running_sum([8, 23]) == [8, 31]", "assert running_sum([24, 61, 2, 38, -4, 47, 57, 58, 0, 69]) == [24, 0, 2, 40, 36, 0, 57, 0, 0, 69]", "assert running_sum([27, 66, 54, 69, -10, 65]) == [27, 0, 54, 0, -10, 55]", "assert running_sum([16, 35, -6, 7, 64, 37]) == [16, 51, 45, 52, 0, 37]", "assert running_sum([]) == []"], "test_code": "assert running_sum([28, 19, 33, 15, 28, 17]) == [28, 47, 0, 15, 43, 60]\nassert running_sum([14, -5, 6, 6, 41]) == [14, 9, 15, 21, 62]\nassert running_sum([8, 23]) == [8, 31]\nassert running_sum([24, 61, 2, 38, -4, 47, 57, 58, 0, 69]) == [24, 0, 2, 40, 36, 0, 57, 0, 0, 69]\nassert running_sum([27, 66, 54, 69, -10, 65]) == [27, 0, 54, 0, -10, 55]\nassert running_sum([16, 35, -6, 7, 64, 37]) == [16, 51, 45, 52, 0, 37]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 71:\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 > 71:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `running_sum(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 71 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `running_sum([28, 19, 33, 15, 28, 17])` يُرجع `[28, 47, 0, 15, 43, 60]`.\nالجواب:", "qhash": "ef177b3d7c5aa9f2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(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 max_div([-1, 1, 4, -8, 15, 51, -7]) == -8", "assert max_div([-40, -24, -24]) == -24", "assert max_div([1]) == None", "assert max_div([18, 20, -19, -34, -18, 11, -27, -40, 22]) == -40", "assert max_div([-13, 15, -24]) == -24", "assert max_div([]) == None"], "test_code": "assert max_div([-1, 1, 4, -8, 15, 51, -7]) == -8\nassert max_div([-40, -24, -24]) == -24\nassert max_div([1]) == None\nassert max_div([18, 20, -19, -34, -18, 11, -27, -40, 22]) == -40\nassert max_div([-13, 15, -24]) == -24\nassert max_div([]) == None", "answer": "def max_div(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 max_div(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 max_div(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", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(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مثال: `max_div([-1, 1, 4, -8, 15, 51, -7])` يجب أن تُرجع `-8`.\nالجواب:", "qhash": "df655e51739741d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out", "tests": ["assert label_numbers(9) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9']", "assert label_numbers(23) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'HiYo', '17', 'Hi', '19', 'HiYo', '21', 'Hi', '23']", "assert label_numbers(9) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9']", "assert label_numbers(0) == []", "assert label_numbers(8) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo']"], "test_code": "assert label_numbers(9) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9']\nassert label_numbers(23) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'HiYo', '13', 'Hi', '15', 'HiYo', '17', 'Hi', '19', 'HiYo', '21', 'Hi', '23']\nassert label_numbers(9) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9']\nassert label_numbers(0) == []\nassert label_numbers(8) == ['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo']", "answer": "def label_numbers(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 0:\n s += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\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 += 'Hi'\n if i % 4 == 0:\n s += 'Yo'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `label_numbers(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Hi'، وعلى 4 بـ 'Yo'، وعلى كليهما بـ 'HiYo'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `label_numbers(9)` يجب أن تُرجع `['1', 'Hi', '3', 'HiYo', '5', 'Hi', '7', 'HiYo', '9']`.\nالجواب:", "qhash": "2ffedb28f83e9a98"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('python engine river apple code signal') == 'signal/code/apple/river/engine/python'", "assert words_reversed('matrix banana camel of') == 'of/camel/banana/matrix'", "assert words_reversed('') == ''", "assert words_reversed('brain table up') == 'up/table/brain'", "assert words_reversed('go pixel it apple by') == 'by/apple/it/pixel/go'", "assert words_reversed('summer by cloud desert') == 'desert/cloud/by/summer'", "assert words_reversed('engine of') == 'of/engine'"], "test_code": "assert words_reversed('python engine river apple code signal') == 'signal/code/apple/river/engine/python'\nassert words_reversed('matrix banana camel of') == 'of/camel/banana/matrix'\nassert words_reversed('') == ''\nassert words_reversed('brain table up') == 'up/table/brain'\nassert words_reversed('go pixel it apple by') == 'by/apple/it/pixel/go'\nassert words_reversed('summer by cloud desert') == 'desert/cloud/by/summer'\nassert words_reversed('engine of') == 'of/engine'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 2، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `words_reversed('python engine river apple code signal')` يُرجع `'signal/code/apple/river/engine/python'`.\nالجواب:", "qhash": "77d5a33aa3be4507"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_by([8, 49, 46, 10, 4]) == [49, 46, 10, 4, 8]", "assert rotate_by([-1, 50, 50, 49, 20, 17]) == [49, 20, 17, -1, 50, 50]", "assert rotate_by([12, 46, -8, 18, 37]) == [46, -8, 18, 37, 12]", "assert rotate_by([26, 43, 25, 1, 28, 35, 23]) == [35, 23, 26, 43, 25, 1, 28]", "assert rotate_by([-5]) == [-5]", "assert rotate_by([-9, -7, 16, 1, 9, 45, 48, 35, -2]) == [-9, -7, 16, 1, 9, 45, 48, 35, -2]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([8, 49, 46, 10, 4]) == [49, 46, 10, 4, 8]\nassert rotate_by([-1, 50, 50, 49, 20, 17]) == [49, 20, 17, -1, 50, 50]\nassert rotate_by([12, 46, -8, 18, 37]) == [46, -8, 18, 37, 12]\nassert rotate_by([26, 43, 25, 1, 28, 35, 23]) == [35, 23, 26, 43, 25, 1, 28]\nassert rotate_by([-5]) == [-5]\nassert rotate_by([-9, -7, 16, 1, 9, 45, 48, 35, -2]) == [-9, -7, 16, 1, 9, 45, 48, 35, -2]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 9 % 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 = 9 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_by(lst):\n if not lst:\n return []\n k = 9 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([8, 49, 46, 10, 4])` يُرجع `[49, 46, 10, 4, 8]`.\nالجواب:", "qhash": "86962c8936ec974c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "tests": ["assert weighted_sum(3) == 28", "assert weighted_sum(2) == 10", "assert weighted_sum(11) == 1012", "assert weighted_sum(15) == 2480", "assert weighted_sum(14) == 2030", "assert weighted_sum(1) == 2", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 28\nassert weighted_sum(2) == 10\nassert weighted_sum(11) == 1012\nassert weighted_sum(15) == 2480\nassert weighted_sum(14) == 2030\nassert weighted_sum(1) == 2\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total", "completion": " ```python\ndef weighted_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 2 * i ** 2\n return total\n```\n", "buggy": "def weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 2 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef weighted_sum(n):\n total = 0\n for i in range(0, n):\n total += 2 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `weighted_sum(3)` يُرجع `28`.\nالجواب:", "qhash": "2dbadc166435799e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [22, -20, -6, -10, 8]\nprint(sorted(nums, key=lambda x: (abs(x - 28), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [22, -20, -6, -10, 8]\nprint(sorted(nums, key=lambda x: (abs(x - 28), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "efea789e4aa740a4", "answer": "[22, 8, -6, -10, -20]\n[22, 8, -6]", "completion": " الناتج:\n```text\n[22, 8, -6, -10, -20]\n[22, 8, -6]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 40498\nsteps = 0\nwhile n > 15:\n n = n // 2\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 40498\nsteps = 0\nwhile n > 15:\n n = n // 2\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "be88219e8b819ee3", "answer": "9 12", "completion": " الناتج:\n```text\n9 12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 10\nfor j in range(7, 23, 4):\n acc -= j * 9\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 10\nfor j in range(7, 23, 4):\n acc -= j * 9\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "bd1b4abeca31aac6", "answer": "-458\n19", "completion": " الناتج:\n```text\n-458\n19\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -4 for x in xs if 11 <= x <= 49)", "tests": ["assert clip_scale([44, 29, 33, 45]) == [-180, -176, -132, -116]", "assert clip_scale([50, -21, 5, -26]) == []", "assert clip_scale([-29, 11, 1, 19, 22, -26, -13]) == [-88, -76, -44]", "assert clip_scale([38, 25, -10, 59, 36, 17, -29]) == [-152, -144, -100, -68]", "assert clip_scale([39, 11, 18, 8, -20, 7, -9, -28]) == [-156, -72, -44]", "assert clip_scale([52, -1, 6, 37]) == [-148]", "assert clip_scale([-22, -1]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([44, 29, 33, 45]) == [-180, -176, -132, -116]\nassert clip_scale([50, -21, 5, -26]) == []\nassert clip_scale([-29, 11, 1, 19, 22, -26, -13]) == [-88, -76, -44]\nassert clip_scale([38, 25, -10, 59, 36, 17, -29]) == [-152, -144, -100, -68]\nassert clip_scale([39, 11, 18, 8, -20, 7, -9, -28]) == [-156, -72, -44]\nassert clip_scale([52, -1, 6, 37]) == [-148]\nassert clip_scale([-22, -1]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -4 for x in xs if 11 <= x <= 49)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -4 for x in xs if 11 <= x <= 49)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 11 و49 (شاملًا الطرفين) في -4.\nمثال: `clip_scale([44, 29, 33, 45])` يجب أن تُرجع `[-180, -176, -132, -116]`.\nالجواب:", "qhash": "77cd1ae2185e0cae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ي'))", "tests": ["assert letter_hits('وردة مكتبة حديقة بحر شمس') == 0", "assert letter_hits('لغة قلم مطر نور') == 0", "assert letter_hits('سوق نهار نهار علم خبز قهوة باب') == 0", "assert letter_hits('عمل مكتبة قلم مطر طالب سلام مكتبة سماء') == 0", "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('سوق نهار نهار علم خبز قهوة باب') == 0\nassert letter_hits('عمل مكتبة قلم مطر طالب سلام مكتبة سماء') == 0\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 w.startswith('ي'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ي'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `letter_hits(text)` تأخذ نصًا عربيًا وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ي».\nمثال: `letter_hits('وردة مكتبة حديقة بحر شمس')` يجب أن تُرجع `0`.\nالجواب:", "qhash": "063e3948ec370bae"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "lst = [37, -5, -1, 5, 21, 26]\nprint(lst[0:3])\nprint(lst[::2])\nprint(sum(lst[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nlst = [37, -5, -1, 5, 21, 26]\nprint(lst[0:3])\nprint(lst[::2])\nprint(sum(lst[0:3]))\n```\nالجواب:", "qhash": "ef6b6881f8387934", "answer": "[37, -5, -1]\n[37, -1, 21]\n31", "completion": " الناتج:\n```text\n[37, -5, -1]\n[37, -1, 21]\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "entry": "play", "reference": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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(24) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Fizz']", "assert play(2) == ['1', '2']", "assert play(18) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz']", "assert play(20) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz', '19', 'Fizz']", "assert play(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13']"], "test_code": "assert play(24) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Fizz']\nassert play(2) == ['1', '2']\nassert play(18) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz']\nassert play(20) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz', '19', 'Fizz']\nassert play(13) == ['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 4 == 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 % 4 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 4 أضف 'Fizz'، وإن قَبِلها على 9 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `play(24)` يُرجع `['1', '2', '3', 'Fizz', '5', '6', '7', 'Fizz', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', 'Fizz', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Fizz']`.\nالجواب:", "qhash": "a6b22265b75aaa14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 1) // 2 for x in range(6, 16) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 1) // 2 for x in range(6, 16) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "c7aadcfac10c844d", "answer": "[3, 4, 5, 6, 7]\n5 25", "completion": " الناتج:\n```text\n[3, 4, 5, 6, 7]\n5 25\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 2 * x ** 2 + (-3) * x + (-4)", "tests": ["assert eval_poly(9) == 131", "assert eval_poly(1) == -5", "assert eval_poly(-18) == 698", "assert eval_poly(-13) == 373", "assert eval_poly(-2) == 10", "assert eval_poly(19) == 661", "assert eval_poly(11) == 205", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(9) == 131\nassert eval_poly(1) == -5\nassert eval_poly(-18) == 698\nassert eval_poly(-13) == 373\nassert eval_poly(-2) == 10\nassert eval_poly(19) == 661\nassert eval_poly(11) == 205\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return 2 * x ** 2 + (-3) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return 2 * x ** 2 + (-3) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 2x² - 3x - 4 عند العدد الصحيح x.\nمثال: `eval_poly(9)` يجب أن تُرجع `131`.\nالجواب:", "qhash": "42ac0f8ccfe194d5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 68", "tests": ["assert pow_digits(54577) == 20", "assert pow_digits(132472) == 51", "assert pow_digits(458992) == 7", "assert pow_digits(927539) == 61", "assert pow_digits(739837) == 49", "assert pow_digits(121453) == 6", "assert pow_digits(790294) == 29", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(54577) == 20\nassert pow_digits(132472) == 51\nassert pow_digits(458992) == 7\nassert pow_digits(927539) == 61\nassert pow_digits(739837) == 49\nassert pow_digits(121453) == 6\nassert pow_digits(790294) == 29\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 68", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 68\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 68.\nمثال: `pow_digits(54577)` يجب أن تُرجع `20`.\nالجواب:", "qhash": "72b4cb2abbb04b3c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "tally", "reference": "def tally(s):\n return {c: s.count(c) for c in 'cdor'}", "tests": ["assert tally('to planet by summer table brain') == {'c': 0, 'd': 0, 'o': 1, 'r': 2}", "assert tally('window of on we apple engine') == {'c': 0, 'd': 1, 'o': 3, 'r': 0}", "assert tally('of go python summer a camel') == {'c': 1, 'd': 0, 'o': 3, 'r': 1}", "assert tally('falcon code of') == {'c': 2, 'd': 1, 'o': 3, 'r': 0}", "assert tally('vector winter') == {'c': 1, 'd': 0, 'o': 1, 'r': 2}", "assert tally('window music desert') == {'c': 1, 'd': 2, 'o': 1, 'r': 1}", "assert tally('') == {'c': 0, 'd': 0, 'o': 0, 'r': 0}"], "test_code": "assert tally('to planet by summer table brain') == {'c': 0, 'd': 0, 'o': 1, 'r': 2}\nassert tally('window of on we apple engine') == {'c': 0, 'd': 1, 'o': 3, 'r': 0}\nassert tally('of go python summer a camel') == {'c': 1, 'd': 0, 'o': 3, 'r': 1}\nassert tally('falcon code of') == {'c': 2, 'd': 1, 'o': 3, 'r': 0}\nassert tally('vector winter') == {'c': 1, 'd': 0, 'o': 1, 'r': 2}\nassert tally('window music desert') == {'c': 1, 'd': 2, 'o': 1, 'r': 1}\nassert tally('') == {'c': 0, 'd': 0, 'o': 0, 'r': 0}", "answer": "def tally(s):\n return {c: s.count(c) for c in 'cdor'}", "completion": " ```python\ndef tally(s):\n return {c: s.count(c) for c in 'cdor'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `tally(s)` تُرجع قاموسًا مفاتيحه المحارف 'c'، 'd'، 'o'، 'r' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `tally('to planet by summer table brain')` يجب أن تُرجع `{'c': 0, 'd': 0, 'o': 1, 'r': 2}`.\nالجواب:", "qhash": "cbee0bd80bb379ed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "out = [x ** 2 - 3 for x in range(-4, 8) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nout = [x ** 2 - 3 for x in range(-4, 8) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f6d05eeef0a32d63", "answer": "[1, 1, 33]\n3 35", "completion": " الناتج:\n```text\n[1, 1, 33]\n3 35\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "tests": ["assert sum_div(241) == 5880", "assert sum_div(84) == 681", "assert sum_div(113) == 1266", "assert sum_div(281) == 7701", "assert sum_div(183) == 3330", "assert sum_div(228) == 5178", "assert sum_div(1) == 0"], "test_code": "assert sum_div(241) == 5880\nassert sum_div(84) == 681\nassert sum_div(113) == 1266\nassert sum_div(281) == 7701\nassert sum_div(183) == 3330\nassert sum_div(228) == 5178\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `sum_div(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 6 أو على 15.\nمثال: `sum_div(241)` يجب أن تُرجع `5880`.\nالجواب:", "qhash": "c89ab7367ceb646c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 19 <= x <= 56)", "tests": ["assert filter_range([23, 9, 64, 9, 36, 59, 52, 9, 10]) == [-260, -180, -115]", "assert filter_range([-25, 44, 26, -10, -25, -22, -16, -5, 52, 46]) == [-260, -230, -220, -130]", "assert filter_range([30, 29]) == [-150, -145]", "assert filter_range([-18, 43, -4, 59, 15, 27, -27, -3]) == [-215, -135]", "assert filter_range([12, -25, 20]) == [-100]", "assert filter_range([34, 56, 13, -19, -18]) == [-280, -170]", "assert filter_range([26, 51, 32, -11, 32, 39, 45, 39]) == [-255, -225, -195, -195, -160, -160, -130]", "assert filter_range([]) == []"], "test_code": "assert filter_range([23, 9, 64, 9, 36, 59, 52, 9, 10]) == [-260, -180, -115]\nassert filter_range([-25, 44, 26, -10, -25, -22, -16, -5, 52, 46]) == [-260, -230, -220, -130]\nassert filter_range([30, 29]) == [-150, -145]\nassert filter_range([-18, 43, -4, 59, 15, 27, -27, -3]) == [-215, -135]\nassert filter_range([12, -25, 20]) == [-100]\nassert filter_range([34, 56, 13, -19, -18]) == [-280, -170]\nassert filter_range([26, 51, 32, -11, 32, 39, 45, 39]) == [-255, -225, -195, -195, -160, -160, -130]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -5 for x in xs if 19 <= x <= 56)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -5 for x in xs if 19 <= x <= 56)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 19 و56 (شاملًا الطرفين) في -5.\nمثال: `filter_range([23, 9, 64, 9, 36, 59, 52, 9, 10])` يجب أن تُرجع `[-260, -180, -115]`.\nالجواب:", "qhash": "3712ab7dcf469cc7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * -1 for x in xs if 10 <= x <= 37)", "tests": ["assert clip_scale([8, 14, 35, 13, 12, 12]) == [-35, -14, -13, -12, -12]", "assert clip_scale([-27, -13, 45, 33]) == [-33]", "assert clip_scale([33, 0, 23, 14]) == [-33, -23, -14]", "assert clip_scale([-23, 27, -21, 49, 20, 18, 31, -16, 26]) == [-31, -27, -26, -20, -18]", "assert clip_scale([2, 12]) == [-12]", "assert clip_scale([-24, 7, -20, 4, -14]) == []", "assert clip_scale([47, 55, -20]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([8, 14, 35, 13, 12, 12]) == [-35, -14, -13, -12, -12]\nassert clip_scale([-27, -13, 45, 33]) == [-33]\nassert clip_scale([33, 0, 23, 14]) == [-33, -23, -14]\nassert clip_scale([-23, 27, -21, 49, 20, 18, 31, -16, 26]) == [-31, -27, -26, -20, -18]\nassert clip_scale([2, 12]) == [-12]\nassert clip_scale([-24, 7, -20, 4, -14]) == []\nassert clip_scale([47, 55, -20]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * -1 for x in xs if 10 <= x <= 37)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * -1 for x in xs if 10 <= x <= 37)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `clip_scale(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 10 و37 (شاملًا الطرفين) في -1.\nمثال: `clip_scale([8, 14, 35, 13, 12, 12])` يجب أن تُرجع `[-35, -14, -13, -12, -12]`.\nالجواب:", "qhash": "95f0de26717fd588"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 4 for x in xs if -18 <= x <= 1)", "tests": ["assert select_range([-28, 3, -27, -14, -27, 7, 8, -19, -17]) == [-68, -56]", "assert select_range([50, 13, 27, 39, 49]) == []", "assert select_range([-29, -18, 51, -2, 18, 52, -7, -23, 16, -22]) == [-72, -28, -8]", "assert select_range([38, -29, 13, 17, 41, 2, 55, -18, 31]) == [-72]", "assert select_range([42, 36, 9, 17, -11, -18]) == [-72, -44]", "assert select_range([37]) == []", "assert select_range([18, 37]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-28, 3, -27, -14, -27, 7, 8, -19, -17]) == [-68, -56]\nassert select_range([50, 13, 27, 39, 49]) == []\nassert select_range([-29, -18, 51, -2, 18, 52, -7, -23, 16, -22]) == [-72, -28, -8]\nassert select_range([38, -29, 13, 17, 41, 2, 55, -18, 31]) == [-72]\nassert select_range([42, 36, 9, 17, -11, -18]) == [-72, -44]\nassert select_range([37]) == []\nassert select_range([18, 37]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 4 for x in xs if -18 <= x <= 1)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 4 for x in xs if -18 <= x <= 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -18 و1 (شاملًا الطرفين) في 4.\nمثال: `select_range([-28, 3, -27, -14, -27, 7, 8, -19, -17])` يجب أن تُرجع `[-68, -56]`.\nالجواب:", "qhash": "97989703808a4b0e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total", "tests": ["assert sum_powers(6) == 147", "assert sum_powers(13) == 637", "assert sum_powers(13) == 637", "assert sum_powers(5) == 105", "assert sum_powers(3) == 42", "assert sum_powers(1) == 7", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(6) == 147\nassert sum_powers(13) == 637\nassert sum_powers(13) == 637\nassert sum_powers(5) == 105\nassert sum_powers(3) == 42\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 ** 1\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 1\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 1\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 7 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total = 7 * i ** 1\n return total\n```\nللتوضيح: الاستدعاء `sum_powers(6)` يُرجع `147`.\nالجواب:", "qhash": "f56f225ef367169d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "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('is coffee music') == 'music_coffee'", "assert words_reversed('camel coffee brain falcon window coffee camel data') == 'camel_coffee_window_falcon_brain_coffee_camel'", "assert words_reversed('pixel banana') == 'banana_pixel'", "assert words_reversed('river engine planet is brain to') == 'brain_planet_engine_river'", "assert words_reversed('in summer stone music camel') == 'camel_music_stone_summer'", "assert words_reversed('we planet data light brain we by') == 'brain_light_planet'", "assert words_reversed('river signal of matrix is an camel planet') == 'planet_camel_matrix_signal_river'"], "test_code": "assert words_reversed('is coffee music') == 'music_coffee'\nassert words_reversed('camel coffee brain falcon window coffee camel data') == 'camel_coffee_window_falcon_brain_coffee_camel'\nassert words_reversed('pixel banana') == 'banana_pixel'\nassert words_reversed('river engine planet is brain to') == 'brain_planet_engine_river'\nassert words_reversed('in summer stone music camel') == 'camel_music_stone_summer'\nassert words_reversed('we planet data light brain we by') == 'brain_light_planet'\nassert words_reversed('river signal of matrix is an camel planet') == 'planet_camel_matrix_signal_river'", "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('is coffee music')` يجب أن تُرجع `'music_coffee'`.\nالجواب:", "qhash": "d8a416c4eea5358c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('جمل دفتر دفتر سفينة سيارة') == 2", "assert begin_count('دفتر قهوة رمل برمجة برتقال') == 1", "assert begin_count('حديقة دفتر سلام صحراء دفتر نور') == 2", "assert begin_count('مطر سوق صحراء مطر سلام دفتر دفتر سماء') == 2", "assert begin_count('دفتر جبل خبز رمل كتاب خبز دفتر ليل') == 2", "assert begin_count('بيت عمل نهار صحراء مدرسة شجرة') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('جمل دفتر دفتر سفينة سيارة') == 2\nassert begin_count('دفتر قهوة رمل برمجة برتقال') == 1\nassert begin_count('حديقة دفتر سلام صحراء دفتر نور') == 2\nassert begin_count('مطر سوق صحراء مطر سلام دفتر دفتر سماء') == 2\nassert begin_count('دفتر جبل خبز رمل كتاب خبز دفتر ليل') == 2\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:\n if w.startswith('د'):\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «د»، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef begin_count(sentence):\n count = 0\n for w in sentence:\n if w.startswith('د'):\n count += 1\n return count\n```\nمثال: `begin_count('جمل دفتر دفتر سفينة سيارة')` يجب أن تُرجع `2`.\nالجواب:", "qhash": "8f52e8d2953af5d9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "mult_sum", "reference": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "tests": ["assert mult_sum(91) == 1399", "assert mult_sum(34) == 198", "assert mult_sum(181) == 5490", "assert mult_sum(163) == 4459", "assert mult_sum(220) == 7884", "assert mult_sum(228) == 8553", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(91) == 1399\nassert mult_sum(34) == 198\nassert mult_sum(181) == 5490\nassert mult_sum(163) == 4459\nassert mult_sum(220) == 7884\nassert mult_sum(228) == 8553\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)", "completion": " ```python\ndef mult_sum(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `mult_sum(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 9.\nمثال: `mult_sum(91)` يجب أن تُرجع `1399`.\nالجواب:", "qhash": "0b69f202bdb4b3eb"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "biggest_mult", "reference": "def biggest_mult(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 biggest_mult([-15, 7, 12, -28, -16, 29]) == None", "assert biggest_mult([-11, -22, -11]) == -11", "assert biggest_mult([1, 12, 23, 34]) == None", "assert biggest_mult([23, -14, -1, 39, -6, 24]) == None", "assert biggest_mult([17, 36, -17, -22, 9, 4, -47, -7]) == -22", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-15, 7, 12, -28, -16, 29]) == None\nassert biggest_mult([-11, -22, -11]) == -11\nassert biggest_mult([1, 12, 23, 34]) == None\nassert biggest_mult([23, -14, -1, 39, -6, 24]) == None\nassert biggest_mult([17, 36, -17, -22, 9, 4, -47, -7]) == -22\nassert biggest_mult([]) == None", "answer": "def biggest_mult(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 biggest_mult(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 biggest_mult(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 biggest_mult(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مثال: `biggest_mult([-15, 7, 12, -28, -16, 29])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "668ba715e27b703f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('summer A1') == 'kmeewj A1'", "assert rot('window desert we stone up') == 'oafvgo vwkwjl ow klgfw mh'", "assert rot('falcon brain matrix brain !') == 'xsdugf tjsaf esljap tjsaf !'", "assert rot('brain') == 'tjsaf'", "assert rot('garden planet matrix music table') == 'ysjvwf hdsfwl esljap emkau lstdw'", "assert rot('banana cloud') == 'tsfsfs udgmv'", "assert rot('') == ''"], "test_code": "assert rot('summer A1') == 'kmeewj A1'\nassert rot('window desert we stone up') == 'oafvgo vwkwjl ow klgfw mh'\nassert rot('falcon brain matrix brain !') == 'xsdugf tjsaf esljap tjsaf !'\nassert rot('brain') == 'tjsaf'\nassert rot('garden planet matrix music table') == 'ysjvwf hdsfwl esljap emkau lstdw'\nassert rot('banana cloud') == 'tsfsfs udgmv'\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 + (-8)) % 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 + (-8)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rot(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('summer A1')` يجب أن تُرجع `'kmeewj A1'`.\nالجواب:", "qhash": "da2adfa7fc6ec528"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43", "tests": ["assert prod_mod(10) == 30", "assert prod_mod(45) == 0", "assert prod_mod(4) == 24", "assert prod_mod(52) == 0", "assert prod_mod(55) == 0", "assert prod_mod(27) == 21", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(10) == 30\nassert prod_mod(45) == 0\nassert prod_mod(4) == 24\nassert prod_mod(52) == 0\nassert prod_mod(55) == 0\nassert prod_mod(27) == 21\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `prod_mod(10)` يجب أن تُرجع `30`.\nالجواب:", "qhash": "9a8e68bab8c1ae0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('حصان صحراء جمل') == 1", "assert words_starting('ليل حديقة طالب ميناء') == 1", "assert words_starting('لغة مدينة طائرة') == 0", "assert words_starting('وردة طالب برمجة فجر حاسوب فجر') == 1", "assert words_starting('قهوة حاسوب تفاحة برمجة') == 1", "assert words_starting('قمر حديقة مدرسة عمل حديقة') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('حصان صحراء جمل') == 1\nassert words_starting('ليل حديقة طالب ميناء') == 1\nassert words_starting('لغة مدينة طائرة') == 0\nassert words_starting('وردة طالب برمجة فجر حاسوب فجر') == 1\nassert words_starting('قهوة حاسوب تفاحة برمجة') == 1\nassert words_starting('قمر حديقة مدرسة عمل حديقة') == 2\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 'ح' in w:\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 'ح' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `words_starting('حصان صحراء جمل')` يُرجع `1`.\nالجواب:", "qhash": "5f074d2348c1d6ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_hits", "reference": "def count_hits(text):\n return text.count('ن')", "tests": ["assert count_hits('برمجة كتاب جبل') == 0", "assert count_hits('سوق وردة حاسوب جبل فجر وردة مكتبة') == 0", "assert count_hits('نهر حاسوب مدرسة مطر صحراء قمر') == 1", "assert count_hits('بحر نهار بحر بيت نهار قمر برمجة طائرة') == 2", "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('نهر حاسوب مدرسة مطر صحراء قمر') == 1\nassert count_hits('بحر نهار بحر بيت نهار قمر برمجة طائرة') == 2\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)` بحيث تُعيد عدد مرات ظهور الحرف «ن» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_hits('برمجة كتاب جبل')` يُرجع `0`.\nالجواب:", "qhash": "aa0eead7b9f6765d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate_by", "reference": "def rotate_by(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate_by([2, 25, 11, 43, 42, 13, 13]) == [13, 13, 2, 25, 11, 43, 42]", "assert rotate_by([21, 47, 33, 10]) == [33, 10, 21, 47]", "assert rotate_by([18, 16, 21, 17, 20, -9, 1, 37, 11, -3]) == [11, -3, 18, 16, 21, 17, 20, -9, 1, 37]", "assert rotate_by([13, 34, 24, 17, 28, 34, 39, 47]) == [39, 47, 13, 34, 24, 17, 28, 34]", "assert rotate_by([19, 21, -3, 26]) == [-3, 26, 19, 21]", "assert rotate_by([-4, -3, 2, 17, 8, 31, 22]) == [31, 22, -4, -3, 2, 17, 8]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([2, 25, 11, 43, 42, 13, 13]) == [13, 13, 2, 25, 11, 43, 42]\nassert rotate_by([21, 47, 33, 10]) == [33, 10, 21, 47]\nassert rotate_by([18, 16, 21, 17, 20, -9, 1, 37, 11, -3]) == [11, -3, 18, 16, 21, 17, 20, -9, 1, 37]\nassert rotate_by([13, 34, 24, 17, 28, 34, 39, 47]) == [39, 47, 13, 34, 24, 17, 28, 34]\nassert rotate_by([19, 21, -3, 26]) == [-3, 26, 19, 21]\nassert rotate_by([-4, -3, 2, 17, 8, 31, 22]) == [31, 22, -4, -3, 2, 17, 8]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate_by(arr):\n if not arr:\n return []\n k = 2 % len(arr)\n return arr[len(arr) - k:] + arr[:len(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([2, 25, 11, 43, 42, 13, 13])` يجب أن تُرجع `[13, 13, 2, 25, 11, 43, 42]`.\nالجواب:", "qhash": "f918114ca046e770"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "letter_hits", "reference": "def letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ه'))", "tests": ["assert letter_hits('حديقة حديقة قمر نهار شمس دفتر صديق') == 0", "assert letter_hits('') == 0", "assert letter_hits('عمل تفاحة تفاحة') == 0", "assert letter_hits('صديق سفينة شجرة باب مدرسة قلم فجر باب') == 0", "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('عمل تفاحة تفاحة') == 0\nassert letter_hits('صديق سفينة شجرة باب مدرسة قلم فجر باب') == 0\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 w.startswith('ه'))", "completion": " ```python\ndef letter_hits(text):\n return sum(1 for w in text.split() if w.startswith('ه'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `letter_hits(text)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ه»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `letter_hits('حديقة حديقة قمر نهار شمس دفتر صديق')` يُرجع `0`.\nالجواب:", "qhash": "8b5d969ebfe7193f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "s = 13\nfor i in range(0, 20, 2):\n s += i * 6\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 13\nfor i in range(0, 20, 2):\n s += i * 6\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "21054d25880434b5", "answer": "553\n18", "completion": " الناتج:\n```text\n553\n18\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('desert to vector by') == 'by vector to desert'", "assert flip_words('python stone vector summer is banana camel') == 'camel banana is summer vector stone python'", "assert flip_words('planet signal') == 'signal planet'", "assert flip_words('coffee on apple stone planet signal an') == 'an signal planet stone apple on coffee'", "assert flip_words('winter rocket an apple code desert by winter') == 'winter by desert code apple an rocket winter'", "assert flip_words('coffee we vector an') == 'an vector we coffee'", "assert flip_words('matrix by summer vector brain river') == 'river brain vector summer by matrix'"], "test_code": "assert flip_words('desert to vector by') == 'by vector to desert'\nassert flip_words('python stone vector summer is banana camel') == 'camel banana is summer vector stone python'\nassert flip_words('planet signal') == 'signal planet'\nassert flip_words('coffee on apple stone planet signal an') == 'an signal planet stone apple on coffee'\nassert flip_words('winter rocket an apple code desert by winter') == 'winter by desert code apple an rocket winter'\nassert flip_words('coffee we vector an') == 'an vector we coffee'\nassert flip_words('matrix by summer vector brain river') == 'river brain vector summer by 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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `flip_words('desert to vector by')` يُرجع `'by vector to desert'`.\nالجواب:", "qhash": "227b3de05f99bebf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 3\nfor i in range(6, 26, 3):\n result += i * 1\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 3\nfor i in range(6, 26, 3):\n result += i * 1\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "550d705af77d3133", "answer": "108\n24", "completion": " الناتج:\n```text\n108\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=0):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(5))\nprint(h(5, 15))\nprint(h(h(15), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=0):\n if x > y:\n return x * 9 - y\n return x + y * 9\n\nprint(h(5))\nprint(h(5, 15))\nprint(h(h(15), 5))\n```\nالجواب:", "qhash": "1b27f9ff2a467ffb", "answer": "45\n140\n1210", "completion": " الناتج:\n```text\n45\n140\n1210\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 2", "tests": ["assert sum_digit_pow(11153) == 1", "assert sum_digit_pow(34902) == 0", "assert sum_digit_pow(897196) == 0", "assert sum_digit_pow(567128) == 1", "assert sum_digit_pow(686379) == 1", "assert sum_digit_pow(756385) == 0", "assert sum_digit_pow(780845) == 0", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(11153) == 1\nassert sum_digit_pow(34902) == 0\nassert sum_digit_pow(897196) == 0\nassert sum_digit_pow(567128) == 1\nassert sum_digit_pow(686379) == 1\nassert sum_digit_pow(756385) == 0\nassert sum_digit_pow(780845) == 0\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 2", "completion": " ```python\ndef sum_digit_pow(n):\n return sum(int(d) ** 4 for d in str(n)) % 2\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `sum_digit_pow(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 2.\nمثال: `sum_digit_pow(11153)` يجب أن تُرجع `1`.\nالجواب:", "qhash": "ccd3eb38b3ab30f4"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert cycle([45, 11, 46, 42, 43]) == [42, 43, 45, 11, 46]", "assert cycle([48, 1, 39, -9]) == [39, -9, 48, 1]", "assert cycle([3, 11, 10, 27, 18, 30, 27, 27, 26]) == [3, 11, 10, 27, 18, 30, 27, 27, 26]", "assert cycle([39, 43, 18, 36, 36, 30]) == [39, 43, 18, 36, 36, 30]", "assert cycle([22, 13, 20, 8]) == [20, 8, 22, 13]", "assert cycle([39, -8, 28, 33, -1]) == [33, -1, 39, -8, 28]", "assert cycle([]) == []"], "test_code": "assert cycle([45, 11, 46, 42, 43]) == [42, 43, 45, 11, 46]\nassert cycle([48, 1, 39, -9]) == [39, -9, 48, 1]\nassert cycle([3, 11, 10, 27, 18, 30, 27, 27, 26]) == [3, 11, 10, 27, 18, 30, 27, 27, 26]\nassert cycle([39, 43, 18, 36, 36, 30]) == [39, 43, 18, 36, 36, 30]\nassert cycle([22, 13, 20, 8]) == [20, 8, 22, 13]\nassert cycle([39, -8, 28, 33, -1]) == [33, -1, 39, -8, 28]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 18 % len(xs)\n return ____\n```\nمثال: `cycle([45, 11, 46, 42, 43])` يجب أن تُرجع `[42, 43, 45, 11, 46]`.\nالجواب:", "qhash": "67f77cedfa144103"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "nums = [1, 14, 35, 11, 14, -3, 36, 9, 29]\nprint(nums[2:3])\nprint(nums[::2])\nprint(max(nums[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [1, 14, 35, 11, 14, -3, 36, 9, 29]\nprint(nums[2:3])\nprint(nums[::2])\nprint(max(nums[2:3]))\n```\nالجواب:", "qhash": "927697ac4f3caf86", "answer": "[35]\n[1, 35, 14, 36, 29]\n35", "completion": " الناتج:\n```text\n[35]\n[1, 35, 14, 36, 29]\n35\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 52", "tests": ["assert pow_digits(92842) == 33", "assert pow_digits(956328) == 33", "assert pow_digits(449221) == 10", "assert pow_digits(968640) == 25", "assert pow_digits(508618) == 50", "assert pow_digits(70317) == 6", "assert pow_digits(722465) == 40", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(92842) == 33\nassert pow_digits(956328) == 33\nassert pow_digits(449221) == 10\nassert pow_digits(968640) == 25\nassert pow_digits(508618) == 50\nassert pow_digits(70317) == 6\nassert pow_digits(722465) == 40\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 52", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 52\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 5، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 52.\nللتوضيح: الاستدعاء `pow_digits(92842)` يُرجع `33`.\nالجواب:", "qhash": "ac09e72db65b9c8a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "kalima = 'مطر جمل'\nprint(kalima.count('ج'))\nprint(kalima.split())\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nkalima = 'مطر جمل'\nprint(kalima.count('ج'))\nprint(kalima.split())\nprint(len(kalima))\n```\nالجواب:", "qhash": "e63572a2a89fd99a", "answer": "1\n['مطر', 'جمل']\n7", "completion": " الناتج:\n```text\n1\n['مطر', 'جمل']\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(181) == 4140", "assert multiples_total(129) == 2112", "assert multiples_total(238) == 7080", "assert multiples_total(87) == 924", "assert multiples_total(102) == 1300", "assert multiples_total(169) == 3612", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(181) == 4140\nassert multiples_total(129) == 2112\nassert multiples_total(238) == 7080\nassert multiples_total(87) == 924\nassert multiples_total(102) == 1300\nassert multiples_total(169) == 3612\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 4 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `multiples_total(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 4 أو على 12.\nمثال: `multiples_total(181)` يجب أن تُرجع `4140`.\nالجواب:", "qhash": "62a487009fababb1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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 count_special([88, 34, 73, 24, 90, 5, 43, 59, 74, 37, 59]) == 5", "assert count_special([58, -30, -17, 12]) == 3", "assert count_special([-32, 61]) == 1", "assert count_special([25, 38, 49]) == 1", "assert count_special([57, -38, 15, 77, 18, 8, 73, -38, 75, 83, -9, 84]) == 4", "assert count_special([]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([88, 34, 73, 24, 90, 5, 43, 59, 74, 37, 59]) == 5\nassert count_special([58, -30, -17, 12]) == 3\nassert count_special([-32, 61]) == 1\nassert count_special([25, 38, 49]) == 1\nassert count_special([57, -38, 15, 77, 18, 8, 73, -38, 75, 83, -9, 84]) == 4\nassert count_special([]) == 0\nassert count_special([]) == 0", "answer": "def count_special(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 count_special(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 count_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([88, 34, 73, 24, 90, 5, 43, 59, 74, 37, 59])` يجب أن تُرجع `5`.\nالجواب:", "qhash": "b75bd9055d5e2ace"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 82192\ncount = 0\nwhile m > 11:\n m = m // 6\n count += 1\nprint(m, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 82192\ncount = 0\nwhile m > 11:\n m = m // 6\n count += 1\nprint(m, count)\n```\nالجواب:", "qhash": "02d87220759fc091", "answer": "10 5", "completion": " الناتج:\n```text\n10 5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "scores = {'راشد': 0, 'رنا': 23, 'زينب': 2}\nscores['رنا'] += 14\nscores['هشام'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('أحمد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nscores = {'راشد': 0, 'رنا': 23, 'زينب': 2}\nscores['رنا'] += 14\nscores['هشام'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('أحمد', -1))\n```\nالجواب:", "qhash": "9cc9f77f43ae5349", "answer": "4\nهشام\n99\n-1", "completion": " الناتج:\n```text\n4\nهشام\n99\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n <= 0:\n return 3\n return 2 * calc(n - 1) + 0\n\nprint(calc(10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n <= 0:\n return 3\n return 2 * calc(n - 1) + 0\n\nprint(calc(10))\n```\nالجواب:", "qhash": "3ec9f0e74a26ce1c", "answer": "3072", "completion": " الناتج:\n```text\n3072\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 41", "tests": ["assert pow_digits(83262) == 11", "assert pow_digits(208772) == 33", "assert pow_digits(664803) == 14", "assert pow_digits(309314) == 10", "assert pow_digits(269492) == 28", "assert pow_digits(16638) == 5", "assert pow_digits(982267) == 36", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(83262) == 11\nassert pow_digits(208772) == 33\nassert pow_digits(664803) == 14\nassert pow_digits(309314) == 10\nassert pow_digits(269492) == 28\nassert pow_digits(16638) == 5\nassert pow_digits(982267) == 36\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 41", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 4 for d in str(n)) % 41\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 41.\nمثال: `pow_digits(83262)` يجب أن تُرجع `11`.\nالجواب:", "qhash": "bd490dd85549306d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'يوسف': 41, 'علي': 42, 'عمر': 49, 'مريم': 3}\nmarks['يوسف'] += 10\nmarks['نور'] = 50\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, 'علي': 42, 'عمر': 49, 'مريم': 3}\nmarks['يوسف'] += 10\nmarks['نور'] = 50\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": "f8a59cb64b813cc8", "answer": "5\nيوسف\n195\n[('مريم', 3), ('علي', 42)]", "completion": " الناتج:\n```text\n5\nيوسف\n195\n[('مريم', 3), ('علي', 42)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert encode('to at to data') == 'vq cv vq fcvc'", "assert encode('cloud matrix data') == 'enqwf ocvtkz fcvc'", "assert encode('window data !') == 'ykpfqy fcvc !'", "assert encode('window light') == 'ykpfqy nkijv'", "assert encode('go') == 'iq'", "assert encode('by camel !') == 'da ecogn !'", "assert encode('') == ''"], "test_code": "assert encode('to at to data') == 'vq cv vq fcvc'\nassert encode('cloud matrix data') == 'enqwf ocvtkz fcvc'\nassert encode('window data !') == 'ykpfqy fcvc !'\nassert encode('window light') == 'ykpfqy nkijv'\nassert encode('go') == 'iq'\nassert encode('by camel !') == 'da ecogn !'\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 + (2)) % 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 + (2)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `encode(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('to at to data')` يُرجع `'vq cv vq fcvc'`.\nالجواب:", "qhash": "23afcb8f64ba2d4e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6", "tests": ["assert pow_digits(10881) == 0", "assert pow_digits(170653) == 4", "assert pow_digits(586890) == 0", "assert pow_digits(25557) == 0", "assert pow_digits(56055) == 3", "assert pow_digits(798428) == 2", "assert pow_digits(430285) == 4", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(10881) == 0\nassert pow_digits(170653) == 4\nassert pow_digits(586890) == 0\nassert pow_digits(25557) == 0\nassert pow_digits(56055) == 3\nassert pow_digits(798428) == 2\nassert pow_digits(430285) == 4\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 5 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `pow_digits(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 6.\nمثال: `pow_digits(10881)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "871169b73a059a0f"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "tally_div", "reference": "def tally_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 tally_div([26, 35, 33, 14, 19, 19, 46, 49]) == 0", "assert tally_div([32]) == 0", "assert tally_div([43, -38, 68, 34, 21, 46, -33, 74, 5, -29, 16]) == 0", "assert tally_div([-8, -21, 15, 39, -15]) == 0", "assert tally_div([51, 45, -8, 23]) == 0", "assert tally_div([63, 9]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([26, 35, 33, 14, 19, 19, 46, 49]) == 0\nassert tally_div([32]) == 0\nassert tally_div([43, -38, 68, 34, 21, 46, -33, 74, 5, -29, 16]) == 0\nassert tally_div([-8, -21, 15, 39, -15]) == 0\nassert tally_div([51, 45, -8, 23]) == 0\nassert tally_div([63, 9]) == 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 % 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 % 6 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 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([26, 35, 33, 14, 19, 19, 46, 49])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "1ca506a73e19ee3b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def f(x, y=6):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(f(-8))\nprint(f(-8, -5))\nprint(f(f(-5), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(x, y=6):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(f(-8))\nprint(f(-8, -5))\nprint(f(f(-5), -8))\n```\nالجواب:", "qhash": "6c5967955a8e200c", "answer": "-20\n2\n-1", "completion": " الناتج:\n```text\n-20\n2\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def f(n):\n if n < 2:\n return n + 2\n return f(n - 1) + f(n - 2)\n\nprint(f(3))", "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(3))\n```\nالجواب:", "qhash": "848e9edfdd7b5eac", "answer": "8", "completion": " الناتج:\n```text\n8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(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 only_div([28, 27, 31, 74, 37, 41]) == 1", "assert only_div([-36, -13, 79, -7, -22, 59, 59, 42, -38, -33]) == 1", "assert only_div([63]) == 0", "assert only_div([55]) == 0", "assert only_div([-32, 34, -14, -4, 33, -10]) == 2", "assert only_div([26]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([28, 27, 31, 74, 37, 41]) == 1\nassert only_div([-36, -13, 79, -7, -22, 59, 59, 42, -38, -33]) == 1\nassert only_div([63]) == 0\nassert only_div([55]) == 0\nassert only_div([-32, 34, -14, -4, 33, -10]) == 2\nassert only_div([26]) == 0\nassert only_div([]) == 0", "answer": "def only_div(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 only_div(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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([28, 27, 31, 74, 37, 41])` يُرجع `1`.\nالجواب:", "qhash": "9644c2eb48e39740"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 3\nfor i in range(9, 16, 4):\n s -= i * 3\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 3\nfor i in range(9, 16, 4):\n s -= i * 3\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "3cef34df89bf52d6", "answer": "-63\n13", "completion": " الناتج:\n```text\n-63\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_long_words('summer banana planet') == 'planet,banana,summer'", "assert rev_long_words('go light') == 'light'", "assert rev_long_words('banana pixel') == 'pixel,banana'", "assert rev_long_words('code') == 'code'", "assert rev_long_words('an rocket vector data python an') == 'python,data,vector,rocket'", "assert rev_long_words('python winter we signal up coffee') == 'coffee,signal,winter,python'", "assert rev_long_words('window stone an signal falcon') == 'falcon,signal,stone,window'"], "test_code": "assert rev_long_words('summer banana planet') == 'planet,banana,summer'\nassert rev_long_words('go light') == 'light'\nassert rev_long_words('banana pixel') == 'pixel,banana'\nassert rev_long_words('code') == 'code'\nassert rev_long_words('an rocket vector data python an') == 'python,data,vector,rocket'\nassert rev_long_words('python winter we signal up coffee') == 'coffee,signal,winter,python'\nassert rev_long_words('window stone an signal falcon') == 'falcon,signal,stone,window'", "answer": "def rev_long_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_long_words(s):\n return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_long_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 4، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `rev_long_words('summer banana planet')` يُرجع `'planet,banana,summer'`.\nالجواب:", "qhash": "775541326ca9ccbd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 5 for x in xs if 7 <= x <= 46)", "tests": ["assert pick_between([0, 39, 43, 19, 20, 44]) == [95, 100, 195, 215, 220]", "assert pick_between([-28, 18, 50, -29, 32, 33, 56, 45]) == [90, 160, 165, 225]", "assert pick_between([26, 52, 58, -20, 3, 59, -28, 1, -1, 49]) == [130]", "assert pick_between([43]) == [215]", "assert pick_between([-20]) == []", "assert pick_between([45, 52, 17, -8, 7]) == [35, 85, 225]", "assert pick_between([0, 29]) == [145]", "assert pick_between([]) == []"], "test_code": "assert pick_between([0, 39, 43, 19, 20, 44]) == [95, 100, 195, 215, 220]\nassert pick_between([-28, 18, 50, -29, 32, 33, 56, 45]) == [90, 160, 165, 225]\nassert pick_between([26, 52, 58, -20, 3, 59, -28, 1, -1, 49]) == [130]\nassert pick_between([43]) == [215]\nassert pick_between([-20]) == []\nassert pick_between([45, 52, 17, -8, 7]) == [35, 85, 225]\nassert pick_between([0, 29]) == [145]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 5 for x in xs if 7 <= x <= 46)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 5 for x in xs if 7 <= x <= 46)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 7 ≤ x ≤ 46، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([0, 39, 43, 19, 20, 44])` يُرجع `[95, 100, 195, 215, 220]`.\nالجواب:", "qhash": "4c0da7a5de47f435"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('وردة عمل قمر نهار صديق جمل') == 1", "assert count_start('دفتر مطر صحراء وردة نهر') == 1", "assert count_start('وردة قلم قلم شجرة حاسوب علم') == 1", "assert count_start('مدرسة برمجة جمل وردة شمس وردة') == 2", "assert count_start('تفاحة حاسوب طالب حاسوب نهار') == 0", "assert count_start('حصان وردة بيت صديق طالب وردة ميناء قلم') == 2", "assert count_start('') == 0"], "test_code": "assert count_start('وردة عمل قمر نهار صديق جمل') == 1\nassert count_start('دفتر مطر صحراء وردة نهر') == 1\nassert count_start('وردة قلم قلم شجرة حاسوب علم') == 1\nassert count_start('مدرسة برمجة جمل وردة شمس وردة') == 2\nassert count_start('تفاحة حاسوب طالب حاسوب نهار') == 0\nassert count_start('حصان وردة بيت صديق طالب وردة ميناء قلم') == 2\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 w.endswith('و'):\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 w.endswith('و'):\n count += 1\n return count\n```\nمثال: `count_start('وردة عمل قمر نهار صديق جمل')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "0f3067eb97a974d3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "out = [x ** 2 - 8 for x in range(5, 11) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nout = [x ** 2 - 8 for x in range(5, 11) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f6a69790dbc0b6f3", "answer": "[28, 56, 92]\n3 176", "completion": " الناتج:\n```text\n[28, 56, 92]\n3 176\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(498296768))\nprint(calc(calc(498296768)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(498296768))\nprint(calc(calc(498296768)))\n```\nالجواب:", "qhash": "7bc5120f6e8c78c6", "answer": "59\n14", "completion": " الناتج:\n```text\n59\n14\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 6 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(30) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Buzz', 'Fizz', '26', '27', '28', '29', 'FizzBuzz']", "assert fizzbuzz(7) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7']", "assert fizzbuzz(8) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8']", "assert fizzbuzz(7) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7']", "assert fizzbuzz(2) == ['1', '2']"], "test_code": "assert fizzbuzz(30) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Buzz', 'Fizz', '26', '27', '28', '29', 'FizzBuzz']\nassert fizzbuzz(7) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7']\nassert fizzbuzz(8) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8']\nassert fizzbuzz(7) == ['1', '2', '3', '4', 'Fizz', 'Buzz', '7']\nassert fizzbuzz(2) == ['1', '2']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Fizz'\n if i % 6 == 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 % 5 == 0:\n s += 'Fizz'\n if i % 6 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Fizz'، وإن قَبِلها على 6 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(30)` يُرجع `['1', '2', '3', '4', 'Fizz', 'Buzz', '7', '8', '9', 'Fizz', '11', 'Buzz', '13', '14', 'Fizz', '16', '17', 'Buzz', '19', 'Fizz', '21', '22', '23', 'Buzz', 'Fizz', '26', '27', '28', '29', 'FizzBuzz']`.\nالجواب:", "qhash": "c73ea7b08d6df3ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 130:\n s = 0\n out.append(s)\n return out", "tests": ["assert cumulative([38, 38, 51, 70, 28, 66, 24, 23]) == [38, 76, 127, 0, 28, 94, 118, 0]", "assert cumulative([]) == []", "assert cumulative([3, 34, 113, 29, 8]) == [3, 37, 0, 29, 37]", "assert cumulative([63, 28, 2, 49, -4, 104, 116]) == [63, 91, 93, 0, -4, 100, 0]", "assert cumulative([87, 25, 120, 80, 112, 56, 0]) == [87, 112, 0, 80, 0, 56, 56]", "assert cumulative([]) == []", "assert cumulative([]) == []"], "test_code": "assert cumulative([38, 38, 51, 70, 28, 66, 24, 23]) == [38, 76, 127, 0, 28, 94, 118, 0]\nassert cumulative([]) == []\nassert cumulative([3, 34, 113, 29, 8]) == [3, 37, 0, 29, 37]\nassert cumulative([63, 28, 2, 49, -4, 104, 116]) == [63, 91, 93, 0, -4, 100, 0]\nassert cumulative([87, 25, 120, 80, 112, 56, 0]) == [87, 112, 0, 80, 0, 56, 56]\nassert cumulative([]) == []\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 130:\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 > 130:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 130 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([38, 38, 51, 70, 28, 66, 24, 23])` يُرجع `[38, 76, 127, 0, 28, 94, 118, 0]`.\nالجواب:", "qhash": "c04d6d454fe20a6d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "tests": ["assert scaled_powers(7) == 420", "assert scaled_powers(4) == 90", "assert scaled_powers(8) == 612", "assert scaled_powers(5) == 165", "assert scaled_powers(1) == 3", "assert scaled_powers(1) == 3", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 420\nassert scaled_powers(4) == 90\nassert scaled_powers(8) == 612\nassert scaled_powers(5) == 165\nassert scaled_powers(1) == 3\nassert scaled_powers(1) == 3\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 3 * i ** 2\n return total\n```\n", "buggy": "def scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 3 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n):\n total += 3 * i ** 2\n return total\n```\nللتوضيح: الاستدعاء `scaled_powers(7)` يُرجع `420`.\nالجواب:", "qhash": "85ef0f9b256a2c84"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate([48, 43, 41, 46]) == [41, 46, 48, 43]", "assert rotate([12, 42]) == [12, 42]", "assert rotate([27, 43, 48, 42, 47, 49, -4, 30]) == [-4, 30, 27, 43, 48, 42, 47, 49]", "assert rotate([-5, 18, 27, 49, -1, 7]) == [-5, 18, 27, 49, -1, 7]", "assert rotate([1, 16, 0, 41, -9, 41, 49, -7]) == [49, -7, 1, 16, 0, 41, -9, 41]", "assert rotate([33, 20, 41, -1, 4, 41, 25, 7]) == [25, 7, 33, 20, 41, -1, 4, 41]", "assert rotate([]) == []"], "test_code": "assert rotate([48, 43, 41, 46]) == [41, 46, 48, 43]\nassert rotate([12, 42]) == [12, 42]\nassert rotate([27, 43, 48, 42, 47, 49, -4, 30]) == [-4, 30, 27, 43, 48, 42, 47, 49]\nassert rotate([-5, 18, 27, 49, -1, 7]) == [-5, 18, 27, 49, -1, 7]\nassert rotate([1, 16, 0, 41, -9, 41, 49, -7]) == [49, -7, 1, 16, 0, 41, -9, 41]\nassert rotate([33, 20, 41, -1, 4, 41, 25, 7]) == [25, 7, 33, 20, 41, -1, 4, 41]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 6 % len(lst)\n return ____\n```\nمثال: `rotate([48, 43, 41, 46])` يجب أن تُرجع `[41, 46, 48, 43]`.\nالجواب:", "qhash": "09f5fd5fb8088736"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "text = 'matrix'\nprint(text.upper())\nprint(text.split('_'))\nprint(text.index('x') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'matrix'\nprint(text.upper())\nprint(text.split('_'))\nprint(text.index('x') + len(text))\n```\nالجواب:", "qhash": "968ef16df7a87593", "answer": "MATRIX\n['matrix']\n11", "completion": " الناتج:\n```text\nMATRIX\n['matrix']\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rot('apple code brain') == 'jyyun lxmn kajrw'", "assert rot('pixel in camel Hello') == 'yrgnu rw ljvnu Hnuux'", "assert rot('of') == 'xo'", "assert rot('of a planet 2024') == 'xo j yujwnc 2024'", "assert rot('data music !') == 'mjcj vdbrl !'", "assert rot('music apple OK') == 'vdbrl jyyun OK'", "assert rot('') == ''"], "test_code": "assert rot('apple code brain') == 'jyyun lxmn kajrw'\nassert rot('pixel in camel Hello') == 'yrgnu rw ljvnu Hnuux'\nassert rot('of') == 'xo'\nassert rot('of a planet 2024') == 'xo j yujwnc 2024'\nassert rot('data music !') == 'mjcj vdbrl !'\nassert rot('music apple OK') == 'vdbrl jyyun OK'\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 + (-17)) % 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 + (-17)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rot(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `rot('apple code brain')` يُرجع `'jyyun lxmn kajrw'`.\nالجواب:", "qhash": "2eae334b717b6912"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 7 * x ** 2 + (-9) * x + (-4)", "tests": ["assert eval_poly(10) == 606", "assert eval_poly(8) == 372", "assert eval_poly(-9) == 644", "assert eval_poly(-5) == 216", "assert eval_poly(12) == 896", "assert eval_poly(0) == -4", "assert eval_poly(-17) == 2172", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(10) == 606\nassert eval_poly(8) == 372\nassert eval_poly(-9) == 644\nassert eval_poly(-5) == 216\nassert eval_poly(12) == 896\nassert eval_poly(0) == -4\nassert eval_poly(-17) == 2172\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n return 7 * x ** 2 + (-9) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n return 7 * x ** 2 + (-9) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `eval_poly(x)` تحسب المقدار 7x² - 9x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `eval_poly(10)` يُرجع `606`.\nالجواب:", "qhash": "3087f56a3ee561e8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -5 * x ** 2 + (-1) * x + (2)", "tests": ["assert evaluate(2) == -20", "assert evaluate(4) == -82", "assert evaluate(-5) == -118", "assert evaluate(2) == -20", "assert evaluate(2) == -20", "assert evaluate(-8) == -310", "assert evaluate(-2) == -16", "assert evaluate(0) == 2"], "test_code": "assert evaluate(2) == -20\nassert evaluate(4) == -82\nassert evaluate(-5) == -118\nassert evaluate(2) == -20\nassert evaluate(2) == -20\nassert evaluate(-8) == -310\nassert evaluate(-2) == -16\nassert evaluate(0) == 2", "answer": "def evaluate(x):\n return -5 * x ** 2 + (-1) * x + (2)", "completion": " ```python\ndef evaluate(x):\n return -5 * x ** 2 + (-1) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -5x² - 1x + 2 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(2)` يُرجع `-20`.\nالجواب:", "qhash": "ffcc4f5d54eb865e"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "text = 'light_engine'\nprint(text.replace('i', '#'))\nprint(text.upper())\nprint(text[-4:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ntext = 'light_engine'\nprint(text.replace('i', '#'))\nprint(text.upper())\nprint(text[-4:])\n```\nالجواب:", "qhash": "0d169f22c2b263b4", "answer": "l#ght_eng#ne\nLIGHT_ENGINE\ngine", "completion": " الناتج:\n```text\nl#ght_eng#ne\nLIGHT_ENGINE\ngine\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def g(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(11))\nprint(g(11, 12))\nprint(g(g(12), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef g(x, y=9):\n if x > y:\n return x * 3 - y\n return x + y * 3\n\nprint(g(11))\nprint(g(11, 12))\nprint(g(g(12), 11))\n```\nالجواب:", "qhash": "b2b54a85d51e79fb", "answer": "24\n47\n70", "completion": " الناتج:\n```text\n24\n47\n70\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def go(n):\n if n < 2:\n return n + 0\n return go(n - 1) + go(n - 2)\n\nprint(go(10))", "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(10))\n```\nالجواب:", "qhash": "c3fb9143b937fbac", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 389\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 = 389\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": "195dd00b0fd46e23", "answer": "120", "completion": " الناتج:\n```text\n120\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_div", "reference": "def max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_div([17, 4, 10, 39, -10, -16, -19, 31, -2]) == 39", "assert max_div([-12, -12, -12]) == -12", "assert max_div([1, 4, 7]) == None", "assert max_div([-2, -7]) == None", "assert max_div([-28, 31, -29]) == None", "assert max_div([]) == None"], "test_code": "assert max_div([17, 4, 10, 39, -10, -16, -19, 31, -2]) == 39\nassert max_div([-12, -12, -12]) == -12\nassert max_div([1, 4, 7]) == None\nassert max_div([-2, -7]) == None\nassert max_div([-28, 31, -29]) == None\nassert max_div([]) == None", "answer": "def max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef max_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def max_div(arr):\n best = 0\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef max_div(arr):\n best = 0\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `max_div([17, 4, 10, 39, -10, -16, -19, 31, -2])` يجب أن تُرجع `39`.\nالجواب:", "qhash": "770eac785631a2e1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 15\nfor n in range(-3, 13, 1):\n total += n * 8\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 15\nfor n in range(-3, 13, 1):\n total += n * 8\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "da7c85149cfae078", "answer": "591\n12", "completion": " الناتج:\n```text\n591\n12\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 71", "tests": ["assert fact_mod(7) == 34", "assert fact_mod(10) == 6", "assert fact_mod(8) == 29", "assert fact_mod(32) == 27", "assert fact_mod(7) == 34", "assert fact_mod(18) == 56", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 34\nassert fact_mod(10) == 6\nassert fact_mod(8) == 29\nassert fact_mod(32) == 27\nassert fact_mod(7) == 34\nassert fact_mod(18) == 56\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 71", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 2)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(7)` يُرجع `34`.\nالجواب:", "qhash": "02cf3a6d9e6e1fda"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Fizz'\n if i % 9 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']", "assert fizzbuzz(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz']", "assert fizzbuzz(25) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz', '19', 'Fizz', '21', 'Fizz', '23', 'Fizz', '25']", "assert fizzbuzz(16) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz']", "assert fizzbuzz(12) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz']"], "test_code": "assert fizzbuzz(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']\nassert fizzbuzz(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz']\nassert fizzbuzz(25) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz', '19', 'Fizz', '21', 'Fizz', '23', 'Fizz', '25']\nassert fizzbuzz(16) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz']\nassert fizzbuzz(12) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 % 2 == 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)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 2 أضف 'Fizz'، وإن قَبِلها على 9 أضف 'Buzz' (فيصبح 'FizzBuzz' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(18)` يُرجع `['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', 'Buzz', 'Fizz', '11', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'FizzBuzz']`.\nالجواب:", "qhash": "b83b7c3224506571"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 42", "tests": ["assert digits_mod(65875) == 13", "assert digits_mod(795410) == 16", "assert digits_mod(266028) == 0", "assert digits_mod(807212) == 20", "assert digits_mod(857833) == 40", "assert digits_mod(125345) == 8", "assert digits_mod(676893) == 23", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(65875) == 13\nassert digits_mod(795410) == 16\nassert digits_mod(266028) == 0\nassert digits_mod(807212) == 20\nassert digits_mod(857833) == 40\nassert digits_mod(125345) == 8\nassert digits_mod(676893) == 23\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 42", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 4 for d in str(n)) % 42\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 4، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 42.\nللتوضيح: الاستدعاء `digits_mod(65875)` يُرجع `13`.\nالجواب:", "qhash": "22c964a744ccde33"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'falcon'\nprint(s.split('_'))\nprint(s[::-1])\nprint(s.count('l'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'falcon'\nprint(s.split('_'))\nprint(s[::-1])\nprint(s.count('l'))\n```\nالجواب:", "qhash": "0973709b3611c510", "answer": "['falcon']\nnoclaf\n1", "completion": " الناتج:\n```text\n['falcon']\nnoclaf\n1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81", "tests": ["assert digits_mod(91881) == 27", "assert digits_mod(124214) == 14", "assert digits_mod(81469) == 28", "assert digits_mod(499907) == 38", "assert digits_mod(602828) == 26", "assert digits_mod(5563) == 19", "assert digits_mod(362911) == 22", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(91881) == 27\nassert digits_mod(124214) == 14\nassert digits_mod(81469) == 28\nassert digits_mod(499907) == 38\nassert digits_mod(602828) == 26\nassert digits_mod(5563) == 19\nassert digits_mod(362911) == 22\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 1 for d in str(n)) % 81\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digits_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 1) على 81.\nمثال: `digits_mod(91881)` يجب أن تُرجع `27`.\nالجواب:", "qhash": "c2c80cab515f25a3"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "div_not", "reference": "def div_not(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 div_not([83, 39, 72, 80, 21, 51]) == 1", "assert div_not([80, 44, 74, 2, 90, -38, -21, 4, 32, 66, 72]) == 7", "assert div_not([-3, -7]) == 0", "assert div_not([46, -30, 35, 21, 20, 18, -8, 39, 83]) == 3", "assert div_not([22, 4, 6, -31, -38, -12]) == 3", "assert div_not([13, -25, 21, 58, -32]) == 2", "assert div_not([]) == 0"], "test_code": "assert div_not([83, 39, 72, 80, 21, 51]) == 1\nassert div_not([80, 44, 74, 2, 90, -38, -21, 4, 32, 66, 72]) == 7\nassert div_not([-3, -7]) == 0\nassert div_not([46, -30, 35, 21, 20, 18, -8, 39, 83]) == 3\nassert div_not([22, 4, 6, -31, -38, -12]) == 3\nassert div_not([13, -25, 21, 58, -32]) == 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 % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([83, 39, 72, 80, 21, 51])` يُرجع `1`.\nالجواب:", "qhash": "621cfc11de203cc6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'حسن': 32, 'سلمى': 31, 'وليد': 28, 'أحمد': 34}\nmarks['وليد'] += 20\nmarks['هشام'] = 60\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 = {'حسن': 32, 'سلمى': 31, 'وليد': 28, 'أحمد': 34}\nmarks['وليد'] += 20\nmarks['هشام'] = 60\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": "5d24bb50d225e4be", "answer": "5\nهشام\n205\n['حسن', 'سلمى', 'وليد', 'أحمد', 'هشام']", "completion": " الناتج:\n```text\n5\nهشام\n205\n['حسن', 'سلمى', 'وليد', 'أحمد', 'هشام']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "result = 16\nfor j in range(2, 27, 2):\n result -= j * 4\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nresult = 16\nfor j in range(2, 27, 2):\n result -= j * 4\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "fa2882a67ac5009f", "answer": "-712\n26", "completion": " الناتج:\n```text\n-712\n26\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "marks = {'مريم': 27, 'حسن': 27, 'علي': 48}\nmarks['مريم'] += 8\nmarks['فيصل'] = 11\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 = {'مريم': 27, 'حسن': 27, 'علي': 48}\nmarks['مريم'] += 8\nmarks['فيصل'] = 11\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": "2c91588262b57326", "answer": "4\nعلي\n121\n[('فيصل', 11), ('حسن', 27)]", "completion": " الناتج:\n```text\n4\nعلي\n121\n[('فيصل', 11), ('حسن', 27)]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_power", "reference": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 25", "tests": ["assert digit_power(57850) == 22", "assert digit_power(299071) == 15", "assert digit_power(743464) == 21", "assert digit_power(690436) == 15", "assert digit_power(795421) == 10", "assert digit_power(14709) == 19", "assert digit_power(887961) == 1", "assert digit_power(0) == 0"], "test_code": "assert digit_power(57850) == 22\nassert digit_power(299071) == 15\nassert digit_power(743464) == 21\nassert digit_power(690436) == 15\nassert digit_power(795421) == 10\nassert digit_power(14709) == 19\nassert digit_power(887961) == 1\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 25", "completion": " ```python\ndef digit_power(n):\n return sum(int(d) ** 4 for d in str(n)) % 25\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_power(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 4) على 25.\nمثال: `digit_power(57850)` يجب أن تُرجع `22`.\nالجواب:", "qhash": "36b1d338c69e5d47"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 33915\nsteps = 0\nwhile n > 7:\n n = n // 2\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nn = 33915\nsteps = 0\nwhile n > 7:\n n = n // 2\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "bc2aeb10e6de93d7", "answer": "4 13", "completion": " الناتج:\n```text\n4 13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "pow_digits", "reference": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 77", "tests": ["assert pow_digits(68587) == 14", "assert pow_digits(15975) == 14", "assert pow_digits(246107) == 16", "assert pow_digits(322139) == 30", "assert pow_digits(678244) == 52", "assert pow_digits(473160) == 35", "assert pow_digits(830185) == 22", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(68587) == 14\nassert pow_digits(15975) == 14\nassert pow_digits(246107) == 16\nassert pow_digits(322139) == 30\nassert pow_digits(678244) == 52\nassert pow_digits(473160) == 35\nassert pow_digits(830185) == 22\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 77", "completion": " ```python\ndef pow_digits(n):\n return sum(int(d) ** 3 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pow_digits(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 77.\nللتوضيح: الاستدعاء `pow_digits(68587)` يُرجع `14`.\nالجواب:", "qhash": "8c0404b6c0ac2d72"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'معلم'\nprint(w.split())\nprint('ر' in w)\nprint(w[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'معلم'\nprint(w.split())\nprint('ر' in w)\nprint(w[0])\n```\nالجواب:", "qhash": "44f58966be4ff1f5", "answer": "['معلم']\nFalse\nم", "completion": " الناتج:\n```text\n['معلم']\nFalse\nم\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#0", "entry": "count_special", "reference": "def count_special(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_special([62, 15, 81, 27, 33, 70]) == 0", "assert count_special([87, 19, 22]) == 0", "assert count_special([-29, -6, 36, 77, 60, 0, 20, 5, 87]) == 1", "assert count_special([60, 19]) == 0", "assert count_special([36]) == 0", "assert count_special([-28, -34, -16, 64, 90, 25, 58]) == 3", "assert count_special([]) == 0"], "test_code": "assert count_special([62, 15, 81, 27, 33, 70]) == 0\nassert count_special([87, 19, 22]) == 0\nassert count_special([-29, -6, 36, 77, 60, 0, 20, 5, 87]) == 1\nassert count_special([60, 19]) == 0\nassert count_special([36]) == 0\nassert count_special([-28, -34, -16, 64, 90, 25, 58]) == 3\nassert count_special([]) == 0", "answer": "def count_special(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_special(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_special(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nمثال: `count_special([62, 15, 81, 27, 33, 70])` يجب أن تُرجع `0`.\nالجواب:", "qhash": "729cef1fcb5f7be1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "s = 'نهار شجرة'\nprint(s.split())\nprint('ا' in s)\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'نهار شجرة'\nprint(s.split())\nprint('ا' in s)\nprint(s[-1])\n```\nالجواب:", "qhash": "750720f8d5edb7ae", "answer": "['نهار', 'شجرة']\nTrue\nة", "completion": " الناتج:\n```text\n['نهار', 'شجرة']\nTrue\nة\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "power_sum", "reference": "def power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total", "tests": ["assert power_sum(8) == 61404", "assert power_sum(8) == 61404", "assert power_sum(13) == 624897", "assert power_sum(8) == 61404", "assert power_sum(8) == 61404", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(8) == 61404\nassert power_sum(8) == 61404\nassert power_sum(13) == 624897\nassert power_sum(8) == 61404\nassert power_sum(8) == 61404\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 ** 4\n return total", "completion": " ```python\ndef power_sum(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 4\n return total\n```\n", "buggy": "def power_sum(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 power_sum(n):\n total = 0\n for i in range(0, n):\n total += 7 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `power_sum(8)` يُرجع `61404`.\nالجواب:", "qhash": "eb27dd4603229c92"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "multiples_total", "reference": "def multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)", "tests": ["assert multiples_total(90) == 753", "assert multiples_total(171) == 2718", "assert multiples_total(139) == 1779", "assert multiples_total(228) == 4928", "assert multiples_total(124) == 1380", "assert multiples_total(76) == 585", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(90) == 753\nassert multiples_total(171) == 2718\nassert multiples_total(139) == 1779\nassert multiples_total(228) == 4928\nassert multiples_total(124) == 1380\nassert multiples_total(76) == 585\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 % 15 == 0)", "completion": " ```python\ndef multiples_total(n):\n return sum(x for x in range(1, n) if x % 8 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `multiples_total(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 8 أو من مضاعفات 15، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `multiples_total(90)` يُرجع `753`.\nالجواب:", "qhash": "b109683a9de2deed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 0:\n count += 1\n return count", "tests": ["assert only_div([73, 18, 43, 9, 82, 72, 7, 23, 2, 35]) == 4", "assert only_div([16]) == 1", "assert only_div([70, -22, -20, 56, 32, 36, -17, 67, -17, -23, 23, 61]) == 4", "assert only_div([]) == 0", "assert only_div([21, 10, -28, -14, -39, 13, 16, 58]) == 4", "assert only_div([25, 48, 37, 9, 39, 86, 78, -4]) == 4", "assert only_div([]) == 0"], "test_code": "assert only_div([73, 18, 43, 9, 82, 72, 7, 23, 2, 35]) == 4\nassert only_div([16]) == 1\nassert only_div([70, -22, -20, 56, 32, 36, -17, 67, -17, -23, 23, 61]) == 4\nassert only_div([]) == 0\nassert only_div([21, 10, -28, -14, -39, 13, 16, 58]) == 4\nassert only_div([25, 48, 37, 9, 39, 86, 78, -4]) == 4\nassert only_div([]) == 0", "answer": "def only_div(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 5 != 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 % 5 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 5، واكتب الدالة بعد إكمالها.\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([73, 18, 43, 9, 82, 72, 7, 23, 2, 35])` يُرجع `4`.\nالجواب:", "qhash": "6687c466c53790be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [(x + 6) // 3 for x in range(-5, 1) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [(x + 6) // 3 for x in range(-5, 1) if x % 3 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "64994f5aacfe4b69", "answer": "[0, 1]\n2 1", "completion": " الناتج:\n```text\n[0, 1]\n2 1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 6)", "tests": ["assert select_range([-6, -8, 8, 13, 14, 9, 14]) == []", "assert select_range([46, -5]) == []", "assert select_range([-3, 17, -13, -11, -17, 10, 20, 18]) == []", "assert select_range([35, -20, 0]) == []", "assert select_range([22, 44, 54]) == []", "assert select_range([16, 8, -25, 0, -16, 48]) == []", "assert select_range([-21, 48, 53, 29, -23, 53, 24]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-6, -8, 8, 13, 14, 9, 14]) == []\nassert select_range([46, -5]) == []\nassert select_range([-3, 17, -13, -11, -17, 10, 20, 18]) == []\nassert select_range([35, -20, 0]) == []\nassert select_range([22, 44, 54]) == []\nassert select_range([16, 8, -25, 0, -16, 48]) == []\nassert select_range([-21, 48, 53, 29, -23, 53, 24]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 6)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * -1 for x in xs if 1 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 1 و6 (شاملًا الطرفين) في -1.\nمثال: `select_range([-6, -8, 8, 13, 14, 9, 14])` يجب أن تُرجع `[]`.\nالجواب:", "qhash": "2b4e499fa22f1b0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('منى', 22), ('فيصل', 78), ('سعيد', 78), ('عمر', 71)]\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 = [('منى', 22), ('فيصل', 78), ('سعيد', 78), ('عمر', 71)]\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": "c95161f4e5e459fe", "answer": "[('منى', 22), ('عمر', 71), ('سعيد', 78), ('فيصل', 78)]\n['سعيد', 'فيصل']", "completion": " الناتج:\n```text\n[('منى', 22), ('عمر', 71), ('سعيد', 78), ('فيصل', 78)]\n['سعيد', 'فيصل']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 70", "tests": ["assert dig_pow_mod(80195) == 23", "assert dig_pow_mod(485846) == 15", "assert dig_pow_mod(82250) == 47", "assert dig_pow_mod(140918) == 23", "assert dig_pow_mod(557577) == 16", "assert dig_pow_mod(972401) == 53", "assert dig_pow_mod(405740) == 0", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(80195) == 23\nassert dig_pow_mod(485846) == 15\nassert dig_pow_mod(82250) == 47\nassert dig_pow_mod(140918) == 23\nassert dig_pow_mod(557577) == 16\nassert dig_pow_mod(972401) == 53\nassert dig_pow_mod(405740) == 0\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 70", "completion": " ```python\ndef dig_pow_mod(n):\n return sum(int(d) ** 5 for d in str(n)) % 70\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `dig_pow_mod(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 5) على 70.\nمثال: `dig_pow_mod(80195)` يجب أن تُرجع `23`.\nالجواب:", "qhash": "4c0afa52ae501113"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(271) == 8025", "assert total_multiples(115) == 1480", "assert total_multiples(112) == 1368", "assert total_multiples(103) == 1153", "assert total_multiples(66) == 480", "assert total_multiples(204) == 4695", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(271) == 8025\nassert total_multiples(115) == 1480\nassert total_multiples(112) == 1368\nassert total_multiples(103) == 1153\nassert total_multiples(66) == 480\nassert total_multiples(204) == 4695\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 7 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `total_multiples(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 7 أو من مضاعفات 11، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `total_multiples(271)` يُرجع `8025`.\nالجواب:", "qhash": "80d27a894336a4ad"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert top_divisible([2, 56, 31, 18, 13, 37, 8]) == 18", "assert top_divisible([-6, -9, -6]) == -6", "assert top_divisible([1, 4, 7, 10]) == None", "assert top_divisible([0, -32, -3, 7, -24, -18]) == 0", "assert top_divisible([-47, -22, -16, 34]) == None", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([2, 56, 31, 18, 13, 37, 8]) == 18\nassert top_divisible([-6, -9, -6]) == -6\nassert top_divisible([1, 4, 7, 10]) == None\nassert top_divisible([0, -32, -3, 7, -24, -18]) == 0\nassert top_divisible([-47, -22, -16, 34]) == None\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n best = None\n for x in arr:\n if x % 3 == 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 % 3 == 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 % 3 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef top_divisible(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `top_divisible([2, 56, 31, 18, 13, 37, 8])` يُرجع `18`.\nالجواب:", "qhash": "c012ed5e0ea05bab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "result = 10\nfor n in range(-1, 16, 2):\n result += n * 8\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nresult = 10\nfor n in range(-1, 16, 2):\n result += n * 8\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "0ae8518fcbfc2b3c", "answer": "514\n15", "completion": " الناتج:\n```text\n514\n15\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#0", "code": "acc = 0\nfor n in range(-5, 3, 4):\n acc += n * 3\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nacc = 0\nfor n in range(-5, 3, 4):\n acc += n * 3\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "fdeff8ba6c2ff4de", "answer": "-18\n-1", "completion": " الناتج:\n```text\n-18\n-1\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [16, -9, -13, 26, -2, 13, 1]\nprint(sorted(nums, key=lambda x: (abs(x - 10), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [16, -9, -13, 26, -2, 13, 1]\nprint(sorted(nums, key=lambda x: (abs(x - 10), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "f098e9ffa5d5d461", "answer": "[13, 16, 1, -2, 26, -9, -13]\n[26, 16, 13]", "completion": " الناتج:\n```text\n[13, 16, 1, -2, 26, -9, -13]\n[26, 16, 13]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_list", "reference": "def rotate_list(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert rotate_list([17, 25, 26, 34, 6, 25, 44, 48]) == [26, 34, 6, 25, 44, 48, 17, 25]", "assert rotate_list([28, 31, 45, -9, -9]) == [28, 31, 45, -9, -9]", "assert rotate_list([45, 19, 12, -5, 36, 39, 39]) == [-5, 36, 39, 39, 45, 19, 12]", "assert rotate_list([43, -5, -3, 31, 43, 46]) == [43, 46, 43, -5, -3, 31]", "assert rotate_list([31, -6, 0, 12, 43, 12]) == [43, 12, 31, -6, 0, 12]", "assert rotate_list([25, 45, 29, 31, -7, 12, 42, 2, 35, 38, 3, -9]) == [3, -9, 25, 45, 29, 31, -7, 12, 42, 2, 35, 38]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([17, 25, 26, 34, 6, 25, 44, 48]) == [26, 34, 6, 25, 44, 48, 17, 25]\nassert rotate_list([28, 31, 45, -9, -9]) == [28, 31, 45, -9, -9]\nassert rotate_list([45, 19, 12, -5, 36, 39, 39]) == [-5, 36, 39, 39, 45, 19, 12]\nassert rotate_list([43, -5, -3, 31, 43, 46]) == [43, 46, 43, -5, -3, 31]\nassert rotate_list([31, -6, 0, 12, 43, 12]) == [43, 12, 31, -6, 0, 12]\nassert rotate_list([25, 45, 29, 31, -7, 12, 42, 2, 35, 38, 3, -9]) == [3, -9, 25, 45, 29, 31, -7, 12, 42, 2, 35, 38]\nassert rotate_list([]) == []", "answer": "def rotate_list(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate_list(xs):\n if not xs:\n return []\n k = 10 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_list([17, 25, 26, 34, 6, 25, 44, 48])` يُرجع `[26, 34, 6, 25, 44, 48, 17, 25]`.\nالجواب:", "qhash": "6c0f53ecae067be8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * 5 for x in xs if 20 <= x <= 55)", "tests": ["assert filter_range([46, 51, 63, 32, 42, 60, 26]) == [130, 160, 210, 230, 255]", "assert filter_range([27, 15, 33, 56]) == [135, 165]", "assert filter_range([-2, 34, 53, 29, 58, -21, 58]) == [145, 170, 265]", "assert filter_range([-24, 34, 23, -21, -22]) == [115, 170]", "assert filter_range([-18, -25, -22, 4, 39, 46]) == [195, 230]", "assert filter_range([6, 35, 37, -23, 41, 33, -12, 25, 54, -8]) == [125, 165, 175, 185, 205, 270]", "assert filter_range([-8, 3, 1, 20, 21, 12, 51, 6]) == [100, 105, 255]", "assert filter_range([]) == []"], "test_code": "assert filter_range([46, 51, 63, 32, 42, 60, 26]) == [130, 160, 210, 230, 255]\nassert filter_range([27, 15, 33, 56]) == [135, 165]\nassert filter_range([-2, 34, 53, 29, 58, -21, 58]) == [145, 170, 265]\nassert filter_range([-24, 34, 23, -21, -22]) == [115, 170]\nassert filter_range([-18, -25, -22, 4, 39, 46]) == [195, 230]\nassert filter_range([6, 35, 37, -23, 41, 33, -12, 25, 54, -8]) == [125, 165, 175, 185, 205, 270]\nassert filter_range([-8, 3, 1, 20, 21, 12, 51, 6]) == [100, 105, 255]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * 5 for x in xs if 20 <= x <= 55)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * 5 for x in xs if 20 <= x <= 55)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `filter_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين 20 و55 (شاملًا الطرفين) في 5.\nمثال: `filter_range([46, 51, 63, 32, 42, 60, 26])` يجب أن تُرجع `[130, 160, 210, 230, 255]`.\nالجواب:", "qhash": "72fa5d4c7938034c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 88294\ncount = 0\nwhile x > 2:\n x = x // 3\n count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nx = 88294\ncount = 0\nwhile x > 2:\n x = x // 3\n count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "1edd7be5a3d0bbe0", "answer": "1 10", "completion": " الناتج:\n```text\n1 10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'camel'\nprint(name.replace('a', '*'))\nprint(len(name))\nprint(name[1:4])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'camel'\nprint(name.replace('a', '*'))\nprint(len(name))\nprint(name[1:4])\n```\nالجواب:", "qhash": "d6d45c923dd67f1c", "answer": "c*mel\n5\name", "completion": " الناتج:\n```text\nc*mel\n5\name\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "evaluate", "reference": "def evaluate(x):\n return -3 * x ** 2 + (-2) * x + (-5)", "tests": ["assert evaluate(10) == -325", "assert evaluate(-3) == -26", "assert evaluate(3) == -38", "assert evaluate(17) == -906", "assert evaluate(-9) == -230", "assert evaluate(-13) == -486", "assert evaluate(3) == -38", "assert evaluate(0) == -5"], "test_code": "assert evaluate(10) == -325\nassert evaluate(-3) == -26\nassert evaluate(3) == -38\nassert evaluate(17) == -906\nassert evaluate(-9) == -230\nassert evaluate(-13) == -486\nassert evaluate(3) == -38\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n return -3 * x ** 2 + (-2) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n return -3 * x ** 2 + (-2) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `evaluate(x)` تحسب المقدار -3x² - 2x - 5 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `evaluate(10)` يُرجع `-325`.\nالجواب:", "qhash": "2a5e48f1f1d426ab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out", "tests": ["assert play(24) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar']", "assert play(2) == ['1', '2']", "assert play(12) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo']", "assert play(2) == ['1', '2']", "assert play(5) == ['1', '2', '3', '4', '5']"], "test_code": "assert play(24) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar']\nassert play(2) == ['1', '2']\nassert play(12) == ['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo']\nassert play(2) == ['1', '2']\nassert play(5) == ['1', '2', '3', '4', '5']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 6 == 0:\n s += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\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 += 'Foo'\n if i % 8 == 0:\n s += 'Bar'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 6 يُستبدل بـ 'Foo'، وعلى 8 بـ 'Bar'، وعلى كليهما بـ 'FooBar'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(24)` يجب أن تُرجع `['1', '2', '3', '4', '5', 'Foo', '7', 'Bar', '9', '10', '11', 'Foo', '13', '14', '15', 'Bar', '17', 'Foo', '19', '20', '21', '22', '23', 'FooBar']`.\nالجواب:", "qhash": "f7f75766825529fc"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "words = ['apple', 'rocket', 'coffee', 'window', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nwords = ['apple', 'rocket', 'coffee', 'window', 'matrix']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "cf3775b012cdaf2c", "answer": "['apple', 'rocket', 'coffee', 'window', 'matrix']\n['window', 'rocket', 'matrix']", "completion": " الناتج:\n```text\n['apple', 'rocket', 'coffee', 'window', 'matrix']\n['window', 'rocket', 'matrix']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'banana_river'\nprint(name.replace('v', 'X'))\nprint(name[3:9])\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'banana_river'\nprint(name.replace('v', 'X'))\nprint(name[3:9])\nprint(name.capitalize())\n```\nالجواب:", "qhash": "54f7b1b770558d0b", "answer": "banana_riXer\nana_ri\nBanana_river", "completion": " الناتج:\n```text\nbanana_riXer\nana_ri\nBanana_river\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "invert_words", "reference": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert invert_words('brain python brain in') == 'python'", "assert invert_words('') == ''", "assert invert_words('rocket up in winter a') == 'winter/rocket'", "assert invert_words('banana') == 'banana'", "assert invert_words('on of a window') == 'window'", "assert invert_words('') == ''", "assert invert_words('') == ''"], "test_code": "assert invert_words('brain python brain in') == 'python'\nassert invert_words('') == ''\nassert invert_words('rocket up in winter a') == 'winter/rocket'\nassert invert_words('banana') == 'banana'\nassert invert_words('on of a window') == 'window'\nassert invert_words('') == ''\nassert invert_words('') == ''", "answer": "def invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef invert_words(s):\n return '/'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `invert_words(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `invert_words('brain python brain in')` يُرجع `'python'`.\nالجواب:", "qhash": "1e8d663b0deb0758"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 997", "tests": ["assert fact_mod(11) == 880", "assert fact_mod(45) == 699", "assert fact_mod(59) == 646", "assert fact_mod(11) == 880", "assert fact_mod(58) == 856", "assert fact_mod(15) == 247", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 880\nassert fact_mod(45) == 699\nassert fact_mod(59) == 646\nassert fact_mod(11) == 880\nassert fact_mod(58) == 856\nassert fact_mod(15) == 247\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 997", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(11)` يجب أن تُرجع `880`.\nالجواب:", "qhash": "d9c585dc07cf4dc9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('banana to by cloud orange data') == 'orange/banana'", "assert flip_words('') == ''", "assert flip_words('garden cloud python go by planet it go') == 'planet/python/garden'", "assert flip_words('light python vector') == 'vector/python'", "assert flip_words('in table falcon') == 'falcon'", "assert flip_words('summer falcon') == 'falcon/summer'", "assert flip_words('orange data') == 'orange'"], "test_code": "assert flip_words('banana to by cloud orange data') == 'orange/banana'\nassert flip_words('') == ''\nassert flip_words('garden cloud python go by planet it go') == 'planet/python/garden'\nassert flip_words('light python vector') == 'vector/python'\nassert flip_words('in table falcon') == 'falcon'\nassert flip_words('summer falcon') == 'falcon/summer'\nassert flip_words('orange data') == 'orange'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `flip_words('banana to by cloud orange data')` يُرجع `'orange/banana'`.\nالجواب:", "qhash": "1d62b83a252e8407"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([33, 28, 54, 50, 4]) == None", "assert largest_div([-12, -12, -36]) == -12", "assert largest_div([1, 13, 25, 37]) == None", "assert largest_div([]) == None", "assert largest_div([21, -27, -7, 17, 3, -13, 26]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([33, 28, 54, 50, 4]) == None\nassert largest_div([-12, -12, -36]) == -12\nassert largest_div([1, 13, 25, 37]) == None\nassert largest_div([]) == None\nassert largest_div([21, -27, -7, 17, 3, -13, 26]) == None\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 12 == 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 % 12 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(arr):\n best = None\n for x in arr:\n if x % 12 == 0 and (best is None or x < best):\n best = x\n return best\n```\nمثال: `largest_div([33, 28, 54, 50, 4])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "f983a0bd5b91b8c8"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate", "reference": "def rotate(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate([27, 13, 0, 21, 17, 43, 41, 44]) == [17, 43, 41, 44, 27, 13, 0, 21]", "assert rotate([31, 10, 2, 30, 44, 40, 11, 12, 33, -6, 3]) == [3, 31, 10, 2, 30, 44, 40, 11, 12, 33, -6]", "assert rotate([9, 23, 45]) == [9, 23, 45]", "assert rotate([12, 16, 13, 22, 8, 39, 30, 27, 13, -6]) == [13, -6, 12, 16, 13, 22, 8, 39, 30, 27]", "assert rotate([29, 16, 28, -4, 10, 21]) == [29, 16, 28, -4, 10, 21]", "assert rotate([12, 48, 46, 14, 37, 0, 12, 45, 39, 8, 9, 10]) == [12, 48, 46, 14, 37, 0, 12, 45, 39, 8, 9, 10]", "assert rotate([]) == []"], "test_code": "assert rotate([27, 13, 0, 21, 17, 43, 41, 44]) == [17, 43, 41, 44, 27, 13, 0, 21]\nassert rotate([31, 10, 2, 30, 44, 40, 11, 12, 33, -6, 3]) == [3, 31, 10, 2, 30, 44, 40, 11, 12, 33, -6]\nassert rotate([9, 23, 45]) == [9, 23, 45]\nassert rotate([12, 16, 13, 22, 8, 39, 30, 27, 13, -6]) == [13, -6, 12, 16, 13, 22, 8, 39, 30, 27]\nassert rotate([29, 16, 28, -4, 10, 21]) == [29, 16, 28, -4, 10, 21]\nassert rotate([12, 48, 46, 14, 37, 0, 12, 45, 39, 8, 9, 10]) == [12, 48, 46, 14, 37, 0, 12, 45, 39, 8, 9, 10]\nassert rotate([]) == []", "answer": "def rotate(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef rotate(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef rotate(lst):\n if not lst:\n return []\n k = 12 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate([27, 13, 0, 21, 17, 43, 41, 44])` يُرجع `[17, 43, 41, 44, 27, 13, 0, 21]`.\nالجواب:", "qhash": "ef4756d8235c2c55"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert max_of_div([11, 36, 32, 15, -21, -11, 47, -27]) == 36", "assert max_of_div([-6, -6, -30]) == -6", "assert max_of_div([1]) == None", "assert max_of_div([-3, 15, 10]) == None", "assert max_of_div([21, -9, 41, -31, -18]) == -18", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([11, 36, 32, 15, -21, -11, 47, -27]) == 36\nassert max_of_div([-6, -6, -30]) == -6\nassert max_of_div([1]) == None\nassert max_of_div([-3, 15, 10]) == None\nassert max_of_div([21, -9, 41, -31, -18]) == -18\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 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 % 6 == 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 % 6 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef max_of_div(values):\n best = None\n for x in values:\n if x % 6 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `max_of_div([11, 36, 32, 15, -21, -11, 47, -27])` يُرجع `36`.\nالجواب:", "qhash": "073bfedc01a5d523"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "tests": ["assert sum_terms(4) == 900", "assert sum_terms(14) == 99225", "assert sum_terms(13) == 74529", "assert sum_terms(15) == 129600", "assert sum_terms(14) == 99225", "assert sum_terms(1) == 9", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 900\nassert sum_terms(14) == 99225\nassert sum_terms(13) == 74529\nassert sum_terms(15) == 129600\nassert sum_terms(14) == 99225\nassert sum_terms(1) == 9\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 9 * i ** 3\n return total\n```\n", "buggy": "def sum_terms(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 sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 9 * i ** 3\n return total\n```\nللتوضيح: الاستدعاء `sum_terms(4)` يُرجع `900`.\nالجواب:", "qhash": "bf0f1122bd42ce14"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 11\nfor x in range(9, 14, 4):\n total += x * 8\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 11\nfor x in range(9, 14, 4):\n total += x * 8\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "3ddef384b5f7da7f", "answer": "187\n13", "completion": " الناتج:\n```text\n187\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_div", "reference": "def count_div(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 6 != 0:\n count += 1\n return count", "tests": ["assert count_div([87, 29, 27, 77, 58, 50, 57, 51, 15]) == 1", "assert count_div([49, 3, 73, -32, 19, -40, 46, -27, -36, 21, 51, -22]) == 1", "assert count_div([67, 2, 19, 90, 48, -40, 69, 41, 2, -32]) == 0", "assert count_div([-34, 62, -23, 38, -12, 6, 0, 8]) == 0", "assert count_div([-9, 30, 54, 52, -1, 63]) == 2", "assert count_div([55, 54, 25]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([87, 29, 27, 77, 58, 50, 57, 51, 15]) == 1\nassert count_div([49, 3, 73, -32, 19, -40, 46, -27, -36, 21, 51, -22]) == 1\nassert count_div([67, 2, 19, 90, 48, -40, 69, 41, 2, -32]) == 0\nassert count_div([-34, 62, -23, 38, -12, 6, 0, 8]) == 0\nassert count_div([-9, 30, 54, 52, -1, 63]) == 2\nassert count_div([55, 54, 25]) == 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 % 6 != 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 % 6 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 6، واكتب الدالة بعد إكمالها.\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([87, 29, 27, 77, 58, 50, 57, 51, 15])` يُرجع `1`.\nالجواب:", "qhash": "6bb861278f7d9611"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "top_divisible", "reference": "def top_divisible(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 top_divisible([13, 0, 24, -4]) == 24", "assert top_divisible([-8, -2, -6]) == -2", "assert top_divisible([1]) == None", "assert top_divisible([20, 22, 22, 2, -24]) == 22", "assert top_divisible([-33, -50, 44, 43, -12, 19, 1, -20, 32]) == 44", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([13, 0, 24, -4]) == 24\nassert top_divisible([-8, -2, -6]) == -2\nassert top_divisible([1]) == None\nassert top_divisible([20, 22, 22, 2, -24]) == 22\nassert top_divisible([-33, -50, 44, 43, -12, 19, 1, -20, 32]) == 44\nassert top_divisible([]) == None", "answer": "def top_divisible(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 top_divisible(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 top_divisible(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 top_divisible(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للتوضيح: الاستدعاء `top_divisible([13, 0, 24, -4])` يُرجع `24`.\nالجواب:", "qhash": "383fbb05e7371153"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [26, 25, 21, 7, 21, -18]\nprint(sorted(nums, key=lambda x: (abs(x - 13), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [26, 25, 21, 7, 21, -18]\nprint(sorted(nums, key=lambda x: (abs(x - 13), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "63a0cb4219f35e38", "answer": "[7, 21, 21, 25, 26, -18]\n[26, 25, 21]", "completion": " الناتج:\n```text\n[7, 21, 21, 25, 26, -18]\n[26, 25, 21]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "evaluate", "reference": "def evaluate(x):\n return 1 * x ** 2 + (1) * x + (4)", "tests": ["assert evaluate(1) == 6", "assert evaluate(11) == 136", "assert evaluate(8) == 76", "assert evaluate(-11) == 114", "assert evaluate(-15) == 214", "assert evaluate(-14) == 186", "assert evaluate(-20) == 384", "assert evaluate(0) == 4"], "test_code": "assert evaluate(1) == 6\nassert evaluate(11) == 136\nassert evaluate(8) == 76\nassert evaluate(-11) == 114\nassert evaluate(-15) == 214\nassert evaluate(-14) == 186\nassert evaluate(-20) == 384\nassert evaluate(0) == 4", "answer": "def evaluate(x):\n return 1 * x ** 2 + (1) * x + (4)", "completion": " ```python\ndef evaluate(x):\n return 1 * x ** 2 + (1) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `evaluate(x)` تُرجع قيمة كثيرة الحدود 1x² + 1x + 4 عند العدد الصحيح x.\nمثال: `evaluate(1)` يجب أن تُرجع `6`.\nالجواب:", "qhash": "f40dd532c058e95c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "largest_div", "reference": "def largest_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([3, -17, 15, 2, -5, -15, 50, 43]) == None", "assert largest_div([-44, -55, -33]) == -33", "assert largest_div([1, 12, 23, 34]) == None", "assert largest_div([38, 4]) == None", "assert largest_div([-18, 36, 50, 7, -23, -13, -27, -24]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([3, -17, 15, 2, -5, -15, 50, 43]) == None\nassert largest_div([-44, -55, -33]) == -33\nassert largest_div([1, 12, 23, 34]) == None\nassert largest_div([38, 4]) == None\nassert largest_div([-18, 36, 50, 7, -23, -13, -27, -24]) == None\nassert largest_div([]) == None", "answer": "def largest_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "completion": " ```python\ndef largest_div(values):\n best = None\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع أكبر عنصر في القائمة values يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef largest_div(values):\n best = 0\n for x in values:\n if x % 11 == 0 and (best is None or x > best):\n best = x\n return best\n```\nمثال: `largest_div([3, -17, 15, 2, -5, -15, 50, 43])` يجب أن تُرجع `None`.\nالجواب:", "qhash": "b15d9cddca3a8462"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 2:\n return n + 2\n return calc(n - 1) + calc(n - 2)\n\nprint(calc(2))\n```\nالجواب:", "qhash": "0e5ad62ae1f1110b", "answer": "5", "completion": " الناتج:\n```text\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def h(x, y=6):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(10))\nprint(h(10, -6))\nprint(h(h(-6), 10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef h(x, y=6):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(h(10))\nprint(h(10, -6))\nprint(h(h(-6), 10))\n```\nالجواب:", "qhash": "1ebe9252b6fcaf49", "answer": "64\n76\n242", "completion": " الناتج:\n```text\n64\n76\n242\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert rotate_letters('is rocket') == 'fp olzhbq'", "assert rotate_letters('banana code A1') == 'yxkxkx zlab A1'", "assert rotate_letters('to falcon !') == 'ql cxizlk !'", "assert rotate_letters('to in garden music') == 'ql fk dxoabk jrpfz'", "assert rotate_letters('apple window rocket engine OK') == 'xmmib tfkalt olzhbq bkdfkb OK'", "assert rotate_letters('by summer summer banana A1') == 'yv prjjbo prjjbo yxkxkx A1'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('is rocket') == 'fp olzhbq'\nassert rotate_letters('banana code A1') == 'yxkxkx zlab A1'\nassert rotate_letters('to falcon !') == 'ql cxizlk !'\nassert rotate_letters('to in garden music') == 'ql fk dxoabk jrpfz'\nassert rotate_letters('apple window rocket engine OK') == 'xmmib tfkalt olzhbq bkdfkb OK'\nassert rotate_letters('by summer summer banana A1') == 'yv prjjbo prjjbo yxkxkx A1'\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 + (23)) % 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 + (23)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rotate_letters(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 23 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('is rocket')` يجب أن تُرجع `'fp olzhbq'`.\nالجواب:", "qhash": "bb86622eaf449eed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#0", "entry": "digit_score", "reference": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 89", "tests": ["assert digit_score(71265) == 26", "assert digit_score(961306) == 74", "assert digit_score(344413) == 67", "assert digit_score(972706) == 41", "assert digit_score(866520) == 76", "assert digit_score(508294) == 12", "assert digit_score(177566) == 18", "assert digit_score(0) == 0"], "test_code": "assert digit_score(71265) == 26\nassert digit_score(961306) == 74\nassert digit_score(344413) == 67\nassert digit_score(972706) == 41\nassert digit_score(866520) == 76\nassert digit_score(508294) == 12\nassert digit_score(177566) == 18\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 89", "completion": " ```python\ndef digit_score(n):\n return sum(int(d) ** 2 for d in str(n)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `digit_score(n)` تأخذ عددًا صحيحًا غير سالب n وتُرجع باقي قسمة (مجموع أرقام n كلٌّ مرفوع للأس 2) على 89.\nمثال: `digit_score(71265)` يجب أن تُرجع `26`.\nالجواب:", "qhash": "3892bc951e601926"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_text('up') == 'sn'", "assert shift_text('planet falcon at Hello') == 'njylcr dyjaml yr Hcjjm'", "assert shift_text('go matrix OK') == 'em kyrpgv OK'", "assert shift_text('stone in pixel 2024') == 'qrmlc gl ngvcj 2024'", "assert shift_text('winter we up apple falcon 2024') == 'uglrcp uc sn ynnjc dyjaml 2024'", "assert shift_text('light a it cloud') == 'jgefr y gr ajmsb'", "assert shift_text('') == ''"], "test_code": "assert shift_text('up') == 'sn'\nassert shift_text('planet falcon at Hello') == 'njylcr dyjaml yr Hcjjm'\nassert shift_text('go matrix OK') == 'em kyrpgv OK'\nassert shift_text('stone in pixel 2024') == 'qrmlc gl ngvcj 2024'\nassert shift_text('winter we up apple falcon 2024') == 'uglrcp uc sn ynnjc dyjaml 2024'\nassert shift_text('light a it cloud') == 'jgefr y gr ajmsb'\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 + (24)) % 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 + (24)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_text(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_text('up')` يُرجع `'sn'`.\nالجواب:", "qhash": "a4c28c45d530e913"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "entry": "game", "reference": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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(21) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20', 'Red']", "assert game(20) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20']", "assert game(7) == ['1', '2', '3', '4', '5', '6', 'Red']", "assert game(12) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12']", "assert game(24) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20', 'Red', '22', '23', 'Blue']"], "test_code": "assert game(21) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20', 'Red']\nassert game(20) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20']\nassert game(7) == ['1', '2', '3', '4', '5', '6', 'Red']\nassert game(12) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12']\nassert game(24) == ['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20', 'Red', '22', '23', 'Blue']", "answer": "def game(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 % 7 == 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)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Red'، وعلى 8 بـ 'Blue'، وعلى كليهما بـ 'RedBlue'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `game(21)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Red', 'Blue', '9', '10', '11', '12', '13', 'Red', '15', 'Blue', '17', '18', '19', '20', 'Red']`.\nالجواب:", "qhash": "d2856cbefbe6f8b5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "only_div", "reference": "def only_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 only_div([76, 71, 68, 90, 32, 69, 47, 12, 45, 19]) == 3", "assert only_div([-36, 50]) == 0", "assert only_div([64, 13, -36, 5]) == 1", "assert only_div([-5, -7, 3, -31, 26, 12, -22, 36, 7, 46, 18]) == 0", "assert only_div([66, 38]) == 0", "assert only_div([-3, 10, -8, 52, -32]) == 3", "assert only_div([]) == 0"], "test_code": "assert only_div([76, 71, 68, 90, 32, 69, 47, 12, 45, 19]) == 3\nassert only_div([-36, 50]) == 0\nassert only_div([64, 13, -36, 5]) == 1\nassert only_div([-5, -7, 3, -31, 26, 12, -22, 36, 7, 46, 18]) == 0\nassert only_div([66, 38]) == 0\nassert only_div([-3, 10, -8, 52, -32]) == 3\nassert only_div([]) == 0", "answer": "def only_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 only_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 only_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `only_div([76, 71, 68, 90, 32, 69, 47, 12, 45, 19])` يُرجع `3`.\nالجواب:", "qhash": "ff35160407939d90"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "max_of_div", "reference": "def max_of_div(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_of_div([-25, 55, -1, -10, -8, 27]) == 27", "assert max_of_div([-9, -9, -6]) == -6", "assert max_of_div([1, 4, 7, 10]) == None", "assert max_of_div([-35, -10, -26, 25, 34, -32]) == None", "assert max_of_div([21, -7, 50, 40, -19, -32]) == 21", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-25, 55, -1, -10, -8, 27]) == 27\nassert max_of_div([-9, -9, -6]) == -6\nassert max_of_div([1, 4, 7, 10]) == None\nassert max_of_div([-35, -10, -26, 25, 34, -32]) == None\nassert max_of_div([21, -7, 50, 40, -19, -32]) == 21\nassert max_of_div([]) == None", "answer": "def max_of_div(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_of_div(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_of_div(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_of_div(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_of_div([-25, 55, -1, -10, -8, 27])` يجب أن تُرجع `27`.\nالجواب:", "qhash": "79d7893172fdc54b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "word = 'camel'\nprint(word[-3:])\nprint(word.index('m') + len(word))\nprint(word.replace('m', '0'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nword = 'camel'\nprint(word[-3:])\nprint(word.index('m') + len(word))\nprint(word.replace('m', '0'))\n```\nالجواب:", "qhash": "606d00cd3b20223f", "answer": "mel\n7\nca0el", "completion": " الناتج:\n```text\nmel\n7\nca0el\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "value_at", "reference": "def value_at(x):\n return 8 * x ** 2 + (-2) * x + (-4)", "tests": ["assert value_at(3) == 62", "assert value_at(-10) == 816", "assert value_at(-19) == 2922", "assert value_at(-6) == 296", "assert value_at(-6) == 296", "assert value_at(15) == 1766", "assert value_at(8) == 492", "assert value_at(0) == -4"], "test_code": "assert value_at(3) == 62\nassert value_at(-10) == 816\nassert value_at(-19) == 2922\nassert value_at(-6) == 296\nassert value_at(-6) == 296\nassert value_at(15) == 1766\nassert value_at(8) == 492\nassert value_at(0) == -4", "answer": "def value_at(x):\n return 8 * x ** 2 + (-2) * x + (-4)", "completion": " ```python\ndef value_at(x):\n return 8 * x ** 2 + (-2) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `value_at(x)` تحسب المقدار 8x² - 2x - 4 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `value_at(3)` يُرجع `62`.\nالجواب:", "qhash": "0b96cb32fbb12f59"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "eval_poly", "reference": "def eval_poly(x):\n return 9 * x ** 2 + (8) * x + (5)", "tests": ["assert eval_poly(10) == 985", "assert eval_poly(11) == 1182", "assert eval_poly(13) == 1630", "assert eval_poly(19) == 3406", "assert eval_poly(9) == 806", "assert eval_poly(10) == 985", "assert eval_poly(-10) == 825", "assert eval_poly(0) == 5"], "test_code": "assert eval_poly(10) == 985\nassert eval_poly(11) == 1182\nassert eval_poly(13) == 1630\nassert eval_poly(19) == 3406\nassert eval_poly(9) == 806\nassert eval_poly(10) == 985\nassert eval_poly(-10) == 825\nassert eval_poly(0) == 5", "answer": "def eval_poly(x):\n return 9 * x ** 2 + (8) * x + (5)", "completion": " ```python\ndef eval_poly(x):\n return 9 * x ** 2 + (8) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `eval_poly(x)` تُرجع قيمة كثيرة الحدود 9x² + 8x + 5 عند العدد الصحيح x.\nمثال: `eval_poly(10)` يجب أن تُرجع `985`.\nالجواب:", "qhash": "a556f7c1ff6e8cfd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "entry": "words_starting", "reference": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ق'):\n count += 1\n return count", "tests": ["assert words_starting('وردة فجر قمر مكتبة') == 1", "assert words_starting('قلم حاسوب باب علم معلم') == 1", "assert words_starting('قلم سوق صحراء قلم ميناء') == 2", "assert words_starting('ليل سلام طائرة حديقة') == 0", "assert words_starting('حديقة قلم فجر ماء قمر شمس علم') == 2", "assert words_starting('قلم معلم سوق قمر معلم حاسوب فجر سلام') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('وردة فجر قمر مكتبة') == 1\nassert words_starting('قلم حاسوب باب علم معلم') == 1\nassert words_starting('قلم سوق صحراء قلم ميناء') == 2\nassert words_starting('ليل سلام طائرة حديقة') == 0\nassert words_starting('حديقة قلم فجر ماء قمر شمس علم') == 2\nassert words_starting('قلم معلم سوق قمر معلم حاسوب فجر سلام') == 2\nassert words_starting('') == 0", "answer": "def words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ق'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(sentence):\n count = 0\n for w in sentence.split():\n if w.startswith('ق'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(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 words_starting(sentence):\n count = 0\n for w in sentence:\n if w.startswith('ق'):\n count += 1\n return count\n```\nمثال: `words_starting('وردة فجر قمر مكتبة')` يجب أن تُرجع `1`.\nالجواب:", "qhash": "e2c3fb79c1f3ac24"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 6 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(17) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17']", "assert fizzbuzz(22) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22']", "assert fizzbuzz(6) == ['1', '2', '3', '4', 'Sun', 'Moon']", "assert fizzbuzz(12) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon']", "assert fizzbuzz(3) == ['1', '2', '3']"], "test_code": "assert fizzbuzz(17) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17']\nassert fizzbuzz(22) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22']\nassert fizzbuzz(6) == ['1', '2', '3', '4', 'Sun', 'Moon']\nassert fizzbuzz(12) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon']\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 += '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 % 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سؤال: أنشئ دالة بايثون `fizzbuzz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 5 أضف 'Sun'، وإن قَبِلها على 6 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizzbuzz(17)` يُرجع `['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17']`.\nالجواب:", "qhash": "9cc8a3841e3db1ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "backwards", "reference": "def backwards(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert backwards('rocket garden desert') == 'desert,garden,rocket'", "assert backwards('') == ''", "assert backwards('by engine river') == 'river,engine'", "assert backwards('music in stone in matrix matrix desert code') == 'desert,matrix,matrix,stone,music'", "assert backwards('') == ''", "assert backwards('is music on vector at summer') == 'summer,vector,music'", "assert backwards('planet of of camel coffee river in to') == 'river,coffee,camel,planet'"], "test_code": "assert backwards('rocket garden desert') == 'desert,garden,rocket'\nassert backwards('') == ''\nassert backwards('by engine river') == 'river,engine'\nassert backwards('music in stone in matrix matrix desert code') == 'desert,matrix,matrix,stone,music'\nassert backwards('') == ''\nassert backwards('is music on vector at summer') == 'summer,vector,music'\nassert backwards('planet of of camel coffee river in to') == 'river,coffee,camel,planet'", "answer": "def backwards(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef backwards(s):\n return ','.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `backwards(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ','.\nللتوضيح: الاستدعاء `backwards('rocket garden desert')` يُرجع `'desert,garden,rocket'`.\nالجواب:", "qhash": "0fccd4857e9b7a86"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "s = 3\nfor i in range(-1, 4, 2):\n s -= i * 3\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 3\nfor i in range(-1, 4, 2):\n s -= i * 3\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "9232015634867a6f", "answer": "-6\n3", "completion": " الناتج:\n```text\n-6\n3\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#0", "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('برمجة برمجة سلام عمل') == 1", "assert how_many('برتقال فجر قلم عمل عمل صديق شمس') == 0", "assert how_many('نهار كتاب برتقال تفاحة صديق طالب سفينة عمل') == 1", "assert how_many('عربية ليل وردة حديقة حاسوب لغة') == 0", "assert how_many('سماء قمر شجرة صحراء ماء شجرة فجر') == 1", "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('نهار كتاب برتقال تفاحة صديق طالب سفينة عمل') == 1\nassert how_many('عربية ليل وردة حديقة حاسوب لغة') == 0\nassert how_many('سماء قمر شجرة صحراء ماء شجرة فجر') == 1\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": "02f48d6ed0b1fbaa"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "entry": "rev_join", "reference": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_join('light stone by light orange river it brain') == 'brain_it_river_orange_light_by_stone_light'", "assert rev_join('apple signal') == 'signal_apple'", "assert rev_join('apple winter engine') == 'engine_winter_apple'", "assert rev_join('cloud on it falcon') == 'falcon_it_on_cloud'", "assert rev_join('banana winter') == 'winter_banana'", "assert rev_join('desert') == 'desert'", "assert rev_join('it code up to table') == 'table_to_up_code_it'"], "test_code": "assert rev_join('light stone by light orange river it brain') == 'brain_it_river_orange_light_by_stone_light'\nassert rev_join('apple signal') == 'signal_apple'\nassert rev_join('apple winter engine') == 'engine_winter_apple'\nassert rev_join('cloud on it falcon') == 'falcon_it_on_cloud'\nassert rev_join('banana winter') == 'winter_banana'\nassert rev_join('desert') == 'desert'\nassert rev_join('it code up to table') == 'table_to_up_code_it'", "answer": "def rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_join(s):\n return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `rev_join(s)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 1، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '_'.\nللتوضيح: الاستدعاء `rev_join('light stone by light orange river it brain')` يُرجع `'brain_it_river_orange_light_by_stone_light'`.\nالجواب:", "qhash": "771a476c68ac4e7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#1", "code": "def f(n):\n if n < 2:\n return n + 3\n return f(n - 1) + f(n - 2)\n\nprint(f(12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef f(n):\n if n < 2:\n return n + 3\n return f(n - 1) + f(n - 2)\n\nprint(f(12))\n```\nالجواب:", "qhash": "587cc6bd70f6ff6b", "answer": "843", "completion": " الناتج:\n```text\n843\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "lead_count", "reference": "def lead_count(s):\n count = 0\n for w in s.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('معلم نور نهر سفينة') == 0", "assert lead_count('قلم شجرة سلام حاسوب تفاحة رمل رمل') == 2", "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('معلم نور نهر سفينة') == 0\nassert lead_count('قلم شجرة سلام حاسوب تفاحة رمل رمل') == 2\nassert lead_count('') == 0", "answer": "def lead_count(s):\n count = 0\n for w in s.split():\n if w.startswith('ر'):\n count += 1\n return count", "completion": " ```python\ndef lead_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 lead_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 lead_count(s):\n count = 0\n for w in s:\n if w.startswith('ر'):\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `lead_count('مدرسة صحراء رمل رمل حاسوب نهار')` يُرجع `2`.\nالجواب:", "qhash": "e8181705a456b993"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_powers", "reference": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total", "tests": ["assert sum_powers(4) == 150", "assert sum_powers(11) == 2530", "assert sum_powers(6) == 455", "assert sum_powers(4) == 150", "assert sum_powers(11) == 2530", "assert sum_powers(1) == 5", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(4) == 150\nassert sum_powers(11) == 2530\nassert sum_powers(6) == 455\nassert sum_powers(4) == 150\nassert sum_powers(11) == 2530\nassert sum_powers(1) == 5\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total", "completion": " ```python\ndef sum_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 5 * i ** 2\n return total\n```\n", "buggy": "def sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 2\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 5 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_powers(n):\n total = 0\n for i in range(0, n):\n total += 5 * i ** 2\n return total\n```\nمثال: `sum_powers(4)` يجب أن تُرجع `150`.\nالجواب:", "qhash": "78afa8d20d2aabb7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 101", "tests": ["assert fact_mod(12) == 81", "assert fact_mod(43) == 26", "assert fact_mod(58) == 90", "assert fact_mod(34) == 99", "assert fact_mod(33) == 74", "assert fact_mod(0) == 1", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(12) == 81\nassert fact_mod(43) == 26\nassert fact_mod(58) == 90\nassert fact_mod(34) == 99\nassert fact_mod(33) == 74\nassert fact_mod(0) == 1\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 101", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 4)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `fact_mod(12)` يُرجع `81`.\nالجواب:", "qhash": "11f654e6d632eabf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 54) == 1)", "tests": ["assert rel_prime_count(141) == 47", "assert rel_prime_count(115) == 39", "assert rel_prime_count(23) == 8", "assert rel_prime_count(31) == 11", "assert rel_prime_count(135) == 45", "assert rel_prime_count(150) == 50", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(141) == 47\nassert rel_prime_count(115) == 39\nassert rel_prime_count(23) == 8\nassert rel_prime_count(31) == 11\nassert rel_prime_count(135) == 45\nassert rel_prime_count(150) == 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, 54) == 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, 54) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rel_prime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 54، أي أن القاسم المشترك الأكبر لها مع 54 يساوي 1.\nمثال: `rel_prime_count(141)` يجب أن تُرجع `47`.\nالجواب:", "qhash": "c177c2b5fb675914"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "pow_total", "reference": "def pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "tests": ["assert pow_total(4) == 5200", "assert pow_total(10) == 883300", "assert pow_total(12) == 2522832", "assert pow_total(15) == 9196800", "assert pow_total(10) == 883300", "assert pow_total(1) == 4", "assert pow_total(0) == 0"], "test_code": "assert pow_total(4) == 5200\nassert pow_total(10) == 883300\nassert pow_total(12) == 2522832\nassert pow_total(15) == 9196800\nassert pow_total(10) == 883300\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 ** 5\n return total", "completion": " ```python\ndef pow_total(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total\n```\n", "buggy": "def pow_total(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef pow_total(n):\n total = 0\n for i in range(1, n):\n total += 4 * i ** 5\n return total\n```\nمثال: `pow_total(4)` يجب أن تُرجع `5200`.\nالجواب:", "qhash": "815cc9b8d53dab1c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "word = 'coffee'\nprint(word[::-1])\nprint(word.upper())\nprint(word.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nword = 'coffee'\nprint(word[::-1])\nprint(word.upper())\nprint(word.split('_'))\n```\nالجواب:", "qhash": "ef04b191a75f91eb", "answer": "eeffoc\nCOFFEE\n['coffee']", "completion": " الناتج:\n```text\neeffoc\nCOFFEE\n['coffee']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#0", "entry": "acc_reset", "reference": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 148:\n s = 0\n out.append(s)\n return out", "tests": ["assert acc_reset([45, 18, 6, 38, 11]) == [45, 63, 69, 107, 118]", "assert acc_reset([47, 10, 127]) == [47, 57, 0]", "assert acc_reset([33, 23]) == [33, 56]", "assert acc_reset([20, 96, 60, 78, 104, 91, 145, 11, 0, 140]) == [20, 116, 0, 78, 0, 91, 0, 11, 11, 0]", "assert acc_reset([24, 39]) == [24, 63]", "assert acc_reset([73, 124, 135]) == [73, 0, 135]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([45, 18, 6, 38, 11]) == [45, 63, 69, 107, 118]\nassert acc_reset([47, 10, 127]) == [47, 57, 0]\nassert acc_reset([33, 23]) == [33, 56]\nassert acc_reset([20, 96, 60, 78, 104, 91, 145, 11, 0, 140]) == [20, 116, 0, 78, 0, 91, 0, 11, 11, 0]\nassert acc_reset([24, 39]) == [24, 63]\nassert acc_reset([73, 124, 135]) == [73, 0, 135]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n out, s = [], 0\n for x in xs:\n s += x\n if s > 148:\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 > 148:\n s = 0\n out.append(s)\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `acc_reset(xs)` تُرجع قائمة المجاميع التراكمية لعناصر xs، مع قاعدة: إذا أصبح المجموع الجاري أكبر من 148 بعد إضافة عنصر فإنه يُصفَّر قبل تسجيله.\nمثال: `acc_reset([45, 18, 6, 38, 11])` يجب أن تُرجع `[45, 63, 69, 107, 118]`.\nالجواب:", "qhash": "f3a40ad86d208f42"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "vals = [x ** 2 - 0 for x in range(0, 8) if x % 5 == 4]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nvals = [x ** 2 - 0 for x in range(0, 8) if x % 5 == 4]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "40c1c8b62670618f", "answer": "[16]\n1 16", "completion": " الناتج:\n```text\n[16]\n1 16\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "s = 'light_python'\nprint(s.index('t') + len(s))\nprint(s[-2:])\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ns = 'light_python'\nprint(s.index('t') + len(s))\nprint(s[-2:])\nprint(s.capitalize())\n```\nالجواب:", "qhash": "bd269c0a8ddfe469", "answer": "16\non\nLight_python", "completion": " الناتج:\n```text\n16\non\nLight_python\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "entry": "words_starting", "reference": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ق'):\n count += 1\n return count", "tests": ["assert words_starting('شجرة قلم بيت طالب سيارة كتاب فجر') == 1", "assert words_starting('مطر برتقال حصان قلم وردة سوق صحراء قلم') == 2", "assert words_starting('قهوة مكتبة قلم باب علم') == 2", "assert words_starting('جبل عمل برمجة') == 0", "assert words_starting('مدرسة قهوة قهوة نور طائرة باب عمل عمل') == 2", "assert words_starting('شمس نور دفتر خبز سلام') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('شجرة قلم بيت طالب سيارة كتاب فجر') == 1\nassert words_starting('مطر برتقال حصان قلم وردة سوق صحراء قلم') == 2\nassert words_starting('قهوة مكتبة قلم باب علم') == 2\nassert words_starting('جبل عمل برمجة') == 0\nassert words_starting('مدرسة قهوة قهوة نور طائرة باب عمل عمل') == 2\nassert words_starting('شمس نور دفتر خبز سلام') == 0\nassert words_starting('') == 0", "answer": "def words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ق'):\n count += 1\n return count", "completion": " ```python\ndef words_starting(s):\n count = 0\n for w in s.split():\n if w.startswith('ق'):\n count += 1\n return count\n```\n", "buggy": "def words_starting(s):\n count = 0\n for w in s.split():\n if 'ق' in w:\n count += 1\n return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ق». اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef words_starting(s):\n count = 0\n for w in s.split():\n if 'ق' in w:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `words_starting('شجرة قلم بيت طالب سيارة كتاب فجر')` يُرجع `1`.\nالجواب:", "qhash": "a450423c1806578c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -1 * x ** 2 + (2) * x + (4)", "tests": ["assert value_at(1) == 5", "assert value_at(-5) == -31", "assert value_at(-16) == -284", "assert value_at(-14) == -220", "assert value_at(-6) == -44", "assert value_at(7) == -31", "assert value_at(-18) == -356", "assert value_at(0) == 4"], "test_code": "assert value_at(1) == 5\nassert value_at(-5) == -31\nassert value_at(-16) == -284\nassert value_at(-14) == -220\nassert value_at(-6) == -44\nassert value_at(7) == -31\nassert value_at(-18) == -356\nassert value_at(0) == 4", "answer": "def value_at(x):\n return -1 * x ** 2 + (2) * x + (4)", "completion": " ```python\ndef value_at(x):\n return -1 * x ** 2 + (2) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -1x² + 2x + 4 عند العدد الصحيح x.\nمثال: `value_at(1)` يجب أن تُرجع `5`.\nالجواب:", "qhash": "2c37c60a81f6eee7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#1", "code": "res = [x ** 2 - 8 for x in range(6, 17) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nres = [x ** 2 - 8 for x in range(6, 17) if x % 5 == 4]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "68336d6071c7e4a8", "answer": "[73, 188]\n2 261", "completion": " الناتج:\n```text\n[73, 188]\n2 261\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'hnr'}", "tests": ["assert count_chars('garden falcon stone it cloud to') == {'h': 0, 'n': 3, 'r': 1}", "assert count_chars('cloud matrix') == {'h': 0, 'n': 0, 'r': 1}", "assert count_chars('engine planet stone') == {'h': 0, 'n': 4, 'r': 0}", "assert count_chars('banana up winter banana') == {'h': 0, 'n': 5, 'r': 1}", "assert count_chars('planet by vector pixel') == {'h': 0, 'n': 1, 'r': 1}", "assert count_chars('up') == {'h': 0, 'n': 0, 'r': 0}", "assert count_chars('') == {'h': 0, 'n': 0, 'r': 0}"], "test_code": "assert count_chars('garden falcon stone it cloud to') == {'h': 0, 'n': 3, 'r': 1}\nassert count_chars('cloud matrix') == {'h': 0, 'n': 0, 'r': 1}\nassert count_chars('engine planet stone') == {'h': 0, 'n': 4, 'r': 0}\nassert count_chars('banana up winter banana') == {'h': 0, 'n': 5, 'r': 1}\nassert count_chars('planet by vector pixel') == {'h': 0, 'n': 1, 'r': 1}\nassert count_chars('up') == {'h': 0, 'n': 0, 'r': 0}\nassert count_chars('') == {'h': 0, 'n': 0, 'r': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'hnr'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'hnr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'h'، 'n'، 'r' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('garden falcon stone it cloud to')` يُرجع `{'h': 0, 'n': 3, 'r': 1}`.\nالجواب:", "qhash": "b0766d21fadae488"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_letter", "reference": "def count_letter(text):\n return text.count('ت')", "tests": ["assert count_letter('قلم بيت سفينة حديقة قمر كتاب') == 2", "assert count_letter('باب مدرسة شمس رمل') == 0", "assert count_letter('نهر نهر مطر نهار ميناء') == 0", "assert count_letter('وردة عمل') == 0", "assert count_letter('نهار طائرة بيت قلم عربية معلم') == 1", "assert count_letter('قلم قلم') == 0", "assert count_letter('برمجة طائرة تفاحة بحر سماء ماء تفاحة') == 2", "assert count_letter('') == 0"], "test_code": "assert count_letter('قلم بيت سفينة حديقة قمر كتاب') == 2\nassert count_letter('باب مدرسة شمس رمل') == 0\nassert count_letter('نهر نهر مطر نهار ميناء') == 0\nassert count_letter('وردة عمل') == 0\nassert count_letter('نهار طائرة بيت قلم عربية معلم') == 1\nassert count_letter('قلم قلم') == 0\nassert count_letter('برمجة طائرة تفاحة بحر سماء ماء تفاحة') == 2\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)` بحيث تُعيد عدد مرات ظهور الحرف «ت» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_letter('قلم بيت سفينة حديقة قمر كتاب')` يُرجع `2`.\nالجواب:", "qhash": "3a9106b31e690930"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 341\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 = 341\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": "57278a8e10abb655", "answer": "11", "completion": " الناتج:\n```text\n11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "clip_scale", "reference": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 32)", "tests": ["assert clip_scale([20, 22, 22, 19, 25, 18, 20, 13, 21, 13]) == [40, 40, 42, 44, 44, 50]", "assert clip_scale([55, -17, 4, -10, 7, -22, 49, 28, -30, 3]) == [56]", "assert clip_scale([6, 58, -12, 53, 29, -17, 36]) == [58]", "assert clip_scale([-16, 36, -6, -21, 45, 0, -4, 20, -29, 44]) == [40]", "assert clip_scale([9]) == []", "assert clip_scale([4, 7, -21, 44, 32, 43, -6, 51]) == [64]", "assert clip_scale([-3, 57, 49, 10, 2, 13, 41, 42, 9, 32]) == [64]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([20, 22, 22, 19, 25, 18, 20, 13, 21, 13]) == [40, 40, 42, 44, 44, 50]\nassert clip_scale([55, -17, 4, -10, 7, -22, 49, 28, -30, 3]) == [56]\nassert clip_scale([6, 58, -12, 53, 29, -17, 36]) == [58]\nassert clip_scale([-16, 36, -6, -21, 45, 0, -4, 20, -29, 44]) == [40]\nassert clip_scale([9]) == []\nassert clip_scale([4, 7, -21, 44, 32, 43, -6, 51]) == [64]\nassert clip_scale([-3, 57, 49, 10, 2, 13, 41, 42, 9, 32]) == [64]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 32)", "completion": " ```python\ndef clip_scale(xs):\n return sorted(x * 2 for x in xs if 20 <= x <= 32)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `clip_scale(xs)`: اختر من القائمة xs العناصر x التي تحقق 20 ≤ x ≤ 32، اضرب كلًا منها في 2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `clip_scale([20, 22, 22, 19, 25, 18, 20, 13, 21, 13])` يُرجع `[40, 40, 42, 44, 44, 50]`.\nالجواب:", "qhash": "c5abe02a2477a8ac"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#0", "code": "s = 'vector'\nprint(s.capitalize())\nprint(s.count('t'))\nprint(s.index('t') + len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ns = 'vector'\nprint(s.capitalize())\nprint(s.count('t'))\nprint(s.index('t') + len(s))\n```\nالجواب:", "qhash": "4d2070fdb4f62675", "answer": "Vector\n1\n9", "completion": " الناتج:\n```text\nVector\n1\n9\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#0", "entry": "value_at", "reference": "def value_at(x):\n return -9 * x ** 2 + (1) * x + (5)", "tests": ["assert value_at(8) == -563", "assert value_at(3) == -73", "assert value_at(5) == -215", "assert value_at(-7) == -443", "assert value_at(-10) == -905", "assert value_at(-4) == -143", "assert value_at(15) == -2005", "assert value_at(0) == 5"], "test_code": "assert value_at(8) == -563\nassert value_at(3) == -73\nassert value_at(5) == -215\nassert value_at(-7) == -443\nassert value_at(-10) == -905\nassert value_at(-4) == -143\nassert value_at(15) == -2005\nassert value_at(0) == 5", "answer": "def value_at(x):\n return -9 * x ** 2 + (1) * x + (5)", "completion": " ```python\ndef value_at(x):\n return -9 * x ** 2 + (1) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون `value_at(x)` تُرجع قيمة كثيرة الحدود -9x² + 1x + 5 عند العدد الصحيح x.\nمثال: `value_at(8)` يجب أن تُرجع `-563`.\nالجواب:", "qhash": "6b0dbb1202e7a6be"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#0", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([-30, 33, -27, -15, 26, 14, -11, 51, 35]) == 26", "assert find_max_div([-4, -2, -2]) == -2", "assert find_max_div([1]) == None", "assert find_max_div([37, -40]) == -40", "assert find_max_div([27, -10, 5, 0, 6, 2]) == 6", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([-30, 33, -27, -15, 26, 14, -11, 51, 35]) == 26\nassert find_max_div([-4, -2, -2]) == -2\nassert find_max_div([1]) == None\nassert find_max_div([37, -40]) == -40\nassert find_max_div([27, -10, 5, 0, 6, 2]) == 6\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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مثال: `find_max_div([-30, 33, -27, -15, 26, 14, -11, 51, 35])` يجب أن تُرجع `26`.\nالجواب:", "qhash": "0a5e993ee4ec87d6"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('data of garden') == 'garden'", "assert flip_words('matrix') == 'matrix'", "assert flip_words('vector music in python by music') == 'music/python/music/vector'", "assert flip_words('vector an window summer falcon') == 'falcon/summer/window/vector'", "assert flip_words('to at to a') == ''", "assert flip_words('pixel desert we falcon pixel') == 'pixel/falcon/desert/pixel'", "assert flip_words('light we desert planet coffee brain') == 'brain/coffee/planet/desert/light'"], "test_code": "assert flip_words('data of garden') == 'garden'\nassert flip_words('matrix') == 'matrix'\nassert flip_words('vector music in python by music') == 'music/python/music/vector'\nassert flip_words('vector an window summer falcon') == 'falcon/summer/window/vector'\nassert flip_words('to at to a') == ''\nassert flip_words('pixel desert we falcon pixel') == 'pixel/falcon/desert/pixel'\nassert flip_words('light we desert planet coffee brain') == 'brain/coffee/planet/desert/light'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 5، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل '/'.\nللتوضيح: الاستدعاء `flip_words('data of garden')` يُرجع `'garden'`.\nالجواب:", "qhash": "745a72691d8baaaf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_special", "reference": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 9 == 0 and x % 2 != 0:\n count += 1\n return count", "tests": ["assert count_special([69, 42, 90, 5, 56, 21, 10, 29]) == 0", "assert count_special([65, -27, -35, 45, -4, 25, -25, -10, 68]) == 2", "assert count_special([-34, -11, -19, -4, 88, -29, -8, 54, -14, 21, 77, -32]) == 0", "assert count_special([77, -39, 84]) == 0", "assert count_special([]) == 0", "assert count_special([50, 19, -20, 11, -15, -5]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([69, 42, 90, 5, 56, 21, 10, 29]) == 0\nassert count_special([65, -27, -35, 45, -4, 25, -25, -10, 68]) == 2\nassert count_special([-34, -11, -19, -4, 88, -29, -8, 54, -14, 21, 77, -32]) == 0\nassert count_special([77, -39, 84]) == 0\nassert count_special([]) == 0\nassert count_special([50, 19, -20, 11, -15, -5]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n count = 0\n for x in xs:\n if x % 9 == 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 % 9 == 0 and x % 2 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 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([69, 42, 90, 5, 56, 21, 10, 29])` يُرجع `0`.\nالجواب:", "qhash": "6b1b31b058b32e97"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#0", "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('سماء ماء قهوة سفينة جبل') == 2", "assert prefix_hits('شمس مكتبة نور قهوة سفينة') == 1", "assert prefix_hits('تفاحة سلام سفينة') == 2", "assert prefix_hits('ميناء طائرة مدينة') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('بيت طائرة سفينة سفينة') == 2\nassert prefix_hits('مطر كتاب شمس بحر') == 0\nassert prefix_hits('سماء ماء قهوة سفينة جبل') == 2\nassert prefix_hits('شمس مكتبة نور قهوة سفينة') == 1\nassert prefix_hits('تفاحة سلام سفينة') == 2\nassert prefix_hits('ميناء طائرة مدينة') == 0\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": "c0f5eaf96a785563"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#1", "entry": "sum_div", "reference": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "tests": ["assert sum_div(285) == 7980", "assert sum_div(258) == 6630", "assert sum_div(165) == 2640", "assert sum_div(94) == 855", "assert sum_div(226) == 5175", "assert sum_div(48) == 225", "assert sum_div(1) == 0"], "test_code": "assert sum_div(285) == 7980\nassert sum_div(258) == 6630\nassert sum_div(165) == 2640\nassert sum_div(94) == 855\nassert sum_div(226) == 5175\nassert sum_div(48) == 225\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)", "completion": " ```python\ndef sum_div(n):\n return sum(x for x in range(1, n) if x % 5 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `sum_div(n)` تحسب مجموع كل عدد x حيث 1 ≤ x < n ويكون x من مضاعفات 5 أو من مضاعفات 10، ثم تُرجع هذا المجموع.\nللتوضيح: الاستدعاء `sum_div(285)` يُرجع `7980`.\nالجواب:", "qhash": "2ea2255d4484ca49"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert cycle([0, 11, 30, 38, 47, 30, 50, 9]) == [0, 11, 30, 38, 47, 30, 50, 9]", "assert cycle([45, 38, 18]) == [18, 45, 38]", "assert cycle([25, 49, 41, 31, 0, 12, 39, -2, -2]) == [41, 31, 0, 12, 39, -2, -2, 25, 49]", "assert cycle([26, 11, 45]) == [45, 26, 11]", "assert cycle([49, 47, 22, 12, -2]) == [-2, 49, 47, 22, 12]", "assert cycle([10, -4, 41, 31, 50]) == [50, 10, -4, 41, 31]", "assert cycle([]) == []"], "test_code": "assert cycle([0, 11, 30, 38, 47, 30, 50, 9]) == [0, 11, 30, 38, 47, 30, 50, 9]\nassert cycle([45, 38, 18]) == [18, 45, 38]\nassert cycle([25, 49, 41, 31, 0, 12, 39, -2, -2]) == [41, 31, 0, 12, 39, -2, -2, 25, 49]\nassert cycle([26, 11, 45]) == [45, 26, 11]\nassert cycle([49, 47, 22, 12, -2]) == [-2, 49, 47, 22, 12]\nassert cycle([10, -4, 41, 31, 50]) == [50, 10, -4, 41, 31]\nassert cycle([]) == []", "answer": "def cycle(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef cycle(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(xs):\n if not xs:\n return []\n k = 16 % len(xs)\n return ____\n```\nمثال: `cycle([0, 11, 30, 38, 47, 30, 50, 9])` يجب أن تُرجع `[0, 11, 30, 38, 47, 30, 50, 9]`.\nالجواب:", "qhash": "12c4d2d0af650524"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "freq_of", "reference": "def freq_of(s):\n return {c: s.count(c) for c in 'dm'}", "tests": ["assert freq_of('we falcon light matrix by data') == {'d': 1, 'm': 1}", "assert freq_of('of') == {'d': 0, 'm': 0}", "assert freq_of('vector music cloud a light') == {'d': 1, 'm': 1}", "assert freq_of('an') == {'d': 0, 'm': 0}", "assert freq_of('on') == {'d': 0, 'm': 0}", "assert freq_of('desert on engine garden camel') == {'d': 2, 'm': 1}", "assert freq_of('') == {'d': 0, 'm': 0}"], "test_code": "assert freq_of('we falcon light matrix by data') == {'d': 1, 'm': 1}\nassert freq_of('of') == {'d': 0, 'm': 0}\nassert freq_of('vector music cloud a light') == {'d': 1, 'm': 1}\nassert freq_of('an') == {'d': 0, 'm': 0}\nassert freq_of('on') == {'d': 0, 'm': 0}\nassert freq_of('desert on engine garden camel') == {'d': 2, 'm': 1}\nassert freq_of('') == {'d': 0, 'm': 0}", "answer": "def freq_of(s):\n return {c: s.count(c) for c in 'dm'}", "completion": " ```python\ndef freq_of(s):\n return {c: s.count(c) for c in 'dm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `freq_of(s)` تُرجع قاموسًا مفاتيحه المحارف 'd'، 'm' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `freq_of('we falcon light matrix by data')` يجب أن تُرجع `{'d': 1, 'm': 1}`.\nالجواب:", "qhash": "c7d8087e0d4d101b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_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 tally_div([26, 29, 11, 61, 20, 76, 75, 43, 11, 25, 20, 27]) == 2", "assert tally_div([-20, 71, 88, 57, 63]) == 2", "assert tally_div([]) == 0", "assert tally_div([64, 39, 25, 21, 8, -40, 12, 29, 15, 41, 33]) == 4", "assert tally_div([5, -30, -28, 43, 39, 53, 43, -6, 41]) == 1", "assert tally_div([73, 85, 47]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([26, 29, 11, 61, 20, 76, 75, 43, 11, 25, 20, 27]) == 2\nassert tally_div([-20, 71, 88, 57, 63]) == 2\nassert tally_div([]) == 0\nassert tally_div([64, 39, 25, 21, 8, -40, 12, 29, 15, 41, 33]) == 4\nassert tally_div([5, -30, -28, 43, 39, 53, 43, -6, 41]) == 1\nassert tally_div([73, 85, 47]) == 0\nassert tally_div([]) == 0", "answer": "def tally_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 tally_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 tally_div(xs):\n count = 0\n for x in xs:\n if ____:\n count += 1\n return count\n```\nللتوضيح: الاستدعاء `tally_div([26, 29, 11, 61, 20, 76, 75, 43, 11, 25, 20, 27])` يُرجع `2`.\nالجواب:", "qhash": "17a4982bb26adfde"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#1", "code": "total = 13\nfor x in range(-5, 8, 2):\n total -= x * 7\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntotal = 13\nfor x in range(-5, 8, 2):\n total -= x * 7\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "35076da7526a223a", "answer": "-36\n7", "completion": " الناتج:\n```text\n-36\n7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#1", "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 += 'Sun'\n if i % 9 == 0:\n s += 'Moon'\n out.append(s or str(i))\n return out", "tests": ["assert fizz(23) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'SunMoon', '19', '20', 'Sun', '22', '23']", "assert fizz(1) == ['1']", "assert fizz(4) == ['1', '2', 'Sun', '4']", "assert fizz(17) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun', '16', '17']", "assert fizz(6) == ['1', '2', 'Sun', '4', '5', 'Sun']"], "test_code": "assert fizz(23) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'SunMoon', '19', '20', 'Sun', '22', '23']\nassert fizz(1) == ['1']\nassert fizz(4) == ['1', '2', 'Sun', '4']\nassert fizz(17) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun', '16', '17']\nassert fizz(6) == ['1', '2', 'Sun', '4', '5', 'Sun']", "answer": "def fizz(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 fizz(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سؤال: أنشئ دالة بايثون `fizz(n)` تبني قائمة لكل i من 1 إلى n: إن قَبِل i القسمة على 3 أضف 'Sun'، وإن قَبِلها على 9 أضف 'Moon' (فيصبح 'SunMoon' عند الاثنين)، وإن لم يتحقق أيٌّ منهما ضع str(i).\nللتوضيح: الاستدعاء `fizz(23)` يُرجع `['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun', '16', '17', 'SunMoon', '19', '20', 'Sun', '22', '23']`.\nالجواب:", "qhash": "8ae671361039f71a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 14) == 1)", "tests": ["assert count_gcd1(16) == 7", "assert count_gcd1(87) == 38", "assert count_gcd1(132) == 57", "assert count_gcd1(4) == 2", "assert count_gcd1(173) == 75", "assert count_gcd1(120) == 51", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(16) == 7\nassert count_gcd1(87) == 38\nassert count_gcd1(132) == 57\nassert count_gcd1(4) == 2\nassert count_gcd1(173) == 75\nassert count_gcd1(120) == 51\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, 14) == 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, 14) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 14، أي أن القاسم المشترك الأكبر لها مع 14 يساوي 1.\nمثال: `count_gcd1(16)` يجب أن تُرجع `7`.\nالجواب:", "qhash": "7f6461bc929439ed"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "words_reversed", "reference": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert words_reversed('code a of') == 'code'", "assert words_reversed('pixel falcon engine of on python we of') == 'python|engine|falcon|pixel'", "assert words_reversed('') == ''", "assert words_reversed('in pixel by engine') == 'engine|pixel'", "assert words_reversed('of garden go we') == 'garden'", "assert words_reversed('') == ''", "assert words_reversed('summer brain table summer') == 'summer|table|brain|summer'"], "test_code": "assert words_reversed('code a of') == 'code'\nassert words_reversed('pixel falcon engine of on python we of') == 'python|engine|falcon|pixel'\nassert words_reversed('') == ''\nassert words_reversed('in pixel by engine') == 'engine|pixel'\nassert words_reversed('of garden go we') == 'garden'\nassert words_reversed('') == ''\nassert words_reversed('summer brain table summer') == 'summer|table|brain|summer'", "answer": "def words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef words_reversed(s):\n return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `words_reversed(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '|'.\nمثال: `words_reversed('code a of')` يجب أن تُرجع `'code'`.\nالجواب:", "qhash": "98ef7006ac79e432"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 19584\nc = 0\nwhile n > 13:\n n = n // 2\n c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 19584\nc = 0\nwhile n > 13:\n n = n // 2\n c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "49547161d8cc68de", "answer": "9 11", "completion": " الناتج:\n```text\n9 11\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "find_max_div", "reference": "def find_max_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 find_max_div([43, 50, 19, -23]) == None", "assert find_max_div([-15, -12, -9]) == -9", "assert find_max_div([1, 4]) == None", "assert find_max_div([-37, 34, -6, -13, 26, 2, -38, 18, -39]) == 18", "assert find_max_div([-35, 50, 44, -10, 46, -3]) == -3", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([43, 50, 19, -23]) == None\nassert find_max_div([-15, -12, -9]) == -9\nassert find_max_div([1, 4]) == None\nassert find_max_div([-37, 34, -6, -13, 26, 2, -38, 18, -39]) == 18\nassert find_max_div([-35, 50, 44, -10, 46, -3]) == -3\nassert find_max_div([]) == None", "answer": "def find_max_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 find_max_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 find_max_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 find_max_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للتوضيح: الاستدعاء `find_max_div([43, 50, 19, -23])` يُرجع `None`.\nالجواب:", "qhash": "d865910f74b76bf1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#0", "code": "vals = [x * -2 + -5 for x in range(-6, 7) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nvals = [x * -2 + -5 for x in range(-6, 7) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "987c9b82d2a7d325", "answer": "[7, -1, -9, -17]\n4 -20", "completion": " الناتج:\n```text\n[7, -1, -9, -17]\n4 -20\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#0", "entry": "rev_join", "reference": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert rev_join('a light winter in table data') == 'data-table-winter-light'", "assert rev_join('data rocket music') == 'music-rocket-data'", "assert rev_join('falcon rocket table table window engine apple') == 'apple-engine-window-table-table-rocket-falcon'", "assert rev_join('desert music music summer to garden at') == 'garden-summer-music-music-desert'", "assert rev_join('of code matrix river matrix python matrix') == 'matrix-python-matrix-river-matrix-code'", "assert rev_join('falcon apple summer planet orange of data') == 'data-orange-planet-summer-apple-falcon'", "assert rev_join('python signal summer') == 'summer-signal-python'"], "test_code": "assert rev_join('a light winter in table data') == 'data-table-winter-light'\nassert rev_join('data rocket music') == 'music-rocket-data'\nassert rev_join('falcon rocket table table window engine apple') == 'apple-engine-window-table-table-rocket-falcon'\nassert rev_join('desert music music summer to garden at') == 'garden-summer-music-music-desert'\nassert rev_join('of code matrix river matrix python matrix') == 'matrix-python-matrix-river-matrix-code'\nassert rev_join('falcon apple summer planet orange of data') == 'data-orange-planet-summer-apple-falcon'\nassert rev_join('python signal summer') == 'summer-signal-python'", "answer": "def rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef rev_join(s):\n return '-'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `rev_join(s)` تأخذ جملة وتُرجع الكلمات التي طولها 4 أحرف أو أكثر بترتيب معكوس، مفصولًا بينها بالفاصل '-'.\nمثال: `rev_join('a light winter in table data')` يجب أن تُرجع `'data-table-winter-light'`.\nالجواب:", "qhash": "db8ad77490c57182"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Fizz'\n if i % 11 == 0:\n s += 'Buzz'\n out.append(s or str(i))\n return out", "tests": ["assert play(11) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz']", "assert play(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']", "assert play(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19', '20', 'Fizz', 'Buzz', '23']", "assert play(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']", "assert play(4) == ['1', '2', '3', '4']"], "test_code": "assert play(11) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz']\nassert play(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']\nassert play(23) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18', '19', '20', 'Fizz', 'Buzz', '23']\nassert play(18) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz', '12', '13', 'Fizz', '15', '16', '17', '18']\nassert play(4) == ['1', '2', '3', '4']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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 play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 7 == 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سؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 7 يُستبدل بـ 'Fizz'، وعلى 11 بـ 'Buzz'، وعلى كليهما بـ 'FizzBuzz'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(11)` يجب أن تُرجع `['1', '2', '3', '4', '5', '6', 'Fizz', '8', '9', '10', 'Buzz']`.\nالجواب:", "qhash": "0ea24e805d3bd166"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#1", "entry": "cumulative", "reference": "def cumulative(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 cumulative([16, 49, 63, 68, 45, 48, 21, 67]) == [16, 65, 128, 0, 45, 93, 114, 0]", "assert cumulative([112]) == [112]", "assert cumulative([134, 90, 130, 14, 126, 13, 76, 109]) == [134, 0, 130, 0, 126, 139, 0, 109]", "assert cumulative([12, 6, 104, 24, 125, -9, 32, 79, 59, 15]) == [12, 18, 122, 0, 125, 116, 0, 79, 138, 0]", "assert cumulative([]) == []", "assert cumulative([44, 80, 16, 108, 26, 44, 17, 132, 98]) == [44, 124, 140, 0, 26, 70, 87, 0, 98]", "assert cumulative([]) == []"], "test_code": "assert cumulative([16, 49, 63, 68, 45, 48, 21, 67]) == [16, 65, 128, 0, 45, 93, 114, 0]\nassert cumulative([112]) == [112]\nassert cumulative([134, 90, 130, 14, 126, 13, 76, 109]) == [134, 0, 130, 0, 126, 139, 0, 109]\nassert cumulative([12, 6, 104, 24, 125, -9, 32, 79, 59, 15]) == [12, 18, 122, 0, 125, 116, 0, 79, 138, 0]\nassert cumulative([]) == []\nassert cumulative([44, 80, 16, 108, 26, 44, 17, 132, 98]) == [44, 124, 140, 0, 26, 70, 87, 0, 98]\nassert cumulative([]) == []", "answer": "def cumulative(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 cumulative(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سؤال: أنشئ دالة بايثون `cumulative(xs)`: ابدأ بمجموع s = 0، ولكل عنصر x أضِفه إلى s، فإن صار s > 142 اجعل s = 0، ثم أضف s إلى قائمة النتيجة. أعِد القائمة.\nللتوضيح: الاستدعاء `cumulative([16, 49, 63, 68, 45, 48, 21, 67])` يُرجع `[16, 65, 128, 0, 45, 93, 114, 0]`.\nالجواب:", "qhash": "8e40ab71eb3c25b7"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef rec(n):\n if n < 2:\n return n + 1\n return rec(n - 1) + rec(n - 2)\n\nprint(rec(5))\n```\nالجواب:", "qhash": "899eded96b823cc3", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#1", "entry": "digits_mod", "reference": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 54", "tests": ["assert digits_mod(24950) == 8", "assert digits_mod(907656) == 9", "assert digits_mod(399602) == 35", "assert digits_mod(355961) == 35", "assert digits_mod(927469) == 37", "assert digits_mod(23947) == 37", "assert digits_mod(480920) == 17", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(24950) == 8\nassert digits_mod(907656) == 9\nassert digits_mod(399602) == 35\nassert digits_mod(355961) == 35\nassert digits_mod(927469) == 37\nassert digits_mod(23947) == 37\nassert digits_mod(480920) == 17\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 54", "completion": " ```python\ndef digits_mod(n):\n return sum(int(d) ** 3 for d in str(n)) % 54\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `digits_mod(n)`: ارفع كل رقم من أرقام n للقوة 3، اجمع النتائج، ثم أعِد باقي قسمة المجموع على 54.\nللتوضيح: الاستدعاء `digits_mod(24950)` يُرجع `8`.\nالجواب:", "qhash": "1f39099819a84354"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 8)", "tests": ["assert filter_range([-2, 15, -17, -14, 9, -4]) == [4, 8]", "assert filter_range([]) == []", "assert filter_range([58, 14, -24, -28]) == []", "assert filter_range([-15, 22]) == []", "assert filter_range([51, 21, -15, 54, 49, 3, 11, -23, 38]) == [-6]", "assert filter_range([-25, 45, 42, 50, 5, 21, -23, 36, -6]) == [-10, 12]", "assert filter_range([41, -26, 32, -23]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([-2, 15, -17, -14, 9, -4]) == [4, 8]\nassert filter_range([]) == []\nassert filter_range([58, 14, -24, -28]) == []\nassert filter_range([-15, 22]) == []\nassert filter_range([51, 21, -15, 54, 49, 3, 11, -23, 38]) == [-6]\nassert filter_range([-25, 45, 42, 50, 5, 21, -23, 36, -6]) == [-10, 12]\nassert filter_range([41, -26, 32, -23]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 8)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -2 for x in xs if -10 <= x <= 8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق -10 ≤ x ≤ 8، اضرب كلًا منها في -2، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([-2, 15, -17, -14, 9, -4])` يُرجع `[4, 8]`.\nالجواب:", "qhash": "2b36493917a25e7d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "count_matching", "reference": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert count_matching([16, 67, 69, 79, 57, 45, 80, 65, 43]) == 2", "assert count_matching([22, -33, 61, 87, 28, 55, -17, 8, 23, 71]) == 3", "assert count_matching([50]) == 1", "assert count_matching([69, 79, 21, 44]) == 1", "assert count_matching([27, -4, 75, 81, 68, -19, -9, 88]) == 3", "assert count_matching([-39, 18, -13, 62, -3, 1, 1]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([16, 67, 69, 79, 57, 45, 80, 65, 43]) == 2\nassert count_matching([22, -33, 61, 87, 28, 55, -17, 8, 23, 71]) == 3\nassert count_matching([50]) == 1\nassert count_matching([69, 79, 21, 44]) == 1\nassert count_matching([27, -4, 75, 81, 68, -19, -9, 88]) == 3\nassert count_matching([-39, 18, -13, 62, -3, 1, 1]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count", "completion": " ```python\ndef count_matching(xs):\n count = 0\n for x in xs:\n if x % 2 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 3، واكتب الدالة بعد إكمالها.\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([16, 67, 69, 79, 57, 45, 80, 65, 43])` يُرجع `2`.\nالجواب:", "qhash": "5fff86a5ca4a42dd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "tally_letter", "reference": "def tally_letter(text):\n return text.count('ك')", "tests": ["assert tally_letter('طالب ميناء وردة علم طالب بيت') == 0", "assert tally_letter('سيارة عربية مكتبة رمل قمر نور قلم') == 1", "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('سيارة عربية مكتبة رمل قمر نور قلم') == 1\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 text.count('ك')", "completion": " ```python\ndef tally_letter(text):\n return text.count('ك')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ الدالة `tally_letter(text)` بحيث تُعيد عدد مرات ظهور الحرف «ك» في النص، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `tally_letter('طالب ميناء وردة علم طالب بيت')` يُرجع `0`.\nالجواب:", "qhash": "eccf11e94aa9bdc0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#1", "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('فجر شمس ماء مكتبة لغة برمجة وردة') == 1", "assert words_starting('معلم ماء فجر فجر') == 2", "assert words_starting('دفتر شمس ليل عربية') == 0", "assert words_starting('تفاحة فجر عربية قلم سفينة فجر') == 2", "assert words_starting('مدينة فجر ليل فجر حديقة سماء') == 2", "assert words_starting('قلم سيارة شمس وردة فجر فجر') == 2", "assert words_starting('') == 0"], "test_code": "assert words_starting('فجر شمس ماء مكتبة لغة برمجة وردة') == 1\nassert words_starting('معلم ماء فجر فجر') == 2\nassert words_starting('دفتر شمس ليل عربية') == 0\nassert words_starting('تفاحة فجر عربية قلم سفينة فجر') == 2\nassert words_starting('مدينة فجر ليل فجر حديقة سماء') == 2\nassert words_starting('قلم سيارة شمس وردة فجر فجر') == 2\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('فجر شمس ماء مكتبة لغة برمجة وردة')` يُرجع `1`.\nالجواب:", "qhash": "d8674c5f7c378040"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def calc(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(calc(20))\nprint(calc(20, -10))\nprint(calc(calc(-10), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 0 - y\n return x + y * 0\n\nprint(calc(20))\nprint(calc(20, -10))\nprint(calc(calc(-10), 20))\n```\nالجواب:", "qhash": "81ae2cc7a0ab62d5", "answer": "-5\n10\n-10", "completion": " الناتج:\n```text\n-5\n10\n-10\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "kalima = 'عربية'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nkalima = 'عربية'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint(kalima[::-1])\n```\nالجواب:", "qhash": "eed61e058ee3999b", "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#0", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 5\n return total", "tests": ["assert scaled_powers(3) == 1932", "assert scaled_powers(0) == 0", "assert scaled_powers(13) == 7014007", "assert scaled_powers(1) == 7", "assert scaled_powers(9) == 845775", "assert scaled_powers(1) == 7", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(3) == 1932\nassert scaled_powers(0) == 0\nassert scaled_powers(13) == 7014007\nassert scaled_powers(1) == 7\nassert scaled_powers(9) == 845775\nassert scaled_powers(1) == 7\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * i ** 5\n return total", "completion": " ```python\ndef scaled_powers(n):\n total = 0\n for i in range(1, n + 1):\n total += 7 * 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 = 7 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 7 × 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 = 7 * i ** 5\n return total\n```\nمثال: `scaled_powers(3)` يجب أن تُرجع `1932`.\nالجواب:", "qhash": "c50bb6f5e1281b28"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#1", "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('it winter banana rocket go signal at') == 'signal rocket banana winter'", "assert rev_long_words('light pixel is is') == ''", "assert rev_long_words('') == ''", "assert rev_long_words('banana a garden by vector rocket vector table') == 'vector rocket vector garden banana'", "assert rev_long_words('python on by falcon signal') == 'signal falcon python'", "assert rev_long_words('rocket summer table') == 'summer rocket'", "assert rev_long_words('winter river on engine table signal music falcon') == 'falcon signal engine winter'"], "test_code": "assert rev_long_words('it winter banana rocket go signal at') == 'signal rocket banana winter'\nassert rev_long_words('light pixel is is') == ''\nassert rev_long_words('') == ''\nassert rev_long_words('banana a garden by vector rocket vector table') == 'vector rocket vector garden banana'\nassert rev_long_words('python on by falcon signal') == 'signal falcon python'\nassert rev_long_words('rocket summer table') == 'summer rocket'\nassert rev_long_words('winter river on engine table signal music falcon') == 'falcon signal engine winter'", "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)`: قسّم الجملة s إلى كلمات (حسب المسافات)، احتفظ فقط بالكلمات التي لا يقل طولها عن 6، اعكس ترتيبها ثم اجمعها في نص واحد بالفاصل ' '.\nللتوضيح: الاستدعاء `rev_long_words('it winter banana rocket go signal at')` يُرجع `'signal rocket banana winter'`.\nالجواب:", "qhash": "ae46695ce2182966"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "max_of_div", "reference": "def max_of_div(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 max_of_div([48, 45, 44, -19, 29]) == 48", "assert max_of_div([-60, -12, -36]) == -12", "assert max_of_div([1]) == None", "assert max_of_div([-37, 23, -12, -1, -1, 14, -5]) == -12", "assert max_of_div([32, 27, 1, -11, -45, -37, 3, 20]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([48, 45, 44, -19, 29]) == 48\nassert max_of_div([-60, -12, -36]) == -12\nassert max_of_div([1]) == None\nassert max_of_div([-37, 23, -12, -1, -1, 14, -5]) == -12\nassert max_of_div([32, 27, 1, -11, -45, -37, 3, 20]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(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 max_of_div(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 max_of_div(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 max_of_div(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للتوضيح: الاستدعاء `max_of_div([48, 45, 44, -19, 29])` يُرجع `48`.\nالجواب:", "qhash": "2ecc52e35f7ea747"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#0", "code": "w = 'شمس شجرة'\nprint(w[::-1])\nprint(w[0])\nprint(w.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nw = 'شمس شجرة'\nprint(w[::-1])\nprint(w[0])\nprint(w.replace(' ', '-'))\n```\nالجواب:", "qhash": "0ebb128ace6d889d", "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#1", "code": "m = 76959\nc = 0\nwhile m > 7:\n m = m // 5\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 76959\nc = 0\nwhile m > 7:\n m = m // 5\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "953511925df63b48", "answer": "4 6", "completion": " الناتج:\n```text\n4 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def calc(x, y=5):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(calc(9))\nprint(calc(9, 18))\nprint(calc(calc(18), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(x, y=5):\n if x > y:\n return x * 7 - y\n return x + y * 7\n\nprint(calc(9))\nprint(calc(9, 18))\nprint(calc(calc(18), 9))\n```\nالجواب:", "qhash": "416530d8bf5a790e", "answer": "58\n135\n838", "completion": " الناتج:\n```text\n58\n135\n838\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "add_multiples", "reference": "def add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert add_multiples(148) == 4425", "assert add_multiples(251) == 12628", "assert add_multiples(88) == 1575", "assert add_multiples(272) == 14715", "assert add_multiples(94) == 1758", "assert add_multiples(83) == 1404", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(148) == 4425\nassert add_multiples(251) == 12628\nassert add_multiples(88) == 1575\nassert add_multiples(272) == 14715\nassert add_multiples(94) == 1758\nassert add_multiples(83) == 1404\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 % 10 == 0)", "completion": " ```python\ndef add_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `add_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `add_multiples(148)` يجب أن تُرجع `4425`.\nالجواب:", "qhash": "d61bc59d89974f7a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 85) == 1)", "tests": ["assert phi_upto(81) == 61", "assert phi_upto(80) == 60", "assert phi_upto(51) == 38", "assert phi_upto(130) == 98", "assert phi_upto(177) == 134", "assert phi_upto(152) == 115", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(81) == 61\nassert phi_upto(80) == 60\nassert phi_upto(51) == 38\nassert phi_upto(130) == 98\nassert phi_upto(177) == 134\nassert phi_upto(152) == 115\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, 85) == 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, 85) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 85، أي أن القاسم المشترك الأكبر لها مع 85 يساوي 1.\nمثال: `phi_upto(81)` يجب أن تُرجع `61`.\nالجواب:", "qhash": "9da1bc74af14f767"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert shift_letters('stone camel falcon') == 'ghcbs qoasz tozqcb'", "assert shift_letters('by') == 'pm'", "assert shift_letters('python rocket') == 'dmhvcb fcqysh'", "assert shift_letters('of 2024') == 'ct 2024'", "assert shift_letters('brain planet window orange') == 'pfowb dzobsh kwbrck cfobus'", "assert shift_letters('go desert banana garden') == 'uc rsgsfh pobobo uofrsb'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('stone camel falcon') == 'ghcbs qoasz tozqcb'\nassert shift_letters('by') == 'pm'\nassert shift_letters('python rocket') == 'dmhvcb fcqysh'\nassert shift_letters('of 2024') == 'ct 2024'\nassert shift_letters('brain planet window orange') == 'pfowb dzobsh kwbrck cfobus'\nassert shift_letters('go desert banana garden') == 'uc rsgsfh pobobo uofrsb'\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 + (-12)) % 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 + (-12)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `shift_letters(s)` لتشفير قيصر: المطلوب إزاحة كل حرف إنجليزي صغير (a-z) 12 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `shift_letters('stone camel falcon')` يُرجع `'ghcbs qoasz tozqcb'`.\nالجواب:", "qhash": "1bbfa2638d80bdb1"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 23) == 1)", "tests": ["assert count_gcd1(57) == 55", "assert count_gcd1(60) == 58", "assert count_gcd1(14) == 14", "assert count_gcd1(75) == 72", "assert count_gcd1(181) == 174", "assert count_gcd1(41) == 40", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(57) == 55\nassert count_gcd1(60) == 58\nassert count_gcd1(14) == 14\nassert count_gcd1(75) == 72\nassert count_gcd1(181) == 174\nassert count_gcd1(41) == 40\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, 23) == 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, 23) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `count_gcd1(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 23، أي أن القاسم المشترك الأكبر لها مع 23 يساوي 1.\nمثال: `count_gcd1(57)` يجب أن تُرجع `55`.\nالجواب:", "qhash": "e52056a15ab146bf"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "rotate_by", "reference": "def rotate_by(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert rotate_by([0, 1, 40, 41, 1, 41]) == [0, 1, 40, 41, 1, 41]", "assert rotate_by([29, 37, 44, 27, 1, 14, 28, 25, 46, 10]) == [46, 10, 29, 37, 44, 27, 1, 14, 28, 25]", "assert rotate_by([6, 15, 21, -9, -9, 34, 10, 32, 11, 46, 32, 14]) == [10, 32, 11, 46, 32, 14, 6, 15, 21, -9, -9, 34]", "assert rotate_by([30, -5, 25]) == [30, -5, 25]", "assert rotate_by([11, 33, 27, 3, 40, -7, -4, 41, 5]) == [11, 33, 27, 3, 40, -7, -4, 41, 5]", "assert rotate_by([44, -7, 4]) == [44, -7, 4]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([0, 1, 40, 41, 1, 41]) == [0, 1, 40, 41, 1, 41]\nassert rotate_by([29, 37, 44, 27, 1, 14, 28, 25, 46, 10]) == [46, 10, 29, 37, 44, 27, 1, 14, 28, 25]\nassert rotate_by([6, 15, 21, -9, -9, 34, 10, 32, 11, 46, 32, 14]) == [10, 32, 11, 46, 32, 14, 6, 15, 21, -9, -9, 34]\nassert rotate_by([30, -5, 25]) == [30, -5, 25]\nassert rotate_by([11, 33, 27, 3, 40, -7, -4, 41, 5]) == [11, 33, 27, 3, 40, -7, -4, 41, 5]\nassert rotate_by([44, -7, 4]) == [44, -7, 4]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(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 rotate_by(lst):\n if not lst:\n return []\n k = 18 % len(lst)\n return ____\n```\nللتوضيح: الاستدعاء `rotate_by([0, 1, 40, 41, 1, 41])` يُرجع `[0, 1, 40, 41, 1, 41]`.\nالجواب:", "qhash": "6f21a440c20cbf1a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "n = 14487\nsteps = 0\nwhile n > 11:\n n = n // 9\n steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nn = 14487\nsteps = 0\nwhile n > 11:\n n = n // 9\n steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "e4b2909990079b35", "answer": "2 4", "completion": " الناتج:\n```text\n2 4\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#1", "entry": "count_chars", "reference": "def count_chars(s):\n return {c: s.count(c) for c in 'cdm'}", "tests": ["assert count_chars('camel it brain it engine in') == {'c': 1, 'd': 0, 'm': 1}", "assert count_chars('python coffee we apple is') == {'c': 1, 'd': 0, 'm': 0}", "assert count_chars('code of is') == {'c': 1, 'd': 1, 'm': 0}", "assert count_chars('music at') == {'c': 1, 'd': 0, 'm': 1}", "assert count_chars('we code matrix go') == {'c': 1, 'd': 1, 'm': 1}", "assert count_chars('up falcon is up light apple') == {'c': 1, 'd': 0, 'm': 0}", "assert count_chars('') == {'c': 0, 'd': 0, 'm': 0}"], "test_code": "assert count_chars('camel it brain it engine in') == {'c': 1, 'd': 0, 'm': 1}\nassert count_chars('python coffee we apple is') == {'c': 1, 'd': 0, 'm': 0}\nassert count_chars('code of is') == {'c': 1, 'd': 1, 'm': 0}\nassert count_chars('music at') == {'c': 1, 'd': 0, 'm': 1}\nassert count_chars('we code matrix go') == {'c': 1, 'd': 1, 'm': 1}\nassert count_chars('up falcon is up light apple') == {'c': 1, 'd': 0, 'm': 0}\nassert count_chars('') == {'c': 0, 'd': 0, 'm': 0}", "answer": "def count_chars(s):\n return {c: s.count(c) for c in 'cdm'}", "completion": " ```python\ndef count_chars(s):\n return {c: s.count(c) for c in 'cdm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `count_chars(s)` تعيد dict يربط كل محرف من المحارف 'c'، 'd'، 'm' بعدد تكراره في s، مع إدراج المحارف غير الموجودة بقيمة 0.\nللتوضيح: الاستدعاء `count_chars('camel it brain it engine in')` يُرجع `{'c': 1, 'd': 0, 'm': 1}`.\nالجواب:", "qhash": "b82478fc0de62f41"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#0", "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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)", "tests": ["assert cipher('coffee is A1') == 'gsjjii mw A1'", "assert cipher('orange orange matrix on to') == 'sverki sverki qexvmb sr xs'", "assert cipher('code A1') == 'gshi A1'", "assert cipher('falcon at at planet Hello') == 'jepgsr ex ex tperix Hipps'", "assert cipher('planet garden pixel apple A1') == 'tperix kevhir tmbip ettpi A1'", "assert cipher('signal signal stone') == 'wmkrep wmkrep wxsri'", "assert cipher('') == ''"], "test_code": "assert cipher('coffee is A1') == 'gsjjii mw A1'\nassert cipher('orange orange matrix on to') == 'sverki sverki qexvmb sr xs'\nassert cipher('code A1') == 'gshi A1'\nassert cipher('falcon at at planet Hello') == 'jepgsr ex ex tperix Hipps'\nassert cipher('planet garden pixel apple A1') == 'tperix kevhir tmbip ettpi A1'\nassert cipher('signal signal stone') == 'wmkrep wmkrep wxsri'\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 + (-22)) % 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 + (-22)) % 26 + 97))\n else:\n out.append(c)\n return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `cipher(s)` تُرجع النص الناتج عن إزاحة كل حرف إنجليزي صغير (a-z) 22 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('coffee is A1')` يجب أن تُرجع `'gsjjii mw A1'`.\nالجواب:", "qhash": "6b599eb8cabbdd20"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 39) == 1)", "tests": ["assert coprime_count(54) == 33", "assert coprime_count(100) == 62", "assert coprime_count(11) == 8", "assert coprime_count(25) == 16", "assert coprime_count(130) == 80", "assert coprime_count(115) == 71", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(54) == 33\nassert coprime_count(100) == 62\nassert coprime_count(11) == 8\nassert coprime_count(25) == 16\nassert coprime_count(130) == 80\nassert coprime_count(115) == 71\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, 39) == 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, 39) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `coprime_count(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 39، أي أن القاسم المشترك الأكبر لها مع 39 يساوي 1.\nمثال: `coprime_count(54)` يجب أن تُرجع `33`.\nالجواب:", "qhash": "8a5adaa9f6dd9233"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "m = 28737\nc = 0\nwhile m > 12:\n m = m // 3\n c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nm = 28737\nc = 0\nwhile m > 12:\n m = m // 3\n c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "f65a58ae5ded63cf", "answer": "4 8", "completion": " الناتج:\n```text\n4 8\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#1", "entry": "largest_div", "reference": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x > best):\n best = x\n return best", "tests": ["assert largest_div([13, -17, 56, -10, 5, 36, 45, -5, 52]) == 45", "assert largest_div([-9, -9, -3]) == -3", "assert largest_div([1, 4]) == None", "assert largest_div([-2]) == None", "assert largest_div([36, 27, -11, -41, 14, 6, 0, 37, -34]) == 36", "assert largest_div([]) == None"], "test_code": "assert largest_div([13, -17, 56, -10, 5, 36, 45, -5, 52]) == 45\nassert largest_div([-9, -9, -3]) == -3\nassert largest_div([1, 4]) == None\nassert largest_div([-2]) == None\nassert largest_div([36, 27, -11, -41, 14, 6, 0, 37, -34]) == 36\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 3 == 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 % 3 == 0 and (best is None or x > best):\n best = x\n return best\n```\n", "buggy": "def largest_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x < best):\n best = x\n return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر. اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef largest_div(arr):\n best = None\n for x in arr:\n if x % 3 == 0 and (best is None or x < best):\n best = x\n return best\n```\nللتوضيح: الاستدعاء `largest_div([13, -17, 56, -10, 5, 36, 45, -5, 52])` يُرجع `45`.\nالجواب:", "qhash": "7459c4f75023bb0b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "roll", "reference": "def roll(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[k:] + xs[:k]", "tests": ["assert roll([30, 28, 13, 40]) == [40, 30, 28, 13]", "assert roll([47, 27, 44, 42, -2, 8, 12, 17, -5, 48, 4]) == [42, -2, 8, 12, 17, -5, 48, 4, 47, 27, 44]", "assert roll([31, 46, 37, 41]) == [41, 31, 46, 37]", "assert roll([27, 42, 40, 15, -3]) == [15, -3, 27, 42, 40]", "assert roll([39, 3, 24, 40, -3, 15, 15, 29, 1]) == [40, -3, 15, 15, 29, 1, 39, 3, 24]", "assert roll([15, 37, -9, -6, 0, 11, 36]) == [-6, 0, 11, 36, 15, 37, -9]", "assert roll([]) == []"], "test_code": "assert roll([30, 28, 13, 40]) == [40, 30, 28, 13]\nassert roll([47, 27, 44, 42, -2, 8, 12, 17, -5, 48, 4]) == [42, -2, 8, 12, 17, -5, 48, 4, 47, 27, 44]\nassert roll([31, 46, 37, 41]) == [41, 31, 46, 37]\nassert roll([27, 42, 40, 15, -3]) == [15, -3, 27, 42, 40]\nassert roll([39, 3, 24, 40, -3, 15, 15, 29, 1]) == [40, -3, 15, 15, 29, 1, 39, 3, 24]\nassert roll([15, 37, -9, -6, 0, 11, 36]) == [-6, 0, 11, 36, 15, 37, -9]\nassert roll([]) == []", "answer": "def roll(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(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 roll(xs):\n if not xs:\n return []\n k = 3 % len(xs)\n return ____\n```\nللتوضيح: الاستدعاء `roll([30, 28, 13, 40])` يُرجع `[40, 30, 28, 13]`.\nالجواب:", "qhash": "a59bb7a3650721f0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "nums = [34, 39, 29, 2, -3, -14, 1]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nnums = [34, 39, 29, 2, -3, -14, 1]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "978d58763fbb86bc", "answer": "[-3, 1, 2, -14, 29, 34, 39]\n[39, 34, 29]", "completion": " الناتج:\n```text\n[-3, 1, 2, -14, 29, 34, 39]\n[39, 34, 29]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#0", "entry": "fact_mod", "reference": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 11", "tests": ["assert fact_mod(11) == 0", "assert fact_mod(11) == 0", "assert fact_mod(18) == 4", "assert fact_mod(14) == 0", "assert fact_mod(47) == 0", "assert fact_mod(6) == 7", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 0\nassert fact_mod(11) == 0\nassert fact_mod(18) == 4\nassert fact_mod(14) == 0\nassert fact_mod(47) == 0\nassert fact_mod(6) == 7\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 11", "completion": " ```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return (n * fact_mod(n - 3)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، ثم اكتب الدالة كاملة.\n```python\ndef fact_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nمثال: `fact_mod(11)` يجب أن تُرجع `0`.\nالجواب:", "qhash": "744b9e8f47f779fd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "prod_mod", "reference": "def prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 7", "tests": ["assert prod_mod(10) == 0", "assert prod_mod(13) == 0", "assert prod_mod(9) == 0", "assert prod_mod(43) == 0", "assert prod_mod(10) == 0", "assert prod_mod(47) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(10) == 0\nassert prod_mod(13) == 0\nassert prod_mod(9) == 0\nassert prod_mod(43) == 0\nassert prod_mod(10) == 0\nassert prod_mod(47) == 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)) % 7", "completion": " ```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return (n * prod_mod(n - 1)) % 7\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 7 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef prod_mod(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `prod_mod(10)` يُرجع `0`.\nالجواب:", "qhash": "f302bb7d5cf410e9"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "m = 89356\nsteps = 0\nwhile m > 6:\n m = m // 6\n steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nm = 89356\nsteps = 0\nwhile m > 6:\n m = m // 6\n steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "cc55747cdbfa9012", "answer": "1 6", "completion": " الناتج:\n```text\n1 6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#0", "entry": "letter_stats", "reference": "def letter_stats(s):\n return {c: s.count(c) for c in 'bh'}", "tests": ["assert letter_stats('coffee python falcon winter') == {'b': 0, 'h': 1}", "assert letter_stats('river in is') == {'b': 0, 'h': 0}", "assert letter_stats('cloud in stone signal winter') == {'b': 0, 'h': 0}", "assert letter_stats('python it camel go planet data') == {'b': 0, 'h': 1}", "assert letter_stats('a of light music') == {'b': 0, 'h': 1}", "assert letter_stats('vector') == {'b': 0, 'h': 0}", "assert letter_stats('') == {'b': 0, 'h': 0}"], "test_code": "assert letter_stats('coffee python falcon winter') == {'b': 0, 'h': 1}\nassert letter_stats('river in is') == {'b': 0, 'h': 0}\nassert letter_stats('cloud in stone signal winter') == {'b': 0, 'h': 0}\nassert letter_stats('python it camel go planet data') == {'b': 0, 'h': 1}\nassert letter_stats('a of light music') == {'b': 0, 'h': 1}\nassert letter_stats('vector') == {'b': 0, 'h': 0}\nassert letter_stats('') == {'b': 0, 'h': 0}", "answer": "def letter_stats(s):\n return {c: s.count(c) for c in 'bh'}", "completion": " ```python\ndef letter_stats(s):\n return {c: s.count(c) for c in 'bh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `letter_stats(s)` تُرجع قاموسًا مفاتيحه المحارف 'b'، 'h' وقيمة كل مفتاح عدد مرات ظهوره في النص s (حتى لو كان صفرًا).\nمثال: `letter_stats('coffee python falcon winter')` يجب أن تُرجع `{'b': 0, 'h': 1}`.\nالجواب:", "qhash": "8598fd061dd4a28a"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 11 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert fizzbuzz(11) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac']", "assert fizzbuzz(11) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac']", "assert fizzbuzz(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'Tic']", "assert fizzbuzz(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic']", "assert fizzbuzz(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic']"], "test_code": "assert fizzbuzz(11) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac']\nassert fizzbuzz(11) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac']\nassert fizzbuzz(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'Tic', '19', 'Tic']\nassert fizzbuzz(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic']\nassert fizzbuzz(16) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac', 'Tic', '13', 'Tic', '15', 'Tic']", "answer": "def fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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 fizzbuzz(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 2 == 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سؤال: اكتب دالة `fizzbuzz(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 2 يُستبدل بـ 'Tic'، وعلى 11 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `fizzbuzz(11)` يجب أن تُرجع `['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', '9', 'Tic', 'Tac']`.\nالجواب:", "qhash": "007c5f38db6d7cab"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#1", "code": "name = 'stone'\nprint(name.replace('n', '*'))\nprint(name.index('n') + len(name))\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\nname = 'stone'\nprint(name.replace('n', '*'))\nprint(name.index('n') + len(name))\nprint(len(name))\n```\nالجواب:", "qhash": "3cc142f078ebea1b", "answer": "sto*e\n8\n5", "completion": " الناتج:\n```text\nsto*e\n8\n5\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#1", "entry": "spin", "reference": "def spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert spin([30, 25, 50, 26, 34, 22]) == [50, 26, 34, 22, 30, 25]", "assert spin([21, 19, 11, 46, 1, 45, -5, 17, 29, 2, 50, 10]) == [29, 2, 50, 10, 21, 19, 11, 46, 1, 45, -5, 17]", "assert spin([12, 28, 3, 32, 17, 3, -4, 14, 26, 8, -6]) == [-4, 14, 26, 8, -6, 12, 28, 3, 32, 17, 3]", "assert spin([50, 8, -4, 35, 40, 21, 21, 2]) == [50, 8, -4, 35, 40, 21, 21, 2]", "assert spin([19, 47, -3, 26, 29, 1, 16, 29, 34, 25, 21, -6]) == [34, 25, 21, -6, 19, 47, -3, 26, 29, 1, 16, 29]", "assert spin([28, 19, -4, 23, 27, 20, 40, 37, 20, 48]) == [27, 20, 40, 37, 20, 48, 28, 19, -4, 23]", "assert spin([]) == []"], "test_code": "assert spin([30, 25, 50, 26, 34, 22]) == [50, 26, 34, 22, 30, 25]\nassert spin([21, 19, 11, 46, 1, 45, -5, 17, 29, 2, 50, 10]) == [29, 2, 50, 10, 21, 19, 11, 46, 1, 45, -5, 17]\nassert spin([12, 28, 3, 32, 17, 3, -4, 14, 26, 8, -6]) == [-4, 14, 26, 8, -6, 12, 28, 3, 32, 17, 3]\nassert spin([50, 8, -4, 35, 40, 21, 21, 2]) == [50, 8, -4, 35, 40, 21, 21, 2]\nassert spin([19, 47, -3, 26, 29, 1, 16, 29, 34, 25, 21, -6]) == [34, 25, 21, -6, 19, 47, -3, 26, 29, 1, 16, 29]\nassert spin([28, 19, -4, 23, 27, 20, 40, 37, 20, 48]) == [27, 20, 40, 37, 20, 48, 28, 19, -4, 23]\nassert spin([]) == []", "answer": "def spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة القائمة بعد تدويرها 16 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة)، واكتب الدالة بعد إكمالها.\n```python\ndef spin(arr):\n if not arr:\n return []\n k = 16 % len(arr)\n return ____\n```\nللتوضيح: الاستدعاء `spin([30, 25, 50, 26, 34, 22])` يُرجع `[50, 26, 34, 22, 30, 25]`.\nالجواب:", "qhash": "e21d73e84fb61310"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "x = 298\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 = 298\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": "99bc3b74080ef98f", "answer": "24", "completion": " الناتج:\n```text\n24\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#1", "code": "pairs = [('فيصل', 88), ('خالد', 83), ('وليد', 18), ('راشد', 40)]\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 = [('فيصل', 88), ('خالد', 83), ('وليد', 18), ('راشد', 40)]\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": "dd0fe13f536ba002", "answer": "[('وليد', 18), ('راشد', 40), ('خالد', 83), ('فيصل', 88)]\n['فيصل', 'خالد']", "completion": " الناتج:\n```text\n[('وليد', 18), ('راشد', 40), ('خالد', 83), ('فيصل', 88)]\n['فيصل', 'خالد']\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#0", "code": "def calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(602659347))\nprint(calc(calc(602659347)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef calc(n):\n if n < 10:\n return n\n return n % 10 + calc(n // 10)\n\nprint(calc(602659347))\nprint(calc(calc(602659347)))\n```\nالجواب:", "qhash": "0226d2e9b6f8dcb7", "answer": "42\n6", "completion": " الناتج:\n```text\n42\n6\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#0", "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, 60) == 1)", "tests": ["assert phi_upto(32) == 9", "assert phi_upto(8) == 2", "assert phi_upto(104) == 28", "assert phi_upto(75) == 20", "assert phi_upto(123) == 33", "assert phi_upto(188) == 50", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(32) == 9\nassert phi_upto(8) == 2\nassert phi_upto(104) == 28\nassert phi_upto(75) == 20\nassert phi_upto(123) == 33\nassert phi_upto(188) == 50\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, 60) == 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, 60) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 60، أي أن القاسم المشترك الأكبر لها مع 60 يساوي 1.\nمثال: `phi_upto(32)` يجب أن تُرجع `9`.\nالجواب:", "qhash": "017605a8be5df988"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#1", "code": "n = 92\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 = 92\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": "d8e130af6e18a4f8", "answer": "17", "completion": " الناتج:\n```text\n17\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#1", "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('engine a code an python') == 'vexzev r tfuv re gpkyfe'", "assert encode('orange it orange planet cloud') == 'firexv zk firexv gcrevk tcflu'", "assert encode('go on summer planet A1') == 'xf fe jlddvi gcrevk A1'", "assert encode('music signal stone camel to') == 'dljzt jzxerc jkfev trdvc kf'", "assert encode('of we it cloud') == 'fw nv zk tcflu'", "assert encode('table falcon data') == 'krscv wrctfe urkr'", "assert encode('') == ''"], "test_code": "assert encode('engine a code an python') == 'vexzev r tfuv re gpkyfe'\nassert encode('orange it orange planet cloud') == 'firexv zk firexv gcrevk tcflu'\nassert encode('go on summer planet A1') == 'xf fe jlddvi gcrevk A1'\nassert encode('music signal stone camel to') == 'dljzt jzxerc jkfev trdvc kf'\nassert encode('of we it cloud') == 'fw nv zk tcflu'\nassert encode('table falcon data') == 'krscv wrctfe urkr'\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 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nللتوضيح: الاستدعاء `encode('engine a code an python')` يُرجع `'vexzev r tfuv re gpkyfe'`.\nالجواب:", "qhash": "d2ba73cd9587329c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#0", "code": "x = 311\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 = 311\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": "d77bd3ff582c740c", "answer": "86", "completion": " الناتج:\n```text\n86\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "filter_range", "reference": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 6 <= x <= 44)", "tests": ["assert filter_range([18, 40, 5, 34, 39, 43, 0, 8]) == [-129, -120, -117, -102, -54, -24]", "assert filter_range([6, 36, -11, -27, -23, 52]) == [-108, -18]", "assert filter_range([-6, 54, 26, -7, 20, 24]) == [-78, -72, -60]", "assert filter_range([]) == []", "assert filter_range([43, 17, -19, 4, 37, 20]) == [-129, -111, -60, -51]", "assert filter_range([-23, 36, 11, 51, 5, 56, -16, 23, 17]) == [-108, -69, -51, -33]", "assert filter_range([-20, 39, 10, 53, 0, 20]) == [-117, -60, -30]", "assert filter_range([]) == []"], "test_code": "assert filter_range([18, 40, 5, 34, 39, 43, 0, 8]) == [-129, -120, -117, -102, -54, -24]\nassert filter_range([6, 36, -11, -27, -23, 52]) == [-108, -18]\nassert filter_range([-6, 54, 26, -7, 20, 24]) == [-78, -72, -60]\nassert filter_range([]) == []\nassert filter_range([43, 17, -19, 4, 37, 20]) == [-129, -111, -60, -51]\nassert filter_range([-23, 36, 11, 51, 5, 56, -16, 23, 17]) == [-108, -69, -51, -33]\nassert filter_range([-20, 39, 10, 53, 0, 20]) == [-117, -60, -30]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n return sorted(x * -3 for x in xs if 6 <= x <= 44)", "completion": " ```python\ndef filter_range(xs):\n return sorted(x * -3 for x in xs if 6 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `filter_range(xs)`: اختر من القائمة xs العناصر x التي تحقق 6 ≤ x ≤ 44، اضرب كلًا منها في -3، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `filter_range([18, 40, 5, 34, 39, 43, 0, 8])` يُرجع `[-129, -120, -117, -102, -54, -24]`.\nالجواب:", "qhash": "224fc32c3173230d"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#1", "entry": "pick_between", "reference": "def pick_between(xs):\n return sorted(x * 5 for x in xs if 8 <= x <= 20)", "tests": ["assert pick_between([28, 28, 26, 23, 1, 3, 27]) == []", "assert pick_between([51, 56, 13, 8, 30, -13, 57]) == [40, 65]", "assert pick_between([45, 16, -11, 6, 54, -1, 39, 30, 49]) == [80]", "assert pick_between([6, 35, -17, 55, -26, -3, 42, 22, 40, 6]) == []", "assert pick_between([-25, 11, -1, 5, -23, -20, -22, 53]) == [55]", "assert pick_between([]) == []", "assert pick_between([2, 58, 57, -20, 44]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([28, 28, 26, 23, 1, 3, 27]) == []\nassert pick_between([51, 56, 13, 8, 30, -13, 57]) == [40, 65]\nassert pick_between([45, 16, -11, 6, 54, -1, 39, 30, 49]) == [80]\nassert pick_between([6, 35, -17, 55, -26, -3, 42, 22, 40, 6]) == []\nassert pick_between([-25, 11, -1, 5, -23, -20, -22, 53]) == [55]\nassert pick_between([]) == []\nassert pick_between([2, 58, 57, -20, 44]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n return sorted(x * 5 for x in xs if 8 <= x <= 20)", "completion": " ```python\ndef pick_between(xs):\n return sorted(x * 5 for x in xs if 8 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة بايثون `pick_between(xs)`: اختر من القائمة xs العناصر x التي تحقق 8 ≤ x ≤ 20، اضرب كلًا منها في 5، ثم أعِد النتائج مرتبة تصاعديًا.\nللتوضيح: الاستدعاء `pick_between([28, 28, 26, 23, 1, 3, 27])` يُرجع `[]`.\nالجواب:", "qhash": "45792bb5e8f302f5"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "series", "reference": "def series(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total", "tests": ["assert series(7) == 290080", "assert series(15) == 22992000", "assert series(3) == 2760", "assert series(1) == 10", "assert series(4) == 13000", "assert series(1) == 10", "assert series(0) == 0"], "test_code": "assert series(7) == 290080\nassert series(15) == 22992000\nassert series(3) == 2760\nassert series(1) == 10\nassert series(4) == 13000\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 ** 5\n return total", "completion": " ```python\ndef series(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 5\n return total\n```\n", "buggy": "def series(n):\n total = 0\n for i in range(0, n):\n total += 10 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 10 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef series(n):\n total = 0\n for i in range(0, n):\n total += 10 * i ** 5\n return total\n```\nمثال: `series(7)` يجب أن تُرجع `290080`.\nالجواب:", "qhash": "328e1f8dad9f9220"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#1", "entry": "tally_div", "reference": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 0 and x % 3 != 0:\n count += 1\n return count", "tests": ["assert tally_div([52, 51, 8, 64, 48, 68, 12]) == 2", "assert tally_div([]) == 0", "assert tally_div([22, 49, 36, 21, 11, -34, -3, -38]) == 0", "assert tally_div([38, -15, 75, 55, -32, 32, -7]) == 2", "assert tally_div([20, 64, -25, 6, -29, 35]) == 1", "assert tally_div([61]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([52, 51, 8, 64, 48, 68, 12]) == 2\nassert tally_div([]) == 0\nassert tally_div([22, 49, 36, 21, 11, -34, -3, -38]) == 0\nassert tally_div([38, -15, 75, 55, -32, 32, -7]) == 2\nassert tally_div([20, 64, -25, 6, -29, 35]) == 1\nassert tally_div([61]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n count = 0\n for x in xs:\n if x % 8 == 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 % 8 == 0 and x % 3 != 0:\n count += 1\n return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 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([52, 51, 8, 64, 48, 68, 12])` يُرجع `2`.\nالجواب:", "qhash": "47ff370b1a1f3537"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#1", "code": "text = 'خبز'\nprint(text.count('ت'))\nprint(text[0])\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ntext = 'خبز'\nprint(text.count('ت'))\nprint(text[0])\nprint(text[-1])\n```\nالجواب:", "qhash": "0bd20dcef20dcab7", "answer": "0\nخ\nز", "completion": " الناتج:\n```text\n0\nخ\nز\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#0", "entry": "total_multiples", "reference": "def total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)", "tests": ["assert total_multiples(222) == 9793", "assert total_multiples(96) == 1758", "assert total_multiples(5) == 3", "assert total_multiples(39) == 264", "assert total_multiples(275) == 14988", "assert total_multiples(276) == 14988", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(222) == 9793\nassert total_multiples(96) == 1758\nassert total_multiples(5) == 3\nassert total_multiples(39) == 264\nassert total_multiples(275) == 14988\nassert total_multiples(276) == 14988\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 % 10 == 0)", "completion": " ```python\ndef total_multiples(n):\n return sum(x for x in range(1, n) if x % 3 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة بايثون باسم `total_multiples(n)` تُرجع مجموع الأعداد الصحيحة الموجبة الأصغر من n التي تقبل القسمة على 3 أو على 10.\nمثال: `total_multiples(222)` يجب أن تُرجع `9793`.\nالجواب:", "qhash": "c21e3ab7768b087c"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#1", "code": "def h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(-9))\nprint(h(-9, 11))\nprint(h(h(11), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: توقّع ناتج تنفيذ الشيفرة التالية واكتبه كما يظهر على الشاشة تمامًا:\n```python\ndef h(x, y=3):\n if x > y:\n return x * -2 - y\n return x + y * -2\n\nprint(h(-9))\nprint(h(-9, 11))\nprint(h(h(11), -9))\n```\nالجواب:", "qhash": "290ee6b6020095c6", "answer": "-15\n-31\n-7", "completion": " الناتج:\n```text\n-15\n-31\n-7\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#0", "code": "data = [11, -4, 35, 22, 5, 31, 7, 13]\nprint(data[3:8])\nprint(data[::-1])\nprint(max(data[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndata = [11, -4, 35, 22, 5, 31, 7, 13]\nprint(data[3:8])\nprint(data[::-1])\nprint(max(data[3:8]))\n```\nالجواب:", "qhash": "8093a3d6cf88fef4", "answer": "[22, 5, 31, 7, 13]\n[13, 7, 31, 5, 22, 35, -4, 11]\n31", "completion": " الناتج:\n```text\n[22, 5, 31, 7, 13]\n[13, 7, 31, 5, 22, 35, -4, 11]\n31\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#0", "entry": "select_range", "reference": "def select_range(xs):\n return sorted(x * 3 for x in xs if -1 <= x <= 9)", "tests": ["assert select_range([0, 11, 13, 18, 10, 15, 0]) == [0, 0]", "assert select_range([30, -15]) == []", "assert select_range([16, -17, -10, -20, -1, 30, 10, 0]) == [-3, 0]", "assert select_range([]) == []", "assert select_range([47, 9]) == [27]", "assert select_range([8, -30, 9]) == [24, 27]", "assert select_range([42, 42, 18, 4, -8, 30, 33, 36, -25, -28]) == [12]", "assert select_range([]) == []"], "test_code": "assert select_range([0, 11, 13, 18, 10, 15, 0]) == [0, 0]\nassert select_range([30, -15]) == []\nassert select_range([16, -17, -10, -20, -1, 30, 10, 0]) == [-3, 0]\nassert select_range([]) == []\nassert select_range([47, 9]) == [27]\nassert select_range([8, -30, 9]) == [24, 27]\nassert select_range([42, 42, 18, 4, -8, 30, 33, 36, -25, -28]) == [12]\nassert select_range([]) == []", "answer": "def select_range(xs):\n return sorted(x * 3 for x in xs if -1 <= x <= 9)", "completion": " ```python\ndef select_range(xs):\n return sorted(x * 3 for x in xs if -1 <= x <= 9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `select_range(xs)` تأخذ قائمة أعداد صحيحة وتُرجع قائمة مرتبة تصاعديًا تحتوي حاصل ضرب كل عنصر يقع بين -1 و9 (شاملًا الطرفين) في 3.\nمثال: `select_range([0, 11, 13, 18, 10, 15, 0])` يجب أن تُرجع `[0, 0]`.\nالجواب:", "qhash": "acd7d3e910b922c0"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#0", "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 += 'Tic'\n if i % 6 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out", "tests": ["assert play(29) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26', '27', '28', '29']", "assert play(3) == ['1', '2', '3']", "assert play(14) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13', '14']", "assert play(4) == ['1', '2', '3', '4']", "assert play(13) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13']"], "test_code": "assert play(29) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26', '27', '28', '29']\nassert play(3) == ['1', '2', '3']\nassert play(14) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13', '14']\nassert play(4) == ['1', '2', '3', '4']\nassert play(13) == ['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13']", "answer": "def play(n):\n out = []\n for i in range(1, n + 1):\n s = ''\n if i % 5 == 0:\n s += 'Tic'\n if i % 6 == 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 % 5 == 0:\n s += 'Tic'\n if i % 6 == 0:\n s += 'Tac'\n out.append(s or str(i))\n return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `play(n)` تُرجع قائمة نصوص للأعداد من 1 إلى n: العدد الذي يقبل القسمة على 5 يُستبدل بـ 'Tic'، وعلى 6 بـ 'Tac'، وعلى كليهما بـ 'TicTac'، وإلا يُكتب العدد نفسه نصًا.\nمثال: `play(29)` يجب أن تُرجع `['1', '2', '3', '4', 'Tic', 'Tac', '7', '8', '9', 'Tic', '11', 'Tac', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic', '21', '22', '23', 'Tac', 'Tic', '26', '27', '28', '29']`.\nالجواب:", "qhash": "ab600a5cdc53d340"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#0", "entry": "cycle", "reference": "def cycle(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return lst[k:] + lst[:k]", "tests": ["assert cycle([27, 44, 49]) == [27, 44, 49]", "assert cycle([14]) == [14]", "assert cycle([10, 12, 40, 17]) == [17, 10, 12, 40]", "assert cycle([35, 15, -7, 0, -9, -1, 10, 23, 24]) == [0, -9, -1, 10, 23, 24, 35, 15, -7]", "assert cycle([25, 21, 8, 46]) == [46, 25, 21, 8]", "assert cycle([11, 33, 29, 18, 20, 25, 24, 48, -4, 1, 1, 4]) == [18, 20, 25, 24, 48, -4, 1, 1, 4, 11, 33, 29]", "assert cycle([]) == []"], "test_code": "assert cycle([27, 44, 49]) == [27, 44, 49]\nassert cycle([14]) == [14]\nassert cycle([10, 12, 40, 17]) == [17, 10, 12, 40]\nassert cycle([35, 15, -7, 0, -9, -1, 10, 23, 24]) == [0, -9, -1, 10, 23, 24, 35, 15, -7]\nassert cycle([25, 21, 8, 46]) == [46, 25, 21, 8]\nassert cycle([11, 33, 29, 18, 20, 25, 24, 48, -4, 1, 1, 4]) == [18, 20, 25, 24, 48, -4, 1, 1, 4, 11, 33, 29]\nassert cycle([]) == []", "answer": "def cycle(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return lst[k:] + lst[:k]", "completion": " ```python\ndef cycle(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أكمل الدالة التالية بوضع التعبير المناسب مكان ____ بحيث تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة)، ثم اكتب الدالة كاملة.\n```python\ndef cycle(lst):\n if not lst:\n return []\n k = 3 % len(lst)\n return ____\n```\nمثال: `cycle([27, 44, 49])` يجب أن تُرجع `[27, 44, 49]`.\nالجواب:", "qhash": "65ca608fd6980d67"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#0", "code": "def g(x, y=9):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(g(18))\nprint(g(18, -2))\nprint(g(g(-2), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\ndef g(x, y=9):\n if x > y:\n return x * -4 - y\n return x + y * -4\n\nprint(g(18))\nprint(g(18, -2))\nprint(g(g(-2), 18))\n```\nالجواب:", "qhash": "d99ab8b501c2b759", "answer": "-81\n-70\n-110", "completion": " الناتج:\n```text\n-81\n-70\n-110\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#1", "entry": "quad", "reference": "def quad(x):\n return -5 * x ** 2 + (-3) * x + (-9)", "tests": ["assert quad(3) == -63", "assert quad(-16) == -1241", "assert quad(-5) == -119", "assert quad(17) == -1505", "assert quad(15) == -1179", "assert quad(-15) == -1089", "assert quad(7) == -275", "assert quad(0) == -9"], "test_code": "assert quad(3) == -63\nassert quad(-16) == -1241\nassert quad(-5) == -119\nassert quad(17) == -1505\nassert quad(15) == -1179\nassert quad(-15) == -1089\nassert quad(7) == -275\nassert quad(0) == -9", "answer": "def quad(x):\n return -5 * x ** 2 + (-3) * x + (-9)", "completion": " ```python\ndef quad(x):\n return -5 * x ** 2 + (-3) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: أنشئ دالة `quad(x)` تحسب المقدار -5x² - 3x - 9 لقيمة x المعطاة وتُرجع الناتج عددًا صحيحًا.\nللتوضيح: الاستدعاء `quad(3)` يُرجع `-63`.\nالجواب:", "qhash": "55ebb7badaaaebba"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#0", "code": "nums = [39, 40, -7, 6, 1]\nprint(sorted(nums, key=lambda x: (abs(x - 1), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nnums = [39, 40, -7, 6, 1]\nprint(sorted(nums, key=lambda x: (abs(x - 1), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "efe180c8ccf27ee2", "answer": "[1, 6, -7, 39, 40]\n[40, 39, 6]", "completion": " الناتج:\n```text\n[1, 6, -7, 39, 40]\n[40, 39, 6]\n```\n"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#0", "entry": "sum_terms", "reference": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "tests": ["assert sum_terms(7) == 116032", "assert sum_terms(8) == 247104", "assert sum_terms(15) == 9196800", "assert sum_terms(14) == 6159300", "assert sum_terms(13) == 4008004", "assert sum_terms(1) == 4", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(7) == 116032\nassert sum_terms(8) == 247104\nassert sum_terms(15) == 9196800\nassert sum_terms(14) == 6159300\nassert sum_terms(13) == 4008004\nassert sum_terms(1) == 4\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total", "completion": " ```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total += 4 * i ** 5\n return total\n```\n", "buggy": "def sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 5\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: الدالة التالية يُفترض أن تُرجع مجموع 4 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)، لكنها تحتوي على خطأ برمجي. أصلح الخطأ واكتب الدالة الصحيحة كاملة.\n```python\ndef sum_terms(n):\n total = 0\n for i in range(1, n + 1):\n total = 4 * i ** 5\n return total\n```\nمثال: `sum_terms(7)` يجب أن تُرجع `116032`.\nالجواب:", "qhash": "141c4813c1d4fdb2"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#1", "entry": "mfact", "reference": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43", "tests": ["assert mfact(10) == 22", "assert mfact(22) == 42", "assert mfact(59) == 14", "assert mfact(44) == 39", "assert mfact(13) == 28", "assert mfact(54) == 33", "assert mfact(0) == 1"], "test_code": "assert mfact(10) == 22\nassert mfact(22) == 42\nassert mfact(59) == 14\nassert mfact(44) == 39\nassert mfact(13) == 28\nassert mfact(54) == 33\nassert mfact(0) == 1", "answer": "def mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43", "completion": " ```python\ndef mfact(n):\n if n <= 0:\n return 1\n return (n * mfact(n - 3)) % 43\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الدالة الآتية جزء ناقص مكتوب ____. املأه لكي تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 43 في كل خطوة (وتُرجع 1 عندما n ≤ 0)، واكتب الدالة بعد إكمالها.\n```python\ndef mfact(n):\n if n <= 0:\n return 1\n return ____\n```\nللتوضيح: الاستدعاء `mfact(10)` يُرجع `22`.\nالجواب:", "qhash": "32f3f8d150aefc85"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#1", "entry": "total_pow", "reference": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total", "tests": ["assert total_pow(5) == 9790", "assert total_pow(15) == 1783120", "assert total_pow(5) == 9790", "assert total_pow(15) == 1783120", "assert total_pow(5) == 9790", "assert total_pow(1) == 10", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 9790\nassert total_pow(15) == 1783120\nassert total_pow(5) == 9790\nassert total_pow(15) == 1783120\nassert total_pow(5) == 9790\nassert total_pow(1) == 10\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total", "completion": " ```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total += 10 * i ** 4\n return total\n```\n", "buggy": "def total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 10 * i ** 4\n return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: في الشيفرة الآتية خطأ يجعل الدالة لا تعمل كما يجب. المطلوب منها أن تُرجع مجموع 10 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n). اكتشف الخطأ وأعد كتابة الدالة بعد إصلاحه.\n```python\ndef total_pow(n):\n total = 0\n for i in range(1, n + 1):\n total = 10 * i ** 4\n return total\n```\nللتوضيح: الاستدعاء `total_pow(5)` يُرجع `9790`.\nالجواب:", "qhash": "aa03af9a246c7bcd"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#1", "entry": "count_ar", "reference": "def count_ar(text):\n return sum(1 for w in text.split() if w.startswith('ن'))", "tests": ["assert count_ar('سلام فجر نهر شجرة') == 1", "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('سلام فجر نهر شجرة') == 1\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)` بحيث تُعيد عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ن»، حيث text سلسلة نصية بالعربية.\nللتوضيح: الاستدعاء `count_ar('سلام فجر نهر شجرة')` يُرجع `1`.\nالجواب:", "qhash": "59d044a3374cbf7b"} {"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#0", "code": "d = {'زينب': 28, 'راشد': 8, 'هشام': 43, 'حسن': 29, 'هدى': 31}\nd['هدى'] += 3\nd['ليلى'] = 60\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 17])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: ما الذي يطبعه برنامج بايثون التالي؟\n```python\nd = {'زينب': 28, 'راشد': 8, 'هشام': 43, 'حسن': 29, 'هدى': 31}\nd['هدى'] += 3\nd['ليلى'] = 60\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 17])\n```\nالجواب:", "qhash": "cd57305dd727c86e", "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": "math", "template": "w_coprime#0", "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, 9) == 1)", "tests": ["assert phi_upto(44) == 30", "assert phi_upto(78) == 52", "assert phi_upto(129) == 86", "assert phi_upto(53) == 36", "assert phi_upto(15) == 10", "assert phi_upto(133) == 89", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(44) == 30\nassert phi_upto(78) == 52\nassert phi_upto(129) == 86\nassert phi_upto(53) == 36\nassert phi_upto(15) == 10\nassert phi_upto(133) == 89\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, 9) == 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, 9) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: اكتب دالة `phi_upto(n)` تُرجع عدد الأعداد الصحيحة i في المدى من 1 إلى n (شاملًا) التي تكون أولية نسبيًا مع 9، أي أن القاسم المشترك الأكبر لها مع 9 يساوي 1.\nمثال: `phi_upto(44)` يجب أن تُرجع `30`.\nالجواب:", "qhash": "c05c4f6ccbb178e0"}